diff --git a/README.md b/README.md index dace7f26..5f75195f 100644 --- a/README.md +++ b/README.md @@ -1,6 +1,6 @@ # 力扣题库（完整版） -> 最后更新日期： **2024.05.16** +> 最后更新日期： **2024.06.05** > > 使用脚本前请务必仔细完整阅读本 `README.md` 文件 diff --git a/leetcode-cn/origin-data.json b/leetcode-cn/origin-data.json index 09a2f4ff..87bfeeac 100644 --- a/leetcode-cn/origin-data.json +++ b/leetcode-cn/origin-data.json @@ -1,7 +1,7 @@ { "user_name": "", "num_solved": 0, - "num_total": 3538, + "num_total": 3560, "ac_easy": 0, "ac_medium": 0, "ac_hard": 0, @@ -12,9 +12,9 @@ "question__title": "万灵之树", "question__title_slug": "cnHoX6", "question__hide": false, - "total_acs": 438, - "total_submitted": 2353, - "total_column_articles": 7, + "total_acs": 459, + "total_submitted": 2384, + "total_column_articles": 8, "frontend_question_id": "LCP 82", "is_new_question": false }, @@ -33,8 +33,8 @@ "question__title": "与非的谜题", "question__title_slug": "ryfUiz", "question__hide": false, - "total_acs": 755, - "total_submitted": 1597, + "total_acs": 758, + "total_submitted": 1603, "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": 1074, - "total_submitted": 2052, + "total_acs": 1090, + "total_submitted": 2074, "total_column_articles": 15, "frontend_question_id": "LCP 80", "is_new_question": false @@ -75,8 +75,8 @@ "question__title": "提取咒文", "question__title_slug": "kjpLFZ", "question__hide": false, - "total_acs": 1748, - "total_submitted": 5796, + "total_acs": 1774, + "total_submitted": 5875, "total_column_articles": 19, "frontend_question_id": "LCP 79", "is_new_question": false @@ -96,8 +96,8 @@ "question__title": "城墙防线", "question__title_slug": "Nsibyl", "question__hide": false, - "total_acs": 1709, - "total_submitted": 3791, + "total_acs": 1716, + "total_submitted": 3800, "total_column_articles": 26, "frontend_question_id": "LCP 78", "is_new_question": false @@ -117,9 +117,9 @@ "question__title": "符文储备", "question__title_slug": "W2ZX4X", "question__hide": false, - "total_acs": 3461, - "total_submitted": 5075, - "total_column_articles": 40, + "total_acs": 3536, + "total_submitted": 5176, + "total_column_articles": 41, "frontend_question_id": "LCP 77", "is_new_question": false }, @@ -138,8 +138,8 @@ "question__title": "魔法棋盘", "question__title_slug": "1ybDKD", "question__hide": false, - "total_acs": 803, - "total_submitted": 2092, + "total_acs": 811, + "total_submitted": 2111, "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": 1005, - "total_submitted": 2634, + "total_acs": 1013, + "total_submitted": 2647, "total_column_articles": 16, "frontend_question_id": "LCP 75", "is_new_question": false @@ -180,8 +180,8 @@ "question__title": "最强祝福力场", "question__title_slug": "xepqZ5", "question__hide": false, - "total_acs": 2591, - "total_submitted": 8170, + "total_acs": 2641, + "total_submitted": 8284, "total_column_articles": 40, "frontend_question_id": "LCP 74", "is_new_question": false @@ -201,8 +201,8 @@ "question__title": "探险营地", "question__title_slug": "0Zeoeg", "question__hide": false, - "total_acs": 3480, - "total_submitted": 7621, + "total_acs": 3487, + "total_submitted": 7628, "total_column_articles": 27, "frontend_question_id": "LCP 73", "is_new_question": false @@ -222,8 +222,8 @@ "question__title": "补给马车", "question__title_slug": "hqCnmP", "question__hide": false, - "total_acs": 4628, - "total_submitted": 6847, + "total_acs": 4696, + "total_submitted": 6926, "total_column_articles": 49, "frontend_question_id": "LCP 72", "is_new_question": false @@ -243,8 +243,8 @@ "question__title": "集水器", "question__title_slug": "kskhHQ", "question__hide": false, - "total_acs": 688, - "total_submitted": 1200, + "total_acs": 699, + "total_submitted": 1211, "total_column_articles": 11, "frontend_question_id": "LCP 71", "is_new_question": false @@ -264,8 +264,8 @@ "question__title": "沙地治理", "question__title_slug": "XxZZjK", "question__hide": false, - "total_acs": 744, - "total_submitted": 2443, + "total_acs": 753, + "total_submitted": 2457, "total_column_articles": 17, "frontend_question_id": "LCP 70", "is_new_question": false @@ -285,9 +285,9 @@ "question__title": "Hello LeetCode!", "question__title_slug": "rMeRt2", "question__hide": false, - "total_acs": 1538, - "total_submitted": 4185, - "total_column_articles": 25, + "total_acs": 1564, + "total_submitted": 4228, + "total_column_articles": 26, "frontend_question_id": "LCP 69", "is_new_question": false }, @@ -306,9 +306,9 @@ "question__title": "美观的花束", "question__title_slug": "1GxJYY", "question__hide": false, - "total_acs": 3818, - "total_submitted": 7310, - "total_column_articles": 55, + "total_acs": 3892, + "total_submitted": 7399, + "total_column_articles": 58, "frontend_question_id": "LCP 68", "is_new_question": false }, @@ -327,8 +327,8 @@ "question__title": "装饰树", "question__title_slug": "KnLfVT", "question__hide": false, - "total_acs": 7148, - "total_submitted": 8287, + "total_acs": 7248, + "total_submitted": 8393, "total_column_articles": 103, "frontend_question_id": "LCP 67", "is_new_question": false @@ -348,9 +348,9 @@ "question__title": "最小展台数量", "question__title_slug": "600YaG", "question__hide": false, - "total_acs": 6903, - "total_submitted": 8894, - "total_column_articles": 106, + "total_acs": 6990, + "total_submitted": 8999, + "total_column_articles": 107, "frontend_question_id": "LCP 66", "is_new_question": false }, @@ -369,9 +369,9 @@ "question__title": "弹珠游戏", "question__title_slug": "EXvqDp", "question__hide": false, - "total_acs": 4462, - "total_submitted": 16186, - "total_column_articles": 126, + "total_acs": 4486, + "total_submitted": 16237, + "total_column_articles": 127, "frontend_question_id": "LCP 63", "is_new_question": false }, @@ -390,8 +390,8 @@ "question__title": "二叉树灯饰", "question__title_slug": "U7WvvU", "question__hide": false, - "total_acs": 2477, - "total_submitted": 6585, + "total_acs": 2491, + "total_submitted": 6643, "total_column_articles": 56, "frontend_question_id": "LCP 64", "is_new_question": false @@ -411,9 +411,9 @@ "question__title": "舒适的湿度", "question__title_slug": "3aqs1c", "question__hide": false, - "total_acs": 1167, - "total_submitted": 2449, - "total_column_articles": 18, + "total_acs": 1185, + "total_submitted": 2470, + "total_column_articles": 19, "frontend_question_id": "LCP 65", "is_new_question": false }, @@ -432,9 +432,9 @@ "question__title": "交通枢纽", "question__title_slug": "D9PW8w", "question__hide": false, - "total_acs": 6659, - "total_submitted": 10537, - "total_column_articles": 79, + "total_acs": 6723, + "total_submitted": 10612, + "total_column_articles": 80, "frontend_question_id": "LCP 62", "is_new_question": false }, @@ -453,8 +453,8 @@ "question__title": "气温变化趋势", "question__title_slug": "6CE719", "question__hide": false, - "total_acs": 8689, - "total_submitted": 14107, + "total_acs": 8730, + "total_submitted": 14163, "total_column_articles": 95, "frontend_question_id": "LCP 61", "is_new_question": false @@ -474,9 +474,9 @@ "question__title": "积木拼接", "question__title_slug": "De4qBB", "question__hide": false, - "total_acs": 505, - "total_submitted": 1360, - "total_column_articles": 20, + "total_acs": 519, + "total_submitted": 1385, + "total_column_articles": 21, "frontend_question_id": "LCP 58", "is_new_question": false }, @@ -495,8 +495,8 @@ "question__title": "力扣泡泡龙", "question__title_slug": "WInSav", "question__hide": false, - "total_acs": 1102, - "total_submitted": 5336, + "total_acs": 1105, + "total_submitted": 5354, "total_column_articles": 28, "frontend_question_id": "LCP 60", "is_new_question": false @@ -516,8 +516,8 @@ "question__title": "搭桥过河", "question__title_slug": "NfY1m5", "question__hide": false, - "total_acs": 419, - "total_submitted": 1725, + "total_acs": 423, + "total_submitted": 1733, "total_column_articles": 10, "frontend_question_id": "LCP 59", "is_new_question": false @@ -537,9 +537,9 @@ "question__title": "打地鼠", "question__title_slug": "ZbAuEH", "question__hide": false, - "total_acs": 2321, - "total_submitted": 8350, - "total_column_articles": 49, + "total_acs": 2343, + "total_submitted": 8386, + "total_column_articles": 48, "frontend_question_id": "LCP 57", "is_new_question": false }, @@ -558,9 +558,9 @@ "question__title": "信物传送", "question__title_slug": "6UEx57", "question__hide": false, - "total_acs": 3062, - "total_submitted": 6719, - "total_column_articles": 82, + "total_acs": 3111, + "total_submitted": 6790, + "total_column_articles": 83, "frontend_question_id": "LCP 56", "is_new_question": false }, @@ -579,8 +579,8 @@ "question__title": "采集果实", "question__title_slug": "PTXy4P", "question__hide": false, - "total_acs": 6561, - "total_submitted": 8908, + "total_acs": 6642, + "total_submitted": 9010, "total_column_articles": 86, "frontend_question_id": "LCP 55", "is_new_question": false @@ -600,8 +600,8 @@ "question__title": "夺回据点", "question__title_slug": "s5kipK", "question__hide": false, - "total_acs": 829, - "total_submitted": 1992, + "total_acs": 836, + "total_submitted": 2001, "total_column_articles": 14, "frontend_question_id": "LCP 54", "is_new_question": false @@ -621,9 +621,9 @@ "question__title": "守护太空城", "question__title_slug": "EJvmW4", "question__hide": false, - "total_acs": 1152, - "total_submitted": 2454, - "total_column_articles": 21, + "total_acs": 1158, + "total_submitted": 2463, + "total_column_articles": 22, "frontend_question_id": "LCP 53", "is_new_question": false }, @@ -642,8 +642,8 @@ "question__title": "二叉搜索树染色", "question__title_slug": "QO5KpG", "question__hide": false, - "total_acs": 4864, - "total_submitted": 16349, + "total_acs": 4898, + "total_submitted": 16411, "total_column_articles": 102, "frontend_question_id": "LCP 52", "is_new_question": false @@ -663,9 +663,9 @@ "question__title": "烹饪料理", "question__title_slug": "UEcfPD", "question__hide": false, - "total_acs": 6733, - "total_submitted": 13731, - "total_column_articles": 147, + "total_acs": 6855, + "total_submitted": 13906, + "total_column_articles": 151, "frontend_question_id": "LCP 51", "is_new_question": false }, @@ -684,8 +684,8 @@ "question__title": "宝石补给", "question__title_slug": "WHnhjV", "question__hide": false, - "total_acs": 33224, - "total_submitted": 44160, + "total_acs": 33297, + "total_submitted": 44262, "total_column_articles": 183, "frontend_question_id": "LCP 50", "is_new_question": false @@ -705,8 +705,8 @@ "question__title": "自行车炫技赛场", "question__title_slug": "kplEvH", "question__hide": false, - "total_acs": 3058, - "total_submitted": 9976, + "total_acs": 3077, + "total_submitted": 10027, "total_column_articles": 64, "frontend_question_id": "LCP 45", "is_new_question": false @@ -726,8 +726,8 @@ "question__title": "无限棋局", "question__title_slug": "fsa7oZ", "question__hide": false, - "total_acs": 1066, - "total_submitted": 3894, + "total_acs": 1076, + "total_submitted": 3913, "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": 2126, - "total_submitted": 4558, + "total_acs": 2136, + "total_submitted": 4571, "total_column_articles": 48, "frontend_question_id": "LCP 46", "is_new_question": false @@ -768,8 +768,8 @@ "question__title": "玩具套圈", "question__title_slug": "vFjcfV", "question__hide": false, - "total_acs": 2798, - "total_submitted": 9735, + "total_acs": 2809, + "total_submitted": 9763, "total_column_articles": 50, "frontend_question_id": "LCP 42", "is_new_question": false @@ -789,8 +789,8 @@ "question__title": "黑白翻转棋", "question__title_slug": "fHi6rV", "question__hide": false, - "total_acs": 12036, - "total_submitted": 17639, + "total_acs": 12055, + "total_submitted": 17663, "total_column_articles": 147, "frontend_question_id": "LCP 41", "is_new_question": false @@ -810,8 +810,8 @@ "question__title": "无人机方阵", "question__title_slug": "0jQkd0", "question__hide": false, - "total_acs": 10069, - "total_submitted": 18134, + "total_acs": 10104, + "total_submitted": 18188, "total_column_articles": 102, "frontend_question_id": "LCP 39", "is_new_question": false @@ -831,9 +831,9 @@ "question__title": "心算挑战", "question__title_slug": "uOAnQW", "question__hide": false, - "total_acs": 10737, - "total_submitted": 33741, - "total_column_articles": 202, + "total_acs": 10816, + "total_submitted": 33948, + "total_column_articles": 203, "frontend_question_id": "LCP 40", "is_new_question": false }, @@ -852,8 +852,8 @@ "question__title": "十字路口的交通", "question__title_slug": "Y1VbOX", "question__hide": false, - "total_acs": 1386, - "total_submitted": 2664, + "total_acs": 1389, + "total_submitted": 2671, "total_column_articles": 31, "frontend_question_id": "LCP 43", "is_new_question": false @@ -873,9 +873,9 @@ "question__title": "开幕式焰火", "question__title_slug": "sZ59z6", "question__hide": false, - "total_acs": 17611, - "total_submitted": 22507, - "total_column_articles": 254, + "total_acs": 17759, + "total_submitted": 22692, + "total_column_articles": 255, "frontend_question_id": "LCP 44", "is_new_question": false }, @@ -894,9 +894,9 @@ "question__title": "入场安检", "question__title_slug": "oPs9Bm", "question__hide": false, - "total_acs": 2063, - "total_submitted": 4393, - "total_column_articles": 41, + "total_acs": 2106, + "total_submitted": 4452, + "total_column_articles": 42, "frontend_question_id": "LCP 47", "is_new_question": false }, @@ -915,8 +915,8 @@ "question__title": "环形闯关游戏", "question__title_slug": "K8GULz", "question__hide": false, - "total_acs": 1354, - "total_submitted": 3397, + "total_acs": 1446, + "total_submitted": 3577, "total_column_articles": 22, "frontend_question_id": "LCP 49", "is_new_question": false @@ -936,9 +936,9 @@ "question__title": "省份数量", "question__title_slug": "bLyHh0", "question__hide": false, - "total_acs": 27054, - "total_submitted": 40464, - "total_column_articles": 247, + "total_acs": 27267, + "total_submitted": 40768, + "total_column_articles": 248, "frontend_question_id": "LCR 116", "is_new_question": false }, @@ -957,8 +957,8 @@ "question__title": "不同路径", "question__title_slug": "2AoeFn", "question__hide": false, - "total_acs": 26298, - "total_submitted": 34866, + "total_acs": 26620, + "total_submitted": 35315, "total_column_articles": 247, "frontend_question_id": "LCR 098", "is_new_question": false @@ -978,8 +978,8 @@ "question__title": "组合", "question__title_slug": "uUsW3B", "question__hide": false, - "total_acs": 35505, - "total_submitted": 43236, + "total_acs": 35838, + "total_submitted": 43623, "total_column_articles": 231, "frontend_question_id": "LCR 080", "is_new_question": false @@ -999,9 +999,9 @@ "question__title": "子集", "question__title_slug": "TVdhkn", "question__hide": false, - "total_acs": 38153, - "total_submitted": 45053, - "total_column_articles": 352, + "total_acs": 38507, + "total_submitted": 45542, + "total_column_articles": 356, "frontend_question_id": "LCR 079", "is_new_question": false }, @@ -1020,9 +1020,9 @@ "question__title": "合并 K 个升序链表", "question__title_slug": "vvXgSW", "question__hide": false, - "total_acs": 38819, - "total_submitted": 59856, - "total_column_articles": 317, + "total_acs": 39154, + "total_submitted": 60344, + "total_column_articles": 318, "frontend_question_id": "LCR 078", "is_new_question": false }, @@ -1041,9 +1041,9 @@ "question__title": "排序链表", "question__title_slug": "7WHec2", "question__hide": false, - "total_acs": 47636, - "total_submitted": 77228, - "total_column_articles": 414, + "total_acs": 48129, + "total_submitted": 78056, + "total_column_articles": 415, "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": 59648, - "total_submitted": 91400, + "total_acs": 60283, + "total_submitted": 92408, "total_column_articles": 350, "frontend_question_id": "LCR 076", "is_new_question": false @@ -1083,8 +1083,8 @@ "question__title": "数组的相对排序", "question__title_slug": "0H97ZC", "question__hide": false, - "total_acs": 31497, - "total_submitted": 45407, + "total_acs": 31699, + "total_submitted": 45714, "total_column_articles": 375, "frontend_question_id": "LCR 075", "is_new_question": false @@ -1104,9 +1104,9 @@ "question__title": "合并区间", "question__title_slug": "SsGoHC", "question__hide": false, - "total_acs": 35649, - "total_submitted": 63891, - "total_column_articles": 288, + "total_acs": 36015, + "total_submitted": 64501, + "total_column_articles": 291, "frontend_question_id": "LCR 074", "is_new_question": false }, @@ -1125,8 +1125,8 @@ "question__title": "爱吃香蕉的狒狒", "question__title_slug": "nZZqjQ", "question__hide": false, - "total_acs": 27066, - "total_submitted": 50711, + "total_acs": 27240, + "total_submitted": 51043, "total_column_articles": 206, "frontend_question_id": "LCR 073", "is_new_question": false @@ -1146,9 +1146,9 @@ "question__title": "x 的平方根", "question__title_slug": "jJ0w9p", "question__hide": false, - "total_acs": 44654, - "total_submitted": 104065, - "total_column_articles": 277, + "total_acs": 45000, + "total_submitted": 104854, + "total_column_articles": 279, "frontend_question_id": "LCR 072", "is_new_question": false }, @@ -1167,8 +1167,8 @@ "question__title": "按权重随机选择", "question__title_slug": "cuyjEf", "question__hide": false, - "total_acs": 18851, - "total_submitted": 37604, + "total_acs": 18950, + "total_submitted": 37761, "total_column_articles": 118, "frontend_question_id": "LCR 071", "is_new_question": false @@ -1188,8 +1188,8 @@ "question__title": "有序数组中的单一元素", "question__title_slug": "skFtm2", "question__hide": false, - "total_acs": 35451, - "total_submitted": 58301, + "total_acs": 35707, + "total_submitted": 58748, "total_column_articles": 302, "frontend_question_id": "LCR 070", "is_new_question": false @@ -1209,8 +1209,8 @@ "question__title": "山脉数组的峰顶索引", "question__title_slug": "B1IidL", "question__hide": false, - "total_acs": 73023, - "total_submitted": 103099, + "total_acs": 73376, + "total_submitted": 103572, "total_column_articles": 641, "frontend_question_id": "LCR 069", "is_new_question": false @@ -1230,8 +1230,8 @@ "question__title": "搜索插入位置", "question__title_slug": "N6YdxV", "question__hide": false, - "total_acs": 37453, - "total_submitted": 77300, + "total_acs": 37784, + "total_submitted": 77976, "total_column_articles": 306, "frontend_question_id": "LCR 068", "is_new_question": false @@ -1251,8 +1251,8 @@ "question__title": "数组中两个数的最大异或值", "question__title_slug": "ms70jA", "question__hide": false, - "total_acs": 16564, - "total_submitted": 25353, + "total_acs": 16638, + "total_submitted": 25472, "total_column_articles": 166, "frontend_question_id": "LCR 067", "is_new_question": false @@ -1272,8 +1272,8 @@ "question__title": " 键值映射", "question__title_slug": "z1R5dt", "question__hide": false, - "total_acs": 18119, - "total_submitted": 28141, + "total_acs": 18201, + "total_submitted": 28252, "total_column_articles": 245, "frontend_question_id": "LCR 066", "is_new_question": false @@ -1293,8 +1293,8 @@ "question__title": "单词的压缩编码", "question__title_slug": "iSwD2y", "question__hide": false, - "total_acs": 18451, - "total_submitted": 29250, + "total_acs": 18531, + "total_submitted": 29392, "total_column_articles": 186, "frontend_question_id": "LCR 065", "is_new_question": false @@ -1314,9 +1314,9 @@ "question__title": "实现一个魔法字典", "question__title_slug": "US1pGT", "question__hide": false, - "total_acs": 18143, - "total_submitted": 29687, - "total_column_articles": 183, + "total_acs": 18223, + "total_submitted": 29833, + "total_column_articles": 184, "frontend_question_id": "LCR 064", "is_new_question": false }, @@ -1335,9 +1335,9 @@ "question__title": "单词替换", "question__title_slug": "UhWRSj", "question__hide": false, - "total_acs": 23133, - "total_submitted": 32539, - "total_column_articles": 276, + "total_acs": 23267, + "total_submitted": 32692, + "total_column_articles": 277, "frontend_question_id": "LCR 063", "is_new_question": false }, @@ -1356,9 +1356,9 @@ "question__title": "查找和最小的 K 对数字", "question__title_slug": "qn8gGX", "question__hide": false, - "total_acs": 23306, - "total_submitted": 43982, - "total_column_articles": 198, + "total_acs": 23436, + "total_submitted": 44235, + "total_column_articles": 199, "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": 27230, - "total_submitted": 36220, + "total_acs": 27420, + "total_submitted": 36479, "total_column_articles": 222, "frontend_question_id": "LCR 062", "is_new_question": false @@ -1398,9 +1398,9 @@ "question__title": "前 K 个高频元素", "question__title_slug": "g5c51o", "question__hide": false, - "total_acs": 31735, - "total_submitted": 46684, - "total_column_articles": 297, + "total_acs": 31979, + "total_submitted": 47073, + "total_column_articles": 300, "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": 27638, - "total_submitted": 44271, + "total_acs": 27800, + "total_submitted": 44495, "total_column_articles": 218, "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": 21281, - "total_submitted": 34782, + "total_acs": 21396, + "total_submitted": 34962, "total_column_articles": 187, "frontend_question_id": "LCR 058", "is_new_question": false @@ -1461,8 +1461,8 @@ "question__title": "存在重复元素 III", "question__title_slug": "7WqeDu", "question__hide": false, - "total_acs": 22955, - "total_submitted": 66797, + "total_acs": 23093, + "total_submitted": 67230, "total_column_articles": 156, "frontend_question_id": "LCR 057", "is_new_question": false @@ -1482,9 +1482,9 @@ "question__title": "最长连续序列", "question__title_slug": "WhsWhI", "question__hide": false, - "total_acs": 32525, - "total_submitted": 67293, - "total_column_articles": 270, + "total_acs": 32818, + "total_submitted": 67897, + "total_column_articles": 272, "frontend_question_id": "LCR 119", "is_new_question": false }, @@ -1503,8 +1503,8 @@ "question__title": "两数之和 IV - 输入二叉搜索树", "question__title_slug": "opLdQZ", "question__hide": false, - "total_acs": 35855, - "total_submitted": 48762, + "total_acs": 35995, + "total_submitted": 48939, "total_column_articles": 330, "frontend_question_id": "LCR 056", "is_new_question": false @@ -1524,8 +1524,8 @@ "question__title": "冗余连接", "question__title_slug": "7LpjUW", "question__hide": false, - "total_acs": 13735, - "total_submitted": 19783, + "total_acs": 13833, + "total_submitted": 19909, "total_column_articles": 139, "frontend_question_id": "LCR 118", "is_new_question": false @@ -1545,8 +1545,8 @@ "question__title": "相似字符串组", "question__title_slug": "H6lPxb", "question__hide": false, - "total_acs": 11291, - "total_submitted": 18292, + "total_acs": 11368, + "total_submitted": 18414, "total_column_articles": 108, "frontend_question_id": "LCR 117", "is_new_question": false @@ -1566,8 +1566,8 @@ "question__title": "二叉搜索树迭代器", "question__title_slug": "kTOapQ", "question__hide": false, - "total_acs": 24387, - "total_submitted": 28670, + "total_acs": 24497, + "total_submitted": 28800, "total_column_articles": 214, "frontend_question_id": "LCR 055", "is_new_question": false @@ -1587,8 +1587,8 @@ "question__title": "把二叉搜索树转换为累加树", "question__title_slug": "w6cpku", "question__hide": false, - "total_acs": 30595, - "total_submitted": 35871, + "total_acs": 30795, + "total_submitted": 36113, "total_column_articles": 305, "frontend_question_id": "LCR 054", "is_new_question": false @@ -1608,8 +1608,8 @@ "question__title": "序列重建", "question__title_slug": "ur2n8P", "question__hide": false, - "total_acs": 27112, - "total_submitted": 52746, + "total_acs": 27206, + "total_submitted": 52933, "total_column_articles": 294, "frontend_question_id": "LCR 115", "is_new_question": false @@ -1629,8 +1629,8 @@ "question__title": "二叉搜索树中的中序后继", "question__title_slug": "P5rCT8", "question__hide": false, - "total_acs": 37244, - "total_submitted": 59178, + "total_acs": 37426, + "total_submitted": 59471, "total_column_articles": 310, "frontend_question_id": "LCR 053", "is_new_question": false @@ -1650,9 +1650,9 @@ "question__title": "火星词典", "question__title_slug": "Jf1JuT", "question__hide": false, - "total_acs": 23414, - "total_submitted": 46233, - "total_column_articles": 226, + "total_acs": 23562, + "total_submitted": 46510, + "total_column_articles": 228, "frontend_question_id": "LCR 114", "is_new_question": false }, @@ -1671,8 +1671,8 @@ "question__title": "递增顺序搜索树", "question__title_slug": "NYBBNL", "question__hide": false, - "total_acs": 35825, - "total_submitted": 48811, + "total_acs": 36052, + "total_submitted": 49101, "total_column_articles": 311, "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": 18319, - "total_submitted": 32464, - "total_column_articles": 168, + "total_acs": 18458, + "total_submitted": 32714, + "total_column_articles": 169, "frontend_question_id": "LCR 113", "is_new_question": false }, @@ -1713,8 +1713,8 @@ "question__title": "二叉树中的最大路径和", "question__title_slug": "jC7MId", "question__hide": false, - "total_acs": 25367, - "total_submitted": 52188, + "total_acs": 25571, + "total_submitted": 52655, "total_column_articles": 183, "frontend_question_id": "LCR 051", "is_new_question": false @@ -1734,9 +1734,9 @@ "question__title": "矩阵中的最长递增路径", "question__title_slug": "fpTFWP", "question__hide": false, - "total_acs": 16524, - "total_submitted": 28733, - "total_column_articles": 145, + "total_acs": 16636, + "total_submitted": 28948, + "total_column_articles": 146, "frontend_question_id": "LCR 112", "is_new_question": false }, @@ -1755,9 +1755,9 @@ "question__title": "路径总和 III", "question__title_slug": "6eUYwP", "question__hide": false, - "total_acs": 30264, - "total_submitted": 61004, - "total_column_articles": 238, + "total_acs": 30438, + "total_submitted": 61443, + "total_column_articles": 241, "frontend_question_id": "LCR 050", "is_new_question": false }, @@ -1776,9 +1776,9 @@ "question__title": "求根节点到叶节点数字之和", "question__title_slug": "3Etpl5", "question__hide": false, - "total_acs": 34882, - "total_submitted": 47352, - "total_column_articles": 315, + "total_acs": 35055, + "total_submitted": 47633, + "total_column_articles": 317, "frontend_question_id": "LCR 049", "is_new_question": false }, @@ -1797,9 +1797,9 @@ "question__title": "除法求值", "question__title_slug": "vlzXQL", "question__hide": false, - "total_acs": 10686, - "total_submitted": 16543, - "total_column_articles": 128, + "total_acs": 10764, + "total_submitted": 16696, + "total_column_articles": 129, "frontend_question_id": "LCR 111", "is_new_question": false }, @@ -1818,8 +1818,8 @@ "question__title": "二叉树的序列化与反序列化", "question__title_slug": "h54YBf", "question__hide": false, - "total_acs": 24867, - "total_submitted": 37126, + "total_acs": 24987, + "total_submitted": 37328, "total_column_articles": 199, "frontend_question_id": "LCR 048", "is_new_question": false @@ -1839,8 +1839,8 @@ "question__title": "所有可能的路径", "question__title_slug": "bP4bmD", "question__hide": false, - "total_acs": 22599, - "total_submitted": 27943, + "total_acs": 22743, + "total_submitted": 28144, "total_column_articles": 235, "frontend_question_id": "LCR 110", "is_new_question": false @@ -1860,9 +1860,9 @@ "question__title": "打开转盘锁", "question__title_slug": "zlDJc7", "question__hide": false, - "total_acs": 16611, - "total_submitted": 29239, - "total_column_articles": 140, + "total_acs": 16717, + "total_submitted": 29446, + "total_column_articles": 141, "frontend_question_id": "LCR 109", "is_new_question": false }, @@ -1881,9 +1881,9 @@ "question__title": "二叉树剪枝", "question__title_slug": "pOCWxh", "question__hide": false, - "total_acs": 35569, - "total_submitted": 52511, - "total_column_articles": 372, + "total_acs": 35769, + "total_submitted": 52843, + "total_column_articles": 374, "frontend_question_id": "LCR 047", "is_new_question": false }, @@ -1902,8 +1902,8 @@ "question__title": "单词接龙", "question__title_slug": "om3reC", "question__hide": false, - "total_acs": 12569, - "total_submitted": 21375, + "total_acs": 12645, + "total_submitted": 21488, "total_column_articles": 98, "frontend_question_id": "LCR 108", "is_new_question": false @@ -1923,9 +1923,9 @@ "question__title": "二叉树的右视图", "question__title_slug": "WNC0Lk", "question__hide": false, - "total_acs": 32793, - "total_submitted": 46954, - "total_column_articles": 377, + "total_acs": 33015, + "total_submitted": 47289, + "total_column_articles": 378, "frontend_question_id": "LCR 046", "is_new_question": false }, @@ -1944,9 +1944,9 @@ "question__title": "找树左下角的值", "question__title_slug": "LwUNpT", "question__hide": false, - "total_acs": 35874, - "total_submitted": 45573, - "total_column_articles": 371, + "total_acs": 36023, + "total_submitted": 45763, + "total_column_articles": 373, "frontend_question_id": "LCR 045", "is_new_question": false }, @@ -1965,9 +1965,9 @@ "question__title": "在每个树行中找最大值", "question__title_slug": "hPov7L", "question__hide": false, - "total_acs": 35219, - "total_submitted": 54450, - "total_column_articles": 328, + "total_acs": 35374, + "total_submitted": 54652, + "total_column_articles": 331, "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": 17510, - "total_submitted": 34803, + "total_acs": 17604, + "total_submitted": 34983, "total_column_articles": 130, "frontend_question_id": "LCR 107", "is_new_question": false @@ -2007,8 +2007,8 @@ "question__title": "完全二叉树插入器", "question__title_slug": "NaqhDT", "question__hide": false, - "total_acs": 25492, - "total_submitted": 40621, + "total_acs": 25586, + "total_submitted": 40755, "total_column_articles": 278, "frontend_question_id": "LCR 043", "is_new_question": false @@ -2028,8 +2028,8 @@ "question__title": "判断二分图", "question__title_slug": "vEAB3K", "question__hide": false, - "total_acs": 19014, - "total_submitted": 34233, + "total_acs": 19099, + "total_submitted": 34388, "total_column_articles": 159, "frontend_question_id": "LCR 106", "is_new_question": false @@ -2049,8 +2049,8 @@ "question__title": "最近的请求次数", "question__title_slug": "H8086Q", "question__hide": false, - "total_acs": 31574, - "total_submitted": 38712, + "total_acs": 31729, + "total_submitted": 38900, "total_column_articles": 239, "frontend_question_id": "LCR 042", "is_new_question": false @@ -2070,9 +2070,9 @@ "question__title": "数据流中的移动平均值", "question__title_slug": "qIsx9U", "question__hide": false, - "total_acs": 63455, - "total_submitted": 82079, - "total_column_articles": 505, + "total_acs": 63742, + "total_submitted": 82442, + "total_column_articles": 506, "frontend_question_id": "LCR 041", "is_new_question": false }, @@ -2091,8 +2091,8 @@ "question__title": "岛屿的最大面积", "question__title_slug": "ZL6zAn", "question__hide": false, - "total_acs": 36980, - "total_submitted": 53949, + "total_acs": 37302, + "total_submitted": 54413, "total_column_articles": 336, "frontend_question_id": "LCR 105", "is_new_question": false @@ -2112,9 +2112,9 @@ "question__title": "组合总和 Ⅳ", "question__title_slug": "D0F0SV", "question__hide": false, - "total_acs": 17692, - "total_submitted": 31351, - "total_column_articles": 125, + "total_acs": 17832, + "total_submitted": 31621, + "total_column_articles": 126, "frontend_question_id": "LCR 104", "is_new_question": false }, @@ -2133,9 +2133,9 @@ "question__title": "零钱兑换", "question__title_slug": "gaM7Ch", "question__hide": false, - "total_acs": 37030, - "total_submitted": 71101, - "total_column_articles": 211, + "total_acs": 37415, + "total_submitted": 71774, + "total_column_articles": 212, "frontend_question_id": "LCR 103", "is_new_question": false }, @@ -2154,9 +2154,9 @@ "question__title": "目标和", "question__title_slug": "YaVDxD", "question__hide": false, - "total_acs": 25382, - "total_submitted": 45156, - "total_column_articles": 156, + "total_acs": 25604, + "total_submitted": 45551, + "total_column_articles": 157, "frontend_question_id": "LCR 102", "is_new_question": false }, @@ -2175,8 +2175,8 @@ "question__title": "分割等和子集", "question__title_slug": "NUPfPr", "question__hide": false, - "total_acs": 30723, - "total_submitted": 63051, + "total_acs": 30932, + "total_submitted": 63555, "total_column_articles": 188, "frontend_question_id": "LCR 101", "is_new_question": false @@ -2196,8 +2196,8 @@ "question__title": "三角形最小路径和", "question__title_slug": "IlPe0q", "question__hide": false, - "total_acs": 25122, - "total_submitted": 34109, + "total_acs": 25318, + "total_submitted": 34366, "total_column_articles": 245, "frontend_question_id": "LCR 100", "is_new_question": false @@ -2217,8 +2217,8 @@ "question__title": "最小路径和", "question__title_slug": "0i0mDW", "question__hide": false, - "total_acs": 31143, - "total_submitted": 43017, + "total_acs": 31387, + "total_submitted": 43365, "total_column_articles": 262, "frontend_question_id": "LCR 099", "is_new_question": false @@ -2238,9 +2238,9 @@ "question__title": "最大矩形", "question__title_slug": "PLYXKQ", "question__hide": false, - "total_acs": 20044, - "total_submitted": 34281, - "total_column_articles": 211, + "total_acs": 20149, + "total_submitted": 34450, + "total_column_articles": 212, "frontend_question_id": "LCR 040", "is_new_question": false }, @@ -2259,9 +2259,9 @@ "question__title": "柱状图中最大的矩形", "question__title_slug": "0ynMMM", "question__hide": false, - "total_acs": 30325, - "total_submitted": 60591, - "total_column_articles": 228, + "total_acs": 30503, + "total_submitted": 60907, + "total_column_articles": 230, "frontend_question_id": "LCR 039", "is_new_question": false }, @@ -2280,9 +2280,9 @@ "question__title": "每日温度", "question__title_slug": "iIQa4I", "question__hide": false, - "total_acs": 44866, - "total_submitted": 59386, - "total_column_articles": 368, + "total_acs": 45111, + "total_submitted": 59712, + "total_column_articles": 369, "frontend_question_id": "LCR 038", "is_new_question": false }, @@ -2301,8 +2301,8 @@ "question__title": "行星碰撞", "question__title_slug": "XagZNi", "question__hide": false, - "total_acs": 34434, - "total_submitted": 75791, + "total_acs": 34608, + "total_submitted": 76101, "total_column_articles": 360, "frontend_question_id": "LCR 037", "is_new_question": false @@ -2322,8 +2322,8 @@ "question__title": "不同的子序列", "question__title_slug": "21dk04", "question__hide": false, - "total_acs": 17465, - "total_submitted": 31817, + "total_acs": 17585, + "total_submitted": 32048, "total_column_articles": 133, "frontend_question_id": "LCR 097", "is_new_question": false @@ -2343,8 +2343,8 @@ "question__title": "逆波兰表达式求值", "question__title_slug": "8Zf90G", "question__hide": false, - "total_acs": 34082, - "total_submitted": 62581, + "total_acs": 34284, + "total_submitted": 62951, "total_column_articles": 320, "frontend_question_id": "LCR 036", "is_new_question": false @@ -2364,9 +2364,9 @@ "question__title": "最小时间差", "question__title_slug": "569nqc", "question__hide": false, - "total_acs": 33056, - "total_submitted": 50100, - "total_column_articles": 230, + "total_acs": 33189, + "total_submitted": 50312, + "total_column_articles": 231, "frontend_question_id": "LCR 035", "is_new_question": false }, @@ -2385,8 +2385,8 @@ "question__title": "交错字符串", "question__title_slug": "IY6buf", "question__hide": false, - "total_acs": 19039, - "total_submitted": 39837, + "total_acs": 19215, + "total_submitted": 40196, "total_column_articles": 136, "frontend_question_id": "LCR 096", "is_new_question": false @@ -2406,8 +2406,8 @@ "question__title": "验证外星语词典", "question__title_slug": "lwyVBB", "question__hide": false, - "total_acs": 28025, - "total_submitted": 49864, + "total_acs": 28131, + "total_submitted": 50026, "total_column_articles": 325, "frontend_question_id": "LCR 034", "is_new_question": false @@ -2427,8 +2427,8 @@ "question__title": "字母异位词分组", "question__title_slug": "sfvd7V", "question__hide": false, - "total_acs": 33679, - "total_submitted": 45045, + "total_acs": 33873, + "total_submitted": 45285, "total_column_articles": 250, "frontend_question_id": "LCR 033", "is_new_question": false @@ -2448,9 +2448,9 @@ "question__title": "最长公共子序列", "question__title_slug": "qJnOS7", "question__hide": false, - "total_acs": 56043, - "total_submitted": 86471, - "total_column_articles": 310, + "total_acs": 56685, + "total_submitted": 87409, + "total_column_articles": 313, "frontend_question_id": "LCR 095", "is_new_question": false }, @@ -2469,9 +2469,9 @@ "question__title": "有效的字母异位词", "question__title_slug": "dKk3P7", "question__hide": false, - "total_acs": 40026, - "total_submitted": 68577, - "total_column_articles": 310, + "total_acs": 40305, + "total_submitted": 69158, + "total_column_articles": 313, "frontend_question_id": "LCR 032", "is_new_question": false }, @@ -2490,9 +2490,9 @@ "question__title": "分割回文串 II", "question__title_slug": "omKAoA", "question__hide": false, - "total_acs": 16740, - "total_submitted": 29586, - "total_column_articles": 120, + "total_acs": 16846, + "total_submitted": 29800, + "total_column_articles": 119, "frontend_question_id": "LCR 094", "is_new_question": false }, @@ -2511,8 +2511,8 @@ "question__title": "最长的斐波那契子序列的长度", "question__title_slug": "Q91FMA", "question__hide": false, - "total_acs": 23189, - "total_submitted": 40526, + "total_acs": 23325, + "total_submitted": 40772, "total_column_articles": 154, "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": 31860, - "total_submitted": 57776, + "total_acs": 32075, + "total_submitted": 58202, "total_column_articles": 288, "frontend_question_id": "LCR 031", "is_new_question": false @@ -2553,8 +2553,8 @@ "question__title": "将字符串翻转到单调递增", "question__title_slug": "cyJERH", "question__hide": false, - "total_acs": 24422, - "total_submitted": 35881, + "total_acs": 24541, + "total_submitted": 36039, "total_column_articles": 270, "frontend_question_id": "LCR 092", "is_new_question": false @@ -2574,9 +2574,9 @@ "question__title": "粉刷房子", "question__title_slug": "JEj789", "question__hide": false, - "total_acs": 52296, - "total_submitted": 67993, - "total_column_articles": 597, + "total_acs": 52591, + "total_submitted": 68384, + "total_column_articles": 598, "frontend_question_id": "LCR 091", "is_new_question": false }, @@ -2595,8 +2595,8 @@ "question__title": "O(1) 时间插入、删除和获取随机元素", "question__title_slug": "FortPu", "question__hide": false, - "total_acs": 28227, - "total_submitted": 52402, + "total_acs": 28336, + "total_submitted": 52599, "total_column_articles": 184, "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": 25691, - "total_submitted": 53873, - "total_column_articles": 197, + "total_acs": 26054, + "total_submitted": 54693, + "total_column_articles": 198, "frontend_question_id": "LCR 090", "is_new_question": false }, @@ -2637,8 +2637,8 @@ "question__title": "循环有序列表的插入", "question__title_slug": "4ueAj6", "question__hide": false, - "total_acs": 49407, - "total_submitted": 148108, + "total_acs": 49533, + "total_submitted": 148541, "total_column_articles": 651, "frontend_question_id": "LCR 029", "is_new_question": false @@ -2658,8 +2658,8 @@ "question__title": "扁平化多级双向链表", "question__title_slug": "Qv1Da2", "question__hide": false, - "total_acs": 28790, - "total_submitted": 47731, + "total_acs": 28894, + "total_submitted": 47924, "total_column_articles": 366, "frontend_question_id": "LCR 028", "is_new_question": false @@ -2679,8 +2679,8 @@ "question__title": "回文链表", "question__title_slug": "aMhZSa", "question__hide": false, - "total_acs": 77026, - "total_submitted": 127882, + "total_acs": 77621, + "total_submitted": 129027, "total_column_articles": 584, "frontend_question_id": "LCR 027", "is_new_question": false @@ -2700,8 +2700,8 @@ "question__title": "重排链表", "question__title_slug": "LGjMqU", "question__hide": false, - "total_acs": 50528, - "total_submitted": 77589, + "total_acs": 50891, + "total_submitted": 78147, "total_column_articles": 427, "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": 44607, - "total_submitted": 76865, + "total_acs": 44804, + "total_submitted": 77187, "total_column_articles": 440, "frontend_question_id": "LCR 025", "is_new_question": false @@ -2742,9 +2742,9 @@ "question__title": "反转链表", "question__title_slug": "UHnkqh", "question__hide": false, - "total_acs": 135895, - "total_submitted": 180914, - "total_column_articles": 731, + "total_acs": 137631, + "total_submitted": 183211, + "total_column_articles": 738, "frontend_question_id": "LCR 024", "is_new_question": false }, @@ -2763,9 +2763,9 @@ "question__title": "相交链表", "question__title_slug": "3u1WK4", "question__hide": false, - "total_acs": 58990, - "total_submitted": 86378, - "total_column_articles": 367, + "total_acs": 59615, + "total_submitted": 87345, + "total_column_articles": 368, "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": 68691, - "total_submitted": 123443, - "total_column_articles": 423, + "total_acs": 69209, + "total_submitted": 124335, + "total_column_articles": 425, "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": 64167, - "total_submitted": 115862, - "total_column_articles": 540, + "total_acs": 64674, + "total_submitted": 116696, + "total_column_articles": 542, "frontend_question_id": "LCR 021", "is_new_question": false }, @@ -2826,9 +2826,9 @@ "question__title": "回文子串", "question__title_slug": "a7VOhD", "question__hide": false, - "total_acs": 45595, - "total_submitted": 64404, - "total_column_articles": 353, + "total_acs": 45898, + "total_submitted": 64841, + "total_column_articles": 354, "frontend_question_id": "LCR 020", "is_new_question": false }, @@ -2847,8 +2847,8 @@ "question__title": "验证回文串 II", "question__title_slug": "RQku0D", "question__hide": false, - "total_acs": 43034, - "total_submitted": 95222, + "total_acs": 43209, + "total_submitted": 95633, "total_column_articles": 384, "frontend_question_id": "LCR 019", "is_new_question": false @@ -2868,8 +2868,8 @@ "question__title": "验证回文串", "question__title_slug": "XltzEq", "question__hide": false, - "total_acs": 51444, - "total_submitted": 100169, + "total_acs": 51825, + "total_submitted": 100879, "total_column_articles": 403, "frontend_question_id": "LCR 018", "is_new_question": false @@ -2889,9 +2889,9 @@ "question__title": "最小覆盖子串", "question__title_slug": "M1oyTv", "question__hide": false, - "total_acs": 36886, - "total_submitted": 72375, - "total_column_articles": 337, + "total_acs": 37149, + "total_submitted": 72848, + "total_column_articles": 339, "frontend_question_id": "LCR 017", "is_new_question": false }, @@ -2910,9 +2910,9 @@ "question__title": "无重复字符的最长子串", "question__title_slug": "wtcaE1", "question__hide": false, - "total_acs": 64646, - "total_submitted": 136473, - "total_column_articles": 540, + "total_acs": 65486, + "total_submitted": 138333, + "total_column_articles": 543, "frontend_question_id": "LCR 016", "is_new_question": false }, @@ -2931,9 +2931,9 @@ "question__title": "找到字符串中所有字母异位词", "question__title_slug": "VabMRr", "question__hide": false, - "total_acs": 40126, - "total_submitted": 65562, - "total_column_articles": 322, + "total_acs": 40344, + "total_submitted": 65996, + "total_column_articles": 325, "frontend_question_id": "LCR 015", "is_new_question": false }, @@ -2952,9 +2952,9 @@ "question__title": "字符串的排列", "question__title_slug": "MPnaiL", "question__hide": false, - "total_acs": 49798, - "total_submitted": 97029, - "total_column_articles": 364, + "total_acs": 50083, + "total_submitted": 97604, + "total_column_articles": 365, "frontend_question_id": "LCR 014", "is_new_question": false }, @@ -2973,9 +2973,9 @@ "question__title": "二维区域和检索 - 矩阵不可变", "question__title_slug": "O4NDxx", "question__hide": false, - "total_acs": 39323, - "total_submitted": 57031, - "total_column_articles": 322, + "total_acs": 39445, + "total_submitted": 57229, + "total_column_articles": 323, "frontend_question_id": "LCR 013", "is_new_question": false }, @@ -2994,9 +2994,9 @@ "question__title": "寻找数组的中心下标", "question__title_slug": "tvdfij", "question__hide": false, - "total_acs": 51930, - "total_submitted": 76930, - "total_column_articles": 449, + "total_acs": 52231, + "total_submitted": 77317, + "total_column_articles": 450, "frontend_question_id": "LCR 012", "is_new_question": false }, @@ -3015,9 +3015,9 @@ "question__title": "连续数组", "question__title_slug": "A1NYOS", "question__hide": false, - "total_acs": 44919, - "total_submitted": 82064, - "total_column_articles": 372, + "total_acs": 45152, + "total_submitted": 82503, + "total_column_articles": 373, "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": 61786, - "total_submitted": 142688, + "total_acs": 62217, + "total_submitted": 143580, "total_column_articles": 406, "frontend_question_id": "LCR 010", "is_new_question": false @@ -3057,9 +3057,9 @@ "question__title": "打家劫舍", "question__title_slug": "Gu0c2T", "question__hide": false, - "total_acs": 37944, - "total_submitted": 64122, - "total_column_articles": 259, + "total_acs": 38487, + "total_submitted": 65098, + "total_column_articles": 262, "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": 53305, - "total_submitted": 100473, - "total_column_articles": 411, + "total_acs": 53525, + "total_submitted": 100857, + "total_column_articles": 412, "frontend_question_id": "LCR 009", "is_new_question": false }, @@ -3099,8 +3099,8 @@ "question__title": "使用最小花费爬楼梯", "question__title_slug": "GzCJIP", "question__hide": false, - "total_acs": 47459, - "total_submitted": 66680, + "total_acs": 47834, + "total_submitted": 67246, "total_column_articles": 351, "frontend_question_id": "LCR 088", "is_new_question": false @@ -3120,9 +3120,9 @@ "question__title": "长度最小的子数组", "question__title_slug": "2VG8Kg", "question__hide": false, - "total_acs": 67328, - "total_submitted": 133627, - "total_column_articles": 511, + "total_acs": 67833, + "total_submitted": 134498, + "total_column_articles": 512, "frontend_question_id": "LCR 008", "is_new_question": false }, @@ -3141,9 +3141,9 @@ "question__title": "复原 IP 地址", "question__title_slug": "0on3uN", "question__hide": false, - "total_acs": 25367, - "total_submitted": 39920, - "total_column_articles": 238, + "total_acs": 25536, + "total_submitted": 40177, + "total_column_articles": 239, "frontend_question_id": "LCR 087", "is_new_question": false }, @@ -3162,8 +3162,8 @@ "question__title": "分割回文串", "question__title_slug": "M99OJA", "question__hide": false, - "total_acs": 25349, - "total_submitted": 33764, + "total_acs": 25857, + "total_submitted": 34397, "total_column_articles": 195, "frontend_question_id": "LCR 086", "is_new_question": false @@ -3183,9 +3183,9 @@ "question__title": "三数之和", "question__title_slug": "1fGaJU", "question__hide": false, - "total_acs": 66006, - "total_submitted": 152512, - "total_column_articles": 412, + "total_acs": 66582, + "total_submitted": 153778, + "total_column_articles": 415, "frontend_question_id": "LCR 007", "is_new_question": false }, @@ -3204,9 +3204,9 @@ "question__title": "括号生成", "question__title_slug": "IDBivT", "question__hide": false, - "total_acs": 34177, - "total_submitted": 40544, - "total_column_articles": 314, + "total_acs": 34496, + "total_submitted": 40919, + "total_column_articles": 317, "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": 72486, - "total_submitted": 107901, - "total_column_articles": 536, + "total_acs": 72917, + "total_submitted": 108561, + "total_column_articles": 538, "frontend_question_id": "LCR 006", "is_new_question": false }, @@ -3246,9 +3246,9 @@ "question__title": "最大单词长度乘积", "question__title_slug": "aseY1I", "question__hide": false, - "total_acs": 56506, - "total_submitted": 79407, - "total_column_articles": 434, + "total_acs": 56712, + "total_submitted": 79697, + "total_column_articles": 435, "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": 30511, - "total_submitted": 44406, - "total_column_articles": 233, + "total_acs": 30791, + "total_submitted": 44829, + "total_column_articles": 234, "frontend_question_id": "LCR 084", "is_new_question": false }, @@ -3288,9 +3288,9 @@ "question__title": "全排列", "question__title_slug": "VvJkup", "question__hide": false, - "total_acs": 39706, - "total_submitted": 47501, - "total_column_articles": 335, + "total_acs": 40223, + "total_submitted": 48111, + "total_column_articles": 338, "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": 70479, - "total_submitted": 99559, - "total_column_articles": 507, + "total_acs": 70765, + "total_submitted": 99955, + "total_column_articles": 508, "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": 29484, - "total_submitted": 44859, - "total_column_articles": 231, + "total_acs": 29692, + "total_submitted": 45197, + "total_column_articles": 235, "frontend_question_id": "LCR 082", "is_new_question": false }, @@ -3351,8 +3351,8 @@ "question__title": "二进制求和", "question__title_slug": "JFETK5", "question__hide": false, - "total_acs": 63713, - "total_submitted": 118773, + "total_acs": 64081, + "total_submitted": 119390, "total_column_articles": 612, "frontend_question_id": "LCR 002", "is_new_question": false @@ -3372,9 +3372,9 @@ "question__title": "比特位计数", "question__title_slug": "w3tCBm", "question__hide": false, - "total_acs": 81581, - "total_submitted": 104490, - "total_column_articles": 645, + "total_acs": 81888, + "total_submitted": 104883, + "total_column_articles": 646, "frontend_question_id": "LCR 003", "is_new_question": false }, @@ -3393,9 +3393,9 @@ "question__title": "组合总和", "question__title_slug": "Ygoe9J", "question__hide": false, - "total_acs": 34619, - "total_submitted": 43296, - "total_column_articles": 273, + "total_acs": 34904, + "total_submitted": 43678, + "total_column_articles": 276, "frontend_question_id": "LCR 081", "is_new_question": false }, @@ -3414,9 +3414,9 @@ "question__title": "两数相除", "question__title_slug": "xoh6Oh", "question__hide": false, - "total_acs": 67565, - "total_submitted": 318938, - "total_column_articles": 549, + "total_acs": 67787, + "total_submitted": 319875, + "total_column_articles": 551, "frontend_question_id": "LCR 001", "is_new_question": false }, @@ -3435,8 +3435,8 @@ "question__title": "主题空间", "question__title_slug": "YesdPw", "question__hide": false, - "total_acs": 4248, - "total_submitted": 10376, + "total_acs": 4278, + "total_submitted": 10436, "total_column_articles": 110, "frontend_question_id": "LCS 03", "is_new_question": false @@ -3456,9 +3456,9 @@ "question__title": "完成一半题目", "question__title_slug": "WqXACV", "question__hide": false, - "total_acs": 11169, - "total_submitted": 17342, - "total_column_articles": 205, + "total_acs": 11268, + "total_submitted": 17476, + "total_column_articles": 207, "frontend_question_id": "LCS 02", "is_new_question": false }, @@ -3477,9 +3477,9 @@ "question__title": "下载插件", "question__title_slug": "Ju9Xwi", "question__hide": false, - "total_acs": 16342, - "total_submitted": 30543, - "total_column_articles": 304, + "total_acs": 16467, + "total_submitted": 30752, + "total_column_articles": 306, "frontend_question_id": "LCS 01", "is_new_question": false }, @@ -3498,8 +3498,8 @@ "question__title": "魔塔游戏", "question__title_slug": "p0NxJO", "question__hide": false, - "total_acs": 24721, - "total_submitted": 53742, + "total_acs": 24841, + "total_submitted": 53976, "total_column_articles": 245, "frontend_question_id": "LCP 30", "is_new_question": false @@ -3519,8 +3519,8 @@ "question__title": "守卫城堡", "question__title_slug": "7rLGCR", "question__hide": false, - "total_acs": 1227, - "total_submitted": 2186, + "total_acs": 1230, + "total_submitted": 2190, "total_column_articles": 20, "frontend_question_id": "LCP 38", "is_new_question": false @@ -3540,8 +3540,8 @@ "question__title": "最多牌组数", "question__title_slug": "Up5XYM", "question__hide": false, - "total_acs": 1845, - "total_submitted": 5398, + "total_acs": 1851, + "total_submitted": 5421, "total_column_articles": 26, "frontend_question_id": "LCP 36", "is_new_question": false @@ -3561,9 +3561,9 @@ "question__title": "蓄水", "question__title_slug": "o8SXZn", "question__hide": false, - "total_acs": 21962, - "total_submitted": 63079, - "total_column_articles": 203, + "total_acs": 22033, + "total_submitted": 63263, + "total_column_articles": 204, "frontend_question_id": "LCP 33", "is_new_question": false }, @@ -3582,8 +3582,8 @@ "question__title": "电动车游城市", "question__title_slug": "DFPeFJ", "question__hide": false, - "total_acs": 3477, - "total_submitted": 6982, + "total_acs": 3535, + "total_submitted": 7055, "total_column_articles": 45, "frontend_question_id": "LCP 35", "is_new_question": false @@ -3603,9 +3603,9 @@ "question__title": "批量处理任务", "question__title_slug": "t3fKg1", "question__hide": false, - "total_acs": 2627, - "total_submitted": 6504, - "total_column_articles": 33, + "total_acs": 2670, + "total_submitted": 6606, + "total_column_articles": 34, "frontend_question_id": "LCP 32", "is_new_question": false }, @@ -3624,8 +3624,8 @@ "question__title": "变换的迷宫", "question__title_slug": "Db3wC1", "question__hide": false, - "total_acs": 3065, - "total_submitted": 10294, + "total_acs": 3075, + "total_submitted": 10320, "total_column_articles": 41, "frontend_question_id": "LCP 31", "is_new_question": false @@ -3645,8 +3645,8 @@ "question__title": "乐团站位", "question__title_slug": "SNJvJP", "question__hide": false, - "total_acs": 8631, - "total_submitted": 40554, + "total_acs": 8684, + "total_submitted": 40686, "total_column_articles": 172, "frontend_question_id": "LCP 29", "is_new_question": false @@ -3666,8 +3666,8 @@ "question__title": "采购方案", "question__title_slug": "4xy4Wx", "question__hide": false, - "total_acs": 20647, - "total_submitted": 63755, + "total_acs": 20720, + "total_submitted": 63911, "total_column_articles": 308, "frontend_question_id": "LCP 28", "is_new_question": false @@ -3687,9 +3687,9 @@ "question__title": "黑盒光线反射", "question__title_slug": "IQvJ9i", "question__hide": false, - "total_acs": 1766, - "total_submitted": 5074, - "total_column_articles": 33, + "total_acs": 1778, + "total_submitted": 5091, + "total_column_articles": 34, "frontend_question_id": "LCP 27", "is_new_question": false }, @@ -3708,8 +3708,8 @@ "question__title": "早餐组合", "question__title_slug": "2vYnGI", "question__hide": false, - "total_acs": 28068, - "total_submitted": 91238, + "total_acs": 28182, + "total_submitted": 91566, "total_column_articles": 372, "frontend_question_id": "LCP 18", "is_new_question": false @@ -3729,9 +3729,9 @@ "question__title": "黑白方格画", "question__title_slug": "ccw6C7", "question__hide": false, - "total_acs": 12204, - "total_submitted": 34544, - "total_column_articles": 229, + "total_acs": 12230, + "total_submitted": 34601, + "total_column_articles": 231, "frontend_question_id": "LCP 22", "is_new_question": false }, @@ -3750,8 +3750,8 @@ "question__title": "速算机器人", "question__title_slug": "nGK0Fy", "question__hide": false, - "total_acs": 36939, - "total_submitted": 46199, + "total_acs": 37095, + "total_submitted": 46404, "total_column_articles": 386, "frontend_question_id": "LCP 17", "is_new_question": false @@ -3771,8 +3771,8 @@ "question__title": "古董键盘", "question__title_slug": "Uh984O", "question__hide": false, - "total_acs": 2173, - "total_submitted": 5668, + "total_acs": 2189, + "total_submitted": 5697, "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": 1721, - "total_submitted": 4413, + "total_acs": 1731, + "total_submitted": 4431, "total_column_articles": 38, "frontend_question_id": "LCP 21", "is_new_question": false @@ -3813,8 +3813,8 @@ "question__title": "快速公交", "question__title_slug": "meChtZ", "question__hide": false, - "total_acs": 2828, - "total_submitted": 7695, + "total_acs": 2839, + "total_submitted": 7716, "total_column_articles": 41, "frontend_question_id": "LCP 20", "is_new_question": false @@ -3834,8 +3834,8 @@ "question__title": "导航装置", "question__title_slug": "hSRGyL", "question__hide": false, - "total_acs": 1165, - "total_submitted": 3255, + "total_acs": 1175, + "total_submitted": 3267, "total_column_articles": 25, "frontend_question_id": "LCP 26", "is_new_question": false @@ -3855,9 +3855,9 @@ "question__title": "数字游戏", "question__title_slug": "5TxKeK", "question__hide": false, - "total_acs": 10572, - "total_submitted": 17961, - "total_column_articles": 71, + "total_acs": 10605, + "total_submitted": 18007, + "total_column_articles": 70, "frontend_question_id": "LCP 24", "is_new_question": false }, @@ -3876,9 +3876,9 @@ "question__title": "秋叶收藏集", "question__title_slug": "UlBDOe", "question__hide": false, - "total_acs": 22676, - "total_submitted": 43893, - "total_column_articles": 240, + "total_acs": 22734, + "total_submitted": 43997, + "total_column_articles": 241, "frontend_question_id": "LCP 19", "is_new_question": false }, @@ -3897,8 +3897,8 @@ "question__title": "寻宝", "question__title_slug": "xun-bao", "question__hide": false, - "total_acs": 10501, - "total_submitted": 17722, + "total_acs": 10518, + "total_submitted": 17781, "total_column_articles": 104, "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": 1842, - "total_submitted": 7439, + "total_acs": 1852, + "total_submitted": 7473, "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": 11693, - "total_submitted": 36442, + "total_acs": 11738, + "total_submitted": 36580, "total_column_articles": 141, "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": 6548, - "total_submitted": 11477, + "total_acs": 6580, + "total_submitted": 11543, "total_column_articles": 116, "frontend_question_id": "LCP 34", "is_new_question": false @@ -3981,9 +3981,9 @@ "question__title": "游乐园的迷宫", "question__title_slug": "you-le-yuan-de-mi-gong", "question__hide": false, - "total_acs": 1588, - "total_submitted": 2517, - "total_column_articles": 30, + "total_acs": 1600, + "total_submitted": 2529, + "total_column_articles": 31, "frontend_question_id": "LCP 15", "is_new_question": false }, @@ -4002,9 +4002,9 @@ "question__title": "小张刷题计划", "question__title_slug": "xiao-zhang-shua-ti-ji-hua", "question__hide": false, - "total_acs": 12104, - "total_submitted": 27629, - "total_column_articles": 163, + "total_acs": 12171, + "total_submitted": 27803, + "total_column_articles": 164, "frontend_question_id": "LCP 12", "is_new_question": false }, @@ -4023,8 +4023,8 @@ "question__title": "期望个数统计", "question__title_slug": "qi-wang-ge-shu-tong-ji", "question__hide": false, - "total_acs": 11249, - "total_submitted": 15495, + "total_acs": 11321, + "total_submitted": 15578, "total_column_articles": 105, "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": 1260, - "total_submitted": 3511, + "total_acs": 1265, + "total_submitted": 3517, "total_column_articles": 23, "frontend_question_id": "LCP 16", "is_new_question": false @@ -4065,9 +4065,9 @@ "question__title": "传递信息", "question__title_slug": "chuan-di-xin-xi", "question__hide": false, - "total_acs": 58895, - "total_submitted": 78387, - "total_column_articles": 659, + "total_acs": 59035, + "total_submitted": 78568, + "total_column_articles": 658, "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": 3332, - "total_submitted": 5346, + "total_acs": 3348, + "total_submitted": 5366, "total_column_articles": 56, "frontend_question_id": "LCP 10", "is_new_question": false @@ -4107,9 +4107,9 @@ "question__title": "切分数组", "question__title_slug": "qie-fen-shu-zu", "question__hide": false, - "total_acs": 4390, - "total_submitted": 17907, - "total_column_articles": 62, + "total_acs": 4425, + "total_submitted": 18002, + "total_column_articles": 63, "frontend_question_id": "LCP 14", "is_new_question": false }, @@ -4128,8 +4128,8 @@ "question__title": "魔术排列", "question__title_slug": "er94lq", "question__hide": false, - "total_acs": 4129, - "total_submitted": 10983, + "total_acs": 4146, + "total_submitted": 11014, "total_column_articles": 69, "frontend_question_id": "LCP 23", "is_new_question": false @@ -4149,9 +4149,9 @@ "question__title": "剧情触发时间", "question__title_slug": "ju-qing-hong-fa-shi-jian", "question__hide": false, - "total_acs": 7976, - "total_submitted": 23668, - "total_column_articles": 140, + "total_acs": 8055, + "total_submitted": 23795, + "total_column_articles": 143, "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": 95897, - "total_submitted": 112826, - "total_column_articles": 1073, + "total_acs": 96240, + "total_submitted": 113237, + "total_column_articles": 1074, "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": 6763, - "total_submitted": 18875, + "total_acs": 6817, + "total_submitted": 19036, "total_column_articles": 92, "frontend_question_id": "面试题 17.26", "is_new_question": false @@ -4212,9 +4212,9 @@ "question__title": "Langtons Ant LCCI", "question__title_slug": "langtons-ant-lcci", "question__hide": false, - "total_acs": 5298, - "total_submitted": 9151, - "total_column_articles": 89, + "total_acs": 5334, + "total_submitted": 9252, + "total_column_articles": 90, "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": 3584, - "total_submitted": 7125, + "total_acs": 3605, + "total_submitted": 7179, "total_column_articles": 60, "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": 17559, - "total_submitted": 36601, + "total_acs": 17662, + "total_submitted": 36774, "total_column_articles": 283, "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": 16070, - "total_submitted": 22724, + "total_acs": 16138, + "total_submitted": 22827, "total_column_articles": 268, "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": 25739, - "total_submitted": 48085, + "total_acs": 25854, + "total_submitted": 48322, "total_column_articles": 207, "frontend_question_id": "面试题 17.24", "is_new_question": false @@ -4317,8 +4317,8 @@ "question__title": "Max Black Square LCCI", "question__title_slug": "max-black-square-lcci", "question__hide": false, - "total_acs": 9134, - "total_submitted": 24059, + "total_acs": 9201, + "total_submitted": 24220, "total_column_articles": 155, "frontend_question_id": "面试题 17.23", "is_new_question": false @@ -4338,9 +4338,9 @@ "question__title": "Missing Two LCCI", "question__title_slug": "missing-two-lcci", "question__hide": false, - "total_acs": 42665, - "total_submitted": 70919, - "total_column_articles": 595, + "total_acs": 42814, + "total_submitted": 71202, + "total_column_articles": 598, "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": 15968, - "total_submitted": 35904, - "total_column_articles": 180, + "total_acs": 16136, + "total_submitted": 36254, + "total_column_articles": 183, "frontend_question_id": "面试题 17.18", "is_new_question": false }, @@ -4380,9 +4380,9 @@ "question__title": "Pairs With Sum LCCI", "question__title_slug": "pairs-with-sum-lcci", "question__hide": false, - "total_acs": 19363, - "total_submitted": 40093, - "total_column_articles": 263, + "total_acs": 19452, + "total_submitted": 40257, + "total_column_articles": 264, "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": 10925, - "total_submitted": 17606, + "total_acs": 10984, + "total_submitted": 17703, "total_column_articles": 158, "frontend_question_id": "面试题 10.10", "is_new_question": false @@ -4422,8 +4422,8 @@ "question__title": "Group Anagrams LCCI", "question__title_slug": "group-anagrams-lcci", "question__hide": false, - "total_acs": 43586, - "total_submitted": 58555, + "total_acs": 43690, + "total_submitted": 58704, "total_column_articles": 489, "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": 52317, - "total_submitted": 71691, + "total_acs": 52402, + "total_submitted": 71792, "total_column_articles": 674, "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": 80526, - "total_submitted": 143793, + "total_acs": 80658, + "total_submitted": 144009, "total_column_articles": 1066, "frontend_question_id": "面试题 17.10", "is_new_question": false @@ -4485,8 +4485,8 @@ "question__title": "Get Kth Magic Number LCCI", "question__title_slug": "get-kth-magic-number-lcci", "question__hide": false, - "total_acs": 49178, - "total_submitted": 88274, + "total_acs": 49273, + "total_submitted": 88454, "total_column_articles": 433, "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": 14049, - "total_submitted": 49618, - "total_column_articles": 174, + "total_acs": 14137, + "total_submitted": 49911, + "total_column_articles": 176, "frontend_question_id": "面试题 17.08", "is_new_question": false }, @@ -4527,9 +4527,9 @@ "question__title": "Baby Names LCCI", "question__title_slug": "baby-names-lcci", "question__hide": false, - "total_acs": 13790, - "total_submitted": 33063, - "total_column_articles": 298, + "total_acs": 13852, + "total_submitted": 33158, + "total_column_articles": 300, "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": 12232, - "total_submitted": 24217, + "total_acs": 12336, + "total_submitted": 24406, "total_column_articles": 204, "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": 32490, - "total_submitted": 68547, + "total_acs": 32669, + "total_submitted": 68874, "total_column_articles": 295, "frontend_question_id": "面试题 17.05", "is_new_question": false @@ -4590,9 +4590,9 @@ "question__title": "Missing Number LCCI", "question__title_slug": "missing-number-lcci", "question__hide": false, - "total_acs": 63853, - "total_submitted": 109348, - "total_column_articles": 793, + "total_acs": 64425, + "total_submitted": 110451, + "total_column_articles": 796, "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": 9323, - "total_submitted": 18079, + "total_acs": 9373, + "total_submitted": 18187, "total_column_articles": 127, "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": 15731, - "total_submitted": 38941, - "total_column_articles": 216, + "total_acs": 15821, + "total_submitted": 39106, + "total_column_articles": 217, "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": 52106, - "total_submitted": 81880, + "total_acs": 52161, + "total_submitted": 81971, "total_column_articles": 594, "frontend_question_id": "面试题 17.21", "is_new_question": false @@ -4674,8 +4674,8 @@ "question__title": "Continuous Median LCCI", "question__title_slug": "continuous-median-lcci", "question__hide": false, - "total_acs": 7599, - "total_submitted": 13013, + "total_acs": 7637, + "total_submitted": 13071, "total_column_articles": 114, "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": 27236, - "total_submitted": 68521, + "total_acs": 27365, + "total_submitted": 68837, "total_column_articles": 301, "frontend_question_id": "面试题 16.26", "is_new_question": false @@ -4716,9 +4716,9 @@ "question__title": "LRU Cache LCCI", "question__title_slug": "lru-cache-lcci", "question__hide": false, - "total_acs": 51980, - "total_submitted": 93514, - "total_column_articles": 373, + "total_acs": 52229, + "total_submitted": 93918, + "total_column_articles": 375, "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": 27409, - "total_submitted": 42929, + "total_acs": 27610, + "total_submitted": 43219, "total_column_articles": 267, "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": 14536, - "total_submitted": 32626, + "total_acs": 14599, + "total_submitted": 32768, "total_column_articles": 268, "frontend_question_id": "面试题 17.17", "is_new_question": false @@ -4779,9 +4779,9 @@ "question__title": "The Masseuse LCCI", "question__title_slug": "the-masseuse-lcci", "question__hide": false, - "total_acs": 84260, - "total_submitted": 163887, - "total_column_articles": 1363, + "total_acs": 84566, + "total_submitted": 164463, + "total_column_articles": 1364, "frontend_question_id": "面试题 17.16", "is_new_question": false }, @@ -4800,9 +4800,9 @@ "question__title": "Longest Word LCCI", "question__title_slug": "longest-word-lcci", "question__hide": false, - "total_acs": 13038, - "total_submitted": 32048, - "total_column_articles": 195, + "total_acs": 13129, + "total_submitted": 32327, + "total_column_articles": 196, "frontend_question_id": "面试题 17.15", "is_new_question": false }, @@ -4821,8 +4821,8 @@ "question__title": "Smallest K LCCI", "question__title_slug": "smallest-k-lcci", "question__hide": false, - "total_acs": 113645, - "total_submitted": 196512, + "total_acs": 114274, + "total_submitted": 197821, "total_column_articles": 967, "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": 30042, - "total_submitted": 54345, + "total_acs": 30092, + "total_submitted": 54429, "total_column_articles": 314, "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": 33934, - "total_submitted": 53096, + "total_acs": 34044, + "total_submitted": 53318, "total_column_articles": 413, "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": 4531, - "total_submitted": 11571, + "total_acs": 4558, + "total_submitted": 11615, "total_column_articles": 83, "frontend_question_id": "面试题 16.08", "is_new_question": false @@ -4905,8 +4905,8 @@ "question__title": "Factorial Zeros LCCI", "question__title_slug": "factorial-zeros-lcci", "question__hide": false, - "total_acs": 20230, - "total_submitted": 47819, + "total_acs": 20316, + "total_submitted": 48062, "total_column_articles": 196, "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": 23289, - "total_submitted": 52419, + "total_acs": 23418, + "total_submitted": 52706, "total_column_articles": 243, "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": 52518, - "total_submitted": 81733, - "total_column_articles": 467, + "total_acs": 52974, + "total_submitted": 82516, + "total_column_articles": 473, "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": 16023, - "total_submitted": 24090, + "total_acs": 16096, + "total_submitted": 24188, "total_column_articles": 181, "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": 83124, - "total_submitted": 148062, - "total_column_articles": 2582, + "total_acs": 83399, + "total_submitted": 148564, + "total_column_articles": 2583, "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": 24058, - "total_submitted": 66863, - "total_column_articles": 338, + "total_acs": 24172, + "total_submitted": 67162, + "total_column_articles": 339, "frontend_question_id": "面试题 08.02", "is_new_question": false }, @@ -5031,8 +5031,8 @@ "question__title": "BST Sequences LCCI", "question__title_slug": "bst-sequences-lcci", "question__hide": false, - "total_acs": 12431, - "total_submitted": 25350, + "total_acs": 12479, + "total_submitted": 25432, "total_column_articles": 174, "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": 32351, - "total_submitted": 65867, - "total_column_articles": 375, + "total_acs": 32490, + "total_submitted": 66114, + "total_column_articles": 376, "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": 50397, - "total_submitted": 84372, - "total_column_articles": 612, + "total_acs": 50699, + "total_submitted": 84935, + "total_column_articles": 615, "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": 104988, - "total_submitted": 135537, - "total_column_articles": 1319, + "total_acs": 105840, + "total_submitted": 136700, + "total_column_articles": 1323, "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": 94357, - "total_submitted": 271142, - "total_column_articles": 1379, + "total_acs": 94620, + "total_submitted": 271931, + "total_column_articles": 1381, "frontend_question_id": "面试题 01.05", "is_new_question": false }, @@ -5136,9 +5136,9 @@ "question__title": "Pond Sizes LCCI", "question__title_slug": "pond-sizes-lcci", "question__hide": false, - "total_acs": 42032, - "total_submitted": 63474, - "total_column_articles": 618, + "total_acs": 42237, + "total_submitted": 63755, + "total_column_articles": 620, "frontend_question_id": "面试题 16.19", "is_new_question": false }, @@ -5157,9 +5157,9 @@ "question__title": "Pattern Matching LCCI", "question__title_slug": "pattern-matching-lcci", "question__hide": false, - "total_acs": 18900, - "total_submitted": 55750, - "total_column_articles": 356, + "total_acs": 18985, + "total_submitted": 55966, + "total_column_articles": 355, "frontend_question_id": "面试题 16.18", "is_new_question": false }, @@ -5178,9 +5178,9 @@ "question__title": "Contiguous Sequence LCCI", "question__title_slug": "contiguous-sequence-lcci", "question__hide": false, - "total_acs": 52941, - "total_submitted": 90520, - "total_column_articles": 538, + "total_acs": 53093, + "total_submitted": 90816, + "total_column_articles": 540, "frontend_question_id": "面试题 16.17", "is_new_question": false }, @@ -5199,8 +5199,8 @@ "question__title": "Sub Sort LCCI", "question__title_slug": "sub-sort-lcci", "question__hide": false, - "total_acs": 28565, - "total_submitted": 61516, + "total_acs": 28716, + "total_submitted": 61848, "total_column_articles": 342, "frontend_question_id": "面试题 16.16", "is_new_question": false @@ -5220,8 +5220,8 @@ "question__title": "Master Mind LCCI", "question__title_slug": "master-mind-lcci", "question__hide": false, - "total_acs": 18427, - "total_submitted": 40943, + "total_acs": 18507, + "total_submitted": 41111, "total_column_articles": 365, "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": 6846, - "total_submitted": 12351, + "total_acs": 6884, + "total_submitted": 12438, "total_column_articles": 93, "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": 4133, - "total_submitted": 9381, + "total_acs": 4170, + "total_submitted": 9472, "total_column_articles": 89, "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": 62086, - "total_submitted": 141700, + "total_acs": 62226, + "total_submitted": 141987, "total_column_articles": 681, "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": 18567, - "total_submitted": 28013, + "total_acs": 18647, + "total_submitted": 28137, "total_column_articles": 282, "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": 4549, - "total_submitted": 8026, + "total_acs": 4580, + "total_submitted": 8127, "total_column_articles": 65, "frontend_question_id": "面试题 16.09", "is_new_question": false @@ -5346,8 +5346,8 @@ "question__title": "Maximum LCCI", "question__title_slug": "maximum-lcci", "question__hide": false, - "total_acs": 39817, - "total_submitted": 53209, + "total_acs": 40073, + "total_submitted": 53553, "total_column_articles": 466, "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": 35860, - "total_submitted": 51761, - "total_column_articles": 395, + "total_acs": 36087, + "total_submitted": 52071, + "total_column_articles": 396, "frontend_question_id": "面试题 08.08", "is_new_question": false }, @@ -5388,9 +5388,9 @@ "question__title": "寻找二叉树的最近公共祖先", "question__title_slug": "er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof", "question__hide": false, - "total_acs": 234206, - "total_submitted": 334482, - "total_column_articles": 1182, + "total_acs": 234683, + "total_submitted": 335209, + "total_column_articles": 1183, "frontend_question_id": "LCR 194", "is_new_question": false }, @@ -5409,8 +5409,8 @@ "question__title": "求二叉搜索树的最近公共祖先", "question__title_slug": "er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof", "question__hide": false, - "total_acs": 240605, - "total_submitted": 348660, + "total_acs": 240974, + "total_submitted": 349248, "total_column_articles": 1174, "frontend_question_id": "LCR 193", "is_new_question": false @@ -5430,9 +5430,9 @@ "question__title": "设计机械累加器", "question__title_slug": "qiu-12n-lcof", "question__hide": false, - "total_acs": 258096, - "total_submitted": 301381, - "total_column_articles": 1854, + "total_acs": 258467, + "total_submitted": 301817, + "total_column_articles": 1856, "frontend_question_id": "LCR 189", "is_new_question": false }, @@ -5451,9 +5451,9 @@ "question__title": "买卖芯片的最佳时机", "question__title_slug": "gu-piao-de-zui-da-li-run-lcof", "question__hide": false, - "total_acs": 289626, - "total_submitted": 462539, - "total_column_articles": 1681, + "total_acs": 289904, + "total_submitted": 463028, + "total_column_articles": 1682, "frontend_question_id": "LCR 188", "is_new_question": false }, @@ -5472,9 +5472,9 @@ "question__title": "破冰游戏", "question__title_slug": "yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof", "question__hide": false, - "total_acs": 206490, - "total_submitted": 317246, - "total_column_articles": 1139, + "total_acs": 206830, + "total_submitted": 317745, + "total_column_articles": 1140, "frontend_question_id": "LCR 187", "is_new_question": false }, @@ -5493,8 +5493,8 @@ "question__title": "判断是否为平衡二叉树", "question__title_slug": "ping-heng-er-cha-shu-lcof", "question__hide": false, - "total_acs": 272792, - "total_submitted": 458743, + "total_acs": 273269, + "total_submitted": 459590, "total_column_articles": 1549, "frontend_question_id": "LCR 176", "is_new_question": false @@ -5514,9 +5514,9 @@ "question__title": "文物朝代判断", "question__title_slug": "bu-ke-pai-zhong-de-shun-zi-lcof", "question__hide": false, - "total_acs": 231210, - "total_submitted": 513189, - "total_column_articles": 1819, + "total_acs": 231533, + "total_submitted": 513881, + "total_column_articles": 1820, "frontend_question_id": "LCR 186", "is_new_question": false }, @@ -5535,9 +5535,9 @@ "question__title": "把字符串转换成整数 (atoi)", "question__title_slug": "ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof", "question__hide": false, - "total_acs": 154019, - "total_submitted": 557545, - "total_column_articles": 1103, + "total_acs": 154364, + "total_submitted": 559324, + "total_column_articles": 1105, "frontend_question_id": "LCR 192", "is_new_question": false }, @@ -5556,9 +5556,9 @@ "question__title": "统计结果概率", "question__title_slug": "nge-tou-zi-de-dian-shu-lcof", "question__hide": false, - "total_acs": 134867, - "total_submitted": 234382, - "total_column_articles": 1038, + "total_acs": 135079, + "total_submitted": 234645, + "total_column_articles": 1040, "frontend_question_id": "LCR 185", "is_new_question": false }, @@ -5577,8 +5577,8 @@ "question__title": "按规则计算统计结果", "question__title_slug": "gou-jian-cheng-ji-shu-zu-lcof", "question__hide": false, - "total_acs": 160370, - "total_submitted": 279713, + "total_acs": 160693, + "total_submitted": 280404, "total_column_articles": 1006, "frontend_question_id": "LCR 191", "is_new_question": false @@ -5598,9 +5598,9 @@ "question__title": "设计自助结算系统", "question__title_slug": "dui-lie-de-zui-da-zhi-lcof", "question__hide": false, - "total_acs": 182369, - "total_submitted": 382587, - "total_column_articles": 1510, + "total_acs": 182676, + "total_submitted": 383184, + "total_column_articles": 1511, "frontend_question_id": "LCR 184", "is_new_question": false }, @@ -5619,8 +5619,8 @@ "question__title": "望远镜中最高的海拔", "question__title_slug": "hua-dong-chuang-kou-de-zui-da-zhi-lcof", "question__hide": false, - "total_acs": 242054, - "total_submitted": 542544, + "total_acs": 242351, + "total_submitted": 543188, "total_column_articles": 1808, "frontend_question_id": "LCR 183", "is_new_question": false @@ -5640,9 +5640,9 @@ "question__title": "加密运算", "question__title_slug": "bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof", "question__hide": false, - "total_acs": 155188, - "total_submitted": 257097, - "total_column_articles": 872, + "total_acs": 155414, + "total_submitted": 257372, + "total_column_articles": 873, "frontend_question_id": "LCR 190", "is_new_question": false }, @@ -5661,8 +5661,8 @@ "question__title": "丑数", "question__title_slug": "chou-shu-lcof", "question__hide": false, - "total_acs": 177501, - "total_submitted": 276253, + "total_acs": 177786, + "total_submitted": 276751, "total_column_articles": 912, "frontend_question_id": "LCR 168", "is_new_question": false @@ -5682,8 +5682,8 @@ "question__title": "寻找二叉搜索树中的目标节点", "question__title_slug": "er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof", "question__hide": false, - "total_acs": 324894, - "total_submitted": 425494, + "total_acs": 325455, + "total_submitted": 426178, "total_column_articles": 1960, "frontend_question_id": "LCR 174", "is_new_question": false @@ -5703,9 +5703,9 @@ "question__title": "招式拆解 I", "question__title_slug": "zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 321776, - "total_submitted": 699732, - "total_column_articles": 1917, + "total_acs": 322089, + "total_submitted": 700459, + "total_column_articles": 1920, "frontend_question_id": "LCR 167", "is_new_question": false }, @@ -5724,9 +5724,9 @@ "question__title": "点名", "question__title_slug": "que-shi-de-shu-zi-lcof", "question__hide": false, - "total_acs": 373981, - "total_submitted": 834872, - "total_column_articles": 2629, + "total_acs": 374600, + "total_submitted": 836190, + "total_column_articles": 2631, "frontend_question_id": "LCR 173", "is_new_question": false }, @@ -5745,9 +5745,9 @@ "question__title": "动态口令", "question__title_slug": "zuo-xuan-zhuan-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 536753, - "total_submitted": 628502, - "total_column_articles": 3425, + "total_acs": 537375, + "total_submitted": 629234, + "total_column_articles": 3429, "frontend_question_id": "LCR 182", "is_new_question": false }, @@ -5766,9 +5766,9 @@ "question__title": "统计目标成绩的出现次数", "question__title_slug": "zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof", "question__hide": false, - "total_acs": 409898, - "total_submitted": 778539, - "total_column_articles": 2723, + "total_acs": 410411, + "total_submitted": 779428, + "total_column_articles": 2726, "frontend_question_id": "LCR 172", "is_new_question": false }, @@ -5787,9 +5787,9 @@ "question__title": "字符串中的单词反转", "question__title_slug": "fan-zhuan-dan-ci-shun-xu-lcof", "question__hide": false, - "total_acs": 277413, - "total_submitted": 618871, - "total_column_articles": 1740, + "total_acs": 277946, + "total_submitted": 619893, + "total_column_articles": 1743, "frontend_question_id": "LCR 181", "is_new_question": false }, @@ -5808,9 +5808,9 @@ "question__title": "珠宝的最高价值", "question__title_slug": "li-wu-de-zui-da-jie-zhi-lcof", "question__hide": false, - "total_acs": 290880, - "total_submitted": 420129, - "total_column_articles": 1983, + "total_acs": 291804, + "total_submitted": 421425, + "total_column_articles": 1987, "frontend_question_id": "LCR 166", "is_new_question": false }, @@ -5829,8 +5829,8 @@ "question__title": "训练计划 V", "question__title_slug": "liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof", "question__hide": false, - "total_acs": 339550, - "total_submitted": 519302, + "total_acs": 339994, + "total_submitted": 519963, "total_column_articles": 1664, "frontend_question_id": "LCR 171", "is_new_question": false @@ -5850,9 +5850,9 @@ "question__title": "解密数字", "question__title_slug": "ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 264754, - "total_submitted": 518877, - "total_column_articles": 2404, + "total_acs": 265126, + "total_submitted": 519477, + "total_column_articles": 2405, "frontend_question_id": "LCR 165", "is_new_question": false }, @@ -5871,8 +5871,8 @@ "question__title": "文件组合", "question__title_slug": "he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof", "question__hide": false, - "total_acs": 256809, - "total_submitted": 362851, + "total_acs": 257208, + "total_submitted": 363430, "total_column_articles": 2529, "frontend_question_id": "LCR 180", "is_new_question": false @@ -5892,9 +5892,9 @@ "question__title": "破解闯关密码", "question__title_slug": "ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof", "question__hide": false, - "total_acs": 240964, - "total_submitted": 440204, - "total_column_articles": 1527, + "total_acs": 241403, + "total_submitted": 440975, + "total_column_articles": 1528, "frontend_question_id": "LCR 164", "is_new_question": false }, @@ -5913,9 +5913,9 @@ "question__title": "查找总价格为目标值的两个商品", "question__title_slug": "he-wei-sde-liang-ge-shu-zi-lcof", "question__hide": false, - "total_acs": 293094, - "total_submitted": 432502, - "total_column_articles": 1539, + "total_acs": 293634, + "total_submitted": 433251, + "total_column_articles": 1541, "frontend_question_id": "LCR 179", "is_new_question": false }, @@ -5934,9 +5934,9 @@ "question__title": "训练计划 VI", "question__title_slug": "shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof", "question__hide": false, - "total_acs": 178458, - "total_submitted": 221512, - "total_column_articles": 1134, + "total_acs": 178630, + "total_submitted": 221763, + "total_column_articles": 1135, "frontend_question_id": "LCR 178", "is_new_question": false }, @@ -5955,8 +5955,8 @@ "question__title": "撞色搭配", "question__title_slug": "shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof", "question__hide": false, - "total_acs": 213519, - "total_submitted": 310735, + "total_acs": 213730, + "total_submitted": 311002, "total_column_articles": 1614, "frontend_question_id": "LCR 177", "is_new_question": false @@ -5976,9 +5976,9 @@ "question__title": "计算二叉树的深度", "question__title_slug": "er-cha-shu-de-shen-du-lcof", "question__hide": false, - "total_acs": 334352, - "total_submitted": 421725, - "total_column_articles": 1946, + "total_acs": 335141, + "total_submitted": 422765, + "total_column_articles": 1948, "frontend_question_id": "LCR 175", "is_new_question": false }, @@ -5997,9 +5997,9 @@ "question__title": "交易逆序对的总数", "question__title_slug": "shu-zu-zhong-de-ni-xu-dui-lcof", "question__hide": false, - "total_acs": 220635, - "total_submitted": 444836, - "total_column_articles": 1569, + "total_acs": 221437, + "total_submitted": 446398, + "total_column_articles": 1571, "frontend_question_id": "LCR 170", "is_new_question": false }, @@ -6018,8 +6018,8 @@ "question__title": "二叉树中和为目标值的路径", "question__title_slug": "er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof", "question__hide": false, - "total_acs": 281836, - "total_submitted": 476531, + "total_acs": 282261, + "total_submitted": 477156, "total_column_articles": 1575, "frontend_question_id": "LCR 153", "is_new_question": false @@ -6039,9 +6039,9 @@ "question__title": "招式拆解 II", "question__title_slug": "di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof", "question__hide": false, - "total_acs": 340358, - "total_submitted": 550804, - "total_column_articles": 1899, + "total_acs": 340749, + "total_submitted": 551398, + "total_column_articles": 1900, "frontend_question_id": "LCR 169", "is_new_question": false }, @@ -6060,9 +6060,9 @@ "question__title": "验证二叉搜索树的后序遍历序列", "question__title_slug": "er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof", "question__hide": false, - "total_acs": 237772, - "total_submitted": 417189, - "total_column_articles": 1726, + "total_acs": 238116, + "total_submitted": 417779, + "total_column_articles": 1729, "frontend_question_id": "LCR 152", "is_new_question": false }, @@ -6081,8 +6081,8 @@ "question__title": "彩灯装饰记录 III", "question__title_slug": "cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof", "question__hide": false, - "total_acs": 273793, - "total_submitted": 471092, + "total_acs": 274090, + "total_submitted": 471514, "total_column_articles": 2197, "frontend_question_id": "LCR 151", "is_new_question": false @@ -6102,9 +6102,9 @@ "question__title": "找到第 k 位数字", "question__title_slug": "shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof", "question__hide": false, - "total_acs": 113144, - "total_submitted": 262748, - "total_column_articles": 824, + "total_acs": 113266, + "total_submitted": 263037, + "total_column_articles": 825, "frontend_question_id": "LCR 163", "is_new_question": false }, @@ -6123,9 +6123,9 @@ "question__title": "彩灯装饰记录 II", "question__title_slug": "cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof", "question__hide": false, - "total_acs": 295454, - "total_submitted": 429800, - "total_column_articles": 1970, + "total_acs": 295710, + "total_submitted": 430160, + "total_column_articles": 1971, "frontend_question_id": "LCR 150", "is_new_question": false }, @@ -6144,9 +6144,9 @@ "question__title": "彩灯装饰记录 I", "question__title_slug": "cong-shang-dao-xia-da-yin-er-cha-shu-lcof", "question__hide": false, - "total_acs": 300571, - "total_submitted": 477157, - "total_column_articles": 1768, + "total_acs": 300864, + "total_submitted": 477603, + "total_column_articles": 1769, "frontend_question_id": "LCR 149", "is_new_question": false }, @@ -6165,8 +6165,8 @@ "question__title": "库存管理 II", "question__title_slug": "shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof", "question__hide": false, - "total_acs": 321384, - "total_submitted": 460024, + "total_acs": 321735, + "total_submitted": 460555, "total_column_articles": 1642, "frontend_question_id": "LCR 158", "is_new_question": false @@ -6186,8 +6186,8 @@ "question__title": "数字 1 的个数", "question__title_slug": "1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof", "question__hide": false, - "total_acs": 95030, - "total_submitted": 188398, + "total_acs": 95165, + "total_submitted": 188705, "total_column_articles": 820, "frontend_question_id": "LCR 162", "is_new_question": false @@ -6207,8 +6207,8 @@ "question__title": "套餐内商品的排列顺序", "question__title_slug": "zi-fu-chuan-de-pai-lie-lcof", "question__hide": false, - "total_acs": 289123, - "total_submitted": 504307, + "total_acs": 289464, + "total_submitted": 504952, "total_column_articles": 1687, "frontend_question_id": "LCR 157", "is_new_question": false @@ -6228,9 +6228,9 @@ "question__title": "序列化与反序列化二叉树", "question__title_slug": "xu-lie-hua-er-cha-shu-lcof", "question__hide": false, - "total_acs": 145340, - "total_submitted": 253812, - "total_column_articles": 901, + "total_acs": 145508, + "total_submitted": 254136, + "total_column_articles": 902, "frontend_question_id": "LCR 156", "is_new_question": false }, @@ -6249,8 +6249,8 @@ "question__title": "验证图书取出顺序", "question__title_slug": "zhan-de-ya-ru-dan-chu-xu-lie-lcof", "question__hide": false, - "total_acs": 234602, - "total_submitted": 384173, + "total_acs": 234852, + "total_submitted": 384609, "total_column_articles": 1613, "frontend_question_id": "LCR 148", "is_new_question": false @@ -6270,9 +6270,9 @@ "question__title": "将二叉搜索树转化为排序的双向链表", "question__title_slug": "er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof", "question__hide": false, - "total_acs": 232092, - "total_submitted": 356760, - "total_column_articles": 1725, + "total_acs": 232556, + "total_submitted": 357350, + "total_column_articles": 1728, "frontend_question_id": "LCR 155", "is_new_question": false }, @@ -6291,8 +6291,8 @@ "question__title": "连续天数的最高销售额", "question__title_slug": "lian-xu-zi-shu-zu-de-zui-da-he-lcof", "question__hide": false, - "total_acs": 430504, - "total_submitted": 717015, + "total_acs": 430984, + "total_submitted": 717800, "total_column_articles": 2378, "frontend_question_id": "LCR 161", "is_new_question": false @@ -6312,9 +6312,9 @@ "question__title": "数据流中的中位数", "question__title_slug": "shu-ju-liu-zhong-de-zhong-wei-shu-lcof", "question__hide": false, - "total_acs": 145339, - "total_submitted": 250149, - "total_column_articles": 916, + "total_acs": 145572, + "total_submitted": 250571, + "total_column_articles": 917, "frontend_question_id": "LCR 160", "is_new_question": false }, @@ -6333,9 +6333,9 @@ "question__title": "最小栈", "question__title_slug": "bao-han-minhan-shu-de-zhan-lcof", "question__hide": false, - "total_acs": 374032, - "total_submitted": 676677, - "total_column_articles": 2107, + "total_acs": 374470, + "total_submitted": 677390, + "total_column_articles": 2111, "frontend_question_id": "LCR 147", "is_new_question": false }, @@ -6354,9 +6354,9 @@ "question__title": "库存管理 III", "question__title_slug": "zui-xiao-de-kge-shu-lcof", "question__hide": false, - "total_acs": 466414, - "total_submitted": 807858, - "total_column_articles": 2634, + "total_acs": 467063, + "total_submitted": 808994, + "total_column_articles": 2635, "frontend_question_id": "LCR 159", "is_new_question": false }, @@ -6375,9 +6375,9 @@ "question__title": "随机链表的复制", "question__title_slug": "fu-za-lian-biao-de-fu-zhi-lcof", "question__hide": false, - "total_acs": 307435, - "total_submitted": 430477, - "total_column_articles": 1883, + "total_acs": 307820, + "total_submitted": 431053, + "total_column_articles": 1884, "frontend_question_id": "LCR 154", "is_new_question": false }, @@ -6396,9 +6396,9 @@ "question__title": "删除链表的节点", "question__title_slug": "shan-chu-lian-biao-de-jie-dian-lcof", "question__hide": false, - "total_acs": 395794, - "total_submitted": 667017, - "total_column_articles": 2450, + "total_acs": 396679, + "total_submitted": 668614, + "total_column_articles": 2455, "frontend_question_id": "LCR 136", "is_new_question": false }, @@ -6417,9 +6417,9 @@ "question__title": "训练计划 III", "question__title_slug": "fan-zhuan-lian-biao-lcof", "question__hide": false, - "total_acs": 607599, - "total_submitted": 820106, - "total_column_articles": 3068, + "total_acs": 608232, + "total_submitted": 820972, + "total_column_articles": 3069, "frontend_question_id": "LCR 141", "is_new_question": false }, @@ -6438,8 +6438,8 @@ "question__title": "模糊搜索验证", "question__title_slug": "zheng-ze-biao-da-shi-pi-pei-lcof", "question__hide": false, - "total_acs": 128536, - "total_submitted": 336549, + "total_acs": 128686, + "total_submitted": 336996, "total_column_articles": 743, "frontend_question_id": "LCR 137", "is_new_question": false @@ -6459,8 +6459,8 @@ "question__title": "报数", "question__title_slug": "da-yin-cong-1dao-zui-da-de-nwei-shu-lcof", "question__hide": false, - "total_acs": 274983, - "total_submitted": 354406, + "total_acs": 275332, + "total_submitted": 354864, "total_column_articles": 1636, "frontend_question_id": "LCR 135", "is_new_question": false @@ -6480,8 +6480,8 @@ "question__title": "Pow(x, n)", "question__title_slug": "shu-zhi-de-zheng-shu-ci-fang-lcof", "question__hide": false, - "total_acs": 252568, - "total_submitted": 720012, + "total_acs": 252832, + "total_submitted": 720615, "total_column_articles": 1320, "frontend_question_id": "LCR 134", "is_new_question": false @@ -6501,9 +6501,9 @@ "question__title": "训练计划 II", "question__title_slug": "lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof", "question__hide": false, - "total_acs": 506888, - "total_submitted": 637477, - "total_column_articles": 3764, + "total_acs": 507899, + "total_submitted": 638850, + "total_column_articles": 3768, "frontend_question_id": "LCR 140", "is_new_question": false }, @@ -6522,9 +6522,9 @@ "question__title": "螺旋遍历二维数组", "question__title_slug": "shun-shi-zhen-da-yin-ju-zhen-lcof", "question__hide": false, - "total_acs": 285424, - "total_submitted": 673290, - "total_column_articles": 2330, + "total_acs": 286184, + "total_submitted": 675624, + "total_column_articles": 2333, "frontend_question_id": "LCR 146", "is_new_question": false }, @@ -6543,9 +6543,9 @@ "question__title": "位 1 的个数", "question__title_slug": "er-jin-zhi-zhong-1de-ge-shu-lcof", "question__hide": false, - "total_acs": 351810, - "total_submitted": 462935, - "total_column_articles": 1888, + "total_acs": 352183, + "total_submitted": 463353, + "total_column_articles": 1890, "frontend_question_id": "LCR 133", "is_new_question": false }, @@ -6564,9 +6564,9 @@ "question__title": "训练计划 I", "question__title_slug": "diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof", "question__hide": false, - "total_acs": 405917, - "total_submitted": 624696, - "total_column_articles": 2760, + "total_acs": 406577, + "total_submitted": 625670, + "total_column_articles": 2762, "frontend_question_id": "LCR 139", "is_new_question": false }, @@ -6585,9 +6585,9 @@ "question__title": "有效数字", "question__title_slug": "biao-shi-shu-zhi-de-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 158119, - "total_submitted": 637350, - "total_column_articles": 1668, + "total_acs": 158292, + "total_submitted": 638050, + "total_column_articles": 1669, "frontend_question_id": "LCR 138", "is_new_question": false }, @@ -6606,8 +6606,8 @@ "question__title": "判断对称二叉树", "question__title_slug": "dui-cheng-de-er-cha-shu-lcof", "question__hide": false, - "total_acs": 315594, - "total_submitted": 547338, + "total_acs": 316049, + "total_submitted": 548074, "total_column_articles": 1947, "frontend_question_id": "LCR 145", "is_new_question": false @@ -6627,9 +6627,9 @@ "question__title": "翻转二叉树", "question__title_slug": "er-cha-shu-de-jing-xiang-lcof", "question__hide": false, - "total_acs": 386888, - "total_submitted": 486902, - "total_column_articles": 2321, + "total_acs": 387729, + "total_submitted": 487978, + "total_column_articles": 2325, "frontend_question_id": "LCR 144", "is_new_question": false }, @@ -6648,8 +6648,8 @@ "question__title": "子结构判断", "question__title_slug": "shu-de-zi-jie-gou-lcof", "question__hide": false, - "total_acs": 330752, - "total_submitted": 713896, + "total_acs": 331323, + "total_submitted": 715103, "total_column_articles": 2178, "frontend_question_id": "LCR 143", "is_new_question": false @@ -6669,8 +6669,8 @@ "question__title": "训练计划 IV", "question__title_slug": "he-bing-liang-ge-pai-xu-de-lian-biao-lcof", "question__hide": false, - "total_acs": 387282, - "total_submitted": 539224, + "total_acs": 387806, + "total_submitted": 539930, "total_column_articles": 2010, "frontend_question_id": "LCR 142", "is_new_question": false @@ -6690,9 +6690,9 @@ "question__title": "砍竹子 II", "question__title_slug": "jian-sheng-zi-ii-lcof", "question__hide": false, - "total_acs": 159045, - "total_submitted": 507660, - "total_column_articles": 799, + "total_acs": 159247, + "total_submitted": 508311, + "total_column_articles": 800, "frontend_question_id": "LCR 132", "is_new_question": false }, @@ -6711,9 +6711,9 @@ "question__title": "砍竹子 I", "question__title_slug": "jian-sheng-zi-lcof", "question__hide": false, - "total_acs": 304684, - "total_submitted": 530907, - "total_column_articles": 2087, + "total_acs": 305022, + "total_submitted": 531496, + "total_column_articles": 2088, "frontend_question_id": "LCR 131", "is_new_question": false }, @@ -6732,9 +6732,9 @@ "question__title": "推理二叉树", "question__title_slug": "zhong-jian-er-cha-shu-lcof", "question__hide": false, - "total_acs": 353401, - "total_submitted": 504230, - "total_column_articles": 2228, + "total_acs": 353783, + "total_submitted": 504801, + "total_column_articles": 2229, "frontend_question_id": "LCR 124", "is_new_question": false }, @@ -6753,8 +6753,8 @@ "question__title": "图书整理 I", "question__title_slug": "cong-wei-dao-tou-da-yin-lian-biao-lcof", "question__hide": false, - "total_acs": 676082, - "total_submitted": 914345, + "total_acs": 676974, + "total_submitted": 915564, "total_column_articles": 3792, "frontend_question_id": "LCR 123", "is_new_question": false @@ -6774,9 +6774,9 @@ "question__title": "衣橱整理", "question__title_slug": "ji-qi-ren-de-yun-dong-fan-wei-lcof", "question__hide": false, - "total_acs": 335732, - "total_submitted": 627212, - "total_column_articles": 2628, + "total_acs": 336057, + "total_submitted": 627812, + "total_column_articles": 2630, "frontend_question_id": "LCR 130", "is_new_question": false }, @@ -6795,9 +6795,9 @@ "question__title": "路径加密", "question__title_slug": "ti-huan-kong-ge-lcof", "question__hide": false, - "total_acs": 744981, - "total_submitted": 995838, - "total_column_articles": 3726, + "total_acs": 745563, + "total_submitted": 996532, + "total_column_articles": 3727, "frontend_question_id": "LCR 122", "is_new_question": false }, @@ -6816,9 +6816,9 @@ "question__title": "字母迷宫", "question__title_slug": "ju-zhen-zhong-de-lu-jing-lcof", "question__hide": false, - "total_acs": 355747, - "total_submitted": 778887, - "total_column_articles": 1911, + "total_acs": 356050, + "total_submitted": 779490, + "total_column_articles": 1913, "frontend_question_id": "LCR 129", "is_new_question": false }, @@ -6837,8 +6837,8 @@ "question__title": "库存管理 I", "question__title_slug": "xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof", "question__hide": false, - "total_acs": 514046, - "total_submitted": 1037335, + "total_acs": 514491, + "total_submitted": 1038201, "total_column_articles": 2665, "frontend_question_id": "LCR 128", "is_new_question": false @@ -6858,9 +6858,9 @@ "question__title": "跳跃训练", "question__title_slug": "qing-wa-tiao-tai-jie-wen-ti-lcof", "question__hide": false, - "total_acs": 405745, - "total_submitted": 893963, - "total_column_articles": 2126, + "total_acs": 406163, + "total_submitted": 895182, + "total_column_articles": 2127, "frontend_question_id": "LCR 127", "is_new_question": false }, @@ -6879,8 +6879,8 @@ "question__title": "寻找目标值 - 二维数组", "question__title_slug": "er-wei-shu-zu-zhong-de-cha-zhao-lcof", "question__hide": false, - "total_acs": 545330, - "total_submitted": 1380499, + "total_acs": 545950, + "total_submitted": 1381983, "total_column_articles": 3616, "frontend_question_id": "LCR 121", "is_new_question": false @@ -6900,9 +6900,9 @@ "question__title": "寻找文件副本", "question__title_slug": "shu-zu-zhong-zhong-fu-de-shu-zi-lcof", "question__hide": false, - "total_acs": 793979, - "total_submitted": 1186776, - "total_column_articles": 4496, + "total_acs": 794881, + "total_submitted": 1188118, + "total_column_articles": 4497, "frontend_question_id": "LCR 120", "is_new_question": false }, @@ -6921,9 +6921,9 @@ "question__title": "斐波那契数", "question__title_slug": "fei-bo-na-qi-shu-lie-lcof", "question__hide": false, - "total_acs": 523719, - "total_submitted": 1466977, - "total_column_articles": 2927, + "total_acs": 524552, + "total_submitted": 1469466, + "total_column_articles": 2933, "frontend_question_id": "LCR 126", "is_new_question": false }, @@ -6942,8 +6942,8 @@ "question__title": "图书整理 II", "question__title_slug": "yong-liang-ge-zhan-shi-xian-dui-lie-lcof", "question__hide": false, - "total_acs": 597194, - "total_submitted": 849149, + "total_acs": 597645, + "total_submitted": 849723, "total_column_articles": 3078, "frontend_question_id": "LCR 125", "is_new_question": false @@ -6963,8 +6963,8 @@ "question__title": "Smallest Difference LCCI", "question__title_slug": "smallest-difference-lcci", "question__hide": false, - "total_acs": 24557, - "total_submitted": 57917, + "total_acs": 24684, + "total_submitted": 58219, "total_column_articles": 308, "frontend_question_id": "面试题 16.06", "is_new_question": false @@ -6984,8 +6984,8 @@ "question__title": "Tic-Tac-Toe LCCI", "question__title_slug": "tic-tac-toe-lcci", "question__hide": false, - "total_acs": 12868, - "total_submitted": 27090, + "total_acs": 12924, + "total_submitted": 27200, "total_column_articles": 232, "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": 11692, - "total_submitted": 26554, - "total_column_articles": 260, + "total_acs": 11715, + "total_submitted": 26597, + "total_column_articles": 261, "frontend_question_id": "面试题 16.03", "is_new_question": false }, @@ -7026,8 +7026,8 @@ "question__title": "Words Frequency LCCI", "question__title_slug": "words-frequency-lcci", "question__hide": false, - "total_acs": 25865, - "total_submitted": 33684, + "total_acs": 25965, + "total_submitted": 33828, "total_column_articles": 293, "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": 43981, - "total_submitted": 54515, - "total_column_articles": 593, + "total_acs": 44212, + "total_submitted": 54811, + "total_column_articles": 594, "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": 33535, - "total_submitted": 58808, - "total_column_articles": 390, + "total_acs": 33685, + "total_submitted": 59108, + "total_column_articles": 392, "frontend_question_id": "面试题 10.05", "is_new_question": false }, @@ -7089,9 +7089,9 @@ "question__title": "Permutation I LCCI", "question__title_slug": "permutation-i-lcci", "question__hide": false, - "total_acs": 35776, - "total_submitted": 44168, - "total_column_articles": 481, + "total_acs": 35934, + "total_submitted": 44367, + "total_column_articles": 482, "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": 65046, - "total_submitted": 96614, + "total_acs": 65203, + "total_submitted": 96862, "total_column_articles": 498, "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": 31696, - "total_submitted": 41441, - "total_column_articles": 442, + "total_acs": 31804, + "total_submitted": 41582, + "total_column_articles": 443, "frontend_question_id": "面试题 08.12", "is_new_question": false }, @@ -7152,8 +7152,8 @@ "question__title": "Search Rotate Array LCCI", "question__title_slug": "search-rotate-array-lcci", "question__hide": false, - "total_acs": 29633, - "total_submitted": 77782, + "total_acs": 29776, + "total_submitted": 78191, "total_column_articles": 323, "frontend_question_id": "面试题 10.03", "is_new_question": false @@ -7173,8 +7173,8 @@ "question__title": "Coin LCCI", "question__title_slug": "coin-lcci", "question__hide": false, - "total_acs": 46459, - "total_submitted": 93662, + "total_acs": 46573, + "total_submitted": 93913, "total_column_articles": 391, "frontend_question_id": "面试题 08.11", "is_new_question": false @@ -7194,8 +7194,8 @@ "question__title": "Reverse Bits LCCI", "question__title_slug": "reverse-bits-lcci", "question__hide": false, - "total_acs": 24687, - "total_submitted": 65404, + "total_acs": 24783, + "total_submitted": 65665, "total_column_articles": 385, "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": 29829, - "total_submitted": 45847, - "total_column_articles": 398, + "total_acs": 29919, + "total_submitted": 46018, + "total_column_articles": 401, "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": 21437, - "total_submitted": 36972, - "total_column_articles": 279, + "total_acs": 21541, + "total_submitted": 37121, + "total_column_articles": 281, "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": 39168, - "total_submitted": 51027, + "total_acs": 39245, + "total_submitted": 51131, "total_column_articles": 432, "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": 13737, - "total_submitted": 26954, + "total_acs": 13813, + "total_submitted": 27108, "total_column_articles": 140, "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": 25389, - "total_submitted": 45423, + "total_acs": 25475, + "total_submitted": 45577, "total_column_articles": 355, "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": 36052, - "total_submitted": 43886, + "total_acs": 36194, + "total_submitted": 44047, "total_column_articles": 518, "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": 53463, - "total_submitted": 81821, - "total_column_articles": 815, + "total_acs": 53775, + "total_submitted": 82304, + "total_column_articles": 818, "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": 34185, - "total_submitted": 41688, + "total_acs": 34276, + "total_submitted": 41793, "total_column_articles": 471, "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": 72273, - "total_submitted": 198219, - "total_column_articles": 711, + "total_acs": 72600, + "total_submitted": 199160, + "total_column_articles": 714, "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": 7587, - "total_submitted": 14183, + "total_acs": 7629, + "total_submitted": 14257, "total_column_articles": 147, "frontend_question_id": "面试题 05.08", "is_new_question": false @@ -7425,9 +7425,9 @@ "question__title": "Stack of Plates LCCI", "question__title_slug": "stack-of-plates-lcci", "question__hide": false, - "total_acs": 17899, - "total_submitted": 46517, - "total_column_articles": 217, + "total_acs": 17989, + "total_submitted": 46752, + "total_column_articles": 218, "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": 70855, - "total_submitted": 151619, - "total_column_articles": 793, + "total_acs": 71206, + "total_submitted": 152304, + "total_column_articles": 794, "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": 102030, - "total_submitted": 118858, - "total_column_articles": 894, + "total_acs": 102383, + "total_submitted": 119239, + "total_column_articles": 895, "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": 128832, - "total_submitted": 203682, - "total_column_articles": 1047, + "total_acs": 129461, + "total_submitted": 204678, + "total_column_articles": 1050, "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": 128901, - "total_submitted": 178422, - "total_column_articles": 1278, + "total_acs": 129599, + "total_submitted": 179380, + "total_column_articles": 1279, "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": 75757, - "total_submitted": 142290, - "total_column_articles": 1220, + "total_acs": 76073, + "total_submitted": 142878, + "total_column_articles": 1223, "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": 10113, - "total_submitted": 28598, + "total_acs": 10154, + "total_submitted": 28717, "total_column_articles": 219, "frontend_question_id": "面试题 05.04", "is_new_question": false @@ -7572,8 +7572,8 @@ "question__title": "Exchange LCCI", "question__title_slug": "exchange-lcci", "question__hide": false, - "total_acs": 20568, - "total_submitted": 28969, + "total_acs": 20631, + "total_submitted": 29058, "total_column_articles": 318, "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": 23587, - "total_submitted": 46095, + "total_acs": 23677, + "total_submitted": 46267, "total_column_articles": 353, "frontend_question_id": "面试题 05.06", "is_new_question": false @@ -7614,8 +7614,8 @@ "question__title": "Insert Into Bits LCCI", "question__title_slug": "insert-into-bits-lcci", "question__hide": false, - "total_acs": 19257, - "total_submitted": 37153, + "total_acs": 19353, + "total_submitted": 37296, "total_column_articles": 318, "frontend_question_id": "面试题 05.01", "is_new_question": false @@ -7635,9 +7635,9 @@ "question__title": "First Common Ancestor LCCI", "question__title_slug": "first-common-ancestor-lcci", "question__hide": false, - "total_acs": 30469, - "total_submitted": 42579, - "total_column_articles": 285, + "total_acs": 30564, + "total_submitted": 42706, + "total_column_articles": 286, "frontend_question_id": "面试题 04.08", "is_new_question": false }, @@ -7656,9 +7656,9 @@ "question__title": "Successor LCCI", "question__title_slug": "successor-lcci", "question__hide": false, - "total_acs": 68711, - "total_submitted": 109962, - "total_column_articles": 686, + "total_acs": 68873, + "total_submitted": 110200, + "total_column_articles": 687, "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": 42380, - "total_submitted": 118191, - "total_column_articles": 464, + "total_acs": 42531, + "total_submitted": 118496, + "total_column_articles": 465, "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": 48990, - "total_submitted": 81757, - "total_column_articles": 488, + "total_acs": 49134, + "total_submitted": 82009, + "total_column_articles": 489, "frontend_question_id": "面试题 04.04", "is_new_question": false }, @@ -7719,9 +7719,9 @@ "question__title": "List of Depth LCCI", "question__title_slug": "list-of-depth-lcci", "question__hide": false, - "total_acs": 38116, - "total_submitted": 47225, - "total_column_articles": 752, + "total_acs": 38251, + "total_submitted": 47373, + "total_column_articles": 756, "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": 52076, - "total_submitted": 65902, - "total_column_articles": 588, + "total_acs": 52239, + "total_submitted": 66085, + "total_column_articles": 591, "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": 29756, - "total_submitted": 55601, - "total_column_articles": 364, + "total_acs": 29901, + "total_submitted": 55867, + "total_column_articles": 366, "frontend_question_id": "面试题 03.05", "is_new_question": false }, @@ -7782,8 +7782,8 @@ "question__title": "Three in One LCCI", "question__title_slug": "three-in-one-lcci", "question__hide": false, - "total_acs": 23532, - "total_submitted": 44127, + "total_acs": 23652, + "total_submitted": 44390, "total_column_articles": 312, "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": 34049, - "total_submitted": 64468, - "total_column_articles": 416, + "total_acs": 34203, + "total_submitted": 64766, + "total_column_articles": 419, "frontend_question_id": "面试题 04.01", "is_new_question": false }, @@ -7824,9 +7824,9 @@ "question__title": "Implement Queue using Stacks LCCI", "question__title_slug": "implement-queue-using-stacks-lcci", "question__hide": false, - "total_acs": 37638, - "total_submitted": 52551, - "total_column_articles": 449, + "total_acs": 37850, + "total_submitted": 52847, + "total_column_articles": 450, "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": 43672, - "total_submitted": 70056, - "total_column_articles": 427, + "total_acs": 43849, + "total_submitted": 70302, + "total_column_articles": 429, "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": 46802, - "total_submitted": 83786, - "total_column_articles": 433, + "total_acs": 46977, + "total_submitted": 84048, + "total_column_articles": 435, "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": 236870, - "total_submitted": 356836, - "total_column_articles": 1437, + "total_acs": 240139, + "total_submitted": 361417, + "total_column_articles": 1444, "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": 68209, - "total_submitted": 139235, - "total_column_articles": 723, + "total_acs": 68549, + "total_submitted": 139846, + "total_column_articles": 725, "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": 100637, - "total_submitted": 151782, - "total_column_articles": 929, + "total_acs": 101069, + "total_submitted": 152484, + "total_column_articles": 930, "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": 92060, - "total_submitted": 171362, - "total_column_articles": 875, + "total_acs": 92294, + "total_submitted": 171867, + "total_column_articles": 878, "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": 118048, - "total_submitted": 257655, - "total_column_articles": 1524, + "total_acs": 118504, + "total_submitted": 258653, + "total_column_articles": 1528, "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": 84158, - "total_submitted": 146349, - "total_column_articles": 782, + "total_acs": 84474, + "total_submitted": 146837, + "total_column_articles": 784, "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": 138388, - "total_submitted": 211066, - "total_column_articles": 1948, + "total_acs": 138794, + "total_submitted": 211647, + "total_column_articles": 1949, "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": 169978, - "total_submitted": 238992, - "total_column_articles": 2330, + "total_acs": 170679, + "total_submitted": 239912, + "total_column_articles": 2334, "frontend_question_id": "面试题 01.01", "is_new_question": false }, @@ -8055,8 +8055,8 @@ "question__title": "Guess Numbers", "question__title_slug": "guess-numbers", "question__hide": false, - "total_acs": 106280, - "total_submitted": 125804, + "total_acs": 106656, + "total_submitted": 126208, "total_column_articles": 851, "frontend_question_id": "LCP 01", "is_new_question": false @@ -8076,9 +8076,9 @@ "question__title": "Programmable Robot", "question__title_slug": "programmable-robot", "question__hide": false, - "total_acs": 16604, - "total_submitted": 70589, - "total_column_articles": 256, + "total_acs": 16642, + "total_submitted": 70694, + "total_column_articles": 257, "frontend_question_id": "LCP 03", "is_new_question": false }, @@ -8097,9 +8097,9 @@ "question__title": "Coin Bonus", "question__title_slug": "coin-bonus", "question__hide": false, - "total_acs": 3293, - "total_submitted": 14586, - "total_column_articles": 73, + "total_acs": 3317, + "total_submitted": 14639, + "total_column_articles": 74, "frontend_question_id": "LCP 05", "is_new_question": false }, @@ -8118,9 +8118,9 @@ "question__title": "Broken Board Dominoes", "question__title_slug": "broken-board-dominoes", "question__hide": false, - "total_acs": 4598, - "total_submitted": 10977, - "total_column_articles": 98, + "total_acs": 4628, + "total_submitted": 11014, + "total_column_articles": 99, "frontend_question_id": "LCP 04", "is_new_question": false }, @@ -8139,9 +8139,9 @@ "question__title": "Deep Dark Fraction", "question__title_slug": "deep-dark-fraction", "question__hide": false, - "total_acs": 21417, - "total_submitted": 30513, - "total_column_articles": 348, + "total_acs": 21465, + "total_submitted": 30576, + "total_column_articles": 349, "frontend_question_id": "LCP 02", "is_new_question": false }, @@ -8156,14 +8156,14 @@ }, { "stat": { - "question_id": 3457, - "question__title": "Invalid Tweets II", - "question__title_slug": "invalid-tweets-ii", + "question_id": 3481, + "question__title": "Second Day Verification", + "question__title_slug": "second-day-verification", "question__hide": false, - "total_acs": 43, - "total_submitted": 51, - "total_column_articles": 4, - "frontend_question_id": "3150", + "total_acs": 28, + "total_submitted": 36, + "total_column_articles": 3, + "frontend_question_id": "3172", "is_new_question": true }, "status": null, @@ -8175,17 +8175,164 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 3474, + "question__title": "Better Compression of String", + "question__title_slug": "better-compression-of-string", + "question__hide": false, + "total_acs": 53, + "total_submitted": 57, + "total_column_articles": 3, + "frontend_question_id": "3167", + "is_new_question": true + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3473, + "question__title": "Calculate Parking Fees and Duration", + "question__title_slug": "calculate-parking-fees-and-duration", + "question__hide": false, + "total_acs": 45, + "total_submitted": 69, + "total_column_articles": 5, + "frontend_question_id": "3166", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3467, + "question__title": "Find the Level of Tree with Minimum Sum", + "question__title_slug": "find-the-level-of-tree-with-minimum-sum", + "question__hide": false, + "total_acs": 47, + "total_submitted": 56, + "total_column_articles": 5, + "frontend_question_id": "3157", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3465, + "question__title": "Employee Task Duration and Concurrent Tasks", + "question__title_slug": "employee-task-duration-and-concurrent-tasks", + "question__hide": false, + "total_acs": 40, + "total_submitted": 87, + "total_column_articles": 3, + "frontend_question_id": "3156", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3458, + "question__title": "Maximum Number of Upgradable Servers", + "question__title_slug": "maximum-number-of-upgradable-servers", + "question__hide": false, + "total_acs": 58, + "total_submitted": 333, + "total_column_articles": 5, + "frontend_question_id": "3155", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3457, + "question__title": "Invalid Tweets II", + "question__title_slug": "invalid-tweets-ii", + "question__hide": false, + "total_acs": 94, + "total_submitted": 109, + "total_column_articles": 5, + "frontend_question_id": "3150", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3451, + "question__title": "String Compression III", + "question__title_slug": "string-compression-iii", + "question__hide": false, + "total_acs": 4923, + "total_submitted": 8525, + "total_column_articles": 38, + "frontend_question_id": "3163", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 3449, "question__title": "Maximum Hamming Distances", "question__title_slug": "maximum-hamming-distances", "question__hide": false, - "total_acs": 224, - "total_submitted": 246, - "total_column_articles": 3, + "total_acs": 232, + "total_submitted": 344, + "total_column_articles": 4, "frontend_question_id": "3141", - "is_new_question": true + "is_new_question": false }, "status": null, "difficulty": { @@ -8202,9 +8349,9 @@ "question__title": "Consecutive Available Seats II", "question__title_slug": "consecutive-available-seats-ii", "question__hide": false, - "total_acs": 51, - "total_submitted": 80, - "total_column_articles": 4, + "total_acs": 90, + "total_submitted": 152, + "total_column_articles": 5, "frontend_question_id": "3140", "is_new_question": false }, @@ -8217,15 +8364,78 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 3446, + "question__title": "Find the Number of Good Pairs I", + "question__title_slug": "find-the-number-of-good-pairs-i", + "question__hide": false, + "total_acs": 5216, + "total_submitted": 6397, + "total_column_articles": 20, + "frontend_question_id": "3162", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3445, + "question__title": "Lexicographically Minimum String After Removing Stars", + "question__title_slug": "lexicographically-minimum-string-after-removing-stars", + "question__hide": false, + "total_acs": 3718, + "total_submitted": 8953, + "total_column_articles": 50, + "frontend_question_id": "3170", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3444, + "question__title": "Find the Number of Good Pairs II", + "question__title_slug": "find-the-number-of-good-pairs-ii", + "question__hide": false, + "total_acs": 4619, + "total_submitted": 15477, + "total_column_articles": 37, + "frontend_question_id": "3164", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 3441, "question__title": "Equalize Strings by Adding or Removing Characters at Ends", "question__title_slug": "equalize-strings-by-adding-or-removing-characters-at-ends", "question__hide": false, - "total_acs": 86, - "total_submitted": 117, - "total_column_articles": 4, + "total_acs": 97, + "total_submitted": 140, + "total_column_articles": 5, "frontend_question_id": "3135", "is_new_question": false }, @@ -8244,9 +8454,9 @@ "question__title": "Server Utilization Time", "question__title_slug": "server-utilization-time", "question__hide": false, - "total_acs": 82, - "total_submitted": 209, - "total_column_articles": 4, + "total_acs": 101, + "total_submitted": 240, + "total_column_articles": 5, "frontend_question_id": "3126", "is_new_question": false }, @@ -8259,14 +8469,77 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 3436, + "question__title": "Find Subarray With Bitwise AND Closest to K", + "question__title_slug": "find-subarray-with-bitwise-and-closest-to-k", + "question__hide": false, + "total_acs": 2751, + "total_submitted": 7318, + "total_column_articles": 26, + "frontend_question_id": "3171", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3435, + "question__title": "Block Placement Queries", + "question__title_slug": "block-placement-queries", + "question__hide": false, + "total_acs": 1560, + "total_submitted": 5611, + "total_column_articles": 31, + "frontend_question_id": "3161", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3434, + "question__title": "Find the Number of Distinct Colors Among the Balls", + "question__title_slug": "find-the-number-of-distinct-colors-among-the-balls", + "question__hide": false, + "total_acs": 2864, + "total_submitted": 6650, + "total_column_articles": 33, + "frontend_question_id": "3160", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 3433, "question__title": "Maximum Number That Makes Result of Bitwise AND Zero", "question__title_slug": "maximum-number-that-makes-result-of-bitwise-and-zero", "question__hide": false, - "total_acs": 64, - "total_submitted": 76, + "total_acs": 75, + "total_submitted": 91, "total_column_articles": 4, "frontend_question_id": "3125", "is_new_question": false @@ -8286,9 +8559,9 @@ "question__title": "Find Longest Calls", "question__title_slug": "find-longest-calls", "question__hide": false, - "total_acs": 105, - "total_submitted": 171, - "total_column_articles": 4, + "total_acs": 128, + "total_submitted": 210, + "total_column_articles": 5, "frontend_question_id": "3124", "is_new_question": false }, @@ -8307,9 +8580,9 @@ "question__title": "Find the Minimum Cost Array Permutation", "question__title_slug": "find-the-minimum-cost-array-permutation", "question__hide": false, - "total_acs": 1975, - "total_submitted": 4878, - "total_column_articles": 22, + "total_acs": 2368, + "total_submitted": 5769, + "total_column_articles": 25, "frontend_question_id": "3149", "is_new_question": false }, @@ -8322,15 +8595,120 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 3430, + "question__title": "Count Days Without Meetings", + "question__title_slug": "count-days-without-meetings", + "question__hide": false, + "total_acs": 4555, + "total_submitted": 11057, + "total_column_articles": 43, + "frontend_question_id": "3169", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3429, + "question__title": "Special Array I", + "question__title_slug": "special-array-i", + "question__hide": false, + "total_acs": 5888, + "total_submitted": 7059, + "total_column_articles": 34, + "frontend_question_id": "3151", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3428, + "question__title": "Find the XOR of Numbers Which Appear Twice", + "question__title_slug": "find-the-xor-of-numbers-which-appear-twice", + "question__hide": false, + "total_acs": 3167, + "total_submitted": 3954, + "total_column_articles": 25, + "frontend_question_id": "3158", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3427, + "question__title": "Special Array II", + "question__title_slug": "special-array-ii", + "question__hide": false, + "total_acs": 5121, + "total_submitted": 16771, + "total_column_articles": 64, + "frontend_question_id": "3152", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3426, + "question__title": "Minimum Number of Chairs in a Waiting Room", + "question__title_slug": "minimum-number-of-chairs-in-a-waiting-room", + "question__hide": false, + "total_acs": 4729, + "total_submitted": 5480, + "total_column_articles": 28, + "frontend_question_id": "3168", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 3425, "question__title": "Maximum Number of Potholes That Can Be Fixed", "question__title_slug": "maximum-number-of-potholes-that-can-be-fixed", "question__hide": false, - "total_acs": 89, - "total_submitted": 117, - "total_column_articles": 4, + "total_acs": 105, + "total_submitted": 251, + "total_column_articles": 5, "frontend_question_id": "3119", "is_new_question": false }, @@ -8349,8 +8727,8 @@ "question__title": "Friday Purchase III ", "question__title_slug": "friday-purchase-iii", "question__hide": false, - "total_acs": 66, - "total_submitted": 110, + "total_acs": 92, + "total_submitted": 150, "total_column_articles": 5, "frontend_question_id": "3118", "is_new_question": false @@ -8364,15 +8742,57 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 3423, + "question__title": "Maximum Sum of Subsequence With Non-adjacent Elements", + "question__title_slug": "maximum-sum-of-subsequence-with-non-adjacent-elements", + "question__hide": false, + "total_acs": 1539, + "total_submitted": 5508, + "total_column_articles": 17, + "frontend_question_id": "3165", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3420, + "question__title": "Find Occurrences of an Element in an Array", + "question__title_slug": "find-occurrences-of-an-element-in-an-array", + "question__hide": false, + "total_acs": 3117, + "total_submitted": 3746, + "total_column_articles": 22, + "frontend_question_id": "3159", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 3419, "question__title": "Maximum Points Inside the Square", "question__title_slug": "maximum-points-inside-the-square", "question__hide": false, - "total_acs": 2415, - "total_submitted": 6421, - "total_column_articles": 37, + "total_acs": 2823, + "total_submitted": 7320, + "total_column_articles": 40, "frontend_question_id": "3143", "is_new_question": false }, @@ -8391,9 +8811,9 @@ "question__title": "Find the Index of Permutation", "question__title_slug": "find-the-index-of-permutation", "question__hide": false, - "total_acs": 91, - "total_submitted": 123, - "total_column_articles": 3, + "total_acs": 105, + "total_submitted": 274, + "total_column_articles": 4, "frontend_question_id": "3109", "is_new_question": false }, @@ -8406,14 +8826,35 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 3416, + "question__title": "Sum of Digit Differences of All Pairs", + "question__title_slug": "sum-of-digit-differences-of-all-pairs", + "question__hide": false, + "total_acs": 4235, + "total_submitted": 7730, + "total_column_articles": 51, + "frontend_question_id": "3153", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 3415, "question__title": "Check if Grid Satisfies Conditions", "question__title_slug": "check-if-grid-satisfies-conditions", "question__hide": false, - "total_acs": 2676, - "total_submitted": 3906, + "total_acs": 3147, + "total_submitted": 4546, "total_column_articles": 16, "frontend_question_id": "3142", "is_new_question": false @@ -8427,15 +8868,36 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 3414, + "question__title": "Find Number of Ways to Reach the K-th Stair", + "question__title_slug": "find-number-of-ways-to-reach-the-k-th-stair", + "question__hide": false, + "total_acs": 3260, + "total_submitted": 7168, + "total_column_articles": 42, + "frontend_question_id": "3154", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 3412, "question__title": "Permutation Difference between Two Strings", "question__title_slug": "permutation-difference-between-two-strings", "question__hide": false, - "total_acs": 4583, - "total_submitted": 5380, - "total_column_articles": 35, + "total_acs": 5553, + "total_submitted": 6537, + "total_column_articles": 40, "frontend_question_id": "3146", "is_new_question": false }, @@ -8454,9 +8916,9 @@ "question__title": "Find Products of Elements of Big Array", "question__title_slug": "find-products-of-elements-of-big-array", "question__hide": false, - "total_acs": 535, - "total_submitted": 1235, - "total_column_articles": 9, + "total_acs": 748, + "total_submitted": 1615, + "total_column_articles": 11, "frontend_question_id": "3145", "is_new_question": false }, @@ -8475,8 +8937,8 @@ "question__title": "Find Longest Self-Contained Substring", "question__title_slug": "find-longest-self-contained-substring", "question__hide": false, - "total_acs": 395, - "total_submitted": 435, + "total_acs": 401, + "total_submitted": 470, "total_column_articles": 3, "frontend_question_id": "3104", "is_new_question": false @@ -8496,9 +8958,9 @@ "question__title": "Find Trending Hashtags II ", "question__title_slug": "find-trending-hashtags-ii", "question__hide": false, - "total_acs": 66, - "total_submitted": 161, - "total_column_articles": 2, + "total_acs": 82, + "total_submitted": 183, + "total_column_articles": 3, "frontend_question_id": "3103", "is_new_question": false }, @@ -8517,9 +8979,9 @@ "question__title": "Count the Number of Special Characters I", "question__title_slug": "count-the-number-of-special-characters-i", "question__hide": false, - "total_acs": 5802, - "total_submitted": 7891, - "total_column_articles": 40, + "total_acs": 6183, + "total_submitted": 8468, + "total_column_articles": 42, "frontend_question_id": "3120", "is_new_question": false }, @@ -8538,8 +9000,8 @@ "question__title": "Find All Possible Stable Binary Arrays II", "question__title_slug": "find-all-possible-stable-binary-arrays-ii", "question__hide": false, - "total_acs": 1646, - "total_submitted": 3322, + "total_acs": 1787, + "total_submitted": 3594, "total_column_articles": 20, "frontend_question_id": "3130", "is_new_question": false @@ -8559,9 +9021,9 @@ "question__title": "Find All Possible Stable Binary Arrays I", "question__title_slug": "find-all-possible-stable-binary-arrays-i", "question__hide": false, - "total_acs": 1307, - "total_submitted": 4892, - "total_column_articles": 16, + "total_acs": 1518, + "total_submitted": 5372, + "total_column_articles": 15, "frontend_question_id": "3129", "is_new_question": false }, @@ -8580,9 +9042,9 @@ "question__title": "Count the Number of Special Characters II", "question__title_slug": "count-the-number-of-special-characters-ii", "question__hide": false, - "total_acs": 5494, - "total_submitted": 11403, - "total_column_articles": 53, + "total_acs": 5610, + "total_submitted": 11799, + "total_column_articles": 55, "frontend_question_id": "3121", "is_new_question": false }, @@ -8601,8 +9063,8 @@ "question__title": "Minimum Number of Operations to Satisfy Conditions", "question__title_slug": "minimum-number-of-operations-to-satisfy-conditions", "question__hide": false, - "total_acs": 3930, - "total_submitted": 7940, + "total_acs": 4073, + "total_submitted": 8349, "total_column_articles": 54, "frontend_question_id": "3122", "is_new_question": false @@ -8622,8 +9084,8 @@ "question__title": "Minimum Substring Partition of Equal Character Frequency", "question__title_slug": "minimum-substring-partition-of-equal-character-frequency", "question__hide": false, - "total_acs": 1958, - "total_submitted": 4038, + "total_acs": 2332, + "total_submitted": 4637, "total_column_articles": 22, "frontend_question_id": "3144", "is_new_question": false @@ -8643,9 +9105,9 @@ "question__title": "Minimum Cost to Equalize Array", "question__title_slug": "minimum-cost-to-equalize-array", "question__hide": false, - "total_acs": 1770, - "total_submitted": 7694, - "total_column_articles": 20, + "total_acs": 1896, + "total_submitted": 8209, + "total_column_articles": 21, "frontend_question_id": "3139", "is_new_question": false }, @@ -8664,8 +9126,8 @@ "question__title": "Guess the Number Using Bitwise Questions II", "question__title_slug": "guess-the-number-using-bitwise-questions-ii", "question__hide": false, - "total_acs": 80, - "total_submitted": 93, + "total_acs": 93, + "total_submitted": 109, "total_column_articles": 4, "frontend_question_id": "3094", "is_new_question": false @@ -8685,9 +9147,9 @@ "question__title": "Find Bursty Behavior", "question__title_slug": "find-bursty-behavior", "question__hide": false, - "total_acs": 120, - "total_submitted": 354, - "total_column_articles": 6, + "total_acs": 150, + "total_submitted": 418, + "total_column_articles": 7, "frontend_question_id": "3089", "is_new_question": false }, @@ -8706,9 +9168,9 @@ "question__title": "Find the Integer Added to Array II", "question__title_slug": "find-the-integer-added-to-array-ii", "question__hide": false, - "total_acs": 3944, - "total_submitted": 10008, - "total_column_articles": 34, + "total_acs": 4088, + "total_submitted": 10369, + "total_column_articles": 36, "frontend_question_id": "3132", "is_new_question": false }, @@ -8727,8 +9189,8 @@ "question__title": "Make a Square with the Same Color", "question__title_slug": "make-a-square-with-the-same-color", "question__hide": false, - "total_acs": 2826, - "total_submitted": 4613, + "total_acs": 3004, + "total_submitted": 5183, "total_column_articles": 21, "frontend_question_id": "3127", "is_new_question": false @@ -8748,9 +9210,9 @@ "question__title": "Find the Integer Added to Array I", "question__title_slug": "find-the-integer-added-to-array-i", "question__hide": false, - "total_acs": 5025, - "total_submitted": 5906, - "total_column_articles": 25, + "total_acs": 5357, + "total_submitted": 6587, + "total_column_articles": 28, "frontend_question_id": "3131", "is_new_question": false }, @@ -8769,9 +9231,9 @@ "question__title": "Valid Word", "question__title_slug": "valid-word", "question__hide": false, - "total_acs": 4543, - "total_submitted": 9432, - "total_column_articles": 37, + "total_acs": 5035, + "total_submitted": 10252, + "total_column_articles": 41, "frontend_question_id": "3136", "is_new_question": false }, @@ -8790,9 +9252,9 @@ "question__title": "Minimum Length of Anagram Concatenation", "question__title_slug": "minimum-length-of-anagram-concatenation", "question__hide": false, - "total_acs": 3723, - "total_submitted": 9938, - "total_column_articles": 50, + "total_acs": 3900, + "total_submitted": 10399, + "total_column_articles": 51, "frontend_question_id": "3138", "is_new_question": false }, @@ -8811,8 +9273,8 @@ "question__title": "Minimum Array End", "question__title_slug": "minimum-array-end", "question__hide": false, - "total_acs": 3374, - "total_submitted": 7698, + "total_acs": 3563, + "total_submitted": 8168, "total_column_articles": 35, "frontend_question_id": "3133", "is_new_question": false @@ -8832,8 +9294,8 @@ "question__title": "Make String Anti-palindrome", "question__title_slug": "make-string-anti-palindrome", "question__hide": false, - "total_acs": 223, - "total_submitted": 302, + "total_acs": 230, + "total_submitted": 438, "total_column_articles": 4, "frontend_question_id": "3088", "is_new_question": false @@ -8853,8 +9315,8 @@ "question__title": "Find Trending Hashtags", "question__title_slug": "find-trending-hashtags", "question__hide": false, - "total_acs": 139, - "total_submitted": 215, + "total_acs": 166, + "total_submitted": 268, "total_column_articles": 6, "frontend_question_id": "3087", "is_new_question": false @@ -8874,9 +9336,9 @@ "question__title": "Maximum Difference Score in a Grid", "question__title_slug": "maximum-difference-score-in-a-grid", "question__hide": false, - "total_acs": 3357, - "total_submitted": 6878, - "total_column_articles": 46, + "total_acs": 4100, + "total_submitted": 8227, + "total_column_articles": 51, "frontend_question_id": "3148", "is_new_question": false }, @@ -8895,9 +9357,9 @@ "question__title": "Minimum Rectangles to Cover Points", "question__title_slug": "minimum-rectangles-to-cover-points", "question__hide": false, - "total_acs": 3385, - "total_submitted": 4997, - "total_column_articles": 34, + "total_acs": 3586, + "total_submitted": 5430, + "total_column_articles": 35, "frontend_question_id": "3111", "is_new_question": false }, @@ -8916,9 +9378,9 @@ "question__title": "Minimum Time to Visit Disappearing Nodes", "question__title_slug": "minimum-time-to-visit-disappearing-nodes", "question__hide": false, - "total_acs": 2810, - "total_submitted": 7822, - "total_column_articles": 30, + "total_acs": 2922, + "total_submitted": 8220, + "total_column_articles": 31, "frontend_question_id": "3112", "is_new_question": false }, @@ -8937,8 +9399,8 @@ "question__title": "Right Triangles", "question__title_slug": "right-triangles", "question__hide": false, - "total_acs": 2603, - "total_submitted": 4595, + "total_acs": 2740, + "total_submitted": 4909, "total_column_articles": 19, "frontend_question_id": "3128", "is_new_question": false @@ -8958,9 +9420,9 @@ "question__title": "Minimum Operations to Make Median of Array Equal to K", "question__title_slug": "minimum-operations-to-make-median-of-array-equal-to-k", "question__hide": false, - "total_acs": 4277, - "total_submitted": 8307, - "total_column_articles": 46, + "total_acs": 4391, + "total_submitted": 8669, + "total_column_articles": 47, "frontend_question_id": "3107", "is_new_question": false }, @@ -8979,9 +9441,9 @@ "question__title": "Find Edges in Shortest Paths", "question__title_slug": "find-edges-in-shortest-paths", "question__hide": false, - "total_acs": 3315, - "total_submitted": 5886, - "total_column_articles": 44, + "total_acs": 3422, + "total_submitted": 6217, + "total_column_articles": 46, "frontend_question_id": "3123", "is_new_question": false }, @@ -9000,8 +9462,8 @@ "question__title": "Match Alphanumerical Pattern in Matrix I", "question__title_slug": "match-alphanumerical-pattern-in-matrix-i", "question__hide": false, - "total_acs": 87, - "total_submitted": 151, + "total_acs": 93, + "total_submitted": 160, "total_column_articles": 4, "frontend_question_id": "3078", "is_new_question": false @@ -9021,9 +9483,9 @@ "question__title": "Minimum Number of Operations to Make Word K-Periodic", "question__title_slug": "minimum-number-of-operations-to-make-word-k-periodic", "question__hide": false, - "total_acs": 3775, - "total_submitted": 5537, - "total_column_articles": 24, + "total_acs": 3941, + "total_submitted": 5893, + "total_column_articles": 25, "frontend_question_id": "3137", "is_new_question": false }, @@ -9042,9 +9504,9 @@ "question__title": "Taking Maximum Energy From the Mystic Dungeon", "question__title_slug": "taking-maximum-energy-from-the-mystic-dungeon", "question__hide": false, - "total_acs": 4316, - "total_submitted": 9346, - "total_column_articles": 51, + "total_acs": 5048, + "total_submitted": 10882, + "total_column_articles": 58, "frontend_question_id": "3147", "is_new_question": false }, @@ -9063,8 +9525,8 @@ "question__title": "Find the Number of Subarrays Where Boundary Elements Are Maximum", "question__title_slug": "find-the-number-of-subarrays-where-boundary-elements-are-maximum", "question__hide": false, - "total_acs": 2527, - "total_submitted": 5522, + "total_acs": 2656, + "total_submitted": 5816, "total_column_articles": 53, "frontend_question_id": "3113", "is_new_question": false @@ -9084,8 +9546,8 @@ "question__title": "Shortest Subarray With OR at Least K I", "question__title_slug": "shortest-subarray-with-or-at-least-k-i", "question__hide": false, - "total_acs": 3327, - "total_submitted": 7657, + "total_acs": 3648, + "total_submitted": 8157, "total_column_articles": 25, "frontend_question_id": "3095", "is_new_question": false @@ -9105,9 +9567,9 @@ "question__title": "Shortest Subarray With OR at Least K II", "question__title_slug": "shortest-subarray-with-or-at-least-k-ii", "question__hide": false, - "total_acs": 2928, - "total_submitted": 7513, - "total_column_articles": 39, + "total_acs": 3083, + "total_submitted": 7975, + "total_column_articles": 40, "frontend_question_id": "3097", "is_new_question": false }, @@ -9126,9 +9588,9 @@ "question__title": "Score of a String", "question__title_slug": "score-of-a-string", "question__hide": false, - "total_acs": 4720, - "total_submitted": 5141, - "total_column_articles": 38, + "total_acs": 5618, + "total_submitted": 6111, + "total_column_articles": 43, "frontend_question_id": "3110", "is_new_question": false }, @@ -9147,8 +9609,8 @@ "question__title": "Maximum Increasing Triplet Value", "question__title_slug": "maximum-increasing-triplet-value", "question__hide": false, - "total_acs": 91, - "total_submitted": 269, + "total_acs": 101, + "total_submitted": 289, "total_column_articles": 6, "frontend_question_id": "3073", "is_new_question": false @@ -9168,8 +9630,8 @@ "question__title": "Longest Common Suffix Queries", "question__title_slug": "longest-common-suffix-queries", "question__hide": false, - "total_acs": 3558, - "total_submitted": 9848, + "total_acs": 3628, + "total_submitted": 10101, "total_column_articles": 45, "frontend_question_id": "3093", "is_new_question": false @@ -9189,9 +9651,9 @@ "question__title": "Kth Smallest Amount With Single Denomination Combination", "question__title_slug": "kth-smallest-amount-with-single-denomination-combination", "question__hide": false, - "total_acs": 2815, - "total_submitted": 13155, - "total_column_articles": 29, + "total_acs": 2977, + "total_submitted": 13539, + "total_column_articles": 31, "frontend_question_id": "3116", "is_new_question": false }, @@ -9210,9 +9672,9 @@ "question__title": "Count Alternating Subarrays", "question__title_slug": "count-alternating-subarrays", "question__hide": false, - "total_acs": 5951, - "total_submitted": 11416, - "total_column_articles": 60, + "total_acs": 6130, + "total_submitted": 11751, + "total_column_articles": 62, "frontend_question_id": "3101", "is_new_question": false }, @@ -9231,9 +9693,9 @@ "question__title": "Maximum Prime Difference", "question__title_slug": "maximum-prime-difference", "question__hide": false, - "total_acs": 6041, - "total_submitted": 10307, - "total_column_articles": 54, + "total_acs": 6512, + "total_submitted": 11205, + "total_column_articles": 56, "frontend_question_id": "3115", "is_new_question": false }, @@ -9252,9 +9714,9 @@ "question__title": "Longest Strictly Increasing or Strictly Decreasing Subarray", "question__title_slug": "longest-strictly-increasing-or-strictly-decreasing-subarray", "question__hide": false, - "total_acs": 5420, - "total_submitted": 9165, - "total_column_articles": 60, + "total_acs": 5790, + "total_submitted": 9700, + "total_column_articles": 62, "frontend_question_id": "3105", "is_new_question": false }, @@ -9273,9 +9735,9 @@ "question__title": "Harshad Number", "question__title_slug": "harshad-number", "question__hide": false, - "total_acs": 6990, - "total_submitted": 8405, - "total_column_articles": 40, + "total_acs": 7610, + "total_submitted": 9080, + "total_column_articles": 42, "frontend_question_id": "3099", "is_new_question": false }, @@ -9294,8 +9756,8 @@ "question__title": "Guess the Number Using Bitwise Questions I", "question__title_slug": "guess-the-number-using-bitwise-questions-i", "question__hide": false, - "total_acs": 108, - "total_submitted": 119, + "total_acs": 113, + "total_submitted": 124, "total_column_articles": 4, "frontend_question_id": "3064", "is_new_question": false @@ -9315,8 +9777,8 @@ "question__title": "Calculate Trapping Rain Water", "question__title_slug": "calculate-trapping-rain-water", "question__hide": false, - "total_acs": 103, - "total_submitted": 142, + "total_acs": 119, + "total_submitted": 169, "total_column_articles": 4, "frontend_question_id": "3061", "is_new_question": false @@ -9336,8 +9798,8 @@ "question__title": "Winner of the Linked List Game", "question__title_slug": "winner-of-the-linked-list-game", "question__hide": false, - "total_acs": 162, - "total_submitted": 204, + "total_acs": 173, + "total_submitted": 215, "total_column_articles": 9, "frontend_question_id": "3062", "is_new_question": false @@ -9357,9 +9819,9 @@ "question__title": "Find the Sum of Encrypted Integers", "question__title_slug": "find-the-sum-of-encrypted-integers", "question__hide": false, - "total_acs": 4654, - "total_submitted": 5809, - "total_column_articles": 36, + "total_acs": 4942, + "total_submitted": 6304, + "total_column_articles": 37, "frontend_question_id": "3079", "is_new_question": false }, @@ -9378,8 +9840,8 @@ "question__title": "User Activities within Time Bounds", "question__title_slug": "user-activities-within-time-bounds", "question__hide": false, - "total_acs": 137, - "total_submitted": 360, + "total_acs": 160, + "total_submitted": 416, "total_column_articles": 5, "frontend_question_id": "3060", "is_new_question": false @@ -9399,8 +9861,8 @@ "question__title": "Find All Unique Email Domains", "question__title_slug": "find-all-unique-email-domains", "question__hide": false, - "total_acs": 230, - "total_submitted": 347, + "total_acs": 248, + "total_submitted": 373, "total_column_articles": 7, "frontend_question_id": "3059", "is_new_question": false @@ -9420,9 +9882,9 @@ "question__title": "Minimum Sum of Values by Dividing Array", "question__title_slug": "minimum-sum-of-values-by-dividing-array", "question__hide": false, - "total_acs": 2187, - "total_submitted": 6174, - "total_column_articles": 25, + "total_acs": 2291, + "total_submitted": 6408, + "total_column_articles": 26, "frontend_question_id": "3117", "is_new_question": false }, @@ -9441,9 +9903,9 @@ "question__title": "Most Frequent IDs", "question__title_slug": "most-frequent-ids", "question__hide": false, - "total_acs": 5184, - "total_submitted": 11989, - "total_column_articles": 68, + "total_acs": 5270, + "total_submitted": 12357, + "total_column_articles": 70, "frontend_question_id": "3092", "is_new_question": false }, @@ -9462,9 +9924,9 @@ "question__title": "Find the Median of the Uniqueness Array", "question__title_slug": "find-the-median-of-the-uniqueness-array", "question__hide": false, - "total_acs": 2055, - "total_submitted": 4710, - "total_column_articles": 17, + "total_acs": 2172, + "total_submitted": 5022, + "total_column_articles": 18, "frontend_question_id": "3134", "is_new_question": false }, @@ -9483,9 +9945,9 @@ "question__title": "Latest Time You Can Obtain After Replacing Characters", "question__title_slug": "latest-time-you-can-obtain-after-replacing-characters", "question__hide": false, - "total_acs": 5826, - "total_submitted": 14343, - "total_column_articles": 51, + "total_acs": 6043, + "total_submitted": 15092, + "total_column_articles": 53, "frontend_question_id": "3114", "is_new_question": false }, @@ -9504,8 +9966,8 @@ "question__title": "Minimum Deletions to Make String K-Special", "question__title_slug": "minimum-deletions-to-make-string-k-special", "question__hide": false, - "total_acs": 5238, - "total_submitted": 12386, + "total_acs": 5305, + "total_submitted": 12593, "total_column_articles": 66, "frontend_question_id": "3085", "is_new_question": false @@ -9525,8 +9987,8 @@ "question__title": "Linked List Frequency", "question__title_slug": "linked-list-frequency", "question__hide": false, - "total_acs": 201, - "total_submitted": 256, + "total_acs": 213, + "total_submitted": 366, "total_column_articles": 6, "frontend_question_id": "3063", "is_new_question": false @@ -9546,9 +10008,9 @@ "question__title": "Friends With No Mutual Friends", "question__title_slug": "friends-with-no-mutual-friends", "question__hide": false, - "total_acs": 153, - "total_submitted": 320, - "total_column_articles": 4, + "total_acs": 185, + "total_submitted": 397, + "total_column_articles": 5, "frontend_question_id": "3058", "is_new_question": false }, @@ -9567,8 +10029,8 @@ "question__title": "Employees Project Allocation", "question__title_slug": "employees-project-allocation", "question__hide": false, - "total_acs": 150, - "total_submitted": 219, + "total_acs": 171, + "total_submitted": 252, "total_column_articles": 4, "frontend_question_id": "3057", "is_new_question": false @@ -9588,9 +10050,9 @@ "question__title": "Shortest Uncommon Substring in an Array", "question__title_slug": "shortest-uncommon-substring-in-an-array", "question__hide": false, - "total_acs": 5446, - "total_submitted": 10783, - "total_column_articles": 45, + "total_acs": 5529, + "total_submitted": 10951, + "total_column_articles": 44, "frontend_question_id": "3076", "is_new_question": false }, @@ -9609,8 +10071,8 @@ "question__title": "Minimum Levels to Gain More Points", "question__title_slug": "minimum-levels-to-gain-more-points", "question__hide": false, - "total_acs": 3226, - "total_submitted": 6992, + "total_acs": 3285, + "total_submitted": 7420, "total_column_articles": 32, "frontend_question_id": "3096", "is_new_question": false @@ -9630,8 +10092,8 @@ "question__title": "Replace Question Marks in String to Minimize Its Value", "question__title_slug": "replace-question-marks-in-string-to-minimize-its-value", "question__hide": false, - "total_acs": 2571, - "total_submitted": 7283, + "total_acs": 2629, + "total_submitted": 7479, "total_column_articles": 44, "frontend_question_id": "3081", "is_new_question": false @@ -9651,9 +10113,9 @@ "question__title": "Existence of a Substring in a String and Its Reverse", "question__title_slug": "existence-of-a-substring-in-a-string-and-its-reverse", "question__hide": false, - "total_acs": 7178, - "total_submitted": 10014, - "total_column_articles": 51, + "total_acs": 7453, + "total_submitted": 10522, + "total_column_articles": 52, "frontend_question_id": "3083", "is_new_question": false }, @@ -9672,8 +10134,8 @@ "question__title": "Find Pattern in Infinite Stream II", "question__title_slug": "find-pattern-in-infinite-stream-ii", "question__hide": false, - "total_acs": 79, - "total_submitted": 223, + "total_acs": 85, + "total_submitted": 236, "total_column_articles": 4, "frontend_question_id": "3037", "is_new_question": false @@ -9693,8 +10155,8 @@ "question__title": "Maximize Happiness of Selected Children", "question__title_slug": "maximize-happiness-of-selected-children", "question__hide": false, - "total_acs": 6672, - "total_submitted": 13875, + "total_acs": 6748, + "total_submitted": 14096, "total_column_articles": 48, "frontend_question_id": "3075", "is_new_question": false @@ -9714,9 +10176,9 @@ "question__title": "Distribute Elements Into Two Arrays II", "question__title_slug": "distribute-elements-into-two-arrays-ii", "question__hide": false, - "total_acs": 3292, - "total_submitted": 8743, - "total_column_articles": 51, + "total_acs": 4670, + "total_submitted": 10643, + "total_column_articles": 55, "frontend_question_id": "3072", "is_new_question": false }, @@ -9735,8 +10197,8 @@ "question__title": "Maximum Length Substring With Two Occurrences", "question__title_slug": "maximum-length-substring-with-two-occurrences", "question__hide": false, - "total_acs": 7287, - "total_submitted": 11156, + "total_acs": 7509, + "total_submitted": 11771, "total_column_articles": 58, "frontend_question_id": "3090", "is_new_question": false @@ -9756,8 +10218,8 @@ "question__title": "Minimum Cost Walk in Weighted Graph", "question__title_slug": "minimum-cost-walk-in-weighted-graph", "question__hide": false, - "total_acs": 3588, - "total_submitted": 6738, + "total_acs": 3672, + "total_submitted": 6876, "total_column_articles": 42, "frontend_question_id": "3108", "is_new_question": false @@ -9777,9 +10239,9 @@ "question__title": "Distribute Elements Into Two Arrays I", "question__title_slug": "distribute-elements-into-two-arrays-i", "question__hide": false, - "total_acs": 6340, - "total_submitted": 7623, - "total_column_articles": 29, + "total_acs": 6530, + "total_submitted": 8116, + "total_column_articles": 31, "frontend_question_id": "3069", "is_new_question": false }, @@ -9798,9 +10260,9 @@ "question__title": "Lexicographically Smallest String After Operations With Constraint", "question__title_slug": "lexicographically-smallest-string-after-operations-with-constraint", "question__hide": false, - "total_acs": 4421, - "total_submitted": 6248, - "total_column_articles": 40, + "total_acs": 4504, + "total_submitted": 6409, + "total_column_articles": 41, "frontend_question_id": "3106", "is_new_question": false }, @@ -9819,9 +10281,9 @@ "question__title": "Find the Sum of the Power of All Subsequences", "question__title_slug": "find-the-sum-of-the-power-of-all-subsequences", "question__hide": false, - "total_acs": 2236, - "total_submitted": 4480, - "total_column_articles": 27, + "total_acs": 2381, + "total_submitted": 4703, + "total_column_articles": 26, "frontend_question_id": "3082", "is_new_question": false }, @@ -9840,9 +10302,9 @@ "question__title": "Minimize Manhattan Distances", "question__title_slug": "minimize-manhattan-distances", "question__hide": false, - "total_acs": 2595, - "total_submitted": 6691, - "total_column_articles": 35, + "total_acs": 2652, + "total_submitted": 6916, + "total_column_articles": 36, "frontend_question_id": "3102", "is_new_question": false }, @@ -9861,8 +10323,8 @@ "question__title": "Count Numbers With Unique Digits II", "question__title_slug": "count-numbers-with-unique-digits-ii", "question__hide": false, - "total_acs": 260, - "total_submitted": 297, + "total_acs": 275, + "total_submitted": 313, "total_column_articles": 8, "frontend_question_id": "3032", "is_new_question": false @@ -9882,8 +10344,8 @@ "question__title": "Snaps Analysis", "question__title_slug": "snaps-analysis", "question__hide": false, - "total_acs": 174, - "total_submitted": 288, + "total_acs": 200, + "total_submitted": 334, "total_column_articles": 5, "frontend_question_id": "3056", "is_new_question": false @@ -9903,8 +10365,8 @@ "question__title": "Top Percentile Fraud", "question__title_slug": "top-percentile-fraud", "question__hide": false, - "total_acs": 165, - "total_submitted": 257, + "total_acs": 182, + "total_submitted": 292, "total_column_articles": 6, "frontend_question_id": "3055", "is_new_question": false @@ -9924,9 +10386,9 @@ "question__title": "Count Submatrices with Top-Left Element and Sum Less Than k", "question__title_slug": "count-submatrices-with-top-left-element-and-sum-less-than-k", "question__hide": false, - "total_acs": 5471, - "total_submitted": 8881, - "total_column_articles": 50, + "total_acs": 5600, + "total_submitted": 9129, + "total_column_articles": 51, "frontend_question_id": "3070", "is_new_question": false }, @@ -9945,8 +10407,8 @@ "question__title": "Count Substrings Starting and Ending with Given Character", "question__title_slug": "count-substrings-starting-and-ending-with-given-character", "question__hide": false, - "total_acs": 6427, - "total_submitted": 12014, + "total_acs": 6510, + "total_submitted": 12192, "total_column_articles": 51, "frontend_question_id": "3084", "is_new_question": false @@ -9966,8 +10428,8 @@ "question__title": "Water Bottles II", "question__title_slug": "water-bottles-ii", "question__hide": false, - "total_acs": 5899, - "total_submitted": 7901, + "total_acs": 5984, + "total_submitted": 8107, "total_column_articles": 41, "frontend_question_id": "3100", "is_new_question": false @@ -9987,8 +10449,8 @@ "question__title": "Minimum Operations to Write the Letter Y on a Grid", "question__title_slug": "minimum-operations-to-write-the-letter-y-on-a-grid", "question__hide": false, - "total_acs": 4345, - "total_submitted": 6456, + "total_acs": 4404, + "total_submitted": 6638, "total_column_articles": 38, "frontend_question_id": "3071", "is_new_question": false @@ -10008,9 +10470,9 @@ "question__title": "Apple Redistribution into Boxes", "question__title_slug": "apple-redistribution-into-boxes", "question__hide": false, - "total_acs": 7175, - "total_submitted": 9384, - "total_column_articles": 51, + "total_acs": 7353, + "total_submitted": 9911, + "total_column_articles": 53, "frontend_question_id": "3074", "is_new_question": false }, @@ -10029,8 +10491,8 @@ "question__title": "Find Pattern in Infinite Stream I", "question__title_slug": "find-pattern-in-infinite-stream-i", "question__hide": false, - "total_acs": 90, - "total_submitted": 155, + "total_acs": 102, + "total_submitted": 287, "total_column_articles": 4, "frontend_question_id": "3023", "is_new_question": false @@ -10050,9 +10512,9 @@ "question__title": "Minimum Operations to Exceed Threshold Value II", "question__title_slug": "minimum-operations-to-exceed-threshold-value-ii", "question__hide": false, - "total_acs": 3679, - "total_submitted": 10636, - "total_column_articles": 26, + "total_acs": 3825, + "total_submitted": 11051, + "total_column_articles": 28, "frontend_question_id": "3066", "is_new_question": false }, @@ -10071,9 +10533,9 @@ "question__title": "Minimum Operations to Exceed Threshold Value I", "question__title_slug": "minimum-operations-to-exceed-threshold-value-i", "question__hide": false, - "total_acs": 5975, - "total_submitted": 6707, - "total_column_articles": 47, + "total_acs": 6363, + "total_submitted": 7394, + "total_column_articles": 49, "frontend_question_id": "3065", "is_new_question": false }, @@ -10092,9 +10554,9 @@ "question__title": "Modify the Matrix", "question__title_slug": "modify-the-matrix", "question__hide": false, - "total_acs": 4434, - "total_submitted": 5617, - "total_column_articles": 23, + "total_acs": 4817, + "total_submitted": 6074, + "total_column_articles": 27, "frontend_question_id": "3033", "is_new_question": false }, @@ -10113,8 +10575,8 @@ "question__title": "Find the Length of the Longest Common Prefix", "question__title_slug": "find-the-length-of-the-longest-common-prefix", "question__hide": false, - "total_acs": 3845, - "total_submitted": 9665, + "total_acs": 3925, + "total_submitted": 9931, "total_column_articles": 46, "frontend_question_id": "3043", "is_new_question": false @@ -10134,9 +10596,9 @@ "question__title": "Apply Operations to Make Sum of Array Greater Than or Equal to k", "question__title_slug": "apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k", "question__hide": false, - "total_acs": 6181, - "total_submitted": 12095, - "total_column_articles": 75, + "total_acs": 6286, + "total_submitted": 12379, + "total_column_articles": 78, "frontend_question_id": "3091", "is_new_question": false }, @@ -10155,9 +10617,9 @@ "question__title": "Minimum Moves to Pick K Ones", "question__title_slug": "minimum-moves-to-pick-k-ones", "question__hide": false, - "total_acs": 1551, - "total_submitted": 5887, - "total_column_articles": 21, + "total_acs": 1600, + "total_submitted": 6001, + "total_column_articles": 22, "frontend_question_id": "3086", "is_new_question": false }, @@ -10176,9 +10638,9 @@ "question__title": "Count Pairs of Connectable Servers in a Weighted Tree Network", "question__title_slug": "count-pairs-of-connectable-servers-in-a-weighted-tree-network", "question__hide": false, - "total_acs": 2296, - "total_submitted": 3605, - "total_column_articles": 25, + "total_acs": 13261, + "total_submitted": 17185, + "total_column_articles": 66, "frontend_question_id": "3067", "is_new_question": false }, @@ -10197,9 +10659,9 @@ "question__title": "Find the Largest Area of Square Inside Two Rectangles", "question__title_slug": "find-the-largest-area-of-square-inside-two-rectangles", "question__hide": false, - "total_acs": 3738, - "total_submitted": 8540, - "total_column_articles": 32, + "total_acs": 3864, + "total_submitted": 8736, + "total_column_articles": 34, "frontend_question_id": "3047", "is_new_question": false }, @@ -10218,9 +10680,9 @@ "question__title": "Split the Array", "question__title_slug": "split-the-array", "question__hide": false, - "total_acs": 5587, - "total_submitted": 7752, - "total_column_articles": 45, + "total_acs": 5771, + "total_submitted": 8236, + "total_column_articles": 47, "frontend_question_id": "3046", "is_new_question": false }, @@ -10239,8 +10701,8 @@ "question__title": "Maximum Number of Removal Queries That Can Be Processed I", "question__title_slug": "maximum-number-of-removal-queries-that-can-be-processed-i", "question__hide": false, - "total_acs": 270, - "total_submitted": 395, + "total_acs": 276, + "total_submitted": 412, "total_column_articles": 5, "frontend_question_id": "3018", "is_new_question": false @@ -10260,9 +10722,9 @@ "question__title": "Type of Triangle", "question__title_slug": "type-of-triangle", "question__hide": false, - "total_acs": 3886, - "total_submitted": 6963, - "total_column_articles": 34, + "total_acs": 4366, + "total_submitted": 7572, + "total_column_articles": 35, "frontend_question_id": "3024", "is_new_question": false }, @@ -10281,9 +10743,9 @@ "question__title": "Maximum Number of Operations With the Same Score I", "question__title_slug": "maximum-number-of-operations-with-the-same-score-i", "question__hide": false, - "total_acs": 3400, - "total_submitted": 5122, - "total_column_articles": 24, + "total_acs": 3540, + "total_submitted": 5620, + "total_column_articles": 28, "frontend_question_id": "3038", "is_new_question": false }, @@ -10302,9 +10764,9 @@ "question__title": "Maximum Number of Operations With the Same Score II", "question__title_slug": "maximum-number-of-operations-with-the-same-score-ii", "question__hide": false, - "total_acs": 2908, - "total_submitted": 8424, - "total_column_articles": 30, + "total_acs": 3078, + "total_submitted": 8901, + "total_column_articles": 32, "frontend_question_id": "3040", "is_new_question": false }, @@ -10323,8 +10785,8 @@ "question__title": "Maximum Palindromes After Operations", "question__title_slug": "maximum-palindromes-after-operations", "question__hide": false, - "total_acs": 2872, - "total_submitted": 5294, + "total_acs": 2900, + "total_submitted": 5487, "total_column_articles": 27, "frontend_question_id": "3035", "is_new_question": false @@ -10344,8 +10806,8 @@ "question__title": "Find the Sum of Subsequence Powers", "question__title_slug": "find-the-sum-of-subsequence-powers", "question__hide": false, - "total_acs": 1565, - "total_submitted": 3954, + "total_acs": 1628, + "total_submitted": 4095, "total_column_articles": 25, "frontend_question_id": "3098", "is_new_question": false @@ -10365,8 +10827,8 @@ "question__title": "Maximum Number of Intersections on the Chart", "question__title_slug": "maximum-number-of-intersections-on-the-chart", "question__hide": false, - "total_acs": 246, - "total_submitted": 452, + "total_acs": 261, + "total_submitted": 499, "total_column_articles": 6, "frontend_question_id": "3009", "is_new_question": false @@ -10386,9 +10848,9 @@ "question__title": "Most Frequent Prime", "question__title_slug": "most-frequent-prime", "question__hide": false, - "total_acs": 3551, - "total_submitted": 6597, - "total_column_articles": 23, + "total_acs": 3751, + "total_submitted": 6999, + "total_column_articles": 21, "frontend_question_id": "3044", "is_new_question": false }, @@ -10407,8 +10869,8 @@ "question__title": "Maximum Strength of K Disjoint Subarrays", "question__title_slug": "maximum-strength-of-k-disjoint-subarrays", "question__hide": false, - "total_acs": 2503, - "total_submitted": 5915, + "total_acs": 2556, + "total_submitted": 6045, "total_column_articles": 31, "frontend_question_id": "3077", "is_new_question": false @@ -10428,8 +10890,8 @@ "question__title": "Number of Changing Keys", "question__title_slug": "number-of-changing-keys", "question__hide": false, - "total_acs": 5861, - "total_submitted": 7075, + "total_acs": 6105, + "total_submitted": 7563, "total_column_articles": 45, "frontend_question_id": "3019", "is_new_question": false @@ -10449,8 +10911,8 @@ "question__title": "Ant on the Boundary", "question__title_slug": "ant-on-the-boundary", "question__hide": false, - "total_acs": 6519, - "total_submitted": 7695, + "total_acs": 6948, + "total_submitted": 8291, "total_column_articles": 50, "frontend_question_id": "3028", "is_new_question": false @@ -10470,9 +10932,9 @@ "question__title": "Count the Number of Houses at a Certain Distance II", "question__title_slug": "count-the-number-of-houses-at-a-certain-distance-ii", "question__hide": false, - "total_acs": 1665, - "total_submitted": 5268, - "total_column_articles": 37, + "total_acs": 1697, + "total_submitted": 5353, + "total_column_articles": 36, "frontend_question_id": "3017", "is_new_question": false }, @@ -10491,8 +10953,8 @@ "question__title": "Count Prefix and Suffix Pairs I", "question__title_slug": "count-prefix-and-suffix-pairs-i", "question__hide": false, - "total_acs": 4747, - "total_submitted": 6669, + "total_acs": 5001, + "total_submitted": 7122, "total_column_articles": 36, "frontend_question_id": "3042", "is_new_question": false @@ -10512,9 +10974,9 @@ "question__title": "Apply Operations to Make String Empty", "question__title_slug": "apply-operations-to-make-string-empty", "question__hide": false, - "total_acs": 3196, - "total_submitted": 4975, - "total_column_articles": 36, + "total_acs": 3300, + "total_submitted": 5223, + "total_column_articles": 40, "frontend_question_id": "3039", "is_new_question": false }, @@ -10533,9 +10995,9 @@ "question__title": "Find the Maximum Sum of Node Values", "question__title_slug": "find-the-maximum-sum-of-node-values", "question__hide": false, - "total_acs": 1896, - "total_submitted": 3615, - "total_column_articles": 23, + "total_acs": 2035, + "total_submitted": 3833, + "total_column_articles": 24, "frontend_question_id": "3068", "is_new_question": false }, @@ -10554,8 +11016,8 @@ "question__title": "Mark Elements on Array by Performing Queries", "question__title_slug": "mark-elements-on-array-by-performing-queries", "question__hide": false, - "total_acs": 3229, - "total_submitted": 6667, + "total_acs": 3315, + "total_submitted": 6878, "total_column_articles": 36, "frontend_question_id": "3080", "is_new_question": false @@ -10575,8 +11037,8 @@ "question__title": "Count Prefix and Suffix Pairs II", "question__title_slug": "count-prefix-and-suffix-pairs-ii", "question__hide": false, - "total_acs": 3368, - "total_submitted": 9807, + "total_acs": 3421, + "total_submitted": 9951, "total_column_articles": 38, "frontend_question_id": "3045", "is_new_question": false @@ -10596,8 +11058,8 @@ "question__title": "Maximum Subtree of the Same Color", "question__title_slug": "maximum-subtree-of-the-same-color", "question__hide": false, - "total_acs": 123, - "total_submitted": 160, + "total_acs": 131, + "total_submitted": 284, "total_column_articles": 6, "frontend_question_id": "3004", "is_new_question": false @@ -10617,9 +11079,9 @@ "question__title": "Find Beautiful Indices in the Given Array II", "question__title_slug": "find-beautiful-indices-in-the-given-array-ii", "question__hide": false, - "total_acs": 3225, - "total_submitted": 11008, - "total_column_articles": 48, + "total_acs": 3258, + "total_submitted": 11116, + "total_column_articles": 47, "frontend_question_id": "3008", "is_new_question": false }, @@ -10638,8 +11100,8 @@ "question__title": "Viewers Turned Streamers", "question__title_slug": "viewers-turned-streamers", "question__hide": false, - "total_acs": 230, - "total_submitted": 529, + "total_acs": 261, + "total_submitted": 589, "total_column_articles": 12, "frontend_question_id": "2995", "is_new_question": false @@ -10659,9 +11121,9 @@ "question__title": "Friday Purchases II ", "question__title_slug": "friday-purchases-ii", "question__hide": false, - "total_acs": 225, - "total_submitted": 332, - "total_column_articles": 10, + "total_acs": 253, + "total_submitted": 368, + "total_column_articles": 11, "frontend_question_id": "2994", "is_new_question": false }, @@ -10680,9 +11142,9 @@ "question__title": "Friday Purchases I", "question__title_slug": "friday-purchases-i", "question__hide": false, - "total_acs": 276, - "total_submitted": 347, - "total_column_articles": 8, + "total_acs": 322, + "total_submitted": 397, + "total_column_articles": 9, "frontend_question_id": "2993", "is_new_question": false }, @@ -10701,8 +11163,8 @@ "question__title": "Find the Maximum Number of Elements in Subset", "question__title_slug": "find-the-maximum-number-of-elements-in-subset", "question__hide": false, - "total_acs": 4805, - "total_submitted": 17070, + "total_acs": 4852, + "total_submitted": 17366, "total_column_articles": 54, "frontend_question_id": "3020", "is_new_question": false @@ -10722,9 +11184,9 @@ "question__title": "Maximize Consecutive Elements in an Array After Modification", "question__title_slug": "maximize-consecutive-elements-in-an-array-after-modification", "question__hide": false, - "total_acs": 2390, - "total_submitted": 5306, - "total_column_articles": 29, + "total_acs": 2421, + "total_submitted": 5389, + "total_column_articles": 30, "frontend_question_id": "3041", "is_new_question": false }, @@ -10743,8 +11205,8 @@ "question__title": "Minimum Time to Revert Word to Initial State I", "question__title_slug": "minimum-time-to-revert-word-to-initial-state-i", "question__hide": false, - "total_acs": 3570, - "total_submitted": 7663, + "total_acs": 3604, + "total_submitted": 7844, "total_column_articles": 24, "frontend_question_id": "3029", "is_new_question": false @@ -10764,9 +11226,9 @@ "question__title": "Minimum Time to Revert Word to Initial State II", "question__title_slug": "minimum-time-to-revert-word-to-initial-state-ii", "question__hide": false, - "total_acs": 3565, - "total_submitted": 9067, - "total_column_articles": 49, + "total_acs": 3627, + "total_submitted": 9190, + "total_column_articles": 48, "frontend_question_id": "3031", "is_new_question": false }, @@ -10785,8 +11247,8 @@ "question__title": "Number of Self-Divisible Permutations", "question__title_slug": "number-of-self-divisible-permutations", "question__hide": false, - "total_acs": 147, - "total_submitted": 206, + "total_acs": 152, + "total_submitted": 212, "total_column_articles": 9, "frontend_question_id": "2992", "is_new_question": false @@ -10806,9 +11268,9 @@ "question__title": "Earliest Second to Mark Indices I", "question__title_slug": "earliest-second-to-mark-indices-i", "question__hide": false, - "total_acs": 2652, - "total_submitted": 5524, - "total_column_articles": 27, + "total_acs": 2714, + "total_submitted": 5773, + "total_column_articles": 28, "frontend_question_id": "3048", "is_new_question": false }, @@ -10827,9 +11289,9 @@ "question__title": "Find if Array Can Be Sorted", "question__title_slug": "find-if-array-can-be-sorted", "question__hide": false, - "total_acs": 3372, - "total_submitted": 6488, - "total_column_articles": 42, + "total_acs": 3442, + "total_submitted": 6757, + "total_column_articles": 41, "frontend_question_id": "3011", "is_new_question": false }, @@ -10848,9 +11310,9 @@ "question__title": "Number of Subarrays That Match a Pattern II", "question__title_slug": "number-of-subarrays-that-match-a-pattern-ii", "question__hide": false, - "total_acs": 2661, - "total_submitted": 5622, - "total_column_articles": 25, + "total_acs": 2698, + "total_submitted": 5713, + "total_column_articles": 22, "frontend_question_id": "3036", "is_new_question": false }, @@ -10869,8 +11331,8 @@ "question__title": "Earliest Second to Mark Indices II", "question__title_slug": "earliest-second-to-mark-indices-ii", "question__hide": false, - "total_acs": 1304, - "total_submitted": 4341, + "total_acs": 1371, + "total_submitted": 4582, "total_column_articles": 12, "frontend_question_id": "3049", "is_new_question": false @@ -10890,8 +11352,8 @@ "question__title": "Top Three Wineries ", "question__title_slug": "top-three-wineries", "question__hide": false, - "total_acs": 241, - "total_submitted": 517, + "total_acs": 271, + "total_submitted": 593, "total_column_articles": 12, "frontend_question_id": "2991", "is_new_question": false @@ -10911,9 +11373,9 @@ "question__title": "Loan Types", "question__title_slug": "loan-types", "question__hide": false, - "total_acs": 347, - "total_submitted": 611, - "total_column_articles": 11, + "total_acs": 370, + "total_submitted": 639, + "total_column_articles": 13, "frontend_question_id": "2990", "is_new_question": false }, @@ -10932,9 +11394,9 @@ "question__title": "Class Performance", "question__title_slug": "class-performance", "question__hide": false, - "total_acs": 369, - "total_submitted": 443, - "total_column_articles": 8, + "total_acs": 407, + "total_submitted": 488, + "total_column_articles": 9, "frontend_question_id": "2989", "is_new_question": false }, @@ -10953,9 +11415,9 @@ "question__title": "Manager of the Largest Department", "question__title_slug": "manager-of-the-largest-department", "question__hide": false, - "total_acs": 308, - "total_submitted": 429, - "total_column_articles": 16, + "total_acs": 341, + "total_submitted": 477, + "total_column_articles": 17, "frontend_question_id": "2988", "is_new_question": false }, @@ -10974,9 +11436,9 @@ "question__title": "Find Expensive Cities", "question__title_slug": "find-expensive-cities", "question__hide": false, - "total_acs": 387, - "total_submitted": 494, - "total_column_articles": 11, + "total_acs": 411, + "total_submitted": 521, + "total_column_articles": 12, "frontend_question_id": "2987", "is_new_question": false }, @@ -10995,9 +11457,9 @@ "question__title": "Find Third Transaction", "question__title_slug": "find-third-transaction", "question__hide": false, - "total_acs": 307, - "total_submitted": 605, - "total_column_articles": 7, + "total_acs": 339, + "total_submitted": 699, + "total_column_articles": 8, "frontend_question_id": "2986", "is_new_question": false }, @@ -11016,8 +11478,8 @@ "question__title": "Calculate Compressed Mean", "question__title_slug": "calculate-compressed-mean", "question__hide": false, - "total_acs": 356, - "total_submitted": 425, + "total_acs": 383, + "total_submitted": 457, "total_column_articles": 5, "frontend_question_id": "2985", "is_new_question": false @@ -11037,8 +11499,8 @@ "question__title": "Find Peak Calling Hours for Each City", "question__title_slug": "find-peak-calling-hours-for-each-city", "question__hide": false, - "total_acs": 277, - "total_submitted": 514, + "total_acs": 309, + "total_submitted": 571, "total_column_articles": 7, "frontend_question_id": "2984", "is_new_question": false @@ -11058,8 +11520,8 @@ "question__title": "Alice and Bob Playing Flower Game", "question__title_slug": "alice-and-bob-playing-flower-game", "question__hide": false, - "total_acs": 3983, - "total_submitted": 7327, + "total_acs": 4048, + "total_submitted": 7577, "total_column_articles": 30, "frontend_question_id": "3021", "is_new_question": false @@ -11079,9 +11541,9 @@ "question__title": "Find the Number of Ways to Place People I", "question__title_slug": "find-the-number-of-ways-to-place-people-i", "question__hide": false, - "total_acs": 2357, - "total_submitted": 4498, - "total_column_articles": 16, + "total_acs": 2406, + "total_submitted": 4674, + "total_column_articles": 17, "frontend_question_id": "3025", "is_new_question": false }, @@ -11100,8 +11562,8 @@ "question__title": "Find the Number of Ways to Place People II", "question__title_slug": "find-the-number-of-ways-to-place-people-ii", "question__hide": false, - "total_acs": 2548, - "total_submitted": 4910, + "total_acs": 2591, + "total_submitted": 5013, "total_column_articles": 24, "frontend_question_id": "3027", "is_new_question": false @@ -11121,8 +11583,8 @@ "question__title": "Minimum Number of Pushes to Type Word II", "question__title_slug": "minimum-number-of-pushes-to-type-word-ii", "question__hide": false, - "total_acs": 4922, - "total_submitted": 6481, + "total_acs": 5034, + "total_submitted": 6766, "total_column_articles": 44, "frontend_question_id": "3016", "is_new_question": false @@ -11142,9 +11604,9 @@ "question__title": "Minimum Number of Pushes to Type Word I", "question__title_slug": "minimum-number-of-pushes-to-type-word-i", "question__hide": false, - "total_acs": 6704, - "total_submitted": 9547, - "total_column_articles": 57, + "total_acs": 6797, + "total_submitted": 10010, + "total_column_articles": 58, "frontend_question_id": "3014", "is_new_question": false }, @@ -11163,8 +11625,8 @@ "question__title": "Most Expensive Item That Can Not Be Bought", "question__title_slug": "most-expensive-item-that-can-not-be-bought", "question__hide": false, - "total_acs": 171, - "total_submitted": 193, + "total_acs": 182, + "total_submitted": 204, "total_column_articles": 7, "frontend_question_id": "2979", "is_new_question": false @@ -11184,9 +11646,9 @@ "question__title": "Find the Grid of Region Average", "question__title_slug": "find-the-grid-of-region-average", "question__hide": false, - "total_acs": 2414, - "total_submitted": 5014, - "total_column_articles": 25, + "total_acs": 2442, + "total_submitted": 5259, + "total_column_articles": 24, "frontend_question_id": "3030", "is_new_question": false }, @@ -11205,9 +11667,9 @@ "question__title": "Count the Number of Houses at a Certain Distance I", "question__title_slug": "count-the-number-of-houses-at-a-certain-distance-i", "question__hide": false, - "total_acs": 3553, - "total_submitted": 7627, - "total_column_articles": 41, + "total_acs": 3596, + "total_submitted": 7833, + "total_column_articles": 42, "frontend_question_id": "3015", "is_new_question": false }, @@ -11226,9 +11688,9 @@ "question__title": "Minimum Moves to Capture The Queen", "question__title_slug": "minimum-moves-to-capture-the-queen", "question__hide": false, - "total_acs": 3813, - "total_submitted": 16810, - "total_column_articles": 56, + "total_acs": 3857, + "total_submitted": 17065, + "total_column_articles": 57, "frontend_question_id": "3001", "is_new_question": false }, @@ -11247,9 +11709,9 @@ "question__title": "Number of Subarrays That Match a Pattern I", "question__title_slug": "number-of-subarrays-that-match-a-pattern-i", "question__hide": false, - "total_acs": 3068, - "total_submitted": 3968, - "total_column_articles": 11, + "total_acs": 3149, + "total_submitted": 4157, + "total_column_articles": 12, "frontend_question_id": "3034", "is_new_question": false }, @@ -11268,8 +11730,8 @@ "question__title": "Minimum Number of Coins for Fruits II", "question__title_slug": "minimum-number-of-coins-for-fruits-ii", "question__hide": false, - "total_acs": 153, - "total_submitted": 213, + "total_acs": 161, + "total_submitted": 330, "total_column_articles": 8, "frontend_question_id": "2969", "is_new_question": false @@ -11289,9 +11751,9 @@ "question__title": "Find Longest Special Substring That Occurs Thrice I", "question__title_slug": "find-longest-special-substring-that-occurs-thrice-i", "question__hide": false, - "total_acs": 3934, - "total_submitted": 8059, - "total_column_articles": 36, + "total_acs": 21046, + "total_submitted": 35738, + "total_column_articles": 167, "frontend_question_id": "2981", "is_new_question": false }, @@ -11310,9 +11772,9 @@ "question__title": "Find Longest Special Substring That Occurs Thrice II", "question__title_slug": "find-longest-special-substring-that-occurs-thrice-ii", "question__hide": false, - "total_acs": 4222, - "total_submitted": 10937, - "total_column_articles": 69, + "total_acs": 18813, + "total_submitted": 35826, + "total_column_articles": 149, "frontend_question_id": "2982", "is_new_question": false }, @@ -11331,9 +11793,9 @@ "question__title": "Maximum Good Subarray Sum", "question__title_slug": "maximum-good-subarray-sum", "question__hide": false, - "total_acs": 2872, - "total_submitted": 11678, - "total_column_articles": 36, + "total_acs": 3079, + "total_submitted": 12393, + "total_column_articles": 37, "frontend_question_id": "3026", "is_new_question": false }, @@ -11352,9 +11814,9 @@ "question__title": "Divide an Array Into Subarrays With Minimum Cost I", "question__title_slug": "divide-an-array-into-subarrays-with-minimum-cost-i", "question__hide": false, - "total_acs": 3959, - "total_submitted": 5358, - "total_column_articles": 36, + "total_acs": 4109, + "total_submitted": 5851, + "total_column_articles": 35, "frontend_question_id": "3010", "is_new_question": false }, @@ -11373,8 +11835,8 @@ "question__title": "Find Polygon With the Largest Perimeter", "question__title_slug": "find-polygon-with-the-largest-perimeter", "question__hide": false, - "total_acs": 3435, - "total_submitted": 5103, + "total_acs": 3489, + "total_submitted": 5182, "total_column_articles": 40, "frontend_question_id": "2971", "is_new_question": false @@ -11394,9 +11856,9 @@ "question__title": "Minimize OR of Remaining Elements Using Operations", "question__title_slug": "minimize-or-of-remaining-elements-using-operations", "question__hide": false, - "total_acs": 1450, - "total_submitted": 2814, - "total_column_articles": 13, + "total_acs": 1475, + "total_submitted": 2885, + "total_column_articles": 12, "frontend_question_id": "3022", "is_new_question": false }, @@ -11415,9 +11877,9 @@ "question__title": "Divide an Array Into Subarrays With Minimum Cost II", "question__title_slug": "divide-an-array-into-subarrays-with-minimum-cost-ii", "question__hide": false, - "total_acs": 1730, - "total_submitted": 4147, - "total_column_articles": 32, + "total_acs": 1782, + "total_submitted": 4268, + "total_column_articles": 30, "frontend_question_id": "3013", "is_new_question": false }, @@ -11436,8 +11898,8 @@ "question__title": "Binary Tree Nodes", "question__title_slug": "binary-tree-nodes", "question__hide": false, - "total_acs": 181, - "total_submitted": 227, + "total_acs": 199, + "total_submitted": 249, "total_column_articles": 7, "frontend_question_id": "3054", "is_new_question": false @@ -11457,9 +11919,9 @@ "question__title": "Classifying Triangles by Lengths", "question__title_slug": "classifying-triangles-by-lengths", "question__hide": false, - "total_acs": 224, - "total_submitted": 360, - "total_column_articles": 5, + "total_acs": 252, + "total_submitted": 406, + "total_column_articles": 6, "frontend_question_id": "3053", "is_new_question": false }, @@ -11478,9 +11940,9 @@ "question__title": "Maximize Items", "question__title_slug": "maximize-items", "question__hide": false, - "total_acs": 122, - "total_submitted": 217, - "total_column_articles": 7, + "total_acs": 144, + "total_submitted": 266, + "total_column_articles": 9, "frontend_question_id": "3052", "is_new_question": false }, @@ -11499,8 +11961,8 @@ "question__title": "Find Candidates for Data Scientist Position", "question__title_slug": "find-candidates-for-data-scientist-position", "question__hide": false, - "total_acs": 290, - "total_submitted": 388, + "total_acs": 316, + "total_submitted": 430, "total_column_articles": 7, "frontend_question_id": "3051", "is_new_question": false @@ -11520,8 +11982,8 @@ "question__title": "Pizza Toppings Cost Analysis", "question__title_slug": "pizza-toppings-cost-analysis", "question__hide": false, - "total_acs": 204, - "total_submitted": 286, + "total_acs": 225, + "total_submitted": 322, "total_column_articles": 5, "frontend_question_id": "3050", "is_new_question": false @@ -11541,8 +12003,8 @@ "question__title": "Number of Divisible Triplet Sums", "question__title_slug": "number-of-divisible-triplet-sums", "question__hide": false, - "total_acs": 189, - "total_submitted": 251, + "total_acs": 193, + "total_submitted": 255, "total_column_articles": 8, "frontend_question_id": "2964", "is_new_question": false @@ -11562,9 +12024,9 @@ "question__title": "Symmetric Coordinates", "question__title_slug": "symmetric-coordinates", "question__hide": false, - "total_acs": 299, - "total_submitted": 684, - "total_column_articles": 7, + "total_acs": 330, + "total_submitted": 765, + "total_column_articles": 8, "frontend_question_id": "2978", "is_new_question": false }, @@ -11583,8 +12045,8 @@ "question__title": "Count the Number of Incremovable Subarrays I", "question__title_slug": "count-the-number-of-incremovable-subarrays-i", "question__hide": false, - "total_acs": 2912, - "total_submitted": 4769, + "total_acs": 2994, + "total_submitted": 4867, "total_column_articles": 32, "frontend_question_id": "2970", "is_new_question": false @@ -11604,9 +12066,9 @@ "question__title": "Maximum Area of Longest Diagonal Rectangle", "question__title_slug": "maximum-area-of-longest-diagonal-rectangle", "question__hide": false, - "total_acs": 5537, - "total_submitted": 12523, - "total_column_articles": 36, + "total_acs": 5934, + "total_submitted": 13090, + "total_column_articles": 37, "frontend_question_id": "3000", "is_new_question": false }, @@ -11625,8 +12087,8 @@ "question__title": "Maximum Square Area by Removing Fences From a Field", "question__title_slug": "maximum-square-area-by-removing-fences-from-a-field", "question__hide": false, - "total_acs": 4888, - "total_submitted": 16444, + "total_acs": 4910, + "total_submitted": 16515, "total_column_articles": 45, "frontend_question_id": "2975", "is_new_question": false @@ -11646,8 +12108,8 @@ "question__title": "Minimum Number of Operations to Make Array XOR Equal to K", "question__title_slug": "minimum-number-of-operations-to-make-array-xor-equal-to-k", "question__hide": false, - "total_acs": 3209, - "total_submitted": 3892, + "total_acs": 3299, + "total_submitted": 3987, "total_column_articles": 27, "frontend_question_id": "2997", "is_new_question": false @@ -11667,8 +12129,8 @@ "question__title": "Count the Number of Incremovable Subarrays II", "question__title_slug": "count-the-number-of-incremovable-subarrays-ii", "question__hide": false, - "total_acs": 2409, - "total_submitted": 4639, + "total_acs": 2475, + "total_submitted": 4743, "total_column_articles": 35, "frontend_question_id": "2972", "is_new_question": false @@ -11688,8 +12150,8 @@ "question__title": "Number of Same-End Substrings", "question__title_slug": "number-of-same-end-substrings", "question__hide": false, - "total_acs": 175, - "total_submitted": 280, + "total_acs": 183, + "total_submitted": 289, "total_column_articles": 7, "frontend_question_id": "2955", "is_new_question": false @@ -11709,9 +12171,9 @@ "question__title": "Check if Bitwise OR Has Trailing Zeros", "question__title_slug": "check-if-bitwise-or-has-trailing-zeros", "question__hide": false, - "total_acs": 5396, - "total_submitted": 7114, - "total_column_articles": 37, + "total_acs": 5627, + "total_submitted": 7417, + "total_column_articles": 38, "frontend_question_id": "2980", "is_new_question": false }, @@ -11730,9 +12192,9 @@ "question__title": "Find Beautiful Indices in the Given Array I", "question__title_slug": "find-beautiful-indices-in-the-given-array-i", "question__hide": false, - "total_acs": 4588, - "total_submitted": 10545, - "total_column_articles": 28, + "total_acs": 4658, + "total_submitted": 10816, + "total_column_articles": 29, "frontend_question_id": "3006", "is_new_question": false }, @@ -11751,9 +12213,9 @@ "question__title": "Minimize Length of Array Using Operations", "question__title_slug": "minimize-length-of-array-using-operations", "question__hide": false, - "total_acs": 2232, - "total_submitted": 6800, - "total_column_articles": 23, + "total_acs": 2283, + "total_submitted": 7042, + "total_column_articles": 22, "frontend_question_id": "3012", "is_new_question": false }, @@ -11772,8 +12234,8 @@ "question__title": "Count the Number of Powerful Integers", "question__title_slug": "count-the-number-of-powerful-integers", "question__hide": false, - "total_acs": 2125, - "total_submitted": 5392, + "total_acs": 2212, + "total_submitted": 5530, "total_column_articles": 39, "frontend_question_id": "2999", "is_new_question": false @@ -11793,9 +12255,9 @@ "question__title": "Count Elements With Maximum Frequency", "question__title_slug": "count-elements-with-maximum-frequency", "question__hide": false, - "total_acs": 6693, - "total_submitted": 8600, - "total_column_articles": 49, + "total_acs": 6892, + "total_submitted": 9124, + "total_column_articles": 52, "frontend_question_id": "3005", "is_new_question": false }, @@ -11814,9 +12276,9 @@ "question__title": "Divide Array Into Arrays With Max Difference", "question__title_slug": "divide-array-into-arrays-with-max-difference", "question__hide": false, - "total_acs": 5173, - "total_submitted": 7768, - "total_column_articles": 37, + "total_acs": 5304, + "total_submitted": 7957, + "total_column_articles": 38, "frontend_question_id": "2966", "is_new_question": false }, @@ -11835,9 +12297,9 @@ "question__title": "Maximum Number That Sum of the Prices Is Less Than or Equal to K", "question__title_slug": "maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k", "question__hide": false, - "total_acs": 3123, - "total_submitted": 7424, - "total_column_articles": 42, + "total_acs": 3212, + "total_submitted": 7757, + "total_column_articles": 41, "frontend_question_id": "3007", "is_new_question": false }, @@ -11856,9 +12318,9 @@ "question__title": "Minimum Number of Operations to Make X and Y Equal", "question__title_slug": "minimum-number-of-operations-to-make-x-and-y-equal", "question__hide": false, - "total_acs": 3408, - "total_submitted": 7269, - "total_column_articles": 28, + "total_acs": 3486, + "total_submitted": 7421, + "total_column_articles": 29, "frontend_question_id": "2998", "is_new_question": false }, @@ -11877,9 +12339,9 @@ "question__title": "Minimum Cost to Convert String II", "question__title_slug": "minimum-cost-to-convert-string-ii", "question__hide": false, - "total_acs": 2295, - "total_submitted": 7813, - "total_column_articles": 24, + "total_acs": 2361, + "total_submitted": 7948, + "total_column_articles": 25, "frontend_question_id": "2977", "is_new_question": false }, @@ -11898,9 +12360,9 @@ "question__title": "Number of Divisible Substrings", "question__title_slug": "number-of-divisible-substrings", "question__hide": false, - "total_acs": 221, - "total_submitted": 261, - "total_column_articles": 6, + "total_acs": 229, + "total_submitted": 271, + "total_column_articles": 7, "frontend_question_id": "2950", "is_new_question": false }, @@ -11919,9 +12381,9 @@ "question__title": "Smallest Missing Integer Greater Than Sequential Prefix Sum", "question__title_slug": "smallest-missing-integer-greater-than-sequential-prefix-sum", "question__hide": false, - "total_acs": 3632, - "total_submitted": 9743, - "total_column_articles": 27, + "total_acs": 3783, + "total_submitted": 10118, + "total_column_articles": 29, "frontend_question_id": "2996", "is_new_question": false }, @@ -11940,8 +12402,8 @@ "question__title": "Minimum Cost to Convert String I", "question__title_slug": "minimum-cost-to-convert-string-i", "question__hide": false, - "total_acs": 3427, - "total_submitted": 7599, + "total_acs": 3499, + "total_submitted": 7742, "total_column_articles": 36, "frontend_question_id": "2976", "is_new_question": false @@ -11961,8 +12423,8 @@ "question__title": "Double Modular Exponentiation", "question__title_slug": "double-modular-exponentiation", "question__hide": false, - "total_acs": 5076, - "total_submitted": 10525, + "total_acs": 5144, + "total_submitted": 10622, "total_column_articles": 38, "frontend_question_id": "2961", "is_new_question": false @@ -11982,8 +12444,8 @@ "question__title": "Maximize the Number of Partitions After Operations", "question__title_slug": "maximize-the-number-of-partitions-after-operations", "question__hide": false, - "total_acs": 1477, - "total_submitted": 4672, + "total_acs": 1504, + "total_submitted": 4814, "total_column_articles": 24, "frontend_question_id": "3003", "is_new_question": false @@ -12003,8 +12465,8 @@ "question__title": "Maximum GCD-Sum of a Subarray", "question__title_slug": "maximum-gcd-sum-of-a-subarray", "question__hide": false, - "total_acs": 262, - "total_submitted": 348, + "total_acs": 274, + "total_submitted": 480, "total_column_articles": 3, "frontend_question_id": "2941", "is_new_question": false @@ -12024,8 +12486,8 @@ "question__title": "Minimum Number of Coins to be Added", "question__title_slug": "minimum-number-of-coins-to-be-added", "question__hide": false, - "total_acs": 16752, - "total_submitted": 25834, + "total_acs": 16864, + "total_submitted": 26023, "total_column_articles": 123, "frontend_question_id": "2952", "is_new_question": false @@ -12045,9 +12507,9 @@ "question__title": "Remove Adjacent Almost-Equal Characters", "question__title_slug": "remove-adjacent-almost-equal-characters", "question__hide": false, - "total_acs": 3686, - "total_submitted": 6257, - "total_column_articles": 39, + "total_acs": 3757, + "total_submitted": 6361, + "total_column_articles": 43, "frontend_question_id": "2957", "is_new_question": false }, @@ -12066,8 +12528,8 @@ "question__title": "Minimum Cost to Make Array Equalindromic", "question__title_slug": "minimum-cost-to-make-array-equalindromic", "question__hide": false, - "total_acs": 4002, - "total_submitted": 17183, + "total_acs": 4058, + "total_submitted": 17394, "total_column_articles": 59, "frontend_question_id": "2967", "is_new_question": false @@ -12087,8 +12549,8 @@ "question__title": "Maximum Size of a Set After Removals", "question__title_slug": "maximum-size-of-a-set-after-removals", "question__hide": false, - "total_acs": 3989, - "total_submitted": 8617, + "total_acs": 4043, + "total_submitted": 8944, "total_column_articles": 55, "frontend_question_id": "3002", "is_new_question": false @@ -12108,9 +12570,9 @@ "question__title": "Find Missing and Repeated Values", "question__title_slug": "find-missing-and-repeated-values", "question__hide": false, - "total_acs": 6144, - "total_submitted": 7709, - "total_column_articles": 64, + "total_acs": 23878, + "total_submitted": 28284, + "total_column_articles": 179, "frontend_question_id": "2965", "is_new_question": false }, @@ -12129,9 +12591,9 @@ "question__title": "Minimum Number Game", "question__title_slug": "minimum-number-game", "question__hide": false, - "total_acs": 8083, - "total_submitted": 9410, - "total_column_articles": 76, + "total_acs": 8411, + "total_submitted": 9773, + "total_column_articles": 80, "frontend_question_id": "2974", "is_new_question": false }, @@ -12150,9 +12612,9 @@ "question__title": "Length of Longest Subarray With at Most K Frequency", "question__title_slug": "length-of-longest-subarray-with-at-most-k-frequency", "question__hide": false, - "total_acs": 5348, - "total_submitted": 10326, - "total_column_articles": 46, + "total_acs": 5829, + "total_submitted": 11092, + "total_column_articles": 49, "frontend_question_id": "2958", "is_new_question": false }, @@ -12171,8 +12633,8 @@ "question__title": "Count the Number of Infection Sequences", "question__title_slug": "count-the-number-of-infection-sequences", "question__hide": false, - "total_acs": 1496, - "total_submitted": 3743, + "total_acs": 1521, + "total_submitted": 3801, "total_column_articles": 20, "frontend_question_id": "2954", "is_new_question": false @@ -12192,8 +12654,8 @@ "question__title": "Count Complete Substrings", "question__title_slug": "count-complete-substrings", "question__hide": false, - "total_acs": 4023, - "total_submitted": 11526, + "total_acs": 4141, + "total_submitted": 11746, "total_column_articles": 46, "frontend_question_id": "2953", "is_new_question": false @@ -12213,8 +12675,8 @@ "question__title": "Number of Equal Numbers Blocks", "question__title_slug": "number-of-equal-numbers-blocks", "question__hide": false, - "total_acs": 231, - "total_submitted": 418, + "total_acs": 243, + "total_submitted": 444, "total_column_articles": 9, "frontend_question_id": "2936", "is_new_question": false @@ -12234,9 +12696,9 @@ "question__title": "Find the Peaks", "question__title_slug": "find-the-peaks", "question__hide": false, - "total_acs": 7634, - "total_submitted": 9629, - "total_column_articles": 38, + "total_acs": 29244, + "total_submitted": 34877, + "total_column_articles": 127, "frontend_question_id": "2951", "is_new_question": false }, @@ -12255,9 +12717,9 @@ "question__title": "Count Tested Devices After Test Operations", "question__title_slug": "count-tested-devices-after-test-operations", "question__hide": false, - "total_acs": 28307, - "total_submitted": 32101, - "total_column_articles": 200, + "total_acs": 28917, + "total_submitted": 32835, + "total_column_articles": 205, "frontend_question_id": "2960", "is_new_question": false }, @@ -12276,8 +12738,8 @@ "question__title": "Make Lexicographically Smallest Array by Swapping Elements", "question__title_slug": "make-lexicographically-smallest-array-by-swapping-elements", "question__hide": false, - "total_acs": 3499, - "total_submitted": 7940, + "total_acs": 3524, + "total_submitted": 7990, "total_column_articles": 44, "frontend_question_id": "2948", "is_new_question": false @@ -12297,8 +12759,8 @@ "question__title": "Find Number of Coins to Place in Tree Nodes", "question__title_slug": "find-number-of-coins-to-place-in-tree-nodes", "question__hide": false, - "total_acs": 1934, - "total_submitted": 4276, + "total_acs": 1971, + "total_submitted": 4337, "total_column_articles": 26, "frontend_question_id": "2973", "is_new_question": false @@ -12318,8 +12780,8 @@ "question__title": "Number of Possible Sets of Closing Branches", "question__title_slug": "number-of-possible-sets-of-closing-branches", "question__hide": false, - "total_acs": 2386, - "total_submitted": 4041, + "total_acs": 2458, + "total_submitted": 4142, "total_column_articles": 33, "frontend_question_id": "2959", "is_new_question": false @@ -12339,8 +12801,8 @@ "question__title": "Distribute Candies Among Children III", "question__title_slug": "distribute-candies-among-children-iii", "question__hide": false, - "total_acs": 109, - "total_submitted": 178, + "total_acs": 156, + "total_submitted": 249, "total_column_articles": 3, "frontend_question_id": "2927", "is_new_question": false @@ -12360,9 +12822,9 @@ "question__title": "Matrix Similarity After Cyclic Shifts", "question__title_slug": "matrix-similarity-after-cyclic-shifts", "question__hide": false, - "total_acs": 5896, - "total_submitted": 9550, - "total_column_articles": 48, + "total_acs": 6011, + "total_submitted": 9719, + "total_column_articles": 50, "frontend_question_id": "2946", "is_new_question": false }, @@ -12381,9 +12843,9 @@ "question__title": "Maximize Area of Square Hole in Grid", "question__title_slug": "maximize-area-of-square-hole-in-grid", "question__hide": false, - "total_acs": 2899, - "total_submitted": 7425, - "total_column_articles": 24, + "total_acs": 2927, + "total_submitted": 7478, + "total_column_articles": 25, "frontend_question_id": "2943", "is_new_question": false }, @@ -12402,9 +12864,9 @@ "question__title": "Count Subarrays Where Max Element Appears at Least K Times", "question__title_slug": "count-subarrays-where-max-element-appears-at-least-k-times", "question__hide": false, - "total_acs": 6860, - "total_submitted": 14035, - "total_column_articles": 87, + "total_acs": 7232, + "total_submitted": 14679, + "total_column_articles": 89, "frontend_question_id": "2962", "is_new_question": false }, @@ -12423,9 +12885,9 @@ "question__title": "Count the Number of Good Partitions", "question__title_slug": "count-the-number-of-good-partitions", "question__hide": false, - "total_acs": 3725, - "total_submitted": 7447, - "total_column_articles": 52, + "total_acs": 3788, + "total_submitted": 7547, + "total_column_articles": 53, "frontend_question_id": "2963", "is_new_question": false }, @@ -12444,8 +12906,8 @@ "question__title": "Find Maximum Non-decreasing Array Length", "question__title_slug": "find-maximum-non-decreasing-array-length", "question__hide": false, - "total_acs": 1214, - "total_submitted": 4783, + "total_acs": 1245, + "total_submitted": 4919, "total_column_articles": 17, "frontend_question_id": "2945", "is_new_question": false @@ -12465,9 +12927,9 @@ "question__title": "Count Beautiful Substrings I", "question__title_slug": "count-beautiful-substrings-i", "question__hide": false, - "total_acs": 4456, - "total_submitted": 7559, - "total_column_articles": 33, + "total_acs": 4499, + "total_submitted": 7639, + "total_column_articles": 34, "frontend_question_id": "2947", "is_new_question": false }, @@ -12486,9 +12948,9 @@ "question__title": "Minimum Number of Coins for Fruits", "question__title_slug": "minimum-number-of-coins-for-fruits", "question__hide": false, - "total_acs": 4591, - "total_submitted": 7623, - "total_column_articles": 49, + "total_acs": 4773, + "total_submitted": 7914, + "total_column_articles": 48, "frontend_question_id": "2944", "is_new_question": false }, @@ -12507,8 +12969,8 @@ "question__title": "Count Beautiful Substrings II", "question__title_slug": "count-beautiful-substrings-ii", "question__hide": false, - "total_acs": 2371, - "total_submitted": 7182, + "total_acs": 2428, + "total_submitted": 7283, "total_column_articles": 30, "frontend_question_id": "2949", "is_new_question": false @@ -12528,8 +12990,8 @@ "question__title": "Make Three Strings Equal", "question__title_slug": "make-three-strings-equal", "question__hide": false, - "total_acs": 6521, - "total_submitted": 13953, + "total_acs": 6603, + "total_submitted": 14098, "total_column_articles": 58, "frontend_question_id": "2937", "is_new_question": false @@ -12549,9 +13011,9 @@ "question__title": "Find Common Elements Between Two Arrays", "question__title_slug": "find-common-elements-between-two-arrays", "question__hide": false, - "total_acs": 4619, - "total_submitted": 5785, - "total_column_articles": 42, + "total_acs": 4776, + "total_submitted": 5982, + "total_column_articles": 43, "frontend_question_id": "2956", "is_new_question": false }, @@ -12570,8 +13032,8 @@ "question__title": "Market Analysis III", "question__title_slug": "market-analysis-iii", "question__hide": false, - "total_acs": 374, - "total_submitted": 1086, + "total_acs": 401, + "total_submitted": 1168, "total_column_articles": 8, "frontend_question_id": "2922", "is_new_question": false @@ -12591,8 +13053,8 @@ "question__title": "Maximum Profitable Triplets With Increasing Prices II", "question__title_slug": "maximum-profitable-triplets-with-increasing-prices-ii", "question__hide": false, - "total_acs": 168, - "total_submitted": 369, + "total_acs": 173, + "total_submitted": 376, "total_column_articles": 6, "frontend_question_id": "2921", "is_new_question": false @@ -12612,8 +13074,8 @@ "question__title": "Palindrome Rearrangement Queries", "question__title_slug": "palindrome-rearrangement-queries", "question__hide": false, - "total_acs": 1414, - "total_submitted": 4487, + "total_acs": 1451, + "total_submitted": 4585, "total_column_articles": 22, "frontend_question_id": "2983", "is_new_question": false @@ -12633,8 +13095,8 @@ "question__title": "High-Access Employees", "question__title_slug": "high-access-employees", "question__hide": false, - "total_acs": 5150, - "total_submitted": 10266, + "total_acs": 5227, + "total_submitted": 10380, "total_column_articles": 45, "frontend_question_id": "2933", "is_new_question": false @@ -12654,9 +13116,9 @@ "question__title": "Distribute Candies Among Children II", "question__title_slug": "distribute-candies-among-children-ii", "question__hide": false, - "total_acs": 3228, - "total_submitted": 8563, - "total_column_articles": 48, + "total_acs": 4097, + "total_submitted": 10136, + "total_column_articles": 56, "frontend_question_id": "2929", "is_new_question": false }, @@ -12675,9 +13137,9 @@ "question__title": "Number of Strings Which Can Be Rearranged to Contain Substring", "question__title_slug": "number-of-strings-which-can-be-rearranged-to-contain-substring", "question__hide": false, - "total_acs": 2108, - "total_submitted": 3422, - "total_column_articles": 29, + "total_acs": 2196, + "total_submitted": 3538, + "total_column_articles": 31, "frontend_question_id": "2930", "is_new_question": false }, @@ -12696,9 +13158,9 @@ "question__title": "Distribute Candies Among Children I", "question__title_slug": "distribute-candies-among-children-i", "question__hide": false, - "total_acs": 4292, - "total_submitted": 5787, - "total_column_articles": 24, + "total_acs": 21044, + "total_submitted": 25435, + "total_column_articles": 116, "frontend_question_id": "2928", "is_new_question": false }, @@ -12717,8 +13179,8 @@ "question__title": "Number of Ways to Reach Destination in the Grid", "question__title_slug": "number-of-ways-to-reach-destination-in-the-grid", "question__hide": false, - "total_acs": 144, - "total_submitted": 209, + "total_acs": 157, + "total_submitted": 224, "total_column_articles": 6, "frontend_question_id": "2912", "is_new_question": false @@ -12738,9 +13200,9 @@ "question__title": "Maximum Strong Pair XOR II", "question__title_slug": "maximum-strong-pair-xor-ii", "question__hide": false, - "total_acs": 3813, - "total_submitted": 9710, - "total_column_articles": 34, + "total_acs": 3887, + "total_submitted": 9856, + "total_column_articles": 36, "frontend_question_id": "2935", "is_new_question": false }, @@ -12759,9 +13221,9 @@ "question__title": "Apply Operations to Maximize Frequency Score", "question__title_slug": "apply-operations-to-maximize-frequency-score", "question__hide": false, - "total_acs": 2641, - "total_submitted": 5589, - "total_column_articles": 24, + "total_acs": 2768, + "total_submitted": 5814, + "total_column_articles": 27, "frontend_question_id": "2968", "is_new_question": false }, @@ -12780,9 +13242,9 @@ "question__title": "Separate Black and White Balls", "question__title_slug": "separate-black-and-white-balls", "question__hide": false, - "total_acs": 6214, - "total_submitted": 11438, - "total_column_articles": 67, + "total_acs": 6374, + "total_submitted": 11660, + "total_column_articles": 68, "frontend_question_id": "2938", "is_new_question": false }, @@ -12801,8 +13263,8 @@ "question__title": "Find Words Containing Character", "question__title_slug": "find-words-containing-character", "question__hide": false, - "total_acs": 7113, - "total_submitted": 8189, + "total_acs": 7418, + "total_submitted": 8561, "total_column_articles": 49, "frontend_question_id": "2942", "is_new_question": false @@ -12822,8 +13284,8 @@ "question__title": "Maximum Strong Pair XOR I", "question__title_slug": "maximum-strong-pair-xor-i", "question__hide": false, - "total_acs": 6129, - "total_submitted": 8135, + "total_acs": 6265, + "total_submitted": 8303, "total_column_articles": 25, "frontend_question_id": "2932", "is_new_question": false @@ -12843,8 +13305,8 @@ "question__title": "Maximum Xor Product", "question__title_slug": "maximum-xor-product", "question__hide": false, - "total_acs": 3670, - "total_submitted": 11857, + "total_acs": 3722, + "total_submitted": 11957, "total_column_articles": 44, "frontend_question_id": "2939", "is_new_question": false @@ -12864,8 +13326,8 @@ "question__title": "Maximum Score After Applying Operations on a Tree", "question__title_slug": "maximum-score-after-applying-operations-on-a-tree", "question__hide": false, - "total_acs": 4265, - "total_submitted": 8996, + "total_acs": 4307, + "total_submitted": 9067, "total_column_articles": 57, "frontend_question_id": "2925", "is_new_question": false @@ -12885,9 +13347,9 @@ "question__title": "Minimum Operations to Maximize Last Elements in Arrays", "question__title_slug": "minimum-operations-to-maximize-last-elements-in-arrays", "question__hide": false, - "total_acs": 4254, - "total_submitted": 8951, - "total_column_articles": 45, + "total_acs": 4334, + "total_submitted": 9082, + "total_column_articles": 47, "frontend_question_id": "2934", "is_new_question": false }, @@ -12906,9 +13368,9 @@ "question__title": "Find Champion II", "question__title_slug": "find-champion-ii", "question__hide": false, - "total_acs": 21517, - "total_submitted": 31739, - "total_column_articles": 179, + "total_acs": 21659, + "total_submitted": 31931, + "total_column_articles": 180, "frontend_question_id": "2924", "is_new_question": false }, @@ -12927,9 +13389,9 @@ "question__title": "Find Champion I", "question__title_slug": "find-champion-i", "question__hide": false, - "total_acs": 29510, - "total_submitted": 35536, - "total_column_articles": 217, + "total_acs": 29741, + "total_submitted": 35799, + "total_column_articles": 218, "frontend_question_id": "2923", "is_new_question": false }, @@ -12948,8 +13410,8 @@ "question__title": "Maximum Profitable Triplets With Increasing Prices I", "question__title_slug": "maximum-profitable-triplets-with-increasing-prices-i", "question__hide": false, - "total_acs": 285, - "total_submitted": 455, + "total_acs": 288, + "total_submitted": 459, "total_column_articles": 13, "frontend_question_id": "2907", "is_new_question": false @@ -12969,9 +13431,9 @@ "question__title": "Minimum Sum of Mountain Triplets II", "question__title_slug": "minimum-sum-of-mountain-triplets-ii", "question__hide": false, - "total_acs": 7653, - "total_submitted": 14769, - "total_column_articles": 71, + "total_acs": 7768, + "total_submitted": 14945, + "total_column_articles": 72, "frontend_question_id": "2909", "is_new_question": false }, @@ -12990,8 +13452,8 @@ "question__title": "Maximum Balanced Subsequence Sum", "question__title_slug": "maximum-balanced-subsequence-sum", "question__hide": false, - "total_acs": 2935, - "total_submitted": 7702, + "total_acs": 3013, + "total_submitted": 7842, "total_column_articles": 40, "frontend_question_id": "2926", "is_new_question": false @@ -13011,8 +13473,8 @@ "question__title": "Find the K-or of an Array", "question__title_slug": "find-the-k-or-of-an-array", "question__hide": false, - "total_acs": 26133, - "total_submitted": 32635, + "total_acs": 26354, + "total_submitted": 32894, "total_column_articles": 112, "frontend_question_id": "2917", "is_new_question": false @@ -13032,8 +13494,8 @@ "question__title": "Maximum Linear Stock Score", "question__title_slug": "maximum-linear-stock-score", "question__hide": false, - "total_acs": 144, - "total_submitted": 315, + "total_acs": 149, + "total_submitted": 320, "total_column_articles": 8, "frontend_question_id": "2898", "is_new_question": false @@ -13053,9 +13515,9 @@ "question__title": "Find Building Where Alice and Bob Can Meet", "question__title_slug": "find-building-where-alice-and-bob-can-meet", "question__hide": false, - "total_acs": 3298, - "total_submitted": 7122, - "total_column_articles": 61, + "total_acs": 3385, + "total_submitted": 7256, + "total_column_articles": 62, "frontend_question_id": "2940", "is_new_question": false }, @@ -13074,8 +13536,8 @@ "question__title": "Maximum Points After Collecting Coins From All Nodes", "question__title_slug": "maximum-points-after-collecting-coins-from-all-nodes", "question__hide": false, - "total_acs": 2990, - "total_submitted": 7296, + "total_acs": 3055, + "total_submitted": 7392, "total_column_articles": 26, "frontend_question_id": "2920", "is_new_question": false @@ -13095,8 +13557,8 @@ "question__title": "Minimum Increment Operations to Make Array Beautiful", "question__title_slug": "minimum-increment-operations-to-make-array-beautiful", "question__hide": false, - "total_acs": 4664, - "total_submitted": 11662, + "total_acs": 4764, + "total_submitted": 11831, "total_column_articles": 58, "frontend_question_id": "2919", "is_new_question": false @@ -13116,8 +13578,8 @@ "question__title": "Minimizing Array After Replacing Pairs With Their Product", "question__title_slug": "minimizing-array-after-replacing-pairs-with-their-product", "question__hide": false, - "total_acs": 148, - "total_submitted": 308, + "total_acs": 152, + "total_submitted": 373, "total_column_articles": 4, "frontend_question_id": "2892", "is_new_question": false @@ -13137,9 +13599,9 @@ "question__title": "Minimum Sum of Mountain Triplets I", "question__title_slug": "minimum-sum-of-mountain-triplets-i", "question__hide": false, - "total_acs": 26390, - "total_submitted": 35865, - "total_column_articles": 168, + "total_acs": 26622, + "total_submitted": 36164, + "total_column_articles": 169, "frontend_question_id": "2908", "is_new_question": false }, @@ -13158,9 +13620,9 @@ "question__title": "Minimum Number of Changes to Make Binary String Beautiful", "question__title_slug": "minimum-number-of-changes-to-make-binary-string-beautiful", "question__hide": false, - "total_acs": 3606, - "total_submitted": 4815, - "total_column_articles": 37, + "total_acs": 3704, + "total_submitted": 4937, + "total_column_articles": 39, "frontend_question_id": "2914", "is_new_question": false }, @@ -13179,8 +13641,8 @@ "question__title": "The Wording Game", "question__title_slug": "the-wording-game", "question__hide": false, - "total_acs": 114, - "total_submitted": 206, + "total_acs": 115, + "total_submitted": 322, "total_column_articles": 6, "frontend_question_id": "2868", "is_new_question": false @@ -13200,9 +13662,9 @@ "question__title": "Divisible and Non-divisible Sums Difference", "question__title_slug": "divisible-and-non-divisible-sums-difference", "question__hide": false, - "total_acs": 9167, - "total_submitted": 10546, - "total_column_articles": 58, + "total_acs": 9457, + "total_submitted": 10867, + "total_column_articles": 61, "frontend_question_id": "2894", "is_new_question": false }, @@ -13221,9 +13683,9 @@ "question__title": "Minimum Equal Sum of Two Arrays After Replacing Zeros", "question__title_slug": "minimum-equal-sum-of-two-arrays-after-replacing-zeros", "question__hide": false, - "total_acs": 5995, - "total_submitted": 16612, - "total_column_articles": 67, + "total_acs": 6067, + "total_submitted": 16732, + "total_column_articles": 68, "frontend_question_id": "2918", "is_new_question": false }, @@ -13242,8 +13704,8 @@ "question__title": "Find Indices With Index and Value Difference II", "question__title_slug": "find-indices-with-index-and-value-difference-ii", "question__hide": false, - "total_acs": 5200, - "total_submitted": 13544, + "total_acs": 5626, + "total_submitted": 14281, "total_column_articles": 45, "frontend_question_id": "2905", "is_new_question": false @@ -13263,9 +13725,9 @@ "question__title": "Minimum Number of Groups to Create a Valid Assignment", "question__title_slug": "minimum-number-of-groups-to-create-a-valid-assignment", "question__hide": false, - "total_acs": 5255, - "total_submitted": 17693, - "total_column_articles": 64, + "total_acs": 5319, + "total_submitted": 17846, + "total_column_articles": 65, "frontend_question_id": "2910", "is_new_question": false }, @@ -13284,9 +13746,9 @@ "question__title": "Find Indices With Index and Value Difference I", "question__title_slug": "find-indices-with-index-and-value-difference-i", "question__hide": false, - "total_acs": 7453, - "total_submitted": 10642, - "total_column_articles": 43, + "total_acs": 23201, + "total_submitted": 31608, + "total_column_articles": 109, "frontend_question_id": "2903", "is_new_question": false }, @@ -13305,8 +13767,8 @@ "question__title": "Last Visited Integers", "question__title_slug": "last-visited-integers", "question__hide": false, - "total_acs": 4115, - "total_submitted": 5829, + "total_acs": 4210, + "total_submitted": 5960, "total_column_articles": 42, "frontend_question_id": "2899", "is_new_question": false @@ -13326,9 +13788,9 @@ "question__title": "Subarrays Distinct Element Sum of Squares I", "question__title_slug": "subarrays-distinct-element-sum-of-squares-i", "question__hide": false, - "total_acs": 3966, - "total_submitted": 4960, - "total_column_articles": 30, + "total_acs": 4090, + "total_submitted": 5117, + "total_column_articles": 31, "frontend_question_id": "2913", "is_new_question": false }, @@ -13347,8 +13809,8 @@ "question__title": "Calculate Orders Within Each Interval", "question__title_slug": "calculate-orders-within-each-interval", "question__hide": false, - "total_acs": 519, - "total_submitted": 731, + "total_acs": 545, + "total_submitted": 775, "total_column_articles": 11, "frontend_question_id": "2893", "is_new_question": false @@ -13368,9 +13830,9 @@ "question__title": "Maximum Length of Semi-Decreasing Subarrays", "question__title_slug": "maximum-length-of-semi-decreasing-subarrays", "question__hide": false, - "total_acs": 357, - "total_submitted": 594, - "total_column_articles": 15, + "total_acs": 400, + "total_submitted": 642, + "total_column_articles": 16, "frontend_question_id": "2863", "is_new_question": false }, @@ -13389,8 +13851,8 @@ "question__title": "Rolling Average Steps", "question__title_slug": "rolling-average-steps", "question__hide": false, - "total_acs": 525, - "total_submitted": 822, + "total_acs": 557, + "total_submitted": 868, "total_column_articles": 13, "frontend_question_id": "2854", "is_new_question": false @@ -13410,9 +13872,9 @@ "question__title": "Highest Salaries Difference", "question__title_slug": "highest-salaries-difference", "question__hide": false, - "total_acs": 636, - "total_submitted": 919, - "total_column_articles": 17, + "total_acs": 655, + "total_submitted": 944, + "total_column_articles": 18, "frontend_question_id": "2853", "is_new_question": false }, @@ -13431,9 +13893,9 @@ "question__title": "Maximum Value of an Ordered Triplet I", "question__title_slug": "maximum-value-of-an-ordered-triplet-i", "question__hide": false, - "total_acs": 5921, - "total_submitted": 10904, - "total_column_articles": 27, + "total_acs": 6004, + "total_submitted": 11051, + "total_column_articles": 28, "frontend_question_id": "2873", "is_new_question": false }, @@ -13452,9 +13914,9 @@ "question__title": "Apply Operations on Array to Maximize Sum of Squares", "question__title_slug": "apply-operations-on-array-to-maximize-sum-of-squares", "question__hide": false, - "total_acs": 2536, - "total_submitted": 4518, - "total_column_articles": 27, + "total_acs": 2561, + "total_submitted": 4556, + "total_column_articles": 28, "frontend_question_id": "2897", "is_new_question": false }, @@ -13473,9 +13935,9 @@ "question__title": "Maximum Value of an Ordered Triplet II", "question__title_slug": "maximum-value-of-an-ordered-triplet-ii", "question__hide": false, - "total_acs": 5472, - "total_submitted": 11627, - "total_column_articles": 40, + "total_acs": 5540, + "total_submitted": 11751, + "total_column_articles": 41, "frontend_question_id": "2874", "is_new_question": false }, @@ -13494,8 +13956,8 @@ "question__title": "Minimum Processing Time", "question__title_slug": "minimum-processing-time", "question__hide": false, - "total_acs": 5694, - "total_submitted": 7503, + "total_acs": 5791, + "total_submitted": 7613, "total_column_articles": 40, "frontend_question_id": "2895", "is_new_question": false @@ -13515,9 +13977,9 @@ "question__title": "Shortest and Lexicographically Smallest Beautiful String", "question__title_slug": "shortest-and-lexicographically-smallest-beautiful-string", "question__hide": false, - "total_acs": 6349, - "total_submitted": 15774, - "total_column_articles": 60, + "total_acs": 6450, + "total_submitted": 16025, + "total_column_articles": 61, "frontend_question_id": "2904", "is_new_question": false }, @@ -13536,9 +13998,9 @@ "question__title": "Sum of Remoteness of All Cells", "question__title_slug": "sum-of-remoteness-of-all-cells", "question__hide": false, - "total_acs": 150, - "total_submitted": 325, - "total_column_articles": 7, + "total_acs": 152, + "total_submitted": 327, + "total_column_articles": 8, "frontend_question_id": "2852", "is_new_question": false }, @@ -13557,9 +14019,9 @@ "question__title": "Longest Unequal Adjacent Groups Subsequence I", "question__title_slug": "longest-unequal-adjacent-groups-subsequence-i", "question__hide": false, - "total_acs": 4279, - "total_submitted": 6200, - "total_column_articles": 39, + "total_acs": 4389, + "total_submitted": 6373, + "total_column_articles": 40, "frontend_question_id": "2900", "is_new_question": false }, @@ -13578,8 +14040,8 @@ "question__title": "Longest Unequal Adjacent Groups Subsequence II", "question__title_slug": "longest-unequal-adjacent-groups-subsequence-ii", "question__hide": false, - "total_acs": 2917, - "total_submitted": 7518, + "total_acs": 2980, + "total_submitted": 7644, "total_column_articles": 28, "frontend_question_id": "2901", "is_new_question": false @@ -13599,8 +14061,8 @@ "question__title": "Minimum Size Subarray in Infinite Array", "question__title_slug": "minimum-size-subarray-in-infinite-array", "question__hide": false, - "total_acs": 4576, - "total_submitted": 13185, + "total_acs": 4621, + "total_submitted": 13311, "total_column_articles": 42, "frontend_question_id": "2875", "is_new_question": false @@ -13620,8 +14082,8 @@ "question__title": "Count Visited Nodes in a Directed Graph", "question__title_slug": "count-visited-nodes-in-a-directed-graph", "question__hide": false, - "total_acs": 3306, - "total_submitted": 7129, + "total_acs": 3366, + "total_submitted": 7261, "total_column_articles": 40, "frontend_question_id": "2876", "is_new_question": false @@ -13641,8 +14103,8 @@ "question__title": "Subarrays Distinct Element Sum of Squares II", "question__title_slug": "subarrays-distinct-element-sum-of-squares-ii", "question__hide": false, - "total_acs": 1904, - "total_submitted": 4978, + "total_acs": 1943, + "total_submitted": 5039, "total_column_articles": 26, "frontend_question_id": "2916", "is_new_question": false @@ -13662,8 +14124,8 @@ "question__title": "Beautiful Towers I", "question__title_slug": "beautiful-towers-i", "question__hide": false, - "total_acs": 23032, - "total_submitted": 38482, + "total_acs": 23179, + "total_submitted": 38776, "total_column_articles": 149, "frontend_question_id": "2865", "is_new_question": false @@ -13683,9 +14145,9 @@ "question__title": "Beautiful Towers II", "question__title_slug": "beautiful-towers-ii", "question__hide": false, - "total_acs": 17334, - "total_submitted": 37490, - "total_column_articles": 137, + "total_acs": 17457, + "total_submitted": 37849, + "total_column_articles": 138, "frontend_question_id": "2866", "is_new_question": false }, @@ -13704,8 +14166,8 @@ "question__title": "Count Valid Paths in a Tree", "question__title_slug": "count-valid-paths-in-a-tree", "question__hide": false, - "total_acs": 13414, - "total_submitted": 27088, + "total_acs": 13499, + "total_submitted": 27257, "total_column_articles": 98, "frontend_question_id": "2867", "is_new_question": false @@ -13725,8 +14187,8 @@ "question__title": "Smallest Number With Given Digit Product", "question__title_slug": "smallest-number-with-given-digit-product", "question__hide": false, - "total_acs": 203, - "total_submitted": 415, + "total_acs": 207, + "total_submitted": 423, "total_column_articles": 5, "frontend_question_id": "2847", "is_new_question": false @@ -13746,9 +14208,9 @@ "question__title": "Maximum Spending After Buying Items", "question__title_slug": "maximum-spending-after-buying-items", "question__hide": false, - "total_acs": 2418, - "total_submitted": 3637, - "total_column_articles": 30, + "total_acs": 2506, + "total_submitted": 3765, + "total_column_articles": 34, "frontend_question_id": "2931", "is_new_question": false }, @@ -13767,9 +14229,9 @@ "question__title": "Length of the Longest Subsequence That Sums to Target", "question__title_slug": "length-of-the-longest-subsequence-that-sums-to-target", "question__hide": false, - "total_acs": 6841, - "total_submitted": 15237, - "total_column_articles": 43, + "total_acs": 7455, + "total_submitted": 16330, + "total_column_articles": 47, "frontend_question_id": "2915", "is_new_question": false }, @@ -13788,8 +14250,8 @@ "question__title": "Minimum Edge Reversals So Every Node Is Reachable", "question__title_slug": "minimum-edge-reversals-so-every-node-is-reachable", "question__hide": false, - "total_acs": 2136, - "total_submitted": 3179, + "total_acs": 2158, + "total_submitted": 3218, "total_column_articles": 32, "frontend_question_id": "2858", "is_new_question": false @@ -13809,8 +14271,8 @@ "question__title": "Happy Students", "question__title_slug": "happy-students", "question__hide": false, - "total_acs": 6172, - "total_submitted": 11025, + "total_acs": 6212, + "total_submitted": 11071, "total_column_articles": 57, "frontend_question_id": "2860", "is_new_question": false @@ -13830,8 +14292,8 @@ "question__title": "Maximum Coins Heroes Can Collect", "question__title_slug": "maximum-coins-heroes-can-collect", "question__hide": false, - "total_acs": 129, - "total_submitted": 174, + "total_acs": 132, + "total_submitted": 284, "total_column_articles": 8, "frontend_question_id": "2838", "is_new_question": false @@ -13851,8 +14313,8 @@ "question__title": "Total Traveled Distance", "question__title_slug": "total-traveled-distance", "question__hide": false, - "total_acs": 578, - "total_submitted": 829, + "total_acs": 595, + "total_submitted": 853, "total_column_articles": 11, "frontend_question_id": "2837", "is_new_question": false @@ -13872,9 +14334,9 @@ "question__title": "Maximum Number of Alloys", "question__title_slug": "maximum-number-of-alloys", "question__hide": false, - "total_acs": 17401, - "total_submitted": 36798, - "total_column_articles": 126, + "total_acs": 17649, + "total_submitted": 37286, + "total_column_articles": 123, "frontend_question_id": "2861", "is_new_question": false }, @@ -13893,8 +14355,8 @@ "question__title": "Minimum Number of Operations to Make Array Empty", "question__title_slug": "minimum-number-of-operations-to-make-array-empty", "question__hide": false, - "total_acs": 4480, - "total_submitted": 6991, + "total_acs": 4570, + "total_submitted": 7110, "total_column_articles": 34, "frontend_question_id": "2870", "is_new_question": false @@ -13914,9 +14376,9 @@ "question__title": "Sum of Values at Indices With K Set Bits", "question__title_slug": "sum-of-values-at-indices-with-k-set-bits", "question__hide": false, - "total_acs": 29562, - "total_submitted": 34240, - "total_column_articles": 254, + "total_acs": 29850, + "total_submitted": 34569, + "total_column_articles": 253, "frontend_question_id": "2859", "is_new_question": false }, @@ -13935,9 +14397,9 @@ "question__title": "Minimum Moves to Spread Stones Over Grid", "question__title_slug": "minimum-moves-to-spread-stones-over-grid", "question__hide": false, - "total_acs": 5004, - "total_submitted": 11550, - "total_column_articles": 64, + "total_acs": 5111, + "total_submitted": 11691, + "total_column_articles": 65, "frontend_question_id": "2850", "is_new_question": false }, @@ -13956,8 +14418,8 @@ "question__title": "Count of Sub-Multisets With Bounded Sum", "question__title_slug": "count-of-sub-multisets-with-bounded-sum", "question__hide": false, - "total_acs": 2034, - "total_submitted": 6526, + "total_acs": 2108, + "total_submitted": 6731, "total_column_articles": 19, "frontend_question_id": "2902", "is_new_question": false @@ -13977,8 +14439,8 @@ "question__title": "Maximal Range That Each Element Is Maximum in It", "question__title_slug": "maximal-range-that-each-element-is-maximum-in-it", "question__hide": false, - "total_acs": 236, - "total_submitted": 427, + "total_acs": 245, + "total_submitted": 441, "total_column_articles": 9, "frontend_question_id": "2832", "is_new_question": false @@ -13998,9 +14460,9 @@ "question__title": "Minimum Array Length After Pair Removals", "question__title_slug": "minimum-array-length-after-pair-removals", "question__hide": false, - "total_acs": 3903, - "total_submitted": 14133, - "total_column_articles": 46, + "total_acs": 4117, + "total_submitted": 14530, + "total_column_articles": 50, "frontend_question_id": "2856", "is_new_question": false }, @@ -14019,8 +14481,8 @@ "question__title": "Split Array Into Maximum Number of Subarrays", "question__title_slug": "split-array-into-maximum-number-of-subarrays", "question__hide": false, - "total_acs": 3489, - "total_submitted": 6911, + "total_acs": 3599, + "total_submitted": 7118, "total_column_articles": 42, "frontend_question_id": "2871", "is_new_question": false @@ -14040,9 +14502,9 @@ "question__title": "Minimum Edge Weight Equilibrium Queries in a Tree", "question__title_slug": "minimum-edge-weight-equilibrium-queries-in-a-tree", "question__hide": false, - "total_acs": 10459, - "total_submitted": 17118, - "total_column_articles": 80, + "total_acs": 10528, + "total_submitted": 17225, + "total_column_articles": 77, "frontend_question_id": "2846", "is_new_question": false }, @@ -14061,8 +14523,8 @@ "question__title": "Election Results", "question__title_slug": "election-results", "question__hide": false, - "total_acs": 506, - "total_submitted": 951, + "total_acs": 531, + "total_submitted": 985, "total_column_articles": 11, "frontend_question_id": "2820", "is_new_question": false @@ -14082,9 +14544,9 @@ "question__title": "Minimum Relative Loss After Buying Chocolates", "question__title_slug": "minimum-relative-loss-after-buying-chocolates", "question__hide": false, - "total_acs": 439, - "total_submitted": 711, - "total_column_articles": 11, + "total_acs": 450, + "total_submitted": 849, + "total_column_articles": 12, "frontend_question_id": "2819", "is_new_question": false }, @@ -14103,8 +14565,8 @@ "question__title": "Get the Size of a DataFrame", "question__title_slug": "get-the-size-of-a-dataframe", "question__hide": false, - "total_acs": 3785, - "total_submitted": 4426, + "total_acs": 3959, + "total_submitted": 4610, "total_column_articles": 11, "frontend_question_id": "2878", "is_new_question": false @@ -14124,8 +14586,8 @@ "question__title": "Drop Missing Data", "question__title_slug": "drop-missing-data", "question__hide": false, - "total_acs": 2665, - "total_submitted": 4246, + "total_acs": 2810, + "total_submitted": 4463, "total_column_articles": 10, "frontend_question_id": "2883", "is_new_question": false @@ -14145,8 +14607,8 @@ "question__title": "Select Data", "question__title_slug": "select-data", "question__hide": false, - "total_acs": 3396, - "total_submitted": 4496, + "total_acs": 3557, + "total_submitted": 4713, "total_column_articles": 9, "frontend_question_id": "2880", "is_new_question": false @@ -14166,8 +14628,8 @@ "question__title": "Reshape Data: Melt", "question__title_slug": "reshape-data-melt", "question__hide": false, - "total_acs": 2191, - "total_submitted": 2715, + "total_acs": 2308, + "total_submitted": 2847, "total_column_articles": 9, "frontend_question_id": "2890", "is_new_question": false @@ -14187,8 +14649,8 @@ "question__title": "Reshape Data: Pivot", "question__title_slug": "reshape-data-pivot", "question__hide": false, - "total_acs": 2239, - "total_submitted": 2989, + "total_acs": 2350, + "total_submitted": 3136, "total_column_articles": 7, "frontend_question_id": "2889", "is_new_question": false @@ -14208,8 +14670,8 @@ "question__title": "Drop Duplicate Rows", "question__title_slug": "drop-duplicate-rows", "question__hide": false, - "total_acs": 2907, - "total_submitted": 3549, + "total_acs": 3047, + "total_submitted": 3705, "total_column_articles": 9, "frontend_question_id": "2882", "is_new_question": false @@ -14229,8 +14691,8 @@ "question__title": "Fill Missing Data", "question__title_slug": "fill-missing-data", "question__hide": false, - "total_acs": 2541, - "total_submitted": 3584, + "total_acs": 2652, + "total_submitted": 3748, "total_column_articles": 8, "frontend_question_id": "2887", "is_new_question": false @@ -14250,8 +14712,8 @@ "question__title": "Change Data Type", "question__title_slug": "change-data-type", "question__hide": false, - "total_acs": 2686, - "total_submitted": 3241, + "total_acs": 2823, + "total_submitted": 3402, "total_column_articles": 13, "frontend_question_id": "2886", "is_new_question": false @@ -14271,8 +14733,8 @@ "question__title": "Rename Columns", "question__title_slug": "rename-columns", "question__hide": false, - "total_acs": 2651, - "total_submitted": 3238, + "total_acs": 2775, + "total_submitted": 3381, "total_column_articles": 10, "frontend_question_id": "2885", "is_new_question": false @@ -14292,8 +14754,8 @@ "question__title": "Modify Columns", "question__title_slug": "modify-columns", "question__hide": false, - "total_acs": 3039, - "total_submitted": 3287, + "total_acs": 3198, + "total_submitted": 3460, "total_column_articles": 11, "frontend_question_id": "2884", "is_new_question": false @@ -14313,8 +14775,8 @@ "question__title": "Create a New Column", "question__title_slug": "create-a-new-column", "question__hide": false, - "total_acs": 3188, - "total_submitted": 3553, + "total_acs": 3364, + "total_submitted": 3736, "total_column_articles": 11, "frontend_question_id": "2881", "is_new_question": false @@ -14334,8 +14796,8 @@ "question__title": "Display the First Three Rows", "question__title_slug": "display-the-first-three-rows", "question__hide": false, - "total_acs": 4146, - "total_submitted": 4503, + "total_acs": 4352, + "total_submitted": 4720, "total_column_articles": 16, "frontend_question_id": "2879", "is_new_question": false @@ -14355,9 +14817,9 @@ "question__title": "Reshape Data: Concatenate", "question__title_slug": "reshape-data-concatenate", "question__hide": false, - "total_acs": 2659, - "total_submitted": 3035, - "total_column_articles": 7, + "total_acs": 2799, + "total_submitted": 3189, + "total_column_articles": 8, "frontend_question_id": "2888", "is_new_question": false }, @@ -14376,8 +14838,8 @@ "question__title": "Method Chaining", "question__title_slug": "method-chaining", "question__hide": false, - "total_acs": 2343, - "total_submitted": 3162, + "total_acs": 2463, + "total_submitted": 3294, "total_column_articles": 10, "frontend_question_id": "2891", "is_new_question": false @@ -14397,8 +14859,8 @@ "question__title": "Create a DataFrame from List", "question__title_slug": "create-a-dataframe-from-list", "question__hide": false, - "total_acs": 4300, - "total_submitted": 5533, + "total_acs": 4485, + "total_submitted": 5758, "total_column_articles": 10, "frontend_question_id": "2877", "is_new_question": false @@ -14418,8 +14880,8 @@ "question__title": "Maximum Number of K-Divisible Components", "question__title_slug": "maximum-number-of-k-divisible-components", "question__hide": false, - "total_acs": 2462, - "total_submitted": 3920, + "total_acs": 2482, + "total_submitted": 3947, "total_column_articles": 20, "frontend_question_id": "2872", "is_new_question": false @@ -14439,9 +14901,9 @@ "question__title": "Count K-Subsequences of a String With Maximum Beauty", "question__title_slug": "count-k-subsequences-of-a-string-with-maximum-beauty", "question__hide": false, - "total_acs": 2861, - "total_submitted": 9806, - "total_column_articles": 31, + "total_acs": 2889, + "total_submitted": 9859, + "total_column_articles": 32, "frontend_question_id": "2842", "is_new_question": false }, @@ -14460,8 +14922,8 @@ "question__title": "Determine if a Cell Is Reachable at a Given Time", "question__title_slug": "determine-if-a-cell-is-reachable-at-a-given-time", "question__hide": false, - "total_acs": 6739, - "total_submitted": 26039, + "total_acs": 6770, + "total_submitted": 26123, "total_column_articles": 57, "frontend_question_id": "2849", "is_new_question": false @@ -14481,9 +14943,9 @@ "question__title": "Maximum Odd Binary Number", "question__title_slug": "maximum-odd-binary-number", "question__hide": false, - "total_acs": 34460, - "total_submitted": 40888, - "total_column_articles": 210, + "total_acs": 34685, + "total_submitted": 41165, + "total_column_articles": 212, "frontend_question_id": "2864", "is_new_question": false }, @@ -14502,9 +14964,9 @@ "question__title": "Maximum Element-Sum of a Complete Subset of Indices", "question__title_slug": "maximum-element-sum-of-a-complete-subset-of-indices", "question__hide": false, - "total_acs": 3766, - "total_submitted": 7547, - "total_column_articles": 36, + "total_acs": 3816, + "total_submitted": 7639, + "total_column_articles": 37, "frontend_question_id": "2862", "is_new_question": false }, @@ -14523,9 +14985,9 @@ "question__title": "Minimum Operations to Make a Special Number", "question__title_slug": "minimum-operations-to-make-a-special-number", "question__hide": false, - "total_acs": 5803, - "total_submitted": 14009, - "total_column_articles": 72, + "total_acs": 5849, + "total_submitted": 14107, + "total_column_articles": 73, "frontend_question_id": "2844", "is_new_question": false }, @@ -14544,9 +15006,9 @@ "question__title": "Minimum Right Shifts to Sort the Array", "question__title_slug": "minimum-right-shifts-to-sort-the-array", "question__hide": false, - "total_acs": 4909, - "total_submitted": 8314, - "total_column_articles": 62, + "total_acs": 4998, + "total_submitted": 8447, + "total_column_articles": 63, "frontend_question_id": "2855", "is_new_question": false }, @@ -14565,8 +15027,8 @@ "question__title": "Minimum Operations to Collect Elements", "question__title_slug": "minimum-operations-to-collect-elements", "question__hide": false, - "total_acs": 4701, - "total_submitted": 6598, + "total_acs": 4792, + "total_submitted": 6747, "total_column_articles": 44, "frontend_question_id": "2869", "is_new_question": false @@ -14586,9 +15048,9 @@ "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": 124, - "total_submitted": 336, - "total_column_articles": 5, + "total_acs": 132, + "total_submitted": 344, + "total_column_articles": 6, "frontend_question_id": "2814", "is_new_question": false }, @@ -14607,8 +15069,8 @@ "question__title": "Points That Intersect With Cars", "question__title_slug": "points-that-intersect-with-cars", "question__hide": false, - "total_acs": 8945, - "total_submitted": 12164, + "total_acs": 9144, + "total_submitted": 12431, "total_column_articles": 85, "frontend_question_id": "2848", "is_new_question": false @@ -14628,9 +15090,9 @@ "question__title": "Apply Operations to Make Two Strings Equal", "question__title_slug": "apply-operations-to-make-two-strings-equal", "question__hide": false, - "total_acs": 4158, - "total_submitted": 12967, - "total_column_articles": 42, + "total_acs": 4217, + "total_submitted": 13071, + "total_column_articles": 43, "frontend_question_id": "2896", "is_new_question": false }, @@ -14649,9 +15111,9 @@ "question__title": "Maximize Value of Function in a Ball Passing Game", "question__title_slug": "maximize-value-of-function-in-a-ball-passing-game", "question__hide": false, - "total_acs": 2961, - "total_submitted": 7111, - "total_column_articles": 36, + "total_acs": 3017, + "total_submitted": 7228, + "total_column_articles": 37, "frontend_question_id": "2836", "is_new_question": false }, @@ -14670,8 +15132,8 @@ "question__title": "Construct Product Matrix", "question__title_slug": "construct-product-matrix", "question__hide": false, - "total_acs": 3891, - "total_submitted": 10918, + "total_acs": 3942, + "total_submitted": 11012, "total_column_articles": 47, "frontend_question_id": "2906", "is_new_question": false @@ -14691,9 +15153,9 @@ "question__title": "Find The K-th Lucky Number", "question__title_slug": "find-the-k-th-lucky-number", "question__hide": false, - "total_acs": 192, - "total_submitted": 310, - "total_column_articles": 11, + "total_acs": 195, + "total_submitted": 316, + "total_column_articles": 12, "frontend_question_id": "2802", "is_new_question": false }, @@ -14712,9 +15174,9 @@ "question__title": "Find the Minimum Possible Sum of a Beautiful Array", "question__title_slug": "find-the-minimum-possible-sum-of-a-beautiful-array", "question__hide": false, - "total_acs": 23896, - "total_submitted": 66339, - "total_column_articles": 129, + "total_acs": 23971, + "total_submitted": 66608, + "total_column_articles": 131, "frontend_question_id": "2834", "is_new_question": false }, @@ -14733,8 +15195,8 @@ "question__title": "Minimum Operations to Form Subsequence With Target Sum", "question__title_slug": "minimum-operations-to-form-subsequence-with-target-sum", "question__hide": false, - "total_acs": 3929, - "total_submitted": 11203, + "total_acs": 3968, + "total_submitted": 11279, "total_column_articles": 48, "frontend_question_id": "2835", "is_new_question": false @@ -14754,9 +15216,9 @@ "question__title": "String Transformation", "question__title_slug": "string-transformation", "question__hide": false, - "total_acs": 1646, - "total_submitted": 3977, - "total_column_articles": 29, + "total_acs": 1727, + "total_submitted": 4081, + "total_column_articles": 30, "frontend_question_id": "2851", "is_new_question": false }, @@ -14775,9 +15237,9 @@ "question__title": "Furthest Point From Origin", "question__title_slug": "furthest-point-from-origin", "question__hide": false, - "total_acs": 8971, - "total_submitted": 11396, - "total_column_articles": 66, + "total_acs": 9103, + "total_submitted": 11562, + "total_column_articles": 67, "frontend_question_id": "2833", "is_new_question": false }, @@ -14796,9 +15258,9 @@ "question__title": "Make String a Subsequence Using Cyclic Increments", "question__title_slug": "make-string-a-subsequence-using-cyclic-increments", "question__hide": false, - "total_acs": 4627, - "total_submitted": 8412, - "total_column_articles": 40, + "total_acs": 4678, + "total_submitted": 8480, + "total_column_articles": 41, "frontend_question_id": "2825", "is_new_question": false }, @@ -14817,9 +15279,9 @@ "question__title": "Number of Beautiful Integers in the Range", "question__title_slug": "number-of-beautiful-integers-in-the-range", "question__hide": false, - "total_acs": 2911, - "total_submitted": 8425, - "total_column_articles": 26, + "total_acs": 2936, + "total_submitted": 8479, + "total_column_articles": 25, "frontend_question_id": "2827", "is_new_question": false }, @@ -14838,8 +15300,8 @@ "question__title": "Count Nodes That Are Great Enough", "question__title_slug": "count-nodes-that-are-great-enough", "question__hide": false, - "total_acs": 154, - "total_submitted": 410, + "total_acs": 157, + "total_submitted": 414, "total_column_articles": 5, "frontend_question_id": "2792", "is_new_question": false @@ -14859,8 +15321,8 @@ "question__title": "Status of Flight Tickets", "question__title_slug": "status-of-flight-tickets", "question__hide": false, - "total_acs": 523, - "total_submitted": 751, + "total_acs": 548, + "total_submitted": 778, "total_column_articles": 16, "frontend_question_id": "2793", "is_new_question": false @@ -14880,9 +15342,9 @@ "question__title": "Flight Occupancy and Waitlist Analysis", "question__title_slug": "flight-occupancy-and-waitlist-analysis", "question__hide": false, - "total_acs": 555, - "total_submitted": 1472, - "total_column_articles": 13, + "total_acs": 589, + "total_submitted": 1544, + "total_column_articles": 14, "frontend_question_id": "2783", "is_new_question": false }, @@ -14901,9 +15363,9 @@ "question__title": "Apply Operations to Maximize Score", "question__title_slug": "apply-operations-to-maximize-score", "question__hide": false, - "total_acs": 4027, - "total_submitted": 8765, - "total_column_articles": 46, + "total_acs": 4096, + "total_submitted": 8892, + "total_column_articles": 45, "frontend_question_id": "2818", "is_new_question": false }, @@ -14922,8 +15384,8 @@ "question__title": "Minimum Absolute Difference Between Elements With Constraint", "question__title_slug": "minimum-absolute-difference-between-elements-with-constraint", "question__hide": false, - "total_acs": 5411, - "total_submitted": 16713, + "total_acs": 5436, + "total_submitted": 16773, "total_column_articles": 66, "frontend_question_id": "2817", "is_new_question": false @@ -14943,8 +15405,8 @@ "question__title": "Check if Strings Can be Made Equal With Operations I", "question__title_slug": "check-if-strings-can-be-made-equal-with-operations-i", "question__hide": false, - "total_acs": 5114, - "total_submitted": 7931, + "total_acs": 5196, + "total_submitted": 8068, "total_column_articles": 39, "frontend_question_id": "2839", "is_new_question": false @@ -14964,9 +15426,9 @@ "question__title": " Count Symmetric Integers", "question__title_slug": "count-symmetric-integers", "question__hide": false, - "total_acs": 8438, - "total_submitted": 11860, - "total_column_articles": 64, + "total_acs": 8525, + "total_submitted": 11993, + "total_column_articles": 63, "frontend_question_id": "2843", "is_new_question": false }, @@ -14985,8 +15447,8 @@ "question__title": "Number of Unique Categories", "question__title_slug": "number-of-unique-categories", "question__hide": false, - "total_acs": 232, - "total_submitted": 293, + "total_acs": 234, + "total_submitted": 295, "total_column_articles": 9, "frontend_question_id": "2782", "is_new_question": false @@ -15006,8 +15468,8 @@ "question__title": "Maximize the Profit as the Salesman", "question__title_slug": "maximize-the-profit-as-the-salesman", "question__hide": false, - "total_acs": 6388, - "total_submitted": 14795, + "total_acs": 6505, + "total_submitted": 15015, "total_column_articles": 71, "frontend_question_id": "2830", "is_new_question": false @@ -15027,8 +15489,8 @@ "question__title": "Check if Strings Can be Made Equal With Operations II", "question__title_slug": "check-if-strings-can-be-made-equal-with-operations-ii", "question__hide": false, - "total_acs": 4347, - "total_submitted": 7146, + "total_acs": 4397, + "total_submitted": 7212, "total_column_articles": 32, "frontend_question_id": "2840", "is_new_question": false @@ -15048,9 +15510,9 @@ "question__title": "Check if a String Is an Acronym of Words", "question__title_slug": "check-if-a-string-is-an-acronym-of-words", "question__hide": false, - "total_acs": 32056, - "total_submitted": 37741, - "total_column_articles": 156, + "total_acs": 32381, + "total_submitted": 38149, + "total_column_articles": 159, "frontend_question_id": "2828", "is_new_question": false }, @@ -15069,8 +15531,8 @@ "question__title": "Account Balance After Rounded Purchase", "question__title_slug": "account-balance-after-rounded-purchase", "question__hide": false, - "total_acs": 5394, - "total_submitted": 8618, + "total_acs": 5513, + "total_submitted": 8818, "total_column_articles": 34, "frontend_question_id": "2806", "is_new_question": false @@ -15090,9 +15552,9 @@ "question__title": "Maximum Sum of Almost Unique Subarray", "question__title_slug": "maximum-sum-of-almost-unique-subarray", "question__hide": false, - "total_acs": 6109, - "total_submitted": 13474, - "total_column_articles": 56, + "total_acs": 6467, + "total_submitted": 14226, + "total_column_articles": 58, "frontend_question_id": "2841", "is_new_question": false }, @@ -15111,8 +15573,8 @@ "question__title": "Count Pairs of Points With Distance k", "question__title_slug": "count-pairs-of-points-with-distance-k", "question__hide": false, - "total_acs": 3178, - "total_submitted": 7782, + "total_acs": 3228, + "total_submitted": 7894, "total_column_articles": 26, "frontend_question_id": "2857", "is_new_question": false @@ -15132,8 +15594,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": 11242, - "total_submitted": 18250, + "total_acs": 11290, + "total_submitted": 18339, "total_column_articles": 58, "frontend_question_id": "2809", "is_new_question": false @@ -15153,8 +15615,8 @@ "question__title": "Height of Special Binary Tree", "question__title_slug": "height-of-special-binary-tree", "question__hide": false, - "total_acs": 132, - "total_submitted": 202, + "total_acs": 133, + "total_submitted": 234, "total_column_articles": 7, "frontend_question_id": "2773", "is_new_question": false @@ -15174,8 +15636,8 @@ "question__title": "Inversion of Object", "question__title_slug": "inversion-of-object", "question__hide": false, - "total_acs": 212, - "total_submitted": 340, + "total_acs": 220, + "total_submitted": 349, "total_column_articles": 5, "frontend_question_id": "2822", "is_new_question": false @@ -15195,8 +15657,8 @@ "question__title": "Count Stepping Numbers in Range", "question__title_slug": "count-stepping-numbers-in-range", "question__hide": false, - "total_acs": 3181, - "total_submitted": 7395, + "total_acs": 3259, + "total_submitted": 7507, "total_column_articles": 49, "frontend_question_id": "2801", "is_new_question": false @@ -15216,9 +15678,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": 16422, - "total_submitted": 29436, - "total_column_articles": 138, + "total_acs": 16514, + "total_submitted": 29555, + "total_column_articles": 137, "frontend_question_id": "2808", "is_new_question": false }, @@ -15237,8 +15699,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": 2970, - "total_submitted": 13361, + "total_acs": 3000, + "total_submitted": 13467, "total_column_articles": 47, "frontend_question_id": "2790", "is_new_question": false @@ -15258,8 +15720,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": 212, - "total_submitted": 415, + "total_acs": 226, + "total_submitted": 437, "total_column_articles": 12, "frontend_question_id": "2764", "is_new_question": false @@ -15279,9 +15741,9 @@ "question__title": "Count Pairs Whose Sum is Less than Target", "question__title_slug": "count-pairs-whose-sum-is-less-than-target", "question__hide": false, - "total_acs": 35365, - "total_submitted": 40942, - "total_column_articles": 198, + "total_acs": 35985, + "total_submitted": 41674, + "total_column_articles": 202, "frontend_question_id": "2824", "is_new_question": false }, @@ -15300,9 +15762,9 @@ "question__title": "Check if it is Possible to Split Array", "question__title_slug": "check-if-it-is-possible-to-split-array", "question__hide": false, - "total_acs": 7428, - "total_submitted": 22555, - "total_column_articles": 81, + "total_acs": 7477, + "total_submitted": 22664, + "total_column_articles": 82, "frontend_question_id": "2811", "is_new_question": false }, @@ -15321,9 +15783,9 @@ "question__title": "Count of Interesting Subarrays", "question__title_slug": "count-of-interesting-subarrays", "question__hide": false, - "total_acs": 4442, - "total_submitted": 12414, - "total_column_articles": 47, + "total_acs": 4524, + "total_submitted": 12556, + "total_column_articles": 49, "frontend_question_id": "2845", "is_new_question": false }, @@ -15342,9 +15804,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": 5103, - "total_submitted": 17292, - "total_column_articles": 64, + "total_acs": 5188, + "total_submitted": 17463, + "total_column_articles": 66, "frontend_question_id": "2812", "is_new_question": false }, @@ -15363,8 +15825,8 @@ "question__title": "Deep Object Filter", "question__title_slug": "deep-object-filter", "question__hide": false, - "total_acs": 138, - "total_submitted": 315, + "total_acs": 141, + "total_submitted": 320, "total_column_articles": 4, "frontend_question_id": "2823", "is_new_question": false @@ -15384,8 +15846,8 @@ "question__title": "Delay the Resolution of Each Promise", "question__title_slug": "delay-the-resolution-of-each-promise", "question__hide": false, - "total_acs": 187, - "total_submitted": 317, + "total_acs": 195, + "total_submitted": 325, "total_column_articles": 3, "frontend_question_id": "2821", "is_new_question": false @@ -15405,8 +15867,8 @@ "question__title": "Custom Interval", "question__title_slug": "custom-interval", "question__hide": false, - "total_acs": 139, - "total_submitted": 177, + "total_acs": 143, + "total_submitted": 187, "total_column_articles": 4, "frontend_question_id": "2805", "is_new_question": false @@ -15426,8 +15888,8 @@ "question__title": "Array Prototype ForEach", "question__title_slug": "array-prototype-foreach", "question__hide": false, - "total_acs": 235, - "total_submitted": 271, + "total_acs": 243, + "total_submitted": 280, "total_column_articles": 8, "frontend_question_id": "2804", "is_new_question": false @@ -15447,9 +15909,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": 2631, - "total_submitted": 5169, - "total_column_articles": 35, + "total_acs": 2785, + "total_submitted": 5365, + "total_column_articles": 36, "frontend_question_id": "2791", "is_new_question": false }, @@ -15468,9 +15930,9 @@ "question__title": "Sorting Three Groups", "question__title_slug": "sorting-three-groups", "question__hide": false, - "total_acs": 4696, - "total_submitted": 8489, - "total_column_articles": 44, + "total_acs": 4928, + "total_submitted": 8802, + "total_column_articles": 45, "frontend_question_id": "2826", "is_new_question": false }, @@ -15489,9 +15951,9 @@ "question__title": "Insert Greatest Common Divisors in Linked List", "question__title_slug": "insert-greatest-common-divisors-in-linked-list", "question__hide": false, - "total_acs": 23536, - "total_submitted": 25919, - "total_column_articles": 204, + "total_acs": 23991, + "total_submitted": 26468, + "total_column_articles": 206, "frontend_question_id": "2807", "is_new_question": false }, @@ -15510,9 +15972,9 @@ "question__title": "Max Pair Sum in an Array", "question__title_slug": "max-pair-sum-in-an-array", "question__hide": false, - "total_acs": 8764, - "total_submitted": 12939, - "total_column_articles": 61, + "total_acs": 8850, + "total_submitted": 13059, + "total_column_articles": 62, "frontend_question_id": "2815", "is_new_question": false }, @@ -15531,8 +15993,8 @@ "question__title": "Factorial Generator", "question__title_slug": "factorial-generator", "question__hide": false, - "total_acs": 204, - "total_submitted": 250, + "total_acs": 208, + "total_submitted": 255, "total_column_articles": 4, "frontend_question_id": "2803", "is_new_question": false @@ -15552,8 +16014,8 @@ "question__title": "Partial Function with Placeholders", "question__title_slug": "partial-function-with-placeholders", "question__hide": false, - "total_acs": 216, - "total_submitted": 238, + "total_acs": 221, + "total_submitted": 243, "total_column_articles": 7, "frontend_question_id": "2797", "is_new_question": false @@ -15573,8 +16035,8 @@ "question__title": "Repeat String", "question__title_slug": "repeat-string", "question__hide": false, - "total_acs": 317, - "total_submitted": 361, + "total_acs": 323, + "total_submitted": 367, "total_column_articles": 9, "frontend_question_id": "2796", "is_new_question": false @@ -15594,8 +16056,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": 189, - "total_submitted": 219, + "total_acs": 196, + "total_submitted": 226, "total_column_articles": 5, "frontend_question_id": "2795", "is_new_question": false @@ -15615,8 +16077,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": 249, - "total_submitted": 367, + "total_acs": 251, + "total_submitted": 370, "total_column_articles": 10, "frontend_question_id": "2753", "is_new_question": false @@ -15636,8 +16098,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": 2657, - "total_submitted": 6552, + "total_acs": 2702, + "total_submitted": 6624, "total_column_articles": 29, "frontend_question_id": "2813", "is_new_question": false @@ -15657,9 +16119,9 @@ "question__title": "Visit Array Positions to Maximize Score", "question__title_slug": "visit-array-positions-to-maximize-score", "question__hide": false, - "total_acs": 4357, - "total_submitted": 10828, - "total_column_articles": 70, + "total_acs": 4483, + "total_submitted": 11078, + "total_column_articles": 72, "frontend_question_id": "2786", "is_new_question": false }, @@ -15678,8 +16140,8 @@ "question__title": "Check if Array is Good", "question__title_slug": "check-if-array-is-good", "question__hide": false, - "total_acs": 5477, - "total_submitted": 8902, + "total_acs": 5568, + "total_submitted": 9068, "total_column_articles": 68, "frontend_question_id": "2784", "is_new_question": false @@ -15699,8 +16161,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": 7086, - "total_submitted": 17612, + "total_acs": 7128, + "total_submitted": 17695, "total_column_articles": 96, "frontend_question_id": "2779", "is_new_question": false @@ -15720,9 +16182,9 @@ "question__title": "Count Substrings Without Repeating Character", "question__title_slug": "count-substrings-without-repeating-character", "question__hide": false, - "total_acs": 274, - "total_submitted": 439, - "total_column_articles": 6, + "total_acs": 285, + "total_submitted": 453, + "total_column_articles": 7, "frontend_question_id": "2743", "is_new_question": false }, @@ -15741,9 +16203,9 @@ "question__title": "Number of Black Blocks", "question__title_slug": "number-of-black-blocks", "question__hide": false, - "total_acs": 2999, - "total_submitted": 6938, - "total_column_articles": 29, + "total_acs": 3029, + "total_submitted": 6997, + "total_column_articles": 31, "frontend_question_id": "2768", "is_new_question": false }, @@ -15762,8 +16224,8 @@ "question__title": "Minimum Index of a Valid Split", "question__title_slug": "minimum-index-of-a-valid-split", "question__hide": false, - "total_acs": 5223, - "total_submitted": 8081, + "total_acs": 5270, + "total_submitted": 8143, "total_column_articles": 65, "frontend_question_id": "2780", "is_new_question": false @@ -15783,9 +16245,9 @@ "question__title": "Sort Vowels in a String", "question__title_slug": "sort-vowels-in-a-string", "question__hide": false, - "total_acs": 4564, - "total_submitted": 5930, - "total_column_articles": 46, + "total_acs": 4608, + "total_submitted": 5978, + "total_column_articles": 47, "frontend_question_id": "2785", "is_new_question": false }, @@ -15804,9 +16266,9 @@ "question__title": "Faulty Keyboard", "question__title_slug": "faulty-keyboard", "question__hide": false, - "total_acs": 35536, - "total_submitted": 42237, - "total_column_articles": 219, + "total_acs": 35800, + "total_submitted": 42538, + "total_column_articles": 220, "frontend_question_id": "2810", "is_new_question": false }, @@ -15825,8 +16287,8 @@ "question__title": "Count Occurrences in Text", "question__title_slug": "count-occurrences-in-text", "question__hide": false, - "total_acs": 941, - "total_submitted": 1786, + "total_acs": 992, + "total_submitted": 1862, "total_column_articles": 13, "frontend_question_id": "2738", "is_new_question": false @@ -15846,9 +16308,9 @@ "question__title": "Length of the Longest Valid Substring", "question__title_slug": "length-of-the-longest-valid-substring", "question__hide": false, - "total_acs": 4546, - "total_submitted": 11618, - "total_column_articles": 48, + "total_acs": 4657, + "total_submitted": 11837, + "total_column_articles": 49, "frontend_question_id": "2781", "is_new_question": false }, @@ -15867,8 +16329,8 @@ "question__title": "Partition String Into Minimum Beautiful Substrings", "question__title_slug": "partition-string-into-minimum-beautiful-substrings", "question__hide": false, - "total_acs": 3684, - "total_submitted": 6457, + "total_acs": 3804, + "total_submitted": 6618, "total_column_articles": 46, "frontend_question_id": "2767", "is_new_question": false @@ -15888,9 +16350,9 @@ "question__title": "Ways to Express an Integer as Sum of Powers", "question__title_slug": "ways-to-express-an-integer-as-sum-of-powers", "question__hide": false, - "total_acs": 4726, - "total_submitted": 10140, - "total_column_articles": 45, + "total_acs": 5076, + "total_submitted": 10803, + "total_column_articles": 47, "frontend_question_id": "2787", "is_new_question": false }, @@ -15909,9 +16371,9 @@ "question__title": "Split Strings by Separator", "question__title_slug": "split-strings-by-separator", "question__hide": false, - "total_acs": 25484, - "total_submitted": 31599, - "total_column_articles": 196, + "total_acs": 25722, + "total_submitted": 31891, + "total_column_articles": 198, "frontend_question_id": "2788", "is_new_question": false }, @@ -15930,8 +16392,8 @@ "question__title": "Find the Closest Marked Node", "question__title_slug": "find-the-closest-marked-node", "question__hide": false, - "total_acs": 319, - "total_submitted": 590, + "total_acs": 322, + "total_submitted": 595, "total_column_articles": 11, "frontend_question_id": "2737", "is_new_question": false @@ -15951,8 +16413,8 @@ "question__title": "Minimum Changes to Make K Semi-palindromes", "question__title_slug": "minimum-changes-to-make-k-semi-palindromes", "question__hide": false, - "total_acs": 2424, - "total_submitted": 5073, + "total_acs": 2490, + "total_submitted": 5175, "total_column_articles": 25, "frontend_question_id": "2911", "is_new_question": false @@ -15972,9 +16434,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": 6191, - "total_submitted": 16810, - "total_column_articles": 65, + "total_acs": 6343, + "total_submitted": 17142, + "total_column_articles": 67, "frontend_question_id": "2772", "is_new_question": false }, @@ -15993,8 +16455,8 @@ "question__title": "Shortest String That Contains Three Strings", "question__title_slug": "shortest-string-that-contains-three-strings", "question__hide": false, - "total_acs": 4830, - "total_submitted": 13741, + "total_acs": 4850, + "total_submitted": 13787, "total_column_articles": 58, "frontend_question_id": "2800", "is_new_question": false @@ -16014,8 +16476,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": 29579, - "total_submitted": 33096, + "total_acs": 30175, + "total_submitted": 33795, "total_column_articles": 125, "frontend_question_id": "2798", "is_new_question": false @@ -16035,8 +16497,8 @@ "question__title": "Count Houses in a Circular Street", "question__title_slug": "count-houses-in-a-circular-street", "question__hide": false, - "total_acs": 280, - "total_submitted": 354, + "total_acs": 284, + "total_submitted": 365, "total_column_articles": 10, "frontend_question_id": "2728", "is_new_question": false @@ -16056,8 +16518,8 @@ "question__title": "Popularity Percentage", "question__title_slug": "popularity-percentage", "question__hide": false, - "total_acs": 521, - "total_submitted": 1001, + "total_acs": 544, + "total_submitted": 1033, "total_column_articles": 11, "frontend_question_id": "2720", "is_new_question": false @@ -16077,9 +16539,9 @@ "question__title": "Prime Pairs With Target Sum", "question__title_slug": "prime-pairs-with-target-sum", "question__hide": false, - "total_acs": 6614, - "total_submitted": 18949, - "total_column_articles": 50, + "total_acs": 6771, + "total_submitted": 19219, + "total_column_articles": 51, "frontend_question_id": "2761", "is_new_question": false }, @@ -16098,9 +16560,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": 31761, - "total_submitted": 55461, - "total_column_articles": 273, + "total_acs": 31911, + "total_submitted": 55706, + "total_column_articles": 274, "frontend_question_id": "2789", "is_new_question": false }, @@ -16119,9 +16581,9 @@ "question__title": "Double a Number Represented as a Linked List", "question__title_slug": "double-a-number-represented-as-a-linked-list", "question__hide": false, - "total_acs": 8488, - "total_submitted": 14350, - "total_column_articles": 98, + "total_acs": 8673, + "total_submitted": 14629, + "total_column_articles": 105, "frontend_question_id": "2816", "is_new_question": false }, @@ -16140,9 +16602,9 @@ "question__title": "Longest Alternating Subarray", "question__title_slug": "longest-alternating-subarray", "question__hide": false, - "total_acs": 25349, - "total_submitted": 50632, - "total_column_articles": 275, + "total_acs": 25530, + "total_submitted": 50951, + "total_column_articles": 276, "frontend_question_id": "2765", "is_new_question": false }, @@ -16161,9 +16623,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": 6247, - "total_submitted": 17730, - "total_column_articles": 69, + "total_acs": 6367, + "total_submitted": 17992, + "total_column_articles": 72, "frontend_question_id": "2771", "is_new_question": false }, @@ -16182,9 +16644,9 @@ "question__title": "Continuous Subarrays", "question__title_slug": "continuous-subarrays", "question__hide": false, - "total_acs": 5746, - "total_submitted": 11734, - "total_column_articles": 70, + "total_acs": 5885, + "total_submitted": 11937, + "total_column_articles": 76, "frontend_question_id": "2762", "is_new_question": false }, @@ -16203,9 +16665,9 @@ "question__title": "Ways to Split Array Into Good Subarrays", "question__title_slug": "ways-to-split-array-into-good-subarrays", "question__hide": false, - "total_acs": 4510, - "total_submitted": 11460, - "total_column_articles": 48, + "total_acs": 4583, + "total_submitted": 11622, + "total_column_articles": 49, "frontend_question_id": "2750", "is_new_question": false }, @@ -16224,8 +16686,8 @@ "question__title": "Longest Even Odd Subarray With Threshold", "question__title_slug": "longest-even-odd-subarray-with-threshold", "question__hide": false, - "total_acs": 30323, - "total_submitted": 67011, + "total_acs": 30484, + "total_submitted": 67300, "total_column_articles": 253, "frontend_question_id": "2760", "is_new_question": false @@ -16245,8 +16707,8 @@ "question__title": "Find Shortest Path with K Hops", "question__title_slug": "find-shortest-path-with-k-hops", "question__hide": false, - "total_acs": 237, - "total_submitted": 411, + "total_acs": 245, + "total_submitted": 421, "total_column_articles": 6, "frontend_question_id": "2714", "is_new_question": false @@ -16266,9 +16728,9 @@ "question__title": "Is Object Empty", "question__title_slug": "is-object-empty", "question__hide": false, - "total_acs": 6339, - "total_submitted": 8518, - "total_column_articles": 49, + "total_acs": 6515, + "total_submitted": 8723, + "total_column_articles": 50, "frontend_question_id": "2727", "is_new_question": false }, @@ -16287,8 +16749,8 @@ "question__title": "Calculator with Method Chaining", "question__title_slug": "calculator-with-method-chaining", "question__hide": false, - "total_acs": 2831, - "total_submitted": 4290, + "total_acs": 2907, + "total_submitted": 4394, "total_column_articles": 20, "frontend_question_id": "2726", "is_new_question": false @@ -16308,8 +16770,8 @@ "question__title": "Interval Cancellation", "question__title_slug": "interval-cancellation", "question__hide": false, - "total_acs": 3480, - "total_submitted": 4936, + "total_acs": 3576, + "total_submitted": 5047, "total_column_articles": 23, "frontend_question_id": "2725", "is_new_question": false @@ -16329,8 +16791,8 @@ "question__title": "Create Object from Two Arrays", "question__title_slug": "create-object-from-two-arrays", "question__hide": false, - "total_acs": 233, - "total_submitted": 366, + "total_acs": 240, + "total_submitted": 373, "total_column_articles": 7, "frontend_question_id": "2794", "is_new_question": false @@ -16350,8 +16812,8 @@ "question__title": "Sort By", "question__title_slug": "sort-by", "question__hide": false, - "total_acs": 4195, - "total_submitted": 5408, + "total_acs": 4321, + "total_submitted": 5574, "total_column_articles": 32, "frontend_question_id": "2724", "is_new_question": false @@ -16371,9 +16833,9 @@ "question__title": "Add Two Promises", "question__title_slug": "add-two-promises", "question__hide": false, - "total_acs": 6432, - "total_submitted": 7293, - "total_column_articles": 38, + "total_acs": 6682, + "total_submitted": 7567, + "total_column_articles": 39, "frontend_question_id": "2723", "is_new_question": false }, @@ -16392,8 +16854,8 @@ "question__title": "Join Two Arrays by ID", "question__title_slug": "join-two-arrays-by-id", "question__hide": false, - "total_acs": 3403, - "total_submitted": 7093, + "total_acs": 3496, + "total_submitted": 7269, "total_column_articles": 45, "frontend_question_id": "2722", "is_new_question": false @@ -16413,8 +16875,8 @@ "question__title": "Total Distance Traveled", "question__title_slug": "total-distance-traveled", "question__hide": false, - "total_acs": 29839, - "total_submitted": 51719, + "total_acs": 30036, + "total_submitted": 52070, "total_column_articles": 184, "frontend_question_id": "2739", "is_new_question": false @@ -16434,9 +16896,9 @@ "question__title": "Count Complete Subarrays in an Array", "question__title_slug": "count-complete-subarrays-in-an-array", "question__hide": false, - "total_acs": 8651, - "total_submitted": 14500, - "total_column_articles": 89, + "total_acs": 8858, + "total_submitted": 14781, + "total_column_articles": 94, "frontend_question_id": "2799", "is_new_question": false }, @@ -16455,9 +16917,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": 7262, - "total_submitted": 20049, - "total_column_articles": 71, + "total_acs": 7391, + "total_submitted": 20297, + "total_column_articles": 72, "frontend_question_id": "2770", "is_new_question": false }, @@ -16476,8 +16938,8 @@ "question__title": "Decremental String Concatenation", "question__title_slug": "decremental-string-concatenation", "question__hide": false, - "total_acs": 2713, - "total_submitted": 6837, + "total_acs": 2735, + "total_submitted": 6908, "total_column_articles": 39, "frontend_question_id": "2746", "is_new_question": false @@ -16497,9 +16959,9 @@ "question__title": "Consecutive Transactions with Increasing Amounts", "question__title_slug": "consecutive-transactions-with-increasing-amounts", "question__hide": false, - "total_acs": 660, - "total_submitted": 2482, - "total_column_articles": 24, + "total_acs": 694, + "total_submitted": 2602, + "total_column_articles": 25, "frontend_question_id": "2701", "is_new_question": false }, @@ -16518,9 +16980,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": 557, - "total_submitted": 1280, - "total_column_articles": 17, + "total_acs": 599, + "total_submitted": 1433, + "total_column_articles": 18, "frontend_question_id": "2752", "is_new_question": false }, @@ -16539,8 +17001,8 @@ "question__title": "Convert JSON String to Object", "question__title_slug": "convert-json-string-to-object", "question__hide": false, - "total_acs": 116, - "total_submitted": 235, + "total_acs": 125, + "total_submitted": 244, "total_column_articles": 6, "frontend_question_id": "2759", "is_new_question": false @@ -16560,9 +17022,9 @@ "question__title": "Construct the Longest New String", "question__title_slug": "construct-the-longest-new-string", "question__hide": false, - "total_acs": 4289, - "total_submitted": 7241, - "total_column_articles": 54, + "total_acs": 4415, + "total_submitted": 7434, + "total_column_articles": 56, "frontend_question_id": "2745", "is_new_question": false }, @@ -16581,9 +17043,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": 2950, - "total_submitted": 4766, - "total_column_articles": 21, + "total_acs": 2965, + "total_submitted": 4789, + "total_column_articles": 22, "frontend_question_id": "2763", "is_new_question": false }, @@ -16602,9 +17064,9 @@ "question__title": "Special Permutations", "question__title_slug": "special-permutations", "question__hide": false, - "total_acs": 4925, - "total_submitted": 13229, - "total_column_articles": 53, + "total_acs": 5008, + "total_submitted": 13358, + "total_column_articles": 54, "frontend_question_id": "2741", "is_new_question": false }, @@ -16623,9 +17085,9 @@ "question__title": "Find Maximum Number of String Pairs", "question__title_slug": "find-maximum-number-of-string-pairs", "question__hide": false, - "total_acs": 30724, - "total_submitted": 35566, - "total_column_articles": 226, + "total_acs": 31110, + "total_submitted": 36011, + "total_column_articles": 230, "frontend_question_id": "2744", "is_new_question": false }, @@ -16644,8 +17106,8 @@ "question__title": "Robot Collisions", "question__title_slug": "robot-collisions", "question__hide": false, - "total_acs": 2798, - "total_submitted": 5820, + "total_acs": 2828, + "total_submitted": 5872, "total_column_articles": 34, "frontend_question_id": "2751", "is_new_question": false @@ -16665,8 +17127,8 @@ "question__title": "Find the Value of the Partition", "question__title_slug": "find-the-value-of-the-partition", "question__hide": false, - "total_acs": 6697, - "total_submitted": 9133, + "total_acs": 6740, + "total_submitted": 9196, "total_column_articles": 52, "frontend_question_id": "2740", "is_new_question": false @@ -16686,9 +17148,9 @@ "question__title": "Sum of Squares of Special Elements ", "question__title_slug": "sum-of-squares-of-special-elements", "question__hide": false, - "total_acs": 9457, - "total_submitted": 12074, - "total_column_articles": 51, + "total_acs": 9631, + "total_submitted": 12275, + "total_column_articles": 52, "frontend_question_id": "2778", "is_new_question": false }, @@ -16707,8 +17169,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": 276, - "total_submitted": 467, + "total_acs": 281, + "total_submitted": 472, "total_column_articles": 8, "frontend_question_id": "2689", "is_new_question": false @@ -16728,8 +17190,8 @@ "question__title": "Find Active Users", "question__title_slug": "find-active-users", "question__hide": false, - "total_acs": 803, - "total_submitted": 1986, + "total_acs": 843, + "total_submitted": 2084, "total_column_articles": 17, "frontend_question_id": "2688", "is_new_question": false @@ -16749,8 +17211,8 @@ "question__title": "Bikes Last Time Used ", "question__title_slug": "bikes-last-time-used", "question__hide": false, - "total_acs": 1045, - "total_submitted": 1260, + "total_acs": 1074, + "total_submitted": 1294, "total_column_articles": 11, "frontend_question_id": "2687", "is_new_question": false @@ -16770,8 +17232,8 @@ "question__title": "Immediate Food Delivery III", "question__title_slug": "immediate-food-delivery-iii", "question__hide": false, - "total_acs": 725, - "total_submitted": 1107, + "total_acs": 752, + "total_submitted": 1149, "total_column_articles": 12, "frontend_question_id": "2686", "is_new_question": false @@ -16791,8 +17253,8 @@ "question__title": "Maximum Sum Queries", "question__title_slug": "maximum-sum-queries", "question__hide": false, - "total_acs": 12711, - "total_submitted": 24390, + "total_acs": 12751, + "total_submitted": 24455, "total_column_articles": 109, "frontend_question_id": "2736", "is_new_question": false @@ -16812,8 +17274,8 @@ "question__title": "Sum of Matrix After Queries", "question__title_slug": "sum-of-matrix-after-queries", "question__hide": false, - "total_acs": 5797, - "total_submitted": 16554, + "total_acs": 5830, + "total_submitted": 16617, "total_column_articles": 102, "frontend_question_id": "2718", "is_new_question": false @@ -16833,8 +17295,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": 3909, - "total_submitted": 11479, + "total_acs": 3943, + "total_submitted": 11571, "total_column_articles": 30, "frontend_question_id": "2749", "is_new_question": false @@ -16854,9 +17316,9 @@ "question__title": "Neither Minimum nor Maximum", "question__title_slug": "neither-minimum-nor-maximum", "question__hide": false, - "total_acs": 11528, - "total_submitted": 14687, - "total_column_articles": 73, + "total_acs": 11723, + "total_submitted": 14920, + "total_column_articles": 74, "frontend_question_id": "2733", "is_new_question": false }, @@ -16875,8 +17337,8 @@ "question__title": "Split a Circular Linked List", "question__title_slug": "split-a-circular-linked-list", "question__hide": false, - "total_acs": 217, - "total_submitted": 335, + "total_acs": 227, + "total_submitted": 345, "total_column_articles": 10, "frontend_question_id": "2674", "is_new_question": false @@ -16896,9 +17358,9 @@ "question__title": "Relocate Marbles", "question__title_slug": "relocate-marbles", "question__hide": false, - "total_acs": 4220, - "total_submitted": 7719, - "total_column_articles": 24, + "total_acs": 4277, + "total_submitted": 7797, + "total_column_articles": 26, "frontend_question_id": "2766", "is_new_question": false }, @@ -16917,8 +17379,8 @@ "question__title": "Count Zero Request Servers", "question__title_slug": "count-zero-request-servers", "question__hide": false, - "total_acs": 2216, - "total_submitted": 5985, + "total_acs": 2262, + "total_submitted": 6117, "total_column_articles": 28, "frontend_question_id": "2747", "is_new_question": false @@ -16938,9 +17400,9 @@ "question__title": "Find the Longest Equal Subarray", "question__title_slug": "find-the-longest-equal-subarray", "question__hide": false, - "total_acs": 5793, - "total_submitted": 13748, - "total_column_articles": 69, + "total_acs": 22113, + "total_submitted": 45830, + "total_column_articles": 170, "frontend_question_id": "2831", "is_new_question": false }, @@ -16959,8 +17421,8 @@ "question__title": "Number of Beautiful Pairs", "question__title_slug": "number-of-beautiful-pairs", "question__hide": false, - "total_acs": 6324, - "total_submitted": 10912, + "total_acs": 6431, + "total_submitted": 11094, "total_column_articles": 45, "frontend_question_id": "2748", "is_new_question": false @@ -16980,8 +17442,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": 806, - "total_submitted": 1098, + "total_acs": 823, + "total_submitted": 1124, "total_column_articles": 6, "frontend_question_id": "2669", "is_new_question": false @@ -17001,9 +17463,9 @@ "question__title": "Find Latest Salaries", "question__title_slug": "find-latest-salaries", "question__hide": false, - "total_acs": 913, - "total_submitted": 1267, - "total_column_articles": 12, + "total_acs": 932, + "total_submitted": 1293, + "total_column_articles": 13, "frontend_question_id": "2668", "is_new_question": false }, @@ -17022,9 +17484,9 @@ "question__title": "Lexicographically Smallest String After Substring Operation", "question__title_slug": "lexicographically-smallest-string-after-substring-operation", "question__hide": false, - "total_acs": 6357, - "total_submitted": 18448, - "total_column_articles": 49, + "total_acs": 6416, + "total_submitted": 18555, + "total_column_articles": 50, "frontend_question_id": "2734", "is_new_question": false }, @@ -17043,9 +17505,9 @@ "question__title": "Greatest Common Divisor Traversal", "question__title_slug": "greatest-common-divisor-traversal", "question__hide": false, - "total_acs": 3356, - "total_submitted": 13139, - "total_column_articles": 43, + "total_acs": 3438, + "total_submitted": 13381, + "total_column_articles": 44, "frontend_question_id": "2709", "is_new_question": false }, @@ -17064,8 +17526,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": 1822, - "total_submitted": 3309, + "total_acs": 1831, + "total_submitted": 3336, "total_column_articles": 20, "frontend_question_id": "2732", "is_new_question": false @@ -17085,8 +17547,8 @@ "question__title": "Minimize String Length", "question__title_slug": "minimize-string-length", "question__hide": false, - "total_acs": 7889, - "total_submitted": 10818, + "total_acs": 7972, + "total_submitted": 10931, "total_column_articles": 64, "frontend_question_id": "2716", "is_new_question": false @@ -17106,9 +17568,9 @@ "question__title": "Check if The Number is Fascinating", "question__title_slug": "check-if-the-number-is-fascinating", "question__hide": false, - "total_acs": 6319, - "total_submitted": 10399, - "total_column_articles": 65, + "total_acs": 6403, + "total_submitted": 10539, + "total_column_articles": 66, "frontend_question_id": "2729", "is_new_question": false }, @@ -17127,8 +17589,8 @@ "question__title": "The Knight’s Tour", "question__title_slug": "the-knights-tour", "question__hide": false, - "total_acs": 217, - "total_submitted": 330, + "total_acs": 248, + "total_submitted": 422, "total_column_articles": 9, "frontend_question_id": "2664", "is_new_question": false @@ -17148,8 +17610,8 @@ "question__title": "Next Day", "question__title_slug": "next-day", "question__hide": false, - "total_acs": 270, - "total_submitted": 350, + "total_acs": 276, + "total_submitted": 356, "total_column_articles": 7, "frontend_question_id": "2758", "is_new_question": false @@ -17169,8 +17631,8 @@ "question__title": "Timeout Cancellation", "question__title_slug": "timeout-cancellation", "question__hide": false, - "total_acs": 3837, - "total_submitted": 4698, + "total_acs": 3949, + "total_submitted": 4831, "total_column_articles": 24, "frontend_question_id": "2715", "is_new_question": false @@ -17190,9 +17652,9 @@ "question__title": "Return Length of Arguments Passed", "question__title_slug": "return-length-of-arguments-passed", "question__hide": false, - "total_acs": 9195, - "total_submitted": 9939, - "total_column_articles": 29, + "total_acs": 9469, + "total_submitted": 10230, + "total_column_articles": 30, "frontend_question_id": "2703", "is_new_question": false }, @@ -17211,9 +17673,9 @@ "question__title": "Remove Trailing Zeros From a String", "question__title_slug": "remove-trailing-zeros-from-a-string", "question__hide": false, - "total_acs": 10183, - "total_submitted": 12469, - "total_column_articles": 82, + "total_acs": 10352, + "total_submitted": 12671, + "total_column_articles": 86, "frontend_question_id": "2710", "is_new_question": false }, @@ -17232,8 +17694,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": 3088, - "total_submitted": 8520, + "total_acs": 3114, + "total_submitted": 8572, "total_column_articles": 33, "frontend_question_id": "2713", "is_new_question": false @@ -17253,9 +17715,9 @@ "question__title": "Minimum Cost to Make All Characters Equal", "question__title_slug": "minimum-cost-to-make-all-characters-equal", "question__hide": false, - "total_acs": 5041, - "total_submitted": 8809, - "total_column_articles": 62, + "total_acs": 5076, + "total_submitted": 8854, + "total_column_articles": 63, "frontend_question_id": "2712", "is_new_question": false }, @@ -17274,9 +17736,9 @@ "question__title": "Lexicographically Smallest Palindrome", "question__title_slug": "lexicographically-smallest-palindrome", "question__hide": false, - "total_acs": 31375, - "total_submitted": 36044, - "total_column_articles": 194, + "total_acs": 31630, + "total_submitted": 36388, + "total_column_articles": 195, "frontend_question_id": "2697", "is_new_question": false }, @@ -17295,8 +17757,8 @@ "question__title": "Find Maximal Uncovered Ranges", "question__title_slug": "find-maximal-uncovered-ranges", "question__hide": false, - "total_acs": 240, - "total_submitted": 512, + "total_acs": 248, + "total_submitted": 524, "total_column_articles": 6, "frontend_question_id": "2655", "is_new_question": false @@ -17316,8 +17778,8 @@ "question__title": "Generate Circular Array Values", "question__title_slug": "generate-circular-array-values", "question__hide": false, - "total_acs": 168, - "total_submitted": 258, + "total_acs": 172, + "total_submitted": 262, "total_column_articles": 4, "frontend_question_id": "2757", "is_new_question": false @@ -17337,8 +17799,8 @@ "question__title": "To Be Or Not To Be", "question__title_slug": "to-be-or-not-to-be", "question__hide": false, - "total_acs": 8086, - "total_submitted": 14316, + "total_acs": 8269, + "total_submitted": 14578, "total_column_articles": 47, "frontend_question_id": "2704", "is_new_question": false @@ -17358,9 +17820,9 @@ "question__title": "Find the Maximum Achievable Number", "question__title_slug": "find-the-maximum-achievable-number", "question__hide": false, - "total_acs": 16293, - "total_submitted": 18156, - "total_column_articles": 78, + "total_acs": 36875, + "total_submitted": 39746, + "total_column_articles": 153, "frontend_question_id": "2769", "is_new_question": false }, @@ -17379,9 +17841,9 @@ "question__title": "Determine the Minimum Sum of a k-avoiding Array", "question__title_slug": "determine-the-minimum-sum-of-a-k-avoiding-array", "question__hide": false, - "total_acs": 7095, - "total_submitted": 11870, - "total_column_articles": 48, + "total_acs": 7160, + "total_submitted": 11959, + "total_column_articles": 50, "frontend_question_id": "2829", "is_new_question": false }, @@ -17400,9 +17862,9 @@ "question__title": "Collecting Chocolates", "question__title_slug": "collecting-chocolates", "question__hide": false, - "total_acs": 17264, - "total_submitted": 31589, - "total_column_articles": 126, + "total_acs": 17386, + "total_submitted": 31852, + "total_column_articles": 127, "frontend_question_id": "2735", "is_new_question": false }, @@ -17421,9 +17883,9 @@ "question__title": "Create Hello World Function", "question__title_slug": "create-hello-world-function", "question__hide": false, - "total_acs": 15957, - "total_submitted": 18706, - "total_column_articles": 64, + "total_acs": 16278, + "total_submitted": 19054, + "total_column_articles": 65, "frontend_question_id": "2667", "is_new_question": false }, @@ -17442,8 +17904,8 @@ "question__title": "Painting the Walls", "question__title_slug": "painting-the-walls", "question__hide": false, - "total_acs": 3827, - "total_submitted": 10054, + "total_acs": 3902, + "total_submitted": 10180, "total_column_articles": 38, "frontend_question_id": "2742", "is_new_question": false @@ -17463,8 +17925,8 @@ "question__title": "Execute Asynchronous Functions in Parallel", "question__title_slug": "execute-asynchronous-functions-in-parallel", "question__hide": false, - "total_acs": 2780, - "total_submitted": 4521, + "total_acs": 2851, + "total_submitted": 4618, "total_column_articles": 30, "frontend_question_id": "2721", "is_new_question": false @@ -17484,8 +17946,8 @@ "question__title": "Query Batching", "question__title_slug": "query-batching", "question__hide": false, - "total_acs": 116, - "total_submitted": 257, + "total_acs": 122, + "total_submitted": 264, "total_column_articles": 4, "frontend_question_id": "2756", "is_new_question": false @@ -17505,9 +17967,9 @@ "question__title": "Array Wrapper", "question__title_slug": "array-wrapper", "question__hide": false, - "total_acs": 3885, - "total_submitted": 4821, - "total_column_articles": 32, + "total_acs": 4029, + "total_submitted": 4979, + "total_column_articles": 33, "frontend_question_id": "2695", "is_new_question": false }, @@ -17526,9 +17988,9 @@ "question__title": "Compact Object", "question__title_slug": "compact-object", "question__hide": false, - "total_acs": 2967, - "total_submitted": 4712, - "total_column_articles": 38, + "total_acs": 3047, + "total_submitted": 4832, + "total_column_articles": 39, "frontend_question_id": "2705", "is_new_question": false }, @@ -17547,8 +18009,8 @@ "question__title": "Modify Graph Edge Weights", "question__title_slug": "modify-graph-edge-weights", "question__hide": false, - "total_acs": 9770, - "total_submitted": 18922, + "total_acs": 9784, + "total_submitted": 18946, "total_column_articles": 61, "frontend_question_id": "2699", "is_new_question": false @@ -17568,9 +18030,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": 28156, - "total_submitted": 35884, - "total_column_articles": 226, + "total_acs": 28269, + "total_submitted": 36025, + "total_column_articles": 227, "frontend_question_id": "2698", "is_new_question": false }, @@ -17589,8 +18051,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": 5380, - "total_submitted": 7532, + "total_acs": 5409, + "total_submitted": 7566, "total_column_articles": 62, "frontend_question_id": "2711", "is_new_question": false @@ -17610,9 +18072,9 @@ "question__title": "Minimum String Length After Removing Substrings", "question__title_slug": "minimum-string-length-after-removing-substrings", "question__hide": false, - "total_acs": 33260, - "total_submitted": 42954, - "total_column_articles": 295, + "total_acs": 33787, + "total_submitted": 43638, + "total_column_articles": 299, "frontend_question_id": "2696", "is_new_question": false }, @@ -17631,8 +18093,8 @@ "question__title": "Date Range Generator", "question__title_slug": "date-range-generator", "question__hide": false, - "total_acs": 154, - "total_submitted": 214, + "total_acs": 157, + "total_submitted": 217, "total_column_articles": 6, "frontend_question_id": "2777", "is_new_question": false @@ -17652,9 +18114,9 @@ "question__title": "Chunk Array", "question__title_slug": "chunk-array", "question__hide": false, - "total_acs": 6143, - "total_submitted": 8196, - "total_column_articles": 100, + "total_acs": 6314, + "total_submitted": 8383, + "total_column_articles": 103, "frontend_question_id": "2677", "is_new_question": false }, @@ -17673,8 +18135,8 @@ "question__title": "Event Emitter", "question__title_slug": "event-emitter", "question__hide": false, - "total_acs": 2285, - "total_submitted": 3530, + "total_acs": 2336, + "total_submitted": 3611, "total_column_articles": 31, "frontend_question_id": "2694", "is_new_question": false @@ -17694,8 +18156,8 @@ "question__title": "Allow One Function Call", "question__title_slug": "allow-one-function-call", "question__hide": false, - "total_acs": 7467, - "total_submitted": 9709, + "total_acs": 7677, + "total_submitted": 9965, "total_column_articles": 59, "frontend_question_id": "2666", "is_new_question": false @@ -17715,8 +18177,8 @@ "question__title": "Deep Merge of Two Objects", "question__title_slug": "deep-merge-of-two-objects", "question__hide": false, - "total_acs": 227, - "total_submitted": 425, + "total_acs": 231, + "total_submitted": 429, "total_column_articles": 7, "frontend_question_id": "2755", "is_new_question": false @@ -17736,9 +18198,9 @@ "question__title": "Maximum Number of Moves in a Grid", "question__title_slug": "maximum-number-of-moves-in-a-grid", "question__hide": false, - "total_acs": 26136, - "total_submitted": 53064, - "total_column_articles": 258, + "total_acs": 26556, + "total_submitted": 53849, + "total_column_articles": 263, "frontend_question_id": "2684", "is_new_question": false }, @@ -17757,9 +18219,9 @@ "question__title": "Count the Number of Complete Components", "question__title_slug": "count-the-number-of-complete-components", "question__hide": false, - "total_acs": 6031, - "total_submitted": 8901, - "total_column_articles": 65, + "total_acs": 6150, + "total_submitted": 9050, + "total_column_articles": 68, "frontend_question_id": "2685", "is_new_question": false }, @@ -17778,9 +18240,9 @@ "question__title": "Neighboring Bitwise XOR", "question__title_slug": "neighboring-bitwise-xor", "question__hide": false, - "total_acs": 6852, - "total_submitted": 9783, - "total_column_articles": 61, + "total_acs": 6935, + "total_submitted": 9879, + "total_column_articles": 62, "frontend_question_id": "2683", "is_new_question": false }, @@ -17799,8 +18261,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": 31562, - "total_submitted": 51980, + "total_acs": 31621, + "total_submitted": 52068, "total_column_articles": 236, "frontend_question_id": "2682", "is_new_question": false @@ -17820,9 +18282,9 @@ "question__title": "Call Function with Custom Context", "question__title_slug": "call-function-with-custom-context", "question__hide": false, - "total_acs": 1847, - "total_submitted": 2761, - "total_column_articles": 32, + "total_acs": 1911, + "total_submitted": 2858, + "total_column_articles": 34, "frontend_question_id": "2693", "is_new_question": false }, @@ -17841,8 +18303,8 @@ "question__title": "Counter II", "question__title_slug": "counter-ii", "question__hide": false, - "total_acs": 10572, - "total_submitted": 15978, + "total_acs": 10825, + "total_submitted": 16289, "total_column_articles": 77, "frontend_question_id": "2665", "is_new_question": false @@ -17862,8 +18324,8 @@ "question__title": "Design Cancellable Function", "question__title_slug": "design-cancellable-function", "question__hide": false, - "total_acs": 820, - "total_submitted": 1450, + "total_acs": 841, + "total_submitted": 1481, "total_column_articles": 20, "frontend_question_id": "2650", "is_new_question": false @@ -17883,8 +18345,8 @@ "question__title": "Movement of Robots", "question__title_slug": "movement-of-robots", "question__hide": false, - "total_acs": 20621, - "total_submitted": 54684, + "total_acs": 20698, + "total_submitted": 54828, "total_column_articles": 140, "frontend_question_id": "2731", "is_new_question": false @@ -17904,9 +18366,9 @@ "question__title": "Find the Longest Semi-Repetitive Substring", "question__title_slug": "find-the-longest-semi-repetitive-substring", "question__hide": false, - "total_acs": 6976, - "total_submitted": 14343, - "total_column_articles": 74, + "total_acs": 7491, + "total_submitted": 15286, + "total_column_articles": 79, "frontend_question_id": "2730", "is_new_question": false }, @@ -17925,9 +18387,9 @@ "question__title": "Semi-Ordered Permutation", "question__title_slug": "semi-ordered-permutation", "question__hide": false, - "total_acs": 7484, - "total_submitted": 10196, - "total_column_articles": 54, + "total_acs": 7575, + "total_submitted": 10318, + "total_column_articles": 55, "frontend_question_id": "2717", "is_new_question": false }, @@ -17946,9 +18408,9 @@ "question__title": "Power of Heroes", "question__title_slug": "power-of-heroes", "question__hide": false, - "total_acs": 18913, - "total_submitted": 45583, - "total_column_articles": 124, + "total_acs": 18945, + "total_submitted": 45650, + "total_column_articles": 125, "frontend_question_id": "2681", "is_new_question": false }, @@ -17967,9 +18429,9 @@ "question__title": "Nested Array Generator", "question__title_slug": "nested-array-generator", "question__hide": false, - "total_acs": 2162, - "total_submitted": 2844, - "total_column_articles": 42, + "total_acs": 2217, + "total_submitted": 2909, + "total_column_articles": 43, "frontend_question_id": "2649", "is_new_question": false }, @@ -17988,8 +18450,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": 182, - "total_submitted": 197, + "total_acs": 190, + "total_submitted": 207, "total_column_articles": 5, "frontend_question_id": "2776", "is_new_question": false @@ -18009,8 +18471,8 @@ "question__title": "Undefined to Null", "question__title_slug": "undefined-to-null", "question__hide": false, - "total_acs": 218, - "total_submitted": 285, + "total_acs": 221, + "total_submitted": 288, "total_column_articles": 9, "frontend_question_id": "2775", "is_new_question": false @@ -18030,9 +18492,9 @@ "question__title": "Make Costs of Paths Equal in a Binary Tree", "question__title_slug": "make-costs-of-paths-equal-in-a-binary-tree", "question__hide": false, - "total_acs": 21275, - "total_submitted": 30107, - "total_column_articles": 178, + "total_acs": 21351, + "total_submitted": 30220, + "total_column_articles": 177, "frontend_question_id": "2673", "is_new_question": false }, @@ -18051,9 +18513,9 @@ "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": 5597, - "total_submitted": 9648, - "total_column_articles": 55, + "total_acs": 5630, + "total_submitted": 9700, + "total_column_articles": 56, "frontend_question_id": "2672", "is_new_question": false }, @@ -18072,9 +18534,9 @@ "question__title": "Frequency Tracker", "question__title_slug": "frequency-tracker", "question__hide": false, - "total_acs": 23602, - "total_submitted": 56338, - "total_column_articles": 165, + "total_acs": 23896, + "total_submitted": 56727, + "total_column_articles": 164, "frontend_question_id": "2671", "is_new_question": false }, @@ -18093,9 +18555,9 @@ "question__title": "Find the Distinct Difference Array", "question__title_slug": "find-the-distinct-difference-array", "question__hide": false, - "total_acs": 26089, - "total_submitted": 31371, - "total_column_articles": 208, + "total_acs": 26267, + "total_submitted": 31575, + "total_column_articles": 209, "frontend_question_id": "2670", "is_new_question": false }, @@ -18114,8 +18576,8 @@ "question__title": "Make Object Immutable", "question__title_slug": "make-object-immutable", "question__hide": false, - "total_acs": 201, - "total_submitted": 344, + "total_acs": 206, + "total_submitted": 351, "total_column_articles": 7, "frontend_question_id": "2692", "is_new_question": false @@ -18135,8 +18597,8 @@ "question__title": "Generate Fibonacci Sequence", "question__title_slug": "generate-fibonacci-sequence", "question__hide": false, - "total_acs": 4502, - "total_submitted": 5571, + "total_acs": 4592, + "total_submitted": 5679, "total_column_articles": 59, "frontend_question_id": "2648", "is_new_question": false @@ -18156,8 +18618,8 @@ "question__title": "Differences Between Two Objects", "question__title_slug": "differences-between-two-objects", "question__hide": false, - "total_acs": 719, - "total_submitted": 1231, + "total_acs": 724, + "total_submitted": 1241, "total_column_articles": 25, "frontend_question_id": "2700", "is_new_question": false @@ -18177,8 +18639,8 @@ "question__title": "Immutability Helper", "question__title_slug": "immutability-helper", "question__hide": false, - "total_acs": 88, - "total_submitted": 380, + "total_acs": 92, + "total_submitted": 399, "total_column_articles": 3, "frontend_question_id": "2691", "is_new_question": false @@ -18198,8 +18660,8 @@ "question__title": "Infinite Method Object", "question__title_slug": "infinite-method-object", "question__hide": false, - "total_acs": 324, - "total_submitted": 364, + "total_acs": 333, + "total_submitted": 375, "total_column_articles": 6, "frontend_question_id": "2690", "is_new_question": false @@ -18219,8 +18681,8 @@ "question__title": "Throttle", "question__title_slug": "throttle", "question__hide": false, - "total_acs": 1138, - "total_submitted": 2378, + "total_acs": 1161, + "total_submitted": 2420, "total_column_articles": 30, "frontend_question_id": "2676", "is_new_question": false @@ -18240,8 +18702,8 @@ "question__title": "Bind Function to Context", "question__title_slug": "bind-function-to-context", "question__hide": false, - "total_acs": 236, - "total_submitted": 297, + "total_acs": 242, + "total_submitted": 306, "total_column_articles": 7, "frontend_question_id": "2754", "is_new_question": false @@ -18261,8 +18723,8 @@ "question__title": "Array of Objects to Matrix", "question__title_slug": "array-of-objects-to-matrix", "question__hide": false, - "total_acs": 819, - "total_submitted": 1437, + "total_acs": 823, + "total_submitted": 1441, "total_column_articles": 27, "frontend_question_id": "2675", "is_new_question": false @@ -18282,8 +18744,8 @@ "question__title": "Array Upper Bound", "question__title_slug": "array-upper-bound", "question__hide": false, - "total_acs": 291, - "total_submitted": 356, + "total_acs": 303, + "total_submitted": 370, "total_column_articles": 10, "frontend_question_id": "2774", "is_new_question": false @@ -18303,9 +18765,9 @@ "question__title": "Maximum Sum With Exactly K Elements ", "question__title_slug": "maximum-sum-with-exactly-k-elements", "question__hide": false, - "total_acs": 39405, - "total_submitted": 45715, - "total_column_articles": 251, + "total_acs": 39762, + "total_submitted": 46154, + "total_column_articles": 254, "frontend_question_id": "2656", "is_new_question": false }, @@ -18324,8 +18786,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": 5271, - "total_submitted": 6513, + "total_acs": 5318, + "total_submitted": 6580, "total_column_articles": 65, "frontend_question_id": "2657", "is_new_question": false @@ -18345,8 +18807,8 @@ "question__title": "Make Array Empty", "question__title_slug": "make-array-empty", "question__hide": false, - "total_acs": 2748, - "total_submitted": 7045, + "total_acs": 2823, + "total_submitted": 7157, "total_column_articles": 30, "frontend_question_id": "2659", "is_new_question": false @@ -18366,9 +18828,9 @@ "question__title": "Maximum Number of Fish in a Grid", "question__title_slug": "maximum-number-of-fish-in-a-grid", "question__hide": false, - "total_acs": 4949, - "total_submitted": 8068, - "total_column_articles": 53, + "total_acs": 5090, + "total_submitted": 8247, + "total_column_articles": 56, "frontend_question_id": "2658", "is_new_question": false }, @@ -18387,9 +18849,9 @@ "question__title": "Cache With Time Limit", "question__title_slug": "cache-with-time-limit", "question__hide": false, - "total_acs": 5502, - "total_submitted": 9222, - "total_column_articles": 100, + "total_acs": 5622, + "total_submitted": 9409, + "total_column_articles": 101, "frontend_question_id": "2622", "is_new_question": false }, @@ -18408,9 +18870,9 @@ "question__title": "Array Reduce Transformation", "question__title_slug": "array-reduce-transformation", "question__hide": false, - "total_acs": 11870, - "total_submitted": 15118, - "total_column_articles": 96, + "total_acs": 12147, + "total_submitted": 15439, + "total_column_articles": 98, "frontend_question_id": "2626", "is_new_question": false }, @@ -18429,8 +18891,8 @@ "question__title": "Snail Traversal", "question__title_slug": "snail-traversal", "question__hide": false, - "total_acs": 3901, - "total_submitted": 6129, + "total_acs": 3970, + "total_submitted": 6247, "total_column_articles": 98, "frontend_question_id": "2624", "is_new_question": false @@ -18450,9 +18912,9 @@ "question__title": "Flatten Deeply Nested Array", "question__title_slug": "flatten-deeply-nested-array", "question__hide": false, - "total_acs": 7341, - "total_submitted": 13507, - "total_column_articles": 100, + "total_acs": 7524, + "total_submitted": 13800, + "total_column_articles": 102, "frontend_question_id": "2625", "is_new_question": false }, @@ -18471,8 +18933,8 @@ "question__title": "Check if Object Instance of Class", "question__title_slug": "check-if-object-instance-of-class", "question__hide": false, - "total_acs": 6637, - "total_submitted": 19401, + "total_acs": 6788, + "total_submitted": 19807, "total_column_articles": 68, "frontend_question_id": "2618", "is_new_question": false @@ -18492,9 +18954,9 @@ "question__title": "Count of Integers", "question__title_slug": "count-of-integers", "question__hide": false, - "total_acs": 15106, - "total_submitted": 27188, - "total_column_articles": 99, + "total_acs": 15256, + "total_submitted": 27496, + "total_column_articles": 101, "frontend_question_id": "2719", "is_new_question": false }, @@ -18513,9 +18975,9 @@ "question__title": "Buy Two Chocolates", "question__title_slug": "buy-two-chocolates", "question__hide": false, - "total_acs": 28475, - "total_submitted": 36967, - "total_column_articles": 212, + "total_acs": 28945, + "total_submitted": 37679, + "total_column_articles": 216, "frontend_question_id": "2706", "is_new_question": false }, @@ -18534,8 +18996,8 @@ "question__title": "Extra Characters in a String", "question__title_slug": "extra-characters-in-a-string", "question__hide": false, - "total_acs": 21330, - "total_submitted": 33568, + "total_acs": 21574, + "total_submitted": 33917, "total_column_articles": 188, "frontend_question_id": "2707", "is_new_question": false @@ -18555,9 +19017,9 @@ "question__title": "Maximum Strength of a Group", "question__title_slug": "maximum-strength-of-a-group", "question__hide": false, - "total_acs": 5420, - "total_submitted": 17519, - "total_column_articles": 76, + "total_acs": 5495, + "total_submitted": 17754, + "total_column_articles": 77, "frontend_question_id": "2708", "is_new_question": false }, @@ -18576,8 +19038,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": 4121, - "total_submitted": 10109, + "total_acs": 4174, + "total_submitted": 10214, "total_column_articles": 32, "frontend_question_id": "2654", "is_new_question": false @@ -18597,9 +19059,9 @@ "question__title": "Sum Multiples", "question__title_slug": "sum-multiples", "question__hide": false, - "total_acs": 40127, - "total_submitted": 50757, - "total_column_articles": 186, + "total_acs": 40306, + "total_submitted": 50967, + "total_column_articles": 188, "frontend_question_id": "2652", "is_new_question": false }, @@ -18618,9 +19080,9 @@ "question__title": "Sliding Subarray Beauty", "question__title_slug": "sliding-subarray-beauty", "question__hide": false, - "total_acs": 7112, - "total_submitted": 18530, - "total_column_articles": 84, + "total_acs": 7404, + "total_submitted": 19035, + "total_column_articles": 89, "frontend_question_id": "2653", "is_new_question": false }, @@ -18639,8 +19101,8 @@ "question__title": "Promise Pool", "question__title_slug": "promise-pool", "question__hide": false, - "total_acs": 1449, - "total_submitted": 2271, + "total_acs": 1463, + "total_submitted": 2291, "total_column_articles": 33, "frontend_question_id": "2636", "is_new_question": false @@ -18660,9 +19122,9 @@ "question__title": "Promise Time Limit", "question__title_slug": "promise-time-limit", "question__hide": false, - "total_acs": 5164, - "total_submitted": 7690, - "total_column_articles": 44, + "total_acs": 5264, + "total_submitted": 7817, + "total_column_articles": 45, "frontend_question_id": "2637", "is_new_question": false }, @@ -18681,9 +19143,9 @@ "question__title": "Calculate Delayed Arrival Time", "question__title_slug": "calculate-delayed-arrival-time", "question__hide": false, - "total_acs": 43166, - "total_submitted": 49589, - "total_column_articles": 162, + "total_acs": 43544, + "total_submitted": 50021, + "total_column_articles": 165, "frontend_question_id": "2651", "is_new_question": false }, @@ -18702,8 +19164,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": 11578, - "total_submitted": 14699, + "total_acs": 11843, + "total_submitted": 14993, "total_column_articles": 71, "frontend_question_id": "2635", "is_new_question": false @@ -18723,8 +19185,8 @@ "question__title": "Filter Elements from Array", "question__title_slug": "filter-elements-from-array", "question__hide": false, - "total_acs": 11123, - "total_submitted": 14760, + "total_acs": 11335, + "total_submitted": 15013, "total_column_articles": 89, "frontend_question_id": "2634", "is_new_question": false @@ -18744,8 +19206,8 @@ "question__title": "Convert Object to JSON String", "question__title_slug": "convert-object-to-json-string", "question__hide": false, - "total_acs": 1419, - "total_submitted": 2364, + "total_acs": 1427, + "total_submitted": 2377, "total_column_articles": 45, "frontend_question_id": "2633", "is_new_question": false @@ -18765,8 +19227,8 @@ "question__title": "Memoize II", "question__title_slug": "memoize-ii", "question__hide": false, - "total_acs": 1754, - "total_submitted": 4450, + "total_acs": 1810, + "total_submitted": 4537, "total_column_articles": 22, "frontend_question_id": "2630", "is_new_question": false @@ -18786,8 +19248,8 @@ "question__title": "Debounce", "question__title_slug": "debounce", "question__hide": false, - "total_acs": 6447, - "total_submitted": 8303, + "total_acs": 6604, + "total_submitted": 8496, "total_column_articles": 46, "frontend_question_id": "2627", "is_new_question": false @@ -18807,8 +19269,8 @@ "question__title": "Group By", "question__title_slug": "group-by", "question__hide": false, - "total_acs": 4858, - "total_submitted": 6103, + "total_acs": 4983, + "total_submitted": 6262, "total_column_articles": 59, "frontend_question_id": "2631", "is_new_question": false @@ -18828,8 +19290,8 @@ "question__title": "Function Composition", "question__title_slug": "function-composition", "question__hide": false, - "total_acs": 10890, - "total_submitted": 13169, + "total_acs": 11143, + "total_submitted": 13442, "total_column_articles": 109, "frontend_question_id": "2629", "is_new_question": false @@ -18849,8 +19311,8 @@ "question__title": "Curry", "question__title_slug": "curry", "question__hide": false, - "total_acs": 2084, - "total_submitted": 2527, + "total_acs": 2104, + "total_submitted": 2559, "total_column_articles": 37, "frontend_question_id": "2632", "is_new_question": false @@ -18870,8 +19332,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": 14307, - "total_submitted": 20469, + "total_acs": 14382, + "total_submitted": 20566, "total_column_articles": 124, "frontend_question_id": "2646", "is_new_question": false @@ -18891,8 +19353,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": 189, - "total_submitted": 375, + "total_acs": 194, + "total_submitted": 381, "total_column_articles": 7, "frontend_question_id": "2638", "is_new_question": false @@ -18912,9 +19374,9 @@ "question__title": "Row With Maximum Ones", "question__title_slug": "row-with-maximum-ones", "question__hide": false, - "total_acs": 10844, - "total_submitted": 13653, - "total_column_articles": 75, + "total_acs": 10985, + "total_submitted": 13820, + "total_column_articles": 76, "frontend_question_id": "2643", "is_new_question": false }, @@ -18933,9 +19395,9 @@ "question__title": "Minimum Additions to Make Valid String", "question__title_slug": "minimum-additions-to-make-valid-string", "question__hide": false, - "total_acs": 28878, - "total_submitted": 42869, - "total_column_articles": 398, + "total_acs": 29065, + "total_submitted": 43154, + "total_column_articles": 403, "frontend_question_id": "2645", "is_new_question": false }, @@ -18954,8 +19416,8 @@ "question__title": "JSON Deep Equal", "question__title_slug": "json-deep-equal", "question__hide": false, - "total_acs": 1755, - "total_submitted": 5256, + "total_acs": 1776, + "total_submitted": 5310, "total_column_articles": 44, "frontend_question_id": "2628", "is_new_question": false @@ -18975,9 +19437,9 @@ "question__title": "Array Prototype Last", "question__title_slug": "array-prototype-last", "question__hide": false, - "total_acs": 20718, - "total_submitted": 29804, - "total_column_articles": 142, + "total_acs": 21181, + "total_submitted": 30401, + "total_column_articles": 144, "frontend_question_id": "2619", "is_new_question": false }, @@ -18996,9 +19458,9 @@ "question__title": "Sleep", "question__title_slug": "sleep", "question__hide": false, - "total_acs": 15050, - "total_submitted": 18093, - "total_column_articles": 86, + "total_acs": 15409, + "total_submitted": 18515, + "total_column_articles": 88, "frontend_question_id": "2621", "is_new_question": false }, @@ -19017,9 +19479,9 @@ "question__title": "Counter", "question__title_slug": "counter", "question__hide": false, - "total_acs": 26603, - "total_submitted": 32828, - "total_column_articles": 123, + "total_acs": 27120, + "total_submitted": 33408, + "total_column_articles": 124, "frontend_question_id": "2620", "is_new_question": false }, @@ -19038,8 +19500,8 @@ "question__title": "Memoize", "question__title_slug": "memoize", "question__hide": false, - "total_acs": 7175, - "total_submitted": 11777, + "total_acs": 7348, + "total_submitted": 12046, "total_column_articles": 66, "frontend_question_id": "2623", "is_new_question": false @@ -19059,8 +19521,8 @@ "question__title": "Maximum OR", "question__title_slug": "maximum-or", "question__hide": false, - "total_acs": 4043, - "total_submitted": 9131, + "total_acs": 4129, + "total_submitted": 9267, "total_column_articles": 42, "frontend_question_id": "2680", "is_new_question": false @@ -19080,9 +19542,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": 191, - "total_submitted": 494, - "total_column_articles": 11, + "total_acs": 198, + "total_submitted": 512, + "total_column_articles": 12, "frontend_question_id": "2702", "is_new_question": false }, @@ -19101,8 +19563,8 @@ "question__title": "Sum in a Matrix", "question__title_slug": "sum-in-a-matrix", "question__hide": false, - "total_acs": 26478, - "total_submitted": 34065, + "total_acs": 26549, + "total_submitted": 34158, "total_column_articles": 217, "frontend_question_id": "2679", "is_new_question": false @@ -19122,9 +19584,9 @@ "question__title": "Number of Senior Citizens", "question__title_slug": "number-of-senior-citizens", "question__hide": false, - "total_acs": 37296, - "total_submitted": 47082, - "total_column_articles": 222, + "total_acs": 37489, + "total_submitted": 47340, + "total_column_articles": 224, "frontend_question_id": "2678", "is_new_question": false }, @@ -19143,9 +19605,9 @@ "question__title": "Minimum Reverse Operations", "question__title_slug": "minimum-reverse-operations", "question__hide": false, - "total_acs": 2804, - "total_submitted": 13027, - "total_column_articles": 36, + "total_acs": 2859, + "total_submitted": 13134, + "total_column_articles": 37, "frontend_question_id": "2612", "is_new_question": false }, @@ -19164,8 +19626,8 @@ "question__title": "Mice and Cheese", "question__title_slug": "mice-and-cheese", "question__hide": false, - "total_acs": 28720, - "total_submitted": 49266, + "total_acs": 28778, + "total_submitted": 49371, "total_column_articles": 306, "frontend_question_id": "2611", "is_new_question": false @@ -19185,9 +19647,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": 9671, - "total_submitted": 11494, - "total_column_articles": 105, + "total_acs": 9730, + "total_submitted": 11558, + "total_column_articles": 106, "frontend_question_id": "2610", "is_new_question": false }, @@ -19206,8 +19668,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": 34397, - "total_submitted": 59722, + "total_acs": 34452, + "total_submitted": 59816, "total_column_articles": 371, "frontend_question_id": "2609", "is_new_question": false @@ -19227,9 +19689,9 @@ "question__title": "Prime In Diagonal", "question__title_slug": "prime-in-diagonal", "question__hide": false, - "total_acs": 9980, - "total_submitted": 28498, - "total_column_articles": 66, + "total_acs": 10249, + "total_submitted": 28996, + "total_column_articles": 67, "frontend_question_id": "2614", "is_new_question": false }, @@ -19248,9 +19710,9 @@ "question__title": "Sum of Distances", "question__title_slug": "sum-of-distances", "question__hide": false, - "total_acs": 6440, - "total_submitted": 17564, - "total_column_articles": 69, + "total_acs": 6565, + "total_submitted": 17756, + "total_column_articles": 72, "frontend_question_id": "2615", "is_new_question": false }, @@ -19269,9 +19731,9 @@ "question__title": "Minimize the Maximum Difference of Pairs", "question__title_slug": "minimize-the-maximum-difference-of-pairs", "question__hide": false, - "total_acs": 5113, - "total_submitted": 12354, - "total_column_articles": 44, + "total_acs": 5182, + "total_submitted": 12477, + "total_column_articles": 46, "frontend_question_id": "2616", "is_new_question": false }, @@ -19290,8 +19752,8 @@ "question__title": "Beautiful Pairs", "question__title_slug": "beautiful-pairs", "question__hide": false, - "total_acs": 118, - "total_submitted": 332, + "total_acs": 122, + "total_submitted": 391, "total_column_articles": 5, "frontend_question_id": "2613", "is_new_question": false @@ -19311,9 +19773,9 @@ "question__title": "Minimum Operations to Make All Array Elements Equal", "question__title_slug": "minimum-operations-to-make-all-array-elements-equal", "question__hide": false, - "total_acs": 8694, - "total_submitted": 24290, - "total_column_articles": 112, + "total_acs": 8882, + "total_submitted": 24636, + "total_column_articles": 113, "frontend_question_id": "2602", "is_new_question": false }, @@ -19332,9 +19794,9 @@ "question__title": "Collect Coins in a Tree", "question__title_slug": "collect-coins-in-a-tree", "question__hide": false, - "total_acs": 14431, - "total_submitted": 24634, - "total_column_articles": 102, + "total_acs": 14472, + "total_submitted": 24707, + "total_column_articles": 103, "frontend_question_id": "2603", "is_new_question": false }, @@ -19353,9 +19815,9 @@ "question__title": "Prime Subtraction Operation", "question__title_slug": "prime-subtraction-operation", "question__hide": false, - "total_acs": 7985, - "total_submitted": 20357, - "total_column_articles": 89, + "total_acs": 8107, + "total_submitted": 20602, + "total_column_articles": 91, "frontend_question_id": "2601", "is_new_question": false }, @@ -19374,8 +19836,8 @@ "question__title": "K Items With the Maximum Sum", "question__title_slug": "k-items-with-the-maximum-sum", "question__hide": false, - "total_acs": 34894, - "total_submitted": 51523, + "total_acs": 35004, + "total_submitted": 51697, "total_column_articles": 239, "frontend_question_id": "2600", "is_new_question": false @@ -19395,9 +19857,9 @@ "question__title": "Left and Right Sum Differences", "question__title_slug": "left-and-right-sum-differences", "question__hide": false, - "total_acs": 14786, - "total_submitted": 17666, - "total_column_articles": 161, + "total_acs": 14953, + "total_submitted": 17853, + "total_column_articles": 163, "frontend_question_id": "2574", "is_new_question": false }, @@ -19416,9 +19878,9 @@ "question__title": "Find the Divisibility Array of a String", "question__title_slug": "find-the-divisibility-array-of-a-string", "question__hide": false, - "total_acs": 30272, - "total_submitted": 70413, - "total_column_articles": 208, + "total_acs": 30395, + "total_submitted": 70654, + "total_column_articles": 207, "frontend_question_id": "2575", "is_new_question": false }, @@ -19437,8 +19899,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": 7979, - "total_submitted": 20806, + "total_acs": 8001, + "total_submitted": 20857, "total_column_articles": 83, "frontend_question_id": "2576", "is_new_question": false @@ -19458,9 +19920,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": 4491, - "total_submitted": 11208, - "total_column_articles": 50, + "total_acs": 4517, + "total_submitted": 11312, + "total_column_articles": 51, "frontend_question_id": "2577", "is_new_question": false }, @@ -19479,9 +19941,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": 8597, - "total_submitted": 15412, - "total_column_articles": 140, + "total_acs": 8681, + "total_submitted": 15526, + "total_column_articles": 142, "frontend_question_id": "2571", "is_new_question": false }, @@ -19500,8 +19962,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": 4239, - "total_submitted": 13550, + "total_acs": 4278, + "total_submitted": 13656, "total_column_articles": 44, "frontend_question_id": "2572", "is_new_question": false @@ -19521,8 +19983,8 @@ "question__title": "Find the String with LCP", "question__title_slug": "find-the-string-with-lcp", "question__hide": false, - "total_acs": 2086, - "total_submitted": 5972, + "total_acs": 2102, + "total_submitted": 6005, "total_column_articles": 35, "frontend_question_id": "2573", "is_new_question": false @@ -19542,8 +20004,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": 10225, - "total_submitted": 14698, + "total_acs": 10315, + "total_submitted": 14810, "total_column_articles": 96, "frontend_question_id": "2570", "is_new_question": false @@ -19563,9 +20025,9 @@ "question__title": "Minimum Score by Changing Two Elements", "question__title_slug": "minimum-score-by-changing-two-elements", "question__hide": false, - "total_acs": 4768, - "total_submitted": 9018, - "total_column_articles": 42, + "total_acs": 4811, + "total_submitted": 9088, + "total_column_articles": 43, "frontend_question_id": "2567", "is_new_question": false }, @@ -19584,9 +20046,9 @@ "question__title": "Minimum Impossible OR", "question__title_slug": "minimum-impossible-or", "question__hide": false, - "total_acs": 4476, - "total_submitted": 7329, - "total_column_articles": 34, + "total_acs": 4529, + "total_submitted": 7401, + "total_column_articles": 33, "frontend_question_id": "2568", "is_new_question": false }, @@ -19605,8 +20067,8 @@ "question__title": "Maximum Difference by Remapping a Digit", "question__title_slug": "maximum-difference-by-remapping-a-digit", "question__hide": false, - "total_acs": 6735, - "total_submitted": 10633, + "total_acs": 6841, + "total_submitted": 10789, "total_column_articles": 77, "frontend_question_id": "2566", "is_new_question": false @@ -19626,9 +20088,9 @@ "question__title": "Handling Sum Queries After Update", "question__title_slug": "handling-sum-queries-after-update", "question__hide": false, - "total_acs": 13254, - "total_submitted": 31441, - "total_column_articles": 112, + "total_acs": 13358, + "total_submitted": 31657, + "total_column_articles": 113, "frontend_question_id": "2569", "is_new_question": false }, @@ -19647,8 +20109,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": 259, - "total_submitted": 776, + "total_acs": 263, + "total_submitted": 801, "total_column_articles": 9, "frontend_question_id": "2557", "is_new_question": false @@ -19668,8 +20130,8 @@ "question__title": "Subsequence With the Minimum Score", "question__title_slug": "subsequence-with-the-minimum-score", "question__hide": false, - "total_acs": 3347, - "total_submitted": 9181, + "total_acs": 3367, + "total_submitted": 9220, "total_column_articles": 38, "frontend_question_id": "2565", "is_new_question": false @@ -19689,9 +20151,9 @@ "question__title": "Substring XOR Queries", "question__title_slug": "substring-xor-queries", "question__hide": false, - "total_acs": 5615, - "total_submitted": 14880, - "total_column_articles": 64, + "total_acs": 5666, + "total_submitted": 14983, + "total_column_articles": 65, "frontend_question_id": "2564", "is_new_question": false }, @@ -19710,9 +20172,9 @@ "question__title": "Count the Number of Fair Pairs", "question__title_slug": "count-the-number-of-fair-pairs", "question__hide": false, - "total_acs": 10204, - "total_submitted": 27717, - "total_column_articles": 104, + "total_acs": 10674, + "total_submitted": 28632, + "total_column_articles": 109, "frontend_question_id": "2563", "is_new_question": false }, @@ -19731,9 +20193,9 @@ "question__title": "Find the Array Concatenation Value", "question__title_slug": "find-the-array-concatenation-value", "question__hide": false, - "total_acs": 35789, - "total_submitted": 47398, - "total_column_articles": 286, + "total_acs": 35921, + "total_submitted": 47558, + "total_column_articles": 287, "frontend_question_id": "2562", "is_new_question": false }, @@ -19752,8 +20214,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": 13424, - "total_submitted": 34039, + "total_acs": 13483, + "total_submitted": 34178, "total_column_articles": 116, "frontend_question_id": "2617", "is_new_question": false @@ -19773,9 +20235,9 @@ "question__title": "The Number of Beautiful Subsets", "question__title_slug": "the-number-of-beautiful-subsets", "question__hide": false, - "total_acs": 8216, - "total_submitted": 22610, - "total_column_articles": 65, + "total_acs": 8390, + "total_submitted": 22883, + "total_column_articles": 66, "frontend_question_id": "2597", "is_new_question": false }, @@ -19794,9 +20256,9 @@ "question__title": "Find Score of an Array After Marking All Elements", "question__title_slug": "find-score-of-an-array-after-marking-all-elements", "question__hide": false, - "total_acs": 5039, - "total_submitted": 9696, - "total_column_articles": 56, + "total_acs": 5097, + "total_submitted": 9771, + "total_column_articles": 57, "frontend_question_id": "2593", "is_new_question": false }, @@ -19815,9 +20277,9 @@ "question__title": "Find the Maximum Divisibility Score", "question__title_slug": "find-the-maximum-divisibility-score", "question__hide": false, - "total_acs": 8575, - "total_submitted": 16570, - "total_column_articles": 45, + "total_acs": 24260, + "total_submitted": 39735, + "total_column_articles": 111, "frontend_question_id": "2644", "is_new_question": false }, @@ -19836,8 +20298,8 @@ "question__title": "Maximum Price to Fill a Bag", "question__title_slug": "maximum-price-to-fill-a-bag", "question__hide": false, - "total_acs": 413, - "total_submitted": 924, + "total_acs": 421, + "total_submitted": 934, "total_column_articles": 11, "frontend_question_id": "2548", "is_new_question": false @@ -19857,8 +20319,8 @@ "question__title": "Take Gifts From the Richest Pile", "question__title_slug": "take-gifts-from-the-richest-pile", "question__hide": false, - "total_acs": 31005, - "total_submitted": 43516, + "total_acs": 31204, + "total_submitted": 43801, "total_column_articles": 232, "frontend_question_id": "2558", "is_new_question": false @@ -19878,9 +20340,9 @@ "question__title": "Count Vowel Strings in Ranges", "question__title_slug": "count-vowel-strings-in-ranges", "question__hide": false, - "total_acs": 25628, - "total_submitted": 40224, - "total_column_articles": 279, + "total_acs": 26051, + "total_submitted": 40791, + "total_column_articles": 281, "frontend_question_id": "2559", "is_new_question": false }, @@ -19899,9 +20361,9 @@ "question__title": "House Robber IV", "question__title_slug": "house-robber-iv", "question__hide": false, - "total_acs": 26334, - "total_submitted": 43643, - "total_column_articles": 158, + "total_acs": 26554, + "total_submitted": 43987, + "total_column_articles": 159, "frontend_question_id": "2560", "is_new_question": false }, @@ -19920,8 +20382,8 @@ "question__title": "Rearranging Fruits", "question__title_slug": "rearranging-fruits", "question__hide": false, - "total_acs": 3519, - "total_submitted": 9448, + "total_acs": 3542, + "total_submitted": 9497, "total_column_articles": 36, "frontend_question_id": "2561", "is_new_question": false @@ -19941,8 +20403,8 @@ "question__title": "Design a Todo List", "question__title_slug": "design-a-todo-list", "question__hide": false, - "total_acs": 207, - "total_submitted": 453, + "total_acs": 210, + "total_submitted": 462, "total_column_articles": 7, "frontend_question_id": "2590", "is_new_question": false @@ -19962,8 +20424,8 @@ "question__title": "Lexicographically Smallest Beautiful String", "question__title_slug": "lexicographically-smallest-beautiful-string", "question__hide": false, - "total_acs": 2016, - "total_submitted": 4486, + "total_acs": 2035, + "total_submitted": 4524, "total_column_articles": 33, "frontend_question_id": "2663", "is_new_question": false @@ -19983,8 +20445,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": 4287, - "total_submitted": 11056, + "total_acs": 4384, + "total_submitted": 11233, "total_column_articles": 64, "frontend_question_id": "2662", "is_new_question": false @@ -20004,9 +20466,9 @@ "question__title": "First Completely Painted Row or Column", "question__title_slug": "first-completely-painted-row-or-column", "question__hide": false, - "total_acs": 25018, - "total_submitted": 42005, - "total_column_articles": 254, + "total_acs": 25060, + "total_submitted": 42064, + "total_column_articles": 255, "frontend_question_id": "2661", "is_new_question": false }, @@ -20025,9 +20487,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": 28148, - "total_submitted": 61032, - "total_column_articles": 199, + "total_acs": 28514, + "total_submitted": 62048, + "total_column_articles": 200, "frontend_question_id": "2660", "is_new_question": false }, @@ -20046,9 +20508,9 @@ "question__title": "Count the Number of Good Subsequences", "question__title_slug": "count-the-number-of-good-subsequences", "question__hide": false, - "total_acs": 237, - "total_submitted": 406, - "total_column_articles": 5, + "total_acs": 239, + "total_submitted": 411, + "total_column_articles": 6, "frontend_question_id": "2539", "is_new_question": false }, @@ -20067,8 +20529,8 @@ "question__title": "Count Increasing Quadruplets", "question__title_slug": "count-increasing-quadruplets", "question__hide": false, - "total_acs": 4698, - "total_submitted": 11684, + "total_acs": 4739, + "total_submitted": 11789, "total_column_articles": 49, "frontend_question_id": "2552", "is_new_question": false @@ -20088,8 +20550,8 @@ "question__title": "Put Marbles in Bags", "question__title_slug": "put-marbles-in-bags", "question__hide": false, - "total_acs": 4468, - "total_submitted": 8178, + "total_acs": 4501, + "total_submitted": 8223, "total_column_articles": 43, "frontend_question_id": "2551", "is_new_question": false @@ -20109,8 +20571,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": 6281, - "total_submitted": 21300, + "total_acs": 6314, + "total_submitted": 21374, "total_column_articles": 48, "frontend_question_id": "2550", "is_new_question": false @@ -20130,8 +20592,8 @@ "question__title": "Count Distinct Numbers on Board", "question__title_slug": "count-distinct-numbers-on-board", "question__hide": false, - "total_acs": 26267, - "total_submitted": 38404, + "total_acs": 26465, + "total_submitted": 38687, "total_column_articles": 152, "frontend_question_id": "2549", "is_new_question": false @@ -20151,9 +20613,9 @@ "question__title": "Design Graph With Shortest Path Calculator", "question__title_slug": "design-graph-with-shortest-path-calculator", "question__hide": false, - "total_acs": 18917, - "total_submitted": 28655, - "total_column_articles": 112, + "total_acs": 19134, + "total_submitted": 28976, + "total_column_articles": 113, "frontend_question_id": "2642", "is_new_question": false }, @@ -20172,9 +20634,9 @@ "question__title": "Cousins in Binary Tree II", "question__title_slug": "cousins-in-binary-tree-ii", "question__hide": false, - "total_acs": 18437, - "total_submitted": 24396, - "total_column_articles": 146, + "total_acs": 18567, + "total_submitted": 24566, + "total_column_articles": 147, "frontend_question_id": "2641", "is_new_question": false }, @@ -20193,9 +20655,9 @@ "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": 5767, - "total_submitted": 7507, - "total_column_articles": 46, + "total_acs": 5852, + "total_submitted": 7617, + "total_column_articles": 48, "frontend_question_id": "2640", "is_new_question": false }, @@ -20214,8 +20676,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": 21521, - "total_submitted": 27358, + "total_acs": 21661, + "total_submitted": 27534, "total_column_articles": 125, "frontend_question_id": "2639", "is_new_question": false @@ -20235,8 +20697,8 @@ "question__title": "Make the Prefix Sum Non-negative", "question__title_slug": "make-the-prefix-sum-non-negative", "question__hide": false, - "total_acs": 265, - "total_submitted": 623, + "total_acs": 274, + "total_submitted": 640, "total_column_articles": 6, "frontend_question_id": "2599", "is_new_question": false @@ -20256,8 +20718,8 @@ "question__title": "Maximize Win From Two Segments", "question__title_slug": "maximize-win-from-two-segments", "question__hide": false, - "total_acs": 3766, - "total_submitted": 9133, + "total_acs": 3804, + "total_submitted": 9217, "total_column_articles": 41, "frontend_question_id": "2555", "is_new_question": false @@ -20277,8 +20739,8 @@ "question__title": "Number of Good Binary Strings", "question__title_slug": "number-of-good-binary-strings", "question__hide": false, - "total_acs": 456, - "total_submitted": 712, + "total_acs": 485, + "total_submitted": 750, "total_column_articles": 10, "frontend_question_id": "2533", "is_new_question": false @@ -20298,9 +20760,9 @@ "question__title": "Shortest Cycle in a Graph", "question__title_slug": "shortest-cycle-in-a-graph", "question__hide": false, - "total_acs": 4233, - "total_submitted": 10152, - "total_column_articles": 35, + "total_acs": 4344, + "total_submitted": 10326, + "total_column_articles": 36, "frontend_question_id": "2608", "is_new_question": false }, @@ -20319,8 +20781,8 @@ "question__title": "Make K-Subarray Sums Equal", "question__title_slug": "make-k-subarray-sums-equal", "question__hide": false, - "total_acs": 3517, - "total_submitted": 8736, + "total_acs": 3563, + "total_submitted": 8812, "total_column_articles": 29, "frontend_question_id": "2607", "is_new_question": false @@ -20340,9 +20802,9 @@ "question__title": "Find the Substring With Maximum Cost", "question__title_slug": "find-the-substring-with-maximum-cost", "question__hide": false, - "total_acs": 7690, - "total_submitted": 13195, - "total_column_articles": 62, + "total_acs": 8132, + "total_submitted": 13839, + "total_column_articles": 68, "frontend_question_id": "2606", "is_new_question": false }, @@ -20361,9 +20823,9 @@ "question__title": "Form Smallest Number From Two Digit Arrays", "question__title_slug": "form-smallest-number-from-two-digit-arrays", "question__hide": false, - "total_acs": 35932, - "total_submitted": 53783, - "total_column_articles": 307, + "total_acs": 36030, + "total_submitted": 53922, + "total_column_articles": 309, "frontend_question_id": "2605", "is_new_question": false }, @@ -20382,8 +20844,8 @@ "question__title": "Maximum Frequency Score of a Subarray", "question__title_slug": "maximum-frequency-score-of-a-subarray", "question__hide": false, - "total_acs": 215, - "total_submitted": 498, + "total_acs": 216, + "total_submitted": 560, "total_column_articles": 6, "frontend_question_id": "2524", "is_new_question": false @@ -20403,9 +20865,9 @@ "question__title": "Minimum Time to Eat All Grains", "question__title_slug": "minimum-time-to-eat-all-grains", "question__hide": false, - "total_acs": 232, - "total_submitted": 693, - "total_column_articles": 9, + "total_acs": 243, + "total_submitted": 713, + "total_column_articles": 10, "frontend_question_id": "2604", "is_new_question": false }, @@ -20424,9 +20886,9 @@ "question__title": "Minimum Time to Repair Cars", "question__title_slug": "minimum-time-to-repair-cars", "question__hide": false, - "total_acs": 28592, - "total_submitted": 57261, - "total_column_articles": 166, + "total_acs": 28779, + "total_submitted": 57631, + "total_column_articles": 168, "frontend_question_id": "2594", "is_new_question": false }, @@ -20445,9 +20907,9 @@ "question__title": "Maximize Greatness of an Array", "question__title_slug": "maximize-greatness-of-an-array", "question__hide": false, - "total_acs": 6135, - "total_submitted": 10563, - "total_column_articles": 63, + "total_acs": 6193, + "total_submitted": 10649, + "total_column_articles": 64, "frontend_question_id": "2592", "is_new_question": false }, @@ -20466,9 +20928,9 @@ "question__title": "Distribute Money to Maximum Children", "question__title_slug": "distribute-money-to-maximum-children", "question__hide": false, - "total_acs": 30896, - "total_submitted": 115325, - "total_column_articles": 237, + "total_acs": 31125, + "total_submitted": 116279, + "total_column_articles": 238, "frontend_question_id": "2591", "is_new_question": false }, @@ -20487,9 +20949,9 @@ "question__title": "Check Knight Tour Configuration", "question__title_slug": "check-knight-tour-configuration", "question__hide": false, - "total_acs": 29469, - "total_submitted": 50943, - "total_column_articles": 318, + "total_acs": 29508, + "total_submitted": 51003, + "total_column_articles": 319, "frontend_question_id": "2596", "is_new_question": false }, @@ -20508,9 +20970,9 @@ "question__title": "Smallest Missing Non-negative Integer After Operations", "question__title_slug": "smallest-missing-non-negative-integer-after-operations", "question__hide": false, - "total_acs": 5963, - "total_submitted": 15116, - "total_column_articles": 60, + "total_acs": 6010, + "total_submitted": 15216, + "total_column_articles": 62, "frontend_question_id": "2598", "is_new_question": false }, @@ -20529,9 +20991,9 @@ "question__title": "Number of Even and Odd Bits", "question__title_slug": "number-of-even-and-odd-bits", "question__hide": false, - "total_acs": 12586, - "total_submitted": 16889, - "total_column_articles": 79, + "total_acs": 12879, + "total_submitted": 17220, + "total_column_articles": 80, "frontend_question_id": "2595", "is_new_question": false }, @@ -20550,8 +21012,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": 342, - "total_submitted": 596, + "total_acs": 346, + "total_submitted": 601, "total_column_articles": 14, "frontend_question_id": "2519", "is_new_question": false @@ -20571,9 +21033,9 @@ "question__title": "Minimum Time to Complete All Tasks", "question__title_slug": "minimum-time-to-complete-all-tasks", "question__hide": false, - "total_acs": 15452, - "total_submitted": 26486, - "total_column_articles": 82, + "total_acs": 16578, + "total_submitted": 28326, + "total_column_articles": 87, "frontend_question_id": "2589", "is_new_question": false }, @@ -20592,9 +21054,9 @@ "question__title": "Count the Number of Beautiful Subarrays", "question__title_slug": "count-the-number-of-beautiful-subarrays", "question__hide": false, - "total_acs": 7120, - "total_submitted": 16331, - "total_column_articles": 63, + "total_acs": 7291, + "total_submitted": 16564, + "total_column_articles": 66, "frontend_question_id": "2588", "is_new_question": false }, @@ -20613,8 +21075,8 @@ "question__title": "Rearrange Array to Maximize Prefix Score", "question__title_slug": "rearrange-array-to-maximize-prefix-score", "question__hide": false, - "total_acs": 9360, - "total_submitted": 22608, + "total_acs": 9404, + "total_submitted": 22700, "total_column_articles": 48, "frontend_question_id": "2587", "is_new_question": false @@ -20634,9 +21096,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": 42948, - "total_submitted": 53002, - "total_column_articles": 256, + "total_acs": 43469, + "total_submitted": 53662, + "total_column_articles": 260, "frontend_question_id": "2586", "is_new_question": false }, @@ -20655,9 +21117,9 @@ "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": 402, - "total_submitted": 621, - "total_column_articles": 9, + "total_acs": 443, + "total_submitted": 675, + "total_column_articles": 10, "frontend_question_id": "2510", "is_new_question": false }, @@ -20676,9 +21138,9 @@ "question__title": "Count Number of Possible Root Nodes", "question__title_slug": "count-number-of-possible-root-nodes", "question__hide": false, - "total_acs": 12741, - "total_submitted": 19809, - "total_column_articles": 85, + "total_acs": 12791, + "total_submitted": 19873, + "total_column_articles": 84, "frontend_question_id": "2581", "is_new_question": false }, @@ -20697,8 +21159,8 @@ "question__title": "Count Ways to Group Overlapping Ranges", "question__title_slug": "count-ways-to-group-overlapping-ranges", "question__hide": false, - "total_acs": 22674, - "total_submitted": 48663, + "total_acs": 22734, + "total_submitted": 48838, "total_column_articles": 168, "frontend_question_id": "2580", "is_new_question": false @@ -20718,8 +21180,8 @@ "question__title": "Split With Minimum Sum", "question__title_slug": "split-with-minimum-sum", "question__hide": false, - "total_acs": 32093, - "total_submitted": 39576, + "total_acs": 32208, + "total_submitted": 39735, "total_column_articles": 298, "frontend_question_id": "2578", "is_new_question": false @@ -20739,8 +21201,8 @@ "question__title": "Count Total Number of Colored Cells", "question__title_slug": "count-total-number-of-colored-cells", "question__hide": false, - "total_acs": 6645, - "total_submitted": 10225, + "total_acs": 6686, + "total_submitted": 10295, "total_column_articles": 46, "frontend_question_id": "2579", "is_new_question": false @@ -20760,8 +21222,8 @@ "question__title": "Number of Ways to Earn Points", "question__title_slug": "number-of-ways-to-earn-points", "question__hide": false, - "total_acs": 6825, - "total_submitted": 10336, + "total_acs": 7016, + "total_submitted": 10604, "total_column_articles": 64, "frontend_question_id": "2585", "is_new_question": false @@ -20781,9 +21243,9 @@ "question__title": "Split the Array to Make Coprime Products", "question__title_slug": "split-the-array-to-make-coprime-products", "question__hide": false, - "total_acs": 6214, - "total_submitted": 23783, - "total_column_articles": 76, + "total_acs": 6295, + "total_submitted": 23958, + "total_column_articles": 78, "frontend_question_id": "2584", "is_new_question": false }, @@ -20802,9 +21264,9 @@ "question__title": "Kth Largest Sum in a Binary Tree", "question__title_slug": "kth-largest-sum-in-a-binary-tree", "question__hide": false, - "total_acs": 26951, - "total_submitted": 50788, - "total_column_articles": 211, + "total_acs": 27104, + "total_submitted": 51057, + "total_column_articles": 213, "frontend_question_id": "2583", "is_new_question": false }, @@ -20823,9 +21285,9 @@ "question__title": "Pass the Pillow", "question__title_slug": "pass-the-pillow", "question__hide": false, - "total_acs": 37381, - "total_submitted": 64162, - "total_column_articles": 312, + "total_acs": 37507, + "total_submitted": 64412, + "total_column_articles": 316, "frontend_question_id": "2582", "is_new_question": false }, @@ -20844,8 +21306,8 @@ "question__title": "Bitwise OR of All Subsequence Sums", "question__title_slug": "bitwise-or-of-all-subsequence-sums", "question__hide": false, - "total_acs": 266, - "total_submitted": 543, + "total_acs": 270, + "total_submitted": 553, "total_column_articles": 7, "frontend_question_id": "2505", "is_new_question": false @@ -20865,8 +21327,8 @@ "question__title": "Concatenate the Name and the Profession", "question__title_slug": "concatenate-the-name-and-the-profession", "question__hide": false, - "total_acs": 1277, - "total_submitted": 1615, + "total_acs": 1305, + "total_submitted": 1646, "total_column_articles": 11, "frontend_question_id": "2504", "is_new_question": false @@ -20886,8 +21348,8 @@ "question__title": "Time to Cross a Bridge", "question__title_slug": "time-to-cross-a-bridge", "question__hide": false, - "total_acs": 10494, - "total_submitted": 15415, + "total_acs": 10514, + "total_submitted": 15466, "total_column_articles": 100, "frontend_question_id": "2532", "is_new_question": false @@ -20907,9 +21369,9 @@ "question__title": "Disconnect Path in a Binary Matrix by at Most One Flip", "question__title_slug": "disconnect-path-in-a-binary-matrix-by-at-most-one-flip", "question__hide": false, - "total_acs": 3436, - "total_submitted": 11214, - "total_column_articles": 49, + "total_acs": 3457, + "total_submitted": 11273, + "total_column_articles": 50, "frontend_question_id": "2556", "is_new_question": false }, @@ -20928,9 +21390,9 @@ "question__title": "Maximum Number of Integers to Choose From a Range I", "question__title_slug": "maximum-number-of-integers-to-choose-from-a-range-i", "question__hide": false, - "total_acs": 5379, - "total_submitted": 9474, - "total_column_articles": 57, + "total_acs": 5430, + "total_submitted": 9540, + "total_column_articles": 58, "frontend_question_id": "2554", "is_new_question": false }, @@ -20949,9 +21411,9 @@ "question__title": "Separate the Digits in an Array", "question__title_slug": "separate-the-digits-in-an-array", "question__hide": false, - "total_acs": 8351, - "total_submitted": 10564, - "total_column_articles": 94, + "total_acs": 8460, + "total_submitted": 10700, + "total_column_articles": 96, "frontend_question_id": "2553", "is_new_question": false }, @@ -20970,8 +21432,8 @@ "question__title": "Number of Subarrays Having Even Product", "question__title_slug": "number-of-subarrays-having-even-product", "question__hide": false, - "total_acs": 365, - "total_submitted": 620, + "total_acs": 372, + "total_submitted": 633, "total_column_articles": 14, "frontend_question_id": "2495", "is_new_question": false @@ -20991,9 +21453,9 @@ "question__title": "Merge Overlapping Events in the Same Hall", "question__title_slug": "merge-overlapping-events-in-the-same-hall", "question__hide": false, - "total_acs": 711, - "total_submitted": 1641, - "total_column_articles": 17, + "total_acs": 730, + "total_submitted": 1688, + "total_column_articles": 18, "frontend_question_id": "2494", "is_new_question": false }, @@ -21012,8 +21474,8 @@ "question__title": "Maximum Subsequence Score", "question__title_slug": "maximum-subsequence-score", "question__hide": false, - "total_acs": 8117, - "total_submitted": 15779, + "total_acs": 8320, + "total_submitted": 16195, "total_column_articles": 79, "frontend_question_id": "2542", "is_new_question": false @@ -21033,8 +21495,8 @@ "question__title": "Check if Point Is Reachable", "question__title_slug": "check-if-point-is-reachable", "question__hide": false, - "total_acs": 2245, - "total_submitted": 4703, + "total_acs": 2276, + "total_submitted": 4742, "total_column_articles": 23, "frontend_question_id": "2543", "is_new_question": false @@ -21054,8 +21516,8 @@ "question__title": "Minimum Common Value", "question__title_slug": "minimum-common-value", "question__hide": false, - "total_acs": 9159, - "total_submitted": 15564, + "total_acs": 9281, + "total_submitted": 15774, "total_column_articles": 108, "frontend_question_id": "2540", "is_new_question": false @@ -21075,8 +21537,8 @@ "question__title": "Minimum Cost to Split an Array", "question__title_slug": "minimum-cost-to-split-an-array", "question__hide": false, - "total_acs": 4228, - "total_submitted": 7276, + "total_acs": 4303, + "total_submitted": 7383, "total_column_articles": 47, "frontend_question_id": "2547", "is_new_question": false @@ -21096,8 +21558,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": 5191, - "total_submitted": 11753, + "total_acs": 5245, + "total_submitted": 11859, "total_column_articles": 55, "frontend_question_id": "2546", "is_new_question": false @@ -21117,8 +21579,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": 8306, - "total_submitted": 9787, + "total_acs": 8381, + "total_submitted": 9873, "total_column_articles": 95, "frontend_question_id": "2545", "is_new_question": false @@ -21138,9 +21600,9 @@ "question__title": "Alternating Digit Sum", "question__title_slug": "alternating-digit-sum", "question__hide": false, - "total_acs": 34344, - "total_submitted": 43351, - "total_column_articles": 309, + "total_acs": 34439, + "total_submitted": 43471, + "total_column_articles": 310, "frontend_question_id": "2544", "is_new_question": false }, @@ -21159,8 +21621,8 @@ "question__title": "Number of Substrings With Fixed Ratio", "question__title_slug": "number-of-substrings-with-fixed-ratio", "question__hide": false, - "total_acs": 209, - "total_submitted": 345, + "total_acs": 216, + "total_submitted": 377, "total_column_articles": 6, "frontend_question_id": "2489", "is_new_question": false @@ -21180,8 +21642,8 @@ "question__title": "Minimize the Maximum of Two Arrays", "question__title_slug": "minimize-the-maximum-of-two-arrays", "question__hide": false, - "total_acs": 3596, - "total_submitted": 10004, + "total_acs": 3656, + "total_submitted": 10131, "total_column_articles": 49, "frontend_question_id": "2513", "is_new_question": false @@ -21201,8 +21663,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": 4038, - "total_submitted": 8427, + "total_acs": 4067, + "total_submitted": 8482, "total_column_articles": 48, "frontend_question_id": "2538", "is_new_question": false @@ -21222,9 +21684,9 @@ "question__title": "Count the Number of Good Subarrays", "question__title_slug": "count-the-number-of-good-subarrays", "question__hide": false, - "total_acs": 6813, - "total_submitted": 13363, - "total_column_articles": 99, + "total_acs": 6954, + "total_submitted": 13572, + "total_column_articles": 103, "frontend_question_id": "2537", "is_new_question": false }, @@ -21243,8 +21705,8 @@ "question__title": "Increment Submatrices by One", "question__title_slug": "increment-submatrices-by-one", "question__hide": false, - "total_acs": 7974, - "total_submitted": 12892, + "total_acs": 8065, + "total_submitted": 13007, "total_column_articles": 88, "frontend_question_id": "2536", "is_new_question": false @@ -21264,9 +21726,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": 14805, - "total_submitted": 17970, - "total_column_articles": 148, + "total_acs": 14977, + "total_submitted": 18173, + "total_column_articles": 152, "frontend_question_id": "2535", "is_new_question": false }, @@ -21285,8 +21747,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": 279, - "total_submitted": 489, + "total_acs": 280, + "total_submitted": 490, "total_column_articles": 11, "frontend_question_id": "2479", "is_new_question": false @@ -21306,8 +21768,8 @@ "question__title": "Form a Chemical Bond", "question__title_slug": "form-a-chemical-bond", "question__hide": false, - "total_acs": 1393, - "total_submitted": 1689, + "total_acs": 1413, + "total_submitted": 1711, "total_column_articles": 12, "frontend_question_id": "2480", "is_new_question": false @@ -21327,9 +21789,9 @@ "question__title": "Find Xor-Beauty of Array", "question__title_slug": "find-xor-beauty-of-array", "question__hide": false, - "total_acs": 4388, - "total_submitted": 6177, - "total_column_articles": 44, + "total_acs": 4445, + "total_submitted": 6240, + "total_column_articles": 45, "frontend_question_id": "2527", "is_new_question": false }, @@ -21348,8 +21810,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": 5447, - "total_submitted": 10025, + "total_acs": 5492, + "total_submitted": 10099, "total_column_articles": 58, "frontend_question_id": "2526", "is_new_question": false @@ -21369,8 +21831,8 @@ "question__title": "Categorize Box According to Criteria", "question__title_slug": "categorize-box-according-to-criteria", "question__hide": false, - "total_acs": 28574, - "total_submitted": 59811, + "total_acs": 28619, + "total_submitted": 59900, "total_column_articles": 175, "frontend_question_id": "2525", "is_new_question": false @@ -21390,9 +21852,9 @@ "question__title": "Maximize the Minimum Powered City", "question__title_slug": "maximize-the-minimum-powered-city", "question__hide": false, - "total_acs": 4811, - "total_submitted": 11673, - "total_column_articles": 48, + "total_acs": 4895, + "total_submitted": 11868, + "total_column_articles": 49, "frontend_question_id": "2528", "is_new_question": false }, @@ -21411,8 +21873,8 @@ "question__title": "Time Taken to Cross the Door", "question__title_slug": "time-taken-to-cross-the-door", "question__hide": false, - "total_acs": 387, - "total_submitted": 733, + "total_acs": 402, + "total_submitted": 748, "total_column_articles": 11, "frontend_question_id": "2534", "is_new_question": false @@ -21432,9 +21894,9 @@ "question__title": "Maximal Score After Applying K Operations", "question__title_slug": "maximal-score-after-applying-k-operations", "question__hide": false, - "total_acs": 31484, - "total_submitted": 59153, - "total_column_articles": 221, + "total_acs": 31581, + "total_submitted": 59281, + "total_column_articles": 223, "frontend_question_id": "2530", "is_new_question": false }, @@ -21453,9 +21915,9 @@ "question__title": "Make Number of Distinct Characters Equal", "question__title_slug": "make-number-of-distinct-characters-equal", "question__hide": false, - "total_acs": 6246, - "total_submitted": 20867, - "total_column_articles": 92, + "total_acs": 6264, + "total_submitted": 20921, + "total_column_articles": 93, "frontend_question_id": "2531", "is_new_question": false }, @@ -21474,9 +21936,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": 39018, - "total_submitted": 53464, - "total_column_articles": 246, + "total_acs": 39740, + "total_submitted": 54566, + "total_column_articles": 253, "frontend_question_id": "2529", "is_new_question": false }, @@ -21495,8 +21957,8 @@ "question__title": "Customers With Strictly Increasing Purchases", "question__title_slug": "customers-with-strictly-increasing-purchases", "question__hide": false, - "total_acs": 933, - "total_submitted": 1901, + "total_acs": 990, + "total_submitted": 2003, "total_column_articles": 30, "frontend_question_id": "2474", "is_new_question": false @@ -21516,8 +21978,8 @@ "question__title": "Minimum Cost to Buy Apples", "question__title_slug": "minimum-cost-to-buy-apples", "question__hide": false, - "total_acs": 301, - "total_submitted": 556, + "total_acs": 308, + "total_submitted": 568, "total_column_articles": 10, "frontend_question_id": "2473", "is_new_question": false @@ -21537,9 +21999,9 @@ "question__title": "Closest Prime Numbers in Range", "question__title_slug": "closest-prime-numbers-in-range", "question__hide": false, - "total_acs": 7769, - "total_submitted": 18686, - "total_column_articles": 72, + "total_acs": 7910, + "total_submitted": 18938, + "total_column_articles": 73, "frontend_question_id": "2523", "is_new_question": false }, @@ -21558,9 +22020,9 @@ "question__title": "Distinct Prime Factors of Product of Array", "question__title_slug": "distinct-prime-factors-of-product-of-array", "question__hide": false, - "total_acs": 8245, - "total_submitted": 12925, - "total_column_articles": 76, + "total_acs": 8430, + "total_submitted": 13162, + "total_column_articles": 78, "frontend_question_id": "2521", "is_new_question": false }, @@ -21579,9 +22041,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": 37818, - "total_submitted": 44522, - "total_column_articles": 259, + "total_acs": 38026, + "total_submitted": 44800, + "total_column_articles": 260, "frontend_question_id": "2520", "is_new_question": false }, @@ -21600,8 +22062,8 @@ "question__title": "Minimum Subarrays in a Valid Split", "question__title_slug": "minimum-subarrays-in-a-valid-split", "question__hide": false, - "total_acs": 383, - "total_submitted": 625, + "total_acs": 398, + "total_submitted": 648, "total_column_articles": 9, "frontend_question_id": "2464", "is_new_question": false @@ -21621,8 +22083,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": 6462, - "total_submitted": 7905, + "total_acs": 6513, + "total_submitted": 7965, "total_column_articles": 71, "frontend_question_id": "2482", "is_new_question": false @@ -21642,8 +22104,8 @@ "question__title": "Count Anagrams", "question__title_slug": "count-anagrams", "question__hide": false, - "total_acs": 2853, - "total_submitted": 6106, + "total_acs": 2886, + "total_submitted": 6156, "total_column_articles": 42, "frontend_question_id": "2514", "is_new_question": false @@ -21663,8 +22125,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": 4140, - "total_submitted": 12925, + "total_acs": 4184, + "total_submitted": 13041, "total_column_articles": 43, "frontend_question_id": "2541", "is_new_question": false @@ -21684,9 +22146,9 @@ "question__title": "Reward Top K Students", "question__title_slug": "reward-top-k-students", "question__hide": false, - "total_acs": 24653, - "total_submitted": 46109, - "total_column_articles": 223, + "total_acs": 24694, + "total_submitted": 46218, + "total_column_articles": 224, "frontend_question_id": "2512", "is_new_question": false }, @@ -21705,9 +22167,9 @@ "question__title": "Maximum Enemy Forts That Can Be Captured", "question__title_slug": "maximum-enemy-forts-that-can-be-captured", "question__hide": false, - "total_acs": 26818, - "total_submitted": 48364, - "total_column_articles": 261, + "total_acs": 26888, + "total_submitted": 48493, + "total_column_articles": 263, "frontend_question_id": "2511", "is_new_question": false }, @@ -21726,9 +22188,9 @@ "question__title": "Number of Great Partitions", "question__title_slug": "number-of-great-partitions", "question__hide": false, - "total_acs": 3382, - "total_submitted": 7905, - "total_column_articles": 35, + "total_acs": 3458, + "total_submitted": 8069, + "total_column_articles": 36, "frontend_question_id": "2518", "is_new_question": false }, @@ -21747,9 +22209,9 @@ "question__title": "Maximum Tastiness of Candy Basket", "question__title_slug": "maximum-tastiness-of-candy-basket", "question__hide": false, - "total_acs": 22394, - "total_submitted": 31338, - "total_column_articles": 140, + "total_acs": 22603, + "total_submitted": 31603, + "total_column_articles": 141, "frontend_question_id": "2517", "is_new_question": false }, @@ -21768,9 +22230,9 @@ "question__title": "Take K of Each Character From Left and Right", "question__title_slug": "take-k-of-each-character-from-left-and-right", "question__hide": false, - "total_acs": 6991, - "total_submitted": 17806, - "total_column_articles": 88, + "total_acs": 7173, + "total_submitted": 18129, + "total_column_articles": 92, "frontend_question_id": "2516", "is_new_question": false }, @@ -21789,9 +22251,9 @@ "question__title": "Shortest Distance to Target String in a Circular Array", "question__title_slug": "shortest-distance-to-target-string-in-a-circular-array", "question__hide": false, - "total_acs": 8094, - "total_submitted": 14455, - "total_column_articles": 86, + "total_acs": 8159, + "total_submitted": 14562, + "total_column_articles": 87, "frontend_question_id": "2515", "is_new_question": false }, @@ -21810,9 +22272,9 @@ "question__title": "Cycle Length Queries in a Tree", "question__title_slug": "cycle-length-queries-in-a-tree", "question__hide": false, - "total_acs": 4760, - "total_submitted": 7332, - "total_column_articles": 64, + "total_acs": 4790, + "total_submitted": 7373, + "total_column_articles": 66, "frontend_question_id": "2509", "is_new_question": false }, @@ -21831,9 +22293,9 @@ "question__title": "Add Edges to Make Degrees of All Nodes Even", "question__title_slug": "add-edges-to-make-degrees-of-all-nodes-even", "question__hide": false, - "total_acs": 3826, - "total_submitted": 12751, - "total_column_articles": 56, + "total_acs": 3857, + "total_submitted": 12811, + "total_column_articles": 57, "frontend_question_id": "2508", "is_new_question": false }, @@ -21852,9 +22314,9 @@ "question__title": "Smallest Value After Replacing With Sum of Prime Factors", "question__title_slug": "smallest-value-after-replacing-with-sum-of-prime-factors", "question__hide": false, - "total_acs": 6882, - "total_submitted": 13527, - "total_column_articles": 64, + "total_acs": 7007, + "total_submitted": 13758, + "total_column_articles": 67, "frontend_question_id": "2507", "is_new_question": false }, @@ -21873,9 +22335,9 @@ "question__title": "Count Pairs Of Similar Strings", "question__title_slug": "count-pairs-of-similar-strings", "question__hide": false, - "total_acs": 9693, - "total_submitted": 12556, - "total_column_articles": 103, + "total_acs": 9791, + "total_submitted": 12664, + "total_column_articles": 105, "frontend_question_id": "2506", "is_new_question": false }, @@ -21894,8 +22356,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": 225, - "total_submitted": 355, + "total_acs": 229, + "total_submitted": 359, "total_column_articles": 9, "frontend_question_id": "2450", "is_new_question": false @@ -21915,8 +22377,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": 1911, - "total_submitted": 4569, + "total_acs": 1918, + "total_submitted": 4582, "total_column_articles": 30, "frontend_question_id": "2499", "is_new_question": false @@ -21936,8 +22398,8 @@ "question__title": "Frog Jump II", "question__title_slug": "frog-jump-ii", "question__hide": false, - "total_acs": 4694, - "total_submitted": 7326, + "total_acs": 4745, + "total_submitted": 7405, "total_column_articles": 57, "frontend_question_id": "2498", "is_new_question": false @@ -21957,9 +22419,9 @@ "question__title": "Maximum Star Sum of a Graph", "question__title_slug": "maximum-star-sum-of-a-graph", "question__hide": false, - "total_acs": 4561, - "total_submitted": 11750, - "total_column_articles": 56, + "total_acs": 4582, + "total_submitted": 11800, + "total_column_articles": 57, "frontend_question_id": "2497", "is_new_question": false }, @@ -21978,8 +22440,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": 22047, - "total_submitted": 28118, + "total_acs": 22164, + "total_submitted": 28264, "total_column_articles": 230, "frontend_question_id": "2496", "is_new_question": false @@ -21999,9 +22461,9 @@ "question__title": "Maximum Number of Points From Grid Queries", "question__title_slug": "maximum-number-of-points-from-grid-queries", "question__hide": false, - "total_acs": 4700, - "total_submitted": 10550, - "total_column_articles": 69, + "total_acs": 4734, + "total_submitted": 10607, + "total_column_articles": 70, "frontend_question_id": "2503", "is_new_question": false }, @@ -22020,8 +22482,8 @@ "question__title": "Design Memory Allocator", "question__title_slug": "design-memory-allocator", "question__hide": false, - "total_acs": 6137, - "total_submitted": 11638, + "total_acs": 6168, + "total_submitted": 11706, "total_column_articles": 81, "frontend_question_id": "2502", "is_new_question": false @@ -22041,8 +22503,8 @@ "question__title": "Longest Square Streak in an Array", "question__title_slug": "longest-square-streak-in-an-array", "question__hide": false, - "total_acs": 8754, - "total_submitted": 21025, + "total_acs": 8852, + "total_submitted": 21212, "total_column_articles": 96, "frontend_question_id": "2501", "is_new_question": false @@ -22062,9 +22524,9 @@ "question__title": "Delete Greatest Value in Each Row", "question__title_slug": "delete-greatest-value-in-each-row", "question__hide": false, - "total_acs": 33899, - "total_submitted": 40673, - "total_column_articles": 270, + "total_acs": 34047, + "total_submitted": 40838, + "total_column_articles": 271, "frontend_question_id": "2500", "is_new_question": false }, @@ -22083,9 +22545,9 @@ "question__title": "Number of Nodes With Value One", "question__title_slug": "number-of-nodes-with-value-one", "question__hide": false, - "total_acs": 329, - "total_submitted": 550, - "total_column_articles": 19, + "total_acs": 336, + "total_submitted": 558, + "total_column_articles": 20, "frontend_question_id": "2445", "is_new_question": false }, @@ -22104,8 +22566,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": 3297, - "total_submitted": 7430, + "total_acs": 3311, + "total_submitted": 7455, "total_column_articles": 45, "frontend_question_id": "2493", "is_new_question": false @@ -22125,8 +22587,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": 8547, - "total_submitted": 20058, + "total_acs": 8684, + "total_submitted": 20332, "total_column_articles": 126, "frontend_question_id": "2492", "is_new_question": false @@ -22146,8 +22608,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": 9626, - "total_submitted": 17390, + "total_acs": 9665, + "total_submitted": 17455, "total_column_articles": 120, "frontend_question_id": "2491", "is_new_question": false @@ -22167,9 +22629,9 @@ "question__title": "Circular Sentence", "question__title_slug": "circular-sentence", "question__hide": false, - "total_acs": 28518, - "total_submitted": 39120, - "total_column_articles": 258, + "total_acs": 28600, + "total_submitted": 39228, + "total_column_articles": 259, "frontend_question_id": "2490", "is_new_question": false }, @@ -22188,8 +22650,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": 310, - "total_submitted": 440, + "total_acs": 317, + "total_submitted": 450, "total_column_articles": 13, "frontend_question_id": "2436", "is_new_question": false @@ -22209,8 +22671,8 @@ "question__title": "Count Palindromic Subsequences", "question__title_slug": "count-palindromic-subsequences", "question__hide": false, - "total_acs": 3278, - "total_submitted": 6807, + "total_acs": 3307, + "total_submitted": 6852, "total_column_articles": 53, "frontend_question_id": "2484", "is_new_question": false @@ -22230,9 +22692,9 @@ "question__title": "Minimum Penalty for a Shop", "question__title_slug": "minimum-penalty-for-a-shop", "question__hide": false, - "total_acs": 7391, - "total_submitted": 11444, - "total_column_articles": 98, + "total_acs": 7448, + "total_submitted": 11565, + "total_column_articles": 99, "frontend_question_id": "2483", "is_new_question": false }, @@ -22251,8 +22713,8 @@ "question__title": "Minimum Cuts to Divide a Circle", "question__title_slug": "minimum-cuts-to-divide-a-circle", "question__hide": false, - "total_acs": 20417, - "total_submitted": 34934, + "total_acs": 20483, + "total_submitted": 35044, "total_column_articles": 143, "frontend_question_id": "2481", "is_new_question": false @@ -22272,9 +22734,9 @@ "question__title": "Count Subarrays With Median K", "question__title_slug": "count-subarrays-with-median-k", "question__hide": false, - "total_acs": 21014, - "total_submitted": 41468, - "total_column_articles": 209, + "total_acs": 21096, + "total_submitted": 41593, + "total_column_articles": 212, "frontend_question_id": "2488", "is_new_question": false }, @@ -22293,9 +22755,9 @@ "question__title": "Remove Nodes From Linked List", "question__title_slug": "remove-nodes-from-linked-list", "question__hide": false, - "total_acs": 33106, - "total_submitted": 43534, - "total_column_articles": 331, + "total_acs": 33509, + "total_submitted": 44171, + "total_column_articles": 335, "frontend_question_id": "2487", "is_new_question": false }, @@ -22314,9 +22776,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": 9092, - "total_submitted": 13826, - "total_column_articles": 93, + "total_acs": 9264, + "total_submitted": 14038, + "total_column_articles": 94, "frontend_question_id": "2486", "is_new_question": false }, @@ -22335,9 +22797,9 @@ "question__title": "Find the Pivot Integer", "question__title_slug": "find-the-pivot-integer", "question__hide": false, - "total_acs": 34426, - "total_submitted": 43060, - "total_column_articles": 329, + "total_acs": 34565, + "total_submitted": 43226, + "total_column_articles": 330, "frontend_question_id": "2485", "is_new_question": false }, @@ -22356,9 +22818,9 @@ "question__title": "Maximize Total Tastiness of Purchased Fruits", "question__title_slug": "maximize-total-tastiness-of-purchased-fruits", "question__hide": false, - "total_acs": 324, - "total_submitted": 530, - "total_column_articles": 15, + "total_acs": 336, + "total_submitted": 545, + "total_column_articles": 17, "frontend_question_id": "2431", "is_new_question": false }, @@ -22377,9 +22839,9 @@ "question__title": "Number of Beautiful Partitions", "question__title_slug": "number-of-beautiful-partitions", "question__hide": false, - "total_acs": 4900, - "total_submitted": 12154, - "total_column_articles": 56, + "total_acs": 4967, + "total_submitted": 12297, + "total_column_articles": 57, "frontend_question_id": "2478", "is_new_question": false }, @@ -22398,8 +22860,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": 21768, - "total_submitted": 33930, + "total_acs": 21809, + "total_submitted": 34004, "total_column_articles": 192, "frontend_question_id": "2477", "is_new_question": false @@ -22419,9 +22881,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": 22149, - "total_submitted": 43230, - "total_column_articles": 216, + "total_acs": 22346, + "total_submitted": 43582, + "total_column_articles": 220, "frontend_question_id": "2476", "is_new_question": false }, @@ -22440,8 +22902,8 @@ "question__title": "Number of Unequal Triplets in Array", "question__title_slug": "number-of-unequal-triplets-in-array", "question__hide": false, - "total_acs": 30375, - "total_submitted": 39088, + "total_acs": 30464, + "total_submitted": 39199, "total_column_articles": 179, "frontend_question_id": "2475", "is_new_question": false @@ -22461,9 +22923,9 @@ "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": 443, - "total_submitted": 733, - "total_column_articles": 14, + "total_acs": 453, + "total_submitted": 745, + "total_column_articles": 15, "frontend_question_id": "2422", "is_new_question": false }, @@ -22482,8 +22944,8 @@ "question__title": "Most Profitable Path in a Tree", "question__title_slug": "most-profitable-path-in-a-tree", "question__hide": false, - "total_acs": 3557, - "total_submitted": 7057, + "total_acs": 3579, + "total_submitted": 7095, "total_column_articles": 52, "frontend_question_id": "2467", "is_new_question": false @@ -22503,8 +22965,8 @@ "question__title": "Split Message Based on Limit", "question__title_slug": "split-message-based-on-limit", "question__hide": false, - "total_acs": 2436, - "total_submitted": 5481, + "total_acs": 2447, + "total_submitted": 5498, "total_column_articles": 56, "frontend_question_id": "2468", "is_new_question": false @@ -22524,9 +22986,9 @@ "question__title": "Count Ways To Build Good Strings", "question__title_slug": "count-ways-to-build-good-strings", "question__hide": false, - "total_acs": 13184, - "total_submitted": 26718, - "total_column_articles": 120, + "total_acs": 13924, + "total_submitted": 28366, + "total_column_articles": 128, "frontend_question_id": "2466", "is_new_question": false }, @@ -22545,9 +23007,9 @@ "question__title": "Number of Distinct Averages", "question__title_slug": "number-of-distinct-averages", "question__hide": false, - "total_acs": 24625, - "total_submitted": 34455, - "total_column_articles": 233, + "total_acs": 24701, + "total_submitted": 34586, + "total_column_articles": 234, "frontend_question_id": "2465", "is_new_question": false }, @@ -22566,9 +23028,9 @@ "question__title": "Closest Fair Integer", "question__title_slug": "closest-fair-integer", "question__hide": false, - "total_acs": 232, - "total_submitted": 546, - "total_column_articles": 14, + "total_acs": 235, + "total_submitted": 557, + "total_column_articles": 15, "frontend_question_id": "2417", "is_new_question": false }, @@ -22587,9 +23049,9 @@ "question__title": "Maximum Number of Non-overlapping Palindrome Substrings", "question__title_slug": "maximum-number-of-non-overlapping-palindrome-substrings", "question__hide": false, - "total_acs": 5998, - "total_submitted": 13265, - "total_column_articles": 90, + "total_acs": 6094, + "total_submitted": 13395, + "total_column_articles": 91, "frontend_question_id": "2472", "is_new_question": false }, @@ -22608,8 +23070,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": 7527, - "total_submitted": 13511, + "total_acs": 7570, + "total_submitted": 13576, "total_column_articles": 97, "frontend_question_id": "2471", "is_new_question": false @@ -22629,9 +23091,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": 8843, - "total_submitted": 21386, - "total_column_articles": 95, + "total_acs": 8941, + "total_submitted": 21554, + "total_column_articles": 97, "frontend_question_id": "2470", "is_new_question": false }, @@ -22650,9 +23112,9 @@ "question__title": "Convert the Temperature", "question__title_slug": "convert-the-temperature", "question__hide": false, - "total_acs": 67468, - "total_submitted": 84929, - "total_column_articles": 255, + "total_acs": 68972, + "total_submitted": 86933, + "total_column_articles": 256, "frontend_question_id": "2469", "is_new_question": false }, @@ -22671,8 +23133,8 @@ "question__title": "Design SQL", "question__title_slug": "design-sql", "question__hide": false, - "total_acs": 306, - "total_submitted": 526, + "total_acs": 313, + "total_submitted": 538, "total_column_articles": 10, "frontend_question_id": "2408", "is_new_question": false @@ -22692,8 +23154,8 @@ "question__title": "Minimum Total Distance Traveled", "question__title_slug": "minimum-total-distance-traveled", "question__hide": false, - "total_acs": 4326, - "total_submitted": 9395, + "total_acs": 4374, + "total_submitted": 9488, "total_column_articles": 65, "frontend_question_id": "2463", "is_new_question": false @@ -22713,9 +23175,9 @@ "question__title": "Total Cost to Hire K Workers", "question__title_slug": "total-cost-to-hire-k-workers", "question__hide": false, - "total_acs": 24208, - "total_submitted": 54909, - "total_column_articles": 253, + "total_acs": 24736, + "total_submitted": 56120, + "total_column_articles": 254, "frontend_question_id": "2462", "is_new_question": false }, @@ -22734,9 +23196,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": 11161, - "total_submitted": 33687, - "total_column_articles": 173, + "total_acs": 11493, + "total_submitted": 34359, + "total_column_articles": 175, "frontend_question_id": "2461", "is_new_question": false }, @@ -22755,9 +23217,9 @@ "question__title": "Apply Operations to an Array", "question__title_slug": "apply-operations-to-an-array", "question__hide": false, - "total_acs": 32029, - "total_submitted": 47155, - "total_column_articles": 269, + "total_acs": 32125, + "total_submitted": 47284, + "total_column_articles": 270, "frontend_question_id": "2460", "is_new_question": false }, @@ -22776,8 +23238,8 @@ "question__title": "Words Within Two Edits of Dictionary", "question__title_slug": "words-within-two-edits-of-dictionary", "question__hide": false, - "total_acs": 5475, - "total_submitted": 8374, + "total_acs": 5575, + "total_submitted": 8504, "total_column_articles": 50, "frontend_question_id": "2452", "is_new_question": false @@ -22797,8 +23259,8 @@ "question__title": "Next Greater Element IV", "question__title_slug": "next-greater-element-iv", "question__hide": false, - "total_acs": 17729, - "total_submitted": 32276, + "total_acs": 17827, + "total_submitted": 32432, "total_column_articles": 193, "frontend_question_id": "2454", "is_new_question": false @@ -22818,8 +23280,8 @@ "question__title": "Destroy Sequential Targets", "question__title_slug": "destroy-sequential-targets", "question__hide": false, - "total_acs": 5196, - "total_submitted": 14232, + "total_acs": 5247, + "total_submitted": 14334, "total_column_articles": 74, "frontend_question_id": "2453", "is_new_question": false @@ -22839,8 +23301,8 @@ "question__title": "Odd String Difference", "question__title_slug": "odd-string-difference", "question__hide": false, - "total_acs": 22197, - "total_submitted": 33549, + "total_acs": 22246, + "total_submitted": 33632, "total_column_articles": 258, "frontend_question_id": "2451", "is_new_question": false @@ -22860,9 +23322,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": 8908, - "total_submitted": 20621, - "total_column_articles": 73, + "total_acs": 8997, + "total_submitted": 20755, + "total_column_articles": 74, "frontend_question_id": "2447", "is_new_question": false }, @@ -22881,8 +23343,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": 5301, - "total_submitted": 12679, + "total_acs": 5325, + "total_submitted": 12729, "total_column_articles": 94, "frontend_question_id": "2458", "is_new_question": false @@ -22902,9 +23364,9 @@ "question__title": "Minimum Addition to Make Integer Beautiful", "question__title_slug": "minimum-addition-to-make-integer-beautiful", "question__hide": false, - "total_acs": 7526, - "total_submitted": 18868, - "total_column_articles": 130, + "total_acs": 7560, + "total_submitted": 18944, + "total_column_articles": 131, "frontend_question_id": "2457", "is_new_question": false }, @@ -22923,9 +23385,9 @@ "question__title": "Most Popular Video Creator", "question__title_slug": "most-popular-video-creator", "question__hide": false, - "total_acs": 9123, - "total_submitted": 23500, - "total_column_articles": 126, + "total_acs": 9168, + "total_submitted": 23587, + "total_column_articles": 128, "frontend_question_id": "2456", "is_new_question": false }, @@ -22944,9 +23406,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": 34304, - "total_submitted": 53826, - "total_column_articles": 189, + "total_acs": 34412, + "total_submitted": 53965, + "total_column_articles": 190, "frontend_question_id": "2455", "is_new_question": false }, @@ -22965,8 +23427,8 @@ "question__title": "Sum of Number and Its Reverse", "question__title_slug": "sum-of-number-and-its-reverse", "question__hide": false, - "total_acs": 10633, - "total_submitted": 22658, + "total_acs": 10661, + "total_submitted": 22711, "total_column_articles": 89, "frontend_question_id": "2443", "is_new_question": false @@ -22986,8 +23448,8 @@ "question__title": "Color the Triangle Red", "question__title_slug": "color-the-triangle-red", "question__hide": false, - "total_acs": 68, - "total_submitted": 153, + "total_acs": 69, + "total_submitted": 156, "total_column_articles": 2, "frontend_question_id": "2647", "is_new_question": false @@ -23007,8 +23469,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": 4376, - "total_submitted": 6818, + "total_acs": 4404, + "total_submitted": 6854, "total_column_articles": 51, "frontend_question_id": "2449", "is_new_question": false @@ -23028,9 +23490,9 @@ "question__title": "Minimum Cost to Make Array Equal", "question__title_slug": "minimum-cost-to-make-array-equal", "question__hide": false, - "total_acs": 6509, - "total_submitted": 17469, - "total_column_articles": 89, + "total_acs": 6544, + "total_submitted": 17545, + "total_column_articles": 91, "frontend_question_id": "2448", "is_new_question": false }, @@ -23049,8 +23511,8 @@ "question__title": "Minimum Time to Kill All Monsters", "question__title_slug": "minimum-time-to-kill-all-monsters", "question__hide": false, - "total_acs": 462, - "total_submitted": 700, + "total_acs": 466, + "total_submitted": 706, "total_column_articles": 22, "frontend_question_id": "2403", "is_new_question": false @@ -23070,8 +23532,8 @@ "question__title": "Determine if Two Events Have Conflict", "question__title_slug": "determine-if-two-events-have-conflict", "question__hide": false, - "total_acs": 31844, - "total_submitted": 50156, + "total_acs": 31896, + "total_submitted": 50238, "total_column_articles": 228, "frontend_question_id": "2446", "is_new_question": false @@ -23091,8 +23553,8 @@ "question__title": "Count Strictly Increasing Subarrays", "question__title_slug": "count-strictly-increasing-subarrays", "question__hide": false, - "total_acs": 592, - "total_submitted": 781, + "total_acs": 595, + "total_submitted": 888, "total_column_articles": 17, "frontend_question_id": "2393", "is_new_question": false @@ -23112,8 +23574,8 @@ "question__title": "Employees With Deductions", "question__title_slug": "employees-with-deductions", "question__hide": false, - "total_acs": 1256, - "total_submitted": 2605, + "total_acs": 1287, + "total_submitted": 2668, "total_column_articles": 21, "frontend_question_id": "2394", "is_new_question": false @@ -23133,9 +23595,9 @@ "question__title": "Bitwise XOR of All Pairings", "question__title_slug": "bitwise-xor-of-all-pairings", "question__hide": false, - "total_acs": 6344, - "total_submitted": 9858, - "total_column_articles": 83, + "total_acs": 6424, + "total_submitted": 9981, + "total_column_articles": 85, "frontend_question_id": "2425", "is_new_question": false }, @@ -23154,9 +23616,9 @@ "question__title": "Remove Letter To Equalize Frequency", "question__title_slug": "remove-letter-to-equalize-frequency", "question__hide": false, - "total_acs": 22206, - "total_submitted": 89927, - "total_column_articles": 295, + "total_acs": 22319, + "total_submitted": 90453, + "total_column_articles": 300, "frontend_question_id": "2423", "is_new_question": false }, @@ -23175,8 +23637,8 @@ "question__title": "Create Components With Same Value", "question__title_slug": "create-components-with-same-value", "question__hide": false, - "total_acs": 2613, - "total_submitted": 4335, + "total_acs": 2636, + "total_submitted": 4370, "total_column_articles": 34, "frontend_question_id": "2440", "is_new_question": false @@ -23196,9 +23658,9 @@ "question__title": "Minimize Maximum of Array", "question__title_slug": "minimize-maximum-of-array", "question__hide": false, - "total_acs": 9407, - "total_submitted": 22725, - "total_column_articles": 143, + "total_acs": 9632, + "total_submitted": 23165, + "total_column_articles": 144, "frontend_question_id": "2439", "is_new_question": false }, @@ -23217,9 +23679,9 @@ "question__title": "Range Product Queries of Powers", "question__title_slug": "range-product-queries-of-powers", "question__hide": false, - "total_acs": 5951, - "total_submitted": 13957, - "total_column_articles": 90, + "total_acs": 6264, + "total_submitted": 14621, + "total_column_articles": 93, "frontend_question_id": "2438", "is_new_question": false }, @@ -23238,8 +23700,8 @@ "question__title": "Number of Valid Clock Times", "question__title_slug": "number-of-valid-clock-times", "question__hide": false, - "total_acs": 26495, - "total_submitted": 52498, + "total_acs": 26560, + "total_submitted": 52616, "total_column_articles": 302, "frontend_question_id": "2437", "is_new_question": false @@ -23259,9 +23721,9 @@ "question__title": "Count Subarrays With Fixed Bounds", "question__title_slug": "count-subarrays-with-fixed-bounds", "question__hide": false, - "total_acs": 7610, - "total_submitted": 16567, - "total_column_articles": 108, + "total_acs": 7676, + "total_submitted": 16661, + "total_column_articles": 109, "frontend_question_id": "2444", "is_new_question": false }, @@ -23280,9 +23742,9 @@ "question__title": "Longest Increasing Subsequence II", "question__title_slug": "longest-increasing-subsequence-ii", "question__hide": false, - "total_acs": 6893, - "total_submitted": 21939, - "total_column_articles": 109, + "total_acs": 7087, + "total_submitted": 22303, + "total_column_articles": 110, "frontend_question_id": "2407", "is_new_question": false }, @@ -23301,9 +23763,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": 11781, - "total_submitted": 15613, - "total_column_articles": 114, + "total_acs": 11823, + "total_submitted": 15671, + "total_column_articles": 115, "frontend_question_id": "2442", "is_new_question": false }, @@ -23322,8 +23784,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": 32918, - "total_submitted": 45311, + "total_acs": 33054, + "total_submitted": 45496, "total_column_articles": 302, "frontend_question_id": "2441", "is_new_question": false @@ -23343,8 +23805,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": 1195, - "total_submitted": 2073, + "total_acs": 1224, + "total_submitted": 2102, "total_column_articles": 22, "frontend_question_id": "2388", "is_new_question": false @@ -23385,9 +23847,9 @@ "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": 7604, - "total_submitted": 14519, - "total_column_articles": 109, + "total_acs": 7817, + "total_submitted": 14827, + "total_column_articles": 111, "frontend_question_id": "2435", "is_new_question": false }, @@ -23406,8 +23868,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": 7365, - "total_submitted": 17150, + "total_acs": 7424, + "total_submitted": 17240, "total_column_articles": 123, "frontend_question_id": "2434", "is_new_question": false @@ -23427,8 +23889,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": 9802, - "total_submitted": 11575, + "total_acs": 9900, + "total_submitted": 11696, "total_column_articles": 96, "frontend_question_id": "2433", "is_new_question": false @@ -23448,8 +23910,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": 31476, - "total_submitted": 57049, + "total_acs": 31529, + "total_submitted": 57132, "total_column_articles": 237, "frontend_question_id": "2432", "is_new_question": false @@ -23469,9 +23931,9 @@ "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": 346, - "total_submitted": 669, - "total_column_articles": 11, + "total_acs": 354, + "total_submitted": 686, + "total_column_articles": 12, "frontend_question_id": "2378", "is_new_question": false }, @@ -23490,8 +23952,8 @@ "question__title": "Sort the Olympic Table", "question__title_slug": "sort-the-olympic-table", "question__hide": false, - "total_acs": 1492, - "total_submitted": 1847, + "total_acs": 1522, + "total_submitted": 1882, "total_column_articles": 15, "frontend_question_id": "2377", "is_new_question": false @@ -23511,8 +23973,8 @@ "question__title": "Calculate the Influence of Each Salesperson", "question__title_slug": "calculate-the-influence-of-each-salesperson", "question__hide": false, - "total_acs": 1333, - "total_submitted": 1721, + "total_acs": 1362, + "total_submitted": 1756, "total_column_articles": 13, "frontend_question_id": "2372", "is_new_question": false @@ -23532,8 +23994,8 @@ "question__title": "Number of Pairs Satisfying Inequality", "question__title_slug": "number-of-pairs-satisfying-inequality", "question__hide": false, - "total_acs": 5161, - "total_submitted": 10911, + "total_acs": 5210, + "total_submitted": 11003, "total_column_articles": 97, "frontend_question_id": "2426", "is_new_question": false @@ -23553,8 +24015,8 @@ "question__title": "Longest Uploaded Prefix", "question__title_slug": "longest-uploaded-prefix", "question__hide": false, - "total_acs": 6950, - "total_submitted": 12236, + "total_acs": 7034, + "total_submitted": 12359, "total_column_articles": 107, "frontend_question_id": "2424", "is_new_question": false @@ -23574,9 +24036,9 @@ "question__title": "Partition String Into Substrings With Values at Most K", "question__title_slug": "partition-string-into-substrings-with-values-at-most-k", "question__hide": false, - "total_acs": 7211, - "total_submitted": 14494, - "total_column_articles": 71, + "total_acs": 7273, + "total_submitted": 14608, + "total_column_articles": 72, "frontend_question_id": "2522", "is_new_question": false }, @@ -23595,9 +24057,9 @@ "question__title": "Maximum Deletions on a String", "question__title_slug": "maximum-deletions-on-a-string", "question__hide": false, - "total_acs": 7666, - "total_submitted": 15781, - "total_column_articles": 109, + "total_acs": 7734, + "total_submitted": 15907, + "total_column_articles": 110, "frontend_question_id": "2430", "is_new_question": false }, @@ -23616,8 +24078,8 @@ "question__title": "Minimize XOR", "question__title_slug": "minimize-xor", "question__hide": false, - "total_acs": 8255, - "total_submitted": 18047, + "total_acs": 8322, + "total_submitted": 18153, "total_column_articles": 118, "frontend_question_id": "2429", "is_new_question": false @@ -23637,9 +24099,9 @@ "question__title": "Maximum Sum of an Hourglass", "question__title_slug": "maximum-sum-of-an-hourglass", "question__hide": false, - "total_acs": 9433, - "total_submitted": 12668, - "total_column_articles": 105, + "total_acs": 9480, + "total_submitted": 12727, + "total_column_articles": 106, "frontend_question_id": "2428", "is_new_question": false }, @@ -23658,8 +24120,8 @@ "question__title": "Number of Common Factors", "question__title_slug": "number-of-common-factors", "question__hide": false, - "total_acs": 37894, - "total_submitted": 47145, + "total_acs": 38161, + "total_submitted": 47453, "total_column_articles": 269, "frontend_question_id": "2427", "is_new_question": false @@ -23679,8 +24141,8 @@ "question__title": "Minimize Maximum Value in a Grid", "question__title_slug": "minimize-maximum-value-in-a-grid", "question__hide": false, - "total_acs": 352, - "total_submitted": 579, + "total_acs": 353, + "total_submitted": 580, "total_column_articles": 13, "frontend_question_id": "2371", "is_new_question": false @@ -23700,8 +24162,8 @@ "question__title": "Number of Good Paths", "question__title_slug": "number-of-good-paths", "question__hide": false, - "total_acs": 4790, - "total_submitted": 10939, + "total_acs": 4830, + "total_submitted": 11008, "total_column_articles": 59, "frontend_question_id": "2421", "is_new_question": false @@ -23721,8 +24183,8 @@ "question__title": "Find All Good Indices", "question__title_slug": "find-all-good-indices", "question__hide": false, - "total_acs": 9186, - "total_submitted": 27958, + "total_acs": 9236, + "total_submitted": 28058, "total_column_articles": 159, "frontend_question_id": "2420", "is_new_question": false @@ -23742,9 +24204,9 @@ "question__title": "Longest Subarray With Maximum Bitwise AND", "question__title_slug": "longest-subarray-with-maximum-bitwise-and", "question__hide": false, - "total_acs": 9788, - "total_submitted": 22576, - "total_column_articles": 114, + "total_acs": 9906, + "total_submitted": 22763, + "total_column_articles": 115, "frontend_question_id": "2419", "is_new_question": false }, @@ -23763,9 +24225,9 @@ "question__title": "Sort the People", "question__title_slug": "sort-the-people", "question__hide": false, - "total_acs": 42497, - "total_submitted": 54277, - "total_column_articles": 431, + "total_acs": 42751, + "total_submitted": 54593, + "total_column_articles": 432, "frontend_question_id": "2418", "is_new_question": false }, @@ -23784,9 +24246,9 @@ "question__title": "Generate the Invoice", "question__title_slug": "generate-the-invoice", "question__hide": false, - "total_acs": 1033, - "total_submitted": 1396, - "total_column_articles": 26, + "total_acs": 1061, + "total_submitted": 1446, + "total_column_articles": 28, "frontend_question_id": "2362", "is_new_question": false }, @@ -23805,8 +24267,8 @@ "question__title": "Minimum Costs Using the Train Line", "question__title_slug": "minimum-costs-using-the-train-line", "question__hide": false, - "total_acs": 472, - "total_submitted": 724, + "total_acs": 479, + "total_submitted": 731, "total_column_articles": 14, "frontend_question_id": "2361", "is_new_question": false @@ -23826,8 +24288,8 @@ "question__title": "Minimum Money Required Before Transactions", "question__title_slug": "minimum-money-required-before-transactions", "question__hide": false, - "total_acs": 4017, - "total_submitted": 8357, + "total_acs": 4152, + "total_submitted": 8670, "total_column_articles": 64, "frontend_question_id": "2412", "is_new_question": false @@ -23847,9 +24309,9 @@ "question__title": "Smallest Subarrays With Maximum Bitwise OR", "question__title_slug": "smallest-subarrays-with-maximum-bitwise-or", "question__hide": false, - "total_acs": 6250, - "total_submitted": 13345, - "total_column_articles": 70, + "total_acs": 6413, + "total_submitted": 13583, + "total_column_articles": 71, "frontend_question_id": "2411", "is_new_question": false }, @@ -23868,8 +24330,8 @@ "question__title": "Maximum Matching of Players With Trainers", "question__title_slug": "maximum-matching-of-players-with-trainers", "question__hide": false, - "total_acs": 8403, - "total_submitted": 12790, + "total_acs": 8469, + "total_submitted": 12883, "total_column_articles": 99, "frontend_question_id": "2410", "is_new_question": false @@ -23889,8 +24351,8 @@ "question__title": "Count Days Spent Together", "question__title_slug": "count-days-spent-together", "question__hide": false, - "total_acs": 26883, - "total_submitted": 48108, + "total_acs": 26948, + "total_submitted": 48221, "total_column_articles": 328, "frontend_question_id": "2409", "is_new_question": false @@ -23910,9 +24372,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": 27696, - "total_submitted": 32853, - "total_column_articles": 101, + "total_acs": 29306, + "total_submitted": 34678, + "total_column_articles": 104, "frontend_question_id": "2356", "is_new_question": false }, @@ -23931,8 +24393,8 @@ "question__title": "Sum of Prefix Scores of Strings", "question__title_slug": "sum-of-prefix-scores-of-strings", "question__hide": false, - "total_acs": 10148, - "total_submitted": 24425, + "total_acs": 10188, + "total_submitted": 24501, "total_column_articles": 134, "frontend_question_id": "2416", "is_new_question": false @@ -23952,9 +24414,9 @@ "question__title": "Reverse Odd Levels of Binary Tree", "question__title_slug": "reverse-odd-levels-of-binary-tree", "question__hide": false, - "total_acs": 28177, - "total_submitted": 35396, - "total_column_articles": 245, + "total_acs": 28303, + "total_submitted": 35548, + "total_column_articles": 247, "frontend_question_id": "2415", "is_new_question": false }, @@ -23973,9 +24435,9 @@ "question__title": "Length of the Longest Alphabetical Continuous Substring", "question__title_slug": "length-of-the-longest-alphabetical-continuous-substring", "question__hide": false, - "total_acs": 13244, - "total_submitted": 21763, - "total_column_articles": 143, + "total_acs": 13322, + "total_submitted": 21867, + "total_column_articles": 144, "frontend_question_id": "2414", "is_new_question": false }, @@ -23994,9 +24456,9 @@ "question__title": "Smallest Even Multiple", "question__title_slug": "smallest-even-multiple", "question__hide": false, - "total_acs": 72554, - "total_submitted": 86054, - "total_column_articles": 380, + "total_acs": 74007, + "total_submitted": 87815, + "total_column_articles": 383, "frontend_question_id": "2413", "is_new_question": false }, @@ -24015,8 +24477,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": 520, - "total_submitted": 1042, + "total_acs": 530, + "total_submitted": 1065, "total_column_articles": 11, "frontend_question_id": "2355", "is_new_question": false @@ -24036,8 +24498,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": 216, - "total_submitted": 477, + "total_acs": 221, + "total_submitted": 496, "total_column_articles": 4, "frontend_question_id": "2459", "is_new_question": false @@ -24057,8 +24519,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": 10711, - "total_submitted": 22598, + "total_acs": 10897, + "total_submitted": 22864, "total_column_articles": 142, "frontend_question_id": "2406", "is_new_question": false @@ -24078,9 +24540,9 @@ "question__title": "Optimal Partition of String", "question__title_slug": "optimal-partition-of-string", "question__hide": false, - "total_acs": 12198, - "total_submitted": 16372, - "total_column_articles": 151, + "total_acs": 12255, + "total_submitted": 16441, + "total_column_articles": 152, "frontend_question_id": "2405", "is_new_question": false }, @@ -24099,8 +24561,8 @@ "question__title": "Most Frequent Even Element", "question__title_slug": "most-frequent-even-element", "question__hide": false, - "total_acs": 38657, - "total_submitted": 66568, + "total_acs": 38749, + "total_submitted": 66706, "total_column_articles": 366, "frontend_question_id": "2404", "is_new_question": false @@ -24120,8 +24582,8 @@ "question__title": "Finding the Number of Visible Mountains", "question__title_slug": "finding-the-number-of-visible-mountains", "question__hide": false, - "total_acs": 339, - "total_submitted": 784, + "total_acs": 341, + "total_submitted": 790, "total_column_articles": 10, "frontend_question_id": "2345", "is_new_question": false @@ -24141,8 +24603,8 @@ "question__title": "Compute the Rank as a Percentage", "question__title_slug": "compute-the-rank-as-a-percentage", "question__hide": false, - "total_acs": 1320, - "total_submitted": 3468, + "total_acs": 1350, + "total_submitted": 3552, "total_column_articles": 14, "frontend_question_id": "2346", "is_new_question": false @@ -24162,8 +24624,8 @@ "question__title": "Task Scheduler II", "question__title_slug": "task-scheduler-ii", "question__hide": false, - "total_acs": 7231, - "total_submitted": 14893, + "total_acs": 7261, + "total_submitted": 14946, "total_column_articles": 92, "frontend_question_id": "2365", "is_new_question": false @@ -24183,9 +24645,9 @@ "question__title": "Maximum Rows Covered by Columns", "question__title_slug": "maximum-rows-covered-by-columns", "question__hide": false, - "total_acs": 21629, - "total_submitted": 31368, - "total_column_articles": 267, + "total_acs": 21814, + "total_submitted": 31620, + "total_column_articles": 269, "frontend_question_id": "2397", "is_new_question": false }, @@ -24204,9 +24666,9 @@ "question__title": "Strictly Palindromic Number", "question__title_slug": "strictly-palindromic-number", "question__hide": false, - "total_acs": 14342, - "total_submitted": 16373, - "total_column_articles": 139, + "total_acs": 14529, + "total_submitted": 16596, + "total_column_articles": 140, "frontend_question_id": "2396", "is_new_question": false }, @@ -24225,9 +24687,9 @@ "question__title": "Find Subarrays With Equal Sum", "question__title_slug": "find-subarrays-with-equal-sum", "question__hide": false, - "total_acs": 29899, - "total_submitted": 39349, - "total_column_articles": 257, + "total_acs": 30031, + "total_submitted": 39517, + "total_column_articles": 258, "frontend_question_id": "2395", "is_new_question": false }, @@ -24246,8 +24708,8 @@ "question__title": "Meeting Rooms III", "question__title_slug": "meeting-rooms-iii", "question__hide": false, - "total_acs": 7572, - "total_submitted": 22797, + "total_acs": 7654, + "total_submitted": 22943, "total_column_articles": 133, "frontend_question_id": "2402", "is_new_question": false @@ -24267,9 +24729,9 @@ "question__title": "Longest Nice Subarray", "question__title_slug": "longest-nice-subarray", "question__hide": false, - "total_acs": 12632, - "total_submitted": 24473, - "total_column_articles": 187, + "total_acs": 12898, + "total_submitted": 24858, + "total_column_articles": 190, "frontend_question_id": "2401", "is_new_question": false }, @@ -24288,8 +24750,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": 12662, - "total_submitted": 37806, + "total_acs": 12767, + "total_submitted": 38031, "total_column_articles": 163, "frontend_question_id": "2400", "is_new_question": false @@ -24309,8 +24771,8 @@ "question__title": "Check Distances Between Same Letters", "question__title_slug": "check-distances-between-same-letters", "question__hide": false, - "total_acs": 33044, - "total_submitted": 44154, + "total_acs": 33108, + "total_submitted": 44235, "total_column_articles": 324, "frontend_question_id": "2399", "is_new_question": false @@ -24330,8 +24792,8 @@ "question__title": "Largest Palindromic Number", "question__title_slug": "largest-palindromic-number", "question__hide": false, - "total_acs": 11730, - "total_submitted": 36375, + "total_acs": 11813, + "total_submitted": 36585, "total_column_articles": 160, "frontend_question_id": "2384", "is_new_question": false @@ -24351,8 +24813,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": 541, - "total_submitted": 803, + "total_acs": 586, + "total_submitted": 856, "total_column_articles": 14, "frontend_question_id": "2340", "is_new_question": false @@ -24372,9 +24834,9 @@ "question__title": "Max Sum of a Pair With Equal Sum of Digits", "question__title_slug": "max-sum-of-a-pair-with-equal-sum-of-digits", "question__hide": false, - "total_acs": 30859, - "total_submitted": 50000, - "total_column_articles": 333, + "total_acs": 30888, + "total_submitted": 50068, + "total_column_articles": 332, "frontend_question_id": "2342", "is_new_question": false }, @@ -24393,8 +24855,8 @@ "question__title": "Build a Matrix With Conditions", "question__title_slug": "build-a-matrix-with-conditions", "question__hide": false, - "total_acs": 6116, - "total_submitted": 10868, + "total_acs": 6138, + "total_submitted": 10891, "total_column_articles": 100, "frontend_question_id": "2392", "is_new_question": false @@ -24414,9 +24876,9 @@ "question__title": "Minimum Amount of Time to Collect Garbage", "question__title_slug": "minimum-amount-of-time-to-collect-garbage", "question__hide": false, - "total_acs": 31290, - "total_submitted": 36554, - "total_column_articles": 328, + "total_acs": 31941, + "total_submitted": 37315, + "total_column_articles": 329, "frontend_question_id": "2391", "is_new_question": false }, @@ -24435,9 +24897,9 @@ "question__title": "Removing Stars From a String", "question__title_slug": "removing-stars-from-a-string", "question__hide": false, - "total_acs": 30249, - "total_submitted": 41670, - "total_column_articles": 277, + "total_acs": 30879, + "total_submitted": 42473, + "total_column_articles": 280, "frontend_question_id": "2390", "is_new_question": false }, @@ -24456,9 +24918,9 @@ "question__title": "Longest Subsequence With Limited Sum", "question__title_slug": "longest-subsequence-with-limited-sum", "question__hide": false, - "total_acs": 38122, - "total_submitted": 53832, - "total_column_articles": 373, + "total_acs": 38671, + "total_submitted": 54504, + "total_column_articles": 376, "frontend_question_id": "2389", "is_new_question": false }, @@ -24477,8 +24939,8 @@ "question__title": "Valid Palindrome IV", "question__title_slug": "valid-palindrome-iv", "question__hide": false, - "total_acs": 538, - "total_submitted": 707, + "total_acs": 544, + "total_submitted": 714, "total_column_articles": 20, "frontend_question_id": "2330", "is_new_question": false @@ -24498,9 +24960,9 @@ "question__title": "Maximum Segment Sum After Removals", "question__title_slug": "maximum-segment-sum-after-removals", "question__hide": false, - "total_acs": 4501, - "total_submitted": 8047, - "total_column_articles": 97, + "total_acs": 4542, + "total_submitted": 8136, + "total_column_articles": 98, "frontend_question_id": "2382", "is_new_question": false }, @@ -24519,9 +24981,9 @@ "question__title": "Shifting Letters II", "question__title_slug": "shifting-letters-ii", "question__hide": false, - "total_acs": 7569, - "total_submitted": 19181, - "total_column_articles": 112, + "total_acs": 7698, + "total_submitted": 19403, + "total_column_articles": 113, "frontend_question_id": "2381", "is_new_question": false }, @@ -24540,9 +25002,9 @@ "question__title": "Time Needed to Rearrange a Binary String", "question__title_slug": "time-needed-to-rearrange-a-binary-string", "question__hide": false, - "total_acs": 7393, - "total_submitted": 13114, - "total_column_articles": 81, + "total_acs": 7436, + "total_submitted": 13189, + "total_column_articles": 82, "frontend_question_id": "2380", "is_new_question": false }, @@ -24561,8 +25023,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": 39376, - "total_submitted": 63580, + "total_acs": 39718, + "total_submitted": 64055, "total_column_articles": 461, "frontend_question_id": "2379", "is_new_question": false @@ -24582,9 +25044,9 @@ "question__title": "Find the K-Sum of an Array", "question__title_slug": "find-the-k-sum-of-an-array", "question__hide": false, - "total_acs": 14786, - "total_submitted": 26583, - "total_column_articles": 93, + "total_acs": 14863, + "total_submitted": 26722, + "total_column_articles": 92, "frontend_question_id": "2386", "is_new_question": false }, @@ -24603,9 +25065,9 @@ "question__title": "Amount of Time for Binary Tree to Be Infected", "question__title_slug": "amount-of-time-for-binary-tree-to-be-infected", "question__hide": false, - "total_acs": 25281, - "total_submitted": 48967, - "total_column_articles": 282, + "total_acs": 25392, + "total_submitted": 49155, + "total_column_articles": 281, "frontend_question_id": "2385", "is_new_question": false }, @@ -24624,9 +25086,9 @@ "question__title": "Minimum Hours of Training to Win a Competition", "question__title_slug": "minimum-hours-of-training-to-win-a-competition", "question__hide": false, - "total_acs": 36969, - "total_submitted": 78504, - "total_column_articles": 380, + "total_acs": 37029, + "total_submitted": 78644, + "total_column_articles": 379, "frontend_question_id": "2383", "is_new_question": false }, @@ -24645,8 +25107,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": 392, - "total_submitted": 631, + "total_acs": 397, + "total_submitted": 636, "total_column_articles": 13, "frontend_question_id": "2323", "is_new_question": false @@ -24666,9 +25128,9 @@ "question__title": "Count Special Integers", "question__title_slug": "count-special-integers", "question__hide": false, - "total_acs": 11853, - "total_submitted": 21165, - "total_column_articles": 144, + "total_acs": 12027, + "total_submitted": 21420, + "total_column_articles": 145, "frontend_question_id": "2376", "is_new_question": false }, @@ -24687,8 +25149,8 @@ "question__title": "Construct Smallest Number From DI String", "question__title_slug": "construct-smallest-number-from-di-string", "question__hide": false, - "total_acs": 10762, - "total_submitted": 15286, + "total_acs": 10787, + "total_submitted": 15319, "total_column_articles": 221, "frontend_question_id": "2375", "is_new_question": false @@ -24708,9 +25170,9 @@ "question__title": "Node With Highest Edge Score", "question__title_slug": "node-with-highest-edge-score", "question__hide": false, - "total_acs": 10738, - "total_submitted": 25061, - "total_column_articles": 107, + "total_acs": 10776, + "total_submitted": 25132, + "total_column_articles": 108, "frontend_question_id": "2374", "is_new_question": false }, @@ -24729,8 +25191,8 @@ "question__title": "Largest Local Values in a Matrix", "question__title_slug": "largest-local-values-in-a-matrix", "question__hide": false, - "total_acs": 39419, - "total_submitted": 46501, + "total_acs": 39506, + "total_submitted": 46594, "total_column_articles": 323, "frontend_question_id": "2373", "is_new_question": false @@ -24750,8 +25212,8 @@ "question__title": "All the Matches of the League", "question__title_slug": "all-the-matches-of-the-league", "question__hide": false, - "total_acs": 1663, - "total_submitted": 2128, + "total_acs": 1684, + "total_submitted": 2151, "total_column_articles": 18, "frontend_question_id": "2339", "is_new_question": false @@ -24771,8 +25233,8 @@ "question__title": "Product Sales Analysis V", "question__title_slug": "product-sales-analysis-v", "question__hide": false, - "total_acs": 1685, - "total_submitted": 2334, + "total_acs": 1723, + "total_submitted": 2382, "total_column_articles": 15, "frontend_question_id": "2329", "is_new_question": false @@ -24792,8 +25254,8 @@ "question__title": "Product Sales Analysis IV", "question__title_slug": "product-sales-analysis-iv", "question__hide": false, - "total_acs": 1422, - "total_submitted": 2007, + "total_acs": 1460, + "total_submitted": 2079, "total_column_articles": 19, "frontend_question_id": "2324", "is_new_question": false @@ -24813,8 +25275,8 @@ "question__title": "Minimum Replacements to Sort the Array", "question__title_slug": "minimum-replacements-to-sort-the-array", "question__hide": false, - "total_acs": 4872, - "total_submitted": 11156, + "total_acs": 4886, + "total_submitted": 11191, "total_column_articles": 56, "frontend_question_id": "2366", "is_new_question": false @@ -24834,8 +25296,8 @@ "question__title": "Maximum Number of Robots Within Budget", "question__title_slug": "maximum-number-of-robots-within-budget", "question__hide": false, - "total_acs": 5564, - "total_submitted": 15328, + "total_acs": 5663, + "total_submitted": 15512, "total_column_articles": 101, "frontend_question_id": "2398", "is_new_question": false @@ -24855,9 +25317,9 @@ "question__title": "Count Number of Bad Pairs", "question__title_slug": "count-number-of-bad-pairs", "question__hide": false, - "total_acs": 7211, - "total_submitted": 16863, - "total_column_articles": 92, + "total_acs": 7242, + "total_submitted": 16912, + "total_column_articles": 93, "frontend_question_id": "2364", "is_new_question": false }, @@ -24876,9 +25338,9 @@ "question__title": "Merge Similar Items", "question__title_slug": "merge-similar-items", "question__hide": false, - "total_acs": 36670, - "total_submitted": 46942, - "total_column_articles": 315, + "total_acs": 36767, + "total_submitted": 47064, + "total_column_articles": 317, "frontend_question_id": "2363", "is_new_question": false }, @@ -24897,8 +25359,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": 1491, - "total_submitted": 2096, + "total_acs": 1518, + "total_submitted": 2139, "total_column_articles": 16, "frontend_question_id": "2314", "is_new_question": false @@ -24918,9 +25380,9 @@ "question__title": "Reachable Nodes With Restrictions", "question__title_slug": "reachable-nodes-with-restrictions", "question__hide": false, - "total_acs": 27528, - "total_submitted": 47936, - "total_column_articles": 275, + "total_acs": 27624, + "total_submitted": 48065, + "total_column_articles": 274, "frontend_question_id": "2368", "is_new_question": false }, @@ -24939,9 +25401,9 @@ "question__title": "Longest Ideal Subsequence", "question__title_slug": "longest-ideal-subsequence", "question__hide": false, - "total_acs": 9783, - "total_submitted": 22504, - "total_column_articles": 126, + "total_acs": 9839, + "total_submitted": 22631, + "total_column_articles": 127, "frontend_question_id": "2370", "is_new_question": false }, @@ -24960,8 +25422,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": 28473, - "total_submitted": 59845, + "total_acs": 28646, + "total_submitted": 60161, "total_column_articles": 242, "frontend_question_id": "2369", "is_new_question": false @@ -24981,9 +25443,9 @@ "question__title": "Number of Arithmetic Triplets", "question__title_slug": "number-of-arithmetic-triplets", "question__hide": false, - "total_acs": 45913, - "total_submitted": 55217, - "total_column_articles": 418, + "total_acs": 46119, + "total_submitted": 55455, + "total_column_articles": 420, "frontend_question_id": "2367", "is_new_question": false }, @@ -25002,8 +25464,8 @@ "question__title": "Arrange Table by Gender", "question__title_slug": "arrange-table-by-gender", "question__hide": false, - "total_acs": 1504, - "total_submitted": 2001, + "total_acs": 1526, + "total_submitted": 2028, "total_column_articles": 19, "frontend_question_id": "2308", "is_new_question": false @@ -25023,9 +25485,9 @@ "question__title": "Tasks Count in the Weekend", "question__title_slug": "tasks-count-in-the-weekend", "question__hide": false, - "total_acs": 1681, - "total_submitted": 2185, - "total_column_articles": 21, + "total_acs": 1712, + "total_submitted": 2217, + "total_column_articles": 22, "frontend_question_id": "2298", "is_new_question": false }, @@ -25044,8 +25506,8 @@ "question__title": "Longest Cycle in a Graph", "question__title_slug": "longest-cycle-in-a-graph", "question__hide": false, - "total_acs": 9576, - "total_submitted": 24527, + "total_acs": 9932, + "total_submitted": 25180, "total_column_articles": 149, "frontend_question_id": "2360", "is_new_question": false @@ -25065,9 +25527,9 @@ "question__title": "Find Closest Node to Given Two Nodes", "question__title_slug": "find-closest-node-to-given-two-nodes", "question__hide": false, - "total_acs": 8921, - "total_submitted": 28543, - "total_column_articles": 117, + "total_acs": 8990, + "total_submitted": 28655, + "total_column_articles": 116, "frontend_question_id": "2359", "is_new_question": false }, @@ -25086,9 +25548,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": 11539, - "total_submitted": 17884, - "total_column_articles": 187, + "total_acs": 11586, + "total_submitted": 17942, + "total_column_articles": 189, "frontend_question_id": "2358", "is_new_question": false }, @@ -25107,9 +25569,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": 45441, - "total_submitted": 60249, - "total_column_articles": 518, + "total_acs": 45593, + "total_submitted": 60454, + "total_column_articles": 519, "frontend_question_id": "2357", "is_new_question": false }, @@ -25128,8 +25590,8 @@ "question__title": "Shortest Impossible Sequence of Rolls", "question__title_slug": "shortest-impossible-sequence-of-rolls", "question__hide": false, - "total_acs": 4520, - "total_submitted": 6953, + "total_acs": 4537, + "total_submitted": 6976, "total_column_articles": 76, "frontend_question_id": "2350", "is_new_question": false @@ -25149,9 +25611,9 @@ "question__title": "Design a Number Container System", "question__title_slug": "design-a-number-container-system", "question__hide": false, - "total_acs": 7317, - "total_submitted": 19575, - "total_column_articles": 100, + "total_acs": 7361, + "total_submitted": 19684, + "total_column_articles": 99, "frontend_question_id": "2349", "is_new_question": false }, @@ -25170,9 +25632,9 @@ "question__title": "Best Poker Hand", "question__title_slug": "best-poker-hand", "question__hide": false, - "total_acs": 33835, - "total_submitted": 57006, - "total_column_articles": 299, + "total_acs": 33896, + "total_submitted": 57104, + "total_column_articles": 298, "frontend_question_id": "2347", "is_new_question": false }, @@ -25191,9 +25653,9 @@ "question__title": "Number of Zero-Filled Subarrays", "question__title_slug": "number-of-zero-filled-subarrays", "question__hide": false, - "total_acs": 9498, - "total_submitted": 16581, - "total_column_articles": 133, + "total_acs": 9559, + "total_submitted": 16675, + "total_column_articles": 135, "frontend_question_id": "2348", "is_new_question": false }, @@ -25212,9 +25674,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": 1672, - "total_submitted": 3925, - "total_column_articles": 24, + "total_acs": 1711, + "total_submitted": 4017, + "total_column_articles": 25, "frontend_question_id": "2292", "is_new_question": false }, @@ -25233,8 +25695,8 @@ "question__title": "Number of Excellent Pairs", "question__title_slug": "number-of-excellent-pairs", "question__hide": false, - "total_acs": 6911, - "total_submitted": 15256, + "total_acs": 6943, + "total_submitted": 15301, "total_column_articles": 79, "frontend_question_id": "2354", "is_new_question": false @@ -25254,9 +25716,9 @@ "question__title": "Design a Food Rating System", "question__title_slug": "design-a-food-rating-system", "question__hide": false, - "total_acs": 8740, - "total_submitted": 27958, - "total_column_articles": 124, + "total_acs": 8761, + "total_submitted": 28021, + "total_column_articles": 125, "frontend_question_id": "2353", "is_new_question": false }, @@ -25275,9 +25737,9 @@ "question__title": "Equal Row and Column Pairs", "question__title_slug": "equal-row-and-column-pairs", "question__hide": false, - "total_acs": 45162, - "total_submitted": 61764, - "total_column_articles": 414, + "total_acs": 45567, + "total_submitted": 62290, + "total_column_articles": 415, "frontend_question_id": "2352", "is_new_question": false }, @@ -25296,9 +25758,9 @@ "question__title": "First Letter to Appear Twice", "question__title_slug": "first-letter-to-appear-twice", "question__hide": false, - "total_acs": 44621, - "total_submitted": 53155, - "total_column_articles": 462, + "total_acs": 44844, + "total_submitted": 53439, + "total_column_articles": 463, "frontend_question_id": "2351", "is_new_question": false }, @@ -25317,8 +25779,8 @@ "question__title": "Maximum Profit From Trading Stocks", "question__title_slug": "maximum-profit-from-trading-stocks", "question__hide": false, - "total_acs": 817, - "total_submitted": 1422, + "total_acs": 842, + "total_submitted": 1470, "total_column_articles": 20, "frontend_question_id": "2291", "is_new_question": false @@ -25338,8 +25800,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": 315, - "total_submitted": 712, + "total_acs": 319, + "total_submitted": 719, "total_column_articles": 13, "frontend_question_id": "2282", "is_new_question": false @@ -25359,9 +25821,9 @@ "question__title": "Minimum Deletions to Make Array Divisible", "question__title_slug": "minimum-deletions-to-make-array-divisible", "question__hide": false, - "total_acs": 9326, - "total_submitted": 17383, - "total_column_articles": 127, + "total_acs": 9391, + "total_submitted": 17489, + "total_column_articles": 129, "frontend_question_id": "2344", "is_new_question": false }, @@ -25380,8 +25842,8 @@ "question__title": "Query Kth Smallest Trimmed Number", "question__title_slug": "query-kth-smallest-trimmed-number", "question__hide": false, - "total_acs": 10350, - "total_submitted": 24570, + "total_acs": 10412, + "total_submitted": 24655, "total_column_articles": 153, "frontend_question_id": "2343", "is_new_question": false @@ -25401,9 +25863,9 @@ "question__title": "Maximum Number of Pairs in Array", "question__title_slug": "maximum-number-of-pairs-in-array", "question__hide": false, - "total_acs": 42057, - "total_submitted": 51969, - "total_column_articles": 499, + "total_acs": 42182, + "total_submitted": 52132, + "total_column_articles": 500, "frontend_question_id": "2341", "is_new_question": false }, @@ -25422,8 +25884,8 @@ "question__title": "Closest Node to Path in Tree", "question__title_slug": "closest-node-to-path-in-tree", "question__hide": false, - "total_acs": 482, - "total_submitted": 718, + "total_acs": 483, + "total_submitted": 722, "total_column_articles": 15, "frontend_question_id": "2277", "is_new_question": false @@ -25443,9 +25905,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": 3822, - "total_submitted": 8144, - "total_column_articles": 58, + "total_acs": 3853, + "total_submitted": 8207, + "total_column_articles": 59, "frontend_question_id": "2334", "is_new_question": false }, @@ -25464,8 +25926,8 @@ "question__title": "Minimum Sum of Squared Difference", "question__title_slug": "minimum-sum-of-squared-difference", "question__hide": false, - "total_acs": 5738, - "total_submitted": 21102, + "total_acs": 5771, + "total_submitted": 21237, "total_column_articles": 85, "frontend_question_id": "2333", "is_new_question": false @@ -25485,8 +25947,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": 6523, - "total_submitted": 25796, + "total_acs": 6561, + "total_submitted": 25937, "total_column_articles": 102, "frontend_question_id": "2332", "is_new_question": false @@ -25506,8 +25968,8 @@ "question__title": "Evaluate Boolean Binary Tree", "question__title_slug": "evaluate-boolean-binary-tree", "question__hide": false, - "total_acs": 37441, - "total_submitted": 45261, + "total_acs": 37750, + "total_submitted": 45626, "total_column_articles": 407, "frontend_question_id": "2331", "is_new_question": false @@ -25527,9 +25989,9 @@ "question__title": "Count the Number of Ideal Arrays", "question__title_slug": "count-the-number-of-ideal-arrays", "question__hide": false, - "total_acs": 3174, - "total_submitted": 10159, - "total_column_articles": 48, + "total_acs": 3199, + "total_submitted": 10226, + "total_column_articles": 49, "frontend_question_id": "2338", "is_new_question": false }, @@ -25548,8 +26010,8 @@ "question__title": "Move Pieces to Obtain a String", "question__title_slug": "move-pieces-to-obtain-a-string", "question__hide": false, - "total_acs": 28761, - "total_submitted": 60605, + "total_acs": 28794, + "total_submitted": 60661, "total_column_articles": 291, "frontend_question_id": "2337", "is_new_question": false @@ -25569,8 +26031,8 @@ "question__title": "Smallest Number in Infinite Set", "question__title_slug": "smallest-number-in-infinite-set", "question__hide": false, - "total_acs": 34402, - "total_submitted": 47608, + "total_acs": 34683, + "total_submitted": 48071, "total_column_articles": 357, "frontend_question_id": "2336", "is_new_question": false @@ -25590,8 +26052,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": 35833, - "total_submitted": 55445, + "total_acs": 35919, + "total_submitted": 55591, "total_column_articles": 420, "frontend_question_id": "2335", "is_new_question": false @@ -25611,8 +26073,8 @@ "question__title": "Spiral Matrix IV", "question__title_slug": "spiral-matrix-iv", "question__hide": false, - "total_acs": 11420, - "total_submitted": 17131, + "total_acs": 11499, + "total_submitted": 17235, "total_column_articles": 154, "frontend_question_id": "2326", "is_new_question": false @@ -25632,9 +26094,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": 7650, - "total_submitted": 14814, - "total_column_articles": 135, + "total_acs": 7787, + "total_submitted": 15055, + "total_column_articles": 136, "frontend_question_id": "2328", "is_new_question": false }, @@ -25653,9 +26115,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": 11466, - "total_submitted": 25009, - "total_column_articles": 218, + "total_acs": 11540, + "total_submitted": 25142, + "total_column_articles": 219, "frontend_question_id": "2327", "is_new_question": false }, @@ -25674,8 +26136,8 @@ "question__title": "Decode the Message", "question__title_slug": "decode-the-message", "question__hide": false, - "total_acs": 46488, - "total_submitted": 54817, + "total_acs": 46609, + "total_submitted": 54965, "total_column_articles": 447, "frontend_question_id": "2325", "is_new_question": false @@ -25695,8 +26157,8 @@ "question__title": "Minimum Number of Keypresses", "question__title_slug": "minimum-number-of-keypresses", "question__hide": false, - "total_acs": 704, - "total_submitted": 1033, + "total_acs": 742, + "total_submitted": 1086, "total_column_articles": 21, "frontend_question_id": "2268", "is_new_question": false @@ -25716,8 +26178,8 @@ "question__title": "Number of Distinct Roll Sequences", "question__title_slug": "number-of-distinct-roll-sequences", "question__hide": false, - "total_acs": 4166, - "total_submitted": 7278, + "total_acs": 4187, + "total_submitted": 7314, "total_column_articles": 79, "frontend_question_id": "2318", "is_new_question": false @@ -25737,9 +26199,9 @@ "question__title": "Count Unreachable Pairs of Nodes in an Undirected Graph", "question__title_slug": "count-unreachable-pairs-of-nodes-in-an-undirected-graph", "question__hide": false, - "total_acs": 25639, - "total_submitted": 52997, - "total_column_articles": 267, + "total_acs": 25956, + "total_submitted": 53612, + "total_column_articles": 269, "frontend_question_id": "2316", "is_new_question": false }, @@ -25758,8 +26220,8 @@ "question__title": "Maximum XOR After Operations ", "question__title_slug": "maximum-xor-after-operations", "question__hide": false, - "total_acs": 6544, - "total_submitted": 7751, + "total_acs": 6617, + "total_submitted": 7847, "total_column_articles": 80, "frontend_question_id": "2317", "is_new_question": false @@ -25779,9 +26241,9 @@ "question__title": "Count Asterisks", "question__title_slug": "count-asterisks", "question__hide": false, - "total_acs": 39301, - "total_submitted": 46222, - "total_column_articles": 508, + "total_acs": 39492, + "total_submitted": 46470, + "total_column_articles": 509, "frontend_question_id": "2315", "is_new_question": false }, @@ -25800,9 +26262,9 @@ "question__title": "Minimum Score After Removals on a Tree", "question__title_slug": "minimum-score-after-removals-on-a-tree", "question__hide": false, - "total_acs": 4010, - "total_submitted": 6751, - "total_column_articles": 59, + "total_acs": 4038, + "total_submitted": 6790, + "total_column_articles": 60, "frontend_question_id": "2322", "is_new_question": false }, @@ -25821,8 +26283,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": 323, - "total_submitted": 562, + "total_acs": 336, + "total_submitted": 618, "total_column_articles": 18, "frontend_question_id": "2313", "is_new_question": false @@ -25842,9 +26304,9 @@ "question__title": "Check if Matrix Is X-Matrix", "question__title_slug": "check-if-matrix-is-x-matrix", "question__hide": false, - "total_acs": 38965, - "total_submitted": 51365, - "total_column_articles": 354, + "total_acs": 39089, + "total_submitted": 51543, + "total_column_articles": 355, "frontend_question_id": "2319", "is_new_question": false }, @@ -25863,9 +26325,9 @@ "question__title": "Count Number of Ways to Place Houses", "question__title_slug": "count-number-of-ways-to-place-houses", "question__hide": false, - "total_acs": 11338, - "total_submitted": 26615, - "total_column_articles": 117, + "total_acs": 11768, + "total_submitted": 27464, + "total_column_articles": 120, "frontend_question_id": "2320", "is_new_question": false }, @@ -25884,8 +26346,8 @@ "question__title": "Design Video Sharing Platform", "question__title_slug": "design-video-sharing-platform", "question__hide": false, - "total_acs": 276, - "total_submitted": 550, + "total_acs": 279, + "total_submitted": 554, "total_column_articles": 9, "frontend_question_id": "2254", "is_new_question": false @@ -25905,8 +26367,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": 8189, - "total_submitted": 21688, + "total_acs": 8208, + "total_submitted": 21724, "total_column_articles": 140, "frontend_question_id": "2311", "is_new_question": false @@ -25926,9 +26388,9 @@ "question__title": "Count Subarrays With Score Less Than K", "question__title_slug": "count-subarrays-with-score-less-than-k", "question__hide": false, - "total_acs": 7303, - "total_submitted": 13800, - "total_column_articles": 102, + "total_acs": 7555, + "total_submitted": 14236, + "total_column_articles": 106, "frontend_question_id": "2302", "is_new_question": false }, @@ -25947,9 +26409,9 @@ "question__title": "Match Substring After Replacement", "question__title_slug": "match-substring-after-replacement", "question__hide": false, - "total_acs": 4863, - "total_submitted": 10600, - "total_column_articles": 74, + "total_acs": 4940, + "total_submitted": 10738, + "total_column_articles": 75, "frontend_question_id": "2301", "is_new_question": false }, @@ -25968,9 +26430,9 @@ "question__title": "Successful Pairs of Spells and Potions", "question__title_slug": "successful-pairs-of-spells-and-potions", "question__hide": false, - "total_acs": 40473, - "total_submitted": 90568, - "total_column_articles": 357, + "total_acs": 41296, + "total_submitted": 92269, + "total_column_articles": 363, "frontend_question_id": "2300", "is_new_question": false }, @@ -25989,8 +26451,8 @@ "question__title": "Strong Password Checker II", "question__title_slug": "strong-password-checker-ii", "question__hide": false, - "total_acs": 26661, - "total_submitted": 40793, + "total_acs": 26723, + "total_submitted": 40876, "total_column_articles": 304, "frontend_question_id": "2299", "is_new_question": false @@ -26010,8 +26472,8 @@ "question__title": "Naming a Company", "question__title_slug": "naming-a-company", "question__hide": false, - "total_acs": 5164, - "total_submitted": 11539, + "total_acs": 5177, + "total_submitted": 11564, "total_column_articles": 71, "frontend_question_id": "2306", "is_new_question": false @@ -26031,8 +26493,8 @@ "question__title": "Design a Text Editor", "question__title_slug": "design-a-text-editor", "question__hide": false, - "total_acs": 7890, - "total_submitted": 17775, + "total_acs": 7937, + "total_submitted": 17852, "total_column_articles": 127, "frontend_question_id": "2296", "is_new_question": false @@ -26052,8 +26514,8 @@ "question__title": "Replace Elements in an Array", "question__title_slug": "replace-elements-in-an-array", "question__hide": false, - "total_acs": 9855, - "total_submitted": 16951, + "total_acs": 9890, + "total_submitted": 17002, "total_column_articles": 133, "frontend_question_id": "2295", "is_new_question": false @@ -26073,9 +26535,9 @@ "question__title": "Partition Array Such That Maximum Difference Is K", "question__title_slug": "partition-array-such-that-maximum-difference-is-k", "question__hide": false, - "total_acs": 9461, - "total_submitted": 13859, - "total_column_articles": 123, + "total_acs": 9494, + "total_submitted": 13902, + "total_column_articles": 124, "frontend_question_id": "2294", "is_new_question": false }, @@ -26094,8 +26556,8 @@ "question__title": "Min Max Game", "question__title_slug": "min-max-game", "question__hide": false, - "total_acs": 30888, - "total_submitted": 42400, + "total_acs": 30958, + "total_submitted": 42489, "total_column_articles": 330, "frontend_question_id": "2293", "is_new_question": false @@ -26115,8 +26577,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": 424, - "total_submitted": 684, + "total_acs": 431, + "total_submitted": 699, "total_column_articles": 18, "frontend_question_id": "2237", "is_new_question": false @@ -26136,9 +26598,9 @@ "question__title": "Root Equals Sum of Children", "question__title_slug": "root-equals-sum-of-children", "question__hide": false, - "total_acs": 60023, - "total_submitted": 70780, - "total_column_articles": 272, + "total_acs": 61202, + "total_submitted": 72310, + "total_column_articles": 273, "frontend_question_id": "2236", "is_new_question": false }, @@ -26157,9 +26619,9 @@ "question__title": "Add Two Integers", "question__title_slug": "add-two-integers", "question__hide": false, - "total_acs": 95414, - "total_submitted": 121025, - "total_column_articles": 322, + "total_acs": 97556, + "total_submitted": 123893, + "total_column_articles": 324, "frontend_question_id": "2235", "is_new_question": false }, @@ -26178,8 +26640,8 @@ "question__title": "Dynamic Unpivoting of a Table", "question__title_slug": "dynamic-unpivoting-of-a-table", "question__hide": false, - "total_acs": 378, - "total_submitted": 548, + "total_acs": 389, + "total_submitted": 560, "total_column_articles": 6, "frontend_question_id": "2253", "is_new_question": false @@ -26199,8 +26661,8 @@ "question__title": "Dynamic Pivoting of a Table", "question__title_slug": "dynamic-pivoting-of-a-table", "question__hide": false, - "total_acs": 428, - "total_submitted": 762, + "total_acs": 440, + "total_submitted": 785, "total_column_articles": 7, "frontend_question_id": "2252", "is_new_question": false @@ -26220,8 +26682,8 @@ "question__title": "Booking Concert Tickets in Groups", "question__title_slug": "booking-concert-tickets-in-groups", "question__hide": false, - "total_acs": 3779, - "total_submitted": 15165, + "total_acs": 3846, + "total_submitted": 15362, "total_column_articles": 65, "frontend_question_id": "2286", "is_new_question": false @@ -26241,9 +26703,9 @@ "question__title": "Maximum Total Importance of Roads", "question__title_slug": "maximum-total-importance-of-roads", "question__hide": false, - "total_acs": 7160, - "total_submitted": 12377, - "total_column_articles": 99, + "total_acs": 7217, + "total_submitted": 12463, + "total_column_articles": 100, "frontend_question_id": "2285", "is_new_question": false }, @@ -26262,9 +26724,9 @@ "question__title": "Sender With Largest Word Count", "question__title_slug": "sender-with-largest-word-count", "question__hide": false, - "total_acs": 7415, - "total_submitted": 12956, - "total_column_articles": 104, + "total_acs": 7451, + "total_submitted": 13011, + "total_column_articles": 105, "frontend_question_id": "2284", "is_new_question": false }, @@ -26283,8 +26745,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": 33499, - "total_submitted": 42671, + "total_acs": 33586, + "total_submitted": 42799, "total_column_articles": 399, "frontend_question_id": "2283", "is_new_question": false @@ -26304,8 +26766,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": 1674, - "total_submitted": 2419, + "total_acs": 1712, + "total_submitted": 2461, "total_column_articles": 22, "frontend_question_id": "2238", "is_new_question": false @@ -26325,8 +26787,8 @@ "question__title": "Minimum Obstacle Removal to Reach Corner", "question__title_slug": "minimum-obstacle-removal-to-reach-corner", "question__hide": false, - "total_acs": 7543, - "total_submitted": 13183, + "total_acs": 7623, + "total_submitted": 13286, "total_column_articles": 105, "frontend_question_id": "2290", "is_new_question": false @@ -26346,8 +26808,8 @@ "question__title": "Steps to Make Array Non-decreasing", "question__title_slug": "steps-to-make-array-non-decreasing", "question__hide": false, - "total_acs": 7171, - "total_submitted": 31591, + "total_acs": 7260, + "total_submitted": 31824, "total_column_articles": 109, "frontend_question_id": "2289", "is_new_question": false @@ -26367,8 +26829,8 @@ "question__title": "Apply Discount to Prices", "question__title_slug": "apply-discount-to-prices", "question__hide": false, - "total_acs": 8952, - "total_submitted": 27935, + "total_acs": 8982, + "total_submitted": 28003, "total_column_articles": 123, "frontend_question_id": "2288", "is_new_question": false @@ -26388,8 +26850,8 @@ "question__title": "Rearrange Characters to Make Target String", "question__title_slug": "rearrange-characters-to-make-target-string", "question__hide": false, - "total_acs": 33391, - "total_submitted": 51273, + "total_acs": 33441, + "total_submitted": 51347, "total_column_articles": 435, "frontend_question_id": "2287", "is_new_question": false @@ -26409,8 +26871,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": 1565, - "total_submitted": 3197, + "total_acs": 1583, + "total_submitted": 3247, "total_column_articles": 12, "frontend_question_id": "2230", "is_new_question": false @@ -26430,8 +26892,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": 1864, - "total_submitted": 3878, + "total_acs": 1901, + "total_submitted": 3956, "total_column_articles": 28, "frontend_question_id": "2228", "is_new_question": false @@ -26451,8 +26913,8 @@ "question__title": "Maximum Sum Score of Array", "question__title_slug": "maximum-sum-score-of-array", "question__hide": false, - "total_acs": 461, - "total_submitted": 706, + "total_acs": 466, + "total_submitted": 759, "total_column_articles": 20, "frontend_question_id": "2219", "is_new_question": false @@ -26472,8 +26934,8 @@ "question__title": "Sum of Total Strength of Wizards", "question__title_slug": "sum-of-total-strength-of-wizards", "question__hide": false, - "total_acs": 4886, - "total_submitted": 17528, + "total_acs": 4937, + "total_submitted": 17695, "total_column_articles": 78, "frontend_question_id": "2281", "is_new_question": false @@ -26493,9 +26955,9 @@ "question__title": "Minimum Lines to Represent a Line Chart", "question__title_slug": "minimum-lines-to-represent-a-line-chart", "question__hide": false, - "total_acs": 10655, - "total_submitted": 45704, - "total_column_articles": 159, + "total_acs": 10727, + "total_submitted": 45888, + "total_column_articles": 161, "frontend_question_id": "2280", "is_new_question": false }, @@ -26514,8 +26976,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": 16261, - "total_submitted": 25786, + "total_acs": 16378, + "total_submitted": 25962, "total_column_articles": 164, "frontend_question_id": "2279", "is_new_question": false @@ -26535,8 +26997,8 @@ "question__title": "Percentage of Letter in String", "question__title_slug": "percentage-of-letter-in-string", "question__hide": false, - "total_acs": 17975, - "total_submitted": 22456, + "total_acs": 18107, + "total_submitted": 22609, "total_column_articles": 158, "frontend_question_id": "2278", "is_new_question": false @@ -26556,8 +27018,8 @@ "question__title": "Longest Path With Different Adjacent Characters", "question__title_slug": "longest-path-with-different-adjacent-characters", "question__hide": false, - "total_acs": 8980, - "total_submitted": 18222, + "total_acs": 9192, + "total_submitted": 18583, "total_column_articles": 86, "frontend_question_id": "2246", "is_new_question": false @@ -26577,8 +27039,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": 5111, - "total_submitted": 13899, + "total_acs": 5145, + "total_submitted": 13947, "total_column_articles": 101, "frontend_question_id": "2245", "is_new_question": false @@ -26598,9 +27060,9 @@ "question__title": "Minimum Rounds to Complete All Tasks", "question__title_slug": "minimum-rounds-to-complete-all-tasks", "question__hide": false, - "total_acs": 34146, - "total_submitted": 52156, - "total_column_articles": 336, + "total_acs": 34690, + "total_submitted": 53011, + "total_column_articles": 339, "frontend_question_id": "2244", "is_new_question": false }, @@ -26619,8 +27081,8 @@ "question__title": "Calculate Digit Sum of a String", "question__title_slug": "calculate-digit-sum-of-a-string", "question__hide": false, - "total_acs": 14120, - "total_submitted": 22261, + "total_acs": 14213, + "total_submitted": 22396, "total_column_articles": 196, "frontend_question_id": "2243", "is_new_question": false @@ -26640,8 +27102,8 @@ "question__title": "Substring With Largest Variance", "question__title_slug": "substring-with-largest-variance", "question__hide": false, - "total_acs": 4391, - "total_submitted": 11028, + "total_acs": 4409, + "total_submitted": 11068, "total_column_articles": 47, "frontend_question_id": "2272", "is_new_question": false @@ -26661,8 +27123,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": 6953, - "total_submitted": 20651, + "total_acs": 6981, + "total_submitted": 20708, "total_column_articles": 106, "frontend_question_id": "2271", "is_new_question": false @@ -26682,8 +27144,8 @@ "question__title": "Number of Ways to Split Array", "question__title_slug": "number-of-ways-to-split-array", "question__hide": false, - "total_acs": 7653, - "total_submitted": 16439, + "total_acs": 7693, + "total_submitted": 16542, "total_column_articles": 88, "frontend_question_id": "2270", "is_new_question": false @@ -26703,8 +27165,8 @@ "question__title": "Count Integers in Intervals", "question__title_slug": "count-integers-in-intervals", "question__hide": false, - "total_acs": 15981, - "total_submitted": 32424, + "total_acs": 16059, + "total_submitted": 32538, "total_column_articles": 149, "frontend_question_id": "2276", "is_new_question": false @@ -26724,8 +27186,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": 8978, - "total_submitted": 14675, + "total_acs": 9065, + "total_submitted": 14787, "total_column_articles": 110, "frontend_question_id": "2275", "is_new_question": false @@ -26745,8 +27207,8 @@ "question__title": "Maximum Consecutive Floors Without Special Floors", "question__title_slug": "maximum-consecutive-floors-without-special-floors", "question__hide": false, - "total_acs": 10730, - "total_submitted": 20441, + "total_acs": 10759, + "total_submitted": 20482, "total_column_articles": 116, "frontend_question_id": "2274", "is_new_question": false @@ -26766,8 +27228,8 @@ "question__title": "Minimum Health to Beat Game", "question__title_slug": "minimum-health-to-beat-game", "question__hide": false, - "total_acs": 806, - "total_submitted": 1531, + "total_acs": 812, + "total_submitted": 1542, "total_column_articles": 12, "frontend_question_id": "2214", "is_new_question": false @@ -26787,8 +27249,8 @@ "question__title": "Maximum Score of a Node Sequence", "question__title_slug": "maximum-score-of-a-node-sequence", "question__hide": false, - "total_acs": 3727, - "total_submitted": 10679, + "total_acs": 3747, + "total_submitted": 10741, "total_column_articles": 50, "frontend_question_id": "2242", "is_new_question": false @@ -26808,8 +27270,8 @@ "question__title": "Design an ATM Machine", "question__title_slug": "design-an-atm-machine", "question__hide": false, - "total_acs": 7708, - "total_submitted": 20644, + "total_acs": 7740, + "total_submitted": 20709, "total_column_articles": 87, "frontend_question_id": "2241", "is_new_question": false @@ -26829,8 +27291,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": 34450, - "total_submitted": 55555, + "total_acs": 34542, + "total_submitted": 55722, "total_column_articles": 282, "frontend_question_id": "2240", "is_new_question": false @@ -26850,9 +27312,9 @@ "question__title": "Find Closest Number to Zero", "question__title_slug": "find-closest-number-to-zero", "question__hide": false, - "total_acs": 14127, - "total_submitted": 26502, - "total_column_articles": 162, + "total_acs": 14202, + "total_submitted": 26627, + "total_column_articles": 163, "frontend_question_id": "2239", "is_new_question": false }, @@ -26871,9 +27333,9 @@ "question__title": " Check if There Is a Valid Parentheses String Path", "question__title_slug": "check-if-there-is-a-valid-parentheses-string-path", "question__hide": false, - "total_acs": 9129, - "total_submitted": 23378, - "total_column_articles": 143, + "total_acs": 9256, + "total_submitted": 23621, + "total_column_articles": 142, "frontend_question_id": "2267", "is_new_question": false }, @@ -26892,9 +27354,9 @@ "question__title": "Count Number of Texts", "question__title_slug": "count-number-of-texts", "question__hide": false, - "total_acs": 10063, - "total_submitted": 22488, - "total_column_articles": 161, + "total_acs": 10454, + "total_submitted": 23332, + "total_column_articles": 169, "frontend_question_id": "2266", "is_new_question": false }, @@ -26913,9 +27375,9 @@ "question__title": "Count Nodes Equal to Average of Subtree", "question__title_slug": "count-nodes-equal-to-average-of-subtree", "question__hide": false, - "total_acs": 12561, - "total_submitted": 15228, - "total_column_articles": 219, + "total_acs": 12633, + "total_submitted": 15313, + "total_column_articles": 220, "frontend_question_id": "2265", "is_new_question": false }, @@ -26934,9 +27396,9 @@ "question__title": "Largest 3-Same-Digit Number in String", "question__title_slug": "largest-3-same-digit-number-in-string", "question__hide": false, - "total_acs": 14941, - "total_submitted": 23962, - "total_column_articles": 185, + "total_acs": 15015, + "total_submitted": 24052, + "total_column_articles": 186, "frontend_question_id": "2264", "is_new_question": false }, @@ -26955,8 +27417,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": 14006, - "total_submitted": 20116, + "total_acs": 14092, + "total_submitted": 20237, "total_column_articles": 181, "frontend_question_id": "2224", "is_new_question": false @@ -26976,8 +27438,8 @@ "question__title": "Escape the Spreading Fire", "question__title_slug": "escape-the-spreading-fire", "question__hide": false, - "total_acs": 15711, - "total_submitted": 30881, + "total_acs": 15746, + "total_submitted": 30951, "total_column_articles": 167, "frontend_question_id": "2258", "is_new_question": false @@ -26997,8 +27459,8 @@ "question__title": "Count Unguarded Cells in the Grid", "question__title_slug": "count-unguarded-cells-in-the-grid", "question__hide": false, - "total_acs": 5897, - "total_submitted": 11238, + "total_acs": 5920, + "total_submitted": 11295, "total_column_articles": 115, "frontend_question_id": "2257", "is_new_question": false @@ -27018,8 +27480,8 @@ "question__title": "Minimum Average Difference", "question__title_slug": "minimum-average-difference", "question__hide": false, - "total_acs": 7888, - "total_submitted": 20993, + "total_acs": 7926, + "total_submitted": 21117, "total_column_articles": 93, "frontend_question_id": "2256", "is_new_question": false @@ -27039,9 +27501,9 @@ "question__title": "Count Prefixes of a Given String", "question__title_slug": "count-prefixes-of-a-given-string", "question__hide": false, - "total_acs": 12253, - "total_submitted": 15783, - "total_column_articles": 166, + "total_acs": 12349, + "total_submitted": 15902, + "total_column_articles": 167, "frontend_question_id": "2255", "is_new_question": false }, @@ -27060,8 +27522,8 @@ "question__title": "Total Appeal of A String", "question__title_slug": "total-appeal-of-a-string", "question__hide": false, - "total_acs": 8114, - "total_submitted": 13606, + "total_acs": 8154, + "total_submitted": 13676, "total_column_articles": 135, "frontend_question_id": "2262", "is_new_question": false @@ -27081,8 +27543,8 @@ "question__title": "K Divisible Elements Subarrays", "question__title_slug": "k-divisible-elements-subarrays", "question__hide": false, - "total_acs": 9198, - "total_submitted": 17191, + "total_acs": 9225, + "total_submitted": 17234, "total_column_articles": 140, "frontend_question_id": "2261", "is_new_question": false @@ -27102,8 +27564,8 @@ "question__title": "Minimum Consecutive Cards to Pick Up", "question__title_slug": "minimum-consecutive-cards-to-pick-up", "question__hide": false, - "total_acs": 11755, - "total_submitted": 22929, + "total_acs": 11789, + "total_submitted": 22984, "total_column_articles": 164, "frontend_question_id": "2260", "is_new_question": false @@ -27123,8 +27585,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": 14977, - "total_submitted": 29466, + "total_acs": 15064, + "total_submitted": 29597, "total_column_articles": 178, "frontend_question_id": "2259", "is_new_question": false @@ -27144,8 +27606,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": 1708, - "total_submitted": 3877, + "total_acs": 1725, + "total_submitted": 3906, "total_column_articles": 17, "frontend_question_id": "2205", "is_new_question": false @@ -27165,8 +27627,8 @@ "question__title": "Finding the Topic of Each Post", "question__title_slug": "finding-the-topic-of-each-post", "question__hide": false, - "total_acs": 1143, - "total_submitted": 1943, + "total_acs": 1159, + "total_submitted": 1974, "total_column_articles": 20, "frontend_question_id": "2199", "is_new_question": false @@ -27186,9 +27648,9 @@ "question__title": "Number of Flowers in Full Bloom", "question__title_slug": "number-of-flowers-in-full-bloom", "question__hide": false, - "total_acs": 21260, - "total_submitted": 40522, - "total_column_articles": 233, + "total_acs": 21326, + "total_submitted": 40633, + "total_column_articles": 235, "frontend_question_id": "2251", "is_new_question": false }, @@ -27207,9 +27669,9 @@ "question__title": "Count Number of Rectangles Containing Each Point", "question__title_slug": "count-number-of-rectangles-containing-each-point", "question__hide": false, - "total_acs": 7292, - "total_submitted": 20529, - "total_column_articles": 124, + "total_acs": 7330, + "total_submitted": 20584, + "total_column_articles": 127, "frontend_question_id": "2250", "is_new_question": false }, @@ -27228,9 +27690,9 @@ "question__title": "Count Lattice Points Inside a Circle", "question__title_slug": "count-lattice-points-inside-a-circle", "question__hide": false, - "total_acs": 11086, - "total_submitted": 20344, - "total_column_articles": 144, + "total_acs": 11134, + "total_submitted": 20404, + "total_column_articles": 146, "frontend_question_id": "2249", "is_new_question": false }, @@ -27249,9 +27711,9 @@ "question__title": "Intersection of Multiple Arrays", "question__title_slug": "intersection-of-multiple-arrays", "question__hide": false, - "total_acs": 18122, - "total_submitted": 27006, - "total_column_articles": 217, + "total_acs": 18215, + "total_submitted": 27144, + "total_column_articles": 219, "frontend_question_id": "2248", "is_new_question": false }, @@ -27270,8 +27732,8 @@ "question__title": "Maximum Total Beauty of the Gardens", "question__title_slug": "maximum-total-beauty-of-the-gardens", "question__hide": false, - "total_acs": 3565, - "total_submitted": 12688, + "total_acs": 3585, + "total_submitted": 12736, "total_column_articles": 76, "frontend_question_id": "2234", "is_new_question": false @@ -27291,9 +27753,9 @@ "question__title": "Maximum Product After K Increments", "question__title_slug": "maximum-product-after-k-increments", "question__hide": false, - "total_acs": 9836, - "total_submitted": 26466, - "total_column_articles": 180, + "total_acs": 9917, + "total_submitted": 26627, + "total_column_articles": 181, "frontend_question_id": "2233", "is_new_question": false }, @@ -27312,8 +27774,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": 8041, - "total_submitted": 13023, + "total_acs": 8064, + "total_submitted": 13050, "total_column_articles": 143, "frontend_question_id": "2232", "is_new_question": false @@ -27333,8 +27795,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": 13495, - "total_submitted": 20866, + "total_acs": 13588, + "total_submitted": 20987, "total_column_articles": 219, "frontend_question_id": "2231", "is_new_question": false @@ -27354,8 +27816,8 @@ "question__title": "Sum of Scores of Built Strings", "question__title_slug": "sum-of-scores-of-built-strings", "question__hide": false, - "total_acs": 4472, - "total_submitted": 11130, + "total_acs": 4509, + "total_submitted": 11207, "total_column_articles": 60, "frontend_question_id": "2223", "is_new_question": false @@ -27375,9 +27837,9 @@ "question__title": "Number of Ways to Select Buildings", "question__title_slug": "number-of-ways-to-select-buildings", "question__hide": false, - "total_acs": 7560, - "total_submitted": 14992, - "total_column_articles": 153, + "total_acs": 7657, + "total_submitted": 15155, + "total_column_articles": 154, "frontend_question_id": "2222", "is_new_question": false }, @@ -27396,9 +27858,9 @@ "question__title": "Find Triangular Sum of an Array", "question__title_slug": "find-triangular-sum-of-an-array", "question__hide": false, - "total_acs": 11133, - "total_submitted": 14120, - "total_column_articles": 130, + "total_acs": 11205, + "total_submitted": 14220, + "total_column_articles": 131, "frontend_question_id": "2221", "is_new_question": false }, @@ -27417,9 +27879,9 @@ "question__title": "Minimum Bit Flips to Convert Number", "question__title_slug": "minimum-bit-flips-to-convert-number", "question__hide": false, - "total_acs": 12529, - "total_submitted": 15178, - "total_column_articles": 172, + "total_acs": 12696, + "total_submitted": 15361, + "total_column_articles": 173, "frontend_question_id": "2220", "is_new_question": false }, @@ -27438,8 +27900,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": 503, - "total_submitted": 912, + "total_acs": 514, + "total_submitted": 938, "total_column_articles": 21, "frontend_question_id": "2184", "is_new_question": false @@ -27459,8 +27921,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": 4787, - "total_submitted": 12643, + "total_acs": 4816, + "total_submitted": 12696, "total_column_articles": 76, "frontend_question_id": "2203", "is_new_question": false @@ -27480,8 +27942,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": 13668, - "total_submitted": 24905, + "total_acs": 13728, + "total_submitted": 24987, "total_column_articles": 160, "frontend_question_id": "2200", "is_new_question": false @@ -27501,9 +27963,9 @@ "question__title": "Longest Substring of One Repeating Character", "question__title_slug": "longest-substring-of-one-repeating-character", "question__hide": false, - "total_acs": 3459, - "total_submitted": 8462, - "total_column_articles": 87, + "total_acs": 3575, + "total_submitted": 8628, + "total_column_articles": 89, "frontend_question_id": "2213", "is_new_question": false }, @@ -27522,9 +27984,9 @@ "question__title": "Maximum Points in an Archery Competition", "question__title_slug": "maximum-points-in-an-archery-competition", "question__hide": false, - "total_acs": 8197, - "total_submitted": 16904, - "total_column_articles": 169, + "total_acs": 8226, + "total_submitted": 16952, + "total_column_articles": 170, "frontend_question_id": "2212", "is_new_question": false }, @@ -27543,9 +28005,9 @@ "question__title": "Count Collisions on a Road", "question__title_slug": "count-collisions-on-a-road", "question__hide": false, - "total_acs": 10965, - "total_submitted": 26233, - "total_column_articles": 157, + "total_acs": 11030, + "total_submitted": 26367, + "total_column_articles": 159, "frontend_question_id": "2211", "is_new_question": false }, @@ -27564,9 +28026,9 @@ "question__title": "Count Hills and Valleys in an Array", "question__title_slug": "count-hills-and-valleys-in-an-array", "question__hide": false, - "total_acs": 13607, - "total_submitted": 23046, - "total_column_articles": 188, + "total_acs": 13657, + "total_submitted": 23118, + "total_column_articles": 187, "frontend_question_id": "2210", "is_new_question": false }, @@ -27585,8 +28047,8 @@ "question__title": "The Change in Global Rankings", "question__title_slug": "the-change-in-global-rankings", "question__hide": false, - "total_acs": 1624, - "total_submitted": 3028, + "total_acs": 1652, + "total_submitted": 3066, "total_column_articles": 22, "frontend_question_id": "2175", "is_new_question": false @@ -27606,8 +28068,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": 282, - "total_submitted": 434, + "total_acs": 283, + "total_submitted": 436, "total_column_articles": 13, "frontend_question_id": "2174", "is_new_question": false @@ -27627,9 +28089,9 @@ "question__title": "Longest Winning Streak", "question__title_slug": "longest-winning-streak", "question__hide": false, - "total_acs": 1858, - "total_submitted": 3511, - "total_column_articles": 41, + "total_acs": 1892, + "total_submitted": 3565, + "total_column_articles": 43, "frontend_question_id": "2173", "is_new_question": false }, @@ -27648,8 +28110,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": 10892, - "total_submitted": 18446, + "total_acs": 10960, + "total_submitted": 18552, "total_column_articles": 135, "frontend_question_id": "2190", "is_new_question": false @@ -27669,8 +28131,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": 5241, - "total_submitted": 13057, + "total_acs": 5283, + "total_submitted": 13120, "total_column_articles": 59, "frontend_question_id": "2209", "is_new_question": false @@ -27690,9 +28152,9 @@ "question__title": "Minimum Operations to Halve Array Sum", "question__title_slug": "minimum-operations-to-halve-array-sum", "question__hide": false, - "total_acs": 29765, - "total_submitted": 64603, - "total_column_articles": 291, + "total_acs": 29963, + "total_submitted": 64973, + "total_column_articles": 294, "frontend_question_id": "2208", "is_new_question": false }, @@ -27711,9 +28173,9 @@ "question__title": "Maximize Number of Subsequences in a String", "question__title_slug": "maximize-number-of-subsequences-in-a-string", "question__hide": false, - "total_acs": 7650, - "total_submitted": 23728, - "total_column_articles": 117, + "total_acs": 7693, + "total_submitted": 23834, + "total_column_articles": 118, "frontend_question_id": "2207", "is_new_question": false }, @@ -27732,9 +28194,9 @@ "question__title": "Divide Array Into Equal Pairs", "question__title_slug": "divide-array-into-equal-pairs", "question__hide": false, - "total_acs": 16843, - "total_submitted": 23090, - "total_column_articles": 194, + "total_acs": 16992, + "total_submitted": 23296, + "total_column_articles": 195, "frontend_question_id": "2206", "is_new_question": false }, @@ -27753,9 +28215,9 @@ "question__title": "Replace Non-Coprime Numbers in Array", "question__title_slug": "replace-non-coprime-numbers-in-array", "question__hide": false, - "total_acs": 6152, - "total_submitted": 17494, - "total_column_articles": 93, + "total_acs": 6186, + "total_submitted": 17583, + "total_column_articles": 94, "frontend_question_id": "2197", "is_new_question": false }, @@ -27774,9 +28236,9 @@ "question__title": "Create Binary Tree From Descriptions", "question__title_slug": "create-binary-tree-from-descriptions", "question__hide": false, - "total_acs": 10515, - "total_submitted": 14477, - "total_column_articles": 171, + "total_acs": 10574, + "total_submitted": 14548, + "total_column_articles": 172, "frontend_question_id": "2196", "is_new_question": false }, @@ -27795,9 +28257,9 @@ "question__title": "Append K Integers With Minimal Sum", "question__title_slug": "append-k-integers-with-minimal-sum", "question__hide": false, - "total_acs": 12600, - "total_submitted": 51276, - "total_column_articles": 236, + "total_acs": 12681, + "total_submitted": 51530, + "total_column_articles": 237, "frontend_question_id": "2195", "is_new_question": false }, @@ -27816,9 +28278,9 @@ "question__title": "Cells in a Range on an Excel Sheet", "question__title_slug": "cells-in-a-range-on-an-excel-sheet", "question__hide": false, - "total_acs": 15759, - "total_submitted": 18721, - "total_column_articles": 166, + "total_acs": 15844, + "total_submitted": 18822, + "total_column_articles": 167, "frontend_question_id": "2194", "is_new_question": false }, @@ -27837,8 +28299,8 @@ "question__title": "Unique Substrings With Equal Digit Frequency", "question__title_slug": "unique-substrings-with-equal-digit-frequency", "question__hide": false, - "total_acs": 631, - "total_submitted": 1007, + "total_acs": 633, + "total_submitted": 1011, "total_column_articles": 18, "frontend_question_id": "2168", "is_new_question": false @@ -27858,8 +28320,8 @@ "question__title": "Order Two Columns Independently", "question__title_slug": "order-two-columns-independently", "question__hide": false, - "total_acs": 1809, - "total_submitted": 2923, + "total_acs": 1833, + "total_submitted": 2971, "total_column_articles": 14, "frontend_question_id": "2159", "is_new_question": false @@ -27879,9 +28341,9 @@ "question__title": "Count Array Pairs Divisible by K", "question__title_slug": "count-array-pairs-divisible-by-k", "question__hide": false, - "total_acs": 5444, - "total_submitted": 18801, - "total_column_articles": 62, + "total_acs": 5514, + "total_submitted": 18914, + "total_column_articles": 63, "frontend_question_id": "2183", "is_new_question": false }, @@ -27900,9 +28362,9 @@ "question__title": "Construct String With Repeat Limit", "question__title_slug": "construct-string-with-repeat-limit", "question__hide": false, - "total_acs": 22505, - "total_submitted": 37244, - "total_column_articles": 322, + "total_acs": 22694, + "total_submitted": 37568, + "total_column_articles": 326, "frontend_question_id": "2182", "is_new_question": false }, @@ -27921,9 +28383,9 @@ "question__title": "Merge Nodes in Between Zeros", "question__title_slug": "merge-nodes-in-between-zeros", "question__hide": false, - "total_acs": 17310, - "total_submitted": 20683, - "total_column_articles": 237, + "total_acs": 17405, + "total_submitted": 20787, + "total_column_articles": 238, "frontend_question_id": "2181", "is_new_question": false }, @@ -27942,8 +28404,8 @@ "question__title": "Count Integers With Even Digit Sum", "question__title_slug": "count-integers-with-even-digit-sum", "question__hide": false, - "total_acs": 36746, - "total_submitted": 54327, + "total_acs": 36820, + "total_submitted": 54444, "total_column_articles": 406, "frontend_question_id": "2180", "is_new_question": false @@ -27963,8 +28425,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": 765, - "total_submitted": 1451, + "total_acs": 774, + "total_submitted": 1461, "total_column_articles": 24, "frontend_question_id": "2158", "is_new_question": false @@ -27984,9 +28446,9 @@ "question__title": "The Number of Passengers in Each Bus II", "question__title_slug": "the-number-of-passengers-in-each-bus-ii", "question__hide": false, - "total_acs": 940, - "total_submitted": 2157, - "total_column_articles": 16, + "total_acs": 962, + "total_submitted": 2192, + "total_column_articles": 17, "frontend_question_id": "2153", "is_new_question": false }, @@ -28005,8 +28467,8 @@ "question__title": "Minimum Time to Finish the Race", "question__title_slug": "minimum-time-to-finish-the-race", "question__hide": false, - "total_acs": 4925, - "total_submitted": 11192, + "total_acs": 4946, + "total_submitted": 11231, "total_column_articles": 75, "frontend_question_id": "2188", "is_new_question": false @@ -28026,9 +28488,9 @@ "question__title": "Minimum Time to Complete Trips", "question__title_slug": "minimum-time-to-complete-trips", "question__hide": false, - "total_acs": 16810, - "total_submitted": 55375, - "total_column_articles": 182, + "total_acs": 17135, + "total_submitted": 56142, + "total_column_articles": 186, "frontend_question_id": "2187", "is_new_question": false }, @@ -28047,8 +28509,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": 11526, - "total_submitted": 15905, + "total_acs": 11558, + "total_submitted": 15948, "total_column_articles": 133, "frontend_question_id": "2186", "is_new_question": false @@ -28068,9 +28530,9 @@ "question__title": "Counting Words With a Given Prefix", "question__title_slug": "counting-words-with-a-given-prefix", "question__hide": false, - "total_acs": 39525, - "total_submitted": 48544, - "total_column_articles": 411, + "total_acs": 39665, + "total_submitted": 48706, + "total_column_articles": 412, "frontend_question_id": "2185", "is_new_question": false }, @@ -28089,9 +28551,9 @@ "question__title": "Maximum AND Sum of Array", "question__title_slug": "maximum-and-sum-of-array", "question__hide": false, - "total_acs": 5600, - "total_submitted": 10728, - "total_column_articles": 91, + "total_acs": 5694, + "total_submitted": 10887, + "total_column_articles": 92, "frontend_question_id": "2172", "is_new_question": false }, @@ -28110,8 +28572,8 @@ "question__title": "Removing Minimum Number of Magic Beans", "question__title_slug": "removing-minimum-number-of-magic-beans", "question__hide": false, - "total_acs": 29540, - "total_submitted": 61273, + "total_acs": 29712, + "total_submitted": 61618, "total_column_articles": 390, "frontend_question_id": "2171", "is_new_question": false @@ -28131,8 +28593,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": 10270, - "total_submitted": 32566, + "total_acs": 10305, + "total_submitted": 32647, "total_column_articles": 168, "frontend_question_id": "2170", "is_new_question": false @@ -28152,9 +28614,9 @@ "question__title": "Count Operations to Obtain Zero", "question__title_slug": "count-operations-to-obtain-zero", "question__hide": false, - "total_acs": 20171, - "total_submitted": 27587, - "total_column_articles": 168, + "total_acs": 20296, + "total_submitted": 27755, + "total_column_articles": 170, "frontend_question_id": "2169", "is_new_question": false }, @@ -28173,8 +28635,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": 522, - "total_submitted": 1016, + "total_acs": 524, + "total_submitted": 1019, "total_column_articles": 20, "frontend_question_id": "2152", "is_new_question": false @@ -28194,8 +28656,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": 5436, - "total_submitted": 10981, + "total_acs": 5470, + "total_submitted": 11049, "total_column_articles": 89, "frontend_question_id": "2167", "is_new_question": false @@ -28215,8 +28677,8 @@ "question__title": "Design Bitset", "question__title_slug": "design-bitset", "question__hide": false, - "total_acs": 7348, - "total_submitted": 23271, + "total_acs": 7459, + "total_submitted": 23532, "total_column_articles": 169, "frontend_question_id": "2166", "is_new_question": false @@ -28236,9 +28698,9 @@ "question__title": "Smallest Value of the Rearranged Number", "question__title_slug": "smallest-value-of-the-rearranged-number", "question__hide": false, - "total_acs": 9134, - "total_submitted": 16499, - "total_column_articles": 144, + "total_acs": 9185, + "total_submitted": 16584, + "total_column_articles": 145, "frontend_question_id": "2165", "is_new_question": false }, @@ -28257,8 +28719,8 @@ "question__title": "Sort Even and Odd Indices Independently", "question__title_slug": "sort-even-and-odd-indices-independently", "question__hide": false, - "total_acs": 13157, - "total_submitted": 19461, + "total_acs": 13254, + "total_submitted": 19623, "total_column_articles": 163, "frontend_question_id": "2164", "is_new_question": false @@ -28278,8 +28740,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": 308, - "total_submitted": 595, + "total_acs": 311, + "total_submitted": 599, "total_column_articles": 15, "frontend_question_id": "2143", "is_new_question": false @@ -28299,9 +28761,9 @@ "question__title": "The Number of Passengers in Each Bus I", "question__title_slug": "the-number-of-passengers-in-each-bus-i", "question__hide": false, - "total_acs": 1933, - "total_submitted": 4225, - "total_column_articles": 30, + "total_acs": 1977, + "total_submitted": 4303, + "total_column_articles": 33, "frontend_question_id": "2142", "is_new_question": false }, @@ -28320,8 +28782,8 @@ "question__title": "Count Good Triplets in an Array", "question__title_slug": "count-good-triplets-in-an-array", "question__hide": false, - "total_acs": 3862, - "total_submitted": 10064, + "total_acs": 3907, + "total_submitted": 10139, "total_column_articles": 85, "frontend_question_id": "2179", "is_new_question": false @@ -28341,8 +28803,8 @@ "question__title": "Maximum Split of Positive Even Integers", "question__title_slug": "maximum-split-of-positive-even-integers", "question__hide": false, - "total_acs": 29719, - "total_submitted": 46375, + "total_acs": 29761, + "total_submitted": 46441, "total_column_articles": 332, "frontend_question_id": "2178", "is_new_question": false @@ -28362,8 +28824,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": 10312, - "total_submitted": 14615, + "total_acs": 10382, + "total_submitted": 14704, "total_column_articles": 109, "frontend_question_id": "2177", "is_new_question": false @@ -28383,9 +28845,9 @@ "question__title": "Count Equal and Divisible Pairs in an Array", "question__title_slug": "count-equal-and-divisible-pairs-in-an-array", "question__hide": false, - "total_acs": 12794, - "total_submitted": 16253, - "total_column_articles": 132, + "total_acs": 12925, + "total_submitted": 16419, + "total_column_articles": 134, "frontend_question_id": "2176", "is_new_question": false }, @@ -28404,9 +28866,9 @@ "question__title": "Groups of Strings", "question__title_slug": "groups-of-strings", "question__hide": false, - "total_acs": 3921, - "total_submitted": 12456, - "total_column_articles": 83, + "total_acs": 3942, + "total_submitted": 12501, + "total_column_articles": 84, "frontend_question_id": "2157", "is_new_question": false }, @@ -28425,9 +28887,9 @@ "question__title": "Find Substring With Given Hash Value", "question__title_slug": "find-substring-with-given-hash-value", "question__hide": false, - "total_acs": 6979, - "total_submitted": 26164, - "total_column_articles": 112, + "total_acs": 7162, + "total_submitted": 26564, + "total_column_articles": 111, "frontend_question_id": "2156", "is_new_question": false }, @@ -28446,9 +28908,9 @@ "question__title": "Keep Multiplying Found Values by Two", "question__title_slug": "keep-multiplying-found-values-by-two", "question__hide": false, - "total_acs": 19755, - "total_submitted": 27045, - "total_column_articles": 216, + "total_acs": 19932, + "total_submitted": 27286, + "total_column_articles": 218, "frontend_question_id": "2154", "is_new_question": false }, @@ -28467,8 +28929,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": 537, - "total_submitted": 890, + "total_acs": 543, + "total_submitted": 897, "total_column_articles": 16, "frontend_question_id": "2137", "is_new_question": false @@ -28488,8 +28950,8 @@ "question__title": "Maximum Good People Based on Statements", "question__title_slug": "maximum-good-people-based-on-statements", "question__hide": false, - "total_acs": 5910, - "total_submitted": 11561, + "total_acs": 5969, + "total_submitted": 11659, "total_column_articles": 103, "frontend_question_id": "2151", "is_new_question": false @@ -28509,9 +28971,9 @@ "question__title": "Rearrange Array Elements by Sign", "question__title_slug": "rearrange-array-elements-by-sign", "question__hide": false, - "total_acs": 13680, - "total_submitted": 17215, - "total_column_articles": 146, + "total_acs": 13765, + "total_submitted": 17317, + "total_column_articles": 148, "frontend_question_id": "2149", "is_new_question": false }, @@ -28530,9 +28992,9 @@ "question__title": "Find All Lonely Numbers in the Array", "question__title_slug": "find-all-lonely-numbers-in-the-array", "question__hide": false, - "total_acs": 10816, - "total_submitted": 18238, - "total_column_articles": 126, + "total_acs": 10874, + "total_submitted": 18321, + "total_column_articles": 127, "frontend_question_id": "2150", "is_new_question": false }, @@ -28551,9 +29013,9 @@ "question__title": "Count Elements With Strictly Smaller and Greater Elements ", "question__title_slug": "count-elements-with-strictly-smaller-and-greater-elements", "question__hide": false, - "total_acs": 15875, - "total_submitted": 27816, - "total_column_articles": 197, + "total_acs": 16015, + "total_submitted": 28066, + "total_column_articles": 199, "frontend_question_id": "2148", "is_new_question": false }, @@ -28572,9 +29034,9 @@ "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": 664, - "total_submitted": 905, - "total_column_articles": 18, + "total_acs": 666, + "total_submitted": 924, + "total_column_articles": 19, "frontend_question_id": "2128", "is_new_question": false }, @@ -28593,8 +29055,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": 3688, - "total_submitted": 7536, + "total_acs": 3704, + "total_submitted": 7564, "total_column_articles": 68, "frontend_question_id": "2163", "is_new_question": false @@ -28614,8 +29076,8 @@ "question__title": "Minimum Cost to Set Cooking Time", "question__title_slug": "minimum-cost-to-set-cooking-time", "question__hide": false, - "total_acs": 3825, - "total_submitted": 10887, + "total_acs": 3839, + "total_submitted": 10913, "total_column_articles": 83, "frontend_question_id": "2162", "is_new_question": false @@ -28635,9 +29097,9 @@ "question__title": "Partition Array According to Given Pivot", "question__title_slug": "partition-array-according-to-given-pivot", "question__hide": false, - "total_acs": 9706, - "total_submitted": 11885, - "total_column_articles": 132, + "total_acs": 9762, + "total_submitted": 11985, + "total_column_articles": 133, "frontend_question_id": "2161", "is_new_question": false }, @@ -28656,9 +29118,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": 17519, - "total_submitted": 21002, - "total_column_articles": 255, + "total_acs": 17695, + "total_submitted": 21210, + "total_column_articles": 256, "frontend_question_id": "2160", "is_new_question": false }, @@ -28677,9 +29139,9 @@ "question__title": "Maximum Running Time of N Computers", "question__title_slug": "maximum-running-time-of-n-computers", "question__hide": false, - "total_acs": 7246, - "total_submitted": 17373, - "total_column_articles": 87, + "total_acs": 7347, + "total_submitted": 17595, + "total_column_articles": 89, "frontend_question_id": "2141", "is_new_question": false }, @@ -28698,9 +29160,9 @@ "question__title": "Solving Questions With Brainpower", "question__title_slug": "solving-questions-with-brainpower", "question__hide": false, - "total_acs": 14939, - "total_submitted": 33558, - "total_column_articles": 207, + "total_acs": 15218, + "total_submitted": 34126, + "total_column_articles": 210, "frontend_question_id": "2140", "is_new_question": false }, @@ -28719,8 +29181,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": 8987, - "total_submitted": 13926, + "total_acs": 9043, + "total_submitted": 13992, "total_column_articles": 124, "frontend_question_id": "2155", "is_new_question": false @@ -28740,9 +29202,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": 12097, - "total_submitted": 18135, - "total_column_articles": 177, + "total_acs": 12165, + "total_submitted": 18222, + "total_column_articles": 178, "frontend_question_id": "2138", "is_new_question": false }, @@ -28761,8 +29223,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": 365, - "total_submitted": 744, + "total_acs": 368, + "total_submitted": 751, "total_column_articles": 8, "frontend_question_id": "2123", "is_new_question": false @@ -28782,8 +29244,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": 382, - "total_submitted": 697, + "total_acs": 389, + "total_submitted": 704, "total_column_articles": 16, "frontend_question_id": "2113", "is_new_question": false @@ -28803,8 +29265,8 @@ "question__title": "Earliest Possible Day of Full Bloom", "question__title_slug": "earliest-possible-day-of-full-bloom", "question__hide": false, - "total_acs": 15002, - "total_submitted": 20964, + "total_acs": 15037, + "total_submitted": 21014, "total_column_articles": 157, "frontend_question_id": "2136", "is_new_question": false @@ -28824,8 +29286,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": 5985, - "total_submitted": 16307, + "total_acs": 6001, + "total_submitted": 16340, "total_column_articles": 106, "frontend_question_id": "2135", "is_new_question": false @@ -28845,9 +29307,9 @@ "question__title": "Minimum Swaps to Group All 1's Together II", "question__title_slug": "minimum-swaps-to-group-all-1s-together-ii", "question__hide": false, - "total_acs": 9925, - "total_submitted": 19314, - "total_column_articles": 208, + "total_acs": 10232, + "total_submitted": 19777, + "total_column_articles": 215, "frontend_question_id": "2134", "is_new_question": false }, @@ -28866,8 +29328,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": 12523, - "total_submitted": 22372, + "total_acs": 12608, + "total_submitted": 22504, "total_column_articles": 177, "frontend_question_id": "2133", "is_new_question": false @@ -28887,8 +29349,8 @@ "question__title": "Build the Equation", "question__title_slug": "build-the-equation", "question__hide": false, - "total_acs": 1122, - "total_submitted": 2005, + "total_acs": 1135, + "total_submitted": 2029, "total_column_articles": 18, "frontend_question_id": "2118", "is_new_question": false @@ -28908,8 +29370,8 @@ "question__title": "The Airport With the Most Traffic", "question__title_slug": "the-airport-with-the-most-traffic", "question__hide": false, - "total_acs": 1981, - "total_submitted": 2989, + "total_acs": 2012, + "total_submitted": 3033, "total_column_articles": 29, "frontend_question_id": "2112", "is_new_question": false @@ -28929,8 +29391,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": 4724, - "total_submitted": 11124, + "total_acs": 4774, + "total_submitted": 11236, "total_column_articles": 98, "frontend_question_id": "2147", "is_new_question": false @@ -28950,9 +29412,9 @@ "question__title": "K Highest Ranked Items Within a Price Range", "question__title_slug": "k-highest-ranked-items-within-a-price-range", "question__hide": false, - "total_acs": 5024, - "total_submitted": 12198, - "total_column_articles": 102, + "total_acs": 5076, + "total_submitted": 12319, + "total_column_articles": 104, "frontend_question_id": "2146", "is_new_question": false }, @@ -28971,9 +29433,9 @@ "question__title": "Count the Hidden Sequences", "question__title_slug": "count-the-hidden-sequences", "question__hide": false, - "total_acs": 6231, - "total_submitted": 17062, - "total_column_articles": 126, + "total_acs": 6271, + "total_submitted": 17154, + "total_column_articles": 127, "frontend_question_id": "2145", "is_new_question": false }, @@ -28992,9 +29454,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": 12683, - "total_submitted": 19005, - "total_column_articles": 209, + "total_acs": 12799, + "total_submitted": 19169, + "total_column_articles": 210, "frontend_question_id": "2144", "is_new_question": false }, @@ -29013,9 +29475,9 @@ "question__title": "Number of Unique Flavors After Sharing K Candies", "question__title_slug": "number-of-unique-flavors-after-sharing-k-candies", "question__hide": false, - "total_acs": 653, - "total_submitted": 1626, - "total_column_articles": 16, + "total_acs": 679, + "total_submitted": 1659, + "total_column_articles": 17, "frontend_question_id": "2107", "is_new_question": false }, @@ -29034,8 +29496,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": 16115, - "total_submitted": 30536, + "total_acs": 16190, + "total_submitted": 30670, "total_column_articles": 121, "frontend_question_id": "2127", "is_new_question": false @@ -29055,8 +29517,8 @@ "question__title": "Destroying Asteroids", "question__title_slug": "destroying-asteroids", "question__hide": false, - "total_acs": 10195, - "total_submitted": 20663, + "total_acs": 10251, + "total_submitted": 20773, "total_column_articles": 121, "frontend_question_id": "2126", "is_new_question": false @@ -29076,9 +29538,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": 11734, - "total_submitted": 14315, - "total_column_articles": 143, + "total_acs": 11864, + "total_submitted": 14482, + "total_column_articles": 145, "frontend_question_id": "2125", "is_new_question": false }, @@ -29097,9 +29559,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": 15617, - "total_submitted": 22709, - "total_column_articles": 263, + "total_acs": 15738, + "total_submitted": 22869, + "total_column_articles": 264, "frontend_question_id": "2124", "is_new_question": false }, @@ -29118,8 +29580,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": 450, - "total_submitted": 1323, + "total_acs": 461, + "total_submitted": 1366, "total_column_articles": 14, "frontend_question_id": "2098", "is_new_question": false @@ -29139,8 +29601,8 @@ "question__title": "Recover the Original Array", "question__title_slug": "recover-the-original-array", "question__hide": false, - "total_acs": 4451, - "total_submitted": 10448, + "total_acs": 4472, + "total_submitted": 10509, "total_column_articles": 71, "frontend_question_id": "2122", "is_new_question": false @@ -29160,8 +29622,8 @@ "question__title": "Intervals Between Identical Elements", "question__title_slug": "intervals-between-identical-elements", "question__hide": false, - "total_acs": 7453, - "total_submitted": 18975, + "total_acs": 7486, + "total_submitted": 19032, "total_column_articles": 169, "frontend_question_id": "2121", "is_new_question": false @@ -29181,8 +29643,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": 9007, - "total_submitted": 10942, + "total_acs": 9062, + "total_submitted": 11004, "total_column_articles": 128, "frontend_question_id": "2120", "is_new_question": false @@ -29202,9 +29664,9 @@ "question__title": "A Number After a Double Reversal", "question__title_slug": "a-number-after-a-double-reversal", "question__hide": false, - "total_acs": 24914, - "total_submitted": 33735, - "total_column_articles": 247, + "total_acs": 25205, + "total_submitted": 34077, + "total_column_articles": 252, "frontend_question_id": "2119", "is_new_question": false }, @@ -29223,8 +29685,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": 10991, - "total_submitted": 25566, + "total_acs": 11033, + "total_submitted": 25638, "total_column_articles": 161, "frontend_question_id": "2131", "is_new_question": false @@ -29244,9 +29706,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": 23165, - "total_submitted": 29658, - "total_column_articles": 298, + "total_acs": 23564, + "total_submitted": 30150, + "total_column_articles": 299, "frontend_question_id": "2130", "is_new_question": false }, @@ -29265,9 +29727,9 @@ "question__title": "Capitalize the Title", "question__title_slug": "capitalize-the-title", "question__hide": false, - "total_acs": 34929, - "total_submitted": 49428, - "total_column_articles": 336, + "total_acs": 35078, + "total_submitted": 49627, + "total_column_articles": 337, "frontend_question_id": "2129", "is_new_question": false }, @@ -29286,9 +29748,9 @@ "question__title": "Minimum Operations to Make the Array K-Increasing", "question__title_slug": "minimum-operations-to-make-the-array-k-increasing", "question__hide": false, - "total_acs": 5256, - "total_submitted": 14560, - "total_column_articles": 102, + "total_acs": 5360, + "total_submitted": 14725, + "total_column_articles": 103, "frontend_question_id": "2111", "is_new_question": false }, @@ -29307,9 +29769,9 @@ "question__title": "Number of Smooth Descent Periods of a Stock", "question__title_slug": "number-of-smooth-descent-periods-of-a-stock", "question__hide": false, - "total_acs": 11940, - "total_submitted": 22173, - "total_column_articles": 186, + "total_acs": 12046, + "total_submitted": 22319, + "total_column_articles": 190, "frontend_question_id": "2110", "is_new_question": false }, @@ -29328,9 +29790,9 @@ "question__title": "Adding Spaces to a String", "question__title_slug": "adding-spaces-to-a-string", "question__hide": false, - "total_acs": 11526, - "total_submitted": 18777, - "total_column_articles": 132, + "total_acs": 11589, + "total_submitted": 18863, + "total_column_articles": 133, "frontend_question_id": "2109", "is_new_question": false }, @@ -29349,9 +29811,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": 16949, - "total_submitted": 21740, - "total_column_articles": 235, + "total_acs": 17089, + "total_submitted": 21922, + "total_column_articles": 236, "frontend_question_id": "2108", "is_new_question": false }, @@ -29370,8 +29832,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": 720, - "total_submitted": 1263, + "total_acs": 741, + "total_submitted": 1310, "total_column_articles": 27, "frontend_question_id": "2093", "is_new_question": false @@ -29391,9 +29853,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": 18541, - "total_submitted": 41210, - "total_column_articles": 210, + "total_acs": 18641, + "total_submitted": 41437, + "total_column_articles": 211, "frontend_question_id": "2106", "is_new_question": false }, @@ -29412,8 +29874,8 @@ "question__title": "Watering Plants II", "question__title_slug": "watering-plants-ii", "question__hide": false, - "total_acs": 27868, - "total_submitted": 50831, + "total_acs": 28082, + "total_submitted": 51214, "total_column_articles": 289, "frontend_question_id": "2105", "is_new_question": false @@ -29433,9 +29895,9 @@ "question__title": "Sum of Subarray Ranges", "question__title_slug": "sum-of-subarray-ranges", "question__hide": false, - "total_acs": 43929, - "total_submitted": 69482, - "total_column_articles": 414, + "total_acs": 44039, + "total_submitted": 69646, + "total_column_articles": 416, "frontend_question_id": "2104", "is_new_question": false }, @@ -29454,9 +29916,9 @@ "question__title": "Rings and Rods", "question__title_slug": "rings-and-rods", "question__hide": false, - "total_acs": 36973, - "total_submitted": 45216, - "total_column_articles": 462, + "total_acs": 37044, + "total_submitted": 45305, + "total_column_articles": 463, "frontend_question_id": "2103", "is_new_question": false }, @@ -29475,8 +29937,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": 597, - "total_submitted": 979, + "total_acs": 603, + "total_submitted": 999, "total_column_articles": 19, "frontend_question_id": "2083", "is_new_question": false @@ -29496,9 +29958,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": 2850, - "total_submitted": 3528, - "total_column_articles": 55, + "total_acs": 2886, + "total_submitted": 3568, + "total_column_articles": 57, "frontend_question_id": "2084", "is_new_question": false }, @@ -29517,8 +29979,8 @@ "question__title": "The Number of Rich Customers", "question__title_slug": "the-number-of-rich-customers", "question__hide": false, - "total_acs": 6160, - "total_submitted": 8230, + "total_acs": 6200, + "total_submitted": 8279, "total_column_articles": 44, "frontend_question_id": "2082", "is_new_question": false @@ -29538,8 +30000,8 @@ "question__title": "Abbreviating the Product of a Range", "question__title_slug": "abbreviating-the-product-of-a-range", "question__hide": false, - "total_acs": 1752, - "total_submitted": 5856, + "total_acs": 1767, + "total_submitted": 5913, "total_column_articles": 30, "frontend_question_id": "2117", "is_new_question": false @@ -29559,8 +30021,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": 4730, - "total_submitted": 14837, + "total_acs": 4790, + "total_submitted": 14980, "total_column_articles": 76, "frontend_question_id": "2116", "is_new_question": false @@ -29580,9 +30042,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": 7382, - "total_submitted": 16626, - "total_column_articles": 133, + "total_acs": 7488, + "total_submitted": 16768, + "total_column_articles": 134, "frontend_question_id": "2115", "is_new_question": false }, @@ -29601,9 +30063,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": 22897, - "total_submitted": 27180, - "total_column_articles": 293, + "total_acs": 23081, + "total_submitted": 27384, + "total_column_articles": 294, "frontend_question_id": "2114", "is_new_question": false }, @@ -29622,8 +30084,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": 338, - "total_submitted": 585, + "total_acs": 339, + "total_submitted": 587, "total_column_articles": 13, "frontend_question_id": "2077", "is_new_question": false @@ -29643,9 +30105,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": 9483, - "total_submitted": 20894, - "total_column_articles": 235, + "total_acs": 9570, + "total_submitted": 21043, + "total_column_articles": 238, "frontend_question_id": "2096", "is_new_question": false }, @@ -29664,9 +30126,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": 34061, - "total_submitted": 58502, - "total_column_articles": 329, + "total_acs": 34651, + "total_submitted": 59422, + "total_column_articles": 331, "frontend_question_id": "2095", "is_new_question": false }, @@ -29685,9 +30147,9 @@ "question__title": "Finding 3-Digit Even Numbers", "question__title_slug": "finding-3-digit-even-numbers", "question__hide": false, - "total_acs": 14098, - "total_submitted": 24899, - "total_column_articles": 207, + "total_acs": 14190, + "total_submitted": 25016, + "total_column_articles": 208, "frontend_question_id": "2094", "is_new_question": false }, @@ -29706,8 +30168,8 @@ "question__title": "The Winner University", "question__title_slug": "the-winner-university", "question__hide": false, - "total_acs": 3134, - "total_submitted": 4560, + "total_acs": 3154, + "total_submitted": 4589, "total_column_articles": 37, "frontend_question_id": "2072", "is_new_question": false @@ -29727,8 +30189,8 @@ "question__title": "Find All People With Secret", "question__title_slug": "find-all-people-with-secret", "question__hide": false, - "total_acs": 7624, - "total_submitted": 24837, + "total_acs": 7755, + "total_submitted": 25191, "total_column_articles": 139, "frontend_question_id": "2092", "is_new_question": false @@ -29748,9 +30210,9 @@ "question__title": "Removing Minimum and Maximum From Array", "question__title_slug": "removing-minimum-and-maximum-from-array", "question__hide": false, - "total_acs": 9610, - "total_submitted": 17009, - "total_column_articles": 158, + "total_acs": 9675, + "total_submitted": 17113, + "total_column_articles": 159, "frontend_question_id": "2091", "is_new_question": false }, @@ -29769,9 +30231,9 @@ "question__title": "K Radius Subarray Averages", "question__title_slug": "k-radius-subarray-averages", "question__hide": false, - "total_acs": 10155, - "total_submitted": 25889, - "total_column_articles": 141, + "total_acs": 10494, + "total_submitted": 26544, + "total_column_articles": 144, "frontend_question_id": "2090", "is_new_question": false }, @@ -29790,9 +30252,9 @@ "question__title": "Find Target Indices After Sorting Array", "question__title_slug": "find-target-indices-after-sorting-array", "question__hide": false, - "total_acs": 22331, - "total_submitted": 28905, - "total_column_articles": 276, + "total_acs": 22527, + "total_submitted": 29170, + "total_column_articles": 279, "frontend_question_id": "2089", "is_new_question": false }, @@ -29811,9 +30273,9 @@ "question__title": "Number of Equal Count Substrings", "question__title_slug": "number-of-equal-count-substrings", "question__hide": false, - "total_acs": 416, - "total_submitted": 801, - "total_column_articles": 16, + "total_acs": 432, + "total_submitted": 834, + "total_column_articles": 17, "frontend_question_id": "2067", "is_new_question": false }, @@ -29832,8 +30294,8 @@ "question__title": "Account Balance", "question__title_slug": "account-balance", "question__hide": false, - "total_acs": 2595, - "total_submitted": 3255, + "total_acs": 2630, + "total_submitted": 3299, "total_column_articles": 37, "frontend_question_id": "2066", "is_new_question": false @@ -29853,8 +30315,8 @@ "question__title": "Sequentially Ordinal Rank Tracker", "question__title_slug": "sequentially-ordinal-rank-tracker", "question__hide": false, - "total_acs": 3735, - "total_submitted": 6730, + "total_acs": 3751, + "total_submitted": 6766, "total_column_articles": 92, "frontend_question_id": "2102", "is_new_question": false @@ -29874,8 +30336,8 @@ "question__title": "Detonate the Maximum Bombs", "question__title_slug": "detonate-the-maximum-bombs", "question__hide": false, - "total_acs": 7527, - "total_submitted": 18465, + "total_acs": 7666, + "total_submitted": 18741, "total_column_articles": 124, "frontend_question_id": "2101", "is_new_question": false @@ -29895,9 +30357,9 @@ "question__title": "Find Good Days to Rob the Bank", "question__title_slug": "find-good-days-to-rob-the-bank", "question__hide": false, - "total_acs": 35475, - "total_submitted": 72907, - "total_column_articles": 447, + "total_acs": 35526, + "total_submitted": 72982, + "total_column_articles": 449, "frontend_question_id": "2100", "is_new_question": false }, @@ -29916,9 +30378,9 @@ "question__title": "Find Subsequence of Length K With the Largest Sum", "question__title_slug": "find-subsequence-of-length-k-with-the-largest-sum", "question__hide": false, - "total_acs": 11408, - "total_submitted": 23375, - "total_column_articles": 216, + "total_acs": 11524, + "total_submitted": 23594, + "total_column_articles": 217, "frontend_question_id": "2099", "is_new_question": false }, @@ -29937,8 +30399,8 @@ "question__title": "Number of Spaces Cleaning Robot Cleaned", "question__title_slug": "number-of-spaces-cleaning-robot-cleaned", "question__hide": false, - "total_acs": 754, - "total_submitted": 1568, + "total_acs": 759, + "total_submitted": 1575, "total_column_articles": 30, "frontend_question_id": "2061", "is_new_question": false @@ -29958,8 +30420,8 @@ "question__title": "Sum of k-Mirror Numbers", "question__title_slug": "sum-of-k-mirror-numbers", "question__hide": false, - "total_acs": 3628, - "total_submitted": 8209, + "total_acs": 3647, + "total_submitted": 8242, "total_column_articles": 85, "frontend_question_id": "2081", "is_new_question": false @@ -29979,8 +30441,8 @@ "question__title": "Valid Arrangement of Pairs", "question__title_slug": "valid-arrangement-of-pairs", "question__hide": false, - "total_acs": 3290, - "total_submitted": 8545, + "total_acs": 3316, + "total_submitted": 8605, "total_column_articles": 58, "frontend_question_id": "2097", "is_new_question": false @@ -30000,8 +30462,8 @@ "question__title": "Stamping the Grid", "question__title_slug": "stamping-the-grid", "question__hide": false, - "total_acs": 12655, - "total_submitted": 25545, + "total_acs": 12735, + "total_submitted": 25661, "total_column_articles": 120, "frontend_question_id": "2132", "is_new_question": false @@ -30021,9 +30483,9 @@ "question__title": "Two Furthest Houses With Different Colors", "question__title_slug": "two-furthest-houses-with-different-colors", "question__hide": false, - "total_acs": 15395, - "total_submitted": 21437, - "total_column_articles": 242, + "total_acs": 15482, + "total_submitted": 21547, + "total_column_articles": 243, "frontend_question_id": "2078", "is_new_question": false }, @@ -30042,8 +30504,8 @@ "question__title": "Process Restricted Friend Requests", "question__title_slug": "process-restricted-friend-requests", "question__hide": false, - "total_acs": 4203, - "total_submitted": 8134, + "total_acs": 4245, + "total_submitted": 8187, "total_column_articles": 92, "frontend_question_id": "2076", "is_new_question": false @@ -30063,8 +30525,8 @@ "question__title": "Decode the Slanted Ciphertext", "question__title_slug": "decode-the-slanted-ciphertext", "question__hide": false, - "total_acs": 5215, - "total_submitted": 11056, + "total_acs": 5239, + "total_submitted": 11091, "total_column_articles": 91, "frontend_question_id": "2075", "is_new_question": false @@ -30084,8 +30546,8 @@ "question__title": "Reverse Nodes in Even Length Groups", "question__title_slug": "reverse-nodes-in-even-length-groups", "question__hide": false, - "total_acs": 7568, - "total_submitted": 16224, + "total_acs": 7605, + "total_submitted": 16288, "total_column_articles": 171, "frontend_question_id": "2074", "is_new_question": false @@ -30105,9 +30567,9 @@ "question__title": "Time Needed to Buy Tickets", "question__title_slug": "time-needed-to-buy-tickets", "question__hide": false, - "total_acs": 16885, - "total_submitted": 27180, - "total_column_articles": 265, + "total_acs": 16997, + "total_submitted": 27347, + "total_column_articles": 264, "frontend_question_id": "2073", "is_new_question": false }, @@ -30126,9 +30588,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": 2124, - "total_submitted": 3252, - "total_column_articles": 27, + "total_acs": 2149, + "total_submitted": 3285, + "total_column_articles": 28, "frontend_question_id": "2051", "is_new_question": false }, @@ -30147,8 +30609,8 @@ "question__title": "Count Fertile Pyramids in a Land", "question__title_slug": "count-fertile-pyramids-in-a-land", "question__hide": false, - "total_acs": 2866, - "total_submitted": 4537, + "total_acs": 2893, + "total_submitted": 4569, "total_column_articles": 60, "frontend_question_id": "2088", "is_new_question": false @@ -30168,8 +30630,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": 4679, - "total_submitted": 9414, + "total_acs": 4695, + "total_submitted": 9443, "total_column_articles": 93, "frontend_question_id": "2087", "is_new_question": false @@ -30189,8 +30651,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": 6811, - "total_submitted": 14348, + "total_acs": 6852, + "total_submitted": 14424, "total_column_articles": 121, "frontend_question_id": "2086", "is_new_question": false @@ -30210,9 +30672,9 @@ "question__title": "Count Common Words With One Occurrence", "question__title_slug": "count-common-words-with-one-occurrence", "question__hide": false, - "total_acs": 31577, - "total_submitted": 40885, - "total_column_articles": 330, + "total_acs": 31889, + "total_submitted": 41307, + "total_column_articles": 331, "frontend_question_id": "2085", "is_new_question": false }, @@ -30231,8 +30693,8 @@ "question__title": "Maximum Path Quality of a Graph", "question__title_slug": "maximum-path-quality-of-a-graph", "question__hide": false, - "total_acs": 3562, - "total_submitted": 6485, + "total_acs": 3666, + "total_submitted": 6723, "total_column_articles": 70, "frontend_question_id": "2065", "is_new_question": false @@ -30252,8 +30714,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": 8026, - "total_submitted": 16832, + "total_acs": 8144, + "total_submitted": 17023, "total_column_articles": 115, "frontend_question_id": "2064", "is_new_question": false @@ -30273,8 +30735,8 @@ "question__title": "Vowels of All Substrings", "question__title_slug": "vowels-of-all-substrings", "question__hide": false, - "total_acs": 7824, - "total_submitted": 14920, + "total_acs": 7891, + "total_submitted": 15038, "total_column_articles": 148, "frontend_question_id": "2063", "is_new_question": false @@ -30294,8 +30756,8 @@ "question__title": "Count Vowel Substrings of a String", "question__title_slug": "count-vowel-substrings-of-a-string", "question__hide": false, - "total_acs": 10433, - "total_submitted": 16415, + "total_acs": 10481, + "total_submitted": 16480, "total_column_articles": 176, "frontend_question_id": "2062", "is_new_question": false @@ -30315,8 +30777,8 @@ "question__title": "Accepted Candidates From the Interviews", "question__title_slug": "accepted-candidates-from-the-interviews", "question__hide": false, - "total_acs": 2968, - "total_submitted": 3849, + "total_acs": 3017, + "total_submitted": 3902, "total_column_articles": 43, "frontend_question_id": "2041", "is_new_question": false @@ -30336,9 +30798,9 @@ "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": 1822, - "total_submitted": 4576, - "total_column_articles": 28, + "total_acs": 1830, + "total_submitted": 4592, + "total_column_articles": 29, "frontend_question_id": "2060", "is_new_question": false }, @@ -30357,8 +30819,8 @@ "question__title": "Minimum Operations to Convert Number", "question__title_slug": "minimum-operations-to-convert-number", "question__hide": false, - "total_acs": 7983, - "total_submitted": 16212, + "total_acs": 8019, + "total_submitted": 16259, "total_column_articles": 130, "frontend_question_id": "2059", "is_new_question": false @@ -30378,8 +30840,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": 9276, - "total_submitted": 16329, + "total_acs": 9338, + "total_submitted": 16429, "total_column_articles": 129, "frontend_question_id": "2058", "is_new_question": false @@ -30399,8 +30861,8 @@ "question__title": "Smallest Index With Equal Value", "question__title_slug": "smallest-index-with-equal-value", "question__hide": false, - "total_acs": 16447, - "total_submitted": 21586, + "total_acs": 16660, + "total_submitted": 21833, "total_column_articles": 134, "frontend_question_id": "2057", "is_new_question": false @@ -30420,9 +30882,9 @@ "question__title": "Maximum Number of Tasks You Can Assign", "question__title_slug": "maximum-number-of-tasks-you-can-assign", "question__hide": false, - "total_acs": 5532, - "total_submitted": 17267, - "total_column_articles": 57, + "total_acs": 5743, + "total_submitted": 17820, + "total_column_articles": 59, "frontend_question_id": "2071", "is_new_question": false }, @@ -30441,8 +30903,8 @@ "question__title": "Most Beautiful Item for Each Query", "question__title_slug": "most-beautiful-item-for-each-query", "question__hide": false, - "total_acs": 5138, - "total_submitted": 11135, + "total_acs": 5193, + "total_submitted": 11245, "total_column_articles": 131, "frontend_question_id": "2070", "is_new_question": false @@ -30462,8 +30924,8 @@ "question__title": "Walking Robot Simulation II", "question__title_slug": "walking-robot-simulation-ii", "question__hide": false, - "total_acs": 5436, - "total_submitted": 24080, + "total_acs": 5458, + "total_submitted": 24168, "total_column_articles": 119, "frontend_question_id": "2069", "is_new_question": false @@ -30483,8 +30945,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": 11879, - "total_submitted": 16982, + "total_acs": 11967, + "total_submitted": 17100, "total_column_articles": 182, "frontend_question_id": "2068", "is_new_question": false @@ -30504,8 +30966,8 @@ "question__title": "Parallel Courses III", "question__title_slug": "parallel-courses-iii", "question__hide": false, - "total_acs": 17108, - "total_submitted": 26574, + "total_acs": 17228, + "total_submitted": 26755, "total_column_articles": 219, "frontend_question_id": "2050", "is_new_question": false @@ -30525,8 +30987,8 @@ "question__title": "Count Nodes With the Highest Score", "question__title_slug": "count-nodes-with-the-highest-score", "question__hide": false, - "total_acs": 28783, - "total_submitted": 55611, + "total_acs": 28842, + "total_submitted": 55762, "total_column_articles": 328, "frontend_question_id": "2049", "is_new_question": false @@ -30546,8 +31008,8 @@ "question__title": "Next Greater Numerically Balanced Number", "question__title_slug": "next-greater-numerically-balanced-number", "question__hide": false, - "total_acs": 20942, - "total_submitted": 35489, + "total_acs": 20985, + "total_submitted": 35562, "total_column_articles": 229, "frontend_question_id": "2048", "is_new_question": false @@ -30567,8 +31029,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": 29977, - "total_submitted": 78070, + "total_acs": 30049, + "total_submitted": 78251, "total_column_articles": 444, "frontend_question_id": "2047", "is_new_question": false @@ -30588,8 +31050,8 @@ "question__title": "Low-Quality Problems", "question__title_slug": "low-quality-problems", "question__hide": false, - "total_acs": 4373, - "total_submitted": 5476, + "total_acs": 4396, + "total_submitted": 5505, "total_column_articles": 38, "frontend_question_id": "2026", "is_new_question": false @@ -30609,9 +31071,9 @@ "question__title": "Second Minimum Time to Reach Destination", "question__title_slug": "second-minimum-time-to-reach-destination", "question__hide": false, - "total_acs": 17722, - "total_submitted": 33324, - "total_column_articles": 172, + "total_acs": 17778, + "total_submitted": 33451, + "total_column_articles": 174, "frontend_question_id": "2045", "is_new_question": false }, @@ -30630,9 +31092,9 @@ "question__title": "Count Number of Maximum Bitwise-OR Subsets", "question__title_slug": "count-number-of-maximum-bitwise-or-subsets", "question__hide": false, - "total_acs": 37296, - "total_submitted": 45615, - "total_column_articles": 411, + "total_acs": 37360, + "total_submitted": 45688, + "total_column_articles": 412, "frontend_question_id": "2044", "is_new_question": false }, @@ -30651,8 +31113,8 @@ "question__title": "Simple Bank System", "question__title_slug": "simple-bank-system", "question__hide": false, - "total_acs": 37663, - "total_submitted": 57483, + "total_acs": 37712, + "total_submitted": 57552, "total_column_articles": 315, "frontend_question_id": "2043", "is_new_question": false @@ -30672,9 +31134,9 @@ "question__title": "Check if Numbers Are Ascending in a Sentence", "question__title_slug": "check-if-numbers-are-ascending-in-a-sentence", "question__hide": false, - "total_acs": 38101, - "total_submitted": 53060, - "total_column_articles": 518, + "total_acs": 38173, + "total_submitted": 53153, + "total_column_articles": 517, "frontend_question_id": "2042", "is_new_question": false }, @@ -30693,9 +31155,9 @@ "question__title": "Number of Accounts That Did Not Stream", "question__title_slug": "number-of-accounts-that-did-not-stream", "question__hide": false, - "total_acs": 2548, - "total_submitted": 3720, - "total_column_articles": 39, + "total_acs": 2588, + "total_submitted": 3774, + "total_column_articles": 40, "frontend_question_id": "2020", "is_new_question": false }, @@ -30714,9 +31176,9 @@ "question__title": "Number of Valid Move Combinations On Chessboard", "question__title_slug": "number-of-valid-move-combinations-on-chessboard", "question__hide": false, - "total_acs": 1277, - "total_submitted": 2245, - "total_column_articles": 27, + "total_acs": 1289, + "total_submitted": 2264, + "total_column_articles": 28, "frontend_question_id": "2056", "is_new_question": false }, @@ -30735,9 +31197,9 @@ "question__title": "Plates Between Candles", "question__title_slug": "plates-between-candles", "question__hide": false, - "total_acs": 35604, - "total_submitted": 81670, - "total_column_articles": 445, + "total_acs": 35884, + "total_submitted": 82156, + "total_column_articles": 446, "frontend_question_id": "2055", "is_new_question": false }, @@ -30756,9 +31218,9 @@ "question__title": "Two Best Non-Overlapping Events", "question__title_slug": "two-best-non-overlapping-events", "question__hide": false, - "total_acs": 5661, - "total_submitted": 14284, - "total_column_articles": 100, + "total_acs": 5690, + "total_submitted": 14343, + "total_column_articles": 102, "frontend_question_id": "2054", "is_new_question": false }, @@ -30777,8 +31239,8 @@ "question__title": "Kth Distinct String in an Array", "question__title_slug": "kth-distinct-string-in-an-array", "question__hide": false, - "total_acs": 12066, - "total_submitted": 16726, + "total_acs": 12156, + "total_submitted": 16852, "total_column_articles": 197, "frontend_question_id": "2053", "is_new_question": false @@ -30798,9 +31260,9 @@ "question__title": "Partition Array Into Two Arrays to Minimize Sum Difference", "question__title_slug": "partition-array-into-two-arrays-to-minimize-sum-difference", "question__hide": false, - "total_acs": 5009, - "total_submitted": 13470, - "total_column_articles": 82, + "total_acs": 5040, + "total_submitted": 13564, + "total_column_articles": 83, "frontend_question_id": "2035", "is_new_question": false }, @@ -30819,8 +31281,8 @@ "question__title": "Stock Price Fluctuation ", "question__title_slug": "stock-price-fluctuation", "question__hide": false, - "total_acs": 40156, - "total_submitted": 83196, + "total_acs": 40188, + "total_submitted": 83268, "total_column_articles": 318, "frontend_question_id": "2034", "is_new_question": false @@ -30840,9 +31302,9 @@ "question__title": "Minimum Operations to Make a Uni-Value Grid", "question__title_slug": "minimum-operations-to-make-a-uni-value-grid", "question__hide": false, - "total_acs": 7606, - "total_submitted": 17066, - "total_column_articles": 130, + "total_acs": 7648, + "total_submitted": 17145, + "total_column_articles": 131, "frontend_question_id": "2033", "is_new_question": false }, @@ -30861,8 +31323,8 @@ "question__title": "Two Out of Three", "question__title_slug": "two-out-of-three", "question__hide": false, - "total_acs": 34562, - "total_submitted": 47336, + "total_acs": 34652, + "total_submitted": 47447, "total_column_articles": 433, "frontend_question_id": "2032", "is_new_question": false @@ -30882,8 +31344,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": 2433, - "total_submitted": 3932, + "total_acs": 2467, + "total_submitted": 3973, "total_column_articles": 54, "frontend_question_id": "2010", "is_new_question": false @@ -30903,9 +31365,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": 2590, - "total_submitted": 7123, - "total_column_articles": 59, + "total_acs": 2624, + "total_submitted": 7201, + "total_column_articles": 60, "frontend_question_id": "2030", "is_new_question": false }, @@ -30924,8 +31386,8 @@ "question__title": "Stone Game IX", "question__title_slug": "stone-game-ix", "question__hide": false, - "total_acs": 20716, - "total_submitted": 44531, + "total_acs": 20766, + "total_submitted": 44641, "total_column_articles": 201, "frontend_question_id": "2029", "is_new_question": false @@ -30945,9 +31407,9 @@ "question__title": "Find Missing Observations", "question__title_slug": "find-missing-observations", "question__hide": false, - "total_acs": 35745, - "total_submitted": 70408, - "total_column_articles": 405, + "total_acs": 55126, + "total_submitted": 104029, + "total_column_articles": 534, "frontend_question_id": "2028", "is_new_question": false }, @@ -30966,8 +31428,8 @@ "question__title": "Minimum Moves to Convert String", "question__title_slug": "minimum-moves-to-convert-string", "question__hide": false, - "total_acs": 29706, - "total_submitted": 44488, + "total_acs": 29817, + "total_submitted": 44653, "total_column_articles": 320, "frontend_question_id": "2027", "is_new_question": false @@ -30987,8 +31449,8 @@ "question__title": "Subtree Removal Game with Fibonacci Tree", "question__title_slug": "subtree-removal-game-with-fibonacci-tree", "question__hide": false, - "total_acs": 221, - "total_submitted": 448, + "total_acs": 225, + "total_submitted": 452, "total_column_articles": 11, "frontend_question_id": "2005", "is_new_question": false @@ -31008,9 +31470,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": 1866, - "total_submitted": 4204, - "total_column_articles": 45, + "total_acs": 1898, + "total_submitted": 4243, + "total_column_articles": 47, "frontend_question_id": "2004", "is_new_question": false }, @@ -31029,8 +31491,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": 21155, - "total_submitted": 37924, + "total_acs": 21246, + "total_submitted": 38049, "total_column_articles": 182, "frontend_question_id": "2039", "is_new_question": false @@ -31050,9 +31512,9 @@ "question__title": "Kth Smallest Product of Two Sorted Arrays", "question__title_slug": "kth-smallest-product-of-two-sorted-arrays", "question__hide": false, - "total_acs": 2515, - "total_submitted": 7364, - "total_column_articles": 38, + "total_acs": 2593, + "total_submitted": 7504, + "total_column_articles": 40, "frontend_question_id": "2040", "is_new_question": false }, @@ -31071,8 +31533,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": 36463, - "total_submitted": 57545, + "total_acs": 36544, + "total_submitted": 57674, "total_column_articles": 472, "frontend_question_id": "2038", "is_new_question": false @@ -31092,9 +31554,9 @@ "question__title": "Minimum Number of Moves to Seat Everyone", "question__title_slug": "minimum-number-of-moves-to-seat-everyone", "question__hide": false, - "total_acs": 26093, - "total_submitted": 30835, - "total_column_articles": 280, + "total_acs": 26232, + "total_submitted": 30992, + "total_column_articles": 281, "frontend_question_id": "2037", "is_new_question": false }, @@ -31113,8 +31575,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": 2178, - "total_submitted": 5834, + "total_acs": 2200, + "total_submitted": 5886, "total_column_articles": 48, "frontend_question_id": "2019", "is_new_question": false @@ -31134,8 +31596,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": 3559, - "total_submitted": 8410, + "total_acs": 3572, + "total_submitted": 8437, "total_column_articles": 74, "frontend_question_id": "2018", "is_new_question": false @@ -31155,8 +31617,8 @@ "question__title": "Grid Game", "question__title_slug": "grid-game", "question__hide": false, - "total_acs": 6510, - "total_submitted": 16572, + "total_acs": 6536, + "total_submitted": 16629, "total_column_articles": 134, "frontend_question_id": "2017", "is_new_question": false @@ -31176,9 +31638,9 @@ "question__title": "Maximum Difference Between Increasing Elements", "question__title_slug": "maximum-difference-between-increasing-elements", "question__hide": false, - "total_acs": 47272, - "total_submitted": 78955, - "total_column_articles": 524, + "total_acs": 47368, + "total_submitted": 79113, + "total_column_articles": 526, "frontend_question_id": "2016", "is_new_question": false }, @@ -31197,8 +31659,8 @@ "question__title": "Count the Number of Experiments", "question__title_slug": "count-the-number-of-experiments", "question__hide": false, - "total_acs": 3004, - "total_submitted": 6401, + "total_acs": 3045, + "total_submitted": 6461, "total_column_articles": 35, "frontend_question_id": "1990", "is_new_question": false @@ -31218,8 +31680,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": 427, - "total_submitted": 814, + "total_acs": 435, + "total_submitted": 825, "total_column_articles": 16, "frontend_question_id": "2015", "is_new_question": false @@ -31239,8 +31701,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": 381, - "total_submitted": 856, + "total_acs": 384, + "total_submitted": 861, "total_column_articles": 15, "frontend_question_id": "1999", "is_new_question": false @@ -31260,8 +31722,8 @@ "question__title": "Longest Subsequence Repeated k Times", "question__title_slug": "longest-subsequence-repeated-k-times", "question__hide": false, - "total_acs": 2635, - "total_submitted": 4805, + "total_acs": 2647, + "total_submitted": 4829, "total_column_articles": 32, "frontend_question_id": "2014", "is_new_question": false @@ -31281,8 +31743,8 @@ "question__title": "Detect Squares", "question__title_slug": "detect-squares", "question__hide": false, - "total_acs": 22426, - "total_submitted": 39714, + "total_acs": 22477, + "total_submitted": 39807, "total_column_articles": 248, "frontend_question_id": "2013", "is_new_question": false @@ -31302,9 +31764,9 @@ "question__title": "Sum of Beauty in the Array", "question__title_slug": "sum-of-beauty-in-the-array", "question__hide": false, - "total_acs": 6811, - "total_submitted": 17039, - "total_column_articles": 111, + "total_acs": 6856, + "total_submitted": 17106, + "total_column_articles": 113, "frontend_question_id": "2012", "is_new_question": false }, @@ -31323,9 +31785,9 @@ "question__title": "Final Value of Variable After Performing Operations", "question__title_slug": "final-value-of-variable-after-performing-operations", "question__hide": false, - "total_acs": 53268, - "total_submitted": 61792, - "total_column_articles": 447, + "total_acs": 53590, + "total_submitted": 62151, + "total_column_articles": 450, "frontend_question_id": "2011", "is_new_question": false }, @@ -31344,8 +31806,8 @@ "question__title": "Find Cutoff Score for Each School", "question__title_slug": "find-cutoff-score-for-each-school", "question__hide": false, - "total_acs": 5380, - "total_submitted": 8369, + "total_acs": 5427, + "total_submitted": 8436, "total_column_articles": 63, "frontend_question_id": "1988", "is_new_question": false @@ -31365,9 +31827,9 @@ "question__title": "Maximum Number of Ways to Partition an Array", "question__title_slug": "maximum-number-of-ways-to-partition-an-array", "question__hide": false, - "total_acs": 2855, - "total_submitted": 9179, - "total_column_articles": 68, + "total_acs": 2911, + "total_submitted": 9299, + "total_column_articles": 69, "frontend_question_id": "2025", "is_new_question": false }, @@ -31386,9 +31848,9 @@ "question__title": "Maximize the Confusion of an Exam", "question__title_slug": "maximize-the-confusion-of-an-exam", "question__hide": false, - "total_acs": 41106, - "total_submitted": 70904, - "total_column_articles": 462, + "total_acs": 41377, + "total_submitted": 71241, + "total_column_articles": 468, "frontend_question_id": "2024", "is_new_question": false }, @@ -31407,9 +31869,9 @@ "question__title": "Number of Pairs of Strings With Concatenation Equal to Target", "question__title_slug": "number-of-pairs-of-strings-with-concatenation-equal-to-target", "question__hide": false, - "total_acs": 7514, - "total_submitted": 10119, - "total_column_articles": 113, + "total_acs": 7561, + "total_submitted": 10182, + "total_column_articles": 114, "frontend_question_id": "2023", "is_new_question": false }, @@ -31428,8 +31890,8 @@ "question__title": "Convert 1D Array Into 2D Array", "question__title_slug": "convert-1d-array-into-2d-array", "question__hide": false, - "total_acs": 43570, - "total_submitted": 66327, + "total_acs": 43675, + "total_submitted": 66474, "total_column_articles": 507, "frontend_question_id": "2022", "is_new_question": false @@ -31449,9 +31911,9 @@ "question__title": "Smallest Missing Genetic Value in Each Subtree", "question__title_slug": "smallest-missing-genetic-value-in-each-subtree", "question__hide": false, - "total_acs": 15843, - "total_submitted": 26776, - "total_column_articles": 115, + "total_acs": 15872, + "total_submitted": 26818, + "total_column_articles": 116, "frontend_question_id": "2003", "is_new_question": false }, @@ -31470,9 +31932,9 @@ "question__title": "Maximum Product of the Length of Two Palindromic Subsequences", "question__title_slug": "maximum-product-of-the-length-of-two-palindromic-subsequences", "question__hide": false, - "total_acs": 6624, - "total_submitted": 10834, - "total_column_articles": 129, + "total_acs": 6669, + "total_submitted": 10893, + "total_column_articles": 130, "frontend_question_id": "2002", "is_new_question": false }, @@ -31491,9 +31953,9 @@ "question__title": "Number of Pairs of Interchangeable Rectangles", "question__title_slug": "number-of-pairs-of-interchangeable-rectangles", "question__hide": false, - "total_acs": 9172, - "total_submitted": 22983, - "total_column_articles": 178, + "total_acs": 9235, + "total_submitted": 23078, + "total_column_articles": 180, "frontend_question_id": "2001", "is_new_question": false }, @@ -31512,9 +31974,9 @@ "question__title": "Reverse Prefix of Word", "question__title_slug": "reverse-prefix-of-word", "question__hide": false, - "total_acs": 42000, - "total_submitted": 54374, - "total_column_articles": 518, + "total_acs": 42190, + "total_submitted": 54610, + "total_column_articles": 520, "frontend_question_id": "2000", "is_new_question": false }, @@ -31533,9 +31995,9 @@ "question__title": "Employees Whose Manager Left the Company", "question__title_slug": "employees-whose-manager-left-the-company", "question__hide": false, - "total_acs": 21791, - "total_submitted": 45524, - "total_column_articles": 116, + "total_acs": 23051, + "total_submitted": 48143, + "total_column_articles": 120, "frontend_question_id": "1978", "is_new_question": false }, @@ -31554,8 +32016,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": 669, - "total_submitted": 1077, + "total_acs": 671, + "total_submitted": 1178, "total_column_articles": 24, "frontend_question_id": "1973", "is_new_question": false @@ -31575,9 +32037,9 @@ "question__title": "GCD Sort of an Array", "question__title_slug": "gcd-sort-of-an-array", "question__hide": false, - "total_acs": 3508, - "total_submitted": 7621, - "total_column_articles": 67, + "total_acs": 3540, + "total_submitted": 7672, + "total_column_articles": 68, "frontend_question_id": "1998", "is_new_question": false }, @@ -31596,9 +32058,9 @@ "question__title": "First Day Where You Have Been in All the Rooms", "question__title_slug": "first-day-where-you-have-been-in-all-the-rooms", "question__hide": false, - "total_acs": 17525, - "total_submitted": 39335, - "total_column_articles": 133, + "total_acs": 17599, + "total_submitted": 39534, + "total_column_articles": 134, "frontend_question_id": "1997", "is_new_question": false }, @@ -31617,8 +32079,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": 30790, - "total_submitted": 74048, + "total_acs": 30876, + "total_submitted": 74250, "total_column_articles": 316, "frontend_question_id": "1996", "is_new_question": false @@ -31638,8 +32100,8 @@ "question__title": "Count Special Quadruplets", "question__title_slug": "count-special-quadruplets", "question__hide": false, - "total_acs": 39763, - "total_submitted": 59863, + "total_acs": 39872, + "total_submitted": 60016, "total_column_articles": 296, "frontend_question_id": "1995", "is_new_question": false @@ -31659,9 +32121,9 @@ "question__title": "Find if Path Exists in Graph", "question__title_slug": "find-if-path-exists-in-graph", "question__hide": false, - "total_acs": 45363, - "total_submitted": 83443, - "total_column_articles": 391, + "total_acs": 46715, + "total_submitted": 85897, + "total_column_articles": 395, "frontend_question_id": "1971", "is_new_question": false }, @@ -31680,8 +32142,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": 3228, - "total_submitted": 7692, + "total_acs": 3268, + "total_submitted": 7774, "total_column_articles": 55, "frontend_question_id": "1972", "is_new_question": false @@ -31701,9 +32163,9 @@ "question__title": "Minimum Number of Operations to Make Array Continuous", "question__title_slug": "minimum-number-of-operations-to-make-array-continuous", "question__hide": false, - "total_acs": 18599, - "total_submitted": 35796, - "total_column_articles": 182, + "total_acs": 18652, + "total_submitted": 35880, + "total_column_articles": 181, "frontend_question_id": "2009", "is_new_question": false }, @@ -31722,8 +32184,8 @@ "question__title": "Maximum Earnings From Taxi", "question__title_slug": "maximum-earnings-from-taxi", "question__hide": false, - "total_acs": 24308, - "total_submitted": 43198, + "total_acs": 24468, + "total_submitted": 43446, "total_column_articles": 225, "frontend_question_id": "2008", "is_new_question": false @@ -31743,8 +32205,8 @@ "question__title": "Find Original Array From Doubled Array", "question__title_slug": "find-original-array-from-doubled-array", "question__hide": false, - "total_acs": 27328, - "total_submitted": 64660, + "total_acs": 27465, + "total_submitted": 65037, "total_column_articles": 279, "frontend_question_id": "2007", "is_new_question": false @@ -31764,9 +32226,9 @@ "question__title": "Count Number of Pairs With Absolute Difference K", "question__title_slug": "count-number-of-pairs-with-absolute-difference-k", "question__hide": false, - "total_acs": 60832, - "total_submitted": 73543, - "total_column_articles": 566, + "total_acs": 61131, + "total_submitted": 73896, + "total_column_articles": 567, "frontend_question_id": "2006", "is_new_question": false }, @@ -31785,8 +32247,8 @@ "question__title": "Number of Unique Good Subsequences", "question__title_slug": "number-of-unique-good-subsequences", "question__hide": false, - "total_acs": 2786, - "total_submitted": 5484, + "total_acs": 2799, + "total_submitted": 5504, "total_column_articles": 45, "frontend_question_id": "1987", "is_new_question": false @@ -31806,8 +32268,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": 7944, - "total_submitted": 22826, + "total_acs": 7990, + "total_submitted": 22941, "total_column_articles": 128, "frontend_question_id": "1986", "is_new_question": false @@ -31827,9 +32289,9 @@ "question__title": "Find the Kth Largest Integer in the Array", "question__title_slug": "find-the-kth-largest-integer-in-the-array", "question__hide": false, - "total_acs": 12974, - "total_submitted": 30464, - "total_column_articles": 166, + "total_acs": 13084, + "total_submitted": 30694, + "total_column_articles": 171, "frontend_question_id": "1985", "is_new_question": false }, @@ -31848,9 +32310,9 @@ "question__title": "Minimum Difference Between Highest and Lowest of K Scores", "question__title_slug": "minimum-difference-between-highest-and-lowest-of-k-scores", "question__hide": false, - "total_acs": 51907, - "total_submitted": 83557, - "total_column_articles": 588, + "total_acs": 52532, + "total_submitted": 84419, + "total_column_articles": 594, "frontend_question_id": "1984", "is_new_question": false }, @@ -31869,8 +32331,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": 320, - "total_submitted": 535, + "total_acs": 326, + "total_submitted": 597, "total_column_articles": 11, "frontend_question_id": "1966", "is_new_question": false @@ -31890,9 +32352,9 @@ "question__title": "Employees With Missing Information", "question__title_slug": "employees-with-missing-information", "question__hide": false, - "total_acs": 53315, - "total_submitted": 75217, - "total_column_articles": 341, + "total_acs": 53730, + "total_submitted": 75732, + "total_column_articles": 345, "frontend_question_id": "1965", "is_new_question": false }, @@ -31911,8 +32373,8 @@ "question__title": "Find Array Given Subset Sums", "question__title_slug": "find-array-given-subset-sums", "question__hide": false, - "total_acs": 1755, - "total_submitted": 3658, + "total_acs": 1792, + "total_submitted": 3700, "total_column_articles": 28, "frontend_question_id": "1982", "is_new_question": false @@ -31932,9 +32394,9 @@ "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": 8507, - "total_submitted": 24627, - "total_column_articles": 110, + "total_acs": 8668, + "total_submitted": 24944, + "total_column_articles": 113, "frontend_question_id": "1981", "is_new_question": false }, @@ -31953,8 +32415,8 @@ "question__title": "Find Unique Binary String", "question__title_slug": "find-unique-binary-string", "question__hide": false, - "total_acs": 9872, - "total_submitted": 16189, + "total_acs": 9905, + "total_submitted": 16241, "total_column_articles": 159, "frontend_question_id": "1980", "is_new_question": false @@ -31974,9 +32436,9 @@ "question__title": "Find Greatest Common Divisor of Array", "question__title_slug": "find-greatest-common-divisor-of-array", "question__hide": false, - "total_acs": 28688, - "total_submitted": 37174, - "total_column_articles": 325, + "total_acs": 29217, + "total_submitted": 37812, + "total_column_articles": 329, "frontend_question_id": "1979", "is_new_question": false }, @@ -31995,8 +32457,8 @@ "question__title": "The Number of Good Subsets", "question__title_slug": "the-number-of-good-subsets", "question__hide": false, - "total_acs": 17135, - "total_submitted": 30764, + "total_acs": 17177, + "total_submitted": 30850, "total_column_articles": 194, "frontend_question_id": "1994", "is_new_question": false @@ -32016,8 +32478,8 @@ "question__title": "Operations on Tree", "question__title_slug": "operations-on-tree", "question__hide": false, - "total_acs": 16279, - "total_submitted": 31097, + "total_acs": 16302, + "total_submitted": 31136, "total_column_articles": 151, "frontend_question_id": "1993", "is_new_question": false @@ -32037,9 +32499,9 @@ "question__title": "Find All Groups of Farmland", "question__title_slug": "find-all-groups-of-farmland", "question__hide": false, - "total_acs": 6681, - "total_submitted": 10810, - "total_column_articles": 142, + "total_acs": 6715, + "total_submitted": 10857, + "total_column_articles": 143, "frontend_question_id": "1992", "is_new_question": false }, @@ -32058,9 +32520,9 @@ "question__title": "Find the Middle Index in Array", "question__title_slug": "find-the-middle-index-in-array", "question__hide": false, - "total_acs": 30649, - "total_submitted": 47975, - "total_column_articles": 392, + "total_acs": 31123, + "total_submitted": 48659, + "total_column_articles": 397, "frontend_question_id": "1991", "is_new_question": false }, @@ -32079,9 +32541,9 @@ "question__title": "Last Day Where You Can Still Cross", "question__title_slug": "last-day-where-you-can-still-cross", "question__hide": false, - "total_acs": 4221, - "total_submitted": 8258, - "total_column_articles": 77, + "total_acs": 4254, + "total_submitted": 8302, + "total_column_articles": 78, "frontend_question_id": "1970", "is_new_question": false }, @@ -32100,9 +32562,9 @@ "question__title": "Minimum Non-Zero Product of the Array Elements", "question__title_slug": "minimum-non-zero-product-of-the-array-elements", "question__hide": false, - "total_acs": 17925, - "total_submitted": 42107, - "total_column_articles": 131, + "total_acs": 17999, + "total_submitted": 42247, + "total_column_articles": 130, "frontend_question_id": "1969", "is_new_question": false }, @@ -32121,9 +32583,9 @@ "question__title": "Number of Strings That Appear as Substrings in Word", "question__title_slug": "number-of-strings-that-appear-as-substrings-in-word", "question__hide": false, - "total_acs": 13793, - "total_submitted": 17303, - "total_column_articles": 170, + "total_acs": 13911, + "total_submitted": 17437, + "total_column_articles": 171, "frontend_question_id": "1967", "is_new_question": false }, @@ -32142,9 +32604,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": 4585, - "total_submitted": 7060, - "total_column_articles": 58, + "total_acs": 4634, + "total_submitted": 7120, + "total_column_articles": 59, "frontend_question_id": "1951", "is_new_question": false }, @@ -32163,9 +32625,9 @@ "question__title": "Strong Friendship", "question__title_slug": "strong-friendship", "question__hide": false, - "total_acs": 4266, - "total_submitted": 8152, - "total_column_articles": 58, + "total_acs": 4318, + "total_submitted": 8233, + "total_column_articles": 59, "frontend_question_id": "1949", "is_new_question": false }, @@ -32184,8 +32646,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": 8157, - "total_submitted": 17776, + "total_acs": 8376, + "total_submitted": 18149, "total_column_articles": 94, "frontend_question_id": "1964", "is_new_question": false @@ -32205,8 +32667,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": 7788, - "total_submitted": 12008, + "total_acs": 7851, + "total_submitted": 12091, "total_column_articles": 93, "frontend_question_id": "1963", "is_new_question": false @@ -32226,9 +32688,9 @@ "question__title": "Remove Stones to Minimize the Total", "question__title_slug": "remove-stones-to-minimize-the-total", "question__hide": false, - "total_acs": 24059, - "total_submitted": 40538, - "total_column_articles": 214, + "total_acs": 24266, + "total_submitted": 40856, + "total_column_articles": 215, "frontend_question_id": "1962", "is_new_question": false }, @@ -32247,9 +32709,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": 14847, - "total_submitted": 28122, - "total_column_articles": 171, + "total_acs": 14978, + "total_submitted": 28413, + "total_column_articles": 174, "frontend_question_id": "1961", "is_new_question": false }, @@ -32268,8 +32730,8 @@ "question__title": "Users That Actively Request Confirmation Messages", "question__title_slug": "users-that-actively-request-confirmation-messages", "question__hide": false, - "total_acs": 3523, - "total_submitted": 6057, + "total_acs": 3554, + "total_submitted": 6101, "total_column_articles": 33, "frontend_question_id": "1939", "is_new_question": false @@ -32289,9 +32751,9 @@ "question__title": "Number of Ways to Separate Numbers", "question__title_slug": "number-of-ways-to-separate-numbers", "question__hide": false, - "total_acs": 2134, - "total_submitted": 6864, - "total_column_articles": 30, + "total_acs": 2156, + "total_submitted": 6912, + "total_column_articles": 31, "frontend_question_id": "1977", "is_new_question": false }, @@ -32310,8 +32772,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": 22105, - "total_submitted": 48173, + "total_acs": 22323, + "total_submitted": 48629, "total_column_articles": 167, "frontend_question_id": "1976", "is_new_question": false @@ -32331,9 +32793,9 @@ "question__title": "Maximum Matrix Sum", "question__title_slug": "maximum-matrix-sum", "question__hide": false, - "total_acs": 5892, - "total_submitted": 13914, - "total_column_articles": 84, + "total_acs": 5933, + "total_submitted": 13987, + "total_column_articles": 86, "frontend_question_id": "1975", "is_new_question": false }, @@ -32352,8 +32814,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": 11648, - "total_submitted": 16137, + "total_acs": 11731, + "total_submitted": 16230, "total_column_articles": 170, "frontend_question_id": "1974", "is_new_question": false @@ -32373,9 +32835,9 @@ "question__title": "Confirmation Rate", "question__title_slug": "confirmation-rate", "question__hide": false, - "total_acs": 30743, - "total_submitted": 49264, - "total_column_articles": 249, + "total_acs": 32717, + "total_submitted": 52271, + "total_column_articles": 263, "frontend_question_id": "1934", "is_new_question": false }, @@ -32394,8 +32856,8 @@ "question__title": "Count Number of Special Subsequences", "question__title_slug": "count-number-of-special-subsequences", "question__hide": false, - "total_acs": 4500, - "total_submitted": 8499, + "total_acs": 4566, + "total_submitted": 8616, "total_column_articles": 67, "frontend_question_id": "1955", "is_new_question": false @@ -32415,8 +32877,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": 7295, - "total_submitted": 18093, + "total_acs": 7323, + "total_submitted": 18138, "total_column_articles": 104, "frontend_question_id": "1968", "is_new_question": false @@ -32436,9 +32898,9 @@ "question__title": "Maximum Number of Weeks for Which You Can Work", "question__title_slug": "maximum-number-of-weeks-for-which-you-can-work", "question__hide": false, - "total_acs": 16553, - "total_submitted": 34772, - "total_column_articles": 181, + "total_acs": 23738, + "total_submitted": 47278, + "total_column_articles": 227, "frontend_question_id": "1953", "is_new_question": false }, @@ -32457,9 +32919,9 @@ "question__title": "Three Divisors", "question__title_slug": "three-divisors", "question__hide": false, - "total_acs": 17783, - "total_submitted": 32109, - "total_column_articles": 206, + "total_acs": 17994, + "total_submitted": 32423, + "total_column_articles": 209, "frontend_question_id": "1952", "is_new_question": false }, @@ -32478,8 +32940,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": 373, - "total_submitted": 829, + "total_acs": 379, + "total_submitted": 839, "total_column_articles": 19, "frontend_question_id": "2052", "is_new_question": false @@ -32499,9 +32961,9 @@ "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": 3034, - "total_submitted": 6306, - "total_column_articles": 54, + "total_acs": 3078, + "total_submitted": 6363, + "total_column_articles": 55, "frontend_question_id": "1959", "is_new_question": false }, @@ -32520,9 +32982,9 @@ "question__title": "Check if Move is Legal", "question__title_slug": "check-if-move-is-legal", "question__hide": false, - "total_acs": 4123, - "total_submitted": 9018, - "total_column_articles": 70, + "total_acs": 4153, + "total_submitted": 9068, + "total_column_articles": 71, "frontend_question_id": "1958", "is_new_question": false }, @@ -32541,8 +33003,8 @@ "question__title": "Delete Duplicate Folders in System", "question__title_slug": "delete-duplicate-folders-in-system", "question__hide": false, - "total_acs": 1958, - "total_submitted": 3748, + "total_acs": 1968, + "total_submitted": 3764, "total_column_articles": 33, "frontend_question_id": "1948", "is_new_question": false @@ -32562,9 +33024,9 @@ "question__title": "Maximum Compatibility Score Sum", "question__title_slug": "maximum-compatibility-score-sum", "question__hide": false, - "total_acs": 7902, - "total_submitted": 13161, - "total_column_articles": 143, + "total_acs": 8018, + "total_submitted": 13311, + "total_column_articles": 145, "frontend_question_id": "1947", "is_new_question": false }, @@ -32583,9 +33045,9 @@ "question__title": "Largest Number After Mutating Substring", "question__title_slug": "largest-number-after-mutating-substring", "question__hide": false, - "total_acs": 8286, - "total_submitted": 25181, - "total_column_articles": 120, + "total_acs": 8336, + "total_submitted": 25269, + "total_column_articles": 121, "frontend_question_id": "1946", "is_new_question": false }, @@ -32604,9 +33066,9 @@ "question__title": "Sum of Digits of String After Convert", "question__title_slug": "sum-of-digits-of-string-after-convert", "question__hide": false, - "total_acs": 33025, - "total_submitted": 46981, - "total_column_articles": 398, + "total_acs": 33088, + "total_submitted": 47064, + "total_column_articles": 399, "frontend_question_id": "1945", "is_new_question": false }, @@ -32625,8 +33087,8 @@ "question__title": "Brightest Position on Street", "question__title_slug": "brightest-position-on-street", "question__hide": false, - "total_acs": 726, - "total_submitted": 1279, + "total_acs": 733, + "total_submitted": 1288, "total_column_articles": 24, "frontend_question_id": "2021", "is_new_question": false @@ -32646,8 +33108,8 @@ "question__title": "Erect the Fence II", "question__title_slug": "erect-the-fence-ii", "question__hide": false, - "total_acs": 286, - "total_submitted": 671, + "total_acs": 288, + "total_submitted": 698, "total_column_articles": 11, "frontend_question_id": "1924", "is_new_question": false @@ -32667,8 +33129,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": 343, - "total_submitted": 1006, + "total_acs": 350, + "total_submitted": 1017, "total_column_articles": 15, "frontend_question_id": "1956", "is_new_question": false @@ -32688,8 +33150,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": 549, - "total_submitted": 1190, + "total_acs": 560, + "total_submitted": 1201, "total_column_articles": 18, "frontend_question_id": "1950", "is_new_question": false @@ -32709,8 +33171,8 @@ "question__title": "Longest Common Subsequence Between Sorted Arrays", "question__title_slug": "longest-common-subsequence-between-sorted-arrays", "question__hide": false, - "total_acs": 1068, - "total_submitted": 1448, + "total_acs": 1087, + "total_submitted": 1470, "total_column_articles": 44, "frontend_question_id": "1940", "is_new_question": false @@ -32730,8 +33192,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": 1252, - "total_submitted": 2535, + "total_acs": 1260, + "total_submitted": 2546, "total_column_articles": 45, "frontend_question_id": "1933", "is_new_question": false @@ -32751,8 +33213,8 @@ "question__title": "Kth Smallest Subarray Sum", "question__title_slug": "kth-smallest-subarray-sum", "question__hide": false, - "total_acs": 901, - "total_submitted": 1853, + "total_acs": 920, + "total_submitted": 1884, "total_column_articles": 12, "frontend_question_id": "1918", "is_new_question": false @@ -32772,9 +33234,9 @@ "question__title": "Maximum Genetic Difference Query", "question__title_slug": "maximum-genetic-difference-query", "question__hide": false, - "total_acs": 2243, - "total_submitted": 5422, - "total_column_articles": 56, + "total_acs": 2269, + "total_submitted": 5455, + "total_column_articles": 57, "frontend_question_id": "1938", "is_new_question": false }, @@ -32793,8 +33255,8 @@ "question__title": "Maximum Number of Points with Cost", "question__title_slug": "maximum-number-of-points-with-cost", "question__hide": false, - "total_acs": 5982, - "total_submitted": 19857, + "total_acs": 6100, + "total_submitted": 20119, "total_column_articles": 97, "frontend_question_id": "1937", "is_new_question": false @@ -32814,8 +33276,8 @@ "question__title": "Add Minimum Number of Rungs", "question__title_slug": "add-minimum-number-of-rungs", "question__hide": false, - "total_acs": 9532, - "total_submitted": 20456, + "total_acs": 9584, + "total_submitted": 20560, "total_column_articles": 133, "frontend_question_id": "1936", "is_new_question": false @@ -32835,8 +33297,8 @@ "question__title": "Check for Contradictions in Equations", "question__title_slug": "check-for-contradictions-in-equations", "question__hide": false, - "total_acs": 295, - "total_submitted": 694, + "total_acs": 300, + "total_submitted": 703, "total_column_articles": 8, "frontend_question_id": "2307", "is_new_question": false @@ -32856,9 +33318,9 @@ "question__title": "Leetcodify Similar Friends", "question__title_slug": "leetcodify-similar-friends", "question__hide": false, - "total_acs": 2430, - "total_submitted": 5705, - "total_column_articles": 44, + "total_acs": 2468, + "total_submitted": 5772, + "total_column_articles": 45, "frontend_question_id": "1919", "is_new_question": false }, @@ -32877,9 +33339,9 @@ "question__title": "Leetcodify Friends Recommendations", "question__title_slug": "leetcodify-friends-recommendations", "question__hide": false, - "total_acs": 2689, - "total_submitted": 8852, - "total_column_articles": 37, + "total_acs": 2740, + "total_submitted": 9002, + "total_column_articles": 39, "frontend_question_id": "1917", "is_new_question": false }, @@ -32898,8 +33360,8 @@ "question__title": "Game of Nim", "question__title_slug": "game-of-nim", "question__hide": false, - "total_acs": 792, - "total_submitted": 1235, + "total_acs": 796, + "total_submitted": 1243, "total_column_articles": 21, "frontend_question_id": "1908", "is_new_question": false @@ -32919,8 +33381,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": 3672, - "total_submitted": 6098, + "total_acs": 3724, + "total_submitted": 6168, "total_column_articles": 98, "frontend_question_id": "1931", "is_new_question": false @@ -32940,9 +33402,9 @@ "question__title": "Merge BSTs to Create Single BST", "question__title_slug": "merge-bsts-to-create-single-bst", "question__hide": false, - "total_acs": 2390, - "total_submitted": 7212, - "total_column_articles": 60, + "total_acs": 2408, + "total_submitted": 7245, + "total_column_articles": 61, "frontend_question_id": "1932", "is_new_question": false }, @@ -32961,9 +33423,9 @@ "question__title": "Unique Length-3 Palindromic Subsequences", "question__title_slug": "unique-length-3-palindromic-subsequences", "question__hide": false, - "total_acs": 10060, - "total_submitted": 18905, - "total_column_articles": 169, + "total_acs": 10101, + "total_submitted": 18983, + "total_column_articles": 170, "frontend_question_id": "1930", "is_new_question": false }, @@ -32982,9 +33444,9 @@ "question__title": "Concatenation of Array", "question__title_slug": "concatenation-of-array", "question__hide": false, - "total_acs": 48733, - "total_submitted": 58793, - "total_column_articles": 387, + "total_acs": 49248, + "total_submitted": 59496, + "total_column_articles": 390, "frontend_question_id": "1929", "is_new_question": false }, @@ -33003,9 +33465,9 @@ "question__title": "Count Salary Categories", "question__title_slug": "count-salary-categories", "question__hide": false, - "total_acs": 21132, - "total_submitted": 32798, - "total_column_articles": 173, + "total_acs": 22241, + "total_submitted": 34459, + "total_column_articles": 178, "frontend_question_id": "1907", "is_new_question": false }, @@ -33024,8 +33486,8 @@ "question__title": "Jump Game VIII", "question__title_slug": "jump-game-viii", "question__hide": false, - "total_acs": 390, - "total_submitted": 753, + "total_acs": 399, + "total_submitted": 769, "total_column_articles": 18, "frontend_question_id": "2297", "is_new_question": false @@ -33045,8 +33507,8 @@ "question__title": "Describe the Painting", "question__title_slug": "describe-the-painting", "question__hide": false, - "total_acs": 3704, - "total_submitted": 8236, + "total_acs": 3775, + "total_submitted": 8333, "total_column_articles": 82, "frontend_question_id": "1943", "is_new_question": false @@ -33066,8 +33528,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": 5946, - "total_submitted": 13919, + "total_acs": 6010, + "total_submitted": 14039, "total_column_articles": 118, "frontend_question_id": "1942", "is_new_question": false @@ -33087,9 +33549,9 @@ "question__title": "Check if All Characters Have Equal Number of Occurrences", "question__title_slug": "check-if-all-characters-have-equal-number-of-occurrences", "question__hide": false, - "total_acs": 15296, - "total_submitted": 20771, - "total_column_articles": 212, + "total_acs": 15425, + "total_submitted": 20923, + "total_column_articles": 213, "frontend_question_id": "1941", "is_new_question": false }, @@ -33109,7 +33571,7 @@ "question__title_slug": "depth-of-bst-given-insertion-order", "question__hide": false, "total_acs": 531, - "total_submitted": 1086, + "total_submitted": 1200, "total_column_articles": 15, "frontend_question_id": "1902", "is_new_question": false @@ -33129,8 +33591,8 @@ "question__title": "Longest Common Subpath", "question__title_slug": "longest-common-subpath", "question__hide": false, - "total_acs": 3093, - "total_submitted": 11261, + "total_acs": 3125, + "total_submitted": 11336, "total_column_articles": 52, "frontend_question_id": "1923", "is_new_question": false @@ -33150,8 +33612,8 @@ "question__title": "Count Good Numbers", "question__title_slug": "count-good-numbers", "question__hide": false, - "total_acs": 7779, - "total_submitted": 20947, + "total_acs": 7860, + "total_submitted": 21082, "total_column_articles": 108, "frontend_question_id": "1922", "is_new_question": false @@ -33171,8 +33633,8 @@ "question__title": "Eliminate Maximum Number of Monsters", "question__title_slug": "eliminate-maximum-number-of-monsters", "question__hide": false, - "total_acs": 29661, - "total_submitted": 60495, + "total_acs": 29710, + "total_submitted": 60570, "total_column_articles": 311, "frontend_question_id": "1921", "is_new_question": false @@ -33192,9 +33654,9 @@ "question__title": "Build Array from Permutation", "question__title_slug": "build-array-from-permutation", "question__hide": false, - "total_acs": 41564, - "total_submitted": 48084, - "total_column_articles": 352, + "total_acs": 41937, + "total_submitted": 48485, + "total_column_articles": 353, "frontend_question_id": "1920", "is_new_question": false }, @@ -33213,8 +33675,8 @@ "question__title": "Find a Peak Element II", "question__title_slug": "find-a-peak-element-ii", "question__hide": false, - "total_acs": 24104, - "total_submitted": 40640, + "total_acs": 24300, + "total_submitted": 40993, "total_column_articles": 225, "frontend_question_id": "1901", "is_new_question": false @@ -33234,8 +33696,8 @@ "question__title": "Page Recommendations II", "question__title_slug": "page-recommendations-ii", "question__hide": false, - "total_acs": 2811, - "total_submitted": 7316, + "total_acs": 2843, + "total_submitted": 7383, "total_column_articles": 40, "frontend_question_id": "1892", "is_new_question": false @@ -33255,8 +33717,8 @@ "question__title": "Cutting Ribbons", "question__title_slug": "cutting-ribbons", "question__hide": false, - "total_acs": 4813, - "total_submitted": 11293, + "total_acs": 4830, + "total_submitted": 11323, "total_column_articles": 56, "frontend_question_id": "1891", "is_new_question": false @@ -33276,9 +33738,9 @@ "question__title": "Number of Wonderful Substrings", "question__title_slug": "number-of-wonderful-substrings", "question__hide": false, - "total_acs": 5681, - "total_submitted": 12079, - "total_column_articles": 93, + "total_acs": 5883, + "total_submitted": 12351, + "total_column_articles": 94, "frontend_question_id": "1915", "is_new_question": false }, @@ -33297,8 +33759,8 @@ "question__title": "Cyclically Rotating a Grid", "question__title_slug": "cyclically-rotating-a-grid", "question__hide": false, - "total_acs": 4737, - "total_submitted": 10019, + "total_acs": 4770, + "total_submitted": 10074, "total_column_articles": 104, "frontend_question_id": "1914", "is_new_question": false @@ -33318,9 +33780,9 @@ "question__title": "Maximum Product Difference Between Two Pairs", "question__title_slug": "maximum-product-difference-between-two-pairs", "question__hide": false, - "total_acs": 24331, - "total_submitted": 30124, - "total_column_articles": 268, + "total_acs": 24507, + "total_submitted": 30316, + "total_column_articles": 269, "frontend_question_id": "1913", "is_new_question": false }, @@ -33339,8 +33801,8 @@ "question__title": "The Latest Login in 2020", "question__title_slug": "the-latest-login-in-2020", "question__hide": false, - "total_acs": 37687, - "total_submitted": 53971, + "total_acs": 38190, + "total_submitted": 54662, "total_column_articles": 237, "frontend_question_id": "1890", "is_new_question": false @@ -33360,8 +33822,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": 6229, - "total_submitted": 13554, + "total_acs": 6265, + "total_submitted": 13625, "total_column_articles": 90, "frontend_question_id": "1928", "is_new_question": false @@ -33381,8 +33843,8 @@ "question__title": "Sum Game", "question__title_slug": "sum-game", "question__hide": false, - "total_acs": 3623, - "total_submitted": 8204, + "total_acs": 3645, + "total_submitted": 8234, "total_column_articles": 73, "frontend_question_id": "1927", "is_new_question": false @@ -33402,9 +33864,9 @@ "question__title": "Nearest Exit from Entrance in Maze", "question__title_slug": "nearest-exit-from-entrance-in-maze", "question__hide": false, - "total_acs": 22779, - "total_submitted": 56422, - "total_column_articles": 249, + "total_acs": 23250, + "total_submitted": 57443, + "total_column_articles": 253, "frontend_question_id": "1926", "is_new_question": false }, @@ -33423,9 +33885,9 @@ "question__title": "Count Square Sum Triples", "question__title_slug": "count-square-sum-triples", "question__hide": false, - "total_acs": 15454, - "total_submitted": 22440, - "total_column_articles": 163, + "total_acs": 15600, + "total_submitted": 22633, + "total_column_articles": 162, "frontend_question_id": "1925", "is_new_question": false }, @@ -33444,8 +33906,8 @@ "question__title": "Count Pairs in Two Arrays", "question__title_slug": "count-pairs-in-two-arrays", "question__hide": false, - "total_acs": 1349, - "total_submitted": 2287, + "total_acs": 1361, + "total_submitted": 2419, "total_column_articles": 32, "frontend_question_id": "1885", "is_new_question": false @@ -33465,9 +33927,9 @@ "question__title": "Count Sub Islands", "question__title_slug": "count-sub-islands", "question__hide": false, - "total_acs": 30504, - "total_submitted": 45469, - "total_column_articles": 461, + "total_acs": 30692, + "total_submitted": 45740, + "total_column_articles": 462, "frontend_question_id": "1905", "is_new_question": false }, @@ -33486,9 +33948,9 @@ "question__title": "Minimum Absolute Difference Queries", "question__title_slug": "minimum-absolute-difference-queries", "question__hide": false, - "total_acs": 4472, - "total_submitted": 9777, - "total_column_articles": 76, + "total_acs": 4500, + "total_submitted": 9821, + "total_column_articles": 77, "frontend_question_id": "1906", "is_new_question": false }, @@ -33507,8 +33969,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": 6446, - "total_submitted": 19948, + "total_acs": 6473, + "total_submitted": 20011, "total_column_articles": 117, "frontend_question_id": "1904", "is_new_question": false @@ -33528,9 +33990,9 @@ "question__title": "Largest Odd Number in String", "question__title_slug": "largest-odd-number-in-string", "question__hide": false, - "total_acs": 19589, - "total_submitted": 31976, - "total_column_articles": 234, + "total_acs": 19701, + "total_submitted": 32152, + "total_column_articles": 235, "frontend_question_id": "1903", "is_new_question": false }, @@ -33549,9 +34011,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": 9641, - "total_submitted": 13482, - "total_column_articles": 120, + "total_acs": 9797, + "total_submitted": 13672, + "total_column_articles": 121, "frontend_question_id": "1884", "is_new_question": false }, @@ -33570,8 +34032,8 @@ "question__title": "Group Employees of the Same Salary", "question__title_slug": "group-employees-of-the-same-salary", "question__hide": false, - "total_acs": 2972, - "total_submitted": 4705, + "total_acs": 3007, + "total_submitted": 4766, "total_column_articles": 50, "frontend_question_id": "1875", "is_new_question": false @@ -33591,8 +34053,8 @@ "question__title": "Minimize Product Sum of Two Arrays", "question__title_slug": "minimize-product-sum-of-two-arrays", "question__hide": false, - "total_acs": 1301, - "total_submitted": 1560, + "total_acs": 1304, + "total_submitted": 1563, "total_column_articles": 43, "frontend_question_id": "1874", "is_new_question": false @@ -33612,9 +34074,9 @@ "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": 2113, - "total_submitted": 4570, - "total_column_articles": 52, + "total_acs": 2128, + "total_submitted": 4592, + "total_column_articles": 53, "frontend_question_id": "1900", "is_new_question": false }, @@ -33633,9 +34095,9 @@ "question__title": "Maximum Number of Removable Characters", "question__title_slug": "maximum-number-of-removable-characters", "question__hide": false, - "total_acs": 10509, - "total_submitted": 26473, - "total_column_articles": 135, + "total_acs": 10651, + "total_submitted": 26713, + "total_column_articles": 137, "frontend_question_id": "1898", "is_new_question": false }, @@ -33654,9 +34116,9 @@ "question__title": "Merge Triplets to Form Target Triplet", "question__title_slug": "merge-triplets-to-form-target-triplet", "question__hide": false, - "total_acs": 6577, - "total_submitted": 10045, - "total_column_articles": 92, + "total_acs": 6613, + "total_submitted": 10089, + "total_column_articles": 94, "frontend_question_id": "1899", "is_new_question": false }, @@ -33675,9 +34137,9 @@ "question__title": "Redistribute Characters to Make All Strings Equal", "question__title_slug": "redistribute-characters-to-make-all-strings-equal", "question__hide": false, - "total_acs": 12441, - "total_submitted": 22225, - "total_column_articles": 158, + "total_acs": 12502, + "total_submitted": 22331, + "total_column_articles": 159, "frontend_question_id": "1897", "is_new_question": false }, @@ -33696,9 +34158,9 @@ "question__title": "Calculate Special Bonus", "question__title_slug": "calculate-special-bonus", "question__hide": false, - "total_acs": 96543, - "total_submitted": 156814, - "total_column_articles": 462, + "total_acs": 97262, + "total_submitted": 158065, + "total_column_articles": 465, "frontend_question_id": "1873", "is_new_question": false }, @@ -33717,8 +34179,8 @@ "question__title": "Design Movie Rental System", "question__title_slug": "design-movie-rental-system", "question__hide": false, - "total_acs": 4734, - "total_submitted": 19615, + "total_acs": 4751, + "total_submitted": 19701, "total_column_articles": 89, "frontend_question_id": "1912", "is_new_question": false @@ -33738,9 +34200,9 @@ "question__title": "Maximum Alternating Subsequence Sum", "question__title_slug": "maximum-alternating-subsequence-sum", "question__hide": false, - "total_acs": 27678, - "total_submitted": 41143, - "total_column_articles": 314, + "total_acs": 27841, + "total_submitted": 41369, + "total_column_articles": 315, "frontend_question_id": "1911", "is_new_question": false }, @@ -33759,9 +34221,9 @@ "question__title": "Remove All Occurrences of a Substring", "question__title_slug": "remove-all-occurrences-of-a-substring", "question__hide": false, - "total_acs": 7909, - "total_submitted": 11890, - "total_column_articles": 142, + "total_acs": 7975, + "total_submitted": 11985, + "total_column_articles": 144, "frontend_question_id": "1910", "is_new_question": false }, @@ -33780,9 +34242,9 @@ "question__title": "Remove One Element to Make the Array Strictly Increasing", "question__title_slug": "remove-one-element-to-make-the-array-strictly-increasing", "question__hide": false, - "total_acs": 12683, - "total_submitted": 41512, - "total_column_articles": 185, + "total_acs": 12807, + "total_submitted": 41871, + "total_column_articles": 188, "frontend_question_id": "1909", "is_new_question": false }, @@ -33801,8 +34263,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": 2538, - "total_submitted": 5210, + "total_acs": 2558, + "total_submitted": 5258, "total_column_articles": 54, "frontend_question_id": "1868", "is_new_question": false @@ -33822,9 +34284,9 @@ "question__title": "Minimum Space Wasted From Packaging", "question__title_slug": "minimum-space-wasted-from-packaging", "question__hide": false, - "total_acs": 4227, - "total_submitted": 13936, - "total_column_articles": 67, + "total_acs": 4248, + "total_submitted": 13967, + "total_column_articles": 68, "frontend_question_id": "1889", "is_new_question": false }, @@ -33843,8 +34305,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": 4882, - "total_submitted": 13400, + "total_acs": 4914, + "total_submitted": 13468, "total_column_articles": 101, "frontend_question_id": "1888", "is_new_question": false @@ -33864,9 +34326,9 @@ "question__title": "Reduction Operations to Make the Array Elements Equal", "question__title_slug": "reduction-operations-to-make-the-array-elements-equal", "question__hide": false, - "total_acs": 9121, - "total_submitted": 13810, - "total_column_articles": 126, + "total_acs": 9165, + "total_submitted": 13862, + "total_column_articles": 127, "frontend_question_id": "1887", "is_new_question": false }, @@ -33885,8 +34347,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": 12449, - "total_submitted": 20756, + "total_acs": 12534, + "total_submitted": 20870, "total_column_articles": 184, "frontend_question_id": "1886", "is_new_question": false @@ -33906,8 +34368,8 @@ "question__title": "Orders With Maximum Quantity Above Average", "question__title_slug": "orders-with-maximum-quantity-above-average", "question__hide": false, - "total_acs": 5613, - "total_submitted": 8339, + "total_acs": 5645, + "total_submitted": 8384, "total_column_articles": 61, "frontend_question_id": "1867", "is_new_question": false @@ -33927,9 +34389,9 @@ "question__title": "Minimum Skips to Arrive at Meeting On Time", "question__title_slug": "minimum-skips-to-arrive-at-meeting-on-time", "question__hide": false, - "total_acs": 12678, - "total_submitted": 22220, - "total_column_articles": 84, + "total_acs": 12738, + "total_submitted": 22299, + "total_column_articles": 83, "frontend_question_id": "1883", "is_new_question": false }, @@ -33948,8 +34410,8 @@ "question__title": "Process Tasks Using Servers", "question__title_slug": "process-tasks-using-servers", "question__hide": false, - "total_acs": 6207, - "total_submitted": 19671, + "total_acs": 6261, + "total_submitted": 19775, "total_column_articles": 155, "frontend_question_id": "1882", "is_new_question": false @@ -33969,9 +34431,9 @@ "question__title": "Maximum Value after Insertion", "question__title_slug": "maximum-value-after-insertion", "question__hide": false, - "total_acs": 10361, - "total_submitted": 26961, - "total_column_articles": 107, + "total_acs": 10420, + "total_submitted": 27074, + "total_column_articles": 108, "frontend_question_id": "1881", "is_new_question": false }, @@ -33990,9 +34452,9 @@ "question__title": "Check if Word Equals Summation of Two Words", "question__title_slug": "check-if-word-equals-summation-of-two-words", "question__hide": false, - "total_acs": 14838, - "total_submitted": 19441, - "total_column_articles": 232, + "total_acs": 14953, + "total_submitted": 19585, + "total_column_articles": 235, "frontend_question_id": "1880", "is_new_question": false }, @@ -34011,8 +34473,8 @@ "question__title": "Longest Word With All Prefixes", "question__title_slug": "longest-word-with-all-prefixes", "question__hide": false, - "total_acs": 1297, - "total_submitted": 1991, + "total_acs": 1299, + "total_submitted": 1993, "total_column_articles": 47, "frontend_question_id": "1858", "is_new_question": false @@ -34032,9 +34494,9 @@ "question__title": "Minimum Cost to Change the Final Value of Expression", "question__title_slug": "minimum-cost-to-change-the-final-value-of-expression", "question__hide": false, - "total_acs": 1539, - "total_submitted": 3057, - "total_column_articles": 40, + "total_acs": 1547, + "total_submitted": 3068, + "total_column_articles": 41, "frontend_question_id": "1896", "is_new_question": false }, @@ -34053,8 +34515,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": 417, - "total_submitted": 763, + "total_acs": 419, + "total_submitted": 766, "total_column_articles": 18, "frontend_question_id": "2247", "is_new_question": false @@ -34074,8 +34536,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": 49629, - "total_submitted": 108066, + "total_acs": 49670, + "total_submitted": 108148, "total_column_articles": 625, "frontend_question_id": "1894", "is_new_question": false @@ -34095,8 +34557,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": 41489, - "total_submitted": 70311, + "total_acs": 41642, + "total_submitted": 70533, "total_column_articles": 548, "frontend_question_id": "1893", "is_new_question": false @@ -34116,8 +34578,8 @@ "question__title": "Convert Date Format", "question__title_slug": "convert-date-format", "question__hide": false, - "total_acs": 3961, - "total_submitted": 6160, + "total_acs": 3985, + "total_submitted": 6195, "total_column_articles": 37, "frontend_question_id": "1853", "is_new_question": false @@ -34137,8 +34599,8 @@ "question__title": "Distinct Numbers in Each Subarray", "question__title_slug": "distinct-numbers-in-each-subarray", "question__hide": false, - "total_acs": 1053, - "total_submitted": 1690, + "total_acs": 1074, + "total_submitted": 1814, "total_column_articles": 23, "frontend_question_id": "1852", "is_new_question": false @@ -34158,8 +34620,8 @@ "question__title": "Stone Game VIII", "question__title_slug": "stone-game-viii", "question__hide": false, - "total_acs": 3761, - "total_submitted": 6222, + "total_acs": 3797, + "total_submitted": 6273, "total_column_articles": 52, "frontend_question_id": "1872", "is_new_question": false @@ -34179,8 +34641,8 @@ "question__title": "Jump Game VII", "question__title_slug": "jump-game-vii", "question__hide": false, - "total_acs": 10715, - "total_submitted": 36820, + "total_acs": 10800, + "total_submitted": 37062, "total_column_articles": 191, "frontend_question_id": "1871", "is_new_question": false @@ -34200,8 +34662,8 @@ "question__title": "Minimum Speed to Arrive on Time", "question__title_slug": "minimum-speed-to-arrive-on-time", "question__hide": false, - "total_acs": 15975, - "total_submitted": 37945, + "total_acs": 16174, + "total_submitted": 38412, "total_column_articles": 169, "frontend_question_id": "1870", "is_new_question": false @@ -34221,9 +34683,9 @@ "question__title": "Longer Contiguous Segments of Ones than Zeros", "question__title_slug": "longer-contiguous-segments-of-ones-than-zeros", "question__hide": false, - "total_acs": 22208, - "total_submitted": 32087, - "total_column_articles": 296, + "total_acs": 22348, + "total_submitted": 32274, + "total_column_articles": 298, "frontend_question_id": "1869", "is_new_question": false }, @@ -34242,8 +34704,8 @@ "question__title": "Suspicious Bank Accounts", "question__title_slug": "suspicious-bank-accounts", "question__hide": false, - "total_acs": 3619, - "total_submitted": 8522, + "total_acs": 3652, + "total_submitted": 8580, "total_column_articles": 53, "frontend_question_id": "1843", "is_new_question": false @@ -34263,8 +34725,8 @@ "question__title": "Next Palindrome Using Same Digits", "question__title_slug": "next-palindrome-using-same-digits", "question__hide": false, - "total_acs": 447, - "total_submitted": 866, + "total_acs": 448, + "total_submitted": 867, "total_column_articles": 20, "frontend_question_id": "1842", "is_new_question": false @@ -34284,8 +34746,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": 4162, - "total_submitted": 6647, + "total_acs": 4196, + "total_submitted": 6695, "total_column_articles": 77, "frontend_question_id": "1866", "is_new_question": false @@ -34305,9 +34767,9 @@ "question__title": "Finding Pairs With a Certain Sum", "question__title_slug": "finding-pairs-with-a-certain-sum", "question__hide": false, - "total_acs": 7814, - "total_submitted": 15319, - "total_column_articles": 91, + "total_acs": 7862, + "total_submitted": 15381, + "total_column_articles": 92, "frontend_question_id": "1865", "is_new_question": false }, @@ -34326,9 +34788,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": 8496, - "total_submitted": 20428, - "total_column_articles": 182, + "total_acs": 8575, + "total_submitted": 20609, + "total_column_articles": 184, "frontend_question_id": "1864", "is_new_question": false }, @@ -34347,9 +34809,9 @@ "question__title": "Sum of All Subset XOR Totals", "question__title_slug": "sum-of-all-subset-xor-totals", "question__hide": false, - "total_acs": 25935, - "total_submitted": 31117, - "total_column_articles": 302, + "total_acs": 26331, + "total_submitted": 31574, + "total_column_articles": 304, "frontend_question_id": "1863", "is_new_question": false }, @@ -34368,9 +34830,9 @@ "question__title": "Sort Linked List Already Sorted Using Absolute Values", "question__title_slug": "sort-linked-list-already-sorted-using-absolute-values", "question__hide": false, - "total_acs": 998, - "total_submitted": 1559, - "total_column_articles": 35, + "total_acs": 1052, + "total_submitted": 1645, + "total_column_articles": 36, "frontend_question_id": "2046", "is_new_question": false }, @@ -34389,9 +34851,9 @@ "question__title": "League Statistics", "question__title_slug": "league-statistics", "question__hide": false, - "total_acs": 3485, - "total_submitted": 6680, - "total_column_articles": 73, + "total_acs": 3513, + "total_submitted": 6724, + "total_column_articles": 74, "frontend_question_id": "1841", "is_new_question": false }, @@ -34410,9 +34872,9 @@ "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": 3530, - "total_submitted": 7543, - "total_column_articles": 82, + "total_acs": 3568, + "total_submitted": 7597, + "total_column_articles": 83, "frontend_question_id": "1878", "is_new_question": false }, @@ -34431,8 +34893,8 @@ "question__title": "Minimum XOR Sum of Two Arrays", "question__title_slug": "minimum-xor-sum-of-two-arrays", "question__hide": false, - "total_acs": 5232, - "total_submitted": 9819, + "total_acs": 5355, + "total_submitted": 9984, "total_column_articles": 80, "frontend_question_id": "1879", "is_new_question": false @@ -34452,9 +34914,9 @@ "question__title": "Minimize Maximum Pair Sum in Array", "question__title_slug": "minimize-maximum-pair-sum-in-array", "question__hide": false, - "total_acs": 40191, - "total_submitted": 49733, - "total_column_articles": 501, + "total_acs": 40263, + "total_submitted": 49817, + "total_column_articles": 502, "frontend_question_id": "1877", "is_new_question": false }, @@ -34473,9 +34935,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": 20100, - "total_submitted": 28513, - "total_column_articles": 304, + "total_acs": 20245, + "total_submitted": 28712, + "total_column_articles": 306, "frontend_question_id": "1876", "is_new_question": false }, @@ -34494,9 +34956,9 @@ "question__title": "Largest Color Value in a Directed Graph", "question__title_slug": "largest-color-value-in-a-directed-graph", "question__hide": false, - "total_acs": 5324, - "total_submitted": 10851, - "total_column_articles": 70, + "total_acs": 5395, + "total_submitted": 10967, + "total_column_articles": 71, "frontend_question_id": "1857", "is_new_question": false }, @@ -34515,9 +34977,9 @@ "question__title": "Maximum Subarray Min-Product", "question__title_slug": "maximum-subarray-min-product", "question__hide": false, - "total_acs": 11436, - "total_submitted": 29896, - "total_column_articles": 163, + "total_acs": 11507, + "total_submitted": 30037, + "total_column_articles": 165, "frontend_question_id": "1856", "is_new_question": false }, @@ -34536,8 +34998,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": 22583, - "total_submitted": 38280, + "total_acs": 22640, + "total_submitted": 38394, "total_column_articles": 253, "frontend_question_id": "1855", "is_new_question": false @@ -34557,8 +35019,8 @@ "question__title": "Maximum Population Year", "question__title_slug": "maximum-population-year", "question__hide": false, - "total_acs": 19728, - "total_submitted": 27508, + "total_acs": 19909, + "total_submitted": 27780, "total_column_articles": 245, "frontend_question_id": "1854", "is_new_question": false @@ -34578,8 +35040,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": 2538, - "total_submitted": 3545, + "total_acs": 2578, + "total_submitted": 3603, "total_column_articles": 65, "frontend_question_id": "1836", "is_new_question": false @@ -34599,9 +35061,9 @@ "question__title": "Maximum Transaction Each Day", "question__title_slug": "maximum-transaction-each-day", "question__hide": false, - "total_acs": 7374, - "total_submitted": 9738, - "total_column_articles": 88, + "total_acs": 7543, + "total_submitted": 9972, + "total_column_articles": 89, "frontend_question_id": "1831", "is_new_question": false }, @@ -34620,8 +35082,8 @@ "question__title": "Faulty Sensor", "question__title_slug": "faulty-sensor", "question__hide": false, - "total_acs": 1032, - "total_submitted": 2452, + "total_acs": 1036, + "total_submitted": 2458, "total_column_articles": 41, "frontend_question_id": "1826", "is_new_question": false @@ -34641,9 +35103,9 @@ "question__title": "Maximum Number of People That Can Be Caught in Tag", "question__title_slug": "maximum-number-of-people-that-can-be-caught-in-tag", "question__hide": false, - "total_acs": 449, - "total_submitted": 841, - "total_column_articles": 17, + "total_acs": 468, + "total_submitted": 869, + "total_column_articles": 18, "frontend_question_id": "1989", "is_new_question": false }, @@ -34662,8 +35124,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": 3935, - "total_submitted": 6248, + "total_acs": 3966, + "total_submitted": 6285, "total_column_articles": 72, "frontend_question_id": "1850", "is_new_question": false @@ -34683,9 +35145,9 @@ "question__title": "Minimum Interval to Include Each Query", "question__title_slug": "minimum-interval-to-include-each-query", "question__hide": false, - "total_acs": 15751, - "total_submitted": 30284, - "total_column_articles": 176, + "total_acs": 15790, + "total_submitted": 30346, + "total_column_articles": 177, "frontend_question_id": "1851", "is_new_question": false }, @@ -34704,8 +35166,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": 8327, - "total_submitted": 24694, + "total_acs": 8365, + "total_submitted": 24797, "total_column_articles": 147, "frontend_question_id": "1849", "is_new_question": false @@ -34725,8 +35187,8 @@ "question__title": "Minimum Distance to the Target Element", "question__title_slug": "minimum-distance-to-the-target-element", "question__hide": false, - "total_acs": 15682, - "total_submitted": 23629, + "total_acs": 15771, + "total_submitted": 23746, "total_column_articles": 204, "frontend_question_id": "1848", "is_new_question": false @@ -34746,9 +35208,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": 13779, - "total_submitted": 16018, - "total_column_articles": 55, + "total_acs": 14181, + "total_submitted": 16490, + "total_column_articles": 57, "frontend_question_id": "1821", "is_new_question": false }, @@ -34767,9 +35229,9 @@ "question__title": "Rotating the Box", "question__title_slug": "rotating-the-box", "question__hide": false, - "total_acs": 6576, - "total_submitted": 10400, - "total_column_articles": 124, + "total_acs": 6622, + "total_submitted": 10459, + "total_column_articles": 126, "frontend_question_id": "1861", "is_new_question": false }, @@ -34788,8 +35250,8 @@ "question__title": "Incremental Memory Leak", "question__title_slug": "incremental-memory-leak", "question__hide": false, - "total_acs": 7591, - "total_submitted": 9925, + "total_acs": 7622, + "total_submitted": 9966, "total_column_articles": 135, "frontend_question_id": "1860", "is_new_question": false @@ -34809,9 +35271,9 @@ "question__title": "Sorting the Sentence", "question__title_slug": "sorting-the-sentence", "question__hide": false, - "total_acs": 18170, - "total_submitted": 24772, - "total_column_articles": 353, + "total_acs": 18397, + "total_submitted": 25047, + "total_column_articles": 355, "frontend_question_id": "1859", "is_new_question": false }, @@ -34830,8 +35292,8 @@ "question__title": "Maximum Number of Accepted Invitations", "question__title_slug": "maximum-number-of-accepted-invitations", "question__hide": false, - "total_acs": 513, - "total_submitted": 1120, + "total_acs": 519, + "total_submitted": 1129, "total_column_articles": 18, "frontend_question_id": "1820", "is_new_question": false @@ -34851,8 +35313,8 @@ "question__title": "Maximum Building Height", "question__title_slug": "maximum-building-height", "question__hide": false, - "total_acs": 3268, - "total_submitted": 8290, + "total_acs": 3277, + "total_submitted": 8333, "total_column_articles": 67, "frontend_question_id": "1840", "is_new_question": false @@ -34872,9 +35334,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": 14498, - "total_submitted": 29911, - "total_column_articles": 249, + "total_acs": 14606, + "total_submitted": 30122, + "total_column_articles": 250, "frontend_question_id": "1839", "is_new_question": false }, @@ -34893,9 +35355,9 @@ "question__title": "Frequency of the Most Frequent Element", "question__title_slug": "frequency-of-the-most-frequent-element", "question__hide": false, - "total_acs": 38815, - "total_submitted": 90277, - "total_column_articles": 405, + "total_acs": 39038, + "total_submitted": 90792, + "total_column_articles": 407, "frontend_question_id": "1838", "is_new_question": false }, @@ -34914,8 +35376,8 @@ "question__title": "Sum of Digits in Base K", "question__title_slug": "sum-of-digits-in-base-k", "question__hide": false, - "total_acs": 18100, - "total_submitted": 23043, + "total_acs": 18210, + "total_submitted": 23172, "total_column_articles": 195, "frontend_question_id": "1837", "is_new_question": false @@ -34935,9 +35397,9 @@ "question__title": "Find Interview Candidates", "question__title_slug": "find-interview-candidates", "question__hide": false, - "total_acs": 3963, - "total_submitted": 6409, - "total_column_articles": 64, + "total_acs": 3999, + "total_submitted": 6474, + "total_column_articles": 66, "frontend_question_id": "1811", "is_new_question": false }, @@ -34956,8 +35418,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": 5874, - "total_submitted": 10275, + "total_acs": 5944, + "total_submitted": 10368, "total_column_articles": 84, "frontend_question_id": "1835", "is_new_question": false @@ -34977,9 +35439,9 @@ "question__title": "Single-Threaded CPU", "question__title_slug": "single-threaded-cpu", "question__hide": false, - "total_acs": 11443, - "total_submitted": 29897, - "total_column_articles": 191, + "total_acs": 11514, + "total_submitted": 30076, + "total_column_articles": 192, "frontend_question_id": "1834", "is_new_question": false }, @@ -34998,8 +35460,8 @@ "question__title": "Maximum Ice Cream Bars", "question__title_slug": "maximum-ice-cream-bars", "question__hide": false, - "total_acs": 50848, - "total_submitted": 74710, + "total_acs": 50895, + "total_submitted": 74770, "total_column_articles": 468, "frontend_question_id": "1833", "is_new_question": false @@ -35019,9 +35481,9 @@ "question__title": "Check if the Sentence Is Pangram", "question__title_slug": "check-if-the-sentence-is-pangram", "question__hide": false, - "total_acs": 55542, - "total_submitted": 65924, - "total_column_articles": 649, + "total_acs": 55735, + "total_submitted": 66158, + "total_column_articles": 651, "frontend_question_id": "1832", "is_new_question": false }, @@ -35040,8 +35502,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": 460, - "total_submitted": 772, + "total_acs": 462, + "total_submitted": 788, "total_column_articles": 11, "frontend_question_id": "1810", "is_new_question": false @@ -35061,9 +35523,9 @@ "question__title": "Ad-Free Sessions", "question__title_slug": "ad-free-sessions", "question__hide": false, - "total_acs": 5338, - "total_submitted": 8765, - "total_column_articles": 56, + "total_acs": 5368, + "total_submitted": 8827, + "total_column_articles": 58, "frontend_question_id": "1809", "is_new_question": false }, @@ -35082,9 +35544,9 @@ "question__title": "Closest Room", "question__title_slug": "closest-room", "question__hide": false, - "total_acs": 4361, - "total_submitted": 10787, - "total_column_articles": 83, + "total_acs": 4386, + "total_submitted": 10822, + "total_column_articles": 84, "frontend_question_id": "1847", "is_new_question": false }, @@ -35103,8 +35565,8 @@ "question__title": "Maximum Element After Decreasing and Rearranging", "question__title_slug": "maximum-element-after-decreasing-and-rearranging", "question__hide": false, - "total_acs": 32027, - "total_submitted": 50771, + "total_acs": 32086, + "total_submitted": 50860, "total_column_articles": 417, "frontend_question_id": "1846", "is_new_question": false @@ -35124,9 +35586,9 @@ "question__title": "Seat Reservation Manager", "question__title_slug": "seat-reservation-manager", "question__hide": false, - "total_acs": 17274, - "total_submitted": 35739, - "total_column_articles": 176, + "total_acs": 17392, + "total_submitted": 35918, + "total_column_articles": 177, "frontend_question_id": "1845", "is_new_question": false }, @@ -35145,8 +35607,8 @@ "question__title": "Replace All Digits with Characters", "question__title_slug": "replace-all-digits-with-characters", "question__hide": false, - "total_acs": 15590, - "total_submitted": 19700, + "total_acs": 15688, + "total_submitted": 19825, "total_column_articles": 231, "frontend_question_id": "1844", "is_new_question": false @@ -35166,9 +35628,9 @@ "question__title": "Finding MK Average", "question__title_slug": "finding-mk-average", "question__hide": false, - "total_acs": 14020, - "total_submitted": 32347, - "total_column_articles": 192, + "total_acs": 14034, + "total_submitted": 32377, + "total_column_articles": 194, "frontend_question_id": "1825", "is_new_question": false }, @@ -35187,9 +35649,9 @@ "question__title": "Minimum Sideway Jumps", "question__title_slug": "minimum-sideway-jumps", "question__hide": false, - "total_acs": 24107, - "total_submitted": 35397, - "total_column_articles": 341, + "total_acs": 24131, + "total_submitted": 35434, + "total_column_articles": 342, "frontend_question_id": "1824", "is_new_question": false }, @@ -35208,9 +35670,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": 57615, - "total_submitted": 73792, - "total_column_articles": 593, + "total_acs": 57741, + "total_submitted": 73955, + "total_column_articles": 594, "frontend_question_id": "1823", "is_new_question": false }, @@ -35229,9 +35691,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": 87925, - "total_submitted": 124458, - "total_column_articles": 832, + "total_acs": 88265, + "total_submitted": 124950, + "total_column_articles": 833, "frontend_question_id": "1822", "is_new_question": false }, @@ -35250,9 +35712,9 @@ "question__title": "Implement Trie II (Prefix Tree)", "question__title_slug": "implement-trie-ii-prefix-tree", "question__hide": false, - "total_acs": 2973, - "total_submitted": 5137, - "total_column_articles": 69, + "total_acs": 3003, + "total_submitted": 5244, + "total_column_articles": 70, "frontend_question_id": "1804", "is_new_question": false }, @@ -35271,9 +35733,9 @@ "question__title": "Rearrange Products Table", "question__title_slug": "rearrange-products-table", "question__hide": false, - "total_acs": 51026, - "total_submitted": 65121, - "total_column_articles": 241, + "total_acs": 51496, + "total_submitted": 65681, + "total_column_articles": 245, "frontend_question_id": "1795", "is_new_question": false }, @@ -35292,8 +35754,8 @@ "question__title": "Number of Different Subsequences GCDs", "question__title_slug": "number-of-different-subsequences-gcds", "question__hide": false, - "total_acs": 16483, - "total_submitted": 26270, + "total_acs": 16510, + "total_submitted": 26321, "total_column_articles": 109, "frontend_question_id": "1819", "is_new_question": false @@ -35313,8 +35775,8 @@ "question__title": "Minimum Absolute Sum Difference", "question__title_slug": "minimum-absolute-sum-difference", "question__hide": false, - "total_acs": 32596, - "total_submitted": 86815, + "total_acs": 32745, + "total_submitted": 87192, "total_column_articles": 402, "frontend_question_id": "1818", "is_new_question": false @@ -35334,8 +35796,8 @@ "question__title": "Finding the Users Active Minutes", "question__title_slug": "finding-the-users-active-minutes", "question__hide": false, - "total_acs": 25466, - "total_submitted": 32109, + "total_acs": 25504, + "total_submitted": 32149, "total_column_articles": 320, "frontend_question_id": "1817", "is_new_question": false @@ -35355,9 +35817,9 @@ "question__title": "Truncate Sentence", "question__title_slug": "truncate-sentence", "question__hide": false, - "total_acs": 57321, - "total_submitted": 78990, - "total_column_articles": 758, + "total_acs": 57438, + "total_submitted": 79130, + "total_column_articles": 761, "frontend_question_id": "1816", "is_new_question": false }, @@ -35376,8 +35838,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": 443, - "total_submitted": 816, + "total_acs": 446, + "total_submitted": 860, "total_column_articles": 14, "frontend_question_id": "1794", "is_new_question": false @@ -35397,9 +35859,9 @@ "question__title": "Primary Department for Each Employee", "question__title_slug": "primary-department-for-each-employee", "question__hide": false, - "total_acs": 24166, - "total_submitted": 35540, - "total_column_articles": 205, + "total_acs": 25456, + "total_submitted": 37465, + "total_column_articles": 211, "frontend_question_id": "1789", "is_new_question": false }, @@ -35418,9 +35880,9 @@ "question__title": "Minimum Number of Operations to Make String Sorted", "question__title_slug": "minimum-number-of-operations-to-make-string-sorted", "question__hide": false, - "total_acs": 1654, - "total_submitted": 3169, - "total_column_articles": 31, + "total_acs": 1663, + "total_submitted": 3190, + "total_column_articles": 32, "frontend_question_id": "1830", "is_new_question": false }, @@ -35439,9 +35901,9 @@ "question__title": "Maximum XOR for Each Query", "question__title_slug": "maximum-xor-for-each-query", "question__hide": false, - "total_acs": 7326, - "total_submitted": 10058, - "total_column_articles": 130, + "total_acs": 7394, + "total_submitted": 10138, + "total_column_articles": 131, "frontend_question_id": "1829", "is_new_question": false }, @@ -35460,9 +35922,9 @@ "question__title": "Queries on Number of Points Inside a Circle", "question__title_slug": "queries-on-number-of-points-inside-a-circle", "question__hide": false, - "total_acs": 32327, - "total_submitted": 36782, - "total_column_articles": 338, + "total_acs": 32437, + "total_submitted": 36897, + "total_column_articles": 339, "frontend_question_id": "1828", "is_new_question": false }, @@ -35481,9 +35943,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": 42638, - "total_submitted": 52711, - "total_column_articles": 445, + "total_acs": 42779, + "total_submitted": 52886, + "total_column_articles": 446, "frontend_question_id": "1827", "is_new_question": false }, @@ -35502,8 +35964,8 @@ "question__title": "Maximize the Beauty of the Garden", "question__title_slug": "maximize-the-beauty-of-the-garden", "question__hide": false, - "total_acs": 785, - "total_submitted": 1310, + "total_acs": 789, + "total_submitted": 1314, "total_column_articles": 32, "frontend_question_id": "1788", "is_new_question": false @@ -35523,8 +35985,8 @@ "question__title": "Maximize Number of Nice Divisors", "question__title_slug": "maximize-number-of-nice-divisors", "question__hide": false, - "total_acs": 3662, - "total_submitted": 12527, + "total_acs": 3675, + "total_submitted": 12551, "total_column_articles": 65, "frontend_question_id": "1808", "is_new_question": false @@ -35544,8 +36006,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": 26437, - "total_submitted": 34393, + "total_acs": 26465, + "total_submitted": 34428, "total_column_articles": 306, "frontend_question_id": "1806", "is_new_question": false @@ -35565,8 +36027,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": 32019, - "total_submitted": 47423, + "total_acs": 32076, + "total_submitted": 47497, "total_column_articles": 439, "frontend_question_id": "1807", "is_new_question": false @@ -35586,8 +36048,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": 41052, - "total_submitted": 95523, + "total_acs": 41131, + "total_submitted": 95695, "total_column_articles": 571, "frontend_question_id": "1805", "is_new_question": false @@ -35607,9 +36069,9 @@ "question__title": "Grand Slam Titles", "question__title_slug": "grand-slam-titles", "question__hide": false, - "total_acs": 8958, - "total_submitted": 11537, - "total_column_articles": 103, + "total_acs": 9118, + "total_submitted": 11721, + "total_column_articles": 106, "frontend_question_id": "1783", "is_new_question": false }, @@ -35628,8 +36090,8 @@ "question__title": "Shortest Path in a Hidden Grid", "question__title_slug": "shortest-path-in-a-hidden-grid", "question__hide": false, - "total_acs": 538, - "total_submitted": 1214, + "total_acs": 561, + "total_submitted": 1247, "total_column_articles": 16, "frontend_question_id": "1778", "is_new_question": false @@ -35649,8 +36111,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": 24295, - "total_submitted": 34198, + "total_acs": 24337, + "total_submitted": 34254, "total_column_articles": 246, "frontend_question_id": "1798", "is_new_question": false @@ -35670,8 +36132,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": 26415, - "total_submitted": 69592, + "total_acs": 26534, + "total_submitted": 69923, "total_column_articles": 395, "frontend_question_id": "1802", "is_new_question": false @@ -35691,9 +36153,9 @@ "question__title": "Number of Orders in the Backlog", "question__title_slug": "number-of-orders-in-the-backlog", "question__hide": false, - "total_acs": 21268, - "total_submitted": 39918, - "total_column_articles": 306, + "total_acs": 21330, + "total_submitted": 40013, + "total_column_articles": 307, "frontend_question_id": "1801", "is_new_question": false }, @@ -35712,9 +36174,9 @@ "question__title": "Maximum Ascending Subarray Sum", "question__title_slug": "maximum-ascending-subarray-sum", "question__hide": false, - "total_acs": 46438, - "total_submitted": 67820, - "total_column_articles": 660, + "total_acs": 46548, + "total_submitted": 67974, + "total_column_articles": 663, "frontend_question_id": "1800", "is_new_question": false }, @@ -35733,8 +36195,8 @@ "question__title": "Product's Price for Each Store", "question__title_slug": "products-price-for-each-store", "question__hide": false, - "total_acs": 9618, - "total_submitted": 12378, + "total_acs": 9661, + "total_submitted": 12442, "total_column_articles": 93, "frontend_question_id": "1777", "is_new_question": false @@ -35754,8 +36216,8 @@ "question__title": "Count Nice Pairs in an Array", "question__title_slug": "count-nice-pairs-in-an-array", "question__hide": false, - "total_acs": 26213, - "total_submitted": 55490, + "total_acs": 26237, + "total_submitted": 55539, "total_column_articles": 321, "frontend_question_id": "1814", "is_new_question": false @@ -35775,8 +36237,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": 11563, - "total_submitted": 21793, + "total_acs": 11575, + "total_submitted": 21814, "total_column_articles": 94, "frontend_question_id": "1815", "is_new_question": false @@ -35796,8 +36258,8 @@ "question__title": "Sentence Similarity III", "question__title_slug": "sentence-similarity-iii", "question__hide": false, - "total_acs": 26074, - "total_submitted": 62763, + "total_acs": 26099, + "total_submitted": 62825, "total_column_articles": 337, "frontend_question_id": "1813", "is_new_question": false @@ -35817,9 +36279,9 @@ "question__title": "Determine Color of a Chessboard Square", "question__title_slug": "determine-color-of-a-chessboard-square", "question__hide": false, - "total_acs": 45988, - "total_submitted": 56650, - "total_column_articles": 729, + "total_acs": 46157, + "total_submitted": 56866, + "total_column_articles": 730, "frontend_question_id": "1812", "is_new_question": false }, @@ -35838,9 +36300,9 @@ "question__title": "Sort Features by Popularity", "question__title_slug": "sort-features-by-popularity", "question__hide": false, - "total_acs": 902, - "total_submitted": 1887, - "total_column_articles": 23, + "total_acs": 905, + "total_submitted": 1936, + "total_column_articles": 24, "frontend_question_id": "1772", "is_new_question": false }, @@ -35859,9 +36321,9 @@ "question__title": "Maximum Score of a Good Subarray", "question__title_slug": "maximum-score-of-a-good-subarray", "question__hide": false, - "total_acs": 22936, - "total_submitted": 41374, - "total_column_articles": 241, + "total_acs": 23156, + "total_submitted": 41716, + "total_column_articles": 240, "frontend_question_id": "1793", "is_new_question": false }, @@ -35880,8 +36342,8 @@ "question__title": "Maximum Average Pass Ratio", "question__title_slug": "maximum-average-pass-ratio", "question__hide": false, - "total_acs": 25139, - "total_submitted": 42715, + "total_acs": 25184, + "total_submitted": 42780, "total_column_articles": 264, "frontend_question_id": "1792", "is_new_question": false @@ -35901,8 +36363,8 @@ "question__title": "Find Center of Star Graph", "question__title_slug": "find-center-of-star-graph", "question__hide": false, - "total_acs": 60475, - "total_submitted": 73281, + "total_acs": 60692, + "total_submitted": 73556, "total_column_articles": 530, "frontend_question_id": "1791", "is_new_question": false @@ -35922,9 +36384,9 @@ "question__title": "Check if One String Swap Can Make Strings Equal", "question__title_slug": "check-if-one-string-swap-can-make-strings-equal", "question__hide": false, - "total_acs": 67025, - "total_submitted": 127735, - "total_column_articles": 890, + "total_acs": 67103, + "total_submitted": 127897, + "total_column_articles": 891, "frontend_question_id": "1790", "is_new_question": false }, @@ -35943,8 +36405,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": 5560, - "total_submitted": 7353, + "total_acs": 5662, + "total_submitted": 7541, "total_column_articles": 86, "frontend_question_id": "1767", "is_new_question": false @@ -35964,8 +36426,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": 12995, - "total_submitted": 20299, + "total_acs": 13006, + "total_submitted": 20328, "total_column_articles": 67, "frontend_question_id": "1787", "is_new_question": false @@ -35985,8 +36447,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": 6802, - "total_submitted": 18302, + "total_acs": 6857, + "total_submitted": 18457, "total_column_articles": 141, "frontend_question_id": "1786", "is_new_question": false @@ -36006,9 +36468,9 @@ "question__title": "Minimum Elements to Add to Form a Given Sum", "question__title_slug": "minimum-elements-to-add-to-form-a-given-sum", "question__hide": false, - "total_acs": 28000, - "total_submitted": 64217, - "total_column_articles": 295, + "total_acs": 28039, + "total_submitted": 64291, + "total_column_articles": 297, "frontend_question_id": "1785", "is_new_question": false }, @@ -36027,8 +36489,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": 41410, - "total_submitted": 69652, + "total_acs": 41480, + "total_submitted": 69774, "total_column_articles": 562, "frontend_question_id": "1784", "is_new_question": false @@ -36048,8 +36510,8 @@ "question__title": "Buildings With an Ocean View", "question__title_slug": "buildings-with-an-ocean-view", "question__hide": false, - "total_acs": 3743, - "total_submitted": 5208, + "total_acs": 3791, + "total_submitted": 5273, "total_column_articles": 57, "frontend_question_id": "1762", "is_new_question": false @@ -36069,9 +36531,9 @@ "question__title": "Recyclable and Low Fat Products", "question__title_slug": "recyclable-and-low-fat-products", "question__hide": false, - "total_acs": 190023, - "total_submitted": 221433, - "total_column_articles": 398, + "total_acs": 194581, + "total_submitted": 226851, + "total_column_articles": 406, "frontend_question_id": "1757", "is_new_question": false }, @@ -36090,9 +36552,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": 16610, - "total_submitted": 29506, - "total_column_articles": 162, + "total_acs": 16659, + "total_submitted": 29578, + "total_column_articles": 163, "frontend_question_id": "1803", "is_new_question": false }, @@ -36111,9 +36573,9 @@ "question__title": "Maximize Score After N Operations", "question__title_slug": "maximize-score-after-n-operations", "question__hide": false, - "total_acs": 14517, - "total_submitted": 22129, - "total_column_articles": 170, + "total_acs": 14625, + "total_submitted": 22279, + "total_column_articles": 171, "frontend_question_id": "1799", "is_new_question": false }, @@ -36132,8 +36594,8 @@ "question__title": "Design Authentication Manager", "question__title_slug": "design-authentication-manager", "question__hide": false, - "total_acs": 33638, - "total_submitted": 52040, + "total_acs": 33669, + "total_submitted": 52086, "total_column_articles": 352, "frontend_question_id": "1797", "is_new_question": false @@ -36153,9 +36615,9 @@ "question__title": "Second Largest Digit in a String", "question__title_slug": "second-largest-digit-in-a-string", "question__hide": false, - "total_acs": 39441, - "total_submitted": 72240, - "total_column_articles": 485, + "total_acs": 39548, + "total_submitted": 72444, + "total_column_articles": 487, "frontend_question_id": "1796", "is_new_question": false }, @@ -36174,8 +36636,8 @@ "question__title": "Design Most Recently Used Queue", "question__title_slug": "design-most-recently-used-queue", "question__hide": false, - "total_acs": 1708, - "total_submitted": 2124, + "total_acs": 1716, + "total_submitted": 2139, "total_column_articles": 36, "frontend_question_id": "1756", "is_new_question": false @@ -36195,9 +36657,9 @@ "question__title": "Car Fleet II", "question__title_slug": "car-fleet-ii", "question__hide": false, - "total_acs": 3523, - "total_submitted": 7175, - "total_column_articles": 73, + "total_acs": 3553, + "total_submitted": 7218, + "total_column_articles": 74, "frontend_question_id": "1776", "is_new_question": false }, @@ -36216,9 +36678,9 @@ "question__title": "Equal Sum Arrays With Minimum Number of Operations", "question__title_slug": "equal-sum-arrays-with-minimum-number-of-operations", "question__hide": false, - "total_acs": 25753, - "total_submitted": 45686, - "total_column_articles": 364, + "total_acs": 25803, + "total_submitted": 45813, + "total_column_articles": 365, "frontend_question_id": "1775", "is_new_question": false }, @@ -36237,9 +36699,9 @@ "question__title": "Closest Dessert Cost", "question__title_slug": "closest-dessert-cost", "question__hide": false, - "total_acs": 28302, - "total_submitted": 49460, - "total_column_articles": 315, + "total_acs": 28531, + "total_submitted": 49922, + "total_column_articles": 316, "frontend_question_id": "1774", "is_new_question": false }, @@ -36258,9 +36720,9 @@ "question__title": "Count Items Matching a Rule", "question__title_slug": "count-items-matching-a-rule", "question__hide": false, - "total_acs": 53797, - "total_submitted": 62501, - "total_column_articles": 522, + "total_acs": 53968, + "total_submitted": 62703, + "total_column_articles": 523, "frontend_question_id": "1773", "is_new_question": false }, @@ -36279,9 +36741,9 @@ "question__title": "Leetflex Banned Accounts", "question__title_slug": "leetflex-banned-accounts", "question__hide": false, - "total_acs": 8766, - "total_submitted": 14362, - "total_column_articles": 101, + "total_acs": 8921, + "total_submitted": 14661, + "total_column_articles": 104, "frontend_question_id": "1747", "is_new_question": false }, @@ -36300,8 +36762,8 @@ "question__title": "Maximize Palindrome Length From Subsequences", "question__title_slug": "maximize-palindrome-length-from-subsequences", "question__hide": false, - "total_acs": 4362, - "total_submitted": 10823, + "total_acs": 4422, + "total_submitted": 10939, "total_column_articles": 75, "frontend_question_id": "1771", "is_new_question": false @@ -36321,9 +36783,9 @@ "question__title": "Maximum Score from Performing Multiplication Operations", "question__title_slug": "maximum-score-from-performing-multiplication-operations", "question__hide": false, - "total_acs": 7012, - "total_submitted": 17100, - "total_column_articles": 154, + "total_acs": 7097, + "total_submitted": 17225, + "total_column_articles": 156, "frontend_question_id": "1770", "is_new_question": false }, @@ -36342,8 +36804,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": 42971, - "total_submitted": 49012, + "total_acs": 43088, + "total_submitted": 49143, "total_column_articles": 583, "frontend_question_id": "1769", "is_new_question": false @@ -36363,9 +36825,9 @@ "question__title": "Merge Strings Alternately", "question__title_slug": "merge-strings-alternately", "question__hide": false, - "total_acs": 128658, - "total_submitted": 175787, - "total_column_articles": 1238, + "total_acs": 130379, + "total_submitted": 177918, + "total_column_articles": 1244, "frontend_question_id": "1768", "is_new_question": false }, @@ -36384,8 +36846,8 @@ "question__title": "Maximum Subarray Sum After One Operation", "question__title_slug": "maximum-subarray-sum-after-one-operation", "question__hide": false, - "total_acs": 3294, - "total_submitted": 5536, + "total_acs": 3308, + "total_submitted": 5552, "total_column_articles": 77, "frontend_question_id": "1746", "is_new_question": false @@ -36405,9 +36867,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": 41595, - "total_submitted": 49315, - "total_column_articles": 223, + "total_acs": 42127, + "total_submitted": 49909, + "total_column_articles": 227, "frontend_question_id": "1741", "is_new_question": false }, @@ -36426,8 +36888,8 @@ "question__title": "Count Pairs Of Nodes", "question__title_slug": "count-pairs-of-nodes", "question__hide": false, - "total_acs": 13344, - "total_submitted": 24601, + "total_acs": 13363, + "total_submitted": 24636, "total_column_articles": 88, "frontend_question_id": "1782", "is_new_question": false @@ -36447,8 +36909,8 @@ "question__title": "Sum of Beauty of All Substrings", "question__title_slug": "sum-of-beauty-of-all-substrings", "question__hide": false, - "total_acs": 25580, - "total_submitted": 38467, + "total_acs": 25614, + "total_submitted": 38514, "total_column_articles": 230, "frontend_question_id": "1781", "is_new_question": false @@ -36468,9 +36930,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": 32790, - "total_submitted": 43798, - "total_column_articles": 522, + "total_acs": 32840, + "total_submitted": 43871, + "total_column_articles": 523, "frontend_question_id": "1780", "is_new_question": false }, @@ -36489,8 +36951,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": 47669, - "total_submitted": 69107, + "total_acs": 47738, + "total_submitted": 69197, "total_column_articles": 556, "frontend_question_id": "1779", "is_new_question": false @@ -36510,8 +36972,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": 17776, - "total_submitted": 31874, + "total_acs": 17793, + "total_submitted": 31915, "total_column_articles": 129, "frontend_question_id": "1761", "is_new_question": false @@ -36531,9 +36993,9 @@ "question__title": "Minimum Limit of Balls in a Bag", "question__title_slug": "minimum-limit-of-balls-in-a-bag", "question__hide": false, - "total_acs": 27172, - "total_submitted": 42435, - "total_column_articles": 296, + "total_acs": 27286, + "total_submitted": 42596, + "total_column_articles": 297, "frontend_question_id": "1760", "is_new_question": false }, @@ -36552,8 +37014,8 @@ "question__title": "Count Number of Homogenous Substrings", "question__title_slug": "count-number-of-homogenous-substrings", "question__hide": false, - "total_acs": 25273, - "total_submitted": 49409, + "total_acs": 25319, + "total_submitted": 49507, "total_column_articles": 289, "frontend_question_id": "1759", "is_new_question": false @@ -36573,9 +37035,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": 38198, - "total_submitted": 54909, - "total_column_articles": 465, + "total_acs": 38269, + "total_submitted": 55014, + "total_column_articles": 464, "frontend_question_id": "1758", "is_new_question": false }, @@ -36594,8 +37056,8 @@ "question__title": "Find Distance in a Binary Tree", "question__title_slug": "find-distance-in-a-binary-tree", "question__hide": false, - "total_acs": 2017, - "total_submitted": 2985, + "total_acs": 2028, + "total_submitted": 2996, "total_column_articles": 59, "frontend_question_id": "1740", "is_new_question": false @@ -36615,9 +37077,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": 28622, - "total_submitted": 60601, - "total_column_articles": 221, + "total_acs": 29939, + "total_submitted": 63042, + "total_column_articles": 224, "frontend_question_id": "1731", "is_new_question": false }, @@ -36636,9 +37098,9 @@ "question__title": "Closest Subsequence Sum", "question__title_slug": "closest-subsequence-sum", "question__hide": false, - "total_acs": 7607, - "total_submitted": 16131, - "total_column_articles": 98, + "total_acs": 7640, + "total_submitted": 16197, + "total_column_articles": 101, "frontend_question_id": "1755", "is_new_question": false }, @@ -36657,8 +37119,8 @@ "question__title": "Largest Merge Of Two Strings", "question__title_slug": "largest-merge-of-two-strings", "question__hide": false, - "total_acs": 19685, - "total_submitted": 34868, + "total_acs": 19702, + "total_submitted": 34897, "total_column_articles": 216, "frontend_question_id": "1754", "is_new_question": false @@ -36678,9 +37140,9 @@ "question__title": "Maximum Score From Removing Stones", "question__title_slug": "maximum-score-from-removing-stones", "question__hide": false, - "total_acs": 28010, - "total_submitted": 39695, - "total_column_articles": 352, + "total_acs": 28120, + "total_submitted": 39833, + "total_column_articles": 353, "frontend_question_id": "1753", "is_new_question": false }, @@ -36699,9 +37161,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": 33828, - "total_submitted": 58473, - "total_column_articles": 424, + "total_acs": 33902, + "total_submitted": 58602, + "total_column_articles": 425, "frontend_question_id": "1752", "is_new_question": false }, @@ -36720,9 +37182,9 @@ "question__title": "Find Followers Count", "question__title_slug": "find-followers-count", "question__hide": false, - "total_acs": 48928, - "total_submitted": 81718, - "total_column_articles": 173, + "total_acs": 50184, + "total_submitted": 83850, + "total_column_articles": 177, "frontend_question_id": "1729", "is_new_question": false }, @@ -36741,8 +37203,8 @@ "question__title": "Map of Highest Peak", "question__title_slug": "map-of-highest-peak", "question__hide": false, - "total_acs": 25850, - "total_submitted": 39040, + "total_acs": 25940, + "total_submitted": 39150, "total_column_articles": 340, "frontend_question_id": "1765", "is_new_question": false @@ -36762,8 +37224,8 @@ "question__title": "Tree of Coprimes", "question__title_slug": "tree-of-coprimes", "question__hide": false, - "total_acs": 13284, - "total_submitted": 26071, + "total_acs": 13337, + "total_submitted": 26191, "total_column_articles": 102, "frontend_question_id": "1766", "is_new_question": false @@ -36783,9 +37245,9 @@ "question__title": "Form Array by Concatenating Subarrays of Another Array", "question__title_slug": "form-array-by-concatenating-subarrays-of-another-array", "question__hide": false, - "total_acs": 19006, - "total_submitted": 34254, - "total_column_articles": 262, + "total_acs": 19029, + "total_submitted": 34292, + "total_column_articles": 263, "frontend_question_id": "1764", "is_new_question": false }, @@ -36804,9 +37266,9 @@ "question__title": "Longest Nice Substring", "question__title_slug": "longest-nice-substring", "question__hide": false, - "total_acs": 31175, - "total_submitted": 46764, - "total_column_articles": 323, + "total_acs": 31374, + "total_submitted": 47055, + "total_column_articles": 327, "frontend_question_id": "1763", "is_new_question": false }, @@ -36825,9 +37287,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": 31572, - "total_submitted": 86677, - "total_column_articles": 395, + "total_acs": 31768, + "total_submitted": 87180, + "total_column_articles": 397, "frontend_question_id": "1744", "is_new_question": false }, @@ -36846,8 +37308,8 @@ "question__title": "Palindrome Partitioning IV", "question__title_slug": "palindrome-partitioning-iv", "question__hide": false, - "total_acs": 7256, - "total_submitted": 14053, + "total_acs": 7372, + "total_submitted": 14291, "total_column_articles": 120, "frontend_question_id": "1745", "is_new_question": false @@ -36867,8 +37329,8 @@ "question__title": "Restore the Array From Adjacent Pairs", "question__title_slug": "restore-the-array-from-adjacent-pairs", "question__hide": false, - "total_acs": 25591, - "total_submitted": 36721, + "total_acs": 25625, + "total_submitted": 36763, "total_column_articles": 365, "frontend_question_id": "1743", "is_new_question": false @@ -36888,8 +37350,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": 781, - "total_submitted": 1480, + "total_acs": 783, + "total_submitted": 1485, "total_column_articles": 23, "frontend_question_id": "1724", "is_new_question": false @@ -36909,9 +37371,9 @@ "question__title": "Count Apples and Oranges", "question__title_slug": "count-apples-and-oranges", "question__hide": false, - "total_acs": 4861, - "total_submitted": 6772, - "total_column_articles": 63, + "total_acs": 4905, + "total_submitted": 6827, + "total_column_articles": 64, "frontend_question_id": "1715", "is_new_question": false }, @@ -36930,8 +37392,8 @@ "question__title": "Building Boxes", "question__title_slug": "building-boxes", "question__hide": false, - "total_acs": 13404, - "total_submitted": 21038, + "total_acs": 13464, + "total_submitted": 21171, "total_column_articles": 135, "frontend_question_id": "1739", "is_new_question": false @@ -36951,9 +37413,9 @@ "question__title": "Find Kth Largest XOR Coordinate Value", "question__title_slug": "find-kth-largest-xor-coordinate-value", "question__hide": false, - "total_acs": 32645, - "total_submitted": 50175, - "total_column_articles": 439, + "total_acs": 45512, + "total_submitted": 66959, + "total_column_articles": 526, "frontend_question_id": "1738", "is_new_question": false }, @@ -36972,8 +37434,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": 6376, - "total_submitted": 17508, + "total_acs": 6413, + "total_submitted": 17585, "total_column_articles": 134, "frontend_question_id": "1737", "is_new_question": false @@ -36993,9 +37455,9 @@ "question__title": "Latest Time by Replacing Hidden Digits", "question__title_slug": "latest-time-by-replacing-hidden-digits", "question__hide": false, - "total_acs": 35780, - "total_submitted": 80631, - "total_column_articles": 432, + "total_acs": 35893, + "total_submitted": 80838, + "total_column_articles": 433, "frontend_question_id": "1736", "is_new_question": false }, @@ -37014,9 +37476,9 @@ "question__title": "Biggest Window Between Visits", "question__title_slug": "biggest-window-between-visits", "question__hide": false, - "total_acs": 8421, - "total_submitted": 12851, - "total_column_articles": 109, + "total_acs": 8561, + "total_submitted": 13057, + "total_column_articles": 110, "frontend_question_id": "1709", "is_new_question": false }, @@ -37035,9 +37497,9 @@ "question__title": "Maximum Number of Events That Can Be Attended II", "question__title_slug": "maximum-number-of-events-that-can-be-attended-ii", "question__hide": false, - "total_acs": 8118, - "total_submitted": 14839, - "total_column_articles": 101, + "total_acs": 8248, + "total_submitted": 15061, + "total_column_articles": 103, "frontend_question_id": "1751", "is_new_question": false }, @@ -37056,8 +37518,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": 25378, - "total_submitted": 50040, + "total_acs": 25425, + "total_submitted": 50133, "total_column_articles": 306, "frontend_question_id": "1750", "is_new_question": false @@ -37077,9 +37539,9 @@ "question__title": "Maximum Absolute Sum of Any Subarray", "question__title_slug": "maximum-absolute-sum-of-any-subarray", "question__hide": false, - "total_acs": 33810, - "total_submitted": 55383, - "total_column_articles": 349, + "total_acs": 34173, + "total_submitted": 55915, + "total_column_articles": 351, "frontend_question_id": "1749", "is_new_question": false }, @@ -37098,9 +37560,9 @@ "question__title": "Sum of Unique Elements", "question__title_slug": "sum-of-unique-elements", "question__hide": false, - "total_acs": 53018, - "total_submitted": 69761, - "total_column_articles": 691, + "total_acs": 53283, + "total_submitted": 70131, + "total_column_articles": 692, "frontend_question_id": "1748", "is_new_question": false }, @@ -37119,9 +37581,9 @@ "question__title": "Largest Subarray Length K", "question__title_slug": "largest-subarray-length-k", "question__hide": false, - "total_acs": 2006, - "total_submitted": 3103, - "total_column_articles": 55, + "total_acs": 2026, + "total_submitted": 3125, + "total_column_articles": 56, "frontend_question_id": "1708", "is_new_question": false }, @@ -37140,9 +37602,9 @@ "question__title": "Largest Submatrix With Rearrangements", "question__title_slug": "largest-submatrix-with-rearrangements", "question__hide": false, - "total_acs": 5534, - "total_submitted": 9189, - "total_column_articles": 98, + "total_acs": 5550, + "total_submitted": 9215, + "total_column_articles": 99, "frontend_question_id": "1727", "is_new_question": false }, @@ -37161,9 +37623,9 @@ "question__title": "Maximum Number of Balls in a Box", "question__title_slug": "maximum-number-of-balls-in-a-box", "question__hide": false, - "total_acs": 41239, - "total_submitted": 54463, - "total_column_articles": 418, + "total_acs": 41374, + "total_submitted": 54635, + "total_column_articles": 417, "frontend_question_id": "1742", "is_new_question": false }, @@ -37182,9 +37644,9 @@ "question__title": "Number Of Rectangles That Can Form The Largest Square", "question__title_slug": "number-of-rectangles-that-can-form-the-largest-square", "question__hide": false, - "total_acs": 41137, - "total_submitted": 49832, - "total_column_articles": 501, + "total_acs": 41244, + "total_submitted": 49964, + "total_column_articles": 504, "frontend_question_id": "1725", "is_new_question": false }, @@ -37203,8 +37665,8 @@ "question__title": "Number of Calls Between Two Persons", "question__title_slug": "number-of-calls-between-two-persons", "question__hide": false, - "total_acs": 15670, - "total_submitted": 20593, + "total_acs": 15891, + "total_submitted": 20925, "total_column_articles": 151, "frontend_question_id": "1699", "is_new_question": false @@ -37224,9 +37686,9 @@ "question__title": "Minimize Hamming Distance After Swap Operations", "question__title_slug": "minimize-hamming-distance-after-swap-operations", "question__hide": false, - "total_acs": 6834, - "total_submitted": 13391, - "total_column_articles": 159, + "total_acs": 6881, + "total_submitted": 13478, + "total_column_articles": 160, "frontend_question_id": "1722", "is_new_question": false }, @@ -37245,9 +37707,9 @@ "question__title": "Decode XORed Array", "question__title_slug": "decode-xored-array", "question__hide": false, - "total_acs": 59053, - "total_submitted": 68957, - "total_column_articles": 621, + "total_acs": 59268, + "total_submitted": 69207, + "total_column_articles": 622, "frontend_question_id": "1720", "is_new_question": false }, @@ -37266,8 +37728,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": 1143, - "total_submitted": 2032, + "total_acs": 1146, + "total_submitted": 2036, "total_column_articles": 30, "frontend_question_id": "1698", "is_new_question": false @@ -37287,9 +37749,9 @@ "question__title": "Daily Leads and Partners", "question__title_slug": "daily-leads-and-partners", "question__hide": false, - "total_acs": 39181, - "total_submitted": 47451, - "total_column_articles": 207, + "total_acs": 39651, + "total_submitted": 47971, + "total_column_articles": 211, "frontend_question_id": "1693", "is_new_question": false }, @@ -37308,9 +37770,9 @@ "question__title": "Count Ways to Make Array With Product", "question__title_slug": "count-ways-to-make-array-with-product", "question__hide": false, - "total_acs": 2521, - "total_submitted": 4636, - "total_column_articles": 57, + "total_acs": 2600, + "total_submitted": 4784, + "total_column_articles": 60, "frontend_question_id": "1735", "is_new_question": false }, @@ -37329,9 +37791,9 @@ "question__title": "Decode XORed Permutation", "question__title_slug": "decode-xored-permutation", "question__hide": false, - "total_acs": 30463, - "total_submitted": 42105, - "total_column_articles": 391, + "total_acs": 30519, + "total_submitted": 42188, + "total_column_articles": 390, "frontend_question_id": "1734", "is_new_question": false }, @@ -37350,8 +37812,8 @@ "question__title": "Minimum Number of People to Teach", "question__title_slug": "minimum-number-of-people-to-teach", "question__hide": false, - "total_acs": 4148, - "total_submitted": 8477, + "total_acs": 4159, + "total_submitted": 8501, "total_column_articles": 82, "frontend_question_id": "1733", "is_new_question": false @@ -37371,9 +37833,9 @@ "question__title": "Find the Highest Altitude", "question__title_slug": "find-the-highest-altitude", "question__hide": false, - "total_acs": 64919, - "total_submitted": 79474, - "total_column_articles": 628, + "total_acs": 65613, + "total_submitted": 80295, + "total_column_articles": 632, "frontend_question_id": "1732", "is_new_question": false }, @@ -37392,8 +37854,8 @@ "question__title": "Minimum Operations to Make a Subsequence", "question__title_slug": "minimum-operations-to-make-a-subsequence", "question__hide": false, - "total_acs": 19597, - "total_submitted": 39332, + "total_acs": 19654, + "total_submitted": 39448, "total_column_articles": 206, "frontend_question_id": "1713", "is_new_question": false @@ -37413,8 +37875,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": 14183, - "total_submitted": 48912, + "total_acs": 14283, + "total_submitted": 49165, "total_column_articles": 183, "frontend_question_id": "1712", "is_new_question": false @@ -37434,9 +37896,9 @@ "question__title": "Count Good Meals", "question__title_slug": "count-good-meals", "question__hide": false, - "total_acs": 34020, - "total_submitted": 94550, - "total_column_articles": 391, + "total_acs": 34070, + "total_submitted": 94678, + "total_column_articles": 392, "frontend_question_id": "1711", "is_new_question": false }, @@ -37455,8 +37917,8 @@ "question__title": "Maximum Units on a Truck", "question__title_slug": "maximum-units-on-a-truck", "question__hide": false, - "total_acs": 53025, - "total_submitted": 72347, + "total_acs": 53178, + "total_submitted": 72537, "total_column_articles": 598, "frontend_question_id": "1710", "is_new_question": false @@ -37476,8 +37938,8 @@ "question__title": "Count Ways to Distribute Candies", "question__title_slug": "count-ways-to-distribute-candies", "question__hide": false, - "total_acs": 837, - "total_submitted": 1281, + "total_acs": 854, + "total_submitted": 1301, "total_column_articles": 25, "frontend_question_id": "1692", "is_new_question": false @@ -37497,9 +37959,9 @@ "question__title": "Invalid Tweets", "question__title_slug": "invalid-tweets", "question__hide": false, - "total_acs": 63481, - "total_submitted": 74581, - "total_column_articles": 185, + "total_acs": 66821, + "total_submitted": 78480, + "total_column_articles": 196, "frontend_question_id": "1683", "is_new_question": false }, @@ -37518,8 +37980,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": 17553, - "total_submitted": 34420, + "total_acs": 17585, + "total_submitted": 34489, "total_column_articles": 180, "frontend_question_id": "1707", "is_new_question": false @@ -37539,8 +38001,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": 33449, - "total_submitted": 65771, + "total_acs": 33536, + "total_submitted": 65936, "total_column_articles": 233, "frontend_question_id": "1723", "is_new_question": false @@ -37560,8 +38022,8 @@ "question__title": "Maximum Number of Eaten Apples", "question__title_slug": "maximum-number-of-eaten-apples", "question__hide": false, - "total_acs": 31029, - "total_submitted": 68537, + "total_acs": 31126, + "total_submitted": 68749, "total_column_articles": 397, "frontend_question_id": "1705", "is_new_question": false @@ -37581,9 +38043,9 @@ "question__title": "Determine if String Halves Are Alike", "question__title_slug": "determine-if-string-halves-are-alike", "question__hide": false, - "total_acs": 51874, - "total_submitted": 66401, - "total_column_articles": 599, + "total_acs": 52015, + "total_submitted": 66577, + "total_column_articles": 600, "frontend_question_id": "1704", "is_new_question": false }, @@ -37602,8 +38064,8 @@ "question__title": "Longest Palindromic Subsequence II", "question__title_slug": "longest-palindromic-subsequence-ii", "question__hide": false, - "total_acs": 1295, - "total_submitted": 2305, + "total_acs": 1300, + "total_submitted": 2312, "total_column_articles": 46, "frontend_question_id": "1682", "is_new_question": false @@ -37623,9 +38085,9 @@ "question__title": "Product's Worth Over Invoices", "question__title_slug": "products-worth-over-invoices", "question__hide": false, - "total_acs": 5246, - "total_submitted": 14905, - "total_column_articles": 60, + "total_acs": 5279, + "total_submitted": 14982, + "total_column_articles": 62, "frontend_question_id": "1677", "is_new_question": false }, @@ -37644,8 +38106,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": 13432, - "total_submitted": 19628, + "total_acs": 13439, + "total_submitted": 19639, "total_column_articles": 96, "frontend_question_id": "1719", "is_new_question": false @@ -37665,8 +38127,8 @@ "question__title": "Construct the Lexicographically Largest Valid Sequence", "question__title_slug": "construct-the-lexicographically-largest-valid-sequence", "question__hide": false, - "total_acs": 3913, - "total_submitted": 7562, + "total_acs": 3925, + "total_submitted": 7587, "total_column_articles": 83, "frontend_question_id": "1718", "is_new_question": false @@ -37686,8 +38148,8 @@ "question__title": "Maximum Score From Removing Substrings", "question__title_slug": "maximum-score-from-removing-substrings", "question__hide": false, - "total_acs": 4389, - "total_submitted": 9386, + "total_acs": 4414, + "total_submitted": 9434, "total_column_articles": 96, "frontend_question_id": "1717", "is_new_question": false @@ -37707,9 +38169,9 @@ "question__title": "Calculate Money in Leetcode Bank", "question__title_slug": "calculate-money-in-leetcode-bank", "question__hide": false, - "total_acs": 44995, - "total_submitted": 65069, - "total_column_articles": 770, + "total_acs": 45116, + "total_submitted": 65238, + "total_column_articles": 771, "frontend_question_id": "1716", "is_new_question": false }, @@ -37728,8 +38190,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": 4094, - "total_submitted": 5075, + "total_acs": 4111, + "total_submitted": 5113, "total_column_articles": 56, "frontend_question_id": "1676", "is_new_question": false @@ -37749,9 +38211,9 @@ "question__title": "Checking Existence of Edge Length Limited Paths", "question__title_slug": "checking-existence-of-edge-length-limited-paths", "question__hide": false, - "total_acs": 15733, - "total_submitted": 24478, - "total_column_articles": 170, + "total_acs": 15790, + "total_submitted": 24572, + "total_column_articles": 172, "frontend_question_id": "1697", "is_new_question": false }, @@ -37770,8 +38232,8 @@ "question__title": "Jump Game VI", "question__title_slug": "jump-game-vi", "question__hide": false, - "total_acs": 28007, - "total_submitted": 63071, + "total_acs": 28199, + "total_submitted": 63519, "total_column_articles": 297, "frontend_question_id": "1696", "is_new_question": false @@ -37791,9 +38253,9 @@ "question__title": "Maximum Erasure Value", "question__title_slug": "maximum-erasure-value", "question__hide": false, - "total_acs": 17945, - "total_submitted": 33224, - "total_column_articles": 270, + "total_acs": 18411, + "total_submitted": 33884, + "total_column_articles": 280, "frontend_question_id": "1695", "is_new_question": false }, @@ -37812,9 +38274,9 @@ "question__title": "Reformat Phone Number", "question__title_slug": "reformat-phone-number", "question__hide": false, - "total_acs": 39279, - "total_submitted": 59464, - "total_column_articles": 587, + "total_acs": 39357, + "total_submitted": 59561, + "total_column_articles": 588, "frontend_question_id": "1694", "is_new_question": false }, @@ -37833,9 +38295,9 @@ "question__title": "Fix Names in a Table", "question__title_slug": "fix-names-in-a-table", "question__hide": false, - "total_acs": 72188, - "total_submitted": 115297, - "total_column_articles": 357, + "total_acs": 73260, + "total_submitted": 117076, + "total_column_articles": 361, "frontend_question_id": "1667", "is_new_question": false }, @@ -37854,8 +38316,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": 621, - "total_submitted": 965, + "total_acs": 627, + "total_submitted": 972, "total_column_articles": 24, "frontend_question_id": "1666", "is_new_question": false @@ -37875,8 +38337,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": 595, - "total_submitted": 1015, + "total_acs": 597, + "total_submitted": 1124, "total_column_articles": 17, "frontend_question_id": "1714", "is_new_question": false @@ -37896,9 +38358,9 @@ "question__title": "Stone Game VII", "question__title_slug": "stone-game-vii", "question__hide": false, - "total_acs": 18035, - "total_submitted": 27534, - "total_column_articles": 201, + "total_acs": 18120, + "total_submitted": 27672, + "total_column_articles": 200, "frontend_question_id": "1690", "is_new_question": false }, @@ -37917,9 +38379,9 @@ "question__title": "Partitioning Into Minimum Number Of Deci-Binary Numbers", "question__title_slug": "partitioning-into-minimum-number-of-deci-binary-numbers", "question__hide": false, - "total_acs": 24210, - "total_submitted": 27923, - "total_column_articles": 312, + "total_acs": 24319, + "total_submitted": 28044, + "total_column_articles": 315, "frontend_question_id": "1689", "is_new_question": false }, @@ -37938,9 +38400,9 @@ "question__title": "Count of Matches in Tournament", "question__title_slug": "count-of-matches-in-tournament", "question__hide": false, - "total_acs": 65301, - "total_submitted": 78618, - "total_column_articles": 670, + "total_acs": 65510, + "total_submitted": 78880, + "total_column_articles": 675, "frontend_question_id": "1688", "is_new_question": false }, @@ -37959,8 +38421,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": 12173, - "total_submitted": 21758, + "total_acs": 12212, + "total_submitted": 21838, "total_column_articles": 88, "frontend_question_id": "1703", "is_new_question": false @@ -37980,8 +38442,8 @@ "question__title": "Maximum Binary String After Change", "question__title_slug": "maximum-binary-string-after-change", "question__hide": false, - "total_acs": 23848, - "total_submitted": 44588, + "total_acs": 23982, + "total_submitted": 44828, "total_column_articles": 241, "frontend_question_id": "1702", "is_new_question": false @@ -38001,8 +38463,8 @@ "question__title": "Average Waiting Time", "question__title_slug": "average-waiting-time", "question__hide": false, - "total_acs": 8381, - "total_submitted": 13677, + "total_acs": 8422, + "total_submitted": 13738, "total_column_articles": 158, "frontend_question_id": "1701", "is_new_question": false @@ -38022,9 +38484,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": 55453, - "total_submitted": 76153, - "total_column_articles": 808, + "total_acs": 55659, + "total_submitted": 76411, + "total_column_articles": 813, "frontend_question_id": "1700", "is_new_question": false }, @@ -38043,9 +38505,9 @@ "question__title": "Average Time of Process per Machine", "question__title_slug": "average-time-of-process-per-machine", "question__hide": false, - "total_acs": 42395, - "total_submitted": 60974, - "total_column_articles": 374, + "total_acs": 44808, + "total_submitted": 64312, + "total_column_articles": 395, "frontend_question_id": "1661", "is_new_question": false }, @@ -38064,8 +38526,8 @@ "question__title": "Concatenation of Consecutive Binary Numbers", "question__title_slug": "concatenation-of-consecutive-binary-numbers", "question__hide": false, - "total_acs": 8926, - "total_submitted": 17458, + "total_acs": 8972, + "total_submitted": 17520, "total_column_articles": 103, "frontend_question_id": "1680", "is_new_question": false @@ -38085,8 +38547,8 @@ "question__title": "Minimum Incompatibility", "question__title_slug": "minimum-incompatibility", "question__hide": false, - "total_acs": 12776, - "total_submitted": 21818, + "total_acs": 12838, + "total_submitted": 21919, "total_column_articles": 119, "frontend_question_id": "1681", "is_new_question": false @@ -38106,9 +38568,9 @@ "question__title": "Max Number of K-Sum Pairs", "question__title_slug": "max-number-of-k-sum-pairs", "question__hide": false, - "total_acs": 31693, - "total_submitted": 55775, - "total_column_articles": 352, + "total_acs": 32302, + "total_submitted": 56722, + "total_column_articles": 354, "frontend_question_id": "1679", "is_new_question": false }, @@ -38127,9 +38589,9 @@ "question__title": "Goal Parser Interpretation", "question__title_slug": "goal-parser-interpretation", "question__hide": false, - "total_acs": 60013, - "total_submitted": 70137, - "total_column_articles": 787, + "total_acs": 60178, + "total_submitted": 70320, + "total_column_articles": 789, "frontend_question_id": "1678", "is_new_question": false }, @@ -38148,8 +38610,8 @@ "question__title": "Correct a Binary Tree", "question__title_slug": "correct-a-binary-tree", "question__hide": false, - "total_acs": 1082, - "total_submitted": 1434, + "total_acs": 1110, + "total_submitted": 1497, "total_column_articles": 36, "frontend_question_id": "1660", "is_new_question": false @@ -38169,9 +38631,9 @@ "question__title": "Hopper Company Queries III", "question__title_slug": "hopper-company-queries-iii", "question__hide": false, - "total_acs": 2380, - "total_submitted": 3738, - "total_column_articles": 44, + "total_acs": 2409, + "total_submitted": 3813, + "total_column_articles": 46, "frontend_question_id": "1651", "is_new_question": false }, @@ -38190,9 +38652,9 @@ "question__title": "Minimize Deviation in Array", "question__title_slug": "minimize-deviation-in-array", "question__hide": false, - "total_acs": 7205, - "total_submitted": 15807, - "total_column_articles": 78, + "total_acs": 7286, + "total_submitted": 15946, + "total_column_articles": 79, "frontend_question_id": "1675", "is_new_question": false }, @@ -38211,8 +38673,8 @@ "question__title": "Minimum Moves to Make Array Complementary", "question__title_slug": "minimum-moves-to-make-array-complementary", "question__hide": false, - "total_acs": 4785, - "total_submitted": 11230, + "total_acs": 4840, + "total_submitted": 11317, "total_column_articles": 87, "frontend_question_id": "1674", "is_new_question": false @@ -38232,9 +38694,9 @@ "question__title": "Find the Most Competitive Subsequence", "question__title_slug": "find-the-most-competitive-subsequence", "question__hide": false, - "total_acs": 13427, - "total_submitted": 32876, - "total_column_articles": 250, + "total_acs": 29467, + "total_submitted": 59467, + "total_column_articles": 345, "frontend_question_id": "1673", "is_new_question": false }, @@ -38253,9 +38715,9 @@ "question__title": "Richest Customer Wealth", "question__title_slug": "richest-customer-wealth", "question__hide": false, - "total_acs": 163201, - "total_submitted": 194804, - "total_column_articles": 1515, + "total_acs": 163866, + "total_submitted": 195545, + "total_column_articles": 1519, "frontend_question_id": "1672", "is_new_question": false }, @@ -38274,8 +38736,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": 6447, - "total_submitted": 7917, + "total_acs": 6514, + "total_submitted": 7989, "total_column_articles": 75, "frontend_question_id": "1650", "is_new_question": false @@ -38295,8 +38757,8 @@ "question__title": "Delivering Boxes from Storage to Ports", "question__title_slug": "delivering-boxes-from-storage-to-ports", "question__hide": false, - "total_acs": 12969, - "total_submitted": 22382, + "total_acs": 12985, + "total_submitted": 22411, "total_column_articles": 101, "frontend_question_id": "1687", "is_new_question": false @@ -38316,8 +38778,8 @@ "question__title": "Stone Game VI", "question__title_slug": "stone-game-vi", "question__hide": false, - "total_acs": 19294, - "total_submitted": 29521, + "total_acs": 19367, + "total_submitted": 29623, "total_column_articles": 188, "frontend_question_id": "1686", "is_new_question": false @@ -38337,9 +38799,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": 9317, - "total_submitted": 14197, - "total_column_articles": 197, + "total_acs": 9495, + "total_submitted": 14404, + "total_column_articles": 198, "frontend_question_id": "1685", "is_new_question": false }, @@ -38358,9 +38820,9 @@ "question__title": "Count the Number of Consistent Strings", "question__title_slug": "count-the-number-of-consistent-strings", "question__hide": false, - "total_acs": 65853, - "total_submitted": 77425, - "total_column_articles": 878, + "total_acs": 66067, + "total_submitted": 77702, + "total_column_articles": 880, "frontend_question_id": "1684", "is_new_question": false }, @@ -38379,8 +38841,8 @@ "question__title": "Hopper Company Queries II", "question__title_slug": "hopper-company-queries-ii", "question__hide": false, - "total_acs": 2328, - "total_submitted": 5680, + "total_acs": 2352, + "total_submitted": 5738, "total_column_articles": 44, "frontend_question_id": "1645", "is_new_question": false @@ -38400,9 +38862,9 @@ "question__title": "Minimum Initial Energy to Finish Tasks", "question__title_slug": "minimum-initial-energy-to-finish-tasks", "question__hide": false, - "total_acs": 9073, - "total_submitted": 13853, - "total_column_articles": 135, + "total_acs": 9134, + "total_submitted": 13934, + "total_column_articles": 136, "frontend_question_id": "1665", "is_new_question": false }, @@ -38421,8 +38883,8 @@ "question__title": "Ways to Make a Fair Array", "question__title_slug": "ways-to-make-a-fair-array", "question__hide": false, - "total_acs": 25910, - "total_submitted": 38960, + "total_acs": 25956, + "total_submitted": 39030, "total_column_articles": 407, "frontend_question_id": "1664", "is_new_question": false @@ -38442,9 +38904,9 @@ "question__title": "Smallest String With A Given Numeric Value", "question__title_slug": "smallest-string-with-a-given-numeric-value", "question__hide": false, - "total_acs": 27653, - "total_submitted": 42433, - "total_column_articles": 355, + "total_acs": 27711, + "total_submitted": 42516, + "total_column_articles": 356, "frontend_question_id": "1663", "is_new_question": false }, @@ -38463,8 +38925,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": 72264, - "total_submitted": 89321, + "total_acs": 72403, + "total_submitted": 89480, "total_column_articles": 730, "frontend_question_id": "1662", "is_new_question": false @@ -38484,8 +38946,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": 5342, - "total_submitted": 9230, + "total_acs": 5376, + "total_submitted": 9282, "total_column_articles": 66, "frontend_question_id": "1644", "is_new_question": false @@ -38505,8 +38967,8 @@ "question__title": "Hopper Company Queries I", "question__title_slug": "hopper-company-queries-i", "question__hide": false, - "total_acs": 3447, - "total_submitted": 7106, + "total_acs": 3479, + "total_submitted": 7187, "total_column_articles": 72, "frontend_question_id": "1635", "is_new_question": false @@ -38526,8 +38988,8 @@ "question__title": "Maximize Grid Happiness", "question__title_slug": "maximize-grid-happiness", "question__hide": false, - "total_acs": 8501, - "total_submitted": 13228, + "total_acs": 8537, + "total_submitted": 13275, "total_column_articles": 71, "frontend_question_id": "1659", "is_new_question": false @@ -38547,9 +39009,9 @@ "question__title": "Determine if Two Strings Are Close", "question__title_slug": "determine-if-two-strings-are-close", "question__hide": false, - "total_acs": 43908, - "total_submitted": 82361, - "total_column_articles": 388, + "total_acs": 44397, + "total_submitted": 83262, + "total_column_articles": 389, "frontend_question_id": "1657", "is_new_question": false }, @@ -38568,9 +39030,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": 47970, - "total_submitted": 121739, - "total_column_articles": 503, + "total_acs": 48760, + "total_submitted": 123700, + "total_column_articles": 509, "frontend_question_id": "1658", "is_new_question": false }, @@ -38589,9 +39051,9 @@ "question__title": "Design an Ordered Stream", "question__title_slug": "design-an-ordered-stream", "question__hide": false, - "total_acs": 41298, - "total_submitted": 49235, - "total_column_articles": 377, + "total_acs": 41412, + "total_submitted": 49357, + "total_column_articles": 378, "frontend_question_id": "1656", "is_new_question": false }, @@ -38610,8 +39072,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": 2104, - "total_submitted": 3512, + "total_acs": 2108, + "total_submitted": 3518, "total_column_articles": 59, "frontend_question_id": "1634", "is_new_question": false @@ -38631,9 +39093,9 @@ "question__title": "Percentage of Users Attended a Contest", "question__title_slug": "percentage-of-users-attended-a-contest", "question__hide": false, - "total_acs": 36490, - "total_submitted": 61023, - "total_column_articles": 186, + "total_acs": 38288, + "total_submitted": 63909, + "total_column_articles": 195, "frontend_question_id": "1633", "is_new_question": false }, @@ -38652,9 +39114,9 @@ "question__title": "Create Sorted Array through Instructions", "question__title_slug": "create-sorted-array-through-instructions", "question__hide": false, - "total_acs": 4823, - "total_submitted": 9740, - "total_column_articles": 105, + "total_acs": 4932, + "total_submitted": 9895, + "total_column_articles": 107, "frontend_question_id": "1649", "is_new_question": false }, @@ -38673,8 +39135,8 @@ "question__title": "Sell Diminishing-Valued Colored Balls", "question__title_slug": "sell-diminishing-valued-colored-balls", "question__hide": false, - "total_acs": 8179, - "total_submitted": 25787, + "total_acs": 8249, + "total_submitted": 25923, "total_column_articles": 148, "frontend_question_id": "1648", "is_new_question": false @@ -38694,9 +39156,9 @@ "question__title": "Minimum Deletions to Make Character Frequencies Unique", "question__title_slug": "minimum-deletions-to-make-character-frequencies-unique", "question__hide": false, - "total_acs": 14103, - "total_submitted": 25650, - "total_column_articles": 201, + "total_acs": 14158, + "total_submitted": 25734, + "total_column_articles": 200, "frontend_question_id": "1647", "is_new_question": false }, @@ -38715,9 +39177,9 @@ "question__title": "Get Maximum in Generated Array", "question__title_slug": "get-maximum-in-generated-array", "question__hide": false, - "total_acs": 54426, - "total_submitted": 105664, - "total_column_articles": 526, + "total_acs": 54557, + "total_submitted": 105901, + "total_column_articles": 528, "frontend_question_id": "1646", "is_new_question": false }, @@ -38736,8 +39198,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": 1066, - "total_submitted": 1309, + "total_acs": 1069, + "total_submitted": 1312, "total_column_articles": 34, "frontend_question_id": "1628", "is_new_question": false @@ -38757,8 +39219,8 @@ "question__title": "Design Front Middle Back Queue", "question__title_slug": "design-front-middle-back-queue", "question__hide": false, - "total_acs": 23799, - "total_submitted": 39398, + "total_acs": 23858, + "total_submitted": 39503, "total_column_articles": 272, "frontend_question_id": "1670", "is_new_question": false @@ -38778,8 +39240,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": 16454, - "total_submitted": 32109, + "total_acs": 16642, + "total_submitted": 32518, "total_column_articles": 177, "frontend_question_id": "1671", "is_new_question": false @@ -38799,9 +39261,9 @@ "question__title": "Merge In Between Linked Lists", "question__title_slug": "merge-in-between-linked-lists", "question__hide": false, - "total_acs": 51200, - "total_submitted": 66623, - "total_column_articles": 654, + "total_acs": 51436, + "total_submitted": 66896, + "total_column_articles": 656, "frontend_question_id": "1669", "is_new_question": false }, @@ -38820,9 +39282,9 @@ "question__title": "Maximum Repeating Substring", "question__title_slug": "maximum-repeating-substring", "question__hide": false, - "total_acs": 46610, - "total_submitted": 100102, - "total_column_articles": 631, + "total_acs": 46861, + "total_submitted": 100732, + "total_column_articles": 630, "frontend_question_id": "1668", "is_new_question": false }, @@ -38841,9 +39303,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": 6945, - "total_submitted": 8892, - "total_column_articles": 68, + "total_acs": 6974, + "total_submitted": 8926, + "total_column_articles": 69, "frontend_question_id": "1623", "is_new_question": false }, @@ -38862,9 +39324,9 @@ "question__title": "Furthest Building You Can Reach", "question__title_slug": "furthest-building-you-can-reach", "question__hide": false, - "total_acs": 13153, - "total_submitted": 27982, - "total_column_articles": 193, + "total_acs": 13285, + "total_submitted": 28229, + "total_column_articles": 195, "frontend_question_id": "1642", "is_new_question": false }, @@ -38883,8 +39345,8 @@ "question__title": "Count Sorted Vowel Strings", "question__title_slug": "count-sorted-vowel-strings", "question__hide": false, - "total_acs": 40958, - "total_submitted": 49647, + "total_acs": 41078, + "total_submitted": 49783, "total_column_articles": 615, "frontend_question_id": "1641", "is_new_question": false @@ -38904,9 +39366,9 @@ "question__title": "Check Array Formation Through Concatenation", "question__title_slug": "check-array-formation-through-concatenation", "question__hide": false, - "total_acs": 46502, - "total_submitted": 76161, - "total_column_articles": 680, + "total_acs": 46582, + "total_submitted": 76270, + "total_column_articles": 681, "frontend_question_id": "1640", "is_new_question": false }, @@ -38925,9 +39387,9 @@ "question__title": "Find the Missing IDs", "question__title_slug": "find-the-missing-ids", "question__hide": false, - "total_acs": 6151, - "total_submitted": 8450, - "total_column_articles": 74, + "total_acs": 6189, + "total_submitted": 8501, + "total_column_articles": 75, "frontend_question_id": "1613", "is_new_question": false }, @@ -38946,9 +39408,9 @@ "question__title": "Distribute Repeating Integers", "question__title_slug": "distribute-repeating-integers", "question__hide": false, - "total_acs": 4879, - "total_submitted": 12186, - "total_column_articles": 69, + "total_acs": 4915, + "total_submitted": 12290, + "total_column_articles": 70, "frontend_question_id": "1655", "is_new_question": false }, @@ -38967,8 +39429,8 @@ "question__title": "Minimum Jumps to Reach Home", "question__title_slug": "minimum-jumps-to-reach-home", "question__hide": false, - "total_acs": 23970, - "total_submitted": 65866, + "total_acs": 24118, + "total_submitted": 66176, "total_column_articles": 179, "frontend_question_id": "1654", "is_new_question": false @@ -38988,9 +39450,9 @@ "question__title": "Minimum Deletions to Make String Balanced", "question__title_slug": "minimum-deletions-to-make-string-balanced", "question__hide": false, - "total_acs": 35924, - "total_submitted": 59000, - "total_column_articles": 366, + "total_acs": 35994, + "total_submitted": 59119, + "total_column_articles": 367, "frontend_question_id": "1653", "is_new_question": false }, @@ -39009,9 +39471,9 @@ "question__title": "Defuse the Bomb", "question__title_slug": "defuse-the-bomb", "question__hide": false, - "total_acs": 54556, - "total_submitted": 77135, - "total_column_articles": 746, + "total_acs": 54989, + "total_submitted": 77669, + "total_column_articles": 750, "frontend_question_id": "1652", "is_new_question": false }, @@ -39030,9 +39492,9 @@ "question__title": "Path With Minimum Effort", "question__title_slug": "path-with-minimum-effort", "question__hide": false, - "total_acs": 64128, - "total_submitted": 121544, - "total_column_articles": 548, + "total_acs": 64584, + "total_submitted": 122382, + "total_column_articles": 551, "frontend_question_id": "1631", "is_new_question": false }, @@ -39051,9 +39513,9 @@ "question__title": "Arithmetic Subarrays", "question__title_slug": "arithmetic-subarrays", "question__hide": false, - "total_acs": 34690, - "total_submitted": 45516, - "total_column_articles": 457, + "total_acs": 34726, + "total_submitted": 45558, + "total_column_articles": 458, "frontend_question_id": "1630", "is_new_question": false }, @@ -39072,9 +39534,9 @@ "question__title": "Slowest Key", "question__title_slug": "slowest-key", "question__hide": false, - "total_acs": 38918, - "total_submitted": 69671, - "total_column_articles": 466, + "total_acs": 39010, + "total_submitted": 69803, + "total_column_articles": 468, "frontend_question_id": "1629", "is_new_question": false }, @@ -39093,8 +39555,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": 994, - "total_submitted": 1394, + "total_acs": 999, + "total_submitted": 1400, "total_column_articles": 35, "frontend_question_id": "1612", "is_new_question": false @@ -39114,9 +39576,9 @@ "question__title": "Sellers With No Sales", "question__title_slug": "sellers-with-no-sales", "question__hide": false, - "total_acs": 15161, - "total_submitted": 28818, - "total_column_articles": 109, + "total_acs": 15444, + "total_submitted": 29386, + "total_column_articles": 111, "frontend_question_id": "1607", "is_new_question": false }, @@ -39135,8 +39597,8 @@ "question__title": "Best Team With No Conflicts", "question__title_slug": "best-team-with-no-conflicts", "question__hide": false, - "total_acs": 26871, - "total_submitted": 49829, + "total_acs": 27098, + "total_submitted": 50164, "total_column_articles": 257, "frontend_question_id": "1626", "is_new_question": false @@ -39156,9 +39618,9 @@ "question__title": "Lexicographically Smallest String After Applying Operations", "question__title_slug": "lexicographically-smallest-string-after-applying-operations", "question__hide": false, - "total_acs": 17699, - "total_submitted": 26561, - "total_column_articles": 152, + "total_acs": 17719, + "total_submitted": 26594, + "total_column_articles": 153, "frontend_question_id": "1625", "is_new_question": false }, @@ -39177,9 +39639,9 @@ "question__title": "Largest Substring Between Two Equal Characters", "question__title_slug": "largest-substring-between-two-equal-characters", "question__hide": false, - "total_acs": 49257, - "total_submitted": 76370, - "total_column_articles": 710, + "total_acs": 49396, + "total_submitted": 76570, + "total_column_articles": 713, "frontend_question_id": "1624", "is_new_question": false }, @@ -39198,8 +39660,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": 2272, - "total_submitted": 3144, + "total_acs": 2312, + "total_submitted": 3209, "total_column_articles": 64, "frontend_question_id": "1602", "is_new_question": false @@ -39219,8 +39681,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": 3339, - "total_submitted": 7059, + "total_acs": 3418, + "total_submitted": 7191, "total_column_articles": 78, "frontend_question_id": "1639", "is_new_question": false @@ -39240,8 +39702,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": 23397, - "total_submitted": 30189, + "total_acs": 23426, + "total_submitted": 30225, "total_column_articles": 200, "frontend_question_id": "1638", "is_new_question": false @@ -39261,8 +39723,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": 31889, - "total_submitted": 37972, + "total_acs": 32027, + "total_submitted": 38131, "total_column_articles": 291, "frontend_question_id": "1637", "is_new_question": false @@ -39282,9 +39744,9 @@ "question__title": "Sort Array by Increasing Frequency", "question__title_slug": "sort-array-by-increasing-frequency", "question__hide": false, - "total_acs": 51437, - "total_submitted": 68808, - "total_column_articles": 633, + "total_acs": 51618, + "total_submitted": 69043, + "total_column_articles": 637, "frontend_question_id": "1636", "is_new_question": false }, @@ -39303,8 +39765,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": 13417, - "total_submitted": 17074, + "total_acs": 13456, + "total_submitted": 17129, "total_column_articles": 106, "frontend_question_id": "1617", "is_new_question": false @@ -39324,8 +39786,8 @@ "question__title": "Split Two Strings to Make Palindrome", "question__title_slug": "split-two-strings-to-make-palindrome", "question__hide": false, - "total_acs": 24670, - "total_submitted": 65744, + "total_acs": 24698, + "total_submitted": 65812, "total_column_articles": 262, "frontend_question_id": "1616", "is_new_question": false @@ -39345,9 +39807,9 @@ "question__title": "Maximal Network Rank", "question__title_slug": "maximal-network-rank", "question__hide": false, - "total_acs": 34278, - "total_submitted": 56647, - "total_column_articles": 298, + "total_acs": 34360, + "total_submitted": 56751, + "total_column_articles": 300, "frontend_question_id": "1615", "is_new_question": false }, @@ -39366,9 +39828,9 @@ "question__title": "Maximum Nesting Depth of the Parentheses", "question__title_slug": "maximum-nesting-depth-of-the-parentheses", "question__hide": false, - "total_acs": 72486, - "total_submitted": 88617, - "total_column_articles": 898, + "total_acs": 72928, + "total_submitted": 89157, + "total_column_articles": 901, "frontend_question_id": "1614", "is_new_question": false }, @@ -39387,8 +39849,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": 881, - "total_submitted": 1330, + "total_acs": 886, + "total_submitted": 1335, "total_column_articles": 35, "frontend_question_id": "1597", "is_new_question": false @@ -39408,9 +39870,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": 10288, - "total_submitted": 14825, - "total_column_articles": 120, + "total_acs": 10432, + "total_submitted": 15045, + "total_column_articles": 121, "frontend_question_id": "1596", "is_new_question": false }, @@ -39429,9 +39891,9 @@ "question__title": "Bank Account Summary II", "question__title_slug": "bank-account-summary-ii", "question__hide": false, - "total_acs": 37693, - "total_submitted": 47634, - "total_column_articles": 194, + "total_acs": 38175, + "total_submitted": 48275, + "total_column_articles": 198, "frontend_question_id": "1587", "is_new_question": false }, @@ -39450,9 +39912,9 @@ "question__title": "Maximum Number of Visible Points", "question__title_slug": "maximum-number-of-visible-points", "question__hide": false, - "total_acs": 18137, - "total_submitted": 40994, - "total_column_articles": 165, + "total_acs": 18209, + "total_submitted": 41236, + "total_column_articles": 166, "frontend_question_id": "1610", "is_new_question": false }, @@ -39471,8 +39933,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": 3765, - "total_submitted": 6246, + "total_acs": 3802, + "total_submitted": 6295, "total_column_articles": 76, "frontend_question_id": "1611", "is_new_question": false @@ -39492,9 +39954,9 @@ "question__title": "Even Odd Tree", "question__title_slug": "even-odd-tree", "question__hide": false, - "total_acs": 35534, - "total_submitted": 61009, - "total_column_articles": 515, + "total_acs": 35670, + "total_submitted": 61214, + "total_column_articles": 517, "frontend_question_id": "1609", "is_new_question": false }, @@ -39513,9 +39975,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": 57028, - "total_submitted": 92867, - "total_column_articles": 833, + "total_acs": 57261, + "total_submitted": 93186, + "total_column_articles": 834, "frontend_question_id": "1608", "is_new_question": false }, @@ -39535,7 +39997,7 @@ "question__title_slug": "binary-search-tree-iterator-ii", "question__hide": false, "total_acs": 945, - "total_submitted": 1707, + "total_submitted": 1710, "total_column_articles": 41, "frontend_question_id": "1586", "is_new_question": false @@ -39555,9 +40017,9 @@ "question__title": "Fancy Sequence", "question__title_slug": "fancy-sequence", "question__hide": false, - "total_acs": 6136, - "total_submitted": 33478, - "total_column_articles": 122, + "total_acs": 6224, + "total_submitted": 33699, + "total_column_articles": 124, "frontend_question_id": "1622", "is_new_question": false }, @@ -39576,8 +40038,8 @@ "question__title": "Cat and Mouse II", "question__title_slug": "cat-and-mouse-ii", "question__hide": false, - "total_acs": 13964, - "total_submitted": 21992, + "total_acs": 13989, + "total_submitted": 22036, "total_column_articles": 89, "frontend_question_id": "1728", "is_new_question": false @@ -39597,8 +40059,8 @@ "question__title": "Coordinate With Maximum Network Quality", "question__title_slug": "coordinate-with-maximum-network-quality", "question__hide": false, - "total_acs": 30008, - "total_submitted": 65322, + "total_acs": 30083, + "total_submitted": 65485, "total_column_articles": 290, "frontend_question_id": "1620", "is_new_question": false @@ -39618,8 +40080,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": 3530, - "total_submitted": 7246, + "total_acs": 3570, + "total_submitted": 7309, "total_column_articles": 61, "frontend_question_id": "1621", "is_new_question": false @@ -39639,9 +40101,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": 84066, - "total_submitted": 116703, - "total_column_articles": 428, + "total_acs": 86917, + "total_submitted": 121263, + "total_column_articles": 437, "frontend_question_id": "1581", "is_new_question": false }, @@ -39660,9 +40122,9 @@ "question__title": "Maximum Number of Achievable Transfer Requests", "question__title_slug": "maximum-number-of-achievable-transfer-requests", "question__hide": false, - "total_acs": 23658, - "total_submitted": 38131, - "total_column_articles": 266, + "total_acs": 23754, + "total_submitted": 38264, + "total_column_articles": 267, "frontend_question_id": "1601", "is_new_question": false }, @@ -39681,9 +40143,9 @@ "question__title": "Throne Inheritance", "question__title_slug": "throne-inheritance", "question__hide": false, - "total_acs": 33305, - "total_submitted": 48229, - "total_column_articles": 310, + "total_acs": 33388, + "total_submitted": 48336, + "total_column_articles": 309, "frontend_question_id": "1600", "is_new_question": false }, @@ -39702,9 +40164,9 @@ "question__title": "Maximum Profit of Operating a Centennial Wheel", "question__title_slug": "maximum-profit-of-operating-a-centennial-wheel", "question__hide": false, - "total_acs": 37026, - "total_submitted": 69748, - "total_column_articles": 411, + "total_acs": 37245, + "total_submitted": 70358, + "total_column_articles": 412, "frontend_question_id": "1599", "is_new_question": false }, @@ -39723,9 +40185,9 @@ "question__title": "Crawler Log Folder", "question__title_slug": "crawler-log-folder", "question__hide": false, - "total_acs": 46460, - "total_submitted": 66798, - "total_column_articles": 565, + "total_acs": 46579, + "total_submitted": 66954, + "total_column_articles": 566, "frontend_question_id": "1598", "is_new_question": false }, @@ -39744,8 +40206,8 @@ "question__title": "Put Boxes Into the Warehouse II", "question__title_slug": "put-boxes-into-the-warehouse-ii", "question__hide": false, - "total_acs": 726, - "total_submitted": 1351, + "total_acs": 727, + "total_submitted": 1352, "total_column_articles": 33, "frontend_question_id": "1580", "is_new_question": false @@ -39765,8 +40227,8 @@ "question__title": "Warehouse Manager", "question__title_slug": "warehouse-manager", "question__hide": false, - "total_acs": 14770, - "total_submitted": 18949, + "total_acs": 14948, + "total_submitted": 19169, "total_column_articles": 112, "frontend_question_id": "1571", "is_new_question": false @@ -39786,8 +40248,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": 11198, - "total_submitted": 17078, + "total_acs": 11212, + "total_submitted": 17102, "total_column_articles": 94, "frontend_question_id": "1595", "is_new_question": false @@ -39807,9 +40269,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": 8185, - "total_submitted": 22983, - "total_column_articles": 150, + "total_acs": 8409, + "total_submitted": 23502, + "total_column_articles": 153, "frontend_question_id": "1594", "is_new_question": false }, @@ -39828,9 +40290,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": 10254, - "total_submitted": 17492, - "total_column_articles": 155, + "total_acs": 10317, + "total_submitted": 17588, + "total_column_articles": 157, "frontend_question_id": "1593", "is_new_question": false }, @@ -39849,9 +40311,9 @@ "question__title": "Rearrange Spaces Between Words", "question__title_slug": "rearrange-spaces-between-words", "question__hide": false, - "total_acs": 42518, - "total_submitted": 91189, - "total_column_articles": 593, + "total_acs": 42591, + "total_submitted": 91349, + "total_column_articles": 595, "frontend_question_id": "1592", "is_new_question": false }, @@ -39870,8 +40332,8 @@ "question__title": "Dot Product of Two Sparse Vectors", "question__title_slug": "dot-product-of-two-sparse-vectors", "question__hide": false, - "total_acs": 5203, - "total_submitted": 5956, + "total_acs": 5243, + "total_submitted": 6003, "total_column_articles": 65, "frontend_question_id": "1570", "is_new_question": false @@ -39891,8 +40353,8 @@ "question__title": "Unique Orders and Customers Per Month", "question__title_slug": "unique-orders-and-customers-per-month", "question__hide": false, - "total_acs": 6881, - "total_submitted": 9213, + "total_acs": 6914, + "total_submitted": 9256, "total_column_articles": 63, "frontend_question_id": "1565", "is_new_question": false @@ -39912,8 +40374,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": 28399, - "total_submitted": 35142, + "total_acs": 28436, + "total_submitted": 35188, "total_column_articles": 280, "frontend_question_id": "1605", "is_new_question": false @@ -39933,8 +40395,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": 21618, - "total_submitted": 44820, + "total_acs": 21653, + "total_submitted": 44890, "total_column_articles": 205, "frontend_question_id": "1606", "is_new_question": false @@ -39954,8 +40416,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": 29836, - "total_submitted": 59339, + "total_acs": 29879, + "total_submitted": 59422, "total_column_articles": 352, "frontend_question_id": "1604", "is_new_question": false @@ -39975,9 +40437,9 @@ "question__title": "Design Parking System", "question__title_slug": "design-parking-system", "question__hide": false, - "total_acs": 81595, - "total_submitted": 97840, - "total_column_articles": 613, + "total_acs": 81889, + "total_submitted": 98183, + "total_column_articles": 615, "frontend_question_id": "1603", "is_new_question": false }, @@ -39996,8 +40458,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": 3732, - "total_submitted": 8540, + "total_acs": 3751, + "total_submitted": 8578, "total_column_articles": 54, "frontend_question_id": "1585", "is_new_question": false @@ -40017,9 +40479,9 @@ "question__title": "Min Cost to Connect All Points", "question__title_slug": "min-cost-to-connect-all-points", "question__hide": false, - "total_acs": 60942, - "total_submitted": 92964, - "total_column_articles": 709, + "total_acs": 61425, + "total_submitted": 93606, + "total_column_articles": 712, "frontend_question_id": "1584", "is_new_question": false }, @@ -40038,9 +40500,9 @@ "question__title": "Count Unhappy Friends", "question__title_slug": "count-unhappy-friends", "question__hide": false, - "total_acs": 21314, - "total_submitted": 31453, - "total_column_articles": 260, + "total_acs": 21344, + "total_submitted": 31491, + "total_column_articles": 261, "frontend_question_id": "1583", "is_new_question": false }, @@ -40059,9 +40521,9 @@ "question__title": "Special Positions in a Binary Matrix", "question__title_slug": "special-positions-in-a-binary-matrix", "question__hide": false, - "total_acs": 43695, - "total_submitted": 63227, - "total_column_articles": 490, + "total_acs": 43800, + "total_submitted": 63367, + "total_column_articles": 491, "frontend_question_id": "1582", "is_new_question": false }, @@ -40080,8 +40542,8 @@ "question__title": "Put Boxes Into the Warehouse I", "question__title_slug": "put-boxes-into-the-warehouse-i", "question__hide": false, - "total_acs": 1302, - "total_submitted": 2311, + "total_acs": 1308, + "total_submitted": 2320, "total_column_articles": 44, "frontend_question_id": "1564", "is_new_question": false @@ -40101,9 +40563,9 @@ "question__title": "Bank Account Summary", "question__title_slug": "bank-account-summary", "question__hide": false, - "total_acs": 6243, - "total_submitted": 13681, - "total_column_articles": 85, + "total_acs": 6292, + "total_submitted": 13765, + "total_column_articles": 86, "frontend_question_id": "1555", "is_new_question": false }, @@ -40122,8 +40584,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": 19530, - "total_submitted": 31576, + "total_acs": 19595, + "total_submitted": 31659, "total_column_articles": 337, "frontend_question_id": "1579", "is_new_question": false @@ -40143,9 +40605,9 @@ "question__title": "Minimum Time to Make Rope Colorful", "question__title_slug": "minimum-time-to-make-rope-colorful", "question__hide": false, - "total_acs": 17211, - "total_submitted": 28620, - "total_column_articles": 297, + "total_acs": 17268, + "total_submitted": 28699, + "total_column_articles": 298, "frontend_question_id": "1578", "is_new_question": false }, @@ -40164,9 +40626,9 @@ "question__title": "Number of Ways Where Square of Number Is Equal to Product of Two Numbers", "question__title_slug": "number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers", "question__hide": false, - "total_acs": 7807, - "total_submitted": 21763, - "total_column_articles": 117, + "total_acs": 7843, + "total_submitted": 21831, + "total_column_articles": 118, "frontend_question_id": "1577", "is_new_question": false }, @@ -40185,9 +40647,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": 55997, - "total_submitted": 110700, - "total_column_articles": 675, + "total_acs": 56205, + "total_submitted": 111072, + "total_column_articles": 677, "frontend_question_id": "1576", "is_new_question": false }, @@ -40206,8 +40668,8 @@ "question__title": "Strings Differ by One Character", "question__title_slug": "strings-differ-by-one-character", "question__hide": false, - "total_acs": 1389, - "total_submitted": 3000, + "total_acs": 1395, + "total_submitted": 3019, "total_column_articles": 36, "frontend_question_id": "1554", "is_new_question": false @@ -40227,9 +40689,9 @@ "question__title": "Strange Printer II", "question__title_slug": "strange-printer-ii", "question__hide": false, - "total_acs": 2775, - "total_submitted": 4342, - "total_column_articles": 73, + "total_acs": 2824, + "total_submitted": 4400, + "total_column_articles": 74, "frontend_question_id": "1591", "is_new_question": false }, @@ -40248,9 +40710,9 @@ "question__title": "Maximum Sum Obtained of Any Permutation", "question__title_slug": "maximum-sum-obtained-of-any-permutation", "question__hide": false, - "total_acs": 7443, - "total_submitted": 22467, - "total_column_articles": 104, + "total_acs": 7516, + "total_submitted": 22631, + "total_column_articles": 106, "frontend_question_id": "1589", "is_new_question": false }, @@ -40269,9 +40731,9 @@ "question__title": "Make Sum Divisible by P", "question__title_slug": "make-sum-divisible-by-p", "question__hide": false, - "total_acs": 27704, - "total_submitted": 75663, - "total_column_articles": 204, + "total_acs": 27905, + "total_submitted": 76137, + "total_column_articles": 205, "frontend_question_id": "1590", "is_new_question": false }, @@ -40290,9 +40752,9 @@ "question__title": "Sum of All Odd Length Subarrays", "question__title_slug": "sum-of-all-odd-length-subarrays", "question__hide": false, - "total_acs": 71956, - "total_submitted": 86959, - "total_column_articles": 1034, + "total_acs": 72143, + "total_submitted": 87202, + "total_column_articles": 1037, "frontend_question_id": "1588", "is_new_question": false }, @@ -40311,8 +40773,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": 3781, - "total_submitted": 7672, + "total_acs": 3816, + "total_submitted": 7732, "total_column_articles": 68, "frontend_question_id": "1569", "is_new_question": false @@ -40332,8 +40794,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": 4379, - "total_submitted": 9833, + "total_acs": 4405, + "total_submitted": 9899, "total_column_articles": 89, "frontend_question_id": "1568", "is_new_question": false @@ -40353,9 +40815,9 @@ "question__title": "Maximum Length of Subarray With Positive Product", "question__title_slug": "maximum-length-of-subarray-with-positive-product", "question__hide": false, - "total_acs": 37272, - "total_submitted": 86330, - "total_column_articles": 485, + "total_acs": 37473, + "total_submitted": 86658, + "total_column_articles": 486, "frontend_question_id": "1567", "is_new_question": false }, @@ -40374,9 +40836,9 @@ "question__title": "Detect Pattern of Length M Repeated K or More Times", "question__title_slug": "detect-pattern-of-length-m-repeated-k-or-more-times", "question__hide": false, - "total_acs": 14388, - "total_submitted": 32249, - "total_column_articles": 205, + "total_acs": 14467, + "total_submitted": 32416, + "total_column_articles": 207, "frontend_question_id": "1566", "is_new_question": false }, @@ -40395,8 +40857,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": 12125, - "total_submitted": 18433, + "total_acs": 12308, + "total_submitted": 18735, "total_column_articles": 141, "frontend_question_id": "1549", "is_new_question": false @@ -40416,8 +40878,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": 795, - "total_submitted": 1237, + "total_acs": 800, + "total_submitted": 1245, "total_column_articles": 25, "frontend_question_id": "1548", "is_new_question": false @@ -40437,8 +40899,8 @@ "question__title": "Fix Product Name Format", "question__title_slug": "fix-product-name-format", "question__hide": false, - "total_acs": 6518, - "total_submitted": 11818, + "total_acs": 6552, + "total_submitted": 11871, "total_column_articles": 62, "frontend_question_id": "1543", "is_new_question": false @@ -40458,9 +40920,9 @@ "question__title": "Stone Game V", "question__title_slug": "stone-game-v", "question__hide": false, - "total_acs": 6485, - "total_submitted": 16274, - "total_column_articles": 83, + "total_acs": 6546, + "total_submitted": 16431, + "total_column_articles": 84, "frontend_question_id": "1563", "is_new_question": false }, @@ -40479,8 +40941,8 @@ "question__title": "Find Latest Group of Size M", "question__title_slug": "find-latest-group-of-size-m", "question__hide": false, - "total_acs": 7578, - "total_submitted": 20455, + "total_acs": 7619, + "total_submitted": 20523, "total_column_articles": 144, "frontend_question_id": "1562", "is_new_question": false @@ -40500,9 +40962,9 @@ "question__title": "Maximum Number of Coins You Can Get", "question__title_slug": "maximum-number-of-coins-you-can-get", "question__hide": false, - "total_acs": 18991, - "total_submitted": 24327, - "total_column_articles": 282, + "total_acs": 19149, + "total_submitted": 24520, + "total_column_articles": 284, "frontend_question_id": "1561", "is_new_question": false }, @@ -40521,9 +40983,9 @@ "question__title": "Most Visited Sector in a Circular Track", "question__title_slug": "most-visited-sector-in-a-circular-track", "question__hide": false, - "total_acs": 13374, - "total_submitted": 23029, - "total_column_articles": 140, + "total_acs": 13432, + "total_submitted": 23147, + "total_column_articles": 141, "frontend_question_id": "1560", "is_new_question": false }, @@ -40542,8 +41004,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": 707, - "total_submitted": 1179, + "total_acs": 726, + "total_submitted": 1199, "total_column_articles": 16, "frontend_question_id": "1538", "is_new_question": false @@ -40563,8 +41025,8 @@ "question__title": "Count All Possible Routes", "question__title_slug": "count-all-possible-routes", "question__hide": false, - "total_acs": 14286, - "total_submitted": 25347, + "total_acs": 14362, + "total_submitted": 25481, "total_column_articles": 130, "frontend_question_id": "1575", "is_new_question": false @@ -40584,9 +41046,9 @@ "question__title": "Shortest Subarray to be Removed to Make Array Sorted", "question__title_slug": "shortest-subarray-to-be-removed-to-make-array-sorted", "question__hide": false, - "total_acs": 28500, - "total_submitted": 65784, - "total_column_articles": 299, + "total_acs": 28667, + "total_submitted": 66114, + "total_column_articles": 300, "frontend_question_id": "1574", "is_new_question": false }, @@ -40605,8 +41067,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": 7548, - "total_submitted": 23859, + "total_acs": 7643, + "total_submitted": 24091, "total_column_articles": 99, "frontend_question_id": "1573", "is_new_question": false @@ -40626,9 +41088,9 @@ "question__title": "Matrix Diagonal Sum", "question__title_slug": "matrix-diagonal-sum", "question__hide": false, - "total_acs": 73892, - "total_submitted": 89141, - "total_column_articles": 858, + "total_acs": 74239, + "total_submitted": 89554, + "total_column_articles": 860, "frontend_question_id": "1572", "is_new_question": false }, @@ -40647,9 +41109,9 @@ "question__title": "Minimum Number of Days to Eat N Oranges", "question__title_slug": "minimum-number-of-days-to-eat-n-oranges", "question__hide": false, - "total_acs": 24168, - "total_submitted": 61458, - "total_column_articles": 209, + "total_acs": 24499, + "total_submitted": 62227, + "total_column_articles": 210, "frontend_question_id": "1553", "is_new_question": false }, @@ -40668,9 +41130,9 @@ "question__title": "Magnetic Force Between Two Balls", "question__title_slug": "magnetic-force-between-two-balls", "question__hide": false, - "total_acs": 20848, - "total_submitted": 35999, - "total_column_articles": 247, + "total_acs": 20974, + "total_submitted": 36180, + "total_column_articles": 249, "frontend_question_id": "1552", "is_new_question": false }, @@ -40689,9 +41151,9 @@ "question__title": "Minimum Operations to Make Array Equal", "question__title_slug": "minimum-operations-to-make-array-equal", "question__hide": false, - "total_acs": 16581, - "total_submitted": 20132, - "total_column_articles": 232, + "total_acs": 16635, + "total_submitted": 20201, + "total_column_articles": 234, "frontend_question_id": "1551", "is_new_question": false }, @@ -40710,8 +41172,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": 1884, - "total_submitted": 3314, + "total_acs": 1913, + "total_submitted": 3362, "total_column_articles": 58, "frontend_question_id": "1533", "is_new_question": false @@ -40731,8 +41193,8 @@ "question__title": "The Most Recent Three Orders", "question__title_slug": "the-most-recent-three-orders", "question__hide": false, - "total_acs": 10243, - "total_submitted": 16265, + "total_acs": 10417, + "total_submitted": 16538, "total_column_articles": 116, "frontend_question_id": "1532", "is_new_question": false @@ -40752,9 +41214,9 @@ "question__title": "Patients With a Condition", "question__title_slug": "patients-with-a-condition", "question__hide": false, - "total_acs": 74046, - "total_submitted": 157771, - "total_column_articles": 329, + "total_acs": 75192, + "total_submitted": 160120, + "total_column_articles": 333, "frontend_question_id": "1527", "is_new_question": false }, @@ -40773,9 +41235,9 @@ "question__title": "Minimum Cost to Cut a Stick", "question__title_slug": "minimum-cost-to-cut-a-stick", "question__hide": false, - "total_acs": 8482, - "total_submitted": 14676, - "total_column_articles": 123, + "total_acs": 8602, + "total_submitted": 14852, + "total_column_articles": 125, "frontend_question_id": "1547", "is_new_question": false }, @@ -40794,9 +41256,9 @@ "question__title": "Find Longest Awesome Substring", "question__title_slug": "find-longest-awesome-substring", "question__hide": false, - "total_acs": 5196, - "total_submitted": 11513, - "total_column_articles": 84, + "total_acs": 16110, + "total_submitted": 30367, + "total_column_articles": 127, "frontend_question_id": "1542", "is_new_question": false }, @@ -40815,9 +41277,9 @@ "question__title": "Find Kth Bit in Nth Binary String", "question__title_slug": "find-kth-bit-in-nth-binary-string", "question__hide": false, - "total_acs": 15897, - "total_submitted": 26822, - "total_column_articles": 194, + "total_acs": 16056, + "total_submitted": 27032, + "total_column_articles": 195, "frontend_question_id": "1545", "is_new_question": false }, @@ -40836,9 +41298,9 @@ "question__title": "Make The String Great", "question__title_slug": "make-the-string-great", "question__hide": false, - "total_acs": 32051, - "total_submitted": 56561, - "total_column_articles": 491, + "total_acs": 32304, + "total_submitted": 56881, + "total_column_articles": 493, "frontend_question_id": "1544", "is_new_question": false }, @@ -40857,8 +41319,8 @@ "question__title": "Diameter of N-Ary Tree", "question__title_slug": "diameter-of-n-ary-tree", "question__hide": false, - "total_acs": 3324, - "total_submitted": 4623, + "total_acs": 3374, + "total_submitted": 4685, "total_column_articles": 69, "frontend_question_id": "1522", "is_new_question": false @@ -40878,9 +41340,9 @@ "question__title": "Find Users With Valid E-Mails", "question__title_slug": "find-users-with-valid-e-mails", "question__hide": false, - "total_acs": 25586, - "total_submitted": 48206, - "total_column_articles": 132, + "total_acs": 26594, + "total_submitted": 50168, + "total_column_articles": 135, "frontend_question_id": "1517", "is_new_question": false }, @@ -40899,8 +41361,8 @@ "question__title": "Detect Cycles in 2D Grid", "question__title_slug": "detect-cycles-in-2d-grid", "question__hide": false, - "total_acs": 8370, - "total_submitted": 19953, + "total_acs": 8513, + "total_submitted": 20206, "total_column_articles": 127, "frontend_question_id": "1559", "is_new_question": false @@ -40920,8 +41382,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": 7212, - "total_submitted": 11504, + "total_acs": 7288, + "total_submitted": 11620, "total_column_articles": 104, "frontend_question_id": "1558", "is_new_question": false @@ -40941,9 +41403,9 @@ "question__title": "Minimum Number of Vertices to Reach All Nodes", "question__title_slug": "minimum-number-of-vertices-to-reach-all-nodes", "question__hide": false, - "total_acs": 21196, - "total_submitted": 25994, - "total_column_articles": 250, + "total_acs": 21403, + "total_submitted": 26222, + "total_column_articles": 254, "frontend_question_id": "1557", "is_new_question": false }, @@ -40962,9 +41424,9 @@ "question__title": "Thousand Separator", "question__title_slug": "thousand-separator", "question__hide": false, - "total_acs": 23447, - "total_submitted": 41650, - "total_column_articles": 327, + "total_acs": 23626, + "total_submitted": 41907, + "total_column_articles": 328, "frontend_question_id": "1556", "is_new_question": false }, @@ -40983,8 +41445,8 @@ "question__title": "Get the Maximum Score", "question__title_slug": "get-the-maximum-score", "question__hide": false, - "total_acs": 7660, - "total_submitted": 18877, + "total_acs": 7746, + "total_submitted": 19064, "total_column_articles": 136, "frontend_question_id": "1537", "is_new_question": false @@ -41004,8 +41466,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": 5793, - "total_submitted": 12350, + "total_acs": 5844, + "total_submitted": 12431, "total_column_articles": 99, "frontend_question_id": "1536", "is_new_question": false @@ -41025,9 +41487,9 @@ "question__title": "Find the Winner of an Array Game", "question__title_slug": "find-the-winner-of-an-array-game", "question__hide": false, - "total_acs": 18073, - "total_submitted": 38907, - "total_column_articles": 231, + "total_acs": 34503, + "total_submitted": 64632, + "total_column_articles": 377, "frontend_question_id": "1535", "is_new_question": false }, @@ -41046,9 +41508,9 @@ "question__title": "Count Good Triplets", "question__title_slug": "count-good-triplets", "question__hide": false, - "total_acs": 40470, - "total_submitted": 53833, - "total_column_articles": 326, + "total_acs": 41293, + "total_submitted": 54915, + "total_column_articles": 329, "frontend_question_id": "1534", "is_new_question": false }, @@ -41067,8 +41529,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": 485, - "total_submitted": 922, + "total_acs": 486, + "total_submitted": 927, "total_column_articles": 20, "frontend_question_id": "1516", "is_new_question": false @@ -41088,9 +41550,9 @@ "question__title": "Customer Order Frequency", "question__title_slug": "customer-order-frequency", "question__hide": false, - "total_acs": 11711, - "total_submitted": 19346, - "total_column_articles": 130, + "total_acs": 11876, + "total_submitted": 19648, + "total_column_articles": 132, "frontend_question_id": "1511", "is_new_question": false }, @@ -41109,9 +41571,9 @@ "question__title": "Number of Good Leaf Nodes Pairs", "question__title_slug": "number-of-good-leaf-nodes-pairs", "question__hide": false, - "total_acs": 12520, - "total_submitted": 21150, - "total_column_articles": 217, + "total_acs": 12571, + "total_submitted": 21227, + "total_column_articles": 218, "frontend_question_id": "1530", "is_new_question": false }, @@ -41130,9 +41592,9 @@ "question__title": "Minimum Suffix Flips", "question__title_slug": "minimum-suffix-flips", "question__hide": false, - "total_acs": 12465, - "total_submitted": 17652, - "total_column_articles": 191, + "total_acs": 12523, + "total_submitted": 17725, + "total_column_articles": 193, "frontend_question_id": "1529", "is_new_question": false }, @@ -41151,9 +41613,9 @@ "question__title": "Shuffle String", "question__title_slug": "shuffle-string", "question__hide": false, - "total_acs": 42958, - "total_submitted": 54503, - "total_column_articles": 515, + "total_acs": 43139, + "total_submitted": 54710, + "total_column_articles": 518, "frontend_question_id": "1528", "is_new_question": false }, @@ -41172,8 +41634,8 @@ "question__title": "Find Root of N-Ary Tree", "question__title_slug": "find-root-of-n-ary-tree", "question__hide": false, - "total_acs": 2187, - "total_submitted": 2694, + "total_acs": 2225, + "total_submitted": 2760, "total_column_articles": 37, "frontend_question_id": "1506", "is_new_question": false @@ -41193,9 +41655,9 @@ "question__title": "Maximum Number of Non-Overlapping Subarrays With Sum Equals Target", "question__title_slug": "maximum-number-of-non-overlapping-subarrays-with-sum-equals-target", "question__hide": false, - "total_acs": 8297, - "total_submitted": 18068, - "total_column_articles": 113, + "total_acs": 8454, + "total_submitted": 18287, + "total_column_articles": 112, "frontend_question_id": "1546", "is_new_question": false }, @@ -41214,9 +41676,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": 21817, - "total_submitted": 44475, - "total_column_articles": 241, + "total_acs": 21999, + "total_submitted": 44817, + "total_column_articles": 243, "frontend_question_id": "1541", "is_new_question": false }, @@ -41235,9 +41697,9 @@ "question__title": "Can Convert String in K Moves", "question__title_slug": "can-convert-string-in-k-moves", "question__hide": false, - "total_acs": 7471, - "total_submitted": 22076, - "total_column_articles": 118, + "total_acs": 7528, + "total_submitted": 22180, + "total_column_articles": 119, "frontend_question_id": "1540", "is_new_question": false }, @@ -41256,9 +41718,9 @@ "question__title": "Kth Missing Positive Number", "question__title_slug": "kth-missing-positive-number", "question__hide": false, - "total_acs": 47417, - "total_submitted": 87374, - "total_column_articles": 624, + "total_acs": 47806, + "total_submitted": 87990, + "total_column_articles": 625, "frontend_question_id": "1539", "is_new_question": false }, @@ -41277,9 +41739,9 @@ "question__title": "Find a Value of a Mysterious Function Closest to Target", "question__title_slug": "find-a-value-of-a-mysterious-function-closest-to-target", "question__hide": false, - "total_acs": 4966, - "total_submitted": 11033, - "total_column_articles": 83, + "total_acs": 5178, + "total_submitted": 11327, + "total_column_articles": 85, "frontend_question_id": "1521", "is_new_question": false }, @@ -41298,8 +41760,8 @@ "question__title": "Maximum Number of Non-Overlapping Substrings", "question__title_slug": "maximum-number-of-non-overlapping-substrings", "question__hide": false, - "total_acs": 3736, - "total_submitted": 10299, + "total_acs": 3754, + "total_submitted": 10340, "total_column_articles": 91, "frontend_question_id": "1520", "is_new_question": false @@ -41319,9 +41781,9 @@ "question__title": "Number of Nodes in the Sub-Tree With the Same Label", "question__title_slug": "number-of-nodes-in-the-sub-tree-with-the-same-label", "question__hide": false, - "total_acs": 8215, - "total_submitted": 23988, - "total_column_articles": 155, + "total_acs": 8268, + "total_submitted": 24086, + "total_column_articles": 157, "frontend_question_id": "1519", "is_new_question": false }, @@ -41340,9 +41802,9 @@ "question__title": "Water Bottles", "question__title_slug": "water-bottles", "question__hide": false, - "total_acs": 66927, - "total_submitted": 96025, - "total_column_articles": 946, + "total_acs": 67063, + "total_submitted": 96202, + "total_column_articles": 947, "frontend_question_id": "1518", "is_new_question": false }, @@ -41361,9 +41823,9 @@ "question__title": "Countries You Can Safely Invest In", "question__title_slug": "countries-you-can-safely-invest-in", "question__hide": false, - "total_acs": 16482, - "total_submitted": 29787, - "total_column_articles": 177, + "total_acs": 16668, + "total_submitted": 30128, + "total_column_articles": 179, "frontend_question_id": "1501", "is_new_question": false }, @@ -41382,8 +41844,8 @@ "question__title": "Design a File Sharing System", "question__title_slug": "design-a-file-sharing-system", "question__hide": false, - "total_acs": 2102, - "total_submitted": 6996, + "total_acs": 2111, + "total_submitted": 7021, "total_column_articles": 55, "frontend_question_id": "1500", "is_new_question": false @@ -41403,9 +41865,9 @@ "question__title": "Friendly Movies Streamed Last Month", "question__title_slug": "friendly-movies-streamed-last-month", "question__hide": false, - "total_acs": 10186, - "total_submitted": 19336, - "total_column_articles": 63, + "total_acs": 10331, + "total_submitted": 19632, + "total_column_articles": 64, "frontend_question_id": "1495", "is_new_question": false }, @@ -41424,9 +41886,9 @@ "question__title": "Best Position for a Service Centre", "question__title_slug": "best-position-for-a-service-centre", "question__hide": false, - "total_acs": 4932, - "total_submitted": 14039, - "total_column_articles": 75, + "total_acs": 4949, + "total_submitted": 14103, + "total_column_articles": 74, "frontend_question_id": "1515", "is_new_question": false }, @@ -41445,9 +41907,9 @@ "question__title": "String Compression II", "question__title_slug": "string-compression-ii", "question__hide": false, - "total_acs": 3387, - "total_submitted": 8623, - "total_column_articles": 51, + "total_acs": 3434, + "total_submitted": 8703, + "total_column_articles": 52, "frontend_question_id": "1531", "is_new_question": false }, @@ -41466,9 +41928,9 @@ "question__title": "Number of Substrings With Only 1s", "question__title_slug": "number-of-substrings-with-only-1s", "question__hide": false, - "total_acs": 15885, - "total_submitted": 39426, - "total_column_articles": 221, + "total_acs": 15960, + "total_submitted": 39561, + "total_column_articles": 222, "frontend_question_id": "1513", "is_new_question": false }, @@ -41487,9 +41949,9 @@ "question__title": "Number of Good Pairs", "question__title_slug": "number-of-good-pairs", "question__hide": false, - "total_acs": 95023, - "total_submitted": 114187, - "total_column_articles": 1088, + "total_acs": 96223, + "total_submitted": 115637, + "total_column_articles": 1097, "frontend_question_id": "1512", "is_new_question": false }, @@ -41508,8 +41970,8 @@ "question__title": "Clone N-ary Tree", "question__title_slug": "clone-n-ary-tree", "question__hide": false, - "total_acs": 2998, - "total_submitted": 3625, + "total_acs": 3076, + "total_submitted": 3725, "total_column_articles": 57, "frontend_question_id": "1490", "is_new_question": false @@ -41529,8 +41991,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": 5861, - "total_submitted": 8977, + "total_acs": 5912, + "total_submitted": 9051, "total_column_articles": 101, "frontend_question_id": "1526", "is_new_question": false @@ -41550,9 +42012,9 @@ "question__title": "Number of Good Ways to Split a String", "question__title_slug": "number-of-good-ways-to-split-a-string", "question__hide": false, - "total_acs": 9859, - "total_submitted": 14789, - "total_column_articles": 177, + "total_acs": 9932, + "total_submitted": 14891, + "total_column_articles": 179, "frontend_question_id": "1525", "is_new_question": false }, @@ -41571,9 +42033,9 @@ "question__title": "Number of Sub-arrays With Odd Sum", "question__title_slug": "number-of-sub-arrays-with-odd-sum", "question__hide": false, - "total_acs": 11437, - "total_submitted": 24152, - "total_column_articles": 195, + "total_acs": 11728, + "total_submitted": 24613, + "total_column_articles": 202, "frontend_question_id": "1524", "is_new_question": false }, @@ -41592,9 +42054,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": 59143, - "total_submitted": 118385, - "total_column_articles": 820, + "total_acs": 59414, + "total_submitted": 118843, + "total_column_articles": 822, "frontend_question_id": "1523", "is_new_question": false }, @@ -41613,9 +42075,9 @@ "question__title": "Minimum Possible Integer After at Most K Adjacent Swaps On Digits", "question__title_slug": "minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits", "question__hide": false, - "total_acs": 5161, - "total_submitted": 12555, - "total_column_articles": 104, + "total_acs": 5190, + "total_submitted": 12612, + "total_column_articles": 105, "frontend_question_id": "1505", "is_new_question": false }, @@ -41634,8 +42096,8 @@ "question__title": "Count Submatrices With All Ones", "question__title_slug": "count-submatrices-with-all-ones", "question__hide": false, - "total_acs": 13835, - "total_submitted": 21858, + "total_acs": 13969, + "total_submitted": 22068, "total_column_articles": 192, "frontend_question_id": "1504", "is_new_question": false @@ -41655,8 +42117,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": 13426, - "total_submitted": 24108, + "total_acs": 13479, + "total_submitted": 24181, "total_column_articles": 138, "frontend_question_id": "1503", "is_new_question": false @@ -41676,9 +42138,9 @@ "question__title": "Can Make Arithmetic Progression From Sequence", "question__title_slug": "can-make-arithmetic-progression-from-sequence", "question__hide": false, - "total_acs": 59096, - "total_submitted": 86620, - "total_column_articles": 698, + "total_acs": 59453, + "total_submitted": 87109, + "total_column_articles": 703, "frontend_question_id": "1502", "is_new_question": false }, @@ -41697,9 +42159,9 @@ "question__title": "Group Sold Products By The Date", "question__title_slug": "group-sold-products-by-the-date", "question__hide": false, - "total_acs": 70284, - "total_submitted": 101809, - "total_column_articles": 383, + "total_acs": 71232, + "total_submitted": 103095, + "total_column_articles": 389, "frontend_question_id": "1484", "is_new_question": false }, @@ -41718,8 +42180,8 @@ "question__title": "Clone Binary Tree With Random Pointer", "question__title_slug": "clone-binary-tree-with-random-pointer", "question__hide": false, - "total_acs": 1730, - "total_submitted": 2207, + "total_acs": 1742, + "total_submitted": 2222, "total_column_articles": 41, "frontend_question_id": "1485", "is_new_question": false @@ -41739,8 +42201,8 @@ "question__title": "Sales by Day of the Week", "question__title_slug": "sales-by-day-of-the-week", "question__hide": false, - "total_acs": 4507, - "total_submitted": 7911, + "total_acs": 4535, + "total_submitted": 7957, "total_column_articles": 81, "frontend_question_id": "1479", "is_new_question": false @@ -41760,9 +42222,9 @@ "question__title": "Max Value of Equation", "question__title_slug": "max-value-of-equation", "question__hide": false, - "total_acs": 17749, - "total_submitted": 36798, - "total_column_articles": 177, + "total_acs": 17829, + "total_submitted": 36952, + "total_column_articles": 178, "frontend_question_id": "1499", "is_new_question": false }, @@ -41781,9 +42243,9 @@ "question__title": "Number of Subsequences That Satisfy the Given Sum Condition", "question__title_slug": "number-of-subsequences-that-satisfy-the-given-sum-condition", "question__hide": false, - "total_acs": 12144, - "total_submitted": 31325, - "total_column_articles": 141, + "total_acs": 12220, + "total_submitted": 31508, + "total_column_articles": 142, "frontend_question_id": "1498", "is_new_question": false }, @@ -41802,9 +42264,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": 14342, - "total_submitted": 35649, - "total_column_articles": 166, + "total_acs": 14406, + "total_submitted": 35824, + "total_column_articles": 167, "frontend_question_id": "1497", "is_new_question": false }, @@ -41823,8 +42285,8 @@ "question__title": "Path Crossing", "question__title_slug": "path-crossing", "question__hide": false, - "total_acs": 18806, - "total_submitted": 34703, + "total_acs": 18893, + "total_submitted": 34822, "total_column_articles": 277, "frontend_question_id": "1496", "is_new_question": false @@ -41844,9 +42306,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": 5097, - "total_submitted": 7250, - "total_column_articles": 124, + "total_acs": 5180, + "total_submitted": 7359, + "total_column_articles": 126, "frontend_question_id": "1474", "is_new_question": false }, @@ -41865,9 +42327,9 @@ "question__title": "Stone Game IV", "question__title_slug": "stone-game-iv", "question__hide": false, - "total_acs": 9610, - "total_submitted": 15752, - "total_column_articles": 115, + "total_acs": 9691, + "total_submitted": 15887, + "total_column_articles": 117, "frontend_question_id": "1510", "is_new_question": false }, @@ -41886,9 +42348,9 @@ "question__title": "Minimum Difference Between Largest and Smallest Value in Three Moves", "question__title_slug": "minimum-difference-between-largest-and-smallest-value-in-three-moves", "question__hide": false, - "total_acs": 8969, - "total_submitted": 16134, - "total_column_articles": 144, + "total_acs": 9018, + "total_submitted": 16213, + "total_column_articles": 145, "frontend_question_id": "1509", "is_new_question": false }, @@ -41907,9 +42369,9 @@ "question__title": "Range Sum of Sorted Subarray Sums", "question__title_slug": "range-sum-of-sorted-subarray-sums", "question__hide": false, - "total_acs": 12482, - "total_submitted": 21510, - "total_column_articles": 128, + "total_acs": 12587, + "total_submitted": 21676, + "total_column_articles": 129, "frontend_question_id": "1508", "is_new_question": false }, @@ -41928,8 +42390,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": 14257, - "total_submitted": 21635, + "total_acs": 14312, + "total_submitted": 21720, "total_column_articles": 160, "frontend_question_id": "1489", "is_new_question": false @@ -41949,8 +42411,8 @@ "question__title": "Avoid Flood in The City", "question__title_slug": "avoid-flood-in-the-city", "question__hide": false, - "total_acs": 31639, - "total_submitted": 102779, + "total_acs": 31698, + "total_submitted": 102952, "total_column_articles": 301, "frontend_question_id": "1488", "is_new_question": false @@ -41970,8 +42432,8 @@ "question__title": "Making File Names Unique", "question__title_slug": "making-file-names-unique", "question__hide": false, - "total_acs": 36904, - "total_submitted": 88716, + "total_acs": 36961, + "total_submitted": 88840, "total_column_articles": 341, "frontend_question_id": "1487", "is_new_question": false @@ -41991,9 +42453,9 @@ "question__title": "XOR Operation in an Array", "question__title_slug": "xor-operation-in-an-array", "question__hide": false, - "total_acs": 99819, - "total_submitted": 118616, - "total_column_articles": 842, + "total_acs": 101081, + "total_submitted": 120148, + "total_column_articles": 848, "frontend_question_id": "1486", "is_new_question": false }, @@ -42012,8 +42474,8 @@ "question__title": "Find All The Lonely Nodes", "question__title_slug": "find-all-the-lonely-nodes", "question__hide": false, - "total_acs": 5489, - "total_submitted": 6689, + "total_acs": 5527, + "total_submitted": 6731, "total_column_articles": 143, "frontend_question_id": "1469", "is_new_question": false @@ -42033,9 +42495,9 @@ "question__title": "Calculate Salaries", "question__title_slug": "calculate-salaries", "question__hide": false, - "total_acs": 6396, - "total_submitted": 9230, - "total_column_articles": 77, + "total_acs": 6437, + "total_submitted": 9286, + "total_column_articles": 78, "frontend_question_id": "1468", "is_new_question": false }, @@ -42054,9 +42516,9 @@ "question__title": "Rectangles Area", "question__title_slug": "rectangles-area", "question__hide": false, - "total_acs": 7053, - "total_submitted": 11225, - "total_column_articles": 104, + "total_acs": 7093, + "total_submitted": 11279, + "total_column_articles": 105, "frontend_question_id": "1459", "is_new_question": false }, @@ -42075,9 +42537,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": 44850, - "total_submitted": 79168, - "total_column_articles": 534, + "total_acs": 45027, + "total_submitted": 79561, + "total_column_articles": 536, "frontend_question_id": "1482", "is_new_question": false }, @@ -42096,9 +42558,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": 21359, - "total_submitted": 46278, - "total_column_articles": 272, + "total_acs": 21426, + "total_submitted": 46374, + "total_column_articles": 273, "frontend_question_id": "1481", "is_new_question": false }, @@ -42117,9 +42579,9 @@ "question__title": "Running Sum of 1d Array", "question__title_slug": "running-sum-of-1d-array", "question__hide": false, - "total_acs": 344754, - "total_submitted": 451190, - "total_column_articles": 2676, + "total_acs": 345830, + "total_submitted": 452602, + "total_column_articles": 2688, "frontend_question_id": "1480", "is_new_question": false }, @@ -42138,8 +42600,8 @@ "question__title": "Parallel Courses II", "question__title_slug": "parallel-courses-ii", "question__hide": false, - "total_acs": 13121, - "total_submitted": 25458, + "total_acs": 13150, + "total_submitted": 25546, "total_column_articles": 111, "frontend_question_id": "1494", "is_new_question": false @@ -42159,9 +42621,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": 36266, - "total_submitted": 57437, - "total_column_articles": 471, + "total_acs": 37272, + "total_submitted": 58793, + "total_column_articles": 483, "frontend_question_id": "1493", "is_new_question": false }, @@ -42180,9 +42642,9 @@ "question__title": "The kth Factor of n", "question__title_slug": "the-kth-factor-of-n", "question__hide": false, - "total_acs": 20769, - "total_submitted": 33099, - "total_column_articles": 184, + "total_acs": 21117, + "total_submitted": 33536, + "total_column_articles": 187, "frontend_question_id": "1492", "is_new_question": false }, @@ -42201,9 +42663,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": 76711, - "total_submitted": 117906, - "total_column_articles": 850, + "total_acs": 77342, + "total_submitted": 118825, + "total_column_articles": 856, "frontend_question_id": "1491", "is_new_question": false }, @@ -42222,9 +42684,9 @@ "question__title": "Paint House III", "question__title_slug": "paint-house-iii", "question__hide": false, - "total_acs": 18468, - "total_submitted": 27974, - "total_column_articles": 201, + "total_acs": 18565, + "total_submitted": 28110, + "total_column_articles": 202, "frontend_question_id": "1473", "is_new_question": false }, @@ -42243,8 +42705,8 @@ "question__title": "Design Browser History", "question__title_slug": "design-browser-history", "question__hide": false, - "total_acs": 19983, - "total_submitted": 32275, + "total_acs": 20138, + "total_submitted": 32476, "total_column_articles": 290, "frontend_question_id": "1472", "is_new_question": false @@ -42264,9 +42726,9 @@ "question__title": "The k Strongest Values in an Array", "question__title_slug": "the-k-strongest-values-in-an-array", "question__hide": false, - "total_acs": 10891, - "total_submitted": 19399, - "total_column_articles": 152, + "total_acs": 10931, + "total_submitted": 19460, + "total_column_articles": 154, "frontend_question_id": "1471", "is_new_question": false }, @@ -42285,9 +42747,9 @@ "question__title": "Shuffle the Array", "question__title_slug": "shuffle-the-array", "question__hide": false, - "total_acs": 114595, - "total_submitted": 136908, - "total_column_articles": 1213, + "total_acs": 115431, + "total_submitted": 137902, + "total_column_articles": 1214, "frontend_question_id": "1470", "is_new_question": false }, @@ -42306,9 +42768,9 @@ "question__title": "Active Users", "question__title_slug": "active-users", "question__hide": false, - "total_acs": 12146, - "total_submitted": 31960, - "total_column_articles": 144, + "total_acs": 12215, + "total_submitted": 32162, + "total_column_articles": 145, "frontend_question_id": "1454", "is_new_question": false }, @@ -42327,9 +42789,9 @@ "question__title": "Apples & Oranges", "question__title_slug": "apples-oranges", "question__hide": false, - "total_acs": 16905, - "total_submitted": 20586, - "total_column_articles": 151, + "total_acs": 17142, + "total_submitted": 21140, + "total_column_articles": 153, "frontend_question_id": "1445", "is_new_question": false }, @@ -42348,9 +42810,9 @@ "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": 2990, - "total_submitted": 4887, - "total_column_articles": 74, + "total_acs": 3053, + "total_submitted": 4972, + "total_column_articles": 76, "frontend_question_id": "1467", "is_new_question": false }, @@ -42369,9 +42831,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": 35481, - "total_submitted": 58746, - "total_column_articles": 446, + "total_acs": 35788, + "total_submitted": 59215, + "total_column_articles": 448, "frontend_question_id": "1466", "is_new_question": false }, @@ -42390,9 +42852,9 @@ "question__title": "Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts", "question__title_slug": "maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts", "question__hide": false, - "total_acs": 30643, - "total_submitted": 71623, - "total_column_articles": 271, + "total_acs": 30681, + "total_submitted": 71701, + "total_column_articles": 273, "frontend_question_id": "1465", "is_new_question": false }, @@ -42411,9 +42873,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": 84345, - "total_submitted": 107967, - "total_column_articles": 923, + "total_acs": 84810, + "total_submitted": 108539, + "total_column_articles": 928, "frontend_question_id": "1464", "is_new_question": false }, @@ -42432,8 +42894,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": 10338, - "total_submitted": 32290, + "total_acs": 10436, + "total_submitted": 32487, "total_column_articles": 164, "frontend_question_id": "1477", "is_new_question": false @@ -42453,8 +42915,8 @@ "question__title": "Subrectangle Queries", "question__title_slug": "subrectangle-queries", "question__hide": false, - "total_acs": 17062, - "total_submitted": 19668, + "total_acs": 17126, + "total_submitted": 19746, "total_column_articles": 151, "frontend_question_id": "1476", "is_new_question": false @@ -42474,9 +42936,9 @@ "question__title": "Allocate Mailboxes", "question__title_slug": "allocate-mailboxes", "question__hide": false, - "total_acs": 6587, - "total_submitted": 10434, - "total_column_articles": 105, + "total_acs": 6647, + "total_submitted": 10524, + "total_column_articles": 106, "frontend_question_id": "1478", "is_new_question": false }, @@ -42495,9 +42957,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": 76300, - "total_submitted": 103352, - "total_column_articles": 926, + "total_acs": 76908, + "total_submitted": 104054, + "total_column_articles": 930, "frontend_question_id": "1475", "is_new_question": false }, @@ -42516,9 +42978,9 @@ "question__title": "Max Dot Product of Two Subsequences", "question__title_slug": "max-dot-product-of-two-subsequences", "question__hide": false, - "total_acs": 9767, - "total_submitted": 19958, - "total_column_articles": 144, + "total_acs": 9946, + "total_submitted": 20243, + "total_column_articles": 146, "frontend_question_id": "1458", "is_new_question": false }, @@ -42537,9 +42999,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": 29751, - "total_submitted": 43548, - "total_column_articles": 326, + "total_acs": 29863, + "total_submitted": 43718, + "total_column_articles": 328, "frontend_question_id": "1457", "is_new_question": false }, @@ -42558,9 +43020,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": 50386, - "total_submitted": 88028, - "total_column_articles": 504, + "total_acs": 51981, + "total_submitted": 90590, + "total_column_articles": 508, "frontend_question_id": "1456", "is_new_question": false }, @@ -42579,9 +43041,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": 44461, - "total_submitted": 68937, - "total_column_articles": 733, + "total_acs": 44617, + "total_submitted": 69187, + "total_column_articles": 734, "frontend_question_id": "1455", "is_new_question": false }, @@ -42600,8 +43062,8 @@ "question__title": "Evaluate Boolean Expression", "question__title_slug": "evaluate-boolean-expression", "question__hide": false, - "total_acs": 12284, - "total_submitted": 18259, + "total_acs": 12515, + "total_submitted": 18597, "total_column_articles": 105, "frontend_question_id": "1440", "is_new_question": false @@ -42621,8 +43083,8 @@ "question__title": "Create a Session Bar Chart", "question__title_slug": "create-a-session-bar-chart", "question__hide": false, - "total_acs": 8021, - "total_submitted": 12483, + "total_acs": 8061, + "total_submitted": 12538, "total_column_articles": 71, "frontend_question_id": "1435", "is_new_question": false @@ -42642,8 +43104,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": 2508, - "total_submitted": 6580, + "total_acs": 2530, + "total_submitted": 6633, "total_column_articles": 43, "frontend_question_id": "1453", "is_new_question": false @@ -42663,9 +43125,9 @@ "question__title": "People Whose List of Favorite Companies Is Not a Subset of Another List", "question__title_slug": "people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list", "question__hide": false, - "total_acs": 8696, - "total_submitted": 16900, - "total_column_articles": 121, + "total_acs": 8743, + "total_submitted": 16976, + "total_column_articles": 123, "frontend_question_id": "1452", "is_new_question": false }, @@ -42684,8 +43146,8 @@ "question__title": "Rearrange Words in a Sentence", "question__title_slug": "rearrange-words-in-a-sentence", "question__hide": false, - "total_acs": 15027, - "total_submitted": 27414, + "total_acs": 15074, + "total_submitted": 27475, "total_column_articles": 223, "frontend_question_id": "1451", "is_new_question": false @@ -42705,9 +43167,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": 64524, - "total_submitted": 78343, - "total_column_articles": 712, + "total_acs": 64720, + "total_submitted": 78557, + "total_column_articles": 714, "frontend_question_id": "1450", "is_new_question": false }, @@ -42726,8 +43188,8 @@ "question__title": "Cherry Pickup II", "question__title_slug": "cherry-pickup-ii", "question__hide": false, - "total_acs": 16889, - "total_submitted": 23618, + "total_acs": 17111, + "total_submitted": 23943, "total_column_articles": 206, "frontend_question_id": "1463", "is_new_question": false @@ -42747,9 +43209,9 @@ "question__title": "Course Schedule IV", "question__title_slug": "course-schedule-iv", "question__hide": false, - "total_acs": 32178, - "total_submitted": 62991, - "total_column_articles": 352, + "total_acs": 32343, + "total_submitted": 63324, + "total_column_articles": 353, "frontend_question_id": "1462", "is_new_question": false }, @@ -42768,8 +43230,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": 10885, - "total_submitted": 20613, + "total_acs": 10973, + "total_submitted": 20745, "total_column_articles": 141, "frontend_question_id": "1461", "is_new_question": false @@ -42789,9 +43251,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": 56937, - "total_submitted": 73755, - "total_column_articles": 783, + "total_acs": 57102, + "total_submitted": 73956, + "total_column_articles": 784, "frontend_question_id": "1460", "is_new_question": false }, @@ -42810,9 +43272,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": 18932, - "total_submitted": 30742, - "total_column_articles": 168, + "total_acs": 19007, + "total_submitted": 30853, + "total_column_articles": 169, "frontend_question_id": "1444", "is_new_question": false }, @@ -42831,8 +43293,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": 8993, - "total_submitted": 20443, + "total_acs": 9047, + "total_submitted": 20527, "total_column_articles": 210, "frontend_question_id": "1443", "is_new_question": false @@ -42852,9 +43314,9 @@ "question__title": "Count Triplets That Can Form Two Arrays of Equal XOR", "question__title_slug": "count-triplets-that-can-form-two-arrays-of-equal-xor", "question__hide": false, - "total_acs": 40433, - "total_submitted": 50915, - "total_column_articles": 427, + "total_acs": 40729, + "total_submitted": 51249, + "total_column_articles": 428, "frontend_question_id": "1442", "is_new_question": false }, @@ -42873,9 +43335,9 @@ "question__title": "Build an Array With Stack Operations", "question__title_slug": "build-an-array-with-stack-operations", "question__hide": false, - "total_acs": 51150, - "total_submitted": 71303, - "total_column_articles": 916, + "total_acs": 51448, + "total_submitted": 71658, + "total_column_articles": 917, "frontend_question_id": "1441", "is_new_question": false }, @@ -42894,8 +43356,8 @@ "question__title": "NPV Queries", "question__title_slug": "npv-queries", "question__hide": false, - "total_acs": 6940, - "total_submitted": 9663, + "total_acs": 6972, + "total_submitted": 9723, "total_column_articles": 54, "frontend_question_id": "1421", "is_new_question": false @@ -42915,8 +43377,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": 17494, - "total_submitted": 26420, + "total_acs": 17580, + "total_submitted": 26534, "total_column_articles": 142, "frontend_question_id": "1439", "is_new_question": false @@ -42936,9 +43398,9 @@ "question__title": "Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit", "question__title_slug": "longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit", "question__hide": false, - "total_acs": 52122, - "total_submitted": 102826, - "total_column_articles": 631, + "total_acs": 52665, + "total_submitted": 103660, + "total_column_articles": 635, "frontend_question_id": "1438", "is_new_question": false }, @@ -42957,9 +43419,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": 19261, - "total_submitted": 34635, - "total_column_articles": 284, + "total_acs": 19369, + "total_submitted": 34812, + "total_column_articles": 286, "frontend_question_id": "1437", "is_new_question": false }, @@ -42978,9 +43440,9 @@ "question__title": "Destination City", "question__title_slug": "destination-city", "question__hide": false, - "total_acs": 57000, - "total_submitted": 69837, - "total_column_articles": 805, + "total_acs": 57201, + "total_submitted": 70084, + "total_column_articles": 806, "frontend_question_id": "1436", "is_new_question": false }, @@ -42999,9 +43461,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": 9390, - "total_submitted": 18540, - "total_column_articles": 155, + "total_acs": 9553, + "total_submitted": 18861, + "total_column_articles": 157, "frontend_question_id": "1412", "is_new_question": false }, @@ -43020,8 +43482,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": 20637, - "total_submitted": 33167, + "total_acs": 20787, + "total_submitted": 33398, "total_column_articles": 247, "frontend_question_id": "1449", "is_new_question": false @@ -43041,9 +43503,9 @@ "question__title": "Count Good Nodes in Binary Tree", "question__title_slug": "count-good-nodes-in-binary-tree", "question__hide": false, - "total_acs": 54120, - "total_submitted": 73407, - "total_column_articles": 594, + "total_acs": 54700, + "total_submitted": 74234, + "total_column_articles": 598, "frontend_question_id": "1448", "is_new_question": false }, @@ -43062,8 +43524,8 @@ "question__title": "Simplified Fractions", "question__title_slug": "simplified-fractions", "question__hide": false, - "total_acs": 43107, - "total_submitted": 63740, + "total_acs": 43198, + "total_submitted": 63861, "total_column_articles": 538, "frontend_question_id": "1447", "is_new_question": false @@ -43083,9 +43545,9 @@ "question__title": "Consecutive Characters", "question__title_slug": "consecutive-characters", "question__hide": false, - "total_acs": 65054, - "total_submitted": 108285, - "total_column_articles": 842, + "total_acs": 65345, + "total_submitted": 108750, + "total_column_articles": 843, "frontend_question_id": "1446", "is_new_question": false }, @@ -43104,9 +43566,9 @@ "question__title": "Top Travellers", "question__title_slug": "top-travellers", "question__hide": false, - "total_acs": 46847, - "total_submitted": 83445, - "total_column_articles": 328, + "total_acs": 47513, + "total_submitted": 84675, + "total_column_articles": 334, "frontend_question_id": "1407", "is_new_question": false }, @@ -43125,9 +43587,9 @@ "question__title": "Diagonal Traverse II", "question__title_slug": "diagonal-traverse-ii", "question__hide": false, - "total_acs": 11979, - "total_submitted": 27822, - "total_column_articles": 228, + "total_acs": 12072, + "total_submitted": 27990, + "total_column_articles": 231, "frontend_question_id": "1424", "is_new_question": false }, @@ -43146,9 +43608,9 @@ "question__title": "Maximum Points You Can Obtain from Cards", "question__title_slug": "maximum-points-you-can-obtain-from-cards", "question__hide": false, - "total_acs": 71119, - "total_submitted": 124367, - "total_column_articles": 849, + "total_acs": 71612, + "total_submitted": 125047, + "total_column_articles": 855, "frontend_question_id": "1423", "is_new_question": false }, @@ -43167,9 +43629,9 @@ "question__title": "Maximum Score After Splitting a String", "question__title_slug": "maximum-score-after-splitting-a-string", "question__hide": false, - "total_acs": 50108, - "total_submitted": 87990, - "total_column_articles": 751, + "total_acs": 50715, + "total_submitted": 88984, + "total_column_articles": 757, "frontend_question_id": "1422", "is_new_question": false }, @@ -43188,9 +43650,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": 18955, - "total_submitted": 28251, - "total_column_articles": 185, + "total_acs": 19312, + "total_submitted": 28893, + "total_column_articles": 187, "frontend_question_id": "1398", "is_new_question": false }, @@ -43209,8 +43671,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": 4355, - "total_submitted": 6910, + "total_acs": 4417, + "total_submitted": 7008, "total_column_articles": 74, "frontend_question_id": "1420", "is_new_question": false @@ -43230,9 +43692,9 @@ "question__title": "Minimum Number of Frogs Croaking", "question__title_slug": "minimum-number-of-frogs-croaking", "question__hide": false, - "total_acs": 35229, - "total_submitted": 70253, - "total_column_articles": 455, + "total_acs": 35413, + "total_submitted": 70606, + "total_column_articles": 456, "frontend_question_id": "1419", "is_new_question": false }, @@ -43251,8 +43713,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": 29765, - "total_submitted": 40614, + "total_acs": 29817, + "total_submitted": 40687, "total_column_articles": 462, "frontend_question_id": "1418", "is_new_question": false @@ -43272,8 +43734,8 @@ "question__title": "Reformat The String", "question__title_slug": "reformat-the-string", "question__hide": false, - "total_acs": 48770, - "total_submitted": 88732, + "total_acs": 48871, + "total_submitted": 88904, "total_column_articles": 640, "frontend_question_id": "1417", "is_new_question": false @@ -43293,9 +43755,9 @@ "question__title": "Number of Ways to Wear Different Hats to Each Other", "question__title_slug": "number-of-ways-to-wear-different-hats-to-each-other", "question__hide": false, - "total_acs": 5006, - "total_submitted": 9594, - "total_column_articles": 78, + "total_acs": 5096, + "total_submitted": 9763, + "total_column_articles": 80, "frontend_question_id": "1434", "is_new_question": false }, @@ -43314,9 +43776,9 @@ "question__title": "Check If a String Can Break Another String", "question__title_slug": "check-if-a-string-can-break-another-string", "question__hide": false, - "total_acs": 9442, - "total_submitted": 14469, - "total_column_articles": 159, + "total_acs": 9484, + "total_submitted": 14527, + "total_column_articles": 160, "frontend_question_id": "1433", "is_new_question": false }, @@ -43335,9 +43797,9 @@ "question__title": "Max Difference You Can Get From Changing an Integer", "question__title_slug": "max-difference-you-can-get-from-changing-an-integer", "question__hide": false, - "total_acs": 7261, - "total_submitted": 18112, - "total_column_articles": 149, + "total_acs": 7312, + "total_submitted": 18219, + "total_column_articles": 150, "frontend_question_id": "1432", "is_new_question": false }, @@ -43356,9 +43818,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": 121654, - "total_submitted": 143546, - "total_column_articles": 1335, + "total_acs": 122608, + "total_submitted": 144612, + "total_column_articles": 1338, "frontend_question_id": "1431", "is_new_question": false }, @@ -43377,8 +43839,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": 10681, - "total_submitted": 18390, + "total_acs": 10718, + "total_submitted": 18432, "total_column_articles": 172, "frontend_question_id": "1411", "is_new_question": false @@ -43398,9 +43860,9 @@ "question__title": "HTML Entity Parser", "question__title_slug": "html-entity-parser", "question__hide": false, - "total_acs": 30391, - "total_submitted": 57844, - "total_column_articles": 327, + "total_acs": 30471, + "total_submitted": 57970, + "total_column_articles": 329, "frontend_question_id": "1410", "is_new_question": false }, @@ -43419,9 +43881,9 @@ "question__title": "Queries on a Permutation With Key", "question__title_slug": "queries-on-a-permutation-with-key", "question__hide": false, - "total_acs": 12338, - "total_submitted": 15113, - "total_column_articles": 209, + "total_acs": 12450, + "total_submitted": 15233, + "total_column_articles": 210, "frontend_question_id": "1409", "is_new_question": false }, @@ -43440,9 +43902,9 @@ "question__title": "String Matching in an Array", "question__title_slug": "string-matching-in-an-array", "question__hide": false, - "total_acs": 48782, - "total_submitted": 75809, - "total_column_articles": 580, + "total_acs": 48947, + "total_submitted": 76043, + "total_column_articles": 582, "frontend_question_id": "1408", "is_new_question": false }, @@ -43461,9 +43923,9 @@ "question__title": "Capital Gain/Loss", "question__title_slug": "capital-gainloss", "question__hide": false, - "total_acs": 36421, - "total_submitted": 43504, - "total_column_articles": 311, + "total_acs": 36749, + "total_submitted": 43877, + "total_column_articles": 313, "frontend_question_id": "1393", "is_new_question": false }, @@ -43482,8 +43944,8 @@ "question__title": "Stone Game III", "question__title_slug": "stone-game-iii", "question__hide": false, - "total_acs": 9165, - "total_submitted": 15600, + "total_acs": 9240, + "total_submitted": 15757, "total_column_articles": 137, "frontend_question_id": "1406", "is_new_question": false @@ -43503,9 +43965,9 @@ "question__title": "Number of Steps to Reduce a Number in Binary Representation to One", "question__title_slug": "number-of-steps-to-reduce-a-number-in-binary-representation-to-one", "question__hide": false, - "total_acs": 10820, - "total_submitted": 21069, - "total_column_articles": 211, + "total_acs": 11031, + "total_submitted": 21333, + "total_column_articles": 212, "frontend_question_id": "1404", "is_new_question": false }, @@ -43524,9 +43986,9 @@ "question__title": "Minimum Subsequence in Non-Increasing Order", "question__title_slug": "minimum-subsequence-in-non-increasing-order", "question__hide": false, - "total_acs": 59252, - "total_submitted": 80843, - "total_column_articles": 780, + "total_acs": 59408, + "total_submitted": 81044, + "total_column_articles": 781, "frontend_question_id": "1403", "is_new_question": false }, @@ -43545,9 +44007,9 @@ "question__title": "Total Sales Amount by Year", "question__title_slug": "total-sales-amount-by-year", "question__hide": false, - "total_acs": 5637, - "total_submitted": 9850, - "total_column_articles": 116, + "total_acs": 5665, + "total_submitted": 9916, + "total_column_articles": 118, "frontend_question_id": "1384", "is_new_question": false }, @@ -43566,9 +44028,9 @@ "question__title": "Restore The Array", "question__title_slug": "restore-the-array", "question__hide": false, - "total_acs": 5891, - "total_submitted": 13909, - "total_column_articles": 93, + "total_acs": 6019, + "total_submitted": 14203, + "total_column_articles": 94, "frontend_question_id": "1416", "is_new_question": false }, @@ -43587,8 +44049,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": 9930, - "total_submitted": 14398, + "total_acs": 9989, + "total_submitted": 14484, "total_column_articles": 252, "frontend_question_id": "1415", "is_new_question": false @@ -43608,9 +44070,9 @@ "question__title": "Find the Minimum Number of Fibonacci Numbers Whose Sum Is K", "question__title_slug": "find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k", "question__hide": false, - "total_acs": 31620, - "total_submitted": 44918, - "total_column_articles": 459, + "total_acs": 31697, + "total_submitted": 45039, + "total_column_articles": 460, "frontend_question_id": "1414", "is_new_question": false }, @@ -43629,9 +44091,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": 50205, - "total_submitted": 68692, - "total_column_articles": 735, + "total_acs": 50357, + "total_submitted": 68866, + "total_column_articles": 737, "frontend_question_id": "1413", "is_new_question": false }, @@ -43650,8 +44112,8 @@ "question__title": "Find All Good Strings", "question__title_slug": "find-all-good-strings", "question__hide": false, - "total_acs": 2858, - "total_submitted": 6334, + "total_acs": 2899, + "total_submitted": 6418, "total_column_articles": 76, "frontend_question_id": "1397", "is_new_question": false @@ -43671,8 +44133,8 @@ "question__title": "Design Underground System", "question__title_slug": "design-underground-system", "question__hide": false, - "total_acs": 23444, - "total_submitted": 55154, + "total_acs": 23522, + "total_submitted": 55290, "total_column_articles": 285, "frontend_question_id": "1396", "is_new_question": false @@ -43692,9 +44154,9 @@ "question__title": "Count Number of Teams", "question__title_slug": "count-number-of-teams", "question__hide": false, - "total_acs": 21524, - "total_submitted": 30456, - "total_column_articles": 307, + "total_acs": 21655, + "total_submitted": 30665, + "total_column_articles": 308, "frontend_question_id": "1395", "is_new_question": false }, @@ -43713,9 +44175,9 @@ "question__title": "Find Lucky Integer in an Array", "question__title_slug": "find-lucky-integer-in-an-array", "question__hide": false, - "total_acs": 30303, - "total_submitted": 45444, - "total_column_articles": 467, + "total_acs": 30525, + "total_submitted": 45743, + "total_column_articles": 468, "frontend_question_id": "1394", "is_new_question": false }, @@ -43734,9 +44196,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": 61860, - "total_submitted": 74955, - "total_column_articles": 192, + "total_acs": 65094, + "total_submitted": 78856, + "total_column_articles": 201, "frontend_question_id": "1378", "is_new_question": false }, @@ -43755,9 +44217,9 @@ "question__title": "Longest Happy Prefix", "question__title_slug": "longest-happy-prefix", "question__hide": false, - "total_acs": 15755, - "total_submitted": 34889, - "total_column_articles": 244, + "total_acs": 15814, + "total_submitted": 34997, + "total_column_articles": 245, "frontend_question_id": "1392", "is_new_question": false }, @@ -43776,9 +44238,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": 9828, - "total_submitted": 23022, - "total_column_articles": 280, + "total_acs": 9949, + "total_submitted": 23225, + "total_column_articles": 281, "frontend_question_id": "1391", "is_new_question": false }, @@ -43797,9 +44259,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": 38063, - "total_submitted": 46009, - "total_column_articles": 608, + "total_acs": 38218, + "total_submitted": 46206, + "total_column_articles": 610, "frontend_question_id": "1389", "is_new_question": false }, @@ -43818,9 +44280,9 @@ "question__title": "Get the Second Most Recent Activity", "question__title_slug": "get-the-second-most-recent-activity", "question__hide": false, - "total_acs": 7433, - "total_submitted": 12047, - "total_column_articles": 94, + "total_acs": 7480, + "total_submitted": 12122, + "total_column_articles": 96, "frontend_question_id": "1369", "is_new_question": false }, @@ -43839,8 +44301,8 @@ "question__title": "Reducing Dishes", "question__title_slug": "reducing-dishes", "question__hide": false, - "total_acs": 33524, - "total_submitted": 42145, + "total_acs": 33623, + "total_submitted": 42275, "total_column_articles": 452, "frontend_question_id": "1402", "is_new_question": false @@ -43860,8 +44322,8 @@ "question__title": "Construct K Palindrome Strings", "question__title_slug": "construct-k-palindrome-strings", "question__hide": false, - "total_acs": 10898, - "total_submitted": 17686, + "total_acs": 10950, + "total_submitted": 17783, "total_column_articles": 168, "frontend_question_id": "1400", "is_new_question": false @@ -43881,8 +44343,8 @@ "question__title": "Circle and Rectangle Overlapping", "question__title_slug": "circle-and-rectangle-overlapping", "question__hide": false, - "total_acs": 18973, - "total_submitted": 36704, + "total_acs": 19035, + "total_submitted": 36822, "total_column_articles": 256, "frontend_question_id": "1401", "is_new_question": false @@ -43902,9 +44364,9 @@ "question__title": "Count Largest Group", "question__title_slug": "count-largest-group", "question__hide": false, - "total_acs": 15900, - "total_submitted": 23877, - "total_column_articles": 229, + "total_acs": 15991, + "total_submitted": 23987, + "total_column_articles": 228, "frontend_question_id": "1399", "is_new_question": false }, @@ -43923,8 +44385,8 @@ "question__title": "Maximum Performance of a Team", "question__title_slug": "maximum-performance-of-a-team", "question__hide": false, - "total_acs": 7740, - "total_submitted": 21503, + "total_acs": 7786, + "total_submitted": 21610, "total_column_articles": 140, "frontend_question_id": "1383", "is_new_question": false @@ -43944,8 +44406,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": 37623, - "total_submitted": 43992, + "total_acs": 37857, + "total_submitted": 44277, "total_column_articles": 347, "frontend_question_id": "1379", "is_new_question": false @@ -43965,9 +44427,9 @@ "question__title": "Design a Stack With Increment Operation", "question__title_slug": "design-a-stack-with-increment-operation", "question__hide": false, - "total_acs": 19737, - "total_submitted": 27311, - "total_column_articles": 238, + "total_acs": 19854, + "total_submitted": 27465, + "total_column_articles": 239, "frontend_question_id": "1381", "is_new_question": false }, @@ -43986,9 +44448,9 @@ "question__title": "Lucky Numbers in a Matrix", "question__title_slug": "lucky-numbers-in-a-matrix", "question__hide": false, - "total_acs": 59358, - "total_submitted": 78180, - "total_column_articles": 781, + "total_acs": 59542, + "total_submitted": 78436, + "total_column_articles": 784, "frontend_question_id": "1380", "is_new_question": false }, @@ -44007,9 +44469,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": 6957, - "total_submitted": 10205, - "total_column_articles": 101, + "total_acs": 7010, + "total_submitted": 10303, + "total_column_articles": 102, "frontend_question_id": "1364", "is_new_question": false }, @@ -44028,9 +44490,9 @@ "question__title": "Activity Participants", "question__title_slug": "activity-participants", "question__hide": false, - "total_acs": 8266, - "total_submitted": 12543, - "total_column_articles": 97, + "total_acs": 8318, + "total_submitted": 12645, + "total_column_articles": 98, "frontend_question_id": "1355", "is_new_question": false }, @@ -44049,8 +44511,8 @@ "question__title": "Frog Position After T Seconds", "question__title_slug": "frog-position-after-t-seconds", "question__hide": false, - "total_acs": 20012, - "total_submitted": 47296, + "total_acs": 20062, + "total_submitted": 47405, "total_column_articles": 281, "frontend_question_id": "1377", "is_new_question": false @@ -44070,9 +44532,9 @@ "question__title": "Time Needed to Inform All Employees", "question__title_slug": "time-needed-to-inform-all-employees", "question__hide": false, - "total_acs": 35574, - "total_submitted": 59608, - "total_column_articles": 446, + "total_acs": 35736, + "total_submitted": 59877, + "total_column_articles": 448, "frontend_question_id": "1376", "is_new_question": false }, @@ -44091,8 +44553,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": 29071, - "total_submitted": 42688, + "total_acs": 29108, + "total_submitted": 42745, "total_column_articles": 436, "frontend_question_id": "1375", "is_new_question": false @@ -44112,8 +44574,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": 55889, - "total_submitted": 71866, + "total_acs": 56028, + "total_submitted": 72020, "total_column_articles": 565, "frontend_question_id": "1374", "is_new_question": false @@ -44133,8 +44595,8 @@ "question__title": "Pizza With 3n Slices", "question__title_slug": "pizza-with-3n-slices", "question__hide": false, - "total_acs": 19348, - "total_submitted": 30072, + "total_acs": 19381, + "total_submitted": 30120, "total_column_articles": 122, "frontend_question_id": "1388", "is_new_question": false @@ -44154,9 +44616,9 @@ "question__title": "Sort Integers by The Power Value", "question__title_slug": "sort-integers-by-the-power-value", "question__hide": false, - "total_acs": 16908, - "total_submitted": 24344, - "total_column_articles": 288, + "total_acs": 16991, + "total_submitted": 24456, + "total_column_articles": 289, "frontend_question_id": "1387", "is_new_question": false }, @@ -44175,9 +44637,9 @@ "question__title": "Cinema Seat Allocation", "question__title_slug": "cinema-seat-allocation", "question__hide": false, - "total_acs": 11172, - "total_submitted": 30831, - "total_column_articles": 186, + "total_acs": 11217, + "total_submitted": 30913, + "total_column_articles": 187, "frontend_question_id": "1386", "is_new_question": false }, @@ -44196,9 +44658,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": 43445, - "total_submitted": 67049, - "total_column_articles": 543, + "total_acs": 43737, + "total_submitted": 67426, + "total_column_articles": 545, "frontend_question_id": "1385", "is_new_question": false }, @@ -44217,8 +44679,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": 9190, - "total_submitted": 14959, + "total_acs": 9289, + "total_submitted": 15092, "total_column_articles": 165, "frontend_question_id": "1368", "is_new_question": false @@ -44238,8 +44700,8 @@ "question__title": "Linked List in Binary Tree", "question__title_slug": "linked-list-in-binary-tree", "question__hide": false, - "total_acs": 27563, - "total_submitted": 62035, + "total_acs": 27695, + "total_submitted": 62310, "total_column_articles": 372, "frontend_question_id": "1367", "is_new_question": false @@ -44259,9 +44721,9 @@ "question__title": "Rank Teams by Votes", "question__title_slug": "rank-teams-by-votes", "question__hide": false, - "total_acs": 14024, - "total_submitted": 27014, - "total_column_articles": 225, + "total_acs": 14103, + "total_submitted": 27128, + "total_column_articles": 227, "frontend_question_id": "1366", "is_new_question": false }, @@ -44280,9 +44742,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": 126354, - "total_submitted": 153621, - "total_column_articles": 1375, + "total_acs": 127046, + "total_submitted": 154423, + "total_column_articles": 1378, "frontend_question_id": "1365", "is_new_question": false }, @@ -44301,8 +44763,8 @@ "question__title": "Students With Invalid Departments", "question__title_slug": "students-with-invalid-departments", "question__hide": false, - "total_acs": 15625, - "total_submitted": 18493, + "total_acs": 15768, + "total_submitted": 18656, "total_column_articles": 115, "frontend_question_id": "1350", "is_new_question": false @@ -44322,9 +44784,9 @@ "question__title": "Movie Rating", "question__title_slug": "movie-rating", "question__hide": false, - "total_acs": 23351, - "total_submitted": 63855, - "total_column_articles": 258, + "total_acs": 24343, + "total_submitted": 66640, + "total_column_articles": 265, "frontend_question_id": "1341", "is_new_question": false }, @@ -44343,8 +44805,8 @@ "question__title": "Construct Target Array With Multiple Sums", "question__title_slug": "construct-target-array-with-multiple-sums", "question__hide": false, - "total_acs": 4740, - "total_submitted": 16230, + "total_acs": 4771, + "total_submitted": 16323, "total_column_articles": 101, "frontend_question_id": "1354", "is_new_question": false @@ -44364,9 +44826,9 @@ "question__title": "Maximum Number of Events That Can Be Attended", "question__title_slug": "maximum-number-of-events-that-can-be-attended", "question__hide": false, - "total_acs": 20475, - "total_submitted": 68742, - "total_column_articles": 228, + "total_acs": 20589, + "total_submitted": 69063, + "total_column_articles": 229, "frontend_question_id": "1353", "is_new_question": false }, @@ -44385,8 +44847,8 @@ "question__title": "Product of the Last K Numbers", "question__title_slug": "product-of-the-last-k-numbers", "question__hide": false, - "total_acs": 14425, - "total_submitted": 29331, + "total_acs": 14542, + "total_submitted": 29498, "total_column_articles": 139, "frontend_question_id": "1352", "is_new_question": false @@ -44406,9 +44868,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": 60031, - "total_submitted": 80586, - "total_column_articles": 865, + "total_acs": 60395, + "total_submitted": 81013, + "total_column_articles": 866, "frontend_question_id": "1351", "is_new_question": false }, @@ -44427,8 +44889,8 @@ "question__title": "Maximum Sum BST in Binary Tree", "question__title_slug": "maximum-sum-bst-in-binary-tree", "question__hide": false, - "total_acs": 31625, - "total_submitted": 65595, + "total_acs": 31833, + "total_submitted": 66036, "total_column_articles": 421, "frontend_question_id": "1373", "is_new_question": false @@ -44448,9 +44910,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": 26841, - "total_submitted": 47441, - "total_column_articles": 354, + "total_acs": 27269, + "total_submitted": 48071, + "total_column_articles": 358, "frontend_question_id": "1372", "is_new_question": false }, @@ -44469,9 +44931,9 @@ "question__title": "Find the Longest Substring Containing Vowels in Even Counts", "question__title_slug": "find-the-longest-substring-containing-vowels-in-even-counts", "question__hide": false, - "total_acs": 28673, - "total_submitted": 48048, - "total_column_articles": 340, + "total_acs": 29054, + "total_submitted": 48539, + "total_column_articles": 342, "frontend_question_id": "1371", "is_new_question": false }, @@ -44490,8 +44952,8 @@ "question__title": "Increasing Decreasing String", "question__title_slug": "increasing-decreasing-string", "question__hide": false, - "total_acs": 56762, - "total_submitted": 71912, + "total_acs": 56884, + "total_submitted": 72055, "total_column_articles": 682, "frontend_question_id": "1370", "is_new_question": false @@ -44511,9 +44973,9 @@ "question__title": "Maximum Students Taking Exam", "question__title_slug": "maximum-students-taking-exam", "question__hide": false, - "total_acs": 16255, - "total_submitted": 25488, - "total_column_articles": 207, + "total_acs": 16348, + "total_submitted": 25662, + "total_column_articles": 208, "frontend_question_id": "1349", "is_new_question": false }, @@ -44532,8 +44994,8 @@ "question__title": "Tweet Counts Per Frequency", "question__title_slug": "tweet-counts-per-frequency", "question__hide": false, - "total_acs": 5884, - "total_submitted": 16434, + "total_acs": 5924, + "total_submitted": 16484, "total_column_articles": 81, "frontend_question_id": "1348", "is_new_question": false @@ -44553,9 +45015,9 @@ "question__title": "Minimum Number of Steps to Make Two Strings Anagram", "question__title_slug": "minimum-number-of-steps-to-make-two-strings-anagram", "question__hide": false, - "total_acs": 13356, - "total_submitted": 17446, - "total_column_articles": 184, + "total_acs": 13432, + "total_submitted": 17531, + "total_column_articles": 185, "frontend_question_id": "1347", "is_new_question": false }, @@ -44574,9 +45036,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": 39722, - "total_submitted": 95045, - "total_column_articles": 579, + "total_acs": 39941, + "total_submitted": 95535, + "total_column_articles": 583, "frontend_question_id": "1346", "is_new_question": false }, @@ -44595,9 +45057,9 @@ "question__title": "Number of Transactions per Visit", "question__title_slug": "number-of-transactions-per-visit", "question__hide": false, - "total_acs": 4397, - "total_submitted": 9711, - "total_column_articles": 94, + "total_acs": 4436, + "total_submitted": 9790, + "total_column_articles": 95, "frontend_question_id": "1336", "is_new_question": false }, @@ -44616,8 +45078,8 @@ "question__title": "Jump Game V", "question__title_slug": "jump-game-v", "question__hide": false, - "total_acs": 8152, - "total_submitted": 13557, + "total_acs": 8199, + "total_submitted": 13620, "total_column_articles": 143, "frontend_question_id": "1340", "is_new_question": false @@ -44637,8 +45099,8 @@ "question__title": "Maximum Product of Splitted Binary Tree", "question__title_slug": "maximum-product-of-splitted-binary-tree", "question__hide": false, - "total_acs": 15061, - "total_submitted": 35737, + "total_acs": 15179, + "total_submitted": 35932, "total_column_articles": 198, "frontend_question_id": "1339", "is_new_question": false @@ -44658,8 +45120,8 @@ "question__title": "Reduce Array Size to The Half", "question__title_slug": "reduce-array-size-to-the-half", "question__hide": false, - "total_acs": 14918, - "total_submitted": 22902, + "total_acs": 15005, + "total_submitted": 23000, "total_column_articles": 192, "frontend_question_id": "1338", "is_new_question": false @@ -44679,9 +45141,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": 61325, - "total_submitted": 89592, - "total_column_articles": 948, + "total_acs": 61506, + "total_submitted": 89821, + "total_column_articles": 949, "frontend_question_id": "1337", "is_new_question": false }, @@ -44700,9 +45162,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": 26274, - "total_submitted": 38002, - "total_column_articles": 172, + "total_acs": 27257, + "total_submitted": 39350, + "total_column_articles": 178, "frontend_question_id": "1327", "is_new_question": false }, @@ -44721,8 +45183,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": 6403, - "total_submitted": 10857, + "total_acs": 6453, + "total_submitted": 10921, "total_column_articles": 134, "frontend_question_id": "1359", "is_new_question": false @@ -44742,9 +45204,9 @@ "question__title": "Number of Substrings Containing All Three Characters", "question__title_slug": "number-of-substrings-containing-all-three-characters", "question__hide": false, - "total_acs": 13192, - "total_submitted": 23907, - "total_column_articles": 211, + "total_acs": 13394, + "total_submitted": 24185, + "total_column_articles": 213, "frontend_question_id": "1358", "is_new_question": false }, @@ -44763,8 +45225,8 @@ "question__title": "Apply Discount Every n Orders", "question__title_slug": "apply-discount-every-n-orders", "question__hide": false, - "total_acs": 7696, - "total_submitted": 13956, + "total_acs": 7769, + "total_submitted": 14065, "total_column_articles": 78, "frontend_question_id": "1357", "is_new_question": false @@ -44784,8 +45246,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": 67447, - "total_submitted": 91340, + "total_acs": 67793, + "total_submitted": 91749, "total_column_articles": 712, "frontend_question_id": "1356", "is_new_question": false @@ -44805,8 +45267,8 @@ "question__title": "Minimum Difficulty of a Job Schedule", "question__title_slug": "minimum-difficulty-of-a-job-schedule", "question__hide": false, - "total_acs": 19544, - "total_submitted": 29214, + "total_acs": 19637, + "total_submitted": 29341, "total_column_articles": 188, "frontend_question_id": "1335", "is_new_question": false @@ -44826,8 +45288,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": 30244, - "total_submitted": 49032, + "total_acs": 30473, + "total_submitted": 49382, "total_column_articles": 270, "frontend_question_id": "1334", "is_new_question": false @@ -44847,9 +45309,9 @@ "question__title": "Filter Restaurants by Vegan-Friendly, Price and Distance", "question__title_slug": "filter-restaurants-by-vegan-friendly-price-and-distance", "question__hide": false, - "total_acs": 28716, - "total_submitted": 41315, - "total_column_articles": 343, + "total_acs": 28764, + "total_submitted": 41366, + "total_column_articles": 344, "frontend_question_id": "1333", "is_new_question": false }, @@ -44868,8 +45330,8 @@ "question__title": "Remove Palindromic Subsequences", "question__title_slug": "remove-palindromic-subsequences", "question__hide": false, - "total_acs": 37916, - "total_submitted": 48666, + "total_acs": 38037, + "total_submitted": 48809, "total_column_articles": 390, "frontend_question_id": "1332", "is_new_question": false @@ -44889,9 +45351,9 @@ "question__title": "Ads Performance", "question__title_slug": "ads-performance", "question__hide": false, - "total_acs": 10556, - "total_submitted": 17670, - "total_column_articles": 110, + "total_acs": 10612, + "total_submitted": 17760, + "total_column_articles": 111, "frontend_question_id": "1322", "is_new_question": false }, @@ -44910,9 +45372,9 @@ "question__title": "Restaurant Growth", "question__title_slug": "restaurant-growth", "question__hide": false, - "total_acs": 25324, - "total_submitted": 46635, - "total_column_articles": 299, + "total_acs": 26263, + "total_submitted": 48069, + "total_column_articles": 308, "frontend_question_id": "1321", "is_new_question": false }, @@ -44931,9 +45393,9 @@ "question__title": "Minimum Number of Taps to Open to Water a Garden", "question__title_slug": "minimum-number-of-taps-to-open-to-water-a-garden", "question__hide": false, - "total_acs": 27606, - "total_submitted": 51056, - "total_column_articles": 268, + "total_acs": 27675, + "total_submitted": 51174, + "total_column_articles": 269, "frontend_question_id": "1326", "is_new_question": false }, @@ -44952,9 +45414,9 @@ "question__title": "Delete Leaves With a Given Value", "question__title_slug": "delete-leaves-with-a-given-value", "question__hide": false, - "total_acs": 19991, - "total_submitted": 27298, - "total_column_articles": 287, + "total_acs": 20227, + "total_submitted": 27608, + "total_column_articles": 289, "frontend_question_id": "1325", "is_new_question": false }, @@ -44973,9 +45435,9 @@ "question__title": "Print Words Vertically", "question__title_slug": "print-words-vertically", "question__hide": false, - "total_acs": 10351, - "total_submitted": 17119, - "total_column_articles": 191, + "total_acs": 10408, + "total_submitted": 17186, + "total_column_articles": 193, "frontend_question_id": "1324", "is_new_question": false }, @@ -44994,9 +45456,9 @@ "question__title": "Maximum 69 Number", "question__title_slug": "maximum-69-number", "question__hide": false, - "total_acs": 42071, - "total_submitted": 56050, - "total_column_articles": 696, + "total_acs": 42283, + "total_submitted": 56305, + "total_column_articles": 699, "frontend_question_id": "1323", "is_new_question": false }, @@ -45015,9 +45477,9 @@ "question__title": "Jump Game IV", "question__title_slug": "jump-game-iv", "question__hide": false, - "total_acs": 31094, - "total_submitted": 68466, - "total_column_articles": 329, + "total_acs": 31137, + "total_submitted": 68581, + "total_column_articles": 330, "frontend_question_id": "1345", "is_new_question": false }, @@ -45036,8 +45498,8 @@ "question__title": "Angle Between Hands of a Clock", "question__title_slug": "angle-between-hands-of-a-clock", "question__hide": false, - "total_acs": 12880, - "total_submitted": 21327, + "total_acs": 12968, + "total_submitted": 21454, "total_column_articles": 190, "frontend_question_id": "1344", "is_new_question": false @@ -45057,9 +45519,9 @@ "question__title": "Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold", "question__title_slug": "number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold", "question__hide": false, - "total_acs": 23361, - "total_submitted": 39262, - "total_column_articles": 338, + "total_acs": 23862, + "total_submitted": 39864, + "total_column_articles": 347, "frontend_question_id": "1343", "is_new_question": false }, @@ -45078,9 +45540,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": 155062, - "total_submitted": 205470, - "total_column_articles": 1730, + "total_acs": 155711, + "total_submitted": 206305, + "total_column_articles": 1738, "frontend_question_id": "1342", "is_new_question": false }, @@ -45099,9 +45561,9 @@ "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": 4369, - "total_submitted": 7099, - "total_column_articles": 85, + "total_acs": 4395, + "total_submitted": 7141, + "total_column_articles": 86, "frontend_question_id": "1320", "is_new_question": false }, @@ -45120,9 +45582,9 @@ "question__title": "Number of Operations to Make Network Connected", "question__title_slug": "number-of-operations-to-make-network-connected", "question__hide": false, - "total_acs": 48347, - "total_submitted": 77435, - "total_column_articles": 706, + "total_acs": 48560, + "total_submitted": 77759, + "total_column_articles": 708, "frontend_question_id": "1319", "is_new_question": false }, @@ -45141,9 +45603,9 @@ "question__title": "Minimum Flips to Make a OR b Equal to c", "question__title_slug": "minimum-flips-to-make-a-or-b-equal-to-c", "question__hide": false, - "total_acs": 15620, - "total_submitted": 22886, - "total_column_articles": 231, + "total_acs": 15952, + "total_submitted": 23351, + "total_column_articles": 235, "frontend_question_id": "1318", "is_new_question": false }, @@ -45162,9 +45624,9 @@ "question__title": "Convert Integer to the Sum of Two No-Zero Integers", "question__title_slug": "convert-integer-to-the-sum-of-two-no-zero-integers", "question__hide": false, - "total_acs": 16716, - "total_submitted": 26833, - "total_column_articles": 278, + "total_acs": 16805, + "total_submitted": 26969, + "total_column_articles": 277, "frontend_question_id": "1317", "is_new_question": false }, @@ -45183,9 +45645,9 @@ "question__title": "Running Total for Different Genders", "question__title_slug": "running-total-for-different-genders", "question__hide": false, - "total_acs": 14189, - "total_submitted": 19246, - "total_column_articles": 107, + "total_acs": 14251, + "total_submitted": 19323, + "total_column_articles": 108, "frontend_question_id": "1308", "is_new_question": false }, @@ -45204,8 +45666,8 @@ "question__title": "Find the Team Size", "question__title_slug": "find-the-team-size", "question__hide": false, - "total_acs": 24813, - "total_submitted": 30010, + "total_acs": 24952, + "total_submitted": 30191, "total_column_articles": 183, "frontend_question_id": "1303", "is_new_question": false @@ -45225,9 +45687,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": 33116, - "total_submitted": 47371, - "total_column_articles": 319, + "total_acs": 33613, + "total_submitted": 48052, + "total_column_articles": 323, "frontend_question_id": "1312", "is_new_question": false }, @@ -45246,9 +45708,9 @@ "question__title": "Get Watched Videos by Your Friends", "question__title_slug": "get-watched-videos-by-your-friends", "question__hide": false, - "total_acs": 9437, - "total_submitted": 22794, - "total_column_articles": 132, + "total_acs": 9586, + "total_submitted": 23069, + "total_column_articles": 135, "frontend_question_id": "1311", "is_new_question": false }, @@ -45267,8 +45729,8 @@ "question__title": "XOR Queries of a Subarray", "question__title_slug": "xor-queries-of-a-subarray", "question__hide": false, - "total_acs": 44551, - "total_submitted": 61660, + "total_acs": 44836, + "total_submitted": 61979, "total_column_articles": 571, "frontend_question_id": "1310", "is_new_question": false @@ -45288,9 +45750,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": 30018, - "total_submitted": 39163, - "total_column_articles": 503, + "total_acs": 30154, + "total_submitted": 39331, + "total_column_articles": 504, "frontend_question_id": "1309", "is_new_question": false }, @@ -45309,8 +45771,8 @@ "question__title": "Encrypt and Decrypt Strings", "question__title_slug": "encrypt-and-decrypt-strings", "question__hide": false, - "total_acs": 6020, - "total_submitted": 15128, + "total_acs": 6049, + "total_submitted": 15191, "total_column_articles": 91, "frontend_question_id": "2227", "is_new_question": false @@ -45330,8 +45792,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": 1663, - "total_submitted": 3068, + "total_acs": 1676, + "total_submitted": 3098, "total_column_articles": 56, "frontend_question_id": "1430", "is_new_question": false @@ -45351,9 +45813,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": 21694, - "total_submitted": 38877, - "total_column_articles": 205, + "total_acs": 21874, + "total_submitted": 39223, + "total_column_articles": 204, "frontend_question_id": "2192", "is_new_question": false }, @@ -45372,9 +45834,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": 13726, - "total_submitted": 21473, - "total_column_articles": 159, + "total_acs": 14339, + "total_submitted": 22363, + "total_column_articles": 170, "frontend_question_id": "2269", "is_new_question": false }, @@ -45393,8 +45855,8 @@ "question__title": "Verbal Arithmetic Puzzle", "question__title_slug": "verbal-arithmetic-puzzle", "question__hide": false, - "total_acs": 3434, - "total_submitted": 9819, + "total_acs": 3458, + "total_submitted": 9874, "total_column_articles": 75, "frontend_question_id": "1307", "is_new_question": false @@ -45414,9 +45876,9 @@ "question__title": "Jump Game III", "question__title_slug": "jump-game-iii", "question__hide": false, - "total_acs": 36100, - "total_submitted": 61621, - "total_column_articles": 486, + "total_acs": 36457, + "total_submitted": 62235, + "total_column_articles": 488, "frontend_question_id": "1306", "is_new_question": false }, @@ -45435,8 +45897,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": 52958, - "total_submitted": 67863, + "total_acs": 53031, + "total_submitted": 67953, "total_column_articles": 713, "frontend_question_id": "1305", "is_new_question": false @@ -45456,9 +45918,9 @@ "question__title": "Find N Unique Integers Sum up to Zero", "question__title_slug": "find-n-unique-integers-sum-up-to-zero", "question__hide": false, - "total_acs": 32083, - "total_submitted": 45620, - "total_column_articles": 518, + "total_acs": 32224, + "total_submitted": 45792, + "total_column_articles": 520, "frontend_question_id": "1304", "is_new_question": false }, @@ -45477,8 +45939,8 @@ "question__title": "Weather Type in Each Country", "question__title_slug": "weather-type-in-each-country", "question__hide": false, - "total_acs": 16091, - "total_submitted": 24476, + "total_acs": 16131, + "total_submitted": 24544, "total_column_articles": 144, "frontend_question_id": "1294", "is_new_question": false @@ -45498,9 +45960,9 @@ "question__title": "Maximum Candies You Can Get from Boxes", "question__title_slug": "maximum-candies-you-can-get-from-boxes", "question__hide": false, - "total_acs": 4804, - "total_submitted": 8222, - "total_column_articles": 135, + "total_acs": 4884, + "total_submitted": 8418, + "total_column_articles": 136, "frontend_question_id": "1298", "is_new_question": false }, @@ -45519,9 +45981,9 @@ "question__title": "Maximum Number of Occurrences of a Substring", "question__title_slug": "maximum-number-of-occurrences-of-a-substring", "question__hide": false, - "total_acs": 11676, - "total_submitted": 23782, - "total_column_articles": 141, + "total_acs": 11721, + "total_submitted": 23869, + "total_column_articles": 142, "frontend_question_id": "1297", "is_new_question": false }, @@ -45540,8 +46002,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": 13899, - "total_submitted": 28009, + "total_acs": 13960, + "total_submitted": 28107, "total_column_articles": 185, "frontend_question_id": "1296", "is_new_question": false @@ -45561,9 +46023,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": 63879, - "total_submitted": 80369, - "total_column_articles": 808, + "total_acs": 64115, + "total_submitted": 80648, + "total_column_articles": 813, "frontend_question_id": "1295", "is_new_question": false }, @@ -45582,9 +46044,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": 14036, - "total_submitted": 17893, - "total_column_articles": 130, + "total_acs": 14200, + "total_submitted": 18116, + "total_column_articles": 131, "frontend_question_id": "1285", "is_new_question": false }, @@ -45603,8 +46065,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": 386, - "total_submitted": 552, + "total_acs": 395, + "total_submitted": 563, "total_column_articles": 17, "frontend_question_id": "2263", "is_new_question": false @@ -45624,9 +46086,9 @@ "question__title": "Fair Distribution of Cookies", "question__title_slug": "fair-distribution-of-cookies", "question__hide": false, - "total_acs": 15032, - "total_submitted": 20581, - "total_column_articles": 157, + "total_acs": 15164, + "total_submitted": 20750, + "total_column_articles": 158, "frontend_question_id": "2305", "is_new_question": false }, @@ -45645,8 +46107,8 @@ "question__title": "Check if an Array Is Consecutive", "question__title_slug": "check-if-an-array-is-consecutive", "question__hide": false, - "total_acs": 906, - "total_submitted": 1278, + "total_acs": 917, + "total_submitted": 1354, "total_column_articles": 32, "frontend_question_id": "2229", "is_new_question": false @@ -45666,9 +46128,9 @@ "question__title": "Students and Examinations", "question__title_slug": "students-and-examinations", "question__hide": false, - "total_acs": 50886, - "total_submitted": 99323, - "total_column_articles": 349, + "total_acs": 53019, + "total_submitted": 103284, + "total_column_articles": 363, "frontend_question_id": "1280", "is_new_question": false }, @@ -45687,9 +46149,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": 24730, - "total_submitted": 63585, - "total_column_articles": 211, + "total_acs": 24897, + "total_submitted": 64000, + "total_column_articles": 212, "frontend_question_id": "1293", "is_new_question": false }, @@ -45708,9 +46170,9 @@ "question__title": "Maximum Side Length of a Square with Sum Less than or Equal to Threshold", "question__title_slug": "maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold", "question__hide": false, - "total_acs": 12568, - "total_submitted": 24472, - "total_column_articles": 166, + "total_acs": 12655, + "total_submitted": 24607, + "total_column_articles": 167, "frontend_question_id": "1292", "is_new_question": false }, @@ -45729,9 +46191,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": 88991, - "total_submitted": 111392, - "total_column_articles": 1059, + "total_acs": 89336, + "total_submitted": 111809, + "total_column_articles": 1062, "frontend_question_id": "1290", "is_new_question": false }, @@ -45750,8 +46212,8 @@ "question__title": "Traffic Light Controlled Intersection", "question__title_slug": "traffic-light-controlled-intersection", "question__hide": false, - "total_acs": 2755, - "total_submitted": 4844, + "total_acs": 2814, + "total_submitted": 4921, "total_column_articles": 28, "frontend_question_id": "1279", "is_new_question": false @@ -45771,9 +46233,9 @@ "question__title": "Minimum Number of Flips to Convert Binary Matrix to Zero Matrix", "question__title_slug": "minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix", "question__hide": false, - "total_acs": 4580, - "total_submitted": 6625, - "total_column_articles": 109, + "total_acs": 4604, + "total_submitted": 6654, + "total_column_articles": 110, "frontend_question_id": "1284", "is_new_question": false }, @@ -45792,9 +46254,9 @@ "question__title": "Find the Smallest Divisor Given a Threshold", "question__title_slug": "find-the-smallest-divisor-given-a-threshold", "question__hide": false, - "total_acs": 18286, - "total_submitted": 35491, - "total_column_articles": 224, + "total_acs": 18583, + "total_submitted": 35990, + "total_column_articles": 226, "frontend_question_id": "1283", "is_new_question": false }, @@ -45813,9 +46275,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": 52021, - "total_submitted": 60420, - "total_column_articles": 830, + "total_acs": 52106, + "total_submitted": 60513, + "total_column_articles": 833, "frontend_question_id": "1282", "is_new_question": false }, @@ -45834,9 +46296,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": 111193, - "total_submitted": 133987, - "total_column_articles": 1122, + "total_acs": 111932, + "total_submitted": 134941, + "total_column_articles": 1124, "frontend_question_id": "1281", "is_new_question": false }, @@ -45855,9 +46317,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": 15006, - "total_submitted": 19142, - "total_column_articles": 152, + "total_acs": 15168, + "total_submitted": 19346, + "total_column_articles": 154, "frontend_question_id": "1270", "is_new_question": false }, @@ -45876,8 +46338,8 @@ "question__title": "Print Immutable Linked List in Reverse", "question__title_slug": "print-immutable-linked-list-in-reverse", "question__hide": false, - "total_acs": 6333, - "total_submitted": 6963, + "total_acs": 6410, + "total_submitted": 7044, "total_column_articles": 119, "frontend_question_id": "1265", "is_new_question": false @@ -45897,8 +46359,8 @@ "question__title": "Palindrome Partitioning III", "question__title_slug": "palindrome-partitioning-iii", "question__hide": false, - "total_acs": 7417, - "total_submitted": 11716, + "total_acs": 7504, + "total_submitted": 11836, "total_column_articles": 108, "frontend_question_id": "1278", "is_new_question": false @@ -45918,9 +46380,9 @@ "question__title": "Count Square Submatrices with All Ones", "question__title_slug": "count-square-submatrices-with-all-ones", "question__hide": false, - "total_acs": 35491, - "total_submitted": 48094, - "total_column_articles": 376, + "total_acs": 35840, + "total_submitted": 48514, + "total_column_articles": 379, "frontend_question_id": "1277", "is_new_question": false }, @@ -45939,9 +46401,9 @@ "question__title": "Number of Burgers with No Waste of Ingredients", "question__title_slug": "number-of-burgers-with-no-waste-of-ingredients", "question__hide": false, - "total_acs": 28214, - "total_submitted": 48534, - "total_column_articles": 327, + "total_acs": 28460, + "total_submitted": 49011, + "total_column_articles": 328, "frontend_question_id": "1276", "is_new_question": false }, @@ -45960,9 +46422,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": 18704, - "total_submitted": 34053, - "total_column_articles": 347, + "total_acs": 18886, + "total_submitted": 34361, + "total_column_articles": 349, "frontend_question_id": "1275", "is_new_question": false }, @@ -45981,8 +46443,8 @@ "question__title": "Page Recommendations", "question__title_slug": "page-recommendations", "question__hide": false, - "total_acs": 16059, - "total_submitted": 28779, + "total_acs": 16274, + "total_submitted": 29164, "total_column_articles": 185, "frontend_question_id": "1264", "is_new_question": false @@ -46002,8 +46464,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": 33827, - "total_submitted": 68921, + "total_acs": 33884, + "total_submitted": 69024, "total_column_articles": 354, "frontend_question_id": "1269", "is_new_question": false @@ -46023,9 +46485,9 @@ "question__title": "Search Suggestions System", "question__title_slug": "search-suggestions-system", "question__hide": false, - "total_acs": 21809, - "total_submitted": 36064, - "total_column_articles": 309, + "total_acs": 22085, + "total_submitted": 36460, + "total_column_articles": 311, "frontend_question_id": "1268", "is_new_question": false }, @@ -46044,8 +46506,8 @@ "question__title": "Count Servers that Communicate", "question__title_slug": "count-servers-that-communicate", "question__hide": false, - "total_acs": 35967, - "total_submitted": 51733, + "total_acs": 36028, + "total_submitted": 51821, "total_column_articles": 452, "frontend_question_id": "1267", "is_new_question": false @@ -46065,8 +46527,8 @@ "question__title": "Minimum Time Visiting All Points", "question__title_slug": "minimum-time-visiting-all-points", "question__hide": false, - "total_acs": 38274, - "total_submitted": 46224, + "total_acs": 38380, + "total_submitted": 46341, "total_column_articles": 549, "frontend_question_id": "1266", "is_new_question": false @@ -46086,9 +46548,9 @@ "question__title": "Minimum Path Cost in a Grid", "question__title_slug": "minimum-path-cost-in-a-grid", "question__hide": false, - "total_acs": 21526, - "total_submitted": 29804, - "total_column_articles": 239, + "total_acs": 21771, + "total_submitted": 30108, + "total_column_articles": 242, "frontend_question_id": "2304", "is_new_question": false }, @@ -46107,9 +46569,9 @@ "question__title": "Maximum Value of K Coins From Piles", "question__title_slug": "maximum-value-of-k-coins-from-piles", "question__hide": false, - "total_acs": 8293, - "total_submitted": 14583, - "total_column_articles": 101, + "total_acs": 8424, + "total_submitted": 14813, + "total_column_articles": 102, "frontend_question_id": "2218", "is_new_question": false }, @@ -46128,9 +46590,9 @@ "question__title": "Find the Difference of Two Arrays", "question__title_slug": "find-the-difference-of-two-arrays", "question__hide": false, - "total_acs": 32614, - "total_submitted": 45919, - "total_column_articles": 293, + "total_acs": 33174, + "total_submitted": 46661, + "total_column_articles": 294, "frontend_question_id": "2215", "is_new_question": false }, @@ -46149,8 +46611,8 @@ "question__title": "Counting Elements", "question__title_slug": "counting-elements", "question__hide": false, - "total_acs": 4250, - "total_submitted": 6249, + "total_acs": 4403, + "total_submitted": 6503, "total_column_articles": 97, "frontend_question_id": "1426", "is_new_question": false @@ -46170,9 +46632,9 @@ "question__title": "Average Selling Price", "question__title_slug": "average-selling-price", "question__hide": false, - "total_acs": 50099, - "total_submitted": 111293, - "total_column_articles": 354, + "total_acs": 52068, + "total_submitted": 118102, + "total_column_articles": 362, "frontend_question_id": "1251", "is_new_question": false }, @@ -46191,9 +46653,9 @@ "question__title": "Minimum Moves to Move a Box to Their Target Location", "question__title_slug": "minimum-moves-to-move-a-box-to-their-target-location", "question__hide": false, - "total_acs": 15638, - "total_submitted": 28953, - "total_column_articles": 163, + "total_acs": 15671, + "total_submitted": 29011, + "total_column_articles": 164, "frontend_question_id": "1263", "is_new_question": false }, @@ -46212,9 +46674,9 @@ "question__title": "Greatest Sum Divisible by Three", "question__title_slug": "greatest-sum-divisible-by-three", "question__hide": false, - "total_acs": 42688, - "total_submitted": 75702, - "total_column_articles": 433, + "total_acs": 43053, + "total_submitted": 76279, + "total_column_articles": 435, "frontend_question_id": "1262", "is_new_question": false }, @@ -46233,9 +46695,9 @@ "question__title": "Find Elements in a Contaminated Binary Tree", "question__title_slug": "find-elements-in-a-contaminated-binary-tree", "question__hide": false, - "total_acs": 34551, - "total_submitted": 43824, - "total_column_articles": 306, + "total_acs": 34678, + "total_submitted": 44004, + "total_column_articles": 305, "frontend_question_id": "1261", "is_new_question": false }, @@ -46254,8 +46716,8 @@ "question__title": "Shift 2D Grid", "question__title_slug": "shift-2d-grid", "question__hide": false, - "total_acs": 46065, - "total_submitted": 70454, + "total_acs": 46195, + "total_submitted": 70664, "total_column_articles": 690, "frontend_question_id": "1260", "is_new_question": false @@ -46275,8 +46737,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": 299, - "total_submitted": 492, + "total_acs": 307, + "total_submitted": 501, "total_column_articles": 16, "frontend_question_id": "2189", "is_new_question": false @@ -46296,8 +46758,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": 910, - "total_submitted": 1493, + "total_acs": 914, + "total_submitted": 1511, "total_column_articles": 30, "frontend_question_id": "1618", "is_new_question": false @@ -46317,8 +46779,8 @@ "question__title": "Number of Single Divisor Triplets", "question__title_slug": "number-of-single-divisor-triplets", "question__hide": false, - "total_acs": 278, - "total_submitted": 515, + "total_acs": 284, + "total_submitted": 522, "total_column_articles": 8, "frontend_question_id": "2198", "is_new_question": false @@ -46338,9 +46800,9 @@ "question__title": "Calculate Amount Paid in Taxes", "question__title_slug": "calculate-amount-paid-in-taxes", "question__hide": false, - "total_acs": 25220, - "total_submitted": 35839, - "total_column_articles": 216, + "total_acs": 25275, + "total_submitted": 35920, + "total_column_articles": 217, "frontend_question_id": "2303", "is_new_question": false }, @@ -46359,8 +46821,8 @@ "question__title": "Maximum Score Words Formed by Letters", "question__title_slug": "maximum-score-words-formed-by-letters", "question__hide": false, - "total_acs": 18797, - "total_submitted": 23632, + "total_acs": 18963, + "total_submitted": 23842, "total_column_articles": 253, "frontend_question_id": "1255", "is_new_question": false @@ -46380,9 +46842,9 @@ "question__title": "Number of Closed Islands", "question__title_slug": "number-of-closed-islands", "question__hide": false, - "total_acs": 65115, - "total_submitted": 101776, - "total_column_articles": 863, + "total_acs": 65549, + "total_submitted": 102394, + "total_column_articles": 870, "frontend_question_id": "1254", "is_new_question": false }, @@ -46401,9 +46863,9 @@ "question__title": "Reconstruct a 2-Row Binary Matrix", "question__title_slug": "reconstruct-a-2-row-binary-matrix", "question__hide": false, - "total_acs": 23701, - "total_submitted": 48805, - "total_column_articles": 268, + "total_acs": 23765, + "total_submitted": 48893, + "total_column_articles": 269, "frontend_question_id": "1253", "is_new_question": false }, @@ -46422,8 +46884,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": 53371, - "total_submitted": 67068, + "total_acs": 53511, + "total_submitted": 67239, "total_column_articles": 677, "frontend_question_id": "1252", "is_new_question": false @@ -46443,8 +46905,8 @@ "question__title": "Number of Comments per Post", "question__title_slug": "number-of-comments-per-post", "question__hide": false, - "total_acs": 12355, - "total_submitted": 20753, + "total_acs": 12406, + "total_submitted": 20846, "total_column_articles": 104, "frontend_question_id": "1241", "is_new_question": false @@ -46464,9 +46926,9 @@ "question__title": "Selling Pieces of Wood", "question__title_slug": "selling-pieces-of-wood", "question__hide": false, - "total_acs": 19044, - "total_submitted": 29223, - "total_column_articles": 124, + "total_acs": 19097, + "total_submitted": 29297, + "total_column_articles": 123, "frontend_question_id": "2312", "is_new_question": false }, @@ -46485,8 +46947,8 @@ "question__title": "Find Palindrome With Fixed Length", "question__title_slug": "find-palindrome-with-fixed-length", "question__hide": false, - "total_acs": 8151, - "total_submitted": 23757, + "total_acs": 8178, + "total_submitted": 23840, "total_column_articles": 154, "frontend_question_id": "2217", "is_new_question": false @@ -46506,8 +46968,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": 2510, - "total_submitted": 4044, + "total_acs": 2516, + "total_submitted": 4053, "total_column_articles": 40, "frontend_question_id": "1428", "is_new_question": false @@ -46527,9 +46989,9 @@ "question__title": "Check If It Is a Good Array", "question__title_slug": "check-if-it-is-a-good-array", "question__hide": false, - "total_acs": 22128, - "total_submitted": 31306, - "total_column_articles": 155, + "total_acs": 22187, + "total_submitted": 31382, + "total_column_articles": 156, "frontend_question_id": "1250", "is_new_question": false }, @@ -46548,9 +47010,9 @@ "question__title": "Minimum Remove to Make Valid Parentheses", "question__title_slug": "minimum-remove-to-make-valid-parentheses", "question__hide": false, - "total_acs": 48097, - "total_submitted": 80572, - "total_column_articles": 594, + "total_acs": 48372, + "total_submitted": 80927, + "total_column_articles": 595, "frontend_question_id": "1249", "is_new_question": false }, @@ -46569,9 +47031,9 @@ "question__title": "Count Number of Nice Subarrays", "question__title_slug": "count-number-of-nice-subarrays", "question__hide": false, - "total_acs": 56670, - "total_submitted": 96584, - "total_column_articles": 669, + "total_acs": 57016, + "total_submitted": 97069, + "total_column_articles": 677, "frontend_question_id": "1248", "is_new_question": false }, @@ -46590,9 +47052,9 @@ "question__title": "Minimum Swaps to Make Strings Equal", "question__title_slug": "minimum-swaps-to-make-strings-equal", "question__hide": false, - "total_acs": 32768, - "total_submitted": 47520, - "total_column_articles": 447, + "total_acs": 32840, + "total_submitted": 47628, + "total_column_articles": 449, "frontend_question_id": "1247", "is_new_question": false }, @@ -46611,8 +47073,8 @@ "question__title": "Web Crawler Multithreaded", "question__title_slug": "web-crawler-multithreaded", "question__hide": false, - "total_acs": 2526, - "total_submitted": 5227, + "total_acs": 2550, + "total_submitted": 5271, "total_column_articles": 31, "frontend_question_id": "1242", "is_new_question": false @@ -46632,9 +47094,9 @@ "question__title": "Maximum Height by Stacking Cuboids ", "question__title_slug": "maximum-height-by-stacking-cuboids", "question__hide": false, - "total_acs": 15591, - "total_submitted": 23966, - "total_column_articles": 181, + "total_acs": 15669, + "total_submitted": 24065, + "total_column_articles": 182, "frontend_question_id": "1691", "is_new_question": false }, @@ -46653,8 +47115,8 @@ "question__title": "First Unique Number", "question__title_slug": "first-unique-number", "question__hide": false, - "total_acs": 4548, - "total_submitted": 8443, + "total_acs": 4637, + "total_submitted": 8666, "total_column_articles": 101, "frontend_question_id": "1429", "is_new_question": false @@ -46674,9 +47136,9 @@ "question__title": "Tuple with Same Product", "question__title_slug": "tuple-with-same-product", "question__hide": false, - "total_acs": 32141, - "total_submitted": 49863, - "total_column_articles": 285, + "total_acs": 32165, + "total_submitted": 49901, + "total_column_articles": 286, "frontend_question_id": "1726", "is_new_question": false }, @@ -46695,8 +47157,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": 31011, - "total_submitted": 43219, + "total_acs": 31071, + "total_submitted": 43286, "total_column_articles": 346, "frontend_question_id": "2309", "is_new_question": false @@ -46716,9 +47178,9 @@ "question__title": "Airplane Seat Assignment Probability", "question__title_slug": "airplane-seat-assignment-probability", "question__hide": false, - "total_acs": 15555, - "total_submitted": 23155, - "total_column_articles": 200, + "total_acs": 15640, + "total_submitted": 23278, + "total_column_articles": 201, "frontend_question_id": "1227", "is_new_question": false }, @@ -46737,8 +47199,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": 15254, - "total_submitted": 24056, + "total_acs": 15280, + "total_submitted": 24092, "total_column_articles": 122, "frontend_question_id": "1240", "is_new_question": false @@ -46758,8 +47220,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": 43559, - "total_submitted": 88788, + "total_acs": 43645, + "total_submitted": 88952, "total_column_articles": 461, "frontend_question_id": "1239", "is_new_question": false @@ -46779,8 +47241,8 @@ "question__title": "Circular Permutation in Binary Representation", "question__title_slug": "circular-permutation-in-binary-representation", "question__hide": false, - "total_acs": 22421, - "total_submitted": 28959, + "total_acs": 22453, + "total_submitted": 28998, "total_column_articles": 230, "frontend_question_id": "1238", "is_new_question": false @@ -46800,9 +47262,9 @@ "question__title": "Find Positive Integer Solution for a Given Equation", "question__title_slug": "find-positive-integer-solution-for-a-given-equation", "question__hide": false, - "total_acs": 33225, - "total_submitted": 42468, - "total_column_articles": 331, + "total_acs": 33299, + "total_submitted": 42554, + "total_column_articles": 332, "frontend_question_id": "1237", "is_new_question": false }, @@ -46821,9 +47283,9 @@ "question__title": "Report Contiguous Dates", "question__title_slug": "report-contiguous-dates", "question__hide": false, - "total_acs": 10086, - "total_submitted": 19456, - "total_column_articles": 173, + "total_acs": 10259, + "total_submitted": 19821, + "total_column_articles": 175, "frontend_question_id": "1225", "is_new_question": false }, @@ -46842,8 +47304,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": 3893, - "total_submitted": 7888, + "total_acs": 3917, + "total_submitted": 7927, "total_column_articles": 70, "frontend_question_id": "2193", "is_new_question": false @@ -46863,8 +47325,8 @@ "question__title": "Minimum Deletions to Make Array Beautiful", "question__title_slug": "minimum-deletions-to-make-array-beautiful", "question__hide": false, - "total_acs": 35175, - "total_submitted": 56905, + "total_acs": 35239, + "total_submitted": 57026, "total_column_articles": 438, "frontend_question_id": "2216", "is_new_question": false @@ -46884,9 +47346,9 @@ "question__title": "Find Players With Zero or One Losses", "question__title_slug": "find-players-with-zero-or-one-losses", "question__hide": false, - "total_acs": 11702, - "total_submitted": 18504, - "total_column_articles": 129, + "total_acs": 32012, + "total_submitted": 44918, + "total_column_articles": 257, "frontend_question_id": "2225", "is_new_question": false }, @@ -46905,9 +47367,9 @@ "question__title": "Find Resultant Array After Removing Anagrams", "question__title_slug": "find-resultant-array-after-removing-anagrams", "question__hide": false, - "total_acs": 13313, - "total_submitted": 22088, - "total_column_articles": 175, + "total_acs": 13401, + "total_submitted": 22200, + "total_column_articles": 176, "frontend_question_id": "2273", "is_new_question": false }, @@ -46926,8 +47388,8 @@ "question__title": "Maximum Profit in Job Scheduling", "question__title_slug": "maximum-profit-in-job-scheduling", "question__hide": false, - "total_acs": 45290, - "total_submitted": 75634, + "total_acs": 45593, + "total_submitted": 76126, "total_column_articles": 464, "frontend_question_id": "1235", "is_new_question": false @@ -46947,9 +47409,9 @@ "question__title": "Replace the Substring for Balanced String", "question__title_slug": "replace-the-substring-for-balanced-string", "question__hide": false, - "total_acs": 34715, - "total_submitted": 75955, - "total_column_articles": 347, + "total_acs": 34989, + "total_submitted": 76477, + "total_column_articles": 349, "frontend_question_id": "1234", "is_new_question": false }, @@ -46968,9 +47430,9 @@ "question__title": "Remove Sub-Folders from the Filesystem", "question__title_slug": "remove-sub-folders-from-the-filesystem", "question__hide": false, - "total_acs": 38046, - "total_submitted": 62035, - "total_column_articles": 458, + "total_acs": 38203, + "total_submitted": 62326, + "total_column_articles": 460, "frontend_question_id": "1233", "is_new_question": false }, @@ -46989,9 +47451,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": 54830, - "total_submitted": 123730, - "total_column_articles": 655, + "total_acs": 55055, + "total_submitted": 124231, + "total_column_articles": 656, "frontend_question_id": "1232", "is_new_question": false }, @@ -47010,9 +47472,9 @@ "question__title": "Maximum Score Of Spliced Array", "question__title_slug": "maximum-score-of-spliced-array", "question__hide": false, - "total_acs": 8124, - "total_submitted": 15104, - "total_column_articles": 124, + "total_acs": 8384, + "total_submitted": 15472, + "total_column_articles": 129, "frontend_question_id": "2321", "is_new_question": false }, @@ -47031,8 +47493,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": 513, - "total_submitted": 812, + "total_acs": 520, + "total_submitted": 822, "total_column_articles": 20, "frontend_question_id": "2204", "is_new_question": false @@ -47052,9 +47514,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": 10093, - "total_submitted": 45494, - "total_column_articles": 157, + "total_acs": 10152, + "total_submitted": 45679, + "total_column_articles": 158, "frontend_question_id": "2202", "is_new_question": false }, @@ -47073,9 +47535,9 @@ "question__title": "Perform String Shifts", "question__title_slug": "perform-string-shifts", "question__hide": false, - "total_acs": 6883, - "total_submitted": 11903, - "total_column_articles": 170, + "total_acs": 7067, + "total_submitted": 12245, + "total_column_articles": 171, "frontend_question_id": "1427", "is_new_question": false }, @@ -47094,9 +47556,9 @@ "question__title": "Maximum Equal Frequency", "question__title_slug": "maximum-equal-frequency", "question__hide": false, - "total_acs": 27554, - "total_submitted": 63239, - "total_column_articles": 305, + "total_acs": 27585, + "total_submitted": 63303, + "total_column_articles": 306, "frontend_question_id": "1224", "is_new_question": false }, @@ -47115,8 +47577,8 @@ "question__title": "Dice Roll Simulation", "question__title_slug": "dice-roll-simulation", "question__hide": false, - "total_acs": 18449, - "total_submitted": 29818, + "total_acs": 18483, + "total_submitted": 29874, "total_column_articles": 196, "frontend_question_id": "1223", "is_new_question": false @@ -47136,9 +47598,9 @@ "question__title": "Queens That Can Attack the King", "question__title_slug": "queens-that-can-attack-the-king", "question__hide": false, - "total_acs": 31105, - "total_submitted": 42046, - "total_column_articles": 397, + "total_acs": 31167, + "total_submitted": 42118, + "total_column_articles": 398, "frontend_question_id": "1222", "is_new_question": false }, @@ -47157,9 +47619,9 @@ "question__title": "Split a String in Balanced Strings", "question__title_slug": "split-a-string-in-balanced-strings", "question__hide": false, - "total_acs": 108693, - "total_submitted": 127558, - "total_column_articles": 1415, + "total_acs": 109105, + "total_submitted": 127998, + "total_column_articles": 1419, "frontend_question_id": "1221", "is_new_question": false }, @@ -47178,9 +47640,9 @@ "question__title": "The Dining Philosophers", "question__title_slug": "the-dining-philosophers", "question__hide": false, - "total_acs": 20846, - "total_submitted": 34903, - "total_column_articles": 204, + "total_acs": 21068, + "total_submitted": 35264, + "total_column_articles": 205, "frontend_question_id": "1226", "is_new_question": false }, @@ -47199,9 +47661,9 @@ "question__title": "Team Scores in Football Tournament", "question__title_slug": "team-scores-in-football-tournament", "question__hide": false, - "total_acs": 14139, - "total_submitted": 28453, - "total_column_articles": 205, + "total_acs": 14389, + "total_submitted": 28937, + "total_column_articles": 208, "frontend_question_id": "1212", "is_new_question": false }, @@ -47220,9 +47682,9 @@ "question__title": "Queries Quality and Percentage", "question__title_slug": "queries-quality-and-percentage", "question__hide": false, - "total_acs": 43954, - "total_submitted": 80999, - "total_column_articles": 259, + "total_acs": 45655, + "total_submitted": 85683, + "total_column_articles": 264, "frontend_question_id": "1211", "is_new_question": false }, @@ -47241,9 +47703,9 @@ "question__title": "Design Skiplist", "question__title_slug": "design-skiplist", "question__hide": false, - "total_acs": 33131, - "total_submitted": 48977, - "total_column_articles": 270, + "total_acs": 33273, + "total_submitted": 49246, + "total_column_articles": 271, "frontend_question_id": "1206", "is_new_question": false }, @@ -47262,8 +47724,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": 1360, - "total_submitted": 4174, + "total_acs": 1369, + "total_submitted": 4197, "total_column_articles": 38, "frontend_question_id": "1960", "is_new_question": false @@ -47283,8 +47745,8 @@ "question__title": "Maximum Candies Allocated to K Children", "question__title_slug": "maximum-candies-allocated-to-k-children", "question__hide": false, - "total_acs": 14777, - "total_submitted": 41257, + "total_acs": 15023, + "total_submitted": 41844, "total_column_articles": 207, "frontend_question_id": "2226", "is_new_question": false @@ -47304,9 +47766,9 @@ "question__title": "Sum of Numbers With Units Digit K", "question__title_slug": "sum-of-numbers-with-units-digit-k", "question__hide": false, - "total_acs": 9954, - "total_submitted": 35087, - "total_column_articles": 143, + "total_acs": 9992, + "total_submitted": 35172, + "total_column_articles": 144, "frontend_question_id": "2310", "is_new_question": false }, @@ -47325,8 +47787,8 @@ "question__title": "Sort the Jumbled Numbers", "question__title_slug": "sort-the-jumbled-numbers", "question__hide": false, - "total_acs": 7679, - "total_submitted": 17414, + "total_acs": 7706, + "total_submitted": 17462, "total_column_articles": 116, "frontend_question_id": "2191", "is_new_question": false @@ -47346,8 +47808,8 @@ "question__title": "Count Vowels Permutation", "question__title_slug": "count-vowels-permutation", "question__hide": false, - "total_acs": 28508, - "total_submitted": 46824, + "total_acs": 28608, + "total_submitted": 47008, "total_column_articles": 386, "frontend_question_id": "1220", "is_new_question": false @@ -47367,8 +47829,8 @@ "question__title": "Path with Maximum Gold", "question__title_slug": "path-with-maximum-gold", "question__hide": false, - "total_acs": 43638, - "total_submitted": 63495, + "total_acs": 43820, + "total_submitted": 63815, "total_column_articles": 537, "frontend_question_id": "1219", "is_new_question": false @@ -47388,9 +47850,9 @@ "question__title": "Longest Arithmetic Subsequence of Given Difference", "question__title_slug": "longest-arithmetic-subsequence-of-given-difference", "question__hide": false, - "total_acs": 51942, - "total_submitted": 102803, - "total_column_articles": 457, + "total_acs": 52345, + "total_submitted": 103639, + "total_column_articles": 460, "frontend_question_id": "1218", "is_new_question": false }, @@ -47409,9 +47871,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": 61835, - "total_submitted": 82640, - "total_column_articles": 784, + "total_acs": 62015, + "total_submitted": 82856, + "total_column_articles": 787, "frontend_question_id": "1217", "is_new_question": false }, @@ -47430,9 +47892,9 @@ "question__title": "Monthly Transactions II", "question__title_slug": "monthly-transactions-ii", "question__hide": false, - "total_acs": 10049, - "total_submitted": 22244, - "total_column_articles": 124, + "total_acs": 10130, + "total_submitted": 22452, + "total_column_articles": 126, "frontend_question_id": "1205", "is_new_question": false }, @@ -47451,9 +47913,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": 28075, - "total_submitted": 39584, - "total_column_articles": 235, + "total_acs": 29175, + "total_submitted": 41197, + "total_column_articles": 243, "frontend_question_id": "1204", "is_new_question": false }, @@ -47472,8 +47934,8 @@ "question__title": "Sum of Floored Pairs", "question__title_slug": "sum-of-floored-pairs", "question__hide": false, - "total_acs": 4437, - "total_submitted": 12826, + "total_acs": 4494, + "total_submitted": 12940, "total_column_articles": 68, "frontend_question_id": "1862", "is_new_question": false @@ -47493,9 +47955,9 @@ "question__title": "Path with Maximum Probability", "question__title_slug": "path-with-maximum-probability", "question__hide": false, - "total_acs": 24037, - "total_submitted": 57469, - "total_column_articles": 288, + "total_acs": 24268, + "total_submitted": 57910, + "total_column_articles": 290, "frontend_question_id": "1514", "is_new_question": false }, @@ -47514,8 +47976,8 @@ "question__title": "Where Will the Ball Fall", "question__title_slug": "where-will-the-ball-fall", "question__hide": false, - "total_acs": 40793, - "total_submitted": 59097, + "total_acs": 40823, + "total_submitted": 59128, "total_column_articles": 691, "frontend_question_id": "1706", "is_new_question": false @@ -47535,8 +47997,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": 15747, - "total_submitted": 24618, + "total_acs": 15803, + "total_submitted": 24712, "total_column_articles": 185, "frontend_question_id": "1210", "is_new_question": false @@ -47556,9 +48018,9 @@ "question__title": "Get Equal Substrings Within Budget", "question__title_slug": "get-equal-substrings-within-budget", "question__hide": false, - "total_acs": 73987, - "total_submitted": 147277, - "total_column_articles": 796, + "total_acs": 74412, + "total_submitted": 147906, + "total_column_articles": 798, "frontend_question_id": "1208", "is_new_question": false }, @@ -47577,9 +48039,9 @@ "question__title": "Remove All Adjacent Duplicates in String II", "question__title_slug": "remove-all-adjacent-duplicates-in-string-ii", "question__hide": false, - "total_acs": 22989, - "total_submitted": 44619, - "total_column_articles": 248, + "total_acs": 23166, + "total_submitted": 44905, + "total_column_articles": 249, "frontend_question_id": "1209", "is_new_question": false }, @@ -47598,9 +48060,9 @@ "question__title": "Unique Number of Occurrences", "question__title_slug": "unique-number-of-occurrences", "question__hide": false, - "total_acs": 103528, - "total_submitted": 140713, - "total_column_articles": 1192, + "total_acs": 104453, + "total_submitted": 141886, + "total_column_articles": 1196, "frontend_question_id": "1207", "is_new_question": false }, @@ -47619,9 +48081,9 @@ "question__title": "Tournament Winners", "question__title_slug": "tournament-winners", "question__hide": false, - "total_acs": 7752, - "total_submitted": 15271, - "total_column_articles": 111, + "total_acs": 7813, + "total_submitted": 15375, + "total_column_articles": 112, "frontend_question_id": "1194", "is_new_question": false }, @@ -47640,9 +48102,9 @@ "question__title": "Monthly Transactions I", "question__title_slug": "monthly-transactions-i", "question__hide": false, - "total_acs": 40332, - "total_submitted": 66216, - "total_column_articles": 273, + "total_acs": 42008, + "total_submitted": 68953, + "total_column_articles": 283, "frontend_question_id": "1193", "is_new_question": false }, @@ -47661,9 +48123,9 @@ "question__title": "Fizz Buzz Multithreaded", "question__title_slug": "fizz-buzz-multithreaded", "question__hide": false, - "total_acs": 23915, - "total_submitted": 36735, - "total_column_articles": 393, + "total_acs": 24116, + "total_submitted": 37010, + "total_column_articles": 394, "frontend_question_id": "1195", "is_new_question": false }, @@ -47682,9 +48144,9 @@ "question__title": "Count Ways to Build Rooms in an Ant Colony", "question__title_slug": "count-ways-to-build-rooms-in-an-ant-colony", "question__hide": false, - "total_acs": 2347, - "total_submitted": 4214, - "total_column_articles": 34, + "total_acs": 2377, + "total_submitted": 4257, + "total_column_articles": 35, "frontend_question_id": "1916", "is_new_question": false }, @@ -47703,8 +48165,8 @@ "question__title": "Count Artifacts That Can Be Extracted", "question__title_slug": "count-artifacts-that-can-be-extracted", "question__hide": false, - "total_acs": 9091, - "total_submitted": 18196, + "total_acs": 9111, + "total_submitted": 18231, "total_column_articles": 143, "frontend_question_id": "2201", "is_new_question": false @@ -47724,8 +48186,8 @@ "question__title": "Largest Magic Square", "question__title_slug": "largest-magic-square", "question__hide": false, - "total_acs": 3684, - "total_submitted": 6493, + "total_acs": 3739, + "total_submitted": 6572, "total_column_articles": 65, "frontend_question_id": "1895", "is_new_question": false @@ -47745,8 +48207,8 @@ "question__title": "Watering Plants", "question__title_slug": "watering-plants", "question__hide": false, - "total_acs": 28352, - "total_submitted": 34425, + "total_acs": 28642, + "total_submitted": 34792, "total_column_articles": 354, "frontend_question_id": "2079", "is_new_question": false @@ -47766,9 +48228,9 @@ "question__title": "Sort Items by Groups Respecting Dependencies", "question__title_slug": "sort-items-by-groups-respecting-dependencies", "question__hide": false, - "total_acs": 15063, - "total_submitted": 24849, - "total_column_articles": 187, + "total_acs": 15124, + "total_submitted": 24951, + "total_column_articles": 188, "frontend_question_id": "1203", "is_new_question": false }, @@ -47787,9 +48249,9 @@ "question__title": "Smallest String With Swaps", "question__title_slug": "smallest-string-with-swaps", "question__hide": false, - "total_acs": 33847, - "total_submitted": 65229, - "total_column_articles": 391, + "total_acs": 33940, + "total_submitted": 65375, + "total_column_articles": 393, "frontend_question_id": "1202", "is_new_question": false }, @@ -47808,9 +48270,9 @@ "question__title": "Ugly Number III", "question__title_slug": "ugly-number-iii", "question__hide": false, - "total_acs": 13980, - "total_submitted": 47640, - "total_column_articles": 175, + "total_acs": 14146, + "total_submitted": 48135, + "total_column_articles": 178, "frontend_question_id": "1201", "is_new_question": false }, @@ -47829,8 +48291,8 @@ "question__title": "Minimum Absolute Difference", "question__title_slug": "minimum-absolute-difference", "question__hide": false, - "total_acs": 61690, - "total_submitted": 85296, + "total_acs": 61864, + "total_submitted": 85520, "total_column_articles": 655, "frontend_question_id": "1200", "is_new_question": false @@ -47850,8 +48312,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": 22420, - "total_submitted": 32797, + "total_acs": 22719, + "total_submitted": 33311, "total_column_articles": 257, "frontend_question_id": "1944", "is_new_question": false @@ -47871,9 +48333,9 @@ "question__title": "Longest Happy String", "question__title_slug": "longest-happy-string", "question__hide": false, - "total_acs": 30860, - "total_submitted": 48661, - "total_column_articles": 529, + "total_acs": 30923, + "total_submitted": 48757, + "total_column_articles": 530, "frontend_question_id": "1405", "is_new_question": false }, @@ -47892,9 +48354,9 @@ "question__title": "Minimum Moves to Reach Target Score", "question__title_slug": "minimum-moves-to-reach-target-score", "question__hide": false, - "total_acs": 10173, - "total_submitted": 19546, - "total_column_articles": 173, + "total_acs": 10224, + "total_submitted": 19618, + "total_column_articles": 175, "frontend_question_id": "2139", "is_new_question": false }, @@ -47913,9 +48375,9 @@ "question__title": "Delete Characters to Make Fancy String", "question__title_slug": "delete-characters-to-make-fancy-string", "question__hide": false, - "total_acs": 13341, - "total_submitted": 21744, - "total_column_articles": 171, + "total_acs": 13538, + "total_submitted": 22039, + "total_column_articles": 172, "frontend_question_id": "1957", "is_new_question": false }, @@ -47934,9 +48396,9 @@ "question__title": "Reformat Department Table", "question__title_slug": "reformat-department-table", "question__hide": false, - "total_acs": 54086, - "total_submitted": 82653, - "total_column_articles": 310, + "total_acs": 54485, + "total_submitted": 83161, + "total_column_articles": 313, "frontend_question_id": "1179", "is_new_question": false }, @@ -47955,9 +48417,9 @@ "question__title": "Critical Connections in a Network", "question__title_slug": "critical-connections-in-a-network", "question__hide": false, - "total_acs": 9958, - "total_submitted": 17966, - "total_column_articles": 126, + "total_acs": 10027, + "total_submitted": 18076, + "total_column_articles": 127, "frontend_question_id": "1192", "is_new_question": false }, @@ -47976,9 +48438,9 @@ "question__title": "K-Concatenation Maximum Sum", "question__title_slug": "k-concatenation-maximum-sum", "question__hide": false, - "total_acs": 10473, - "total_submitted": 38411, - "total_column_articles": 163, + "total_acs": 10748, + "total_submitted": 39374, + "total_column_articles": 166, "frontend_question_id": "1191", "is_new_question": false }, @@ -47997,9 +48459,9 @@ "question__title": "Reverse Substrings Between Each Pair of Parentheses", "question__title_slug": "reverse-substrings-between-each-pair-of-parentheses", "question__hide": false, - "total_acs": 64571, - "total_submitted": 99419, - "total_column_articles": 773, + "total_acs": 64848, + "total_submitted": 99810, + "total_column_articles": 775, "frontend_question_id": "1190", "is_new_question": false }, @@ -48018,9 +48480,9 @@ "question__title": "Maximum Number of Balloons", "question__title_slug": "maximum-number-of-balloons", "question__hide": false, - "total_acs": 63141, - "total_submitted": 92708, - "total_column_articles": 852, + "total_acs": 63337, + "total_submitted": 92973, + "total_column_articles": 857, "frontend_question_id": "1189", "is_new_question": false }, @@ -48039,9 +48501,9 @@ "question__title": "Kth Ancestor of a Tree Node", "question__title_slug": "kth-ancestor-of-a-tree-node", "question__hide": false, - "total_acs": 27420, - "total_submitted": 55774, - "total_column_articles": 217, + "total_acs": 27536, + "total_submitted": 55994, + "total_column_articles": 219, "frontend_question_id": "1483", "is_new_question": false }, @@ -48060,8 +48522,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": 20388, - "total_submitted": 32067, + "total_acs": 20590, + "total_submitted": 32423, "total_column_articles": 193, "frontend_question_id": "1954", "is_new_question": false @@ -48081,9 +48543,9 @@ "question__title": "Range Frequency Queries", "question__title_slug": "range-frequency-queries", "question__hide": false, - "total_acs": 9825, - "total_submitted": 30196, - "total_column_articles": 193, + "total_acs": 10113, + "total_submitted": 30653, + "total_column_articles": 195, "frontend_question_id": "2080", "is_new_question": false }, @@ -48102,9 +48564,9 @@ "question__title": "Three Consecutive Odds", "question__title_slug": "three-consecutive-odds", "question__hide": false, - "total_acs": 33280, - "total_submitted": 50699, - "total_column_articles": 420, + "total_acs": 33524, + "total_submitted": 51049, + "total_column_articles": 424, "frontend_question_id": "1550", "is_new_question": false }, @@ -48123,9 +48585,9 @@ "question__title": "Immediate Food Delivery II", "question__title_slug": "immediate-food-delivery-ii", "question__hide": false, - "total_acs": 32431, - "total_submitted": 61375, - "total_column_articles": 280, + "total_acs": 33989, + "total_submitted": 64255, + "total_column_articles": 295, "frontend_question_id": "1174", "is_new_question": false }, @@ -48144,8 +48606,8 @@ "question__title": "Immediate Food Delivery I", "question__title_slug": "immediate-food-delivery-i", "question__hide": false, - "total_acs": 26488, - "total_submitted": 34701, + "total_acs": 26699, + "total_submitted": 34966, "total_column_articles": 169, "frontend_question_id": "1173", "is_new_question": false @@ -48165,8 +48627,8 @@ "question__title": "Make Array Strictly Increasing", "question__title_slug": "make-array-strictly-increasing", "question__hide": false, - "total_acs": 15330, - "total_submitted": 25816, + "total_acs": 15389, + "total_submitted": 25898, "total_column_articles": 128, "frontend_question_id": "1187", "is_new_question": false @@ -48186,9 +48648,9 @@ "question__title": "Day of the Week", "question__title_slug": "day-of-the-week", "question__hide": false, - "total_acs": 53839, - "total_submitted": 84442, - "total_column_articles": 622, + "total_acs": 54120, + "total_submitted": 84887, + "total_column_articles": 623, "frontend_question_id": "1185", "is_new_question": false }, @@ -48207,8 +48669,8 @@ "question__title": "Maximum Subarray Sum with One Deletion", "question__title_slug": "maximum-subarray-sum-with-one-deletion", "question__hide": false, - "total_acs": 29686, - "total_submitted": 61205, + "total_acs": 29825, + "total_submitted": 61411, "total_column_articles": 290, "frontend_question_id": "1186", "is_new_question": false @@ -48228,9 +48690,9 @@ "question__title": "Distance Between Bus Stops", "question__title_slug": "distance-between-bus-stops", "question__hide": false, - "total_acs": 44625, - "total_submitted": 72463, - "total_column_articles": 648, + "total_acs": 44755, + "total_submitted": 72649, + "total_column_articles": 650, "frontend_question_id": "1184", "is_new_question": false }, @@ -48249,8 +48711,8 @@ "question__title": "Constrained Subsequence Sum", "question__title_slug": "constrained-subsequence-sum", "question__hide": false, - "total_acs": 7836, - "total_submitted": 16136, + "total_acs": 7899, + "total_submitted": 16257, "total_column_articles": 129, "frontend_question_id": "1425", "is_new_question": false @@ -48270,9 +48732,9 @@ "question__title": "Balance a Binary Search Tree", "question__title_slug": "balance-a-binary-search-tree", "question__hide": false, - "total_acs": 29035, - "total_submitted": 39153, - "total_column_articles": 322, + "total_acs": 29464, + "total_submitted": 39655, + "total_column_articles": 323, "frontend_question_id": "1382", "is_new_question": false }, @@ -48291,8 +48753,8 @@ "question__title": "Four Divisors", "question__title_slug": "four-divisors", "question__hide": false, - "total_acs": 10504, - "total_submitted": 26346, + "total_acs": 10587, + "total_submitted": 26468, "total_column_articles": 156, "frontend_question_id": "1390", "is_new_question": false @@ -48312,9 +48774,9 @@ "question__title": "Reformat Date", "question__title_slug": "reformat-date", "question__hide": false, - "total_acs": 17182, - "total_submitted": 28695, - "total_column_articles": 229, + "total_acs": 17283, + "total_submitted": 28818, + "total_column_articles": 230, "frontend_question_id": "1507", "is_new_question": false }, @@ -48333,8 +48795,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": 20919, - "total_submitted": 44691, + "total_acs": 20941, + "total_submitted": 44723, "total_column_articles": 203, "frontend_question_id": "1178", "is_new_question": false @@ -48354,9 +48816,9 @@ "question__title": "Can Make Palindrome from Substring", "question__title_slug": "can-make-palindrome-from-substring", "question__hide": false, - "total_acs": 24225, - "total_submitted": 56856, - "total_column_articles": 250, + "total_acs": 25545, + "total_submitted": 58441, + "total_column_articles": 255, "frontend_question_id": "1177", "is_new_question": false }, @@ -48375,8 +48837,8 @@ "question__title": "Diet Plan Performance", "question__title_slug": "diet-plan-performance", "question__hide": false, - "total_acs": 6333, - "total_submitted": 12838, + "total_acs": 6357, + "total_submitted": 12871, "total_column_articles": 103, "frontend_question_id": "1176", "is_new_question": false @@ -48396,8 +48858,8 @@ "question__title": "Prime Arrangements", "question__title_slug": "prime-arrangements", "question__hide": false, - "total_acs": 34470, - "total_submitted": 60831, + "total_acs": 34577, + "total_submitted": 61001, "total_column_articles": 393, "frontend_question_id": "1175", "is_new_question": false @@ -48417,9 +48879,9 @@ "question__title": "Product Price at a Given Date", "question__title_slug": "product-price-at-a-given-date", "question__hide": false, - "total_acs": 33411, - "total_submitted": 59043, - "total_column_articles": 340, + "total_acs": 34621, + "total_submitted": 61198, + "total_column_articles": 356, "frontend_question_id": "1164", "is_new_question": false }, @@ -48438,8 +48900,8 @@ "question__title": "Largest Multiple of Three", "question__title_slug": "largest-multiple-of-three", "question__hide": false, - "total_acs": 8770, - "total_submitted": 24187, + "total_acs": 8856, + "total_submitted": 24398, "total_column_articles": 145, "frontend_question_id": "1363", "is_new_question": false @@ -48459,8 +48921,8 @@ "question__title": "Closest Divisors", "question__title_slug": "closest-divisors", "question__hide": false, - "total_acs": 8957, - "total_submitted": 16123, + "total_acs": 9051, + "total_submitted": 16236, "total_column_articles": 104, "frontend_question_id": "1362", "is_new_question": false @@ -48480,9 +48942,9 @@ "question__title": "Validate Binary Tree Nodes", "question__title_slug": "validate-binary-tree-nodes", "question__hide": false, - "total_acs": 13803, - "total_submitted": 34558, - "total_column_articles": 320, + "total_acs": 13893, + "total_submitted": 34755, + "total_column_articles": 321, "frontend_question_id": "1361", "is_new_question": false }, @@ -48501,8 +48963,8 @@ "question__title": "Number of Days Between Two Dates", "question__title_slug": "number-of-days-between-two-dates", "question__hide": false, - "total_acs": 17357, - "total_submitted": 33547, + "total_acs": 17496, + "total_submitted": 33773, "total_column_articles": 259, "frontend_question_id": "1360", "is_new_question": false @@ -48522,9 +48984,9 @@ "question__title": "Compare Strings by Frequency of the Smallest Character", "question__title_slug": "compare-strings-by-frequency-of-the-smallest-character", "question__hide": false, - "total_acs": 33579, - "total_submitted": 50609, - "total_column_articles": 441, + "total_acs": 33788, + "total_submitted": 50930, + "total_column_articles": 443, "frontend_question_id": "1170", "is_new_question": false }, @@ -48543,9 +49005,9 @@ "question__title": "Invalid Transactions", "question__title_slug": "invalid-transactions", "question__hide": false, - "total_acs": 10154, - "total_submitted": 30323, - "total_column_articles": 120, + "total_acs": 10187, + "total_submitted": 30429, + "total_column_articles": 121, "frontend_question_id": "1169", "is_new_question": false }, @@ -48564,8 +49026,8 @@ "question__title": "Web Crawler", "question__title_slug": "web-crawler", "question__hide": false, - "total_acs": 2408, - "total_submitted": 4187, + "total_acs": 2447, + "total_submitted": 4255, "total_column_articles": 47, "frontend_question_id": "1236", "is_new_question": false @@ -48585,8 +49047,8 @@ "question__title": "Dinner Plate Stacks", "question__title_slug": "dinner-plate-stacks", "question__hide": false, - "total_acs": 13964, - "total_submitted": 35448, + "total_acs": 13998, + "total_submitted": 35552, "total_column_articles": 163, "frontend_question_id": "1172", "is_new_question": false @@ -48606,9 +49068,9 @@ "question__title": "Market Analysis II", "question__title_slug": "market-analysis-ii", "question__hide": false, - "total_acs": 8169, - "total_submitted": 16171, - "total_column_articles": 141, + "total_acs": 8233, + "total_submitted": 16267, + "total_column_articles": 142, "frontend_question_id": "1159", "is_new_question": false }, @@ -48627,9 +49089,9 @@ "question__title": "Market Analysis I", "question__title_slug": "market-analysis-i", "question__hide": false, - "total_acs": 44890, - "total_submitted": 82553, - "total_column_articles": 334, + "total_acs": 45287, + "total_submitted": 83232, + "total_column_articles": 338, "frontend_question_id": "1158", "is_new_question": false }, @@ -48648,9 +49110,9 @@ "question__title": "Remove Zero Sum Consecutive Nodes from Linked List", "question__title_slug": "remove-zero-sum-consecutive-nodes-from-linked-list", "question__hide": false, - "total_acs": 36586, - "total_submitted": 68997, - "total_column_articles": 354, + "total_acs": 36657, + "total_submitted": 69123, + "total_column_articles": 355, "frontend_question_id": "1171", "is_new_question": false }, @@ -48669,9 +49131,9 @@ "question__title": "Maximum Number of Words You Can Type", "question__title_slug": "maximum-number-of-words-you-can-type", "question__hide": false, - "total_acs": 16084, - "total_submitted": 22586, - "total_column_articles": 263, + "total_acs": 16163, + "total_submitted": 22682, + "total_column_articles": 265, "frontend_question_id": "1935", "is_new_question": false }, @@ -48690,9 +49152,9 @@ "question__title": "Number of Dice Rolls With Target Sum", "question__title_slug": "number-of-dice-rolls-with-target-sum", "question__hide": false, - "total_acs": 44847, - "total_submitted": 70898, - "total_column_articles": 343, + "total_acs": 45160, + "total_submitted": 71277, + "total_column_articles": 345, "frontend_question_id": "1155", "is_new_question": false }, @@ -48711,9 +49173,9 @@ "question__title": "Online Majority Element In Subarray", "question__title_slug": "online-majority-element-in-subarray", "question__hide": false, - "total_acs": 14698, - "total_submitted": 31819, - "total_column_articles": 131, + "total_acs": 14817, + "total_submitted": 32033, + "total_column_articles": 133, "frontend_question_id": "1157", "is_new_question": false }, @@ -48732,9 +49194,9 @@ "question__title": "Swap For Longest Repeated Character Substring", "question__title_slug": "swap-for-longest-repeated-character-substring", "question__hide": false, - "total_acs": 23719, - "total_submitted": 46286, - "total_column_articles": 321, + "total_acs": 23764, + "total_submitted": 46397, + "total_column_articles": 322, "frontend_question_id": "1156", "is_new_question": false }, @@ -48753,9 +49215,9 @@ "question__title": "Day of the Year", "question__title_slug": "day-of-the-year", "question__hide": false, - "total_acs": 74039, - "total_submitted": 117575, - "total_column_articles": 756, + "total_acs": 74627, + "total_submitted": 118626, + "total_column_articles": 759, "frontend_question_id": "1154", "is_new_question": false }, @@ -48774,9 +49236,9 @@ "question__title": "Article Views II", "question__title_slug": "article-views-ii", "question__hide": false, - "total_acs": 11745, - "total_submitted": 26505, - "total_column_articles": 80, + "total_acs": 11825, + "total_submitted": 26728, + "total_column_articles": 83, "frontend_question_id": "1149", "is_new_question": false }, @@ -48795,9 +49257,9 @@ "question__title": "Article Views I", "question__title_slug": "article-views-i", "question__hide": false, - "total_acs": 110274, - "total_submitted": 154854, - "total_column_articles": 314, + "total_acs": 113899, + "total_submitted": 159697, + "total_column_articles": 322, "frontend_question_id": "1148", "is_new_question": false }, @@ -48816,8 +49278,8 @@ "question__title": "Rank Transform of a Matrix", "question__title_slug": "rank-transform-of-a-matrix", "question__hide": false, - "total_acs": 10733, - "total_submitted": 18849, + "total_acs": 10747, + "total_submitted": 18875, "total_column_articles": 98, "frontend_question_id": "1632", "is_new_question": false @@ -48837,9 +49299,9 @@ "question__title": "Rank Transform of an Array", "question__title_slug": "rank-transform-of-an-array", "question__hide": false, - "total_acs": 49052, - "total_submitted": 81343, - "total_column_articles": 551, + "total_acs": 49198, + "total_submitted": 81581, + "total_column_articles": 553, "frontend_question_id": "1331", "is_new_question": false }, @@ -48858,8 +49320,8 @@ "question__title": "Reverse Subarray To Maximize Array Value", "question__title_slug": "reverse-subarray-to-maximize-array-value", "question__hide": false, - "total_acs": 11038, - "total_submitted": 19369, + "total_acs": 11054, + "total_submitted": 19395, "total_column_articles": 85, "frontend_question_id": "1330", "is_new_question": false @@ -48879,9 +49341,9 @@ "question__title": "Deepest Leaves Sum", "question__title_slug": "deepest-leaves-sum", "question__hide": false, - "total_acs": 67147, - "total_submitted": 78586, - "total_column_articles": 802, + "total_acs": 67345, + "total_submitted": 78807, + "total_column_articles": 803, "frontend_question_id": "1302", "is_new_question": false }, @@ -48900,8 +49362,8 @@ "question__title": "Sort the Matrix Diagonally", "question__title_slug": "sort-the-matrix-diagonally", "question__hide": false, - "total_acs": 27329, - "total_submitted": 33737, + "total_acs": 27490, + "total_submitted": 33929, "total_column_articles": 393, "frontend_question_id": "1329", "is_new_question": false @@ -48921,9 +49383,9 @@ "question__title": "Break a Palindrome", "question__title_slug": "break-a-palindrome", "question__hide": false, - "total_acs": 10532, - "total_submitted": 22208, - "total_column_articles": 177, + "total_acs": 10620, + "total_submitted": 22400, + "total_column_articles": 179, "frontend_question_id": "1328", "is_new_question": false }, @@ -48942,8 +49404,8 @@ "question__title": "Longest Chunked Palindrome Decomposition", "question__title_slug": "longest-chunked-palindrome-decomposition", "question__hide": false, - "total_acs": 24321, - "total_submitted": 41464, + "total_acs": 24370, + "total_submitted": 41554, "total_column_articles": 370, "frontend_question_id": "1147", "is_new_question": false @@ -48963,9 +49425,9 @@ "question__title": "Longest Common Subsequence", "question__title_slug": "longest-common-subsequence", "question__hide": false, - "total_acs": 457092, - "total_submitted": 700918, - "total_column_articles": 2152, + "total_acs": 464231, + "total_submitted": 711214, + "total_column_articles": 2163, "frontend_question_id": "1143", "is_new_question": false }, @@ -48984,9 +49446,9 @@ "question__title": "Snapshot Array", "question__title_slug": "snapshot-array", "question__hide": false, - "total_acs": 26070, - "total_submitted": 70130, - "total_column_articles": 213, + "total_acs": 26219, + "total_submitted": 70523, + "total_column_articles": 212, "frontend_question_id": "1146", "is_new_question": false }, @@ -49005,8 +49467,8 @@ "question__title": "Binary Tree Coloring Game", "question__title_slug": "binary-tree-coloring-game", "question__hide": false, - "total_acs": 27431, - "total_submitted": 49559, + "total_acs": 27468, + "total_submitted": 49632, "total_column_articles": 386, "frontend_question_id": "1145", "is_new_question": false @@ -49026,9 +49488,9 @@ "question__title": "Decrease Elements To Make Array Zigzag", "question__title_slug": "decrease-elements-to-make-array-zigzag", "question__hide": false, - "total_acs": 33177, - "total_submitted": 65542, - "total_column_articles": 343, + "total_acs": 33247, + "total_submitted": 65666, + "total_column_articles": 345, "frontend_question_id": "1144", "is_new_question": false }, @@ -49047,8 +49509,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": 13706, - "total_submitted": 37264, + "total_acs": 13754, + "total_submitted": 37455, "total_column_articles": 86, "frontend_question_id": "1142", "is_new_question": false @@ -49068,9 +49530,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": 77524, - "total_submitted": 170748, - "total_column_articles": 428, + "total_acs": 79266, + "total_submitted": 174282, + "total_column_articles": 430, "frontend_question_id": "1141", "is_new_question": false }, @@ -49089,8 +49551,8 @@ "question__title": "Distinct Echo Substrings", "question__title_slug": "distinct-echo-substrings", "question__hide": false, - "total_acs": 5935, - "total_submitted": 11893, + "total_acs": 5969, + "total_submitted": 11941, "total_column_articles": 97, "frontend_question_id": "1316", "is_new_question": false @@ -49110,9 +49572,9 @@ "question__title": "Sum of Nodes with Even-Valued Grandparent", "question__title_slug": "sum-of-nodes-with-even-valued-grandparent", "question__hide": false, - "total_acs": 20017, - "total_submitted": 24485, - "total_column_articles": 396, + "total_acs": 20132, + "total_submitted": 24618, + "total_column_articles": 399, "frontend_question_id": "1315", "is_new_question": false }, @@ -49131,9 +49593,9 @@ "question__title": "Matrix Block Sum", "question__title_slug": "matrix-block-sum", "question__hide": false, - "total_acs": 27324, - "total_submitted": 36498, - "total_column_articles": 397, + "total_acs": 27582, + "total_submitted": 36843, + "total_column_articles": 400, "frontend_question_id": "1314", "is_new_question": false }, @@ -49152,8 +49614,8 @@ "question__title": "Decompress Run-Length Encoded List", "question__title_slug": "decompress-run-length-encoded-list", "question__hide": false, - "total_acs": 46189, - "total_submitted": 55495, + "total_acs": 46291, + "total_submitted": 55613, "total_column_articles": 672, "frontend_question_id": "1313", "is_new_question": false @@ -49173,8 +49635,8 @@ "question__title": "Stone Game II", "question__title_slug": "stone-game-ii", "question__hide": false, - "total_acs": 27004, - "total_submitted": 38392, + "total_acs": 27108, + "total_submitted": 38543, "total_column_articles": 230, "frontend_question_id": "1140", "is_new_question": false @@ -49194,8 +49656,8 @@ "question__title": "Largest 1-Bordered Square", "question__title_slug": "largest-1-bordered-square", "question__hide": false, - "total_acs": 33326, - "total_submitted": 59359, + "total_acs": 33429, + "total_submitted": 59532, "total_column_articles": 383, "frontend_question_id": "1139", "is_new_question": false @@ -49215,9 +49677,9 @@ "question__title": "Alphabet Board Path", "question__title_slug": "alphabet-board-path", "question__hide": false, - "total_acs": 26927, - "total_submitted": 52000, - "total_column_articles": 447, + "total_acs": 26964, + "total_submitted": 52077, + "total_column_articles": 448, "frontend_question_id": "1138", "is_new_question": false }, @@ -49236,9 +49698,9 @@ "question__title": "Reported Posts II", "question__title_slug": "reported-posts-ii", "question__hide": false, - "total_acs": 10261, - "total_submitted": 27102, - "total_column_articles": 89, + "total_acs": 10325, + "total_submitted": 27312, + "total_column_articles": 90, "frontend_question_id": "1132", "is_new_question": false }, @@ -49257,9 +49719,9 @@ "question__title": "N-th Tribonacci Number", "question__title_slug": "n-th-tribonacci-number", "question__hide": false, - "total_acs": 203698, - "total_submitted": 334412, - "total_column_articles": 1635, + "total_acs": 205731, + "total_submitted": 337776, + "total_column_articles": 1640, "frontend_question_id": "1137", "is_new_question": false }, @@ -49278,9 +49740,9 @@ "question__title": "Number of Paths with Max Score", "question__title_slug": "number-of-paths-with-max-score", "question__hide": false, - "total_acs": 8865, - "total_submitted": 23026, - "total_column_articles": 169, + "total_acs": 9046, + "total_submitted": 23462, + "total_column_articles": 173, "frontend_question_id": "1301", "is_new_question": false }, @@ -49299,8 +49761,8 @@ "question__title": "Number of Ships in a Rectangle", "question__title_slug": "number-of-ships-in-a-rectangle", "question__hide": false, - "total_acs": 2116, - "total_submitted": 3187, + "total_acs": 2124, + "total_submitted": 3198, "total_column_articles": 42, "frontend_question_id": "1274", "is_new_question": false @@ -49320,8 +49782,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": 32655, - "total_submitted": 69637, + "total_acs": 32727, + "total_submitted": 69795, "total_column_articles": 464, "frontend_question_id": "1300", "is_new_question": false @@ -49341,9 +49803,9 @@ "question__title": "Replace Elements with Greatest Element on Right Side", "question__title_slug": "replace-elements-with-greatest-element-on-right-side", "question__hide": false, - "total_acs": 44149, - "total_submitted": 58293, - "total_column_articles": 582, + "total_acs": 44284, + "total_submitted": 58507, + "total_column_articles": 586, "frontend_question_id": "1299", "is_new_question": false }, @@ -49362,9 +49824,9 @@ "question__title": "Maximum of Absolute Value Expression", "question__title_slug": "maximum-of-absolute-value-expression", "question__hide": false, - "total_acs": 5294, - "total_submitted": 11036, - "total_column_articles": 77, + "total_acs": 5329, + "total_submitted": 11092, + "total_column_articles": 78, "frontend_question_id": "1131", "is_new_question": false }, @@ -49383,9 +49845,9 @@ "question__title": "Shortest Path with Alternating Colors", "question__title_slug": "shortest-path-with-alternating-colors", "question__hide": false, - "total_acs": 31504, - "total_submitted": 65719, - "total_column_articles": 423, + "total_acs": 31723, + "total_submitted": 66179, + "total_column_articles": 424, "frontend_question_id": "1129", "is_new_question": false }, @@ -49404,8 +49866,8 @@ "question__title": "Minimum Cost Tree From Leaf Values", "question__title_slug": "minimum-cost-tree-from-leaf-values", "question__hide": false, - "total_acs": 22032, - "total_submitted": 31174, + "total_acs": 22091, + "total_submitted": 31259, "total_column_articles": 261, "frontend_question_id": "1130", "is_new_question": false @@ -49425,9 +49887,9 @@ "question__title": "Number of Equivalent Domino Pairs", "question__title_slug": "number-of-equivalent-domino-pairs", "question__hide": false, - "total_acs": 46495, - "total_submitted": 85473, - "total_column_articles": 562, + "total_acs": 46601, + "total_submitted": 85661, + "total_column_articles": 564, "frontend_question_id": "1128", "is_new_question": false }, @@ -49446,9 +49908,9 @@ "question__title": "User Purchase Platform", "question__title_slug": "user-purchase-platform", "question__hide": false, - "total_acs": 8869, - "total_submitted": 20565, - "total_column_articles": 120, + "total_acs": 8946, + "total_submitted": 20735, + "total_column_articles": 121, "frontend_question_id": "1127", "is_new_question": false }, @@ -49467,9 +49929,9 @@ "question__title": "Active Businesses", "question__title_slug": "active-businesses", "question__hide": false, - "total_acs": 15256, - "total_submitted": 22670, - "total_column_articles": 162, + "total_acs": 15345, + "total_submitted": 22830, + "total_column_articles": 163, "frontend_question_id": "1126", "is_new_question": false }, @@ -49488,9 +49950,9 @@ "question__title": "Minimum Falling Path Sum II", "question__title_slug": "minimum-falling-path-sum-ii", "question__hide": false, - "total_acs": 38127, - "total_submitted": 62134, - "total_column_articles": 348, + "total_acs": 38418, + "total_submitted": 62607, + "total_column_articles": 349, "frontend_question_id": "1289", "is_new_question": false }, @@ -49509,9 +49971,9 @@ "question__title": "Graph Connectivity With Threshold", "question__title_slug": "graph-connectivity-with-threshold", "question__hide": false, - "total_acs": 4621, - "total_submitted": 10778, - "total_column_articles": 68, + "total_acs": 4682, + "total_submitted": 10854, + "total_column_articles": 69, "frontend_question_id": "1627", "is_new_question": false }, @@ -49530,9 +49992,9 @@ "question__title": "Remove Covered Intervals", "question__title_slug": "remove-covered-intervals", "question__hide": false, - "total_acs": 31636, - "total_submitted": 56317, - "total_column_articles": 303, + "total_acs": 31824, + "total_submitted": 56641, + "total_column_articles": 305, "frontend_question_id": "1288", "is_new_question": false }, @@ -49551,9 +50013,9 @@ "question__title": "Element Appearing More Than 25% In Sorted Array", "question__title_slug": "element-appearing-more-than-25-in-sorted-array", "question__hide": false, - "total_acs": 28273, - "total_submitted": 48491, - "total_column_articles": 376, + "total_acs": 28465, + "total_submitted": 48831, + "total_column_articles": 377, "frontend_question_id": "1287", "is_new_question": false }, @@ -49572,9 +50034,9 @@ "question__title": "Smallest Sufficient Team", "question__title_slug": "smallest-sufficient-team", "question__hide": false, - "total_acs": 17189, - "total_submitted": 28380, - "total_column_articles": 156, + "total_acs": 17244, + "total_submitted": 28463, + "total_column_articles": 159, "frontend_question_id": "1125", "is_new_question": false }, @@ -49593,9 +50055,9 @@ "question__title": "Longest Well-Performing Interval", "question__title_slug": "longest-well-performing-interval", "question__hide": false, - "total_acs": 46885, - "total_submitted": 117451, - "total_column_articles": 388, + "total_acs": 47297, + "total_submitted": 118251, + "total_column_articles": 393, "frontend_question_id": "1124", "is_new_question": false }, @@ -49614,9 +50076,9 @@ "question__title": "Lowest Common Ancestor of Deepest Leaves", "question__title_slug": "lowest-common-ancestor-of-deepest-leaves", "question__hide": false, - "total_acs": 34710, - "total_submitted": 45270, - "total_column_articles": 313, + "total_acs": 34870, + "total_submitted": 45441, + "total_column_articles": 315, "frontend_question_id": "1123", "is_new_question": false }, @@ -49635,9 +50097,9 @@ "question__title": "Relative Sort Array", "question__title_slug": "relative-sort-array", "question__hide": false, - "total_acs": 94610, - "total_submitted": 133726, - "total_column_articles": 1189, + "total_acs": 94918, + "total_submitted": 134149, + "total_column_articles": 1194, "frontend_question_id": "1122", "is_new_question": false }, @@ -49656,9 +50118,9 @@ "question__title": "Print Zero Even Odd", "question__title_slug": "print-zero-even-odd", "question__hide": false, - "total_acs": 38653, - "total_submitted": 69871, - "total_column_articles": 506, + "total_acs": 38879, + "total_submitted": 70213, + "total_column_articles": 509, "frontend_question_id": "1116", "is_new_question": false }, @@ -49677,9 +50139,9 @@ "question__title": "Reported Posts", "question__title_slug": "reported-posts", "question__hide": false, - "total_acs": 13829, - "total_submitted": 25665, - "total_column_articles": 82, + "total_acs": 13886, + "total_submitted": 25770, + "total_column_articles": 83, "frontend_question_id": "1113", "is_new_question": false }, @@ -49698,9 +50160,9 @@ "question__title": "Highest Grade For Each Student", "question__title_slug": "highest-grade-for-each-student", "question__hide": false, - "total_acs": 24748, - "total_submitted": 38630, - "total_column_articles": 196, + "total_acs": 25098, + "total_submitted": 39170, + "total_column_articles": 197, "frontend_question_id": "1112", "is_new_question": false }, @@ -49719,8 +50181,8 @@ "question__title": "Handshakes That Don't Cross", "question__title_slug": "handshakes-that-dont-cross", "question__hide": false, - "total_acs": 4420, - "total_submitted": 8268, + "total_acs": 4454, + "total_submitted": 8325, "total_column_articles": 79, "frontend_question_id": "1259", "is_new_question": false @@ -49740,9 +50202,9 @@ "question__title": "Sequential Digits", "question__title_slug": "sequential-digits", "question__hide": false, - "total_acs": 12079, - "total_submitted": 22081, - "total_column_articles": 230, + "total_acs": 12135, + "total_submitted": 22158, + "total_column_articles": 231, "frontend_question_id": "1291", "is_new_question": false }, @@ -49761,8 +50223,8 @@ "question__title": "Iterator for Combination", "question__title_slug": "iterator-for-combination", "question__hide": false, - "total_acs": 7827, - "total_submitted": 11920, + "total_acs": 7861, + "total_submitted": 11969, "total_column_articles": 151, "frontend_question_id": "1286", "is_new_question": false @@ -49782,9 +50244,9 @@ "question__title": "Mean of Array After Removing Some Elements", "question__title_slug": "mean-of-array-after-removing-some-elements", "question__hide": false, - "total_acs": 47343, - "total_submitted": 65808, - "total_column_articles": 467, + "total_acs": 47462, + "total_submitted": 65937, + "total_column_articles": 468, "frontend_question_id": "1619", "is_new_question": false }, @@ -49803,9 +50265,9 @@ "question__title": "Design Bounded Blocking Queue", "question__title_slug": "design-bounded-blocking-queue", "question__hide": false, - "total_acs": 5991, - "total_submitted": 8463, - "total_column_articles": 95, + "total_acs": 6046, + "total_submitted": 8541, + "total_column_articles": 96, "frontend_question_id": "1188", "is_new_question": false }, @@ -49824,8 +50286,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": 28744, - "total_submitted": 37419, + "total_acs": 28809, + "total_submitted": 37505, "total_column_articles": 447, "frontend_question_id": "1111", "is_new_question": false @@ -49845,9 +50307,9 @@ "question__title": "Delete Nodes And Return Forest", "question__title_slug": "delete-nodes-and-return-forest", "question__hide": false, - "total_acs": 39923, - "total_submitted": 57483, - "total_column_articles": 539, + "total_acs": 40132, + "total_submitted": 57757, + "total_column_articles": 542, "frontend_question_id": "1110", "is_new_question": false }, @@ -49866,9 +50328,9 @@ "question__title": "Corporate Flight Bookings", "question__title_slug": "corporate-flight-bookings", "question__hide": false, - "total_acs": 125484, - "total_submitted": 194209, - "total_column_articles": 1736, + "total_acs": 126155, + "total_submitted": 195107, + "total_column_articles": 1739, "frontend_question_id": "1109", "is_new_question": false }, @@ -49887,9 +50349,9 @@ "question__title": "Defanging an IP Address", "question__title_slug": "defanging-an-ip-address", "question__hide": false, - "total_acs": 121189, - "total_submitted": 142317, - "total_column_articles": 1047, + "total_acs": 121595, + "total_submitted": 142795, + "total_column_articles": 1048, "frontend_question_id": "1108", "is_new_question": false }, @@ -49908,9 +50370,9 @@ "question__title": "New Users Daily Count", "question__title_slug": "new-users-daily-count", "question__hide": false, - "total_acs": 14515, - "total_submitted": 35598, - "total_column_articles": 147, + "total_acs": 14607, + "total_submitted": 35810, + "total_column_articles": 148, "frontend_question_id": "1107", "is_new_question": false }, @@ -49929,9 +50391,9 @@ "question__title": "Print in Order", "question__title_slug": "print-in-order", "question__hide": false, - "total_acs": 123527, - "total_submitted": 188408, - "total_column_articles": 792, + "total_acs": 124146, + "total_submitted": 189224, + "total_column_articles": 793, "frontend_question_id": "1114", "is_new_question": false }, @@ -49950,8 +50412,8 @@ "question__title": "Palindrome Removal", "question__title_slug": "palindrome-removal", "question__hide": false, - "total_acs": 4148, - "total_submitted": 8253, + "total_acs": 4164, + "total_submitted": 8290, "total_column_articles": 62, "frontend_question_id": "1246", "is_new_question": false @@ -49971,8 +50433,8 @@ "question__title": "Delete Tree Nodes", "question__title_slug": "delete-tree-nodes", "question__hide": false, - "total_acs": 2744, - "total_submitted": 4794, + "total_acs": 2748, + "total_submitted": 4798, "total_column_articles": 71, "frontend_question_id": "1273", "is_new_question": false @@ -49992,8 +50454,8 @@ "question__title": "Remove Interval", "question__title_slug": "remove-interval", "question__hide": false, - "total_acs": 4284, - "total_submitted": 7319, + "total_acs": 4379, + "total_submitted": 7450, "total_column_articles": 70, "frontend_question_id": "1272", "is_new_question": false @@ -50013,8 +50475,8 @@ "question__title": "Hexspeak", "question__title_slug": "hexspeak", "question__hide": false, - "total_acs": 3477, - "total_submitted": 6598, + "total_acs": 3487, + "total_submitted": 6612, "total_column_articles": 71, "frontend_question_id": "1271", "is_new_question": false @@ -50034,8 +50496,8 @@ "question__title": "Unpopular Books", "question__title_slug": "unpopular-books", "question__hide": false, - "total_acs": 15118, - "total_submitted": 32495, + "total_acs": 15193, + "total_submitted": 32670, "total_column_articles": 151, "frontend_question_id": "1098", "is_new_question": false @@ -50055,8 +50517,8 @@ "question__title": "Parsing A Boolean Expression", "question__title_slug": "parsing-a-boolean-expression", "question__hide": false, - "total_acs": 27775, - "total_submitted": 40572, + "total_acs": 27832, + "total_submitted": 40681, "total_column_articles": 577, "frontend_question_id": "1106", "is_new_question": false @@ -50076,8 +50538,8 @@ "question__title": "Filling Bookcase Shelves", "question__title_slug": "filling-bookcase-shelves", "question__hide": false, - "total_acs": 22871, - "total_submitted": 33890, + "total_acs": 22982, + "total_submitted": 34019, "total_column_articles": 210, "frontend_question_id": "1105", "is_new_question": false @@ -50097,9 +50559,9 @@ "question__title": "Distribute Candies to People", "question__title_slug": "distribute-candies-to-people", "question__hide": false, - "total_acs": 47485, - "total_submitted": 74016, - "total_column_articles": 1259, + "total_acs": 67116, + "total_submitted": 99251, + "total_column_articles": 1380, "frontend_question_id": "1103", "is_new_question": false }, @@ -50118,9 +50580,9 @@ "question__title": "Path In Zigzag Labelled Binary Tree", "question__title_slug": "path-in-zigzag-labelled-binary-tree", "question__hide": false, - "total_acs": 34213, - "total_submitted": 45141, - "total_column_articles": 797, + "total_acs": 34300, + "total_submitted": 45271, + "total_column_articles": 799, "frontend_question_id": "1104", "is_new_question": false }, @@ -50139,9 +50601,9 @@ "question__title": "Game Play Analysis V", "question__title_slug": "game-play-analysis-v", "question__hide": false, - "total_acs": 13137, - "total_submitted": 25416, - "total_column_articles": 191, + "total_acs": 13238, + "total_submitted": 25604, + "total_column_articles": 193, "frontend_question_id": "1097", "is_new_question": false }, @@ -50160,9 +50622,9 @@ "question__title": "Divide Chocolate", "question__title_slug": "divide-chocolate", "question__hide": false, - "total_acs": 8181, - "total_submitted": 13714, - "total_column_articles": 106, + "total_acs": 8434, + "total_submitted": 14017, + "total_column_articles": 108, "frontend_question_id": "1231", "is_new_question": false }, @@ -50181,8 +50643,8 @@ "question__title": "Synonymous Sentences", "question__title_slug": "synonymous-sentences", "question__hide": false, - "total_acs": 2262, - "total_submitted": 3820, + "total_acs": 2267, + "total_submitted": 3826, "total_column_articles": 79, "frontend_question_id": "1258", "is_new_question": false @@ -50202,8 +50664,8 @@ "question__title": "Smallest Common Region", "question__title_slug": "smallest-common-region", "question__hide": false, - "total_acs": 2990, - "total_submitted": 5003, + "total_acs": 2998, + "total_submitted": 5012, "total_column_articles": 75, "frontend_question_id": "1257", "is_new_question": false @@ -50223,8 +50685,8 @@ "question__title": "Encode Number", "question__title_slug": "encode-number", "question__hide": false, - "total_acs": 2227, - "total_submitted": 3243, + "total_acs": 2231, + "total_submitted": 3251, "total_column_articles": 56, "frontend_question_id": "1256", "is_new_question": false @@ -50244,8 +50706,8 @@ "question__title": "Brace Expansion II", "question__title_slug": "brace-expansion-ii", "question__hide": false, - "total_acs": 15615, - "total_submitted": 21337, + "total_acs": 15638, + "total_submitted": 21369, "total_column_articles": 158, "frontend_question_id": "1096", "is_new_question": false @@ -50265,8 +50727,8 @@ "question__title": "Print FooBar Alternately", "question__title_slug": "print-foobar-alternately", "question__hide": false, - "total_acs": 73626, - "total_submitted": 126971, + "total_acs": 74094, + "total_submitted": 127662, "total_column_articles": 648, "frontend_question_id": "1115", "is_new_question": false @@ -50286,9 +50748,9 @@ "question__title": "Building H2O", "question__title_slug": "building-h2o", "question__hide": false, - "total_acs": 29891, - "total_submitted": 54604, - "total_column_articles": 367, + "total_acs": 30104, + "total_submitted": 54933, + "total_column_articles": 368, "frontend_question_id": "1117", "is_new_question": false }, @@ -50307,8 +50769,8 @@ "question__title": "Find in Mountain Array", "question__title_slug": "find-in-mountain-array", "question__hide": false, - "total_acs": 28959, - "total_submitted": 76538, + "total_acs": 29068, + "total_submitted": 76819, "total_column_articles": 481, "frontend_question_id": "1095", "is_new_question": false @@ -50328,9 +50790,9 @@ "question__title": "Car Pooling", "question__title_slug": "car-pooling", "question__hide": false, - "total_acs": 108452, - "total_submitted": 204053, - "total_column_articles": 1655, + "total_acs": 109123, + "total_submitted": 205271, + "total_column_articles": 1657, "frontend_question_id": "1094", "is_new_question": false }, @@ -50349,8 +50811,8 @@ "question__title": "Statistics from a Large Sample", "question__title_slug": "statistics-from-a-large-sample", "question__hide": false, - "total_acs": 17898, - "total_submitted": 42892, + "total_acs": 17934, + "total_submitted": 42961, "total_column_articles": 213, "frontend_question_id": "1093", "is_new_question": false @@ -50370,9 +50832,9 @@ "question__title": "Game Play Analysis IV", "question__title_slug": "game-play-analysis-iv", "question__hide": false, - "total_acs": 57823, - "total_submitted": 139280, - "total_column_articles": 533, + "total_acs": 59642, + "total_submitted": 143709, + "total_column_articles": 549, "frontend_question_id": "550", "is_new_question": false }, @@ -50391,9 +50853,9 @@ "question__title": "Game Play Analysis III", "question__title_slug": "game-play-analysis-iii", "question__hide": false, - "total_acs": 33536, - "total_submitted": 48204, - "total_column_articles": 226, + "total_acs": 33788, + "total_submitted": 48518, + "total_column_articles": 227, "frontend_question_id": "534", "is_new_question": false }, @@ -50412,8 +50874,8 @@ "question__title": "Game Play Analysis II", "question__title_slug": "game-play-analysis-ii", "question__hide": false, - "total_acs": 40429, - "total_submitted": 74601, + "total_acs": 40657, + "total_submitted": 74996, "total_column_articles": 254, "frontend_question_id": "512", "is_new_question": false @@ -50433,9 +50895,9 @@ "question__title": "Game Play Analysis I", "question__title_slug": "game-play-analysis-i", "question__hide": false, - "total_acs": 117509, - "total_submitted": 165598, - "total_column_articles": 462, + "total_acs": 118971, + "total_submitted": 167565, + "total_column_articles": 464, "frontend_question_id": "511", "is_new_question": false }, @@ -50454,8 +50916,8 @@ "question__title": "Valid Palindrome III", "question__title_slug": "valid-palindrome-iii", "question__hide": false, - "total_acs": 3275, - "total_submitted": 5714, + "total_acs": 3305, + "total_submitted": 5759, "total_column_articles": 60, "frontend_question_id": "1216", "is_new_question": false @@ -50475,8 +50937,8 @@ "question__title": "Tree Diameter", "question__title_slug": "tree-diameter", "question__hide": false, - "total_acs": 7069, - "total_submitted": 12863, + "total_acs": 7119, + "total_submitted": 12962, "total_column_articles": 124, "frontend_question_id": "1245", "is_new_question": false @@ -50496,9 +50958,9 @@ "question__title": "Design A Leaderboard", "question__title_slug": "design-a-leaderboard", "question__hide": false, - "total_acs": 4929, - "total_submitted": 7726, - "total_column_articles": 74, + "total_acs": 4954, + "total_submitted": 7762, + "total_column_articles": 75, "frontend_question_id": "1244", "is_new_question": false }, @@ -50517,8 +50979,8 @@ "question__title": "Array Transformation", "question__title_slug": "array-transformation", "question__hide": false, - "total_acs": 3839, - "total_submitted": 7095, + "total_acs": 3846, + "total_submitted": 7104, "total_column_articles": 91, "frontend_question_id": "1243", "is_new_question": false @@ -50538,9 +51000,9 @@ "question__title": "Sales Analysis III", "question__title_slug": "sales-analysis-iii", "question__hide": false, - "total_acs": 75409, - "total_submitted": 145697, - "total_column_articles": 519, + "total_acs": 77126, + "total_submitted": 148916, + "total_column_articles": 524, "frontend_question_id": "1084", "is_new_question": false }, @@ -50559,8 +51021,8 @@ "question__title": "Sales Analysis II", "question__title_slug": "sales-analysis-ii", "question__hide": false, - "total_acs": 19917, - "total_submitted": 37601, + "total_acs": 19992, + "total_submitted": 37759, "total_column_articles": 172, "frontend_question_id": "1083", "is_new_question": false @@ -50580,8 +51042,8 @@ "question__title": "Sales Analysis I", "question__title_slug": "sales-analysis-i", "question__hide": false, - "total_acs": 20996, - "total_submitted": 27431, + "total_acs": 21073, + "total_submitted": 27551, "total_column_articles": 145, "frontend_question_id": "1082", "is_new_question": false @@ -50601,9 +51063,9 @@ "question__title": "Shortest Path in Binary Matrix", "question__title_slug": "shortest-path-in-binary-matrix", "question__hide": false, - "total_acs": 83288, - "total_submitted": 205098, - "total_column_articles": 748, + "total_acs": 83587, + "total_submitted": 205702, + "total_column_articles": 751, "frontend_question_id": "1091", "is_new_question": false }, @@ -50622,8 +51084,8 @@ "question__title": "Shortest Common Supersequence ", "question__title_slug": "shortest-common-supersequence", "question__hide": false, - "total_acs": 19422, - "total_submitted": 33559, + "total_acs": 19577, + "total_submitted": 33882, "total_column_articles": 179, "frontend_question_id": "1092", "is_new_question": false @@ -50643,9 +51105,9 @@ "question__title": "Largest Values From Labels", "question__title_slug": "largest-values-from-labels", "question__hide": false, - "total_acs": 24889, - "total_submitted": 37150, - "total_column_articles": 333, + "total_acs": 24950, + "total_submitted": 37251, + "total_column_articles": 332, "frontend_question_id": "1090", "is_new_question": false }, @@ -50664,9 +51126,9 @@ "question__title": "Duplicate Zeros", "question__title_slug": "duplicate-zeros", "question__hide": false, - "total_acs": 66286, - "total_submitted": 116387, - "total_column_articles": 833, + "total_acs": 66731, + "total_submitted": 117390, + "total_column_articles": 837, "frontend_question_id": "1089", "is_new_question": false }, @@ -50685,8 +51147,8 @@ "question__title": "Minimum Time to Build Blocks", "question__title_slug": "minimum-time-to-build-blocks", "question__hide": false, - "total_acs": 1194, - "total_submitted": 2547, + "total_acs": 1196, + "total_submitted": 2549, "total_column_articles": 33, "frontend_question_id": "1199", "is_new_question": false @@ -50706,9 +51168,9 @@ "question__title": "Toss Strange Coins", "question__title_slug": "toss-strange-coins", "question__hide": false, - "total_acs": 7143, - "total_submitted": 12951, - "total_column_articles": 120, + "total_acs": 7180, + "total_submitted": 13003, + "total_column_articles": 123, "frontend_question_id": "1230", "is_new_question": false }, @@ -50727,8 +51189,8 @@ "question__title": "Meeting Scheduler", "question__title_slug": "meeting-scheduler", "question__hide": false, - "total_acs": 6789, - "total_submitted": 14510, + "total_acs": 6826, + "total_submitted": 14563, "total_column_articles": 127, "frontend_question_id": "1229", "is_new_question": false @@ -50748,8 +51210,8 @@ "question__title": "Missing Number In Arithmetic Progression", "question__title_slug": "missing-number-in-arithmetic-progression", "question__hide": false, - "total_acs": 5607, - "total_submitted": 10295, + "total_acs": 5694, + "total_submitted": 10451, "total_column_articles": 96, "frontend_question_id": "1228", "is_new_question": false @@ -50769,8 +51231,8 @@ "question__title": "Project Employees III", "question__title_slug": "project-employees-iii", "question__hide": false, - "total_acs": 20737, - "total_submitted": 28960, + "total_acs": 20938, + "total_submitted": 29245, "total_column_articles": 170, "frontend_question_id": "1077", "is_new_question": false @@ -50790,8 +51252,8 @@ "question__title": "Project Employees II", "question__title_slug": "project-employees-ii", "question__hide": false, - "total_acs": 20084, - "total_submitted": 40676, + "total_acs": 20168, + "total_submitted": 40856, "total_column_articles": 141, "frontend_question_id": "1076", "is_new_question": false @@ -50811,9 +51273,9 @@ "question__title": "Project Employees I", "question__title_slug": "project-employees-i", "question__hide": false, - "total_acs": 50239, - "total_submitted": 80814, - "total_column_articles": 249, + "total_acs": 52338, + "total_submitted": 83925, + "total_column_articles": 254, "frontend_question_id": "1075", "is_new_question": false }, @@ -50832,8 +51294,8 @@ "question__title": "Letter Tile Possibilities", "question__title_slug": "letter-tile-possibilities", "question__hide": false, - "total_acs": 34404, - "total_submitted": 43525, + "total_acs": 34507, + "total_submitted": 43683, "total_column_articles": 412, "frontend_question_id": "1079", "is_new_question": false @@ -50853,8 +51315,8 @@ "question__title": "Smallest Subsequence of Distinct Characters", "question__title_slug": "smallest-subsequence-of-distinct-characters", "question__hide": false, - "total_acs": 30109, - "total_submitted": 50934, + "total_acs": 30288, + "total_submitted": 51199, "total_column_articles": 259, "frontend_question_id": "1081", "is_new_question": false @@ -50874,9 +51336,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": 25026, - "total_submitted": 40313, - "total_column_articles": 285, + "total_acs": 25178, + "total_submitted": 40515, + "total_column_articles": 291, "frontend_question_id": "1080", "is_new_question": false }, @@ -50895,9 +51357,9 @@ "question__title": "Occurrences After Bigram", "question__title_slug": "occurrences-after-bigram", "question__hide": false, - "total_acs": 39854, - "total_submitted": 61177, - "total_column_articles": 538, + "total_acs": 39945, + "total_submitted": 61309, + "total_column_articles": 540, "frontend_question_id": "1078", "is_new_question": false }, @@ -50916,9 +51378,9 @@ "question__title": "Product Sales Analysis III", "question__title_slug": "product-sales-analysis-iii", "question__hide": false, - "total_acs": 24373, - "total_submitted": 51816, - "total_column_articles": 155, + "total_acs": 24830, + "total_submitted": 52745, + "total_column_articles": 157, "frontend_question_id": "1070", "is_new_question": false }, @@ -50937,8 +51399,8 @@ "question__title": "Product Sales Analysis II", "question__title_slug": "product-sales-analysis-ii", "question__hide": false, - "total_acs": 20139, - "total_submitted": 24507, + "total_acs": 20220, + "total_submitted": 24611, "total_column_articles": 90, "frontend_question_id": "1069", "is_new_question": false @@ -50958,9 +51420,9 @@ "question__title": "Product Sales Analysis I", "question__title_slug": "product-sales-analysis-i", "question__hide": false, - "total_acs": 78476, - "total_submitted": 89969, - "total_column_articles": 199, + "total_acs": 81911, + "total_submitted": 93860, + "total_column_articles": 206, "frontend_question_id": "1068", "is_new_question": false }, @@ -50979,8 +51441,8 @@ "question__title": "Maximum Number of Ones", "question__title_slug": "maximum-number-of-ones", "question__hide": false, - "total_acs": 1280, - "total_submitted": 2029, + "total_acs": 1298, + "total_submitted": 2050, "total_column_articles": 34, "frontend_question_id": "1183", "is_new_question": false @@ -51000,8 +51462,8 @@ "question__title": "Stepping Numbers", "question__title_slug": "stepping-numbers", "question__hide": false, - "total_acs": 2806, - "total_submitted": 6318, + "total_acs": 2818, + "total_submitted": 6333, "total_column_articles": 57, "frontend_question_id": "1215", "is_new_question": false @@ -51021,8 +51483,8 @@ "question__title": "Two Sum BSTs", "question__title_slug": "two-sum-bsts", "question__hide": false, - "total_acs": 6265, - "total_submitted": 9477, + "total_acs": 6325, + "total_submitted": 9570, "total_column_articles": 108, "frontend_question_id": "1214", "is_new_question": false @@ -51042,8 +51504,8 @@ "question__title": "Intersection of Three Sorted Arrays", "question__title_slug": "intersection-of-three-sorted-arrays", "question__hide": false, - "total_acs": 9300, - "total_submitted": 11879, + "total_acs": 9318, + "total_submitted": 11900, "total_column_articles": 188, "frontend_question_id": "1213", "is_new_question": false @@ -51063,9 +51525,9 @@ "question__title": "Adding Two Negabinary Numbers", "question__title_slug": "adding-two-negabinary-numbers", "question__hide": false, - "total_acs": 17282, - "total_submitted": 41770, - "total_column_articles": 197, + "total_acs": 17308, + "total_submitted": 41827, + "total_column_articles": 199, "frontend_question_id": "1073", "is_new_question": false }, @@ -51084,9 +51546,9 @@ "question__title": "Flip Columns For Maximum Number of Equal Rows", "question__title_slug": "flip-columns-for-maximum-number-of-equal-rows", "question__hide": false, - "total_acs": 22133, - "total_submitted": 31105, - "total_column_articles": 213, + "total_acs": 22156, + "total_submitted": 31132, + "total_column_articles": 214, "frontend_question_id": "1072", "is_new_question": false }, @@ -51105,9 +51567,9 @@ "question__title": "Greatest Common Divisor of Strings", "question__title_slug": "greatest-common-divisor-of-strings", "question__hide": false, - "total_acs": 77132, - "total_submitted": 132205, - "total_column_articles": 949, + "total_acs": 78044, + "total_submitted": 133656, + "total_column_articles": 951, "frontend_question_id": "1071", "is_new_question": false }, @@ -51126,8 +51588,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": 22965, - "total_submitted": 33936, + "total_acs": 23025, + "total_submitted": 34023, "total_column_articles": 224, "frontend_question_id": "1074", "is_new_question": false @@ -51147,8 +51609,8 @@ "question__title": "Optimize Water Distribution in a Village", "question__title_slug": "optimize-water-distribution-in-a-village", "question__hide": false, - "total_acs": 3435, - "total_submitted": 5497, + "total_acs": 3637, + "total_submitted": 5760, "total_column_articles": 64, "frontend_question_id": "1168", "is_new_question": false @@ -51168,9 +51630,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": 8245, - "total_submitted": 11101, - "total_column_articles": 110, + "total_acs": 8400, + "total_submitted": 11290, + "total_column_articles": 112, "frontend_question_id": "1198", "is_new_question": false }, @@ -51189,8 +51651,8 @@ "question__title": "Minimum Knight Moves", "question__title_slug": "minimum-knight-moves", "question__hide": false, - "total_acs": 8610, - "total_submitted": 21592, + "total_acs": 8675, + "total_submitted": 21717, "total_column_articles": 89, "frontend_question_id": "1197", "is_new_question": false @@ -51210,8 +51672,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": 5380, - "total_submitted": 7853, + "total_acs": 5392, + "total_submitted": 7871, "total_column_articles": 88, "frontend_question_id": "1196", "is_new_question": false @@ -51231,9 +51693,9 @@ "question__title": "Distant Barcodes", "question__title_slug": "distant-barcodes", "question__hide": false, - "total_acs": 27324, - "total_submitted": 60701, - "total_column_articles": 323, + "total_acs": 27402, + "total_submitted": 60865, + "total_column_articles": 325, "frontend_question_id": "1054", "is_new_question": false }, @@ -51252,8 +51714,8 @@ "question__title": "Previous Permutation With One Swap", "question__title_slug": "previous-permutation-with-one-swap", "question__hide": false, - "total_acs": 28856, - "total_submitted": 59673, + "total_acs": 28901, + "total_submitted": 59754, "total_column_articles": 315, "frontend_question_id": "1053", "is_new_question": false @@ -51273,9 +51735,9 @@ "question__title": "Grumpy Bookstore Owner", "question__title_slug": "grumpy-bookstore-owner", "question__hide": false, - "total_acs": 88374, - "total_submitted": 147215, - "total_column_articles": 1126, + "total_acs": 88905, + "total_submitted": 148036, + "total_column_articles": 1135, "frontend_question_id": "1052", "is_new_question": false }, @@ -51294,9 +51756,9 @@ "question__title": "Height Checker", "question__title_slug": "height-checker", "question__hide": false, - "total_acs": 74185, - "total_submitted": 92530, - "total_column_articles": 719, + "total_acs": 74423, + "total_submitted": 92800, + "total_column_articles": 721, "frontend_question_id": "1051", "is_new_question": false }, @@ -51315,9 +51777,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": 70190, - "total_submitted": 92082, - "total_column_articles": 272, + "total_acs": 71069, + "total_submitted": 93180, + "total_column_articles": 275, "frontend_question_id": "1050", "is_new_question": false }, @@ -51336,9 +51798,9 @@ "question__title": "Customers Who Bought All Products", "question__title_slug": "customers-who-bought-all-products", "question__hide": false, - "total_acs": 44806, - "total_submitted": 74576, - "total_column_articles": 334, + "total_acs": 46435, + "total_submitted": 77236, + "total_column_articles": 340, "frontend_question_id": "1045", "is_new_question": false }, @@ -51357,8 +51819,8 @@ "question__title": "Shortest Distance to Target Color", "question__title_slug": "shortest-distance-to-target-color", "question__hide": false, - "total_acs": 5768, - "total_submitted": 12068, + "total_acs": 5777, + "total_submitted": 12078, "total_column_articles": 101, "frontend_question_id": "1182", "is_new_question": false @@ -51378,9 +51840,9 @@ "question__title": "Last Substring in Lexicographical Order", "question__title_slug": "last-substring-in-lexicographical-order", "question__hide": false, - "total_acs": 23519, - "total_submitted": 66978, - "total_column_articles": 244, + "total_acs": 23570, + "total_submitted": 67107, + "total_column_articles": 245, "frontend_question_id": "1163", "is_new_question": false }, @@ -51399,8 +51861,8 @@ "question__title": "Before and After Puzzle", "question__title_slug": "before-and-after-puzzle", "question__hide": false, - "total_acs": 2050, - "total_submitted": 5105, + "total_acs": 2058, + "total_submitted": 5115, "total_column_articles": 40, "frontend_question_id": "1181", "is_new_question": false @@ -51420,8 +51882,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": 5381, - "total_submitted": 6793, + "total_acs": 5423, + "total_submitted": 6840, "total_column_articles": 114, "frontend_question_id": "1180", "is_new_question": false @@ -51441,9 +51903,9 @@ "question__title": "Last Stone Weight II", "question__title_slug": "last-stone-weight-ii", "question__hide": false, - "total_acs": 176216, - "total_submitted": 250168, - "total_column_articles": 1003, + "total_acs": 178956, + "total_submitted": 253758, + "total_column_articles": 1013, "frontend_question_id": "1049", "is_new_question": false }, @@ -51462,9 +51924,9 @@ "question__title": "Longest String Chain", "question__title_slug": "longest-string-chain", "question__hide": false, - "total_acs": 38149, - "total_submitted": 67565, - "total_column_articles": 411, + "total_acs": 38373, + "total_submitted": 67843, + "total_column_articles": 412, "frontend_question_id": "1048", "is_new_question": false }, @@ -51483,9 +51945,9 @@ "question__title": "Remove All Adjacent Duplicates In String", "question__title_slug": "remove-all-adjacent-duplicates-in-string", "question__hide": false, - "total_acs": 307662, - "total_submitted": 424891, - "total_column_articles": 1868, + "total_acs": 311437, + "total_submitted": 429818, + "total_column_articles": 1877, "frontend_question_id": "1047", "is_new_question": false }, @@ -51504,9 +51966,9 @@ "question__title": "Last Stone Weight", "question__title_slug": "last-stone-weight", "question__hide": false, - "total_acs": 103321, - "total_submitted": 158500, - "total_column_articles": 1292, + "total_acs": 103921, + "total_submitted": 159364, + "total_column_articles": 1295, "frontend_question_id": "1046", "is_new_question": false }, @@ -51525,8 +51987,8 @@ "question__title": "Minimum Cost to Connect Sticks", "question__title_slug": "minimum-cost-to-connect-sticks", "question__hide": false, - "total_acs": 4727, - "total_submitted": 8741, + "total_acs": 4783, + "total_submitted": 8870, "total_column_articles": 63, "frontend_question_id": "1167", "is_new_question": false @@ -51546,8 +52008,8 @@ "question__title": "Design File System", "question__title_slug": "design-file-system", "question__hide": false, - "total_acs": 5258, - "total_submitted": 10426, + "total_acs": 5285, + "total_submitted": 10467, "total_column_articles": 88, "frontend_question_id": "1166", "is_new_question": false @@ -51567,8 +52029,8 @@ "question__title": "String Transforms Into Another String", "question__title_slug": "string-transforms-into-another-string", "question__hide": false, - "total_acs": 2459, - "total_submitted": 6509, + "total_acs": 2467, + "total_submitted": 6530, "total_column_articles": 37, "frontend_question_id": "1153", "is_new_question": false @@ -51588,8 +52050,8 @@ "question__title": "Single-Row Keyboard", "question__title_slug": "single-row-keyboard", "question__hide": false, - "total_acs": 11425, - "total_submitted": 13438, + "total_acs": 11551, + "total_submitted": 13570, "total_column_articles": 168, "frontend_question_id": "1165", "is_new_question": false @@ -51609,9 +52071,9 @@ "question__title": "Longest Duplicate Substring", "question__title_slug": "longest-duplicate-substring", "question__hide": false, - "total_acs": 31416, - "total_submitted": 89134, - "total_column_articles": 251, + "total_acs": 31609, + "total_submitted": 89650, + "total_column_articles": 254, "frontend_question_id": "1044", "is_new_question": false }, @@ -51630,8 +52092,8 @@ "question__title": "Partition Array for Maximum Sum", "question__title_slug": "partition-array-for-maximum-sum", "question__hide": false, - "total_acs": 33986, - "total_submitted": 45122, + "total_acs": 34192, + "total_submitted": 45414, "total_column_articles": 321, "frontend_question_id": "1043", "is_new_question": false @@ -51651,8 +52113,8 @@ "question__title": "Flower Planting With No Adjacent", "question__title_slug": "flower-planting-with-no-adjacent", "question__hide": false, - "total_acs": 33206, - "total_submitted": 54147, + "total_acs": 33308, + "total_submitted": 54273, "total_column_articles": 347, "frontend_question_id": "1042", "is_new_question": false @@ -51672,9 +52134,9 @@ "question__title": "Robot Bounded In Circle", "question__title_slug": "robot-bounded-in-circle", "question__hide": false, - "total_acs": 38528, - "total_submitted": 68260, - "total_column_articles": 533, + "total_acs": 38690, + "total_submitted": 68564, + "total_column_articles": 535, "frontend_question_id": "1041", "is_new_question": false }, @@ -51693,8 +52155,8 @@ "question__title": "Divide Array Into Increasing Sequences", "question__title_slug": "divide-array-into-increasing-sequences", "question__hide": false, - "total_acs": 1744, - "total_submitted": 2936, + "total_acs": 1749, + "total_submitted": 2945, "total_column_articles": 30, "frontend_question_id": "1121", "is_new_question": false @@ -51714,9 +52176,9 @@ "question__title": "As Far from Land as Possible", "question__title_slug": "as-far-from-land-as-possible", "question__hide": false, - "total_acs": 58403, - "total_submitted": 124596, - "total_column_articles": 701, + "total_acs": 58728, + "total_submitted": 125172, + "total_column_articles": 704, "frontend_question_id": "1162", "is_new_question": false }, @@ -51735,9 +52197,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": 47321, - "total_submitted": 72198, - "total_column_articles": 563, + "total_acs": 47678, + "total_submitted": 72716, + "total_column_articles": 564, "frontend_question_id": "1161", "is_new_question": false }, @@ -51756,8 +52218,8 @@ "question__title": "Valid Boomerang", "question__title_slug": "valid-boomerang", "question__hide": false, - "total_acs": 43653, - "total_submitted": 90343, + "total_acs": 43753, + "total_submitted": 90593, "total_column_articles": 436, "frontend_question_id": "1037", "is_new_question": false @@ -51777,8 +52239,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": 68194, - "total_submitted": 81570, + "total_acs": 68416, + "total_submitted": 81831, "total_column_articles": 698, "frontend_question_id": "1038", "is_new_question": false @@ -51798,8 +52260,8 @@ "question__title": "Moving Stones Until Consecutive II", "question__title_slug": "moving-stones-until-consecutive-ii", "question__hide": false, - "total_acs": 15324, - "total_submitted": 23184, + "total_acs": 15335, + "total_submitted": 23197, "total_column_articles": 94, "frontend_question_id": "1040", "is_new_question": false @@ -51819,9 +52281,9 @@ "question__title": "Find Words That Can Be Formed by Characters", "question__title_slug": "find-words-that-can-be-formed-by-characters", "question__hide": false, - "total_acs": 80429, - "total_submitted": 118282, - "total_column_articles": 1099, + "total_acs": 80649, + "total_submitted": 118606, + "total_column_articles": 1101, "frontend_question_id": "1160", "is_new_question": false }, @@ -51840,8 +52302,8 @@ "question__title": "Minimum Score Triangulation of Polygon", "question__title_slug": "minimum-score-triangulation-of-polygon", "question__hide": false, - "total_acs": 25742, - "total_submitted": 39131, + "total_acs": 25981, + "total_submitted": 39429, "total_column_articles": 163, "frontend_question_id": "1039", "is_new_question": false @@ -51861,8 +52323,8 @@ "question__title": "Analyze User Website Visit Pattern", "question__title_slug": "analyze-user-website-visit-pattern", "question__hide": false, - "total_acs": 2995, - "total_submitted": 7121, + "total_acs": 3014, + "total_submitted": 7168, "total_column_articles": 61, "frontend_question_id": "1152", "is_new_question": false @@ -51882,8 +52344,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": 9983, - "total_submitted": 18766, + "total_acs": 10011, + "total_submitted": 18810, "total_column_articles": 144, "frontend_question_id": "1151", "is_new_question": false @@ -51903,9 +52365,9 @@ "question__title": "Escape a Large Maze", "question__title_slug": "escape-a-large-maze", "question__hide": false, - "total_acs": 21750, - "total_submitted": 46666, - "total_column_articles": 222, + "total_acs": 21800, + "total_submitted": 46789, + "total_column_articles": 223, "frontend_question_id": "1036", "is_new_question": false }, @@ -51924,9 +52386,9 @@ "question__title": "Uncrossed Lines", "question__title_slug": "uncrossed-lines", "question__hide": false, - "total_acs": 107678, - "total_submitted": 148494, - "total_column_articles": 707, + "total_acs": 109134, + "total_submitted": 150264, + "total_column_articles": 712, "frontend_question_id": "1035", "is_new_question": false }, @@ -51945,9 +52407,9 @@ "question__title": "Coloring A Border", "question__title_slug": "coloring-a-border", "question__hide": false, - "total_acs": 35830, - "total_submitted": 65120, - "total_column_articles": 550, + "total_acs": 35995, + "total_submitted": 65398, + "total_column_articles": 551, "frontend_question_id": "1034", "is_new_question": false }, @@ -51966,9 +52428,9 @@ "question__title": "Moving Stones Until Consecutive", "question__title_slug": "moving-stones-until-consecutive", "question__hide": false, - "total_acs": 26252, - "total_submitted": 52467, - "total_column_articles": 310, + "total_acs": 26312, + "total_submitted": 52558, + "total_column_articles": 312, "frontend_question_id": "1033", "is_new_question": false }, @@ -51987,8 +52449,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": 8513, - "total_submitted": 14251, + "total_acs": 8570, + "total_submitted": 14346, "total_column_articles": 138, "frontend_question_id": "1150", "is_new_question": false @@ -52008,8 +52470,8 @@ "question__title": "Parallel Courses", "question__title_slug": "parallel-courses", "question__hide": false, - "total_acs": 7609, - "total_submitted": 12470, + "total_acs": 7674, + "total_submitted": 12602, "total_column_articles": 108, "frontend_question_id": "1136", "is_new_question": false @@ -52029,8 +52491,8 @@ "question__title": "Connecting Cities With Minimum Cost", "question__title_slug": "connecting-cities-with-minimum-cost", "question__hide": false, - "total_acs": 14972, - "total_submitted": 25578, + "total_acs": 15023, + "total_submitted": 25658, "total_column_articles": 169, "frontend_question_id": "1135", "is_new_question": false @@ -52050,8 +52512,8 @@ "question__title": "Path With Maximum Minimum Value", "question__title_slug": "path-with-maximum-minimum-value", "question__hide": false, - "total_acs": 9590, - "total_submitted": 23309, + "total_acs": 9612, + "total_submitted": 23367, "total_column_articles": 117, "frontend_question_id": "1102", "is_new_question": false @@ -52071,8 +52533,8 @@ "question__title": "Largest Unique Number", "question__title_slug": "largest-unique-number", "question__hide": false, - "total_acs": 6639, - "total_submitted": 9779, + "total_acs": 6750, + "total_submitted": 9918, "total_column_articles": 118, "frontend_question_id": "1133", "is_new_question": false @@ -52092,8 +52554,8 @@ "question__title": "Stream of Characters", "question__title_slug": "stream-of-characters", "question__hide": false, - "total_acs": 20256, - "total_submitted": 35635, + "total_acs": 20295, + "total_submitted": 35708, "total_column_articles": 267, "frontend_question_id": "1032", "is_new_question": false @@ -52113,9 +52575,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": 27939, - "total_submitted": 42517, - "total_column_articles": 314, + "total_acs": 28026, + "total_submitted": 42635, + "total_column_articles": 315, "frontend_question_id": "1031", "is_new_question": false }, @@ -52134,9 +52596,9 @@ "question__title": "Two City Scheduling", "question__title_slug": "two-city-scheduling", "question__hide": false, - "total_acs": 27806, - "total_submitted": 39966, - "total_column_articles": 293, + "total_acs": 27997, + "total_submitted": 40209, + "total_column_articles": 295, "frontend_question_id": "1029", "is_new_question": false }, @@ -52155,8 +52617,8 @@ "question__title": "Matrix Cells in Distance Order", "question__title_slug": "matrix-cells-in-distance-order", "question__hide": false, - "total_acs": 50335, - "total_submitted": 71120, + "total_acs": 50448, + "total_submitted": 71250, "total_column_articles": 546, "frontend_question_id": "1030", "is_new_question": false @@ -52176,9 +52638,9 @@ "question__title": "Recover a Tree From Preorder Traversal", "question__title_slug": "recover-a-tree-from-preorder-traversal", "question__hide": false, - "total_acs": 26967, - "total_submitted": 37049, - "total_column_articles": 549, + "total_acs": 27034, + "total_submitted": 37133, + "total_column_articles": 551, "frontend_question_id": "1028", "is_new_question": false }, @@ -52197,9 +52659,9 @@ "question__title": "Maximum Difference Between Node and Ancestor", "question__title_slug": "maximum-difference-between-node-and-ancestor", "question__hide": false, - "total_acs": 54068, - "total_submitted": 69490, - "total_column_articles": 606, + "total_acs": 54347, + "total_submitted": 69840, + "total_column_articles": 612, "frontend_question_id": "1026", "is_new_question": false }, @@ -52218,8 +52680,8 @@ "question__title": "Maximum Average Subtree", "question__title_slug": "maximum-average-subtree", "question__hide": false, - "total_acs": 5264, - "total_submitted": 8254, + "total_acs": 5323, + "total_submitted": 8333, "total_column_articles": 92, "frontend_question_id": "1120", "is_new_question": false @@ -52239,8 +52701,8 @@ "question__title": "Armstrong Number", "question__title_slug": "armstrong-number", "question__hide": false, - "total_acs": 5649, - "total_submitted": 7283, + "total_acs": 5709, + "total_submitted": 7367, "total_column_articles": 86, "frontend_question_id": "1134", "is_new_question": false @@ -52260,8 +52722,8 @@ "question__title": "Remove Vowels from a String", "question__title_slug": "remove-vowels-from-a-string", "question__hide": false, - "total_acs": 10936, - "total_submitted": 12534, + "total_acs": 10954, + "total_submitted": 12555, "total_column_articles": 194, "frontend_question_id": "1119", "is_new_question": false @@ -52281,8 +52743,8 @@ "question__title": "Number of Days in a Month", "question__title_slug": "number-of-days-in-a-month", "question__hide": false, - "total_acs": 4127, - "total_submitted": 6270, + "total_acs": 4138, + "total_submitted": 6284, "total_column_articles": 71, "frontend_question_id": "1118", "is_new_question": false @@ -52302,8 +52764,8 @@ "question__title": "Longest Arithmetic Subsequence", "question__title_slug": "longest-arithmetic-subsequence", "question__hide": false, - "total_acs": 46981, - "total_submitted": 94709, + "total_acs": 47476, + "total_submitted": 95573, "total_column_articles": 357, "frontend_question_id": "1027", "is_new_question": false @@ -52323,9 +52785,9 @@ "question__title": "Divisor Game", "question__title_slug": "divisor-game", "question__hide": false, - "total_acs": 104915, - "total_submitted": 148387, - "total_column_articles": 839, + "total_acs": 105248, + "total_submitted": 148815, + "total_column_articles": 843, "frontend_question_id": "1025", "is_new_question": false }, @@ -52344,9 +52806,9 @@ "question__title": "The Earliest Moment When Everyone Become Friends", "question__title_slug": "the-earliest-moment-when-everyone-become-friends", "question__hide": false, - "total_acs": 4699, - "total_submitted": 6835, - "total_column_articles": 113, + "total_acs": 4721, + "total_submitted": 6864, + "total_column_articles": 114, "frontend_question_id": "1101", "is_new_question": false }, @@ -52365,8 +52827,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": 12374, - "total_submitted": 17494, + "total_acs": 12593, + "total_submitted": 17779, "total_column_articles": 216, "frontend_question_id": "1100", "is_new_question": false @@ -52386,8 +52848,8 @@ "question__title": "Two Sum Less Than K", "question__title_slug": "two-sum-less-than-k", "question__hide": false, - "total_acs": 10281, - "total_submitted": 16954, + "total_acs": 10317, + "total_submitted": 17022, "total_column_articles": 155, "frontend_question_id": "1099", "is_new_question": false @@ -52407,8 +52869,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": 5146, - "total_submitted": 6584, + "total_acs": 5155, + "total_submitted": 6594, "total_column_articles": 115, "frontend_question_id": "1085", "is_new_question": false @@ -52428,8 +52890,8 @@ "question__title": "Video Stitching", "question__title_slug": "video-stitching", "question__hide": false, - "total_acs": 50938, - "total_submitted": 95739, + "total_acs": 51101, + "total_submitted": 96023, "total_column_articles": 568, "frontend_question_id": "1024", "is_new_question": false @@ -52449,9 +52911,9 @@ "question__title": "Camelcase Matching", "question__title_slug": "camelcase-matching", "question__hide": false, - "total_acs": 30647, - "total_submitted": 47453, - "total_column_articles": 491, + "total_acs": 30720, + "total_submitted": 47549, + "total_column_articles": 492, "frontend_question_id": "1023", "is_new_question": false }, @@ -52470,8 +52932,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": 60429, - "total_submitted": 80878, + "total_acs": 60661, + "total_submitted": 81180, "total_column_articles": 678, "frontend_question_id": "1022", "is_new_question": false @@ -52491,9 +52953,9 @@ "question__title": "Remove Outermost Parentheses", "question__title_slug": "remove-outermost-parentheses", "question__hide": false, - "total_acs": 102206, - "total_submitted": 125659, - "total_column_articles": 1101, + "total_acs": 102421, + "total_submitted": 125917, + "total_column_articles": 1102, "frontend_question_id": "1021", "is_new_question": false }, @@ -52512,8 +52974,8 @@ "question__title": "Confusing Number II", "question__title_slug": "confusing-number-ii", "question__hide": false, - "total_acs": 1822, - "total_submitted": 3643, + "total_acs": 1832, + "total_submitted": 3653, "total_column_articles": 53, "frontend_question_id": "1088", "is_new_question": false @@ -52533,8 +52995,8 @@ "question__title": "Brace Expansion", "question__title_slug": "brace-expansion", "question__hide": false, - "total_acs": 4228, - "total_submitted": 7351, + "total_acs": 4329, + "total_submitted": 7497, "total_column_articles": 100, "frontend_question_id": "1087", "is_new_question": false @@ -52554,8 +53016,8 @@ "question__title": "Index Pairs of a String", "question__title_slug": "index-pairs-of-a-string", "question__hide": false, - "total_acs": 3842, - "total_submitted": 6808, + "total_acs": 3857, + "total_submitted": 6825, "total_column_articles": 114, "frontend_question_id": "1065", "is_new_question": false @@ -52575,9 +53037,9 @@ "question__title": "High Five", "question__title_slug": "high-five", "question__hide": false, - "total_acs": 8080, - "total_submitted": 11767, - "total_column_articles": 135, + "total_acs": 8141, + "total_submitted": 11855, + "total_column_articles": 136, "frontend_question_id": "1086", "is_new_question": false }, @@ -52596,9 +53058,9 @@ "question__title": "Number of Enclaves", "question__title_slug": "number-of-enclaves", "question__hide": false, - "total_acs": 81921, - "total_submitted": 133398, - "total_column_articles": 955, + "total_acs": 83404, + "total_submitted": 135790, + "total_column_articles": 967, "frontend_question_id": "1020", "is_new_question": false }, @@ -52617,9 +53079,9 @@ "question__title": "Next Greater Node In Linked List", "question__title_slug": "next-greater-node-in-linked-list", "question__hide": false, - "total_acs": 59925, - "total_submitted": 92517, - "total_column_articles": 692, + "total_acs": 60445, + "total_submitted": 93222, + "total_column_articles": 695, "frontend_question_id": "1019", "is_new_question": false }, @@ -52638,9 +53100,9 @@ "question__title": "Binary Prefix Divisible By 5", "question__title_slug": "binary-prefix-divisible-by-5", "question__hide": false, - "total_acs": 53791, - "total_submitted": 106816, - "total_column_articles": 461, + "total_acs": 53886, + "total_submitted": 107079, + "total_column_articles": 462, "frontend_question_id": "1018", "is_new_question": false }, @@ -52659,9 +53121,9 @@ "question__title": "Convert to Base -2", "question__title_slug": "convert-to-base-2", "question__hide": false, - "total_acs": 37802, - "total_submitted": 56962, - "total_column_articles": 343, + "total_acs": 37897, + "total_submitted": 57112, + "total_column_articles": 342, "frontend_question_id": "1017", "is_new_question": false }, @@ -52680,8 +53142,8 @@ "question__title": "Confusing Number", "question__title_slug": "confusing-number", "question__hide": false, - "total_acs": 9282, - "total_submitted": 20586, + "total_acs": 9501, + "total_submitted": 21001, "total_column_articles": 160, "frontend_question_id": "1056", "is_new_question": false @@ -52701,8 +53163,8 @@ "question__title": "Digit Count in Range", "question__title_slug": "digit-count-in-range", "question__hide": false, - "total_acs": 2293, - "total_submitted": 4654, + "total_acs": 2311, + "total_submitted": 4706, "total_column_articles": 55, "frontend_question_id": "1067", "is_new_question": false @@ -52722,9 +53184,9 @@ "question__title": "Campus Bikes II", "question__title_slug": "campus-bikes-ii", "question__hide": false, - "total_acs": 3540, - "total_submitted": 6837, - "total_column_articles": 76, + "total_acs": 3553, + "total_submitted": 6856, + "total_column_articles": 77, "frontend_question_id": "1066", "is_new_question": false }, @@ -52743,8 +53205,8 @@ "question__title": "Fixed Point", "question__title_slug": "fixed-point", "question__hide": false, - "total_acs": 6973, - "total_submitted": 10779, + "total_acs": 7002, + "total_submitted": 10813, "total_column_articles": 110, "frontend_question_id": "1064", "is_new_question": false @@ -52764,8 +53226,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": 26762, - "total_submitted": 42226, + "total_acs": 26801, + "total_submitted": 42281, "total_column_articles": 272, "frontend_question_id": "1016", "is_new_question": false @@ -52785,8 +53247,8 @@ "question__title": "Smallest Integer Divisible by K", "question__title_slug": "smallest-integer-divisible-by-k", "question__hide": false, - "total_acs": 26866, - "total_submitted": 57436, + "total_acs": 26936, + "total_submitted": 57556, "total_column_articles": 175, "frontend_question_id": "1015", "is_new_question": false @@ -52806,8 +53268,8 @@ "question__title": "Best Sightseeing Pair", "question__title_slug": "best-sightseeing-pair", "question__hide": false, - "total_acs": 63742, - "total_submitted": 111335, + "total_acs": 63815, + "total_submitted": 111453, "total_column_articles": 727, "frontend_question_id": "1014", "is_new_question": false @@ -52827,9 +53289,9 @@ "question__title": "Partition Array Into Three Parts With Equal Sum", "question__title_slug": "partition-array-into-three-parts-with-equal-sum", "question__hide": false, - "total_acs": 64361, - "total_submitted": 167266, - "total_column_articles": 1079, + "total_acs": 64518, + "total_submitted": 167704, + "total_column_articles": 1080, "frontend_question_id": "1013", "is_new_question": false }, @@ -52848,8 +53310,8 @@ "question__title": "Number of Valid Subarrays", "question__title_slug": "number-of-valid-subarrays", "question__hide": false, - "total_acs": 3202, - "total_submitted": 4343, + "total_acs": 3219, + "total_submitted": 4363, "total_column_articles": 63, "frontend_question_id": "1063", "is_new_question": false @@ -52869,8 +53331,8 @@ "question__title": "Longest Repeating Substring", "question__title_slug": "longest-repeating-substring", "question__hide": false, - "total_acs": 7115, - "total_submitted": 12332, + "total_acs": 7141, + "total_submitted": 12370, "total_column_articles": 91, "frontend_question_id": "1062", "is_new_question": false @@ -52890,9 +53352,9 @@ "question__title": "Missing Element in Sorted Array", "question__title_slug": "missing-element-in-sorted-array", "question__hide": false, - "total_acs": 12835, - "total_submitted": 23120, - "total_column_articles": 168, + "total_acs": 12919, + "total_submitted": 23270, + "total_column_articles": 169, "frontend_question_id": "1060", "is_new_question": false }, @@ -52911,9 +53373,9 @@ "question__title": "Lexicographically Smallest Equivalent String", "question__title_slug": "lexicographically-smallest-equivalent-string", "question__hide": false, - "total_acs": 6896, - "total_submitted": 10526, - "total_column_articles": 137, + "total_acs": 7003, + "total_submitted": 10676, + "total_column_articles": 140, "frontend_question_id": "1061", "is_new_question": false }, @@ -52932,8 +53394,8 @@ "question__title": "Numbers With Repeated Digits", "question__title_slug": "numbers-with-repeated-digits", "question__hide": false, - "total_acs": 22086, - "total_submitted": 40973, + "total_acs": 22176, + "total_submitted": 41107, "total_column_articles": 206, "frontend_question_id": "1012", "is_new_question": false @@ -52953,9 +53415,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": 104719, - "total_submitted": 167649, - "total_column_articles": 897, + "total_acs": 105210, + "total_submitted": 168366, + "total_column_articles": 898, "frontend_question_id": "1011", "is_new_question": false }, @@ -52974,8 +53436,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": 44709, - "total_submitted": 89531, + "total_acs": 44797, + "total_submitted": 89727, "total_column_articles": 504, "frontend_question_id": "1010", "is_new_question": false @@ -52995,9 +53457,9 @@ "question__title": "Complement of Base 10 Integer", "question__title_slug": "complement-of-base-10-integer", "question__hide": false, - "total_acs": 26978, - "total_submitted": 45961, - "total_column_articles": 370, + "total_acs": 27103, + "total_submitted": 46166, + "total_column_articles": 373, "frontend_question_id": "1009", "is_new_question": false }, @@ -53016,8 +53478,8 @@ "question__title": "Minimize Rounding Error to Meet Target", "question__title_slug": "minimize-rounding-error-to-meet-target", "question__hide": false, - "total_acs": 2062, - "total_submitted": 5469, + "total_acs": 2068, + "total_submitted": 5483, "total_column_articles": 53, "frontend_question_id": "1058", "is_new_question": false @@ -53037,8 +53499,8 @@ "question__title": "Campus Bikes", "question__title_slug": "campus-bikes", "question__hide": false, - "total_acs": 5047, - "total_submitted": 9585, + "total_acs": 5100, + "total_submitted": 9673, "total_column_articles": 65, "frontend_question_id": "1057", "is_new_question": false @@ -53058,8 +53520,8 @@ "question__title": "Shortest Way to Form String", "question__title_slug": "shortest-way-to-form-string", "question__hide": false, - "total_acs": 11949, - "total_submitted": 19634, + "total_acs": 12121, + "total_submitted": 19877, "total_column_articles": 175, "frontend_question_id": "1055", "is_new_question": false @@ -53079,8 +53541,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": 35651, - "total_submitted": 49730, + "total_acs": 35879, + "total_submitted": 50024, "total_column_articles": 433, "frontend_question_id": "1008", "is_new_question": false @@ -53100,8 +53562,8 @@ "question__title": "Minimum Domino Rotations For Equal Row", "question__title_slug": "minimum-domino-rotations-for-equal-row", "question__hide": false, - "total_acs": 10107, - "total_submitted": 20886, + "total_acs": 10143, + "total_submitted": 20953, "total_column_articles": 131, "frontend_question_id": "1007", "is_new_question": false @@ -53121,9 +53583,9 @@ "question__title": "Clumsy Factorial", "question__title_slug": "clumsy-factorial", "question__hide": false, - "total_acs": 51179, - "total_submitted": 81206, - "total_column_articles": 688, + "total_acs": 51279, + "total_submitted": 81345, + "total_column_articles": 690, "frontend_question_id": "1006", "is_new_question": false }, @@ -53142,9 +53604,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": 170069, - "total_submitted": 332635, - "total_column_articles": 1702, + "total_acs": 172191, + "total_submitted": 336477, + "total_column_articles": 1709, "frontend_question_id": "1005", "is_new_question": false }, @@ -53163,9 +53625,9 @@ "question__title": "Max Consecutive Ones III", "question__title_slug": "max-consecutive-ones-iii", "question__hide": false, - "total_acs": 159186, - "total_submitted": 268133, - "total_column_articles": 1275, + "total_acs": 160940, + "total_submitted": 270823, + "total_column_articles": 1286, "frontend_question_id": "1004", "is_new_question": false }, @@ -53184,9 +53646,9 @@ "question__title": "Check If Word Is Valid After Substitutions", "question__title_slug": "check-if-word-is-valid-after-substitutions", "question__hide": false, - "total_acs": 37232, - "total_submitted": 58208, - "total_column_articles": 456, + "total_acs": 37371, + "total_submitted": 58407, + "total_column_articles": 458, "frontend_question_id": "1003", "is_new_question": false }, @@ -53205,9 +53667,9 @@ "question__title": "Find Common Characters", "question__title_slug": "find-common-characters", "question__hide": false, - "total_acs": 95042, - "total_submitted": 135233, - "total_column_articles": 898, + "total_acs": 95590, + "total_submitted": 135970, + "total_column_articles": 905, "frontend_question_id": "1002", "is_new_question": false }, @@ -53226,8 +53688,8 @@ "question__title": "Grid Illumination", "question__title_slug": "grid-illumination", "question__hide": false, - "total_acs": 20099, - "total_submitted": 44950, + "total_acs": 20123, + "total_submitted": 45009, "total_column_articles": 282, "frontend_question_id": "1001", "is_new_question": false @@ -53247,9 +53709,9 @@ "question__title": "Minimum Cost to Merge Stones", "question__title_slug": "minimum-cost-to-merge-stones", "question__hide": false, - "total_acs": 20815, - "total_submitted": 38655, - "total_column_articles": 111, + "total_acs": 20929, + "total_submitted": 38840, + "total_column_articles": 112, "frontend_question_id": "1000", "is_new_question": false }, @@ -53268,9 +53730,9 @@ "question__title": "Available Captures for Rook", "question__title_slug": "available-captures-for-rook", "question__hide": false, - "total_acs": 37349, - "total_submitted": 53674, - "total_column_articles": 651, + "total_acs": 37441, + "total_submitted": 53784, + "total_column_articles": 653, "frontend_question_id": "999", "is_new_question": false }, @@ -53289,8 +53751,8 @@ "question__title": "Maximum Binary Tree II", "question__title_slug": "maximum-binary-tree-ii", "question__hide": false, - "total_acs": 34619, - "total_submitted": 50123, + "total_acs": 34698, + "total_submitted": 50213, "total_column_articles": 453, "frontend_question_id": "998", "is_new_question": false @@ -53310,9 +53772,9 @@ "question__title": "Find the Town Judge", "question__title_slug": "find-the-town-judge", "question__hide": false, - "total_acs": 97270, - "total_submitted": 188537, - "total_column_articles": 910, + "total_acs": 97685, + "total_submitted": 189445, + "total_column_articles": 914, "frontend_question_id": "997", "is_new_question": false }, @@ -53331,9 +53793,9 @@ "question__title": "Number of Squareful Arrays", "question__title_slug": "number-of-squareful-arrays", "question__hide": false, - "total_acs": 8343, - "total_submitted": 16215, - "total_column_articles": 149, + "total_acs": 8451, + "total_submitted": 16403, + "total_column_articles": 152, "frontend_question_id": "996", "is_new_question": false }, @@ -53352,8 +53814,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": 27390, - "total_submitted": 50585, + "total_acs": 27492, + "total_submitted": 50731, "total_column_articles": 292, "frontend_question_id": "995", "is_new_question": false @@ -53373,9 +53835,9 @@ "question__title": "Rotting Oranges", "question__title_slug": "rotting-oranges", "question__hide": false, - "total_acs": 184639, - "total_submitted": 354015, - "total_column_articles": 2576, + "total_acs": 188733, + "total_submitted": 361252, + "total_column_articles": 2596, "frontend_question_id": "994", "is_new_question": false }, @@ -53394,8 +53856,8 @@ "question__title": "Cousins in Binary Tree", "question__title_slug": "cousins-in-binary-tree", "question__hide": false, - "total_acs": 81470, - "total_submitted": 138232, + "total_acs": 81751, + "total_submitted": 138671, "total_column_articles": 1178, "frontend_question_id": "993", "is_new_question": false @@ -53415,9 +53877,9 @@ "question__title": "Subarrays with K Different Integers", "question__title_slug": "subarrays-with-k-different-integers", "question__hide": false, - "total_acs": 34283, - "total_submitted": 71354, - "total_column_articles": 349, + "total_acs": 34490, + "total_submitted": 71650, + "total_column_articles": 350, "frontend_question_id": "992", "is_new_question": false }, @@ -53436,9 +53898,9 @@ "question__title": "Broken Calculator", "question__title_slug": "broken-calculator", "question__hide": false, - "total_acs": 14155, - "total_submitted": 26666, - "total_column_articles": 161, + "total_acs": 14263, + "total_submitted": 26840, + "total_column_articles": 163, "frontend_question_id": "991", "is_new_question": false }, @@ -53457,9 +53919,9 @@ "question__title": "Satisfiability of Equality Equations", "question__title_slug": "satisfiability-of-equality-equations", "question__hide": false, - "total_acs": 59525, - "total_submitted": 110486, - "total_column_articles": 945, + "total_acs": 59865, + "total_submitted": 111111, + "total_column_articles": 947, "frontend_question_id": "990", "is_new_question": false }, @@ -53478,8 +53940,8 @@ "question__title": "Add to Array-Form of Integer", "question__title_slug": "add-to-array-form-of-integer", "question__hide": false, - "total_acs": 76878, - "total_submitted": 169973, + "total_acs": 77079, + "total_submitted": 170558, "total_column_articles": 825, "frontend_question_id": "989", "is_new_question": false @@ -53499,9 +53961,9 @@ "question__title": "Smallest String Starting From Leaf", "question__title_slug": "smallest-string-starting-from-leaf", "question__hide": false, - "total_acs": 18559, - "total_submitted": 35464, - "total_column_articles": 205, + "total_acs": 18705, + "total_submitted": 35696, + "total_column_articles": 207, "frontend_question_id": "988", "is_new_question": false }, @@ -53520,8 +53982,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": 44736, - "total_submitted": 77820, + "total_acs": 44970, + "total_submitted": 78205, "total_column_articles": 630, "frontend_question_id": "987", "is_new_question": false @@ -53541,8 +54003,8 @@ "question__title": "Interval List Intersections", "question__title_slug": "interval-list-intersections", "question__hide": false, - "total_acs": 67842, - "total_submitted": 98815, + "total_acs": 68099, + "total_submitted": 99173, "total_column_articles": 606, "frontend_question_id": "986", "is_new_question": false @@ -53562,9 +54024,9 @@ "question__title": "Sum of Even Numbers After Queries", "question__title_slug": "sum-of-even-numbers-after-queries", "question__hide": false, - "total_acs": 21018, - "total_submitted": 34214, - "total_column_articles": 239, + "total_acs": 21089, + "total_submitted": 34298, + "total_column_articles": 240, "frontend_question_id": "985", "is_new_question": false }, @@ -53583,9 +54045,9 @@ "question__title": "String Without AAA or BBB", "question__title_slug": "string-without-aaa-or-bbb", "question__hide": false, - "total_acs": 14737, - "total_submitted": 33371, - "total_column_articles": 234, + "total_acs": 14836, + "total_submitted": 33544, + "total_column_articles": 236, "frontend_question_id": "984", "is_new_question": false }, @@ -53604,9 +54066,9 @@ "question__title": "Minimum Cost For Tickets", "question__title_slug": "minimum-cost-for-tickets", "question__hide": false, - "total_acs": 49589, - "total_submitted": 78656, - "total_column_articles": 619, + "total_acs": 50036, + "total_submitted": 79378, + "total_column_articles": 620, "frontend_question_id": "983", "is_new_question": false }, @@ -53625,8 +54087,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": 21971, - "total_submitted": 32546, + "total_acs": 22006, + "total_submitted": 32603, "total_column_articles": 154, "frontend_question_id": "982", "is_new_question": false @@ -53646,9 +54108,9 @@ "question__title": "Time Based Key-Value Store", "question__title_slug": "time-based-key-value-store", "question__hide": false, - "total_acs": 33473, - "total_submitted": 63699, - "total_column_articles": 401, + "total_acs": 33707, + "total_submitted": 64119, + "total_column_articles": 403, "frontend_question_id": "981", "is_new_question": false }, @@ -53667,8 +54129,8 @@ "question__title": "Unique Paths III", "question__title_slug": "unique-paths-iii", "question__hide": false, - "total_acs": 38404, - "total_submitted": 49361, + "total_acs": 38606, + "total_submitted": 49666, "total_column_articles": 437, "frontend_question_id": "980", "is_new_question": false @@ -53688,8 +54150,8 @@ "question__title": "Distribute Coins in Binary Tree", "question__title_slug": "distribute-coins-in-binary-tree", "question__hide": false, - "total_acs": 31233, - "total_submitted": 40826, + "total_acs": 31433, + "total_submitted": 41068, "total_column_articles": 368, "frontend_question_id": "979", "is_new_question": false @@ -53709,9 +54171,9 @@ "question__title": "Longest Turbulent Subarray", "question__title_slug": "longest-turbulent-subarray", "question__hide": false, - "total_acs": 55888, - "total_submitted": 116951, - "total_column_articles": 712, + "total_acs": 56041, + "total_submitted": 117231, + "total_column_articles": 714, "frontend_question_id": "978", "is_new_question": false }, @@ -53730,9 +54192,9 @@ "question__title": "Squares of a Sorted Array", "question__title_slug": "squares-of-a-sorted-array", "question__hide": false, - "total_acs": 677258, - "total_submitted": 995797, - "total_column_articles": 3942, + "total_acs": 683989, + "total_submitted": 1005232, + "total_column_articles": 3956, "frontend_question_id": "977", "is_new_question": false }, @@ -53751,9 +54213,9 @@ "question__title": "Largest Perimeter Triangle", "question__title_slug": "largest-perimeter-triangle", "question__hide": false, - "total_acs": 97174, - "total_submitted": 168739, - "total_column_articles": 923, + "total_acs": 97568, + "total_submitted": 169427, + "total_column_articles": 927, "frontend_question_id": "976", "is_new_question": false }, @@ -53772,8 +54234,8 @@ "question__title": "Odd Even Jump", "question__title_slug": "odd-even-jump", "question__hide": false, - "total_acs": 6391, - "total_submitted": 13077, + "total_acs": 6441, + "total_submitted": 13157, "total_column_articles": 96, "frontend_question_id": "975", "is_new_question": false @@ -53793,9 +54255,9 @@ "question__title": "Subarray Sums Divisible by K", "question__title_slug": "subarray-sums-divisible-by-k", "question__hide": false, - "total_acs": 66226, - "total_submitted": 136686, - "total_column_articles": 600, + "total_acs": 66774, + "total_submitted": 137660, + "total_column_articles": 602, "frontend_question_id": "974", "is_new_question": false }, @@ -53814,9 +54276,9 @@ "question__title": "K Closest Points to Origin", "question__title_slug": "k-closest-points-to-origin", "question__hide": false, - "total_acs": 101373, - "total_submitted": 155128, - "total_column_articles": 841, + "total_acs": 101843, + "total_submitted": 155820, + "total_column_articles": 844, "frontend_question_id": "973", "is_new_question": false }, @@ -53835,9 +54297,9 @@ "question__title": "Fibonacci Number", "question__title_slug": "fibonacci-number", "question__hide": false, - "total_acs": 703228, - "total_submitted": 1067195, - "total_column_articles": 3615, + "total_acs": 710039, + "total_submitted": 1077419, + "total_column_articles": 3629, "frontend_question_id": "509", "is_new_question": false }, @@ -53856,8 +54318,8 @@ "question__title": "Equal Rational Numbers", "question__title_slug": "equal-rational-numbers", "question__hide": false, - "total_acs": 2552, - "total_submitted": 6004, + "total_acs": 2562, + "total_submitted": 6031, "total_column_articles": 57, "frontend_question_id": "972", "is_new_question": false @@ -53877,9 +54339,9 @@ "question__title": "Flip Binary Tree To Match Preorder Traversal", "question__title_slug": "flip-binary-tree-to-match-preorder-traversal", "question__hide": false, - "total_acs": 12142, - "total_submitted": 25993, - "total_column_articles": 177, + "total_acs": 12219, + "total_submitted": 26153, + "total_column_articles": 178, "frontend_question_id": "971", "is_new_question": false }, @@ -53898,9 +54360,9 @@ "question__title": "Powerful Integers", "question__title_slug": "powerful-integers", "question__hide": false, - "total_acs": 30604, - "total_submitted": 65157, - "total_column_articles": 312, + "total_acs": 30674, + "total_submitted": 65286, + "total_column_articles": 313, "frontend_question_id": "970", "is_new_question": false }, @@ -53919,8 +54381,8 @@ "question__title": "Pancake Sorting", "question__title_slug": "pancake-sorting", "question__hide": false, - "total_acs": 50519, - "total_submitted": 74497, + "total_acs": 50648, + "total_submitted": 74666, "total_column_articles": 706, "frontend_question_id": "969", "is_new_question": false @@ -53940,9 +54402,9 @@ "question__title": "Binary Tree Cameras", "question__title_slug": "binary-tree-cameras", "question__hide": false, - "total_acs": 79320, - "total_submitted": 151300, - "total_column_articles": 705, + "total_acs": 80543, + "total_submitted": 153435, + "total_column_articles": 709, "frontend_question_id": "968", "is_new_question": false }, @@ -53961,8 +54423,8 @@ "question__title": "Numbers With Same Consecutive Differences", "question__title_slug": "numbers-with-same-consecutive-differences", "question__hide": false, - "total_acs": 14201, - "total_submitted": 27388, + "total_acs": 14304, + "total_submitted": 27570, "total_column_articles": 249, "frontend_question_id": "967", "is_new_question": false @@ -53982,8 +54444,8 @@ "question__title": "Vowel Spellchecker", "question__title_slug": "vowel-spellchecker", "question__hide": false, - "total_acs": 5299, - "total_submitted": 12012, + "total_acs": 5346, + "total_submitted": 12151, "total_column_articles": 74, "frontend_question_id": "966", "is_new_question": false @@ -54003,9 +54465,9 @@ "question__title": "Univalued Binary Tree", "question__title_slug": "univalued-binary-tree", "question__hide": false, - "total_acs": 90125, - "total_submitted": 129169, - "total_column_articles": 944, + "total_acs": 90929, + "total_submitted": 130471, + "total_column_articles": 949, "frontend_question_id": "965", "is_new_question": false }, @@ -54024,8 +54486,8 @@ "question__title": "Least Operators to Express Number", "question__title_slug": "least-operators-to-express-number", "question__hide": false, - "total_acs": 2660, - "total_submitted": 5610, + "total_acs": 2672, + "total_submitted": 5633, "total_column_articles": 42, "frontend_question_id": "964", "is_new_question": false @@ -54045,9 +54507,9 @@ "question__title": "Minimum Area Rectangle II", "question__title_slug": "minimum-area-rectangle-ii", "question__hide": false, - "total_acs": 4435, - "total_submitted": 8465, - "total_column_articles": 59, + "total_acs": 4462, + "total_submitted": 8523, + "total_column_articles": 60, "frontend_question_id": "963", "is_new_question": false }, @@ -54066,9 +54528,9 @@ "question__title": "Maximum Width Ramp", "question__title_slug": "maximum-width-ramp", "question__hide": false, - "total_acs": 28012, - "total_submitted": 57442, - "total_column_articles": 257, + "total_acs": 28315, + "total_submitted": 57898, + "total_column_articles": 261, "frontend_question_id": "962", "is_new_question": false }, @@ -54087,9 +54549,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": 86079, - "total_submitted": 122398, - "total_column_articles": 763, + "total_acs": 86387, + "total_submitted": 122792, + "total_column_articles": 765, "frontend_question_id": "961", "is_new_question": false }, @@ -54108,8 +54570,8 @@ "question__title": "Delete Columns to Make Sorted III", "question__title_slug": "delete-columns-to-make-sorted-iii", "question__hide": false, - "total_acs": 4219, - "total_submitted": 7057, + "total_acs": 4261, + "total_submitted": 7113, "total_column_articles": 66, "frontend_question_id": "960", "is_new_question": false @@ -54129,8 +54591,8 @@ "question__title": "Regions Cut By Slashes", "question__title_slug": "regions-cut-by-slashes", "question__hide": false, - "total_acs": 24092, - "total_submitted": 32556, + "total_acs": 24138, + "total_submitted": 32630, "total_column_articles": 365, "frontend_question_id": "959", "is_new_question": false @@ -54150,9 +54612,9 @@ "question__title": "Check Completeness of a Binary Tree", "question__title_slug": "check-completeness-of-a-binary-tree", "question__hide": false, - "total_acs": 57575, - "total_submitted": 104796, - "total_column_articles": 506, + "total_acs": 58000, + "total_submitted": 105453, + "total_column_articles": 509, "frontend_question_id": "958", "is_new_question": false }, @@ -54171,8 +54633,8 @@ "question__title": "Prison Cells After N Days", "question__title_slug": "prison-cells-after-n-days", "question__hide": false, - "total_acs": 20963, - "total_submitted": 55641, + "total_acs": 21033, + "total_submitted": 55759, "total_column_articles": 201, "frontend_question_id": "957", "is_new_question": false @@ -54192,9 +54654,9 @@ "question__title": "Tallest Billboard", "question__title_slug": "tallest-billboard", "question__hide": false, - "total_acs": 8034, - "total_submitted": 16769, - "total_column_articles": 89, + "total_acs": 8149, + "total_submitted": 16987, + "total_column_articles": 90, "frontend_question_id": "956", "is_new_question": false }, @@ -54213,8 +54675,8 @@ "question__title": "Delete Columns to Make Sorted II", "question__title_slug": "delete-columns-to-make-sorted-ii", "question__hide": false, - "total_acs": 6255, - "total_submitted": 17246, + "total_acs": 6288, + "total_submitted": 17319, "total_column_articles": 98, "frontend_question_id": "955", "is_new_question": false @@ -54234,8 +54696,8 @@ "question__title": "Array of Doubled Pairs", "question__title_slug": "array-of-doubled-pairs", "question__hide": false, - "total_acs": 44577, - "total_submitted": 113382, + "total_acs": 44633, + "total_submitted": 113494, "total_column_articles": 482, "frontend_question_id": "954", "is_new_question": false @@ -54255,9 +54717,9 @@ "question__title": "Verifying an Alien Dictionary", "question__title_slug": "verifying-an-alien-dictionary", "question__hide": false, - "total_acs": 58244, - "total_submitted": 100952, - "total_column_articles": 723, + "total_acs": 58441, + "total_submitted": 101283, + "total_column_articles": 725, "frontend_question_id": "953", "is_new_question": false }, @@ -54276,9 +54738,9 @@ "question__title": "Largest Component Size by Common Factor", "question__title_slug": "largest-component-size-by-common-factor", "question__hide": false, - "total_acs": 20656, - "total_submitted": 40395, - "total_column_articles": 193, + "total_acs": 20804, + "total_submitted": 40632, + "total_column_articles": 195, "frontend_question_id": "952", "is_new_question": false }, @@ -54297,8 +54759,8 @@ "question__title": "Flip Equivalent Binary Trees", "question__title_slug": "flip-equivalent-binary-trees", "question__hide": false, - "total_acs": 19621, - "total_submitted": 29105, + "total_acs": 19718, + "total_submitted": 29228, "total_column_articles": 265, "frontend_question_id": "951", "is_new_question": false @@ -54318,9 +54780,9 @@ "question__title": "Reveal Cards In Increasing Order", "question__title_slug": "reveal-cards-in-increasing-order", "question__hide": false, - "total_acs": 16333, - "total_submitted": 20719, - "total_column_articles": 254, + "total_acs": 16441, + "total_submitted": 20834, + "total_column_articles": 255, "frontend_question_id": "950", "is_new_question": false }, @@ -54339,8 +54801,8 @@ "question__title": "Largest Time for Given Digits", "question__title_slug": "largest-time-for-given-digits", "question__hide": false, - "total_acs": 12976, - "total_submitted": 33782, + "total_acs": 13047, + "total_submitted": 33979, "total_column_articles": 199, "frontend_question_id": "949", "is_new_question": false @@ -54360,8 +54822,8 @@ "question__title": "Bag of Tokens", "question__title_slug": "bag-of-tokens", "question__hide": false, - "total_acs": 11407, - "total_submitted": 27392, + "total_acs": 11469, + "total_submitted": 27516, "total_column_articles": 169, "frontend_question_id": "948", "is_new_question": false @@ -54381,9 +54843,9 @@ "question__title": "Most Stones Removed with Same Row or Column", "question__title_slug": "most-stones-removed-with-same-row-or-column", "question__hide": false, - "total_acs": 36497, - "total_submitted": 59215, - "total_column_articles": 438, + "total_acs": 36639, + "total_submitted": 59463, + "total_column_articles": 439, "frontend_question_id": "947", "is_new_question": false }, @@ -54402,9 +54864,9 @@ "question__title": "Validate Stack Sequences", "question__title_slug": "validate-stack-sequences", "question__hide": false, - "total_acs": 92163, - "total_submitted": 138501, - "total_column_articles": 909, + "total_acs": 92855, + "total_submitted": 139480, + "total_column_articles": 912, "frontend_question_id": "946", "is_new_question": false }, @@ -54423,9 +54885,9 @@ "question__title": "Minimum Increment to Make Array Unique", "question__title_slug": "minimum-increment-to-make-array-unique", "question__hide": false, - "total_acs": 45679, - "total_submitted": 95144, - "total_column_articles": 639, + "total_acs": 45803, + "total_submitted": 95380, + "total_column_articles": 641, "frontend_question_id": "945", "is_new_question": false }, @@ -54444,9 +54906,9 @@ "question__title": "Delete Columns to Make Sorted", "question__title_slug": "delete-columns-to-make-sorted", "question__hide": false, - "total_acs": 60188, - "total_submitted": 87058, - "total_column_articles": 517, + "total_acs": 60341, + "total_submitted": 87264, + "total_column_articles": 518, "frontend_question_id": "944", "is_new_question": false }, @@ -54465,9 +54927,9 @@ "question__title": "Find the Shortest Superstring", "question__title_slug": "find-the-shortest-superstring", "question__hide": false, - "total_acs": 4403, - "total_submitted": 9051, - "total_column_articles": 85, + "total_acs": 4444, + "total_submitted": 9124, + "total_column_articles": 86, "frontend_question_id": "943", "is_new_question": false }, @@ -54486,9 +54948,9 @@ "question__title": "DI String Match", "question__title_slug": "di-string-match", "question__hide": false, - "total_acs": 71365, - "total_submitted": 92136, - "total_column_articles": 817, + "total_acs": 71600, + "total_submitted": 92415, + "total_column_articles": 818, "frontend_question_id": "942", "is_new_question": false }, @@ -54507,9 +54969,9 @@ "question__title": "Valid Mountain Array", "question__title_slug": "valid-mountain-array", "question__hide": false, - "total_acs": 93307, - "total_submitted": 234370, - "total_column_articles": 844, + "total_acs": 93770, + "total_submitted": 235382, + "total_column_articles": 846, "frontend_question_id": "941", "is_new_question": false }, @@ -54528,8 +54990,8 @@ "question__title": "Distinct Subsequences II", "question__title_slug": "distinct-subsequences-ii", "question__hide": false, - "total_acs": 32553, - "total_submitted": 61385, + "total_acs": 32751, + "total_submitted": 61762, "total_column_articles": 287, "frontend_question_id": "940", "is_new_question": false @@ -54549,9 +55011,9 @@ "question__title": "Minimum Area Rectangle", "question__title_slug": "minimum-area-rectangle", "question__hide": false, - "total_acs": 10384, - "total_submitted": 20937, - "total_column_articles": 117, + "total_acs": 10460, + "total_submitted": 21063, + "total_column_articles": 118, "frontend_question_id": "939", "is_new_question": false }, @@ -54570,9 +55032,9 @@ "question__title": "Range Sum of BST", "question__title_slug": "range-sum-of-bst", "question__hide": false, - "total_acs": 153192, - "total_submitted": 184226, - "total_column_articles": 1135, + "total_acs": 153779, + "total_submitted": 184899, + "total_column_articles": 1136, "frontend_question_id": "938", "is_new_question": false }, @@ -54591,9 +55053,9 @@ "question__title": "Reorder Data in Log Files", "question__title_slug": "reorder-data-in-log-files", "question__hide": false, - "total_acs": 43025, - "total_submitted": 67778, - "total_column_articles": 509, + "total_acs": 43145, + "total_submitted": 67937, + "total_column_articles": 512, "frontend_question_id": "937", "is_new_question": false }, @@ -54612,8 +55074,8 @@ "question__title": "Stamping The Sequence", "question__title_slug": "stamping-the-sequence", "question__hide": false, - "total_acs": 3940, - "total_submitted": 8608, + "total_acs": 4136, + "total_submitted": 8906, "total_column_articles": 51, "frontend_question_id": "936", "is_new_question": false @@ -54633,9 +55095,9 @@ "question__title": "Knight Dialer", "question__title_slug": "knight-dialer", "question__hide": false, - "total_acs": 11462, - "total_submitted": 21224, - "total_column_articles": 146, + "total_acs": 11576, + "total_submitted": 21384, + "total_column_articles": 149, "frontend_question_id": "935", "is_new_question": false }, @@ -54654,9 +55116,9 @@ "question__title": "Shortest Bridge", "question__title_slug": "shortest-bridge", "question__hide": false, - "total_acs": 73483, - "total_submitted": 139561, - "total_column_articles": 762, + "total_acs": 73768, + "total_submitted": 140025, + "total_column_articles": 764, "frontend_question_id": "934", "is_new_question": false }, @@ -54675,9 +55137,9 @@ "question__title": "Number of Recent Calls", "question__title_slug": "number-of-recent-calls", "question__hide": false, - "total_acs": 119333, - "total_submitted": 154936, - "total_column_articles": 900, + "total_acs": 120493, + "total_submitted": 156388, + "total_column_articles": 905, "frontend_question_id": "933", "is_new_question": false }, @@ -54696,8 +55158,8 @@ "question__title": "Beautiful Array", "question__title_slug": "beautiful-array", "question__hide": false, - "total_acs": 15348, - "total_submitted": 23077, + "total_acs": 15421, + "total_submitted": 23180, "total_column_articles": 136, "frontend_question_id": "932", "is_new_question": false @@ -54717,9 +55179,9 @@ "question__title": "Minimum Falling Path Sum", "question__title_slug": "minimum-falling-path-sum", "question__hide": false, - "total_acs": 105656, - "total_submitted": 156466, - "total_column_articles": 1402, + "total_acs": 106907, + "total_submitted": 158247, + "total_column_articles": 1413, "frontend_question_id": "931", "is_new_question": false }, @@ -54738,9 +55200,9 @@ "question__title": "Binary Subarrays With Sum", "question__title_slug": "binary-subarrays-with-sum", "question__hide": false, - "total_acs": 50410, - "total_submitted": 90299, - "total_column_articles": 463, + "total_acs": 50941, + "total_submitted": 91044, + "total_column_articles": 466, "frontend_question_id": "930", "is_new_question": false }, @@ -54759,9 +55221,9 @@ "question__title": "Unique Email Addresses", "question__title_slug": "unique-email-addresses", "question__hide": false, - "total_acs": 59274, - "total_submitted": 86589, - "total_column_articles": 571, + "total_acs": 59462, + "total_submitted": 86824, + "total_column_articles": 570, "frontend_question_id": "929", "is_new_question": false }, @@ -54780,8 +55242,8 @@ "question__title": "Minimize Malware Spread II", "question__title_slug": "minimize-malware-spread-ii", "question__hide": false, - "total_acs": 15675, - "total_submitted": 28767, + "total_acs": 15788, + "total_submitted": 28977, "total_column_articles": 146, "frontend_question_id": "928", "is_new_question": false @@ -54801,8 +55263,8 @@ "question__title": "Three Equal Parts", "question__title_slug": "three-equal-parts", "question__hide": false, - "total_acs": 24625, - "total_submitted": 56045, + "total_acs": 24666, + "total_submitted": 56120, "total_column_articles": 371, "frontend_question_id": "927", "is_new_question": false @@ -54822,9 +55284,9 @@ "question__title": "Flip String to Monotone Increasing", "question__title_slug": "flip-string-to-monotone-increasing", "question__hide": false, - "total_acs": 40915, - "total_submitted": 64346, - "total_column_articles": 550, + "total_acs": 41122, + "total_submitted": 64661, + "total_column_articles": 552, "frontend_question_id": "926", "is_new_question": false }, @@ -54843,9 +55305,9 @@ "question__title": "Long Pressed Name", "question__title_slug": "long-pressed-name", "question__hide": false, - "total_acs": 72904, - "total_submitted": 195358, - "total_column_articles": 860, + "total_acs": 73334, + "total_submitted": 196530, + "total_column_articles": 863, "frontend_question_id": "925", "is_new_question": false }, @@ -54864,9 +55326,9 @@ "question__title": "Minimize Malware Spread", "question__title_slug": "minimize-malware-spread", "question__hide": false, - "total_acs": 24657, - "total_submitted": 58827, - "total_column_articles": 258, + "total_acs": 24895, + "total_submitted": 59420, + "total_column_articles": 260, "frontend_question_id": "924", "is_new_question": false }, @@ -54885,8 +55347,8 @@ "question__title": "3Sum With Multiplicity", "question__title_slug": "3sum-with-multiplicity", "question__hide": false, - "total_acs": 11360, - "total_submitted": 29783, + "total_acs": 11414, + "total_submitted": 29888, "total_column_articles": 132, "frontend_question_id": "923", "is_new_question": false @@ -54906,9 +55368,9 @@ "question__title": "Sort Array By Parity II", "question__title_slug": "sort-array-by-parity-ii", "question__hide": false, - "total_acs": 126718, - "total_submitted": 177446, - "total_column_articles": 1123, + "total_acs": 127382, + "total_submitted": 178343, + "total_column_articles": 1125, "frontend_question_id": "922", "is_new_question": false }, @@ -54927,9 +55389,9 @@ "question__title": "Minimum Add to Make Parentheses Valid", "question__title_slug": "minimum-add-to-make-parentheses-valid", "question__hide": false, - "total_acs": 72551, - "total_submitted": 99168, - "total_column_articles": 942, + "total_acs": 72838, + "total_submitted": 99548, + "total_column_articles": 944, "frontend_question_id": "921", "is_new_question": false }, @@ -54948,8 +55410,8 @@ "question__title": "Number of Music Playlists", "question__title_slug": "number-of-music-playlists", "question__hide": false, - "total_acs": 4324, - "total_submitted": 7913, + "total_acs": 4363, + "total_submitted": 7976, "total_column_articles": 43, "frontend_question_id": "920", "is_new_question": false @@ -54969,8 +55431,8 @@ "question__title": "Complete Binary Tree Inserter", "question__title_slug": "complete-binary-tree-inserter", "question__hide": false, - "total_acs": 33667, - "total_submitted": 50145, + "total_acs": 33736, + "total_submitted": 50238, "total_column_articles": 425, "frontend_question_id": "919", "is_new_question": false @@ -54990,9 +55452,9 @@ "question__title": "Maximum Sum Circular Subarray", "question__title_slug": "maximum-sum-circular-subarray", "question__hide": false, - "total_acs": 87585, - "total_submitted": 209312, - "total_column_articles": 674, + "total_acs": 88966, + "total_submitted": 211789, + "total_column_articles": 681, "frontend_question_id": "918", "is_new_question": false }, @@ -55011,9 +55473,9 @@ "question__title": "Reverse Only Letters", "question__title_slug": "reverse-only-letters", "question__hide": false, - "total_acs": 83810, - "total_submitted": 141153, - "total_column_articles": 1130, + "total_acs": 84201, + "total_submitted": 141745, + "total_column_articles": 1133, "frontend_question_id": "917", "is_new_question": false }, @@ -55032,9 +55494,9 @@ "question__title": "Word Subsets", "question__title_slug": "word-subsets", "question__hide": false, - "total_acs": 10621, - "total_submitted": 22523, - "total_column_articles": 141, + "total_acs": 10711, + "total_submitted": 22722, + "total_column_articles": 142, "frontend_question_id": "916", "is_new_question": false }, @@ -55053,8 +55515,8 @@ "question__title": "Partition Array into Disjoint Intervals", "question__title_slug": "partition-array-into-disjoint-intervals", "question__hide": false, - "total_acs": 50943, - "total_submitted": 101662, + "total_acs": 51015, + "total_submitted": 101789, "total_column_articles": 572, "frontend_question_id": "915", "is_new_question": false @@ -55074,9 +55536,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": 64216, - "total_submitted": 172733, - "total_column_articles": 772, + "total_acs": 64478, + "total_submitted": 173495, + "total_column_articles": 774, "frontend_question_id": "914", "is_new_question": false }, @@ -55095,8 +55557,8 @@ "question__title": "Cat and Mouse", "question__title_slug": "cat-and-mouse", "question__hide": false, - "total_acs": 18616, - "total_submitted": 35575, + "total_acs": 18635, + "total_submitted": 35663, "total_column_articles": 143, "frontend_question_id": "913", "is_new_question": false @@ -55116,9 +55578,9 @@ "question__title": "Sort an Array", "question__title_slug": "sort-an-array", "question__hide": false, - "total_acs": 646719, - "total_submitted": 1314003, - "total_column_articles": 2441, + "total_acs": 652144, + "total_submitted": 1326913, + "total_column_articles": 2452, "frontend_question_id": "912", "is_new_question": false }, @@ -55137,8 +55599,8 @@ "question__title": "Online Election", "question__title_slug": "online-election", "question__hide": false, - "total_acs": 33640, - "total_submitted": 62402, + "total_acs": 33765, + "total_submitted": 62586, "total_column_articles": 382, "frontend_question_id": "911", "is_new_question": false @@ -55158,8 +55620,8 @@ "question__title": "Smallest Range II", "question__title_slug": "smallest-range-ii", "question__hide": false, - "total_acs": 13156, - "total_submitted": 36091, + "total_acs": 13193, + "total_submitted": 36171, "total_column_articles": 128, "frontend_question_id": "910", "is_new_question": false @@ -55179,9 +55641,9 @@ "question__title": "Snakes and Ladders", "question__title_slug": "snakes-and-ladders", "question__hide": false, - "total_acs": 30003, - "total_submitted": 68166, - "total_column_articles": 265, + "total_acs": 30750, + "total_submitted": 69946, + "total_column_articles": 267, "frontend_question_id": "909", "is_new_question": false }, @@ -55200,8 +55662,8 @@ "question__title": "Smallest Range I", "question__title_slug": "smallest-range-i", "question__hide": false, - "total_acs": 59643, - "total_submitted": 79981, + "total_acs": 59828, + "total_submitted": 80217, "total_column_articles": 605, "frontend_question_id": "908", "is_new_question": false @@ -55221,8 +55683,8 @@ "question__title": "Sum of Subarray Minimums", "question__title_slug": "sum-of-subarray-minimums", "question__hide": false, - "total_acs": 67217, - "total_submitted": 169856, + "total_acs": 67511, + "total_submitted": 170478, "total_column_articles": 568, "frontend_question_id": "907", "is_new_question": false @@ -55242,9 +55704,9 @@ "question__title": "Super Palindromes", "question__title_slug": "super-palindromes", "question__hide": false, - "total_acs": 5631, - "total_submitted": 17092, - "total_column_articles": 87, + "total_acs": 5709, + "total_submitted": 17264, + "total_column_articles": 88, "frontend_question_id": "906", "is_new_question": false }, @@ -55263,9 +55725,9 @@ "question__title": "Sort Array By Parity", "question__title_slug": "sort-array-by-parity", "question__hide": false, - "total_acs": 132994, - "total_submitted": 187029, - "total_column_articles": 1537, + "total_acs": 133518, + "total_submitted": 187745, + "total_column_articles": 1540, "frontend_question_id": "905", "is_new_question": false }, @@ -55284,9 +55746,9 @@ "question__title": "Fruit Into Baskets", "question__title_slug": "fruit-into-baskets", "question__hide": false, - "total_acs": 166140, - "total_submitted": 369424, - "total_column_articles": 1726, + "total_acs": 168173, + "total_submitted": 373760, + "total_column_articles": 1748, "frontend_question_id": "904", "is_new_question": false }, @@ -55305,8 +55767,8 @@ "question__title": "Valid Permutations for DI Sequence", "question__title_slug": "valid-permutations-for-di-sequence", "question__hide": false, - "total_acs": 5052, - "total_submitted": 8747, + "total_acs": 5085, + "total_submitted": 8793, "total_column_articles": 69, "frontend_question_id": "903", "is_new_question": false @@ -55326,9 +55788,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": 30927, - "total_submitted": 65122, - "total_column_articles": 424, + "total_acs": 31108, + "total_submitted": 65434, + "total_column_articles": 427, "frontend_question_id": "902", "is_new_question": false }, @@ -55347,9 +55809,9 @@ "question__title": "Online Stock Span", "question__title_slug": "online-stock-span", "question__hide": false, - "total_acs": 89876, - "total_submitted": 140273, - "total_column_articles": 814, + "total_acs": 90496, + "total_submitted": 141258, + "total_column_articles": 819, "frontend_question_id": "901", "is_new_question": false }, @@ -55368,8 +55830,8 @@ "question__title": "RLE Iterator", "question__title_slug": "rle-iterator", "question__hide": false, - "total_acs": 6892, - "total_submitted": 13146, + "total_acs": 6923, + "total_submitted": 13195, "total_column_articles": 96, "frontend_question_id": "900", "is_new_question": false @@ -55389,8 +55851,8 @@ "question__title": "Orderly Queue", "question__title_slug": "orderly-queue", "question__hide": false, - "total_acs": 29850, - "total_submitted": 46795, + "total_acs": 29905, + "total_submitted": 46900, "total_column_articles": 288, "frontend_question_id": "899", "is_new_question": false @@ -55410,8 +55872,8 @@ "question__title": "Bitwise ORs of Subarrays", "question__title_slug": "bitwise-ors-of-subarrays", "question__hide": false, - "total_acs": 10462, - "total_submitted": 25232, + "total_acs": 10552, + "total_submitted": 25371, "total_column_articles": 66, "frontend_question_id": "898", "is_new_question": false @@ -55431,9 +55893,9 @@ "question__title": "Increasing Order Search Tree", "question__title_slug": "increasing-order-search-tree", "question__hide": false, - "total_acs": 83396, - "total_submitted": 112982, - "total_column_articles": 932, + "total_acs": 83664, + "total_submitted": 113398, + "total_column_articles": 935, "frontend_question_id": "897", "is_new_question": false }, @@ -55452,9 +55914,9 @@ "question__title": "Monotonic Array", "question__title_slug": "monotonic-array", "question__hide": false, - "total_acs": 100505, - "total_submitted": 177863, - "total_column_articles": 1136, + "total_acs": 100966, + "total_submitted": 178625, + "total_column_articles": 1143, "frontend_question_id": "896", "is_new_question": false }, @@ -55473,9 +55935,9 @@ "question__title": "Maximum Frequency Stack", "question__title_slug": "maximum-frequency-stack", "question__hide": false, - "total_acs": 34578, - "total_submitted": 54160, - "total_column_articles": 335, + "total_acs": 34778, + "total_submitted": 54465, + "total_column_articles": 336, "frontend_question_id": "895", "is_new_question": false }, @@ -55494,8 +55956,8 @@ "question__title": "All Possible Full Binary Trees", "question__title_slug": "all-possible-full-binary-trees", "question__hide": false, - "total_acs": 37769, - "total_submitted": 46859, + "total_acs": 37941, + "total_submitted": 47061, "total_column_articles": 287, "frontend_question_id": "894", "is_new_question": false @@ -55515,8 +55977,8 @@ "question__title": "Groups of Special-Equivalent Strings", "question__title_slug": "groups-of-special-equivalent-strings", "question__hide": false, - "total_acs": 14117, - "total_submitted": 19161, + "total_acs": 14158, + "total_submitted": 19210, "total_column_articles": 151, "frontend_question_id": "893", "is_new_question": false @@ -55536,8 +55998,8 @@ "question__title": "Surface Area of 3D Shapes", "question__title_slug": "surface-area-of-3d-shapes", "question__hide": false, - "total_acs": 40767, - "total_submitted": 62781, + "total_acs": 40839, + "total_submitted": 62873, "total_column_articles": 789, "frontend_question_id": "892", "is_new_question": false @@ -55557,8 +56019,8 @@ "question__title": "Sum of Subsequence Widths", "question__title_slug": "sum-of-subsequence-widths", "question__hide": false, - "total_acs": 21531, - "total_submitted": 46132, + "total_acs": 21544, + "total_submitted": 46169, "total_column_articles": 205, "frontend_question_id": "891", "is_new_question": false @@ -55578,9 +56040,9 @@ "question__title": "Find and Replace Pattern", "question__title_slug": "find-and-replace-pattern", "question__hide": false, - "total_acs": 33233, - "total_submitted": 42246, - "total_column_articles": 488, + "total_acs": 33300, + "total_submitted": 42327, + "total_column_articles": 490, "frontend_question_id": "890", "is_new_question": false }, @@ -55599,9 +56061,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": 60965, - "total_submitted": 87042, - "total_column_articles": 527, + "total_acs": 61448, + "total_submitted": 87773, + "total_column_articles": 530, "frontend_question_id": "889", "is_new_question": false }, @@ -55620,9 +56082,9 @@ "question__title": "Fair Candy Swap", "question__title_slug": "fair-candy-swap", "question__hide": false, - "total_acs": 73611, - "total_submitted": 115861, - "total_column_articles": 643, + "total_acs": 73913, + "total_submitted": 116263, + "total_column_articles": 644, "frontend_question_id": "888", "is_new_question": false }, @@ -55641,9 +56103,9 @@ "question__title": "Super Egg Drop", "question__title_slug": "super-egg-drop", "question__hide": false, - "total_acs": 84242, - "total_submitted": 271224, - "total_column_articles": 487, + "total_acs": 84949, + "total_submitted": 272777, + "total_column_articles": 489, "frontend_question_id": "887", "is_new_question": false }, @@ -55662,9 +56124,9 @@ "question__title": "Possible Bipartition", "question__title_slug": "possible-bipartition", "question__hide": false, - "total_acs": 53153, - "total_submitted": 101560, - "total_column_articles": 638, + "total_acs": 53427, + "total_submitted": 102011, + "total_column_articles": 639, "frontend_question_id": "886", "is_new_question": false }, @@ -55683,8 +56145,8 @@ "question__title": "Spiral Matrix III", "question__title_slug": "spiral-matrix-iii", "question__hide": false, - "total_acs": 9661, - "total_submitted": 13390, + "total_acs": 9714, + "total_submitted": 13455, "total_column_articles": 146, "frontend_question_id": "885", "is_new_question": false @@ -55704,9 +56166,9 @@ "question__title": "Uncommon Words from Two Sentences", "question__title_slug": "uncommon-words-from-two-sentences", "question__hide": false, - "total_acs": 54670, - "total_submitted": 76658, - "total_column_articles": 684, + "total_acs": 54860, + "total_submitted": 76940, + "total_column_articles": 686, "frontend_question_id": "884", "is_new_question": false }, @@ -55725,8 +56187,8 @@ "question__title": "Projection Area of 3D Shapes", "question__title_slug": "projection-area-of-3d-shapes", "question__hide": false, - "total_acs": 48275, - "total_submitted": 63026, + "total_acs": 48434, + "total_submitted": 63217, "total_column_articles": 583, "frontend_question_id": "883", "is_new_question": false @@ -55746,8 +56208,8 @@ "question__title": "Reachable Nodes In Subdivided Graph", "question__title_slug": "reachable-nodes-in-subdivided-graph", "question__hide": false, - "total_acs": 16770, - "total_submitted": 26337, + "total_acs": 16807, + "total_submitted": 26398, "total_column_articles": 150, "frontend_question_id": "882", "is_new_question": false @@ -55767,9 +56229,9 @@ "question__title": "Boats to Save People", "question__title_slug": "boats-to-save-people", "question__hide": false, - "total_acs": 75424, - "total_submitted": 138828, - "total_column_articles": 795, + "total_acs": 75802, + "total_submitted": 139442, + "total_column_articles": 796, "frontend_question_id": "881", "is_new_question": false }, @@ -55788,8 +56250,8 @@ "question__title": "Decoded String at Index", "question__title_slug": "decoded-string-at-index", "question__hide": false, - "total_acs": 9620, - "total_submitted": 34724, + "total_acs": 9644, + "total_submitted": 34826, "total_column_articles": 118, "frontend_question_id": "880", "is_new_question": false @@ -55809,9 +56271,9 @@ "question__title": "Generate Random Point in a Circle", "question__title_slug": "generate-random-point-in-a-circle", "question__hide": false, - "total_acs": 31367, - "total_submitted": 64893, - "total_column_articles": 192, + "total_acs": 31443, + "total_submitted": 65060, + "total_column_articles": 193, "frontend_question_id": "478", "is_new_question": false }, @@ -55830,9 +56292,9 @@ "question__title": "Random Point in Non-overlapping Rectangles", "question__title_slug": "random-point-in-non-overlapping-rectangles", "question__hide": false, - "total_acs": 25284, - "total_submitted": 60208, - "total_column_articles": 221, + "total_acs": 25313, + "total_submitted": 60263, + "total_column_articles": 222, "frontend_question_id": "497", "is_new_question": false }, @@ -55851,8 +56313,8 @@ "question__title": "Random Flip Matrix", "question__title_slug": "random-flip-matrix", "question__hide": false, - "total_acs": 23075, - "total_submitted": 50017, + "total_acs": 23115, + "total_submitted": 50102, "total_column_articles": 218, "frontend_question_id": "519", "is_new_question": false @@ -55872,9 +56334,9 @@ "question__title": "Random Pick with Weight", "question__title_slug": "random-pick-with-weight", "question__hide": false, - "total_acs": 63287, - "total_submitted": 129648, - "total_column_articles": 513, + "total_acs": 63572, + "total_submitted": 130097, + "total_column_articles": 515, "frontend_question_id": "528", "is_new_question": false }, @@ -55893,8 +56355,8 @@ "question__title": "Profitable Schemes", "question__title_slug": "profitable-schemes", "question__hide": false, - "total_acs": 31273, - "total_submitted": 57407, + "total_acs": 31587, + "total_submitted": 58006, "total_column_articles": 252, "frontend_question_id": "879", "is_new_question": false @@ -55914,9 +56376,9 @@ "question__title": "Nth Magical Number", "question__title_slug": "nth-magical-number", "question__hide": false, - "total_acs": 26244, - "total_submitted": 65055, - "total_column_articles": 233, + "total_acs": 26443, + "total_submitted": 65496, + "total_column_articles": 235, "frontend_question_id": "878", "is_new_question": false }, @@ -55935,9 +56397,9 @@ "question__title": "Stone Game", "question__title_slug": "stone-game", "question__hide": false, - "total_acs": 103370, - "total_submitted": 134746, - "total_column_articles": 690, + "total_acs": 103854, + "total_submitted": 135379, + "total_column_articles": 691, "frontend_question_id": "877", "is_new_question": false }, @@ -55956,9 +56418,9 @@ "question__title": "Middle of the Linked List", "question__title_slug": "middle-of-the-linked-list", "question__hide": false, - "total_acs": 455838, - "total_submitted": 642005, - "total_column_articles": 3843, + "total_acs": 458319, + "total_submitted": 645086, + "total_column_articles": 3854, "frontend_question_id": "876", "is_new_question": false }, @@ -55977,9 +56439,9 @@ "question__title": "Koko Eating Bananas", "question__title_slug": "koko-eating-bananas", "question__hide": false, - "total_acs": 152977, - "total_submitted": 309271, - "total_column_articles": 1073, + "total_acs": 154096, + "total_submitted": 311497, + "total_column_articles": 1080, "frontend_question_id": "875", "is_new_question": false }, @@ -55998,8 +56460,8 @@ "question__title": "Walking Robot Simulation", "question__title_slug": "walking-robot-simulation", "question__hide": false, - "total_acs": 45849, - "total_submitted": 96540, + "total_acs": 45922, + "total_submitted": 96666, "total_column_articles": 513, "frontend_question_id": "874", "is_new_question": false @@ -56019,8 +56481,8 @@ "question__title": "Length of Longest Fibonacci Subsequence", "question__title_slug": "length-of-longest-fibonacci-subsequence", "question__hide": false, - "total_acs": 54090, - "total_submitted": 96341, + "total_acs": 54337, + "total_submitted": 96827, "total_column_articles": 391, "frontend_question_id": "873", "is_new_question": false @@ -56040,9 +56502,9 @@ "question__title": "Leaf-Similar Trees", "question__title_slug": "leaf-similar-trees", "question__hide": false, - "total_acs": 88271, - "total_submitted": 135511, - "total_column_articles": 988, + "total_acs": 88779, + "total_submitted": 136249, + "total_column_articles": 989, "frontend_question_id": "872", "is_new_question": false }, @@ -56061,8 +56523,8 @@ "question__title": "Implement Rand10() Using Rand7()", "question__title_slug": "implement-rand10-using-rand7", "question__hide": false, - "total_acs": 112181, - "total_submitted": 203386, + "total_acs": 112742, + "total_submitted": 204440, "total_column_articles": 503, "frontend_question_id": "470", "is_new_question": false @@ -56082,8 +56544,8 @@ "question__title": "Minimum Number of Refueling Stops", "question__title_slug": "minimum-number-of-refueling-stops", "question__hide": false, - "total_acs": 37154, - "total_submitted": 85259, + "total_acs": 37304, + "total_submitted": 85540, "total_column_articles": 387, "frontend_question_id": "871", "is_new_question": false @@ -56103,8 +56565,8 @@ "question__title": "Advantage Shuffle", "question__title_slug": "advantage-shuffle", "question__hide": false, - "total_acs": 72370, - "total_submitted": 141611, + "total_acs": 72669, + "total_submitted": 142102, "total_column_articles": 801, "frontend_question_id": "870", "is_new_question": false @@ -56124,9 +56586,9 @@ "question__title": "Reordered Power of 2", "question__title_slug": "reordered-power-of-2", "question__hide": false, - "total_acs": 38765, - "total_submitted": 61127, - "total_column_articles": 552, + "total_acs": 38823, + "total_submitted": 61218, + "total_column_articles": 553, "frontend_question_id": "869", "is_new_question": false }, @@ -56145,9 +56607,9 @@ "question__title": "Binary Gap", "question__title_slug": "binary-gap", "question__hide": false, - "total_acs": 55415, - "total_submitted": 79504, - "total_column_articles": 727, + "total_acs": 55632, + "total_submitted": 79791, + "total_column_articles": 728, "frontend_question_id": "868", "is_new_question": false }, @@ -56166,9 +56628,9 @@ "question__title": "Transpose Matrix", "question__title_slug": "transpose-matrix", "question__hide": false, - "total_acs": 109680, - "total_submitted": 163004, - "total_column_articles": 918, + "total_acs": 110294, + "total_submitted": 163776, + "total_column_articles": 921, "frontend_question_id": "867", "is_new_question": false }, @@ -56187,9 +56649,9 @@ "question__title": "Prime Palindrome", "question__title_slug": "prime-palindrome", "question__hide": false, - "total_acs": 12696, - "total_submitted": 51922, - "total_column_articles": 135, + "total_acs": 12901, + "total_submitted": 52422, + "total_column_articles": 136, "frontend_question_id": "866", "is_new_question": false }, @@ -56208,8 +56670,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": 19520, - "total_submitted": 27532, + "total_acs": 19633, + "total_submitted": 27680, "total_column_articles": 251, "frontend_question_id": "865", "is_new_question": false @@ -56229,8 +56691,8 @@ "question__title": "Shortest Path to Get All Keys", "question__title_slug": "shortest-path-to-get-all-keys", "question__hide": false, - "total_acs": 22540, - "total_submitted": 38134, + "total_acs": 22621, + "total_submitted": 38300, "total_column_articles": 257, "frontend_question_id": "864", "is_new_question": false @@ -56250,8 +56712,8 @@ "question__title": "Random Pick with Blacklist", "question__title_slug": "random-pick-with-blacklist", "question__hide": false, - "total_acs": 32794, - "total_submitted": 75847, + "total_acs": 32933, + "total_submitted": 76170, "total_column_articles": 461, "frontend_question_id": "710", "is_new_question": false @@ -56271,9 +56733,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": 58015, - "total_submitted": 94449, - "total_column_articles": 795, + "total_acs": 58318, + "total_submitted": 94929, + "total_column_articles": 797, "frontend_question_id": "863", "is_new_question": false }, @@ -56292,8 +56754,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": 52707, - "total_submitted": 194109, + "total_acs": 53050, + "total_submitted": 194920, "total_column_articles": 401, "frontend_question_id": "862", "is_new_question": false @@ -56313,8 +56775,8 @@ "question__title": "Score After Flipping Matrix", "question__title_slug": "score-after-flipping-matrix", "question__hide": false, - "total_acs": 37704, - "total_submitted": 46702, + "total_acs": 37766, + "total_submitted": 46808, "total_column_articles": 532, "frontend_question_id": "861", "is_new_question": false @@ -56334,9 +56796,9 @@ "question__title": "Lemonade Change", "question__title_slug": "lemonade-change", "question__hide": false, - "total_acs": 236313, - "total_submitted": 400331, - "total_column_articles": 1665, + "total_acs": 238496, + "total_submitted": 403903, + "total_column_articles": 1675, "frontend_question_id": "860", "is_new_question": false }, @@ -56355,9 +56817,9 @@ "question__title": "Buddy Strings", "question__title_slug": "buddy-strings", "question__hide": false, - "total_acs": 74783, - "total_submitted": 214441, - "total_column_articles": 935, + "total_acs": 74982, + "total_submitted": 214896, + "total_column_articles": 936, "frontend_question_id": "859", "is_new_question": false }, @@ -56376,9 +56838,9 @@ "question__title": "Mirror Reflection", "question__title_slug": "mirror-reflection", "question__hide": false, - "total_acs": 5906, - "total_submitted": 10112, - "total_column_articles": 86, + "total_acs": 5953, + "total_submitted": 10189, + "total_column_articles": 87, "frontend_question_id": "858", "is_new_question": false }, @@ -56397,8 +56859,8 @@ "question__title": "Minimum Cost to Hire K Workers", "question__title_slug": "minimum-cost-to-hire-k-workers", "question__hide": false, - "total_acs": 30294, - "total_submitted": 45179, + "total_acs": 30500, + "total_submitted": 45493, "total_column_articles": 264, "frontend_question_id": "857", "is_new_question": false @@ -56418,8 +56880,8 @@ "question__title": "Score of Parentheses", "question__title_slug": "score-of-parentheses", "question__hide": false, - "total_acs": 56628, - "total_submitted": 82644, + "total_acs": 56732, + "total_submitted": 82813, "total_column_articles": 719, "frontend_question_id": "856", "is_new_question": false @@ -56439,8 +56901,8 @@ "question__title": "Exam Room", "question__title_slug": "exam-room", "question__hide": false, - "total_acs": 22872, - "total_submitted": 48387, + "total_acs": 22913, + "total_submitted": 48493, "total_column_articles": 235, "frontend_question_id": "855", "is_new_question": false @@ -56460,8 +56922,8 @@ "question__title": "K-Similar Strings", "question__title_slug": "k-similar-strings", "question__hide": false, - "total_acs": 26818, - "total_submitted": 57248, + "total_acs": 26845, + "total_submitted": 57333, "total_column_articles": 251, "frontend_question_id": "854", "is_new_question": false @@ -56481,9 +56943,9 @@ "question__title": "Car Fleet", "question__title_slug": "car-fleet", "question__hide": false, - "total_acs": 21078, - "total_submitted": 49396, - "total_column_articles": 233, + "total_acs": 21221, + "total_submitted": 49652, + "total_column_articles": 234, "frontend_question_id": "853", "is_new_question": false }, @@ -56502,9 +56964,9 @@ "question__title": "Peak Index in a Mountain Array", "question__title_slug": "peak-index-in-a-mountain-array", "question__hide": false, - "total_acs": 157314, - "total_submitted": 230032, - "total_column_articles": 1223, + "total_acs": 158587, + "total_submitted": 231820, + "total_column_articles": 1229, "frontend_question_id": "852", "is_new_question": false }, @@ -56523,9 +56985,9 @@ "question__title": "Loud and Rich", "question__title_slug": "loud-and-rich", "question__hide": false, - "total_acs": 33051, - "total_submitted": 52243, - "total_column_articles": 341, + "total_acs": 33144, + "total_submitted": 52389, + "total_column_articles": 342, "frontend_question_id": "851", "is_new_question": false }, @@ -56544,8 +57006,8 @@ "question__title": "Rectangle Area II", "question__title_slug": "rectangle-area-ii", "question__hide": false, - "total_acs": 20046, - "total_submitted": 31903, + "total_acs": 20085, + "total_submitted": 31957, "total_column_articles": 186, "frontend_question_id": "850", "is_new_question": false @@ -56565,9 +57027,9 @@ "question__title": "Maximize Distance to Closest Person", "question__title_slug": "maximize-distance-to-closest-person", "question__hide": false, - "total_acs": 48709, - "total_submitted": 93850, - "total_column_articles": 595, + "total_acs": 48797, + "total_submitted": 94017, + "total_column_articles": 594, "frontend_question_id": "849", "is_new_question": false }, @@ -56586,9 +57048,9 @@ "question__title": "Shifting Letters", "question__title_slug": "shifting-letters", "question__hide": false, - "total_acs": 15961, - "total_submitted": 34352, - "total_column_articles": 168, + "total_acs": 16036, + "total_submitted": 34486, + "total_column_articles": 169, "frontend_question_id": "848", "is_new_question": false }, @@ -56607,8 +57069,8 @@ "question__title": "Shortest Path Visiting All Nodes", "question__title_slug": "shortest-path-visiting-all-nodes", "question__hide": false, - "total_acs": 28400, - "total_submitted": 42182, + "total_acs": 28504, + "total_submitted": 42324, "total_column_articles": 243, "frontend_question_id": "847", "is_new_question": false @@ -56628,8 +57090,8 @@ "question__title": "Hand of Straights", "question__title_slug": "hand-of-straights", "question__hide": false, - "total_acs": 42872, - "total_submitted": 74906, + "total_acs": 43008, + "total_submitted": 75156, "total_column_articles": 556, "frontend_question_id": "846", "is_new_question": false @@ -56649,9 +57111,9 @@ "question__title": "Longest Mountain in Array", "question__title_slug": "longest-mountain-in-array", "question__hide": false, - "total_acs": 53297, - "total_submitted": 125643, - "total_column_articles": 758, + "total_acs": 53582, + "total_submitted": 126209, + "total_column_articles": 759, "frontend_question_id": "845", "is_new_question": false }, @@ -56670,9 +57132,9 @@ "question__title": "Backspace String Compare", "question__title_slug": "backspace-string-compare", "question__hide": false, - "total_acs": 242224, - "total_submitted": 506954, - "total_column_articles": 2167, + "total_acs": 244316, + "total_submitted": 511325, + "total_column_articles": 2178, "frontend_question_id": "844", "is_new_question": false }, @@ -56691,8 +57153,8 @@ "question__title": "Guess the Word", "question__title_slug": "guess-the-word", "question__hide": false, - "total_acs": 5178, - "total_submitted": 13961, + "total_acs": 5205, + "total_submitted": 14054, "total_column_articles": 74, "frontend_question_id": "843", "is_new_question": false @@ -56712,9 +57174,9 @@ "question__title": "Split Array into Fibonacci Sequence", "question__title_slug": "split-array-into-fibonacci-sequence", "question__hide": false, - "total_acs": 35456, - "total_submitted": 73208, - "total_column_articles": 389, + "total_acs": 35526, + "total_submitted": 73343, + "total_column_articles": 390, "frontend_question_id": "842", "is_new_question": false }, @@ -56733,9 +57195,9 @@ "question__title": "Keys and Rooms", "question__title_slug": "keys-and-rooms", "question__hide": false, - "total_acs": 115742, - "total_submitted": 166142, - "total_column_articles": 936, + "total_acs": 117250, + "total_submitted": 168074, + "total_column_articles": 943, "frontend_question_id": "841", "is_new_question": false }, @@ -56754,9 +57216,9 @@ "question__title": "Magic Squares In Grid", "question__title_slug": "magic-squares-in-grid", "question__hide": false, - "total_acs": 12696, - "total_submitted": 34137, - "total_column_articles": 160, + "total_acs": 12739, + "total_submitted": 34234, + "total_column_articles": 162, "frontend_question_id": "840", "is_new_question": false }, @@ -56775,8 +57237,8 @@ "question__title": "Similar String Groups", "question__title_slug": "similar-string-groups", "question__hide": false, - "total_acs": 26853, - "total_submitted": 45112, + "total_acs": 27008, + "total_submitted": 45325, "total_column_articles": 352, "frontend_question_id": "839", "is_new_question": false @@ -56796,9 +57258,9 @@ "question__title": "Push Dominoes", "question__title_slug": "push-dominoes", "question__hide": false, - "total_acs": 41030, - "total_submitted": 73415, - "total_column_articles": 567, + "total_acs": 41110, + "total_submitted": 73578, + "total_column_articles": 568, "frontend_question_id": "838", "is_new_question": false }, @@ -56817,9 +57279,9 @@ "question__title": "New 21 Game", "question__title_slug": "new-21-game", "question__hide": false, - "total_acs": 23643, - "total_submitted": 59769, - "total_column_articles": 280, + "total_acs": 23726, + "total_submitted": 59950, + "total_column_articles": 281, "frontend_question_id": "837", "is_new_question": false }, @@ -56838,9 +57300,9 @@ "question__title": "Rectangle Overlap", "question__title_slug": "rectangle-overlap", "question__hide": false, - "total_acs": 53035, - "total_submitted": 107155, - "total_column_articles": 797, + "total_acs": 53211, + "total_submitted": 107432, + "total_column_articles": 798, "frontend_question_id": "836", "is_new_question": false }, @@ -56859,8 +57321,8 @@ "question__title": "Robot Room Cleaner", "question__title_slug": "robot-room-cleaner", "question__hide": false, - "total_acs": 3968, - "total_submitted": 5370, + "total_acs": 3986, + "total_submitted": 5392, "total_column_articles": 40, "frontend_question_id": "489", "is_new_question": false @@ -56880,8 +57342,8 @@ "question__title": "Image Overlap", "question__title_slug": "image-overlap", "question__hide": false, - "total_acs": 7369, - "total_submitted": 12590, + "total_acs": 7398, + "total_submitted": 12628, "total_column_articles": 77, "frontend_question_id": "835", "is_new_question": false @@ -56901,8 +57363,8 @@ "question__title": "Sum of Distances in Tree", "question__title_slug": "sum-of-distances-in-tree", "question__hide": false, - "total_acs": 29654, - "total_submitted": 48416, + "total_acs": 29738, + "total_submitted": 48564, "total_column_articles": 254, "frontend_question_id": "834", "is_new_question": false @@ -56922,8 +57384,8 @@ "question__title": "Find And Replace in String", "question__title_slug": "find-and-replace-in-string", "question__hide": false, - "total_acs": 29158, - "total_submitted": 56901, + "total_acs": 29204, + "total_submitted": 57011, "total_column_articles": 346, "frontend_question_id": "833", "is_new_question": false @@ -56943,9 +57405,9 @@ "question__title": "Flipping an Image", "question__title_slug": "flipping-an-image", "question__hide": false, - "total_acs": 107064, - "total_submitted": 134710, - "total_column_articles": 1182, + "total_acs": 107346, + "total_submitted": 135040, + "total_column_articles": 1185, "frontend_question_id": "832", "is_new_question": false }, @@ -56964,9 +57426,9 @@ "question__title": "Design Circular Queue", "question__title_slug": "design-circular-queue", "question__hide": false, - "total_acs": 146465, - "total_submitted": 314770, - "total_column_articles": 1074, + "total_acs": 147369, + "total_submitted": 316969, + "total_column_articles": 1079, "frontend_question_id": "622", "is_new_question": false }, @@ -56985,9 +57447,9 @@ "question__title": "Design Circular Deque", "question__title_slug": "design-circular-deque", "question__hide": false, - "total_acs": 65709, - "total_submitted": 115796, - "total_column_articles": 675, + "total_acs": 66026, + "total_submitted": 116350, + "total_column_articles": 677, "frontend_question_id": "641", "is_new_question": false }, @@ -57006,8 +57468,8 @@ "question__title": "Masking Personal Information", "question__title_slug": "masking-personal-information", "question__hide": false, - "total_acs": 29077, - "total_submitted": 53684, + "total_acs": 29140, + "total_submitted": 53785, "total_column_articles": 286, "frontend_question_id": "831", "is_new_question": false @@ -57027,8 +57489,8 @@ "question__title": "Positions of Large Groups", "question__title_slug": "positions-of-large-groups", "question__hide": false, - "total_acs": 63841, - "total_submitted": 117535, + "total_acs": 64004, + "total_submitted": 117856, "total_column_articles": 734, "frontend_question_id": "830", "is_new_question": false @@ -57048,8 +57510,8 @@ "question__title": "Consecutive Numbers Sum", "question__title_slug": "consecutive-numbers-sum", "question__hide": false, - "total_acs": 33897, - "total_submitted": 73591, + "total_acs": 34047, + "total_submitted": 73890, "total_column_articles": 393, "frontend_question_id": "829", "is_new_question": false @@ -57069,8 +57531,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": 39969, - "total_submitted": 58424, + "total_acs": 40028, + "total_submitted": 58505, "total_column_articles": 388, "frontend_question_id": "828", "is_new_question": false @@ -57090,9 +57552,9 @@ "question__title": "Making A Large Island", "question__title_slug": "making-a-large-island", "question__hide": false, - "total_acs": 52961, - "total_submitted": 112275, - "total_column_articles": 644, + "total_acs": 53866, + "total_submitted": 114041, + "total_column_articles": 652, "frontend_question_id": "827", "is_new_question": false }, @@ -57111,9 +57573,9 @@ "question__title": "Most Profit Assigning Work", "question__title_slug": "most-profit-assigning-work", "question__hide": false, - "total_acs": 18720, - "total_submitted": 42903, - "total_column_articles": 247, + "total_acs": 37217, + "total_submitted": 73179, + "total_column_articles": 417, "frontend_question_id": "826", "is_new_question": false }, @@ -57132,9 +57594,9 @@ "question__title": "Friends Of Appropriate Ages", "question__title_slug": "friends-of-appropriate-ages", "question__hide": false, - "total_acs": 38805, - "total_submitted": 85140, - "total_column_articles": 366, + "total_acs": 38928, + "total_submitted": 85384, + "total_column_articles": 367, "frontend_question_id": "825", "is_new_question": false }, @@ -57153,9 +57615,9 @@ "question__title": "Goat Latin", "question__title_slug": "goat-latin", "question__hide": false, - "total_acs": 57944, - "total_submitted": 88728, - "total_column_articles": 774, + "total_acs": 58135, + "total_submitted": 88990, + "total_column_articles": 775, "frontend_question_id": "824", "is_new_question": false }, @@ -57174,8 +57636,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": 7271, - "total_submitted": 18891, + "total_acs": 7369, + "total_submitted": 19131, "total_column_articles": 119, "frontend_question_id": "708", "is_new_question": false @@ -57195,8 +57657,8 @@ "question__title": "Binary Trees With Factors", "question__title_slug": "binary-trees-with-factors", "question__hide": false, - "total_acs": 26560, - "total_submitted": 56340, + "total_acs": 26625, + "total_submitted": 56483, "total_column_articles": 222, "frontend_question_id": "823", "is_new_question": false @@ -57216,8 +57678,8 @@ "question__title": "Card Flipping Game", "question__title_slug": "card-flipping-game", "question__hide": false, - "total_acs": 25783, - "total_submitted": 43302, + "total_acs": 25821, + "total_submitted": 43352, "total_column_articles": 245, "frontend_question_id": "822", "is_new_question": false @@ -57237,9 +57699,9 @@ "question__title": "Shortest Distance to a Character", "question__title_slug": "shortest-distance-to-a-character", "question__hide": false, - "total_acs": 79563, - "total_submitted": 109379, - "total_column_articles": 1055, + "total_acs": 79826, + "total_submitted": 109720, + "total_column_articles": 1057, "frontend_question_id": "821", "is_new_question": false }, @@ -57258,9 +57720,9 @@ "question__title": "Short Encoding of Words", "question__title_slug": "short-encoding-of-words", "question__hide": false, - "total_acs": 73206, - "total_submitted": 139856, - "total_column_articles": 754, + "total_acs": 73364, + "total_submitted": 140102, + "total_column_articles": 755, "frontend_question_id": "820", "is_new_question": false }, @@ -57279,9 +57741,9 @@ "question__title": "Design Linked List", "question__title_slug": "design-linked-list", "question__hide": false, - "total_acs": 310957, - "total_submitted": 903654, - "total_column_articles": 1682, + "total_acs": 314770, + "total_submitted": 914362, + "total_column_articles": 1696, "frontend_question_id": "707", "is_new_question": false }, @@ -57300,9 +57762,9 @@ "question__title": "Most Common Word", "question__title_slug": "most-common-word", "question__hide": false, - "total_acs": 65957, - "total_submitted": 144591, - "total_column_articles": 779, + "total_acs": 66254, + "total_submitted": 145229, + "total_column_articles": 782, "frontend_question_id": "819", "is_new_question": false }, @@ -57321,9 +57783,9 @@ "question__title": "Race Car", "question__title_slug": "race-car", "question__hide": false, - "total_acs": 6750, - "total_submitted": 14842, - "total_column_articles": 78, + "total_acs": 6801, + "total_submitted": 14959, + "total_column_articles": 79, "frontend_question_id": "818", "is_new_question": false }, @@ -57342,8 +57804,8 @@ "question__title": "Linked List Components", "question__title_slug": "linked-list-components", "question__hide": false, - "total_acs": 51061, - "total_submitted": 83363, + "total_acs": 51146, + "total_submitted": 83527, "total_column_articles": 592, "frontend_question_id": "817", "is_new_question": false @@ -57363,9 +57825,9 @@ "question__title": "Ambiguous Coordinates", "question__title_slug": "ambiguous-coordinates", "question__hide": false, - "total_acs": 28853, - "total_submitted": 45949, - "total_column_articles": 400, + "total_acs": 28896, + "total_submitted": 46021, + "total_column_articles": 401, "frontend_question_id": "816", "is_new_question": false }, @@ -57384,9 +57846,9 @@ "question__title": "Bus Routes", "question__title_slug": "bus-routes", "question__hide": false, - "total_acs": 40264, - "total_submitted": 90549, - "total_column_articles": 425, + "total_acs": 40352, + "total_submitted": 90776, + "total_column_articles": 426, "frontend_question_id": "815", "is_new_question": false }, @@ -57405,8 +57867,8 @@ "question__title": "Binary Tree Pruning", "question__title_slug": "binary-tree-pruning", "question__hide": false, - "total_acs": 64033, - "total_submitted": 88231, + "total_acs": 64259, + "total_submitted": 88520, "total_column_articles": 824, "frontend_question_id": "814", "is_new_question": false @@ -57426,8 +57888,8 @@ "question__title": "Largest Sum of Averages", "question__title_slug": "largest-sum-of-averages", "question__hide": false, - "total_acs": 30486, - "total_submitted": 49052, + "total_acs": 30607, + "total_submitted": 49222, "total_column_articles": 277, "frontend_question_id": "813", "is_new_question": false @@ -57447,9 +57909,9 @@ "question__title": "Largest Triangle Area", "question__title_slug": "largest-triangle-area", "question__hide": false, - "total_acs": 39531, - "total_submitted": 58055, - "total_column_articles": 344, + "total_acs": 39676, + "total_submitted": 58267, + "total_column_articles": 345, "frontend_question_id": "812", "is_new_question": false }, @@ -57468,9 +57930,9 @@ "question__title": "Subdomain Visit Count", "question__title_slug": "subdomain-visit-count", "question__hide": false, - "total_acs": 46041, - "total_submitted": 59885, - "total_column_articles": 575, + "total_acs": 46127, + "total_submitted": 59987, + "total_column_articles": 574, "frontend_question_id": "811", "is_new_question": false }, @@ -57489,8 +57951,8 @@ "question__title": "Chalkboard XOR Game", "question__title_slug": "chalkboard-xor-game", "question__hide": false, - "total_acs": 19996, - "total_submitted": 27517, + "total_acs": 20026, + "total_submitted": 27557, "total_column_articles": 158, "frontend_question_id": "810", "is_new_question": false @@ -57510,8 +57972,8 @@ "question__title": "Expressive Words", "question__title_slug": "expressive-words", "question__hide": false, - "total_acs": 26990, - "total_submitted": 55016, + "total_acs": 27050, + "total_submitted": 55131, "total_column_articles": 376, "frontend_question_id": "809", "is_new_question": false @@ -57531,8 +57993,8 @@ "question__title": "Soup Servings", "question__title_slug": "soup-servings", "question__hide": false, - "total_acs": 23741, - "total_submitted": 40640, + "total_acs": 23789, + "total_submitted": 40713, "total_column_articles": 172, "frontend_question_id": "808", "is_new_question": false @@ -57552,9 +58014,9 @@ "question__title": "Max Increase to Keep City Skyline", "question__title_slug": "max-increase-to-keep-city-skyline", "question__hide": false, - "total_acs": 57633, - "total_submitted": 65591, - "total_column_articles": 791, + "total_acs": 57765, + "total_submitted": 65748, + "total_column_articles": 792, "frontend_question_id": "807", "is_new_question": false }, @@ -57573,8 +58035,8 @@ "question__title": "Number of Lines To Write String", "question__title_slug": "number-of-lines-to-write-string", "question__hide": false, - "total_acs": 56113, - "total_submitted": 81785, + "total_acs": 56281, + "total_submitted": 82009, "total_column_articles": 671, "frontend_question_id": "806", "is_new_question": false @@ -57594,8 +58056,8 @@ "question__title": "Split Array With Same Average", "question__title_slug": "split-array-with-same-average", "question__hide": false, - "total_acs": 23325, - "total_submitted": 54540, + "total_acs": 23390, + "total_submitted": 54744, "total_column_articles": 196, "frontend_question_id": "805", "is_new_question": false @@ -57615,8 +58077,8 @@ "question__title": "Unique Morse Code Words", "question__title_slug": "unique-morse-code-words", "question__hide": false, - "total_acs": 83831, - "total_submitted": 101973, + "total_acs": 84078, + "total_submitted": 102270, "total_column_articles": 877, "frontend_question_id": "804", "is_new_question": false @@ -57636,9 +58098,9 @@ "question__title": "Bricks Falling When Hit", "question__title_slug": "bricks-falling-when-hit", "question__hide": false, - "total_acs": 15737, - "total_submitted": 33547, - "total_column_articles": 160, + "total_acs": 15785, + "total_submitted": 33642, + "total_column_articles": 161, "frontend_question_id": "803", "is_new_question": false }, @@ -57657,9 +58119,9 @@ "question__title": "Find Eventual Safe States", "question__title_slug": "find-eventual-safe-states", "question__hide": false, - "total_acs": 50301, - "total_submitted": 84963, - "total_column_articles": 494, + "total_acs": 50630, + "total_submitted": 85480, + "total_column_articles": 498, "frontend_question_id": "802", "is_new_question": false }, @@ -57678,8 +58140,8 @@ "question__title": "Minimum Swaps To Make Sequences Increasing", "question__title_slug": "minimum-swaps-to-make-sequences-increasing", "question__hide": false, - "total_acs": 32336, - "total_submitted": 63713, + "total_acs": 32502, + "total_submitted": 63988, "total_column_articles": 329, "frontend_question_id": "801", "is_new_question": false @@ -57699,8 +58161,8 @@ "question__title": "Similar RGB Color", "question__title_slug": "similar-rgb-color", "question__hide": false, - "total_acs": 2633, - "total_submitted": 3762, + "total_acs": 2640, + "total_submitted": 3771, "total_column_articles": 59, "frontend_question_id": "800", "is_new_question": false @@ -57720,9 +58182,9 @@ "question__title": "Design HashMap", "question__title_slug": "design-hashmap", "question__hide": false, - "total_acs": 121044, - "total_submitted": 185985, - "total_column_articles": 696, + "total_acs": 121411, + "total_submitted": 186541, + "total_column_articles": 697, "frontend_question_id": "706", "is_new_question": false }, @@ -57741,9 +58203,9 @@ "question__title": "Design HashSet", "question__title_slug": "design-hashset", "question__hide": false, - "total_acs": 129296, - "total_submitted": 199218, - "total_column_articles": 730, + "total_acs": 129794, + "total_submitted": 199987, + "total_column_articles": 732, "frontend_question_id": "705", "is_new_question": false }, @@ -57762,8 +58224,8 @@ "question__title": "Champagne Tower", "question__title_slug": "champagne-tower", "question__hide": false, - "total_acs": 31030, - "total_submitted": 58109, + "total_acs": 31140, + "total_submitted": 58296, "total_column_articles": 319, "frontend_question_id": "799", "is_new_question": false @@ -57783,8 +58245,8 @@ "question__title": "Smallest Rotation with Highest Score", "question__title_slug": "smallest-rotation-with-highest-score", "question__hide": false, - "total_acs": 22114, - "total_submitted": 35944, + "total_acs": 22154, + "total_submitted": 35998, "total_column_articles": 233, "frontend_question_id": "798", "is_new_question": false @@ -57804,9 +58266,9 @@ "question__title": "All Paths From Source to Target", "question__title_slug": "all-paths-from-source-to-target", "question__hide": false, - "total_acs": 138095, - "total_submitted": 175684, - "total_column_articles": 1996, + "total_acs": 140227, + "total_submitted": 178236, + "total_column_articles": 2001, "frontend_question_id": "797", "is_new_question": false }, @@ -57825,9 +58287,9 @@ "question__title": "Rotate String", "question__title_slug": "rotate-string", "question__hide": false, - "total_acs": 88831, - "total_submitted": 139512, - "total_column_articles": 959, + "total_acs": 89298, + "total_submitted": 140174, + "total_column_articles": 964, "frontend_question_id": "796", "is_new_question": false }, @@ -57846,8 +58308,8 @@ "question__title": "Number of Subarrays with Bounded Maximum", "question__title_slug": "number-of-subarrays-with-bounded-maximum", "question__hide": false, - "total_acs": 38506, - "total_submitted": 66536, + "total_acs": 38697, + "total_submitted": 66840, "total_column_articles": 361, "frontend_question_id": "795", "is_new_question": false @@ -57867,8 +58329,8 @@ "question__title": "Valid Tic-Tac-Toe State", "question__title_slug": "valid-tic-tac-toe-state", "question__hide": false, - "total_acs": 32409, - "total_submitted": 84145, + "total_acs": 32448, + "total_submitted": 84259, "total_column_articles": 506, "frontend_question_id": "794", "is_new_question": false @@ -57888,9 +58350,9 @@ "question__title": "Preimage Size of Factorial Zeroes Function", "question__title_slug": "preimage-size-of-factorial-zeroes-function", "question__hide": false, - "total_acs": 29369, - "total_submitted": 60419, - "total_column_articles": 297, + "total_acs": 29538, + "total_submitted": 60745, + "total_column_articles": 301, "frontend_question_id": "793", "is_new_question": false }, @@ -57909,9 +58371,9 @@ "question__title": "Number of Matching Subsequences", "question__title_slug": "number-of-matching-subsequences", "question__hide": false, - "total_acs": 43948, - "total_submitted": 86589, - "total_column_articles": 466, + "total_acs": 44060, + "total_submitted": 86845, + "total_column_articles": 467, "frontend_question_id": "792", "is_new_question": false }, @@ -57930,8 +58392,8 @@ "question__title": "Custom Sort String", "question__title_slug": "custom-sort-string", "question__hide": false, - "total_acs": 44317, - "total_submitted": 59663, + "total_acs": 44448, + "total_submitted": 59821, "total_column_articles": 618, "frontend_question_id": "791", "is_new_question": false @@ -57951,8 +58413,8 @@ "question__title": "Domino and Tromino Tiling", "question__title_slug": "domino-and-tromino-tiling", "question__hide": false, - "total_acs": 34371, - "total_submitted": 64955, + "total_acs": 34669, + "total_submitted": 65612, "total_column_articles": 324, "frontend_question_id": "790", "is_new_question": false @@ -57972,8 +58434,8 @@ "question__title": "Escape The Ghosts", "question__title_slug": "escape-the-ghosts", "question__hide": false, - "total_acs": 24459, - "total_submitted": 35645, + "total_acs": 24503, + "total_submitted": 35701, "total_column_articles": 339, "frontend_question_id": "789", "is_new_question": false @@ -57993,8 +58455,8 @@ "question__title": "Rotated Digits", "question__title_slug": "rotated-digits", "question__hide": false, - "total_acs": 47798, - "total_submitted": 71933, + "total_acs": 47906, + "total_submitted": 72095, "total_column_articles": 534, "frontend_question_id": "788", "is_new_question": false @@ -58014,9 +58476,9 @@ "question__title": "Cheapest Flights Within K Stops", "question__title_slug": "cheapest-flights-within-k-stops", "question__hide": false, - "total_acs": 75610, - "total_submitted": 189216, - "total_column_articles": 709, + "total_acs": 76193, + "total_submitted": 190659, + "total_column_articles": 711, "frontend_question_id": "787", "is_new_question": false }, @@ -58035,9 +58497,9 @@ "question__title": "K-th Smallest Prime Fraction", "question__title_slug": "k-th-smallest-prime-fraction", "question__hide": false, - "total_acs": 35429, - "total_submitted": 52291, - "total_column_articles": 329, + "total_acs": 35590, + "total_submitted": 52495, + "total_column_articles": 331, "frontend_question_id": "786", "is_new_question": false }, @@ -58056,9 +58518,9 @@ "question__title": "Is Graph Bipartite?", "question__title_slug": "is-graph-bipartite", "question__hide": false, - "total_acs": 89644, - "total_submitted": 162038, - "total_column_articles": 1518, + "total_acs": 90239, + "total_submitted": 163013, + "total_column_articles": 1521, "frontend_question_id": "785", "is_new_question": false }, @@ -58077,9 +58539,9 @@ "question__title": "Letter Case Permutation", "question__title_slug": "letter-case-permutation", "question__hide": false, - "total_acs": 114704, - "total_submitted": 158098, - "total_column_articles": 1235, + "total_acs": 115142, + "total_submitted": 158680, + "total_column_articles": 1240, "frontend_question_id": "784", "is_new_question": false }, @@ -58098,9 +58560,9 @@ "question__title": "Minimum Distance Between BST Nodes", "question__title_slug": "minimum-distance-between-bst-nodes", "question__hide": false, - "total_acs": 91560, - "total_submitted": 151740, - "total_column_articles": 865, + "total_acs": 91838, + "total_submitted": 152197, + "total_column_articles": 866, "frontend_question_id": "783", "is_new_question": false }, @@ -58119,8 +58581,8 @@ "question__title": "Transform to Chessboard", "question__title_slug": "transform-to-chessboard", "question__hide": false, - "total_acs": 14601, - "total_submitted": 24590, + "total_acs": 14607, + "total_submitted": 24613, "total_column_articles": 150, "frontend_question_id": "782", "is_new_question": false @@ -58140,9 +58602,9 @@ "question__title": "Rabbits in Forest", "question__title_slug": "rabbits-in-forest", "question__hide": false, - "total_acs": 59117, - "total_submitted": 101346, - "total_column_articles": 828, + "total_acs": 59248, + "total_submitted": 101608, + "total_column_articles": 830, "frontend_question_id": "781", "is_new_question": false }, @@ -58161,8 +58623,8 @@ "question__title": "Reaching Points", "question__title_slug": "reaching-points", "question__hide": false, - "total_acs": 27495, - "total_submitted": 72804, + "total_acs": 27524, + "total_submitted": 72879, "total_column_articles": 270, "frontend_question_id": "780", "is_new_question": false @@ -58182,9 +58644,9 @@ "question__title": "K-th Symbol in Grammar", "question__title_slug": "k-th-symbol-in-grammar", "question__hide": false, - "total_acs": 53478, - "total_submitted": 107167, - "total_column_articles": 768, + "total_acs": 53545, + "total_submitted": 107304, + "total_column_articles": 771, "frontend_question_id": "779", "is_new_question": false }, @@ -58203,9 +58665,9 @@ "question__title": "Swim in Rising Water", "question__title_slug": "swim-in-rising-water", "question__hide": false, - "total_acs": 36312, - "total_submitted": 61325, - "total_column_articles": 462, + "total_acs": 36471, + "total_submitted": 61583, + "total_column_articles": 464, "frontend_question_id": "778", "is_new_question": false }, @@ -58224,9 +58686,9 @@ "question__title": "Swap Adjacent in LR String", "question__title_slug": "swap-adjacent-in-lr-string", "question__hide": false, - "total_acs": 29391, - "total_submitted": 76123, - "total_column_articles": 310, + "total_acs": 29426, + "total_submitted": 76236, + "total_column_articles": 311, "frontend_question_id": "777", "is_new_question": false }, @@ -58245,9 +58707,9 @@ "question__title": "Binary Search", "question__title_slug": "binary-search", "question__hide": false, - "total_acs": 1235751, - "total_submitted": 2231436, - "total_column_articles": 5696, + "total_acs": 1247015, + "total_submitted": 2249577, + "total_column_articles": 5723, "frontend_question_id": "704", "is_new_question": false }, @@ -58266,9 +58728,9 @@ "question__title": "Split BST", "question__title_slug": "split-bst", "question__hide": false, - "total_acs": 2979, - "total_submitted": 4899, - "total_column_articles": 58, + "total_acs": 3034, + "total_submitted": 4969, + "total_column_articles": 59, "frontend_question_id": "776", "is_new_question": false }, @@ -58287,9 +58749,9 @@ "question__title": "Global and Local Inversions", "question__title_slug": "global-and-local-inversions", "question__hide": false, - "total_acs": 34106, - "total_submitted": 68918, - "total_column_articles": 426, + "total_acs": 34186, + "total_submitted": 69071, + "total_column_articles": 427, "frontend_question_id": "775", "is_new_question": false }, @@ -58308,9 +58770,9 @@ "question__title": "Kth Largest Element in a Stream", "question__title_slug": "kth-largest-element-in-a-stream", "question__hide": false, - "total_acs": 99403, - "total_submitted": 188853, - "total_column_articles": 862, + "total_acs": 99897, + "total_submitted": 189832, + "total_column_articles": 863, "frontend_question_id": "703", "is_new_question": false }, @@ -58329,8 +58791,8 @@ "question__title": "Minimize Max Distance to Gas Station", "question__title_slug": "minimize-max-distance-to-gas-station", "question__hide": false, - "total_acs": 2554, - "total_submitted": 4035, + "total_acs": 2570, + "total_submitted": 4052, "total_column_articles": 41, "frontend_question_id": "774", "is_new_question": false @@ -58350,8 +58812,8 @@ "question__title": "Sliding Puzzle", "question__title_slug": "sliding-puzzle", "question__hide": false, - "total_acs": 38438, - "total_submitted": 54792, + "total_acs": 38613, + "total_submitted": 55001, "total_column_articles": 532, "frontend_question_id": "773", "is_new_question": false @@ -58371,8 +58833,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": 9185, - "total_submitted": 12294, + "total_acs": 9245, + "total_submitted": 12371, "total_column_articles": 126, "frontend_question_id": "702", "is_new_question": false @@ -58392,8 +58854,8 @@ "question__title": "Basic Calculator III", "question__title_slug": "basic-calculator-iii", "question__hide": false, - "total_acs": 15409, - "total_submitted": 28758, + "total_acs": 15496, + "total_submitted": 28900, "total_column_articles": 216, "frontend_question_id": "772", "is_new_question": false @@ -58413,9 +58875,9 @@ "question__title": "Insert into a Binary Search Tree", "question__title_slug": "insert-into-a-binary-search-tree", "question__hide": false, - "total_acs": 239800, - "total_submitted": 342133, - "total_column_articles": 1518, + "total_acs": 242087, + "total_submitted": 345468, + "total_column_articles": 1528, "frontend_question_id": "701", "is_new_question": false }, @@ -58434,9 +58896,9 @@ "question__title": "Search in a Binary Search Tree", "question__title_slug": "search-in-a-binary-search-tree", "question__hide": false, - "total_acs": 324765, - "total_submitted": 415104, - "total_column_articles": 2072, + "total_acs": 328038, + "total_submitted": 419078, + "total_column_articles": 2081, "frontend_question_id": "700", "is_new_question": false }, @@ -58455,8 +58917,8 @@ "question__title": "Jewels and Stones", "question__title_slug": "jewels-and-stones", "question__hide": false, - "total_acs": 219032, - "total_submitted": 255732, + "total_acs": 219562, + "total_submitted": 256340, "total_column_articles": 1630, "frontend_question_id": "771", "is_new_question": false @@ -58476,8 +58938,8 @@ "question__title": "Basic Calculator IV", "question__title_slug": "basic-calculator-iv", "question__hide": false, - "total_acs": 2382, - "total_submitted": 4133, + "total_acs": 2396, + "total_submitted": 4170, "total_column_articles": 47, "frontend_question_id": "770", "is_new_question": false @@ -58497,9 +58959,9 @@ "question__title": "Max Chunks To Make Sorted", "question__title_slug": "max-chunks-to-make-sorted", "question__hide": false, - "total_acs": 57973, - "total_submitted": 97912, - "total_column_articles": 774, + "total_acs": 58117, + "total_submitted": 98151, + "total_column_articles": 777, "frontend_question_id": "769", "is_new_question": false }, @@ -58518,9 +58980,9 @@ "question__title": "Max Chunks To Make Sorted II", "question__title_slug": "max-chunks-to-make-sorted-ii", "question__hide": false, - "total_acs": 34581, - "total_submitted": 58891, - "total_column_articles": 399, + "total_acs": 34681, + "total_submitted": 59076, + "total_column_articles": 400, "frontend_question_id": "768", "is_new_question": false }, @@ -58539,9 +59001,9 @@ "question__title": "Reorganize String", "question__title_slug": "reorganize-string", "question__hide": false, - "total_acs": 56017, - "total_submitted": 114901, - "total_column_articles": 645, + "total_acs": 56310, + "total_submitted": 115444, + "total_column_articles": 644, "frontend_question_id": "767", "is_new_question": false }, @@ -58560,9 +59022,9 @@ "question__title": "Toeplitz Matrix", "question__title_slug": "toeplitz-matrix", "question__hide": false, - "total_acs": 73595, - "total_submitted": 105323, - "total_column_articles": 801, + "total_acs": 73826, + "total_submitted": 105629, + "total_column_articles": 802, "frontend_question_id": "766", "is_new_question": false }, @@ -58581,9 +59043,9 @@ "question__title": "N-ary Tree Postorder Traversal", "question__title_slug": "n-ary-tree-postorder-traversal", "question__hide": false, - "total_acs": 160094, - "total_submitted": 201253, - "total_column_articles": 1015, + "total_acs": 160768, + "total_submitted": 202081, + "total_column_articles": 1017, "frontend_question_id": "590", "is_new_question": false }, @@ -58602,9 +59064,9 @@ "question__title": "N-ary Tree Preorder Traversal", "question__title_slug": "n-ary-tree-preorder-traversal", "question__hide": false, - "total_acs": 219979, - "total_submitted": 289791, - "total_column_articles": 1259, + "total_acs": 220809, + "total_submitted": 290816, + "total_column_articles": 1261, "frontend_question_id": "589", "is_new_question": false }, @@ -58623,9 +59085,9 @@ "question__title": "Maximum Depth of N-ary Tree", "question__title_slug": "maximum-depth-of-n-ary-tree", "question__hide": false, - "total_acs": 167822, - "total_submitted": 223309, - "total_column_articles": 1145, + "total_acs": 168905, + "total_submitted": 224712, + "total_column_articles": 1152, "frontend_question_id": "559", "is_new_question": false }, @@ -58644,8 +59106,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": 18882, - "total_submitted": 30101, + "total_acs": 18899, + "total_submitted": 30138, "total_column_articles": 166, "frontend_question_id": "558", "is_new_question": false @@ -58665,9 +59127,9 @@ "question__title": "Construct Quad Tree", "question__title_slug": "construct-quad-tree", "question__hide": false, - "total_acs": 33989, - "total_submitted": 47453, - "total_column_articles": 383, + "total_acs": 34656, + "total_submitted": 48330, + "total_column_articles": 384, "frontend_question_id": "427", "is_new_question": false }, @@ -58686,8 +59148,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": 2467, - "total_submitted": 3292, + "total_acs": 2501, + "total_submitted": 3328, "total_column_articles": 52, "frontend_question_id": "431", "is_new_question": false @@ -58707,8 +59169,8 @@ "question__title": "Couples Holding Hands", "question__title_slug": "couples-holding-hands", "question__hide": false, - "total_acs": 53929, - "total_submitted": 80220, + "total_acs": 54145, + "total_submitted": 80550, "total_column_articles": 700, "frontend_question_id": "765", "is_new_question": false @@ -58728,9 +59190,9 @@ "question__title": "Largest Plus Sign", "question__title_slug": "largest-plus-sign", "question__hide": false, - "total_acs": 30714, - "total_submitted": 56528, - "total_column_articles": 353, + "total_acs": 30778, + "total_submitted": 56628, + "total_column_articles": 354, "frontend_question_id": "764", "is_new_question": false }, @@ -58749,9 +59211,9 @@ "question__title": "Partition Labels", "question__title_slug": "partition-labels", "question__hide": false, - "total_acs": 234244, - "total_submitted": 304441, - "total_column_articles": 1909, + "total_acs": 238738, + "total_submitted": 310025, + "total_column_articles": 1933, "frontend_question_id": "763", "is_new_question": false }, @@ -58770,9 +59232,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": 60082, - "total_submitted": 79742, - "total_column_articles": 510, + "total_acs": 60407, + "total_submitted": 80119, + "total_column_articles": 513, "frontend_question_id": "762", "is_new_question": false }, @@ -58791,9 +59253,9 @@ "question__title": "Flatten a Multilevel Doubly Linked List", "question__title_slug": "flatten-a-multilevel-doubly-linked-list", "question__hide": false, - "total_acs": 67463, - "total_submitted": 113230, - "total_column_articles": 932, + "total_acs": 67774, + "total_submitted": 113690, + "total_column_articles": 933, "frontend_question_id": "430", "is_new_question": false }, @@ -58812,8 +59274,8 @@ "question__title": "Serialize and Deserialize N-ary Tree", "question__title_slug": "serialize-and-deserialize-n-ary-tree", "question__hide": false, - "total_acs": 5952, - "total_submitted": 8526, + "total_acs": 5988, + "total_submitted": 8566, "total_column_articles": 89, "frontend_question_id": "428", "is_new_question": false @@ -58833,9 +59295,9 @@ "question__title": "N-ary Tree Level Order Traversal", "question__title_slug": "n-ary-tree-level-order-traversal", "question__hide": false, - "total_acs": 203326, - "total_submitted": 276109, - "total_column_articles": 1357, + "total_acs": 205278, + "total_submitted": 278649, + "total_column_articles": 1363, "frontend_question_id": "429", "is_new_question": false }, @@ -58854,8 +59316,8 @@ "question__title": "Special Binary String", "question__title_slug": "special-binary-string", "question__hide": false, - "total_acs": 17555, - "total_submitted": 23380, + "total_acs": 17566, + "total_submitted": 23394, "total_column_articles": 155, "frontend_question_id": "761", "is_new_question": false @@ -58875,9 +59337,9 @@ "question__title": "Find Anagram Mappings", "question__title_slug": "find-anagram-mappings", "question__hide": false, - "total_acs": 8199, - "total_submitted": 9670, - "total_column_articles": 144, + "total_acs": 8348, + "total_submitted": 9840, + "total_column_articles": 143, "frontend_question_id": "760", "is_new_question": false }, @@ -58896,8 +59358,8 @@ "question__title": "Employee Free Time", "question__title_slug": "employee-free-time", "question__hide": false, - "total_acs": 4824, - "total_submitted": 6873, + "total_acs": 4841, + "total_submitted": 6895, "total_column_articles": 81, "frontend_question_id": "759", "is_new_question": false @@ -58917,8 +59379,8 @@ "question__title": "Bold Words in String", "question__title_slug": "bold-words-in-string", "question__hide": false, - "total_acs": 4623, - "total_submitted": 9490, + "total_acs": 4639, + "total_submitted": 9511, "total_column_articles": 89, "frontend_question_id": "758", "is_new_question": false @@ -58938,8 +59400,8 @@ "question__title": "Set Intersection Size At Least Two", "question__title_slug": "set-intersection-size-at-least-two", "question__hide": false, - "total_acs": 19136, - "total_submitted": 34211, + "total_acs": 19159, + "total_submitted": 34274, "total_column_articles": 202, "frontend_question_id": "757", "is_new_question": false @@ -58959,9 +59421,9 @@ "question__title": "Convert Binary Search Tree to Sorted Doubly Linked List", "question__title_slug": "convert-binary-search-tree-to-sorted-doubly-linked-list", "question__hide": false, - "total_acs": 15436, - "total_submitted": 22678, - "total_column_articles": 198, + "total_acs": 15525, + "total_submitted": 22805, + "total_column_articles": 199, "frontend_question_id": "426", "is_new_question": false }, @@ -58980,8 +59442,8 @@ "question__title": "Pyramid Transition Matrix", "question__title_slug": "pyramid-transition-matrix", "question__hide": false, - "total_acs": 7609, - "total_submitted": 15128, + "total_acs": 7656, + "total_submitted": 15267, "total_column_articles": 110, "frontend_question_id": "756", "is_new_question": false @@ -59001,8 +59463,8 @@ "question__title": "Pour Water", "question__title_slug": "pour-water", "question__hide": false, - "total_acs": 2160, - "total_submitted": 4467, + "total_acs": 2165, + "total_submitted": 4474, "total_column_articles": 47, "frontend_question_id": "755", "is_new_question": false @@ -59022,9 +59484,9 @@ "question__title": "Reach a Number", "question__title_slug": "reach-a-number", "question__hide": false, - "total_acs": 38323, - "total_submitted": 74352, - "total_column_articles": 410, + "total_acs": 38392, + "total_submitted": 74475, + "total_column_articles": 411, "frontend_question_id": "754", "is_new_question": false }, @@ -59043,9 +59505,9 @@ "question__title": "Cracking the Safe", "question__title_slug": "cracking-the-safe", "question__hide": false, - "total_acs": 17782, - "total_submitted": 23770, - "total_column_articles": 154, + "total_acs": 17817, + "total_submitted": 23824, + "total_column_articles": 155, "frontend_question_id": "753", "is_new_question": false }, @@ -59064,9 +59526,9 @@ "question__title": "Open the Lock", "question__title_slug": "open-the-lock", "question__hide": false, - "total_acs": 132034, - "total_submitted": 250023, - "total_column_articles": 1280, + "total_acs": 132630, + "total_submitted": 251088, + "total_column_articles": 1285, "frontend_question_id": "752", "is_new_question": false }, @@ -59085,8 +59547,8 @@ "question__title": "IP to CIDR", "question__title_slug": "ip-to-cidr", "question__hide": false, - "total_acs": 2101, - "total_submitted": 4359, + "total_acs": 2106, + "total_submitted": 4367, "total_column_articles": 42, "frontend_question_id": "751", "is_new_question": false @@ -59106,8 +59568,8 @@ "question__title": "Number Of Corner Rectangles", "question__title_slug": "number-of-corner-rectangles", "question__hide": false, - "total_acs": 3588, - "total_submitted": 4927, + "total_acs": 3597, + "total_submitted": 4939, "total_column_articles": 64, "frontend_question_id": "750", "is_new_question": false @@ -59127,8 +59589,8 @@ "question__title": "Contain Virus", "question__title_slug": "contain-virus", "question__hide": false, - "total_acs": 14329, - "total_submitted": 20800, + "total_acs": 14340, + "total_submitted": 20824, "total_column_articles": 142, "frontend_question_id": "749", "is_new_question": false @@ -59148,8 +59610,8 @@ "question__title": "Shortest Completing Word", "question__title_slug": "shortest-completing-word", "question__hide": false, - "total_acs": 50821, - "total_submitted": 76304, + "total_acs": 51005, + "total_submitted": 76552, "total_column_articles": 595, "frontend_question_id": "748", "is_new_question": false @@ -59169,9 +59631,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": 101109, - "total_submitted": 215893, - "total_column_articles": 1003, + "total_acs": 101419, + "total_submitted": 216397, + "total_column_articles": 1004, "frontend_question_id": "747", "is_new_question": false }, @@ -59190,9 +59652,9 @@ "question__title": "Min Cost Climbing Stairs", "question__title_slug": "min-cost-climbing-stairs", "question__hide": false, - "total_acs": 440012, - "total_submitted": 660347, - "total_column_articles": 2892, + "total_acs": 445441, + "total_submitted": 667734, + "total_column_articles": 2910, "frontend_question_id": "746", "is_new_question": false }, @@ -59211,8 +59673,8 @@ "question__title": "Prefix and Suffix Search", "question__title_slug": "prefix-and-suffix-search", "question__hide": false, - "total_acs": 26215, - "total_submitted": 59757, + "total_acs": 26242, + "total_submitted": 59820, "total_column_articles": 262, "frontend_question_id": "745", "is_new_question": false @@ -59232,9 +59694,9 @@ "question__title": "Find Smallest Letter Greater Than Target", "question__title_slug": "find-smallest-letter-greater-than-target", "question__hide": false, - "total_acs": 125265, - "total_submitted": 254502, - "total_column_articles": 1066, + "total_acs": 126054, + "total_submitted": 255839, + "total_column_articles": 1072, "frontend_question_id": "744", "is_new_question": false }, @@ -59253,9 +59715,9 @@ "question__title": "Network Delay Time", "question__title_slug": "network-delay-time", "question__hide": false, - "total_acs": 128650, - "total_submitted": 228270, - "total_column_articles": 975, + "total_acs": 129880, + "total_submitted": 230135, + "total_column_articles": 980, "frontend_question_id": "743", "is_new_question": false }, @@ -59274,8 +59736,8 @@ "question__title": "Closest Leaf in a Binary Tree", "question__title_slug": "closest-leaf-in-a-binary-tree", "question__hide": false, - "total_acs": 2925, - "total_submitted": 5928, + "total_acs": 2937, + "total_submitted": 5943, "total_column_articles": 83, "frontend_question_id": "742", "is_new_question": false @@ -59295,8 +59757,8 @@ "question__title": "To Lower Case", "question__title_slug": "to-lower-case", "question__hide": false, - "total_acs": 148576, - "total_submitted": 194322, + "total_acs": 149773, + "total_submitted": 195911, "total_column_articles": 1022, "frontend_question_id": "709", "is_new_question": false @@ -59316,8 +59778,8 @@ "question__title": "Cherry Pickup", "question__title_slug": "cherry-pickup", "question__hide": false, - "total_acs": 31787, - "total_submitted": 58302, + "total_acs": 32134, + "total_submitted": 58963, "total_column_articles": 186, "frontend_question_id": "741", "is_new_question": false @@ -59337,9 +59799,9 @@ "question__title": "Delete and Earn", "question__title_slug": "delete-and-earn", "question__hide": false, - "total_acs": 123305, - "total_submitted": 203452, - "total_column_articles": 1175, + "total_acs": 124819, + "total_submitted": 206130, + "total_column_articles": 1192, "frontend_question_id": "740", "is_new_question": false }, @@ -59358,9 +59820,9 @@ "question__title": "Daily Temperatures", "question__title_slug": "daily-temperatures", "question__hide": false, - "total_acs": 553192, - "total_submitted": 804740, - "total_column_articles": 3120, + "total_acs": 561068, + "total_submitted": 815756, + "total_column_articles": 3148, "frontend_question_id": "739", "is_new_question": false }, @@ -59379,9 +59841,9 @@ "question__title": "Monotone Increasing Digits", "question__title_slug": "monotone-increasing-digits", "question__hide": false, - "total_acs": 119634, - "total_submitted": 235414, - "total_column_articles": 1066, + "total_acs": 121210, + "total_submitted": 238189, + "total_column_articles": 1077, "frontend_question_id": "738", "is_new_question": false }, @@ -59400,8 +59862,8 @@ "question__title": "Sentence Similarity II", "question__title_slug": "sentence-similarity-ii", "question__hide": false, - "total_acs": 6637, - "total_submitted": 13509, + "total_acs": 6660, + "total_submitted": 13547, "total_column_articles": 116, "frontend_question_id": "737", "is_new_question": false @@ -59421,8 +59883,8 @@ "question__title": "Parse Lisp Expression", "question__title_slug": "parse-lisp-expression", "question__hide": false, - "total_acs": 14005, - "total_submitted": 21144, + "total_acs": 14027, + "total_submitted": 21178, "total_column_articles": 162, "frontend_question_id": "736", "is_new_question": false @@ -59442,9 +59904,9 @@ "question__title": "Asteroid Collision", "question__title_slug": "asteroid-collision", "question__hide": false, - "total_acs": 92372, - "total_submitted": 217483, - "total_column_articles": 937, + "total_acs": 93131, + "total_submitted": 219307, + "total_column_articles": 940, "frontend_question_id": "735", "is_new_question": false }, @@ -59463,9 +59925,9 @@ "question__title": "Sentence Similarity", "question__title_slug": "sentence-similarity", "question__hide": false, - "total_acs": 6093, - "total_submitted": 12641, - "total_column_articles": 95, + "total_acs": 6237, + "total_submitted": 12905, + "total_column_articles": 97, "frontend_question_id": "734", "is_new_question": false }, @@ -59484,9 +59946,9 @@ "question__title": "Flood Fill", "question__title_slug": "flood-fill", "question__hide": false, - "total_acs": 169103, - "total_submitted": 286882, - "total_column_articles": 1339, + "total_acs": 169601, + "total_submitted": 287606, + "total_column_articles": 1342, "frontend_question_id": "733", "is_new_question": false }, @@ -59505,9 +59967,9 @@ "question__title": "My Calendar III", "question__title_slug": "my-calendar-iii", "question__hide": false, - "total_acs": 27034, - "total_submitted": 38358, - "total_column_articles": 255, + "total_acs": 27148, + "total_submitted": 38528, + "total_column_articles": 258, "frontend_question_id": "732", "is_new_question": false }, @@ -59526,9 +59988,9 @@ "question__title": "My Calendar II", "question__title_slug": "my-calendar-ii", "question__hide": false, - "total_acs": 30162, - "total_submitted": 48006, - "total_column_articles": 245, + "total_acs": 30262, + "total_submitted": 48171, + "total_column_articles": 247, "frontend_question_id": "731", "is_new_question": false }, @@ -59547,8 +60009,8 @@ "question__title": "Count Different Palindromic Subsequences", "question__title_slug": "count-different-palindromic-subsequences", "question__hide": false, - "total_acs": 19210, - "total_submitted": 30621, + "total_acs": 19313, + "total_submitted": 30764, "total_column_articles": 132, "frontend_question_id": "730", "is_new_question": false @@ -59568,9 +60030,9 @@ "question__title": "My Calendar I", "question__title_slug": "my-calendar-i", "question__hide": false, - "total_acs": 56054, - "total_submitted": 96222, - "total_column_articles": 463, + "total_acs": 56281, + "total_submitted": 96649, + "total_column_articles": 466, "frontend_question_id": "729", "is_new_question": false }, @@ -59589,9 +60051,9 @@ "question__title": "Self Dividing Numbers", "question__title_slug": "self-dividing-numbers", "question__hide": false, - "total_acs": 85200, - "total_submitted": 111665, - "total_column_articles": 801, + "total_acs": 85478, + "total_submitted": 112016, + "total_column_articles": 804, "frontend_question_id": "728", "is_new_question": false }, @@ -59610,8 +60072,8 @@ "question__title": "Minimum Window Subsequence", "question__title_slug": "minimum-window-subsequence", "question__hide": false, - "total_acs": 6352, - "total_submitted": 14851, + "total_acs": 6366, + "total_submitted": 14884, "total_column_articles": 85, "frontend_question_id": "727", "is_new_question": false @@ -59631,9 +60093,9 @@ "question__title": "Number of Atoms", "question__title_slug": "number-of-atoms", "question__hide": false, - "total_acs": 28756, - "total_submitted": 51992, - "total_column_articles": 491, + "total_acs": 28852, + "total_submitted": 52148, + "total_column_articles": 493, "frontend_question_id": "726", "is_new_question": false }, @@ -59652,9 +60114,9 @@ "question__title": "Split Linked List in Parts", "question__title_slug": "split-linked-list-in-parts", "question__hide": false, - "total_acs": 64820, - "total_submitted": 106796, - "total_column_articles": 772, + "total_acs": 64960, + "total_submitted": 107024, + "total_column_articles": 773, "frontend_question_id": "725", "is_new_question": false }, @@ -59673,9 +60135,9 @@ "question__title": "Find Pivot Index", "question__title_slug": "find-pivot-index", "question__hide": false, - "total_acs": 360501, - "total_submitted": 682012, - "total_column_articles": 1777, + "total_acs": 363395, + "total_submitted": 686727, + "total_column_articles": 1785, "frontend_question_id": "724", "is_new_question": false }, @@ -59694,8 +60156,8 @@ "question__title": "Candy Crush", "question__title_slug": "candy-crush", "question__hide": false, - "total_acs": 3351, - "total_submitted": 4580, + "total_acs": 3409, + "total_submitted": 4663, "total_column_articles": 75, "frontend_question_id": "723", "is_new_question": false @@ -59715,8 +60177,8 @@ "question__title": "Remove Comments", "question__title_slug": "remove-comments", "question__hide": false, - "total_acs": 24277, - "total_submitted": 57137, + "total_acs": 24344, + "total_submitted": 57279, "total_column_articles": 245, "frontend_question_id": "722", "is_new_question": false @@ -59736,9 +60198,9 @@ "question__title": "Accounts Merge", "question__title_slug": "accounts-merge", "question__hide": false, - "total_acs": 42877, - "total_submitted": 87826, - "total_column_articles": 467, + "total_acs": 43151, + "total_submitted": 88292, + "total_column_articles": 469, "frontend_question_id": "721", "is_new_question": false }, @@ -59757,8 +60219,8 @@ "question__title": "Longest Word in Dictionary", "question__title_slug": "longest-word-in-dictionary", "question__hide": false, - "total_acs": 69454, - "total_submitted": 133326, + "total_acs": 69603, + "total_submitted": 133592, "total_column_articles": 730, "frontend_question_id": "720", "is_new_question": false @@ -59778,9 +60240,9 @@ "question__title": "Find K-th Smallest Pair Distance", "question__title_slug": "find-k-th-smallest-pair-distance", "question__hide": false, - "total_acs": 37625, - "total_submitted": 79412, - "total_column_articles": 294, + "total_acs": 37843, + "total_submitted": 79873, + "total_column_articles": 295, "frontend_question_id": "719", "is_new_question": false }, @@ -59799,9 +60261,9 @@ "question__title": "Maximum Length of Repeated Subarray", "question__title_slug": "maximum-length-of-repeated-subarray", "question__hide": false, - "total_acs": 243998, - "total_submitted": 430317, - "total_column_articles": 1203, + "total_acs": 247146, + "total_submitted": 435757, + "total_column_articles": 1209, "frontend_question_id": "718", "is_new_question": false }, @@ -59820,8 +60282,8 @@ "question__title": "1-bit and 2-bit Characters", "question__title_slug": "1-bit-and-2-bit-characters", "question__hide": false, - "total_acs": 72992, - "total_submitted": 131770, + "total_acs": 73200, + "total_submitted": 132081, "total_column_articles": 856, "frontend_question_id": "717", "is_new_question": false @@ -59841,8 +60303,8 @@ "question__title": "Max Stack", "question__title_slug": "max-stack", "question__hide": false, - "total_acs": 7675, - "total_submitted": 17849, + "total_acs": 7704, + "total_submitted": 17924, "total_column_articles": 114, "frontend_question_id": "716", "is_new_question": false @@ -59862,9 +60324,9 @@ "question__title": "Range Module", "question__title_slug": "range-module", "question__hide": false, - "total_acs": 29401, - "total_submitted": 53039, - "total_column_articles": 255, + "total_acs": 29503, + "total_submitted": 53248, + "total_column_articles": 256, "frontend_question_id": "715", "is_new_question": false }, @@ -59883,9 +60345,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": 275272, - "total_submitted": 360150, - "total_column_articles": 1473, + "total_acs": 277645, + "total_submitted": 363114, + "total_column_articles": 1481, "frontend_question_id": "714", "is_new_question": false }, @@ -59904,9 +60366,9 @@ "question__title": "Subarray Product Less Than K", "question__title_slug": "subarray-product-less-than-k", "question__hide": false, - "total_acs": 117429, - "total_submitted": 231701, - "total_column_articles": 967, + "total_acs": 118515, + "total_submitted": 233436, + "total_column_articles": 974, "frontend_question_id": "713", "is_new_question": false }, @@ -59925,9 +60387,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": 44292, - "total_submitted": 62898, - "total_column_articles": 400, + "total_acs": 44949, + "total_submitted": 63744, + "total_column_articles": 403, "frontend_question_id": "712", "is_new_question": false }, @@ -59946,8 +60408,8 @@ "question__title": "Number of Distinct Islands II", "question__title_slug": "number-of-distinct-islands-ii", "question__hide": false, - "total_acs": 1835, - "total_submitted": 3191, + "total_acs": 1838, + "total_submitted": 3195, "total_column_articles": 49, "frontend_question_id": "711", "is_new_question": false @@ -59967,9 +60429,9 @@ "question__title": "Falling Squares", "question__title_slug": "falling-squares", "question__hide": false, - "total_acs": 24239, - "total_submitted": 44384, - "total_column_articles": 249, + "total_acs": 24359, + "total_submitted": 44595, + "total_column_articles": 250, "frontend_question_id": "699", "is_new_question": false }, @@ -59988,9 +60450,9 @@ "question__title": "Partition to K Equal Sum Subsets", "question__title_slug": "partition-to-k-equal-sum-subsets", "question__hide": false, - "total_acs": 114887, - "total_submitted": 275207, - "total_column_articles": 1460, + "total_acs": 115410, + "total_submitted": 276434, + "total_column_articles": 1462, "frontend_question_id": "698", "is_new_question": false }, @@ -60009,9 +60471,9 @@ "question__title": "Degree of an Array", "question__title_slug": "degree-of-an-array", "question__hide": false, - "total_acs": 101798, - "total_submitted": 172422, - "total_column_articles": 1229, + "total_acs": 102274, + "total_submitted": 173199, + "total_column_articles": 1233, "frontend_question_id": "697", "is_new_question": false }, @@ -60030,9 +60492,9 @@ "question__title": "Count Binary Substrings", "question__title_slug": "count-binary-substrings", "question__hide": false, - "total_acs": 76818, - "total_submitted": 120827, - "total_column_articles": 666, + "total_acs": 77133, + "total_submitted": 121319, + "total_column_articles": 667, "frontend_question_id": "696", "is_new_question": false }, @@ -60051,9 +60513,9 @@ "question__title": "Max Area of Island", "question__title_slug": "max-area-of-island", "question__hide": false, - "total_acs": 332030, - "total_submitted": 487915, - "total_column_articles": 2723, + "total_acs": 334805, + "total_submitted": 491761, + "total_column_articles": 2737, "frontend_question_id": "695", "is_new_question": false }, @@ -60072,8 +60534,8 @@ "question__title": "Number of Distinct Islands", "question__title_slug": "number-of-distinct-islands", "question__hide": false, - "total_acs": 12852, - "total_submitted": 21900, + "total_acs": 12952, + "total_submitted": 22066, "total_column_articles": 202, "frontend_question_id": "694", "is_new_question": false @@ -60093,8 +60555,8 @@ "question__title": "Binary Number with Alternating Bits", "question__title_slug": "binary-number-with-alternating-bits", "question__hide": false, - "total_acs": 83867, - "total_submitted": 128515, + "total_acs": 84201, + "total_submitted": 129056, "total_column_articles": 874, "frontend_question_id": "693", "is_new_question": false @@ -60114,9 +60576,9 @@ "question__title": "Top K Frequent Words", "question__title_slug": "top-k-frequent-words", "question__hide": false, - "total_acs": 118310, - "total_submitted": 210867, - "total_column_articles": 1132, + "total_acs": 119054, + "total_submitted": 212133, + "total_column_articles": 1136, "frontend_question_id": "692", "is_new_question": false }, @@ -60135,9 +60597,9 @@ "question__title": "Stickers to Spell Word", "question__title_slug": "stickers-to-spell-word", "question__hide": false, - "total_acs": 27051, - "total_submitted": 46676, - "total_column_articles": 218, + "total_acs": 27165, + "total_submitted": 46901, + "total_column_articles": 219, "frontend_question_id": "691", "is_new_question": false }, @@ -60156,8 +60618,8 @@ "question__title": "Employee Importance", "question__title_slug": "employee-importance", "question__hide": false, - "total_acs": 68688, - "total_submitted": 103958, + "total_acs": 68803, + "total_submitted": 104090, "total_column_articles": 683, "frontend_question_id": "690", "is_new_question": false @@ -60177,8 +60639,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": 33030, - "total_submitted": 56392, + "total_acs": 33124, + "total_submitted": 56603, "total_column_articles": 356, "frontend_question_id": "689", "is_new_question": false @@ -60198,9 +60660,9 @@ "question__title": "Knight Probability in Chessboard", "question__title_slug": "knight-probability-in-chessboard", "question__hide": false, - "total_acs": 38192, - "total_submitted": 65853, - "total_column_articles": 401, + "total_acs": 38356, + "total_submitted": 66103, + "total_column_articles": 405, "frontend_question_id": "688", "is_new_question": false }, @@ -60219,8 +60681,8 @@ "question__title": "Longest Univalue Path", "question__title_slug": "longest-univalue-path", "question__hide": false, - "total_acs": 87960, - "total_submitted": 183106, + "total_acs": 88241, + "total_submitted": 183588, "total_column_articles": 693, "frontend_question_id": "687", "is_new_question": false @@ -60240,9 +60702,9 @@ "question__title": "Repeated String Match", "question__title_slug": "repeated-string-match", "question__hide": false, - "total_acs": 54094, - "total_submitted": 136242, - "total_column_articles": 670, + "total_acs": 54289, + "total_submitted": 136749, + "total_column_articles": 672, "frontend_question_id": "686", "is_new_question": false }, @@ -60261,9 +60723,9 @@ "question__title": "Redundant Connection II", "question__title_slug": "redundant-connection-ii", "question__hide": false, - "total_acs": 36148, - "total_submitted": 85757, - "total_column_articles": 411, + "total_acs": 36622, + "total_submitted": 86783, + "total_column_articles": 415, "frontend_question_id": "685", "is_new_question": false }, @@ -60282,9 +60744,9 @@ "question__title": "Redundant Connection", "question__title_slug": "redundant-connection", "question__hide": false, - "total_acs": 115997, - "total_submitted": 170869, - "total_column_articles": 1011, + "total_acs": 117195, + "total_submitted": 172498, + "total_column_articles": 1017, "frontend_question_id": "684", "is_new_question": false }, @@ -60303,8 +60765,8 @@ "question__title": "K Empty Slots", "question__title_slug": "k-empty-slots", "question__hide": false, - "total_acs": 4519, - "total_submitted": 9694, + "total_acs": 4534, + "total_submitted": 9807, "total_column_articles": 78, "frontend_question_id": "683", "is_new_question": false @@ -60324,9 +60786,9 @@ "question__title": "Baseball Game", "question__title_slug": "baseball-game", "question__hide": false, - "total_acs": 109307, - "total_submitted": 154054, - "total_column_articles": 1104, + "total_acs": 109838, + "total_submitted": 154763, + "total_column_articles": 1105, "frontend_question_id": "682", "is_new_question": false }, @@ -60345,8 +60807,8 @@ "question__title": "Next Closest Time", "question__title_slug": "next-closest-time", "question__hide": false, - "total_acs": 4715, - "total_submitted": 9454, + "total_acs": 4731, + "total_submitted": 9475, "total_column_articles": 99, "frontend_question_id": "681", "is_new_question": false @@ -60366,9 +60828,9 @@ "question__title": "Valid Palindrome II", "question__title_slug": "valid-palindrome-ii", "question__hide": false, - "total_acs": 149485, - "total_submitted": 371754, - "total_column_articles": 1270, + "total_acs": 150115, + "total_submitted": 373120, + "total_column_articles": 1271, "frontend_question_id": "680", "is_new_question": false }, @@ -60387,9 +60849,9 @@ "question__title": "24 Game", "question__title_slug": "24-game", "question__hide": false, - "total_acs": 43485, - "total_submitted": 80921, - "total_column_articles": 379, + "total_acs": 43896, + "total_submitted": 81720, + "total_column_articles": 381, "frontend_question_id": "679", "is_new_question": false }, @@ -60408,9 +60870,9 @@ "question__title": "Valid Parenthesis String", "question__title_slug": "valid-parenthesis-string", "question__hide": false, - "total_acs": 74551, - "total_submitted": 189190, - "total_column_articles": 704, + "total_acs": 74892, + "total_submitted": 189908, + "total_column_articles": 705, "frontend_question_id": "678", "is_new_question": false }, @@ -60429,8 +60891,8 @@ "question__title": "Map Sum Pairs", "question__title_slug": "map-sum-pairs", "question__hide": false, - "total_acs": 51582, - "total_submitted": 78783, + "total_acs": 51717, + "total_submitted": 79012, "total_column_articles": 722, "frontend_question_id": "677", "is_new_question": false @@ -60450,9 +60912,9 @@ "question__title": "Implement Magic Dictionary", "question__title_slug": "implement-magic-dictionary", "question__hide": false, - "total_acs": 41753, - "total_submitted": 63996, - "total_column_articles": 486, + "total_acs": 41879, + "total_submitted": 64189, + "total_column_articles": 487, "frontend_question_id": "676", "is_new_question": false }, @@ -60471,8 +60933,8 @@ "question__title": "Cut Off Trees for Golf Event", "question__title_slug": "cut-off-trees-for-golf-event", "question__hide": false, - "total_acs": 23063, - "total_submitted": 44812, + "total_acs": 23159, + "total_submitted": 45014, "total_column_articles": 223, "frontend_question_id": "675", "is_new_question": false @@ -60492,9 +60954,9 @@ "question__title": "Longest Continuous Increasing Subsequence", "question__title_slug": "longest-continuous-increasing-subsequence", "question__hide": false, - "total_acs": 246412, - "total_submitted": 430640, - "total_column_articles": 1474, + "total_acs": 249086, + "total_submitted": 434525, + "total_column_articles": 1482, "frontend_question_id": "674", "is_new_question": false }, @@ -60513,9 +60975,9 @@ "question__title": "Number of Longest Increasing Subsequence", "question__title_slug": "number-of-longest-increasing-subsequence", "question__hide": false, - "total_acs": 103172, - "total_submitted": 230409, - "total_column_articles": 723, + "total_acs": 104141, + "total_submitted": 232355, + "total_column_articles": 728, "frontend_question_id": "673", "is_new_question": false }, @@ -60534,8 +60996,8 @@ "question__title": "Bulb Switcher II", "question__title_slug": "bulb-switcher-ii", "question__hide": false, - "total_acs": 27594, - "total_submitted": 45442, + "total_acs": 27644, + "total_submitted": 45540, "total_column_articles": 265, "frontend_question_id": "672", "is_new_question": false @@ -60555,9 +61017,9 @@ "question__title": "Second Minimum Node In a Binary Tree", "question__title_slug": "second-minimum-node-in-a-binary-tree", "question__hide": false, - "total_acs": 75344, - "total_submitted": 157028, - "total_column_articles": 908, + "total_acs": 75628, + "total_submitted": 157594, + "total_column_articles": 910, "frontend_question_id": "671", "is_new_question": false }, @@ -60576,8 +61038,8 @@ "question__title": "Maximum Swap", "question__title_slug": "maximum-swap", "question__hide": false, - "total_acs": 93057, - "total_submitted": 189488, + "total_acs": 93452, + "total_submitted": 190250, "total_column_articles": 1182, "frontend_question_id": "670", "is_new_question": false @@ -60597,9 +61059,9 @@ "question__title": "Trim a Binary Search Tree", "question__title_slug": "trim-a-binary-search-tree", "question__hide": false, - "total_acs": 161436, - "total_submitted": 240905, - "total_column_articles": 1071, + "total_acs": 163239, + "total_submitted": 243577, + "total_column_articles": 1079, "frontend_question_id": "669", "is_new_question": false }, @@ -60618,9 +61080,9 @@ "question__title": "Kth Smallest Number in Multiplication Table", "question__title_slug": "kth-smallest-number-in-multiplication-table", "question__hide": false, - "total_acs": 31975, - "total_submitted": 54470, - "total_column_articles": 285, + "total_acs": 32100, + "total_submitted": 54658, + "total_column_articles": 286, "frontend_question_id": "668", "is_new_question": false }, @@ -60639,8 +61101,8 @@ "question__title": "Beautiful Arrangement II", "question__title_slug": "beautiful-arrangement-ii", "question__hide": false, - "total_acs": 37052, - "total_submitted": 55447, + "total_acs": 37127, + "total_submitted": 55554, "total_column_articles": 523, "frontend_question_id": "667", "is_new_question": false @@ -60660,8 +61122,8 @@ "question__title": "Path Sum IV", "question__title_slug": "path-sum-iv", "question__hide": false, - "total_acs": 4137, - "total_submitted": 6598, + "total_acs": 4166, + "total_submitted": 6637, "total_column_articles": 116, "frontend_question_id": "666", "is_new_question": false @@ -60681,9 +61143,9 @@ "question__title": "Non-decreasing Array", "question__title_slug": "non-decreasing-array", "question__hide": false, - "total_acs": 109890, - "total_submitted": 393561, - "total_column_articles": 1277, + "total_acs": 110340, + "total_submitted": 395033, + "total_column_articles": 1281, "frontend_question_id": "665", "is_new_question": false }, @@ -60702,8 +61164,8 @@ "question__title": "Strange Printer", "question__title_slug": "strange-printer", "question__hide": false, - "total_acs": 29378, - "total_submitted": 44936, + "total_acs": 29539, + "total_submitted": 45194, "total_column_articles": 246, "frontend_question_id": "664", "is_new_question": false @@ -60723,8 +61185,8 @@ "question__title": "Equal Tree Partition", "question__title_slug": "equal-tree-partition", "question__hide": false, - "total_acs": 3141, - "total_submitted": 6875, + "total_acs": 3173, + "total_submitted": 6935, "total_column_articles": 60, "frontend_question_id": "663", "is_new_question": false @@ -60744,9 +61206,9 @@ "question__title": "Maximum Width of Binary Tree", "question__title_slug": "maximum-width-of-binary-tree", "question__hide": false, - "total_acs": 107982, - "total_submitted": 245987, - "total_column_articles": 901, + "total_acs": 108941, + "total_submitted": 247834, + "total_column_articles": 904, "frontend_question_id": "662", "is_new_question": false }, @@ -60765,8 +61227,8 @@ "question__title": "Image Smoother", "question__title_slug": "image-smoother", "question__hide": false, - "total_acs": 59324, - "total_submitted": 92523, + "total_acs": 59568, + "total_submitted": 92915, "total_column_articles": 608, "frontend_question_id": "661", "is_new_question": false @@ -60786,8 +61248,8 @@ "question__title": "Remove 9", "question__title_slug": "remove-9", "question__hide": false, - "total_acs": 1524, - "total_submitted": 2391, + "total_acs": 1532, + "total_submitted": 2402, "total_column_articles": 40, "frontend_question_id": "660", "is_new_question": false @@ -60807,9 +61269,9 @@ "question__title": "Split Array into Consecutive Subsequences", "question__title_slug": "split-array-into-consecutive-subsequences", "question__hide": false, - "total_acs": 39237, - "total_submitted": 71107, - "total_column_articles": 412, + "total_acs": 39347, + "total_submitted": 71274, + "total_column_articles": 413, "frontend_question_id": "659", "is_new_question": false }, @@ -60828,9 +61290,9 @@ "question__title": "Find K Closest Elements", "question__title_slug": "find-k-closest-elements", "question__hide": false, - "total_acs": 100846, - "total_submitted": 210946, - "total_column_articles": 877, + "total_acs": 101680, + "total_submitted": 212704, + "total_column_articles": 881, "frontend_question_id": "658", "is_new_question": false }, @@ -60849,9 +61311,9 @@ "question__title": "Robot Return to Origin", "question__title_slug": "robot-return-to-origin", "question__hide": false, - "total_acs": 122219, - "total_submitted": 154033, - "total_column_articles": 945, + "total_acs": 122847, + "total_submitted": 154751, + "total_column_articles": 948, "frontend_question_id": "657", "is_new_question": false }, @@ -60870,8 +61332,8 @@ "question__title": "Coin Path", "question__title_slug": "coin-path", "question__hide": false, - "total_acs": 1661, - "total_submitted": 4771, + "total_acs": 1666, + "total_submitted": 4778, "total_column_articles": 38, "frontend_question_id": "656", "is_new_question": false @@ -60891,8 +61353,8 @@ "question__title": "Print Binary Tree", "question__title_slug": "print-binary-tree", "question__hide": false, - "total_acs": 37805, - "total_submitted": 54219, + "total_acs": 37871, + "total_submitted": 54309, "total_column_articles": 521, "frontend_question_id": "655", "is_new_question": false @@ -60912,9 +61374,9 @@ "question__title": "Maximum Binary Tree", "question__title_slug": "maximum-binary-tree", "question__hide": false, - "total_acs": 251781, - "total_submitted": 306812, - "total_column_articles": 1816, + "total_acs": 254406, + "total_submitted": 310033, + "total_column_articles": 1821, "frontend_question_id": "654", "is_new_question": false }, @@ -60933,9 +61395,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": 121069, - "total_submitted": 190535, - "total_column_articles": 1024, + "total_acs": 121459, + "total_submitted": 191135, + "total_column_articles": 1025, "frontend_question_id": "653", "is_new_question": false }, @@ -60954,8 +61416,8 @@ "question__title": "Find Duplicate Subtrees", "question__title_slug": "find-duplicate-subtrees", "question__hide": false, - "total_acs": 103915, - "total_submitted": 169289, + "total_acs": 104226, + "total_submitted": 169786, "total_column_articles": 664, "frontend_question_id": "652", "is_new_question": false @@ -60975,8 +61437,8 @@ "question__title": "4 Keys Keyboard", "question__title_slug": "4-keys-keyboard", "question__hide": false, - "total_acs": 8169, - "total_submitted": 13486, + "total_acs": 8247, + "total_submitted": 13593, "total_column_articles": 114, "frontend_question_id": "651", "is_new_question": false @@ -60996,9 +61458,9 @@ "question__title": "2 Keys Keyboard", "question__title_slug": "2-keys-keyboard", "question__hide": false, - "total_acs": 70338, - "total_submitted": 121636, - "total_column_articles": 804, + "total_acs": 70543, + "total_submitted": 121955, + "total_column_articles": 805, "frontend_question_id": "650", "is_new_question": false }, @@ -61017,9 +61479,9 @@ "question__title": "Dota2 Senate", "question__title_slug": "dota2-senate", "question__hide": false, - "total_acs": 53019, - "total_submitted": 108586, - "total_column_articles": 481, + "total_acs": 53534, + "total_submitted": 109515, + "total_column_articles": 483, "frontend_question_id": "649", "is_new_question": false }, @@ -61038,9 +61500,9 @@ "question__title": "Replace Words", "question__title_slug": "replace-words", "question__hide": false, - "total_acs": 79770, - "total_submitted": 125556, - "total_column_articles": 882, + "total_acs": 80114, + "total_submitted": 126093, + "total_column_articles": 886, "frontend_question_id": "648", "is_new_question": false }, @@ -61059,9 +61521,9 @@ "question__title": "Palindromic Substrings", "question__title_slug": "palindromic-substrings", "question__hide": false, - "total_acs": 334684, - "total_submitted": 497140, - "total_column_articles": 1892, + "total_acs": 337634, + "total_submitted": 501207, + "total_column_articles": 1901, "frontend_question_id": "647", "is_new_question": false }, @@ -61080,9 +61542,9 @@ "question__title": "Maximum Length of Pair Chain", "question__title_slug": "maximum-length-of-pair-chain", "question__hide": false, - "total_acs": 78006, - "total_submitted": 123766, - "total_column_articles": 698, + "total_acs": 78622, + "total_submitted": 124599, + "total_column_articles": 701, "frontend_question_id": "646", "is_new_question": false }, @@ -61101,9 +61563,9 @@ "question__title": "Set Mismatch", "question__title_slug": "set-mismatch", "question__hide": false, - "total_acs": 120898, - "total_submitted": 309507, - "total_column_articles": 1153, + "total_acs": 121656, + "total_submitted": 311469, + "total_column_articles": 1156, "frontend_question_id": "645", "is_new_question": false }, @@ -61122,8 +61584,8 @@ "question__title": "Maximum Average Subarray II", "question__title_slug": "maximum-average-subarray-ii", "question__hide": false, - "total_acs": 2941, - "total_submitted": 6498, + "total_acs": 2975, + "total_submitted": 6573, "total_column_articles": 41, "frontend_question_id": "644", "is_new_question": false @@ -61143,9 +61605,9 @@ "question__title": "Maximum Average Subarray I", "question__title_slug": "maximum-average-subarray-i", "question__hide": false, - "total_acs": 137004, - "total_submitted": 317733, - "total_column_articles": 1027, + "total_acs": 138525, + "total_submitted": 320911, + "total_column_articles": 1032, "frontend_question_id": "643", "is_new_question": false }, @@ -61164,8 +61626,8 @@ "question__title": "Design Search Autocomplete System", "question__title_slug": "design-search-autocomplete-system", "question__hide": false, - "total_acs": 5914, - "total_submitted": 10590, + "total_acs": 5943, + "total_submitted": 10632, "total_column_articles": 99, "frontend_question_id": "642", "is_new_question": false @@ -61185,8 +61647,8 @@ "question__title": "Solve the Equation", "question__title_slug": "solve-the-equation", "question__hide": false, - "total_acs": 38909, - "total_submitted": 87641, + "total_acs": 39024, + "total_submitted": 87891, "total_column_articles": 730, "frontend_question_id": "640", "is_new_question": false @@ -61206,9 +61668,9 @@ "question__title": "Decode Ways II", "question__title_slug": "decode-ways-ii", "question__hide": false, - "total_acs": 26213, - "total_submitted": 71125, - "total_column_articles": 334, + "total_acs": 26452, + "total_submitted": 71859, + "total_column_articles": 335, "frontend_question_id": "639", "is_new_question": false }, @@ -61227,9 +61689,9 @@ "question__title": "Shopping Offers", "question__title_slug": "shopping-offers", "question__hide": false, - "total_acs": 37870, - "total_submitted": 60961, - "total_column_articles": 352, + "total_acs": 37970, + "total_submitted": 61182, + "total_column_articles": 354, "frontend_question_id": "638", "is_new_question": false }, @@ -61248,9 +61710,9 @@ "question__title": "Average of Levels in Binary Tree", "question__title_slug": "average-of-levels-in-binary-tree", "question__hide": false, - "total_acs": 196359, - "total_submitted": 278277, - "total_column_articles": 1230, + "total_acs": 199637, + "total_submitted": 282612, + "total_column_articles": 1240, "frontend_question_id": "637", "is_new_question": false }, @@ -61269,9 +61731,9 @@ "question__title": "Exclusive Time of Functions", "question__title_slug": "exclusive-time-of-functions", "question__hide": false, - "total_acs": 37483, - "total_submitted": 56606, - "total_column_articles": 369, + "total_acs": 37590, + "total_submitted": 56799, + "total_column_articles": 370, "frontend_question_id": "636", "is_new_question": false }, @@ -61290,8 +61752,8 @@ "question__title": "Design Log Storage System", "question__title_slug": "design-log-storage-system", "question__hide": false, - "total_acs": 6472, - "total_submitted": 11622, + "total_acs": 6476, + "total_submitted": 11635, "total_column_articles": 112, "frontend_question_id": "635", "is_new_question": false @@ -61311,8 +61773,8 @@ "question__title": "Find the Derangement of An Array", "question__title_slug": "find-the-derangement-of-an-array", "question__hide": false, - "total_acs": 2708, - "total_submitted": 5813, + "total_acs": 2718, + "total_submitted": 5844, "total_column_articles": 37, "frontend_question_id": "634", "is_new_question": false @@ -61332,9 +61794,9 @@ "question__title": "Sum of Square Numbers", "question__title_slug": "sum-of-square-numbers", "question__hide": false, - "total_acs": 140552, - "total_submitted": 369828, - "total_column_articles": 1068, + "total_acs": 140943, + "total_submitted": 370906, + "total_column_articles": 1070, "frontend_question_id": "633", "is_new_question": false }, @@ -61353,9 +61815,9 @@ "question__title": "Smallest Range Covering Elements from K Lists", "question__title_slug": "smallest-range-covering-elements-from-k-lists", "question__hide": false, - "total_acs": 28355, - "total_submitted": 46439, - "total_column_articles": 335, + "total_acs": 28587, + "total_submitted": 46779, + "total_column_articles": 338, "frontend_question_id": "632", "is_new_question": false }, @@ -61374,8 +61836,8 @@ "question__title": "Design Excel Sum Formula", "question__title_slug": "design-excel-sum-formula", "question__hide": false, - "total_acs": 1826, - "total_submitted": 5363, + "total_acs": 1830, + "total_submitted": 5371, "total_column_articles": 49, "frontend_question_id": "631", "is_new_question": false @@ -61395,8 +61857,8 @@ "question__title": "Course Schedule III", "question__title_slug": "course-schedule-iii", "question__hide": false, - "total_acs": 46385, - "total_submitted": 95633, + "total_acs": 46623, + "total_submitted": 96181, "total_column_articles": 346, "frontend_question_id": "630", "is_new_question": false @@ -61416,9 +61878,9 @@ "question__title": "K Inverse Pairs Array", "question__title_slug": "k-inverse-pairs-array", "question__hide": false, - "total_acs": 24323, - "total_submitted": 48273, - "total_column_articles": 222, + "total_acs": 24440, + "total_submitted": 48513, + "total_column_articles": 223, "frontend_question_id": "629", "is_new_question": false }, @@ -61437,9 +61899,9 @@ "question__title": "Maximum Product of Three Numbers", "question__title_slug": "maximum-product-of-three-numbers", "question__hide": false, - "total_acs": 133387, - "total_submitted": 257532, - "total_column_articles": 1185, + "total_acs": 134091, + "total_submitted": 258958, + "total_column_articles": 1190, "frontend_question_id": "628", "is_new_question": false }, @@ -61458,9 +61920,9 @@ "question__title": "Swap Salary", "question__title_slug": "swap-salary", "question__hide": false, - "total_acs": 191046, - "total_submitted": 231926, - "total_column_articles": 700, + "total_acs": 191761, + "total_submitted": 232728, + "total_column_articles": 701, "frontend_question_id": "627", "is_new_question": false }, @@ -61479,9 +61941,9 @@ "question__title": "Exchange Seats", "question__title_slug": "exchange-seats", "question__hide": false, - "total_acs": 91587, - "total_submitted": 133123, - "total_column_articles": 769, + "total_acs": 92838, + "total_submitted": 134750, + "total_column_articles": 777, "frontend_question_id": "626", "is_new_question": false }, @@ -61500,8 +61962,8 @@ "question__title": "Minimum Factorization", "question__title_slug": "minimum-factorization", "question__hide": false, - "total_acs": 3609, - "total_submitted": 10395, + "total_acs": 3623, + "total_submitted": 10433, "total_column_articles": 71, "frontend_question_id": "625", "is_new_question": false @@ -61521,8 +61983,8 @@ "question__title": "Maximum Distance in Arrays", "question__title_slug": "maximum-distance-in-arrays", "question__hide": false, - "total_acs": 9083, - "total_submitted": 22808, + "total_acs": 9353, + "total_submitted": 23458, "total_column_articles": 139, "frontend_question_id": "624", "is_new_question": false @@ -61542,9 +62004,9 @@ "question__title": "Add One Row to Tree", "question__title_slug": "add-one-row-to-tree", "question__hide": false, - "total_acs": 48842, - "total_submitted": 81241, - "total_column_articles": 671, + "total_acs": 49023, + "total_submitted": 81550, + "total_column_articles": 672, "frontend_question_id": "623", "is_new_question": false }, @@ -61563,9 +62025,9 @@ "question__title": "Task Scheduler", "question__title_slug": "task-scheduler", "question__hide": false, - "total_acs": 152330, - "total_submitted": 253485, - "total_column_articles": 899, + "total_acs": 152943, + "total_submitted": 254348, + "total_column_articles": 901, "frontend_question_id": "621", "is_new_question": false }, @@ -61584,9 +62046,9 @@ "question__title": "Not Boring Movies", "question__title_slug": "not-boring-movies", "question__hide": false, - "total_acs": 168219, - "total_submitted": 217050, - "total_column_articles": 540, + "total_acs": 170760, + "total_submitted": 220157, + "total_column_articles": 546, "frontend_question_id": "620", "is_new_question": false }, @@ -61605,9 +62067,9 @@ "question__title": "Biggest Single Number", "question__title_slug": "biggest-single-number", "question__hide": false, - "total_acs": 58227, - "total_submitted": 106271, - "total_column_articles": 314, + "total_acs": 60110, + "total_submitted": 108940, + "total_column_articles": 320, "frontend_question_id": "619", "is_new_question": false }, @@ -61626,8 +62088,8 @@ "question__title": "Students Report By Geography", "question__title_slug": "students-report-by-geography", "question__hide": false, - "total_acs": 10816, - "total_submitted": 17572, + "total_acs": 10898, + "total_submitted": 17693, "total_column_articles": 100, "frontend_question_id": "618", "is_new_question": false @@ -61647,9 +62109,9 @@ "question__title": "Merge Two Binary Trees", "question__title_slug": "merge-two-binary-trees", "question__hide": false, - "total_acs": 490795, - "total_submitted": 618824, - "total_column_articles": 2637, + "total_acs": 493913, + "total_submitted": 622516, + "total_column_articles": 2652, "frontend_question_id": "617", "is_new_question": false }, @@ -61668,8 +62130,8 @@ "question__title": "Add Bold Tag in String", "question__title_slug": "add-bold-tag-in-string", "question__hide": false, - "total_acs": 7048, - "total_submitted": 13895, + "total_acs": 7123, + "total_submitted": 14036, "total_column_articles": 111, "frontend_question_id": "616", "is_new_question": false @@ -61689,8 +62151,8 @@ "question__title": "Average Salary: Departments VS Company", "question__title_slug": "average-salary-departments-vs-company", "question__hide": false, - "total_acs": 11788, - "total_submitted": 27600, + "total_acs": 11889, + "total_submitted": 27747, "total_column_articles": 165, "frontend_question_id": "615", "is_new_question": false @@ -61710,9 +62172,9 @@ "question__title": "Second Degree Follower", "question__title_slug": "second-degree-follower", "question__hide": false, - "total_acs": 17172, - "total_submitted": 45164, - "total_column_articles": 122, + "total_acs": 17258, + "total_submitted": 45359, + "total_column_articles": 123, "frontend_question_id": "614", "is_new_question": false }, @@ -61731,9 +62193,9 @@ "question__title": "Shortest Distance in a Line", "question__title_slug": "shortest-distance-in-a-line", "question__hide": false, - "total_acs": 23457, - "total_submitted": 29741, - "total_column_articles": 139, + "total_acs": 23636, + "total_submitted": 29966, + "total_column_articles": 141, "frontend_question_id": "613", "is_new_question": false }, @@ -61752,8 +62214,8 @@ "question__title": "Shortest Distance in a Plane", "question__title_slug": "shortest-distance-in-a-plane", "question__hide": false, - "total_acs": 15292, - "total_submitted": 23833, + "total_acs": 15384, + "total_submitted": 23989, "total_column_articles": 115, "frontend_question_id": "612", "is_new_question": false @@ -61773,9 +62235,9 @@ "question__title": "Valid Triangle Number", "question__title_slug": "valid-triangle-number", "question__hide": false, - "total_acs": 104141, - "total_submitted": 194199, - "total_column_articles": 717, + "total_acs": 105107, + "total_submitted": 195785, + "total_column_articles": 721, "frontend_question_id": "611", "is_new_question": false }, @@ -61794,9 +62256,9 @@ "question__title": "Triangle Judgement", "question__title_slug": "triangle-judgement", "question__hide": false, - "total_acs": 48015, - "total_submitted": 69328, - "total_column_articles": 225, + "total_acs": 49640, + "total_submitted": 71447, + "total_column_articles": 228, "frontend_question_id": "610", "is_new_question": false }, @@ -61815,9 +62277,9 @@ "question__title": "Find Duplicate File in System", "question__title_slug": "find-duplicate-file-in-system", "question__hide": false, - "total_acs": 11993, - "total_submitted": 22315, - "total_column_articles": 170, + "total_acs": 12125, + "total_submitted": 22498, + "total_column_articles": 172, "frontend_question_id": "609", "is_new_question": false }, @@ -61836,9 +62298,9 @@ "question__title": "Tree Node", "question__title_slug": "tree-node", "question__hide": false, - "total_acs": 67060, - "total_submitted": 107538, - "total_column_articles": 499, + "total_acs": 67739, + "total_submitted": 108420, + "total_column_articles": 505, "frontend_question_id": "608", "is_new_question": false }, @@ -61857,9 +62319,9 @@ "question__title": "Sales Person", "question__title_slug": "sales-person", "question__hide": false, - "total_acs": 89750, - "total_submitted": 134628, - "total_column_articles": 487, + "total_acs": 90853, + "total_submitted": 136279, + "total_column_articles": 491, "frontend_question_id": "607", "is_new_question": false }, @@ -61878,9 +62340,9 @@ "question__title": "Construct String from Binary Tree", "question__title_slug": "construct-string-from-binary-tree", "question__hide": false, - "total_acs": 80322, - "total_submitted": 129872, - "total_column_articles": 775, + "total_acs": 80604, + "total_submitted": 130288, + "total_column_articles": 779, "frontend_question_id": "606", "is_new_question": false }, @@ -61899,9 +62361,9 @@ "question__title": "Can Place Flowers", "question__title_slug": "can-place-flowers", "question__hide": false, - "total_acs": 229054, - "total_submitted": 709951, - "total_column_articles": 2251, + "total_acs": 230673, + "total_submitted": 715017, + "total_column_articles": 2257, "frontend_question_id": "605", "is_new_question": false }, @@ -61920,8 +62382,8 @@ "question__title": "Design Compressed String Iterator", "question__title_slug": "design-compressed-string-iterator", "question__hide": false, - "total_acs": 4636, - "total_submitted": 11739, + "total_acs": 4678, + "total_submitted": 11826, "total_column_articles": 102, "frontend_question_id": "604", "is_new_question": false @@ -61941,9 +62403,9 @@ "question__title": "Consecutive Available Seats", "question__title_slug": "consecutive-available-seats", "question__hide": false, - "total_acs": 30840, - "total_submitted": 49368, - "total_column_articles": 265, + "total_acs": 31039, + "total_submitted": 49709, + "total_column_articles": 269, "frontend_question_id": "603", "is_new_question": false }, @@ -61962,9 +62424,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": 36049, - "total_submitted": 59878, - "total_column_articles": 311, + "total_acs": 37201, + "total_submitted": 61761, + "total_column_articles": 314, "frontend_question_id": "602", "is_new_question": false }, @@ -61983,9 +62445,9 @@ "question__title": "Human Traffic of Stadium", "question__title_slug": "human-traffic-of-stadium", "question__hide": false, - "total_acs": 58239, - "total_submitted": 120529, - "total_column_articles": 675, + "total_acs": 58826, + "total_submitted": 121640, + "total_column_articles": 684, "frontend_question_id": "601", "is_new_question": false }, @@ -62004,9 +62466,9 @@ "question__title": "Non-negative Integers without Consecutive Ones", "question__title_slug": "non-negative-integers-without-consecutive-ones", "question__hide": false, - "total_acs": 27856, - "total_submitted": 55435, - "total_column_articles": 338, + "total_acs": 27959, + "total_submitted": 55597, + "total_column_articles": 339, "frontend_question_id": "600", "is_new_question": false }, @@ -62025,9 +62487,9 @@ "question__title": "Minimum Index Sum of Two Lists", "question__title_slug": "minimum-index-sum-of-two-lists", "question__hide": false, - "total_acs": 95682, - "total_submitted": 167048, - "total_column_articles": 772, + "total_acs": 96088, + "total_submitted": 167644, + "total_column_articles": 773, "frontend_question_id": "599", "is_new_question": false }, @@ -62046,8 +62508,8 @@ "question__title": "Range Addition II", "question__title_slug": "range-addition-ii", "question__hide": false, - "total_acs": 59893, - "total_submitted": 102777, + "total_acs": 60191, + "total_submitted": 103197, "total_column_articles": 673, "frontend_question_id": "598", "is_new_question": false @@ -62067,9 +62529,9 @@ "question__title": "Friend Requests I: Overall Acceptance Rate", "question__title_slug": "friend-requests-i-overall-acceptance-rate", "question__hide": false, - "total_acs": 20706, - "total_submitted": 48360, - "total_column_articles": 139, + "total_acs": 20806, + "total_submitted": 48563, + "total_column_articles": 140, "frontend_question_id": "597", "is_new_question": false }, @@ -62088,9 +62550,9 @@ "question__title": "Classes More Than 5 Students", "question__title_slug": "classes-more-than-5-students", "question__hide": false, - "total_acs": 183952, - "total_submitted": 342495, - "total_column_articles": 557, + "total_acs": 186010, + "total_submitted": 345124, + "total_column_articles": 561, "frontend_question_id": "596", "is_new_question": false }, @@ -62109,9 +62571,9 @@ "question__title": "Big Countries", "question__title_slug": "big-countries", "question__hide": false, - "total_acs": 344953, - "total_submitted": 519045, - "total_column_articles": 714, + "total_acs": 348868, + "total_submitted": 524806, + "total_column_articles": 720, "frontend_question_id": "595", "is_new_question": false }, @@ -62130,9 +62592,9 @@ "question__title": "Longest Harmonious Subsequence", "question__title_slug": "longest-harmonious-subsequence", "question__hide": false, - "total_acs": 93575, - "total_submitted": 165536, - "total_column_articles": 765, + "total_acs": 94090, + "total_submitted": 166306, + "total_column_articles": 768, "frontend_question_id": "594", "is_new_question": false }, @@ -62151,9 +62613,9 @@ "question__title": "Valid Square", "question__title_slug": "valid-square", "question__hide": false, - "total_acs": 37768, - "total_submitted": 80343, - "total_column_articles": 597, + "total_acs": 37867, + "total_submitted": 80569, + "total_column_articles": 598, "frontend_question_id": "593", "is_new_question": false }, @@ -62172,8 +62634,8 @@ "question__title": "Fraction Addition and Subtraction", "question__title_slug": "fraction-addition-and-subtraction", "question__hide": false, - "total_acs": 28649, - "total_submitted": 47990, + "total_acs": 28758, + "total_submitted": 48174, "total_column_articles": 489, "frontend_question_id": "592", "is_new_question": false @@ -62193,8 +62655,8 @@ "question__title": "Tag Validator", "question__title_slug": "tag-validator", "question__hide": false, - "total_acs": 18483, - "total_submitted": 35729, + "total_acs": 18512, + "total_submitted": 35774, "total_column_articles": 197, "frontend_question_id": "591", "is_new_question": false @@ -62214,8 +62676,8 @@ "question__title": "Design In-Memory File System", "question__title_slug": "design-in-memory-file-system", "question__hide": false, - "total_acs": 3896, - "total_submitted": 8882, + "total_acs": 3946, + "total_submitted": 8970, "total_column_articles": 58, "frontend_question_id": "588", "is_new_question": false @@ -62235,9 +62697,9 @@ "question__title": "Erect the Fence", "question__title_slug": "erect-the-fence", "question__hide": false, - "total_acs": 18611, - "total_submitted": 30914, - "total_column_articles": 142, + "total_acs": 18641, + "total_submitted": 30956, + "total_column_articles": 145, "frontend_question_id": "587", "is_new_question": false }, @@ -62256,9 +62718,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": 101558, - "total_submitted": 150257, - "total_column_articles": 455, + "total_acs": 102864, + "total_submitted": 152223, + "total_column_articles": 457, "frontend_question_id": "586", "is_new_question": false }, @@ -62277,9 +62739,9 @@ "question__title": "Investments in 2016", "question__title_slug": "investments-in-2016", "question__hide": false, - "total_acs": 37863, - "total_submitted": 80475, - "total_column_articles": 337, + "total_acs": 39086, + "total_submitted": 82865, + "total_column_articles": 348, "frontend_question_id": "585", "is_new_question": false }, @@ -62298,9 +62760,9 @@ "question__title": "Find Customer Referee", "question__title_slug": "find-customer-referee", "question__hide": false, - "total_acs": 218708, - "total_submitted": 327818, - "total_column_articles": 576, + "total_acs": 223483, + "total_submitted": 334339, + "total_column_articles": 582, "frontend_question_id": "584", "is_new_question": false }, @@ -62319,9 +62781,9 @@ "question__title": "Delete Operation for Two Strings", "question__title_slug": "delete-operation-for-two-strings", "question__hide": false, - "total_acs": 158986, - "total_submitted": 236219, - "total_column_articles": 1031, + "total_acs": 160928, + "total_submitted": 238847, + "total_column_articles": 1037, "frontend_question_id": "583", "is_new_question": false }, @@ -62340,9 +62802,9 @@ "question__title": "Kill Process", "question__title_slug": "kill-process", "question__hide": false, - "total_acs": 13767, - "total_submitted": 29121, - "total_column_articles": 194, + "total_acs": 13848, + "total_submitted": 29228, + "total_column_articles": 195, "frontend_question_id": "582", "is_new_question": false }, @@ -62361,9 +62823,9 @@ "question__title": "Shortest Unsorted Continuous Subarray", "question__title_slug": "shortest-unsorted-continuous-subarray", "question__hide": false, - "total_acs": 198406, - "total_submitted": 470281, - "total_column_articles": 1430, + "total_acs": 199185, + "total_submitted": 471917, + "total_column_articles": 1433, "frontend_question_id": "581", "is_new_question": false }, @@ -62382,8 +62844,8 @@ "question__title": "Count Student Number in Departments", "question__title_slug": "count-student-number-in-departments", "question__hide": false, - "total_acs": 25209, - "total_submitted": 46873, + "total_acs": 25315, + "total_submitted": 47070, "total_column_articles": 168, "frontend_question_id": "580", "is_new_question": false @@ -62403,8 +62865,8 @@ "question__title": "Find Cumulative Salary of an Employee", "question__title_slug": "find-cumulative-salary-of-an-employee", "question__hide": false, - "total_acs": 15903, - "total_submitted": 35237, + "total_acs": 16022, + "total_submitted": 35430, "total_column_articles": 204, "frontend_question_id": "579", "is_new_question": false @@ -62424,8 +62886,8 @@ "question__title": "Get Highest Answer Rate Question", "question__title_slug": "get-highest-answer-rate-question", "question__hide": false, - "total_acs": 21597, - "total_submitted": 51614, + "total_acs": 21709, + "total_submitted": 51877, "total_column_articles": 213, "frontend_question_id": "578", "is_new_question": false @@ -62445,9 +62907,9 @@ "question__title": "Employee Bonus", "question__title_slug": "employee-bonus", "question__hide": false, - "total_acs": 82500, - "total_submitted": 117077, - "total_column_articles": 273, + "total_acs": 85599, + "total_submitted": 121193, + "total_column_articles": 278, "frontend_question_id": "577", "is_new_question": false }, @@ -62466,9 +62928,9 @@ "question__title": "Out of Boundary Paths", "question__title_slug": "out-of-boundary-paths", "question__hide": false, - "total_acs": 39434, - "total_submitted": 83866, - "total_column_articles": 401, + "total_acs": 39617, + "total_submitted": 84245, + "total_column_articles": 403, "frontend_question_id": "576", "is_new_question": false }, @@ -62487,9 +62949,9 @@ "question__title": "Distribute Candies", "question__title_slug": "distribute-candies", "question__hide": false, - "total_acs": 124338, - "total_submitted": 176133, - "total_column_articles": 1140, + "total_acs": 142973, + "total_submitted": 198381, + "total_column_articles": 1236, "frontend_question_id": "575", "is_new_question": false }, @@ -62508,9 +62970,9 @@ "question__title": "Winning Candidate", "question__title_slug": "winning-candidate", "question__hide": false, - "total_acs": 25987, - "total_submitted": 39415, - "total_column_articles": 181, + "total_acs": 26110, + "total_submitted": 39592, + "total_column_articles": 182, "frontend_question_id": "574", "is_new_question": false }, @@ -62529,8 +62991,8 @@ "question__title": "Squirrel Simulation", "question__title_slug": "squirrel-simulation", "question__hide": false, - "total_acs": 1914, - "total_submitted": 2930, + "total_acs": 1920, + "total_submitted": 2939, "total_column_articles": 52, "frontend_question_id": "573", "is_new_question": false @@ -62550,9 +63012,9 @@ "question__title": "Subtree of Another Tree", "question__title_slug": "subtree-of-another-tree", "question__hide": false, - "total_acs": 204837, - "total_submitted": 429541, - "total_column_articles": 1453, + "total_acs": 206767, + "total_submitted": 433220, + "total_column_articles": 1458, "frontend_question_id": "572", "is_new_question": false }, @@ -62571,8 +63033,8 @@ "question__title": "Find Median Given Frequency of Numbers", "question__title_slug": "find-median-given-frequency-of-numbers", "question__hide": false, - "total_acs": 15214, - "total_submitted": 32609, + "total_acs": 15306, + "total_submitted": 32869, "total_column_articles": 167, "frontend_question_id": "571", "is_new_question": false @@ -62592,9 +63054,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": 78543, - "total_submitted": 139864, - "total_column_articles": 394, + "total_acs": 81314, + "total_submitted": 145623, + "total_column_articles": 410, "frontend_question_id": "570", "is_new_question": false }, @@ -62613,8 +63075,8 @@ "question__title": "Median Employee Salary", "question__title_slug": "median-employee-salary", "question__hide": false, - "total_acs": 22360, - "total_submitted": 39149, + "total_acs": 22471, + "total_submitted": 39340, "total_column_articles": 287, "frontend_question_id": "569", "is_new_question": false @@ -62634,8 +63096,8 @@ "question__title": "Maximum Vacation Days", "question__title_slug": "maximum-vacation-days", "question__hide": false, - "total_acs": 2635, - "total_submitted": 4714, + "total_acs": 2648, + "total_submitted": 4730, "total_column_articles": 48, "frontend_question_id": "568", "is_new_question": false @@ -62655,9 +63117,9 @@ "question__title": "Permutation in String", "question__title_slug": "permutation-in-string", "question__hide": false, - "total_acs": 290389, - "total_submitted": 644413, - "total_column_articles": 2451, + "total_acs": 291860, + "total_submitted": 647007, + "total_column_articles": 2461, "frontend_question_id": "567", "is_new_question": false }, @@ -62676,9 +63138,9 @@ "question__title": "Reshape the Matrix", "question__title_slug": "reshape-the-matrix", "question__hide": false, - "total_acs": 156637, - "total_submitted": 242681, - "total_column_articles": 1400, + "total_acs": 157090, + "total_submitted": 243343, + "total_column_articles": 1401, "frontend_question_id": "566", "is_new_question": false }, @@ -62697,9 +63159,9 @@ "question__title": "Array Nesting", "question__title_slug": "array-nesting", "question__hide": false, - "total_acs": 50763, - "total_submitted": 81553, - "total_column_articles": 467, + "total_acs": 50876, + "total_submitted": 81752, + "total_column_articles": 468, "frontend_question_id": "565", "is_new_question": false }, @@ -62718,9 +63180,9 @@ "question__title": "Find the Closest Palindrome", "question__title_slug": "find-the-closest-palindrome", "question__hide": false, - "total_acs": 25792, - "total_submitted": 84766, - "total_column_articles": 265, + "total_acs": 25841, + "total_submitted": 84949, + "total_column_articles": 266, "frontend_question_id": "564", "is_new_question": false }, @@ -62739,9 +63201,9 @@ "question__title": "Binary Tree Tilt", "question__title_slug": "binary-tree-tilt", "question__hide": false, - "total_acs": 82348, - "total_submitted": 123839, - "total_column_articles": 803, + "total_acs": 82638, + "total_submitted": 124220, + "total_column_articles": 807, "frontend_question_id": "563", "is_new_question": false }, @@ -62760,8 +63222,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": 6312, - "total_submitted": 12628, + "total_acs": 6321, + "total_submitted": 12649, "total_column_articles": 104, "frontend_question_id": "562", "is_new_question": false @@ -62781,9 +63243,9 @@ "question__title": "Array Partition", "question__title_slug": "array-partition", "question__hide": false, - "total_acs": 155171, - "total_submitted": 197856, - "total_column_articles": 1227, + "total_acs": 156007, + "total_submitted": 198848, + "total_column_articles": 1232, "frontend_question_id": "561", "is_new_question": false }, @@ -62802,9 +63264,9 @@ "question__title": "Subarray Sum Equals K", "question__title_slug": "subarray-sum-equals-k", "question__hide": false, - "total_acs": 462149, - "total_submitted": 1048378, - "total_column_articles": 2333, + "total_acs": 472411, + "total_submitted": 1070896, + "total_column_articles": 2375, "frontend_question_id": "560", "is_new_question": false }, @@ -62823,9 +63285,9 @@ "question__title": "Reverse Words in a String III", "question__title_slug": "reverse-words-in-a-string-iii", "question__hide": false, - "total_acs": 325020, - "total_submitted": 441182, - "total_column_articles": 2676, + "total_acs": 325830, + "total_submitted": 442302, + "total_column_articles": 2680, "frontend_question_id": "557", "is_new_question": false }, @@ -62844,9 +63306,9 @@ "question__title": "Next Greater Element III", "question__title_slug": "next-greater-element-iii", "question__hide": false, - "total_acs": 50525, - "total_submitted": 137116, - "total_column_articles": 591, + "total_acs": 50702, + "total_submitted": 137599, + "total_column_articles": 592, "frontend_question_id": "556", "is_new_question": false }, @@ -62865,8 +63327,8 @@ "question__title": "Split Concatenated Strings", "question__title_slug": "split-concatenated-strings", "question__hide": false, - "total_acs": 1859, - "total_submitted": 4963, + "total_acs": 1872, + "total_submitted": 4992, "total_column_articles": 34, "frontend_question_id": "555", "is_new_question": false @@ -62886,9 +63348,9 @@ "question__title": "Brick Wall", "question__title_slug": "brick-wall", "question__hide": false, - "total_acs": 68905, - "total_submitted": 132272, - "total_column_articles": 623, + "total_acs": 69181, + "total_submitted": 132687, + "total_column_articles": 626, "frontend_question_id": "554", "is_new_question": false }, @@ -62907,8 +63369,8 @@ "question__title": "Optimal Division", "question__title_slug": "optimal-division", "question__hide": false, - "total_acs": 34171, - "total_submitted": 52759, + "total_acs": 34281, + "total_submitted": 52928, "total_column_articles": 388, "frontend_question_id": "553", "is_new_question": false @@ -62928,9 +63390,9 @@ "question__title": "Student Attendance Record II", "question__title_slug": "student-attendance-record-ii", "question__hide": false, - "total_acs": 30224, - "total_submitted": 52051, - "total_column_articles": 361, + "total_acs": 30381, + "total_submitted": 52250, + "total_column_articles": 362, "frontend_question_id": "552", "is_new_question": false }, @@ -62949,9 +63411,9 @@ "question__title": "Student Attendance Record I", "question__title_slug": "student-attendance-record-i", "question__hide": false, - "total_acs": 87292, - "total_submitted": 152814, - "total_column_articles": 1041, + "total_acs": 87620, + "total_submitted": 153385, + "total_column_articles": 1042, "frontend_question_id": "551", "is_new_question": false }, @@ -62970,8 +63432,8 @@ "question__title": "Shortest Path to Get Food", "question__title_slug": "shortest-path-to-get-food", "question__hide": false, - "total_acs": 2008, - "total_submitted": 3788, + "total_acs": 2018, + "total_submitted": 3800, "total_column_articles": 45, "frontend_question_id": "1730", "is_new_question": false @@ -62991,8 +63453,8 @@ "question__title": "Binary Tree Longest Consecutive Sequence II", "question__title_slug": "binary-tree-longest-consecutive-sequence-ii", "question__hide": false, - "total_acs": 5770, - "total_submitted": 11571, + "total_acs": 5881, + "total_submitted": 11796, "total_column_articles": 100, "frontend_question_id": "549", "is_new_question": false @@ -63012,8 +63474,8 @@ "question__title": "Split Array with Equal Sum", "question__title_slug": "split-array-with-equal-sum", "question__hide": false, - "total_acs": 2580, - "total_submitted": 6556, + "total_acs": 2595, + "total_submitted": 6583, "total_column_articles": 56, "frontend_question_id": "548", "is_new_question": false @@ -63033,9 +63495,9 @@ "question__title": "Number of Provinces", "question__title_slug": "number-of-provinces", "question__hide": false, - "total_acs": 310135, - "total_submitted": 498754, - "total_column_articles": 2011, + "total_acs": 312162, + "total_submitted": 501944, + "total_column_articles": 2019, "frontend_question_id": "547", "is_new_question": false }, @@ -63054,8 +63516,8 @@ "question__title": "Remove Boxes", "question__title_slug": "remove-boxes", "question__hide": false, - "total_acs": 19703, - "total_submitted": 32535, + "total_acs": 19748, + "total_submitted": 32613, "total_column_articles": 151, "frontend_question_id": "546", "is_new_question": false @@ -63075,8 +63537,8 @@ "question__title": "Boundary of Binary Tree", "question__title_slug": "boundary-of-binary-tree", "question__hide": false, - "total_acs": 6544, - "total_submitted": 14171, + "total_acs": 6589, + "total_submitted": 14240, "total_column_articles": 118, "frontend_question_id": "545", "is_new_question": false @@ -63096,8 +63558,8 @@ "question__title": "Output Contest Matches", "question__title_slug": "output-contest-matches", "question__hide": false, - "total_acs": 3606, - "total_submitted": 4984, + "total_acs": 3608, + "total_submitted": 4986, "total_column_articles": 76, "frontend_question_id": "544", "is_new_question": false @@ -63117,9 +63579,9 @@ "question__title": "Diameter of Binary Tree", "question__title_slug": "diameter-of-binary-tree", "question__hide": false, - "total_acs": 425833, - "total_submitted": 706079, - "total_column_articles": 2580, + "total_acs": 432760, + "total_submitted": 716065, + "total_column_articles": 2594, "frontend_question_id": "543", "is_new_question": false }, @@ -63138,9 +63600,9 @@ "question__title": "01 Matrix", "question__title_slug": "01-matrix", "question__hide": false, - "total_acs": 143404, - "total_submitted": 306266, - "total_column_articles": 1146, + "total_acs": 143946, + "total_submitted": 307240, + "total_column_articles": 1148, "frontend_question_id": "542", "is_new_question": false }, @@ -63159,9 +63621,9 @@ "question__title": "Reverse String II", "question__title_slug": "reverse-string-ii", "question__hide": false, - "total_acs": 280271, - "total_submitted": 488086, - "total_column_articles": 1843, + "total_acs": 284289, + "total_submitted": 494786, + "total_column_articles": 1855, "frontend_question_id": "541", "is_new_question": false }, @@ -63180,9 +63642,9 @@ "question__title": "Single Element in a Sorted Array", "question__title_slug": "single-element-in-a-sorted-array", "question__hide": false, - "total_acs": 128478, - "total_submitted": 213152, - "total_column_articles": 1144, + "total_acs": 129031, + "total_submitted": 214017, + "total_column_articles": 1148, "frontend_question_id": "540", "is_new_question": false }, @@ -63201,8 +63663,8 @@ "question__title": "Minimum Time Difference", "question__title_slug": "minimum-time-difference", "question__hide": false, - "total_acs": 68523, - "total_submitted": 104727, + "total_acs": 68770, + "total_submitted": 105117, "total_column_articles": 700, "frontend_question_id": "539", "is_new_question": false @@ -63222,9 +63684,9 @@ "question__title": "Convert BST to Greater Tree", "question__title_slug": "convert-bst-to-greater-tree", "question__hide": false, - "total_acs": 279736, - "total_submitted": 361479, - "total_column_articles": 1703, + "total_acs": 281922, + "total_submitted": 364102, + "total_column_articles": 1710, "frontend_question_id": "538", "is_new_question": false }, @@ -63243,8 +63705,8 @@ "question__title": "Complex Number Multiplication", "question__title_slug": "complex-number-multiplication", "question__hide": false, - "total_acs": 46940, - "total_submitted": 63203, + "total_acs": 47056, + "total_submitted": 63363, "total_column_articles": 683, "frontend_question_id": "537", "is_new_question": false @@ -63264,8 +63726,8 @@ "question__title": "Construct Binary Tree from String", "question__title_slug": "construct-binary-tree-from-string", "question__hide": false, - "total_acs": 6195, - "total_submitted": 11119, + "total_acs": 6216, + "total_submitted": 11148, "total_column_articles": 102, "frontend_question_id": "536", "is_new_question": false @@ -63285,9 +63747,9 @@ "question__title": "Encode and Decode TinyURL", "question__title_slug": "encode-and-decode-tinyurl", "question__hide": false, - "total_acs": 47308, - "total_submitted": 54092, - "total_column_articles": 289, + "total_acs": 47448, + "total_submitted": 54255, + "total_column_articles": 290, "frontend_question_id": "535", "is_new_question": false }, @@ -63306,8 +63768,8 @@ "question__title": "Lonely Pixel II", "question__title_slug": "lonely-pixel-ii", "question__hide": false, - "total_acs": 2955, - "total_submitted": 5683, + "total_acs": 2957, + "total_submitted": 5687, "total_column_articles": 54, "frontend_question_id": "533", "is_new_question": false @@ -63327,8 +63789,8 @@ "question__title": "K-diff Pairs in an Array", "question__title_slug": "k-diff-pairs-in-an-array", "question__hide": false, - "total_acs": 66901, - "total_submitted": 144875, + "total_acs": 67113, + "total_submitted": 145249, "total_column_articles": 728, "frontend_question_id": "532", "is_new_question": false @@ -63348,8 +63810,8 @@ "question__title": "Lonely Pixel I", "question__title_slug": "lonely-pixel-i", "question__hide": false, - "total_acs": 8259, - "total_submitted": 12828, + "total_acs": 8377, + "total_submitted": 13044, "total_column_articles": 135, "frontend_question_id": "531", "is_new_question": false @@ -63369,9 +63831,9 @@ "question__title": "Minimum Absolute Difference in BST", "question__title_slug": "minimum-absolute-difference-in-bst", "question__hide": false, - "total_acs": 247897, - "total_submitted": 394968, - "total_column_articles": 1416, + "total_acs": 251865, + "total_submitted": 401189, + "total_column_articles": 1430, "frontend_question_id": "530", "is_new_question": false }, @@ -63390,8 +63852,8 @@ "question__title": "Minesweeper", "question__title_slug": "minesweeper", "question__hide": false, - "total_acs": 55910, - "total_submitted": 87604, + "total_acs": 56292, + "total_submitted": 88233, "total_column_articles": 626, "frontend_question_id": "529", "is_new_question": false @@ -63411,8 +63873,8 @@ "question__title": "Swapping Nodes in a Linked List", "question__title_slug": "swapping-nodes-in-a-linked-list", "question__hide": false, - "total_acs": 23018, - "total_submitted": 36276, + "total_acs": 23168, + "total_submitted": 36497, "total_column_articles": 333, "frontend_question_id": "1721", "is_new_question": false @@ -63432,8 +63894,8 @@ "question__title": "Word Abbreviation", "question__title_slug": "word-abbreviation", "question__hide": false, - "total_acs": 3026, - "total_submitted": 5048, + "total_acs": 3036, + "total_submitted": 5063, "total_column_articles": 43, "frontend_question_id": "527", "is_new_question": false @@ -63453,9 +63915,9 @@ "question__title": "Beautiful Arrangement", "question__title_slug": "beautiful-arrangement", "question__hide": false, - "total_acs": 53201, - "total_submitted": 73468, - "total_column_articles": 552, + "total_acs": 53767, + "total_submitted": 74204, + "total_column_articles": 554, "frontend_question_id": "526", "is_new_question": false }, @@ -63474,9 +63936,9 @@ "question__title": "Contiguous Array", "question__title_slug": "contiguous-array", "question__hide": false, - "total_acs": 77993, - "total_submitted": 142934, - "total_column_articles": 756, + "total_acs": 78620, + "total_submitted": 144046, + "total_column_articles": 759, "frontend_question_id": "525", "is_new_question": false }, @@ -63495,9 +63957,9 @@ "question__title": "Longest Word in Dictionary through Deleting", "question__title_slug": "longest-word-in-dictionary-through-deleting", "question__hide": false, - "total_acs": 109037, - "total_submitted": 216981, - "total_column_articles": 1023, + "total_acs": 109359, + "total_submitted": 217519, + "total_column_articles": 1024, "frontend_question_id": "524", "is_new_question": false }, @@ -63516,9 +63978,9 @@ "question__title": "Continuous Subarray Sum", "question__title_slug": "continuous-subarray-sum", "question__hide": false, - "total_acs": 107037, - "total_submitted": 371372, - "total_column_articles": 831, + "total_acs": 107687, + "total_submitted": 373285, + "total_column_articles": 840, "frontend_question_id": "523", "is_new_question": false }, @@ -63537,9 +63999,9 @@ "question__title": "Longest Uncommon Subsequence II", "question__title_slug": "longest-uncommon-subsequence-ii", "question__hide": false, - "total_acs": 34313, - "total_submitted": 70201, - "total_column_articles": 370, + "total_acs": 34422, + "total_submitted": 70382, + "total_column_articles": 371, "frontend_question_id": "522", "is_new_question": false }, @@ -63558,8 +64020,8 @@ "question__title": "Longest Uncommon Subsequence I", "question__title_slug": "longest-uncommon-subsequence-i", "question__hide": false, - "total_acs": 68627, - "total_submitted": 93169, + "total_acs": 68879, + "total_submitted": 93479, "total_column_articles": 592, "frontend_question_id": "521", "is_new_question": false @@ -63579,9 +64041,9 @@ "question__title": "Detect Capital", "question__title_slug": "detect-capital", "question__hide": false, - "total_acs": 98860, - "total_submitted": 175260, - "total_column_articles": 1444, + "total_acs": 99410, + "total_submitted": 176260, + "total_column_articles": 1448, "frontend_question_id": "520", "is_new_question": false }, @@ -63600,8 +64062,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": 458, - "total_submitted": 985, + "total_acs": 467, + "total_submitted": 998, "total_column_articles": 14, "frontend_question_id": "1983", "is_new_question": false @@ -63621,9 +64083,9 @@ "question__title": "Coin Change II", "question__title_slug": "coin-change-ii", "question__hide": false, - "total_acs": 328142, - "total_submitted": 459876, - "total_column_articles": 1534, + "total_acs": 331817, + "total_submitted": 464742, + "total_column_articles": 1542, "frontend_question_id": "518", "is_new_question": false }, @@ -63642,8 +64104,8 @@ "question__title": "Super Washing Machines", "question__title_slug": "super-washing-machines", "question__hide": false, - "total_acs": 25597, - "total_submitted": 49992, + "total_acs": 25642, + "total_submitted": 50070, "total_column_articles": 220, "frontend_question_id": "517", "is_new_question": false @@ -63663,9 +64125,9 @@ "question__title": "Longest Palindromic Subsequence", "question__title_slug": "longest-palindromic-subsequence", "question__hide": false, - "total_acs": 236962, - "total_submitted": 353195, - "total_column_articles": 1274, + "total_acs": 239864, + "total_submitted": 357394, + "total_column_articles": 1283, "frontend_question_id": "516", "is_new_question": false }, @@ -63684,9 +64146,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": 152749, - "total_submitted": 229913, - "total_column_articles": 1224, + "total_acs": 154374, + "total_submitted": 232385, + "total_column_articles": 1226, "frontend_question_id": "515", "is_new_question": false }, @@ -63705,9 +64167,9 @@ "question__title": "Freedom Trail", "question__title_slug": "freedom-trail", "question__hide": false, - "total_acs": 40964, - "total_submitted": 75451, - "total_column_articles": 445, + "total_acs": 41116, + "total_submitted": 75746, + "total_column_articles": 444, "frontend_question_id": "514", "is_new_question": false }, @@ -63726,9 +64188,9 @@ "question__title": "Find Bottom Left Tree Value", "question__title_slug": "find-bottom-left-tree-value", "question__hide": false, - "total_acs": 248107, - "total_submitted": 339013, - "total_column_articles": 1748, + "total_acs": 251545, + "total_submitted": 343743, + "total_column_articles": 1759, "frontend_question_id": "513", "is_new_question": false }, @@ -63747,8 +64209,8 @@ "question__title": "Maximum Alternating Subarray Sum", "question__title_slug": "maximum-alternating-subarray-sum", "question__hide": false, - "total_acs": 585, - "total_submitted": 1436, + "total_acs": 591, + "total_submitted": 1445, "total_column_articles": 20, "frontend_question_id": "2036", "is_new_question": false @@ -63768,8 +64230,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": 4500, - "total_submitted": 12824, + "total_acs": 4558, + "total_submitted": 13019, "total_column_articles": 68, "frontend_question_id": "1059", "is_new_question": false @@ -63789,8 +64251,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": 922, - "total_submitted": 1737, + "total_acs": 930, + "total_submitted": 1746, "total_column_articles": 25, "frontend_question_id": "2031", "is_new_question": false @@ -63810,8 +64272,8 @@ "question__title": "Inorder Successor in BST II", "question__title_slug": "inorder-successor-in-bst-ii", "question__hide": false, - "total_acs": 6259, - "total_submitted": 10269, + "total_acs": 6274, + "total_submitted": 10307, "total_column_articles": 75, "frontend_question_id": "510", "is_new_question": false @@ -63831,9 +64293,9 @@ "question__title": "Most Frequent Subtree Sum", "question__title_slug": "most-frequent-subtree-sum", "question__hide": false, - "total_acs": 47721, - "total_submitted": 63085, - "total_column_articles": 591, + "total_acs": 47874, + "total_submitted": 63301, + "total_column_articles": 592, "frontend_question_id": "508", "is_new_question": false }, @@ -63852,8 +64314,8 @@ "question__title": "Perfect Number", "question__title_slug": "perfect-number", "question__hide": false, - "total_acs": 86691, - "total_submitted": 176233, + "total_acs": 87163, + "total_submitted": 177124, "total_column_articles": 610, "frontend_question_id": "507", "is_new_question": false @@ -63873,9 +64335,9 @@ "question__title": "Relative Ranks", "question__title_slug": "relative-ranks", "question__hide": false, - "total_acs": 89254, - "total_submitted": 136098, - "total_column_articles": 1060, + "total_acs": 89809, + "total_submitted": 136819, + "total_column_articles": 1063, "frontend_question_id": "506", "is_new_question": false }, @@ -63894,8 +64356,8 @@ "question__title": "The Maze II", "question__title_slug": "the-maze-ii", "question__hide": false, - "total_acs": 11347, - "total_submitted": 21884, + "total_acs": 11432, + "total_submitted": 22015, "total_column_articles": 133, "frontend_question_id": "505", "is_new_question": false @@ -63915,9 +64377,9 @@ "question__title": "Base 7", "question__title_slug": "base-7", "question__hide": false, - "total_acs": 96066, - "total_submitted": 185270, - "total_column_articles": 884, + "total_acs": 96512, + "total_submitted": 186115, + "total_column_articles": 888, "frontend_question_id": "504", "is_new_question": false }, @@ -63936,9 +64398,9 @@ "question__title": "Next Greater Element II", "question__title_slug": "next-greater-element-ii", "question__hide": false, - "total_acs": 242220, - "total_submitted": 359151, - "total_column_articles": 1787, + "total_acs": 244472, + "total_submitted": 362139, + "total_column_articles": 1796, "frontend_question_id": "503", "is_new_question": false }, @@ -63957,9 +64419,9 @@ "question__title": "IPO", "question__title_slug": "ipo", "question__hide": false, - "total_acs": 44682, - "total_submitted": 98657, - "total_column_articles": 479, + "total_acs": 45442, + "total_submitted": 100245, + "total_column_articles": 484, "frontend_question_id": "502", "is_new_question": false }, @@ -63978,9 +64440,9 @@ "question__title": "Find Mode in Binary Search Tree", "question__title_slug": "find-mode-in-binary-search-tree", "question__hide": false, - "total_acs": 208213, - "total_submitted": 377305, - "total_column_articles": 1269, + "total_acs": 210737, + "total_submitted": 381359, + "total_column_articles": 1280, "frontend_question_id": "501", "is_new_question": false }, @@ -63999,9 +64461,9 @@ "question__title": "Keyboard Row", "question__title_slug": "keyboard-row", "question__hide": false, - "total_acs": 78568, - "total_submitted": 106352, - "total_column_articles": 1115, + "total_acs": 78903, + "total_submitted": 106769, + "total_column_articles": 1116, "frontend_question_id": "500", "is_new_question": false }, @@ -64020,8 +64482,8 @@ "question__title": "The Maze III", "question__title_slug": "the-maze-iii", "question__hide": false, - "total_acs": 5537, - "total_submitted": 12363, + "total_acs": 5577, + "total_submitted": 12443, "total_column_articles": 99, "frontend_question_id": "499", "is_new_question": false @@ -64041,9 +64503,9 @@ "question__title": "Diagonal Traverse", "question__title_slug": "diagonal-traverse", "question__hide": false, - "total_acs": 125822, - "total_submitted": 225060, - "total_column_articles": 1218, + "total_acs": 126627, + "total_submitted": 226405, + "total_column_articles": 1226, "frontend_question_id": "498", "is_new_question": false }, @@ -64062,9 +64524,9 @@ "question__title": "Next Greater Element I", "question__title_slug": "next-greater-element-i", "question__hide": false, - "total_acs": 319197, - "total_submitted": 443651, - "total_column_articles": 2652, + "total_acs": 322084, + "total_submitted": 447432, + "total_column_articles": 2668, "frontend_question_id": "496", "is_new_question": false }, @@ -64083,9 +64545,9 @@ "question__title": "Teemo Attacking", "question__title_slug": "teemo-attacking", "question__hide": false, - "total_acs": 109794, - "total_submitted": 184933, - "total_column_articles": 1410, + "total_acs": 110480, + "total_submitted": 186082, + "total_column_articles": 1414, "frontend_question_id": "495", "is_new_question": false }, @@ -64104,9 +64566,9 @@ "question__title": "Target Sum", "question__title_slug": "target-sum", "question__hide": false, - "total_acs": 440983, - "total_submitted": 913331, - "total_column_articles": 2252, + "total_acs": 445797, + "total_submitted": 923261, + "total_column_articles": 2264, "frontend_question_id": "494", "is_new_question": false }, @@ -64125,9 +64587,9 @@ "question__title": "Reverse Pairs", "question__title_slug": "reverse-pairs", "question__hide": false, - "total_acs": 47001, - "total_submitted": 126842, - "total_column_articles": 446, + "total_acs": 47470, + "total_submitted": 127875, + "total_column_articles": 451, "frontend_question_id": "493", "is_new_question": false }, @@ -64146,9 +64608,9 @@ "question__title": "Construct the Rectangle", "question__title_slug": "construct-the-rectangle", "question__hide": false, - "total_acs": 62957, - "total_submitted": 101714, - "total_column_articles": 567, + "total_acs": 63163, + "total_submitted": 101992, + "total_column_articles": 568, "frontend_question_id": "492", "is_new_question": false }, @@ -64167,9 +64629,9 @@ "question__title": "Non-decreasing Subsequences", "question__title_slug": "non-decreasing-subsequences", "question__hide": false, - "total_acs": 182491, - "total_submitted": 352075, - "total_column_articles": 1059, + "total_acs": 184814, + "total_submitted": 356490, + "total_column_articles": 1071, "frontend_question_id": "491", "is_new_question": false }, @@ -64188,8 +64650,8 @@ "question__title": "The Maze", "question__title_slug": "the-maze", "question__hide": false, - "total_acs": 13819, - "total_submitted": 26811, + "total_acs": 13966, + "total_submitted": 27028, "total_column_articles": 155, "frontend_question_id": "490", "is_new_question": false @@ -64209,9 +64671,9 @@ "question__title": "Kth Smallest Instructions", "question__title_slug": "kth-smallest-instructions", "question__hide": false, - "total_acs": 3825, - "total_submitted": 7821, - "total_column_articles": 82, + "total_acs": 3852, + "total_submitted": 7863, + "total_column_articles": 84, "frontend_question_id": "1643", "is_new_question": false }, @@ -64230,9 +64692,9 @@ "question__title": "Zuma Game", "question__title_slug": "zuma-game", "question__hide": false, - "total_acs": 21114, - "total_submitted": 44964, - "total_column_articles": 188, + "total_acs": 21167, + "total_submitted": 45262, + "total_column_articles": 189, "frontend_question_id": "488", "is_new_question": false }, @@ -64251,9 +64713,9 @@ "question__title": "Max Consecutive Ones II", "question__title_slug": "max-consecutive-ones-ii", "question__hide": false, - "total_acs": 17227, - "total_submitted": 30205, - "total_column_articles": 262, + "total_acs": 17476, + "total_submitted": 30654, + "total_column_articles": 264, "frontend_question_id": "487", "is_new_question": false }, @@ -64272,9 +64734,9 @@ "question__title": "Predict the Winner", "question__title_slug": "predict-the-winner", "question__hide": false, - "total_acs": 76934, - "total_submitted": 129507, - "total_column_articles": 610, + "total_acs": 77619, + "total_submitted": 130583, + "total_column_articles": 611, "frontend_question_id": "486", "is_new_question": false }, @@ -64293,9 +64755,9 @@ "question__title": "Max Consecutive Ones", "question__title_slug": "max-consecutive-ones", "question__hide": false, - "total_acs": 241177, - "total_submitted": 393614, - "total_column_articles": 1826, + "total_acs": 242846, + "total_submitted": 396112, + "total_column_articles": 1839, "frontend_question_id": "485", "is_new_question": false }, @@ -64314,8 +64776,8 @@ "question__title": "Find Permutation", "question__title_slug": "find-permutation", "question__hide": false, - "total_acs": 4113, - "total_submitted": 6846, + "total_acs": 4273, + "total_submitted": 7091, "total_column_articles": 68, "frontend_question_id": "484", "is_new_question": false @@ -64335,9 +64797,9 @@ "question__title": "Smallest Good Base", "question__title_slug": "smallest-good-base", "question__hide": false, - "total_acs": 19977, - "total_submitted": 34079, - "total_column_articles": 153, + "total_acs": 20013, + "total_submitted": 34128, + "total_column_articles": 154, "frontend_question_id": "483", "is_new_question": false }, @@ -64356,9 +64818,9 @@ "question__title": "License Key Formatting", "question__title_slug": "license-key-formatting", "question__hide": false, - "total_acs": 63096, - "total_submitted": 135051, - "total_column_articles": 639, + "total_acs": 63375, + "total_submitted": 135564, + "total_column_articles": 640, "frontend_question_id": "482", "is_new_question": false }, @@ -64377,8 +64839,8 @@ "question__title": "Magical String", "question__title_slug": "magical-string", "question__hide": false, - "total_acs": 37981, - "total_submitted": 59483, + "total_acs": 38116, + "total_submitted": 59701, "total_column_articles": 489, "frontend_question_id": "481", "is_new_question": false @@ -64398,9 +64860,9 @@ "question__title": "Sliding Window Median", "question__title_slug": "sliding-window-median", "question__hide": false, - "total_acs": 43562, - "total_submitted": 103270, - "total_column_articles": 553, + "total_acs": 43826, + "total_submitted": 104175, + "total_column_articles": 555, "frontend_question_id": "480", "is_new_question": false }, @@ -64419,9 +64881,9 @@ "question__title": "Largest Palindrome Product", "question__title_slug": "largest-palindrome-product", "question__hide": false, - "total_acs": 24241, - "total_submitted": 39058, - "total_column_articles": 181, + "total_acs": 24309, + "total_submitted": 39195, + "total_column_articles": 183, "frontend_question_id": "479", "is_new_question": false }, @@ -64440,8 +64902,8 @@ "question__title": "Total Hamming Distance", "question__title_slug": "total-hamming-distance", "question__hide": false, - "total_acs": 49049, - "total_submitted": 80864, + "total_acs": 49220, + "total_submitted": 81116, "total_column_articles": 400, "frontend_question_id": "477", "is_new_question": false @@ -64461,9 +64923,9 @@ "question__title": "Number Complement", "question__title_slug": "number-complement", "question__hide": false, - "total_acs": 89485, - "total_submitted": 128895, - "total_column_articles": 1164, + "total_acs": 89910, + "total_submitted": 129548, + "total_column_articles": 1168, "frontend_question_id": "476", "is_new_question": false }, @@ -64482,9 +64944,9 @@ "question__title": "Heaters", "question__title_slug": "heaters", "question__hide": false, - "total_acs": 75609, - "total_submitted": 182756, - "total_column_articles": 740, + "total_acs": 75932, + "total_submitted": 183490, + "total_column_articles": 743, "frontend_question_id": "475", "is_new_question": false }, @@ -64503,9 +64965,9 @@ "question__title": "Ones and Zeroes", "question__title_slug": "ones-and-zeroes", "question__hide": false, - "total_acs": 208343, - "total_submitted": 315219, - "total_column_articles": 1237, + "total_acs": 211055, + "total_submitted": 318897, + "total_column_articles": 1244, "frontend_question_id": "474", "is_new_question": false }, @@ -64524,8 +64986,8 @@ "question__title": "Matchsticks to Square", "question__title_slug": "matchsticks-to-square", "question__hide": false, - "total_acs": 77972, - "total_submitted": 166821, + "total_acs": 78399, + "total_submitted": 167721, "total_column_articles": 548, "frontend_question_id": "473", "is_new_question": false @@ -64545,8 +65007,8 @@ "question__title": "Concatenated Words", "question__title_slug": "concatenated-words", "question__hide": false, - "total_acs": 28976, - "total_submitted": 55757, + "total_acs": 29088, + "total_submitted": 55961, "total_column_articles": 281, "frontend_question_id": "472", "is_new_question": false @@ -64566,8 +65028,8 @@ "question__title": "Encode String with Shortest Length", "question__title_slug": "encode-string-with-shortest-length", "question__hide": false, - "total_acs": 2792, - "total_submitted": 4742, + "total_acs": 2804, + "total_submitted": 4757, "total_column_articles": 46, "frontend_question_id": "471", "is_new_question": false @@ -64587,8 +65049,8 @@ "question__title": "Convex Polygon", "question__title_slug": "convex-polygon", "question__hide": false, - "total_acs": 2774, - "total_submitted": 6456, + "total_acs": 2783, + "total_submitted": 6485, "total_column_articles": 37, "frontend_question_id": "469", "is_new_question": false @@ -64608,9 +65070,9 @@ "question__title": "Validate IP Address", "question__title_slug": "validate-ip-address", "question__hide": false, - "total_acs": 69156, - "total_submitted": 245219, - "total_column_articles": 753, + "total_acs": 69468, + "total_submitted": 246333, + "total_column_articles": 755, "frontend_question_id": "468", "is_new_question": false }, @@ -64629,8 +65091,8 @@ "question__title": "Unique Substrings in Wraparound String", "question__title_slug": "unique-substrings-in-wraparound-string", "question__hide": false, - "total_acs": 41975, - "total_submitted": 81061, + "total_acs": 42241, + "total_submitted": 81550, "total_column_articles": 395, "frontend_question_id": "467", "is_new_question": false @@ -64650,8 +65112,8 @@ "question__title": "Count The Repetitions", "question__title_slug": "count-the-repetitions", "question__hide": false, - "total_acs": 25149, - "total_submitted": 60404, + "total_acs": 25290, + "total_submitted": 60848, "total_column_articles": 267, "frontend_question_id": "466", "is_new_question": false @@ -64671,8 +65133,8 @@ "question__title": "Optimal Account Balancing", "question__title_slug": "optimal-account-balancing", "question__hide": false, - "total_acs": 3188, - "total_submitted": 5781, + "total_acs": 3221, + "total_submitted": 5832, "total_column_articles": 47, "frontend_question_id": "465", "is_new_question": false @@ -64692,8 +65154,8 @@ "question__title": "Can I Win", "question__title_slug": "can-i-win", "question__hide": false, - "total_acs": 41851, - "total_submitted": 102823, + "total_acs": 42075, + "total_submitted": 103384, "total_column_articles": 304, "frontend_question_id": "464", "is_new_question": false @@ -64713,9 +65175,9 @@ "question__title": "Island Perimeter", "question__title_slug": "island-perimeter", "question__hide": false, - "total_acs": 159576, - "total_submitted": 227213, - "total_column_articles": 1621, + "total_acs": 161213, + "total_submitted": 229352, + "total_column_articles": 1629, "frontend_question_id": "463", "is_new_question": false }, @@ -64734,9 +65196,9 @@ "question__title": "Minimum Moves to Equal Array Elements II", "question__title_slug": "minimum-moves-to-equal-array-elements-ii", "question__hide": false, - "total_acs": 56531, - "total_submitted": 90363, - "total_column_articles": 547, + "total_acs": 56688, + "total_submitted": 90668, + "total_column_articles": 548, "frontend_question_id": "462", "is_new_question": false }, @@ -64755,9 +65217,9 @@ "question__title": "Hamming Distance", "question__title_slug": "hamming-distance", "question__hide": false, - "total_acs": 305304, - "total_submitted": 372908, - "total_column_articles": 2186, + "total_acs": 306562, + "total_submitted": 374367, + "total_column_articles": 2190, "frontend_question_id": "461", "is_new_question": false }, @@ -64776,9 +65238,9 @@ "question__title": "LFU Cache", "question__title_slug": "lfu-cache", "question__hide": false, - "total_acs": 85988, - "total_submitted": 181672, - "total_column_articles": 769, + "total_acs": 86526, + "total_submitted": 182805, + "total_column_articles": 771, "frontend_question_id": "460", "is_new_question": false }, @@ -64797,9 +65259,9 @@ "question__title": "Repeated Substring Pattern", "question__title_slug": "repeated-substring-pattern", "question__hide": false, - "total_acs": 260401, - "total_submitted": 506029, - "total_column_articles": 1615, + "total_acs": 263655, + "total_submitted": 511691, + "total_column_articles": 1623, "frontend_question_id": "459", "is_new_question": false }, @@ -64818,8 +65280,8 @@ "question__title": "Poor Pigs", "question__title_slug": "poor-pigs", "question__hide": false, - "total_acs": 28578, - "total_submitted": 43097, + "total_acs": 28624, + "total_submitted": 43204, "total_column_articles": 256, "frontend_question_id": "458", "is_new_question": false @@ -64839,8 +65301,8 @@ "question__title": "Circular Array Loop", "question__title_slug": "circular-array-loop", "question__hide": false, - "total_acs": 38008, - "total_submitted": 87434, + "total_acs": 38130, + "total_submitted": 87656, "total_column_articles": 390, "frontend_question_id": "457", "is_new_question": false @@ -64860,9 +65322,9 @@ "question__title": "132 Pattern", "question__title_slug": "132-pattern", "question__hide": false, - "total_acs": 81299, - "total_submitted": 222941, - "total_column_articles": 638, + "total_acs": 81534, + "total_submitted": 223597, + "total_column_articles": 639, "frontend_question_id": "456", "is_new_question": false }, @@ -64881,9 +65343,9 @@ "question__title": "Assign Cookies", "question__title_slug": "assign-cookies", "question__hide": false, - "total_acs": 407523, - "total_submitted": 726119, - "total_column_articles": 2662, + "total_acs": 412076, + "total_submitted": 734135, + "total_column_articles": 2678, "frontend_question_id": "455", "is_new_question": false }, @@ -64902,9 +65364,9 @@ "question__title": "4Sum II", "question__title_slug": "4sum-ii", "question__hide": false, - "total_acs": 274415, - "total_submitted": 425591, - "total_column_articles": 1487, + "total_acs": 278038, + "total_submitted": 430883, + "total_column_articles": 1497, "frontend_question_id": "454", "is_new_question": false }, @@ -64923,9 +65385,9 @@ "question__title": "Minimum Moves to Equal Array Elements", "question__title_slug": "minimum-moves-to-equal-array-elements", "question__hide": false, - "total_acs": 83997, - "total_submitted": 136807, - "total_column_articles": 927, + "total_acs": 84491, + "total_submitted": 137636, + "total_column_articles": 934, "frontend_question_id": "453", "is_new_question": false }, @@ -64944,9 +65406,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": 277000, - "total_submitted": 538084, - "total_column_articles": 1850, + "total_acs": 281035, + "total_submitted": 545216, + "total_column_articles": 1865, "frontend_question_id": "452", "is_new_question": false }, @@ -64965,9 +65427,9 @@ "question__title": "Sort Characters By Frequency", "question__title_slug": "sort-characters-by-frequency", "question__hide": false, - "total_acs": 138867, - "total_submitted": 192448, - "total_column_articles": 1423, + "total_acs": 139663, + "total_submitted": 193484, + "total_column_articles": 1428, "frontend_question_id": "451", "is_new_question": false }, @@ -64986,9 +65448,9 @@ "question__title": "Delete Node in a BST", "question__title_slug": "delete-node-in-a-bst", "question__hide": false, - "total_acs": 264067, - "total_submitted": 504965, - "total_column_articles": 2248, + "total_acs": 266915, + "total_submitted": 510156, + "total_column_articles": 2260, "frontend_question_id": "450", "is_new_question": false }, @@ -65007,8 +65469,8 @@ "question__title": "Serialize and Deserialize BST", "question__title_slug": "serialize-and-deserialize-bst", "question__hide": false, - "total_acs": 67083, - "total_submitted": 107763, + "total_acs": 67201, + "total_submitted": 107943, "total_column_articles": 543, "frontend_question_id": "449", "is_new_question": false @@ -65028,9 +65490,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": 316349, - "total_submitted": 480610, - "total_column_articles": 2111, + "total_acs": 317966, + "total_submitted": 482844, + "total_column_articles": 2118, "frontend_question_id": "448", "is_new_question": false }, @@ -65049,8 +65511,8 @@ "question__title": "Number of Boomerangs", "question__title_slug": "number-of-boomerangs", "question__hide": false, - "total_acs": 76733, - "total_submitted": 112496, + "total_acs": 77111, + "total_submitted": 113016, "total_column_articles": 566, "frontend_question_id": "447", "is_new_question": false @@ -65070,9 +65532,9 @@ "question__title": "Arithmetic Slices II - Subsequence", "question__title_slug": "arithmetic-slices-ii-subsequence", "question__hide": false, - "total_acs": 26421, - "total_submitted": 48937, - "total_column_articles": 228, + "total_acs": 26539, + "total_submitted": 49210, + "total_column_articles": 229, "frontend_question_id": "446", "is_new_question": false }, @@ -65091,9 +65553,9 @@ "question__title": "Add Two Numbers II", "question__title_slug": "add-two-numbers-ii", "question__hide": false, - "total_acs": 155571, - "total_submitted": 255019, - "total_column_articles": 1567, + "total_acs": 156292, + "total_submitted": 256087, + "total_column_articles": 1572, "frontend_question_id": "445", "is_new_question": false }, @@ -65112,8 +65574,8 @@ "question__title": "Sequence Reconstruction", "question__title_slug": "sequence-reconstruction", "question__hide": false, - "total_acs": 6384, - "total_submitted": 19599, + "total_acs": 6412, + "total_submitted": 19666, "total_column_articles": 89, "frontend_question_id": "444", "is_new_question": false @@ -65133,9 +65595,9 @@ "question__title": "String Compression", "question__title_slug": "string-compression", "question__hide": false, - "total_acs": 102309, - "total_submitted": 209932, - "total_column_articles": 1040, + "total_acs": 103152, + "total_submitted": 211405, + "total_column_articles": 1045, "frontend_question_id": "443", "is_new_question": false }, @@ -65154,9 +65616,9 @@ "question__title": "Find All Duplicates in an Array", "question__title_slug": "find-all-duplicates-in-an-array", "question__hide": false, - "total_acs": 124976, - "total_submitted": 166292, - "total_column_articles": 1102, + "total_acs": 125925, + "total_submitted": 167508, + "total_column_articles": 1106, "frontend_question_id": "442", "is_new_question": false }, @@ -65175,9 +65637,9 @@ "question__title": "Arranging Coins", "question__title_slug": "arranging-coins", "question__hide": false, - "total_acs": 134135, - "total_submitted": 297782, - "total_column_articles": 1200, + "total_acs": 134671, + "total_submitted": 299026, + "total_column_articles": 1201, "frontend_question_id": "441", "is_new_question": false }, @@ -65196,8 +65658,8 @@ "question__title": "K-th Smallest in Lexicographical Order", "question__title_slug": "k-th-smallest-in-lexicographical-order", "question__hide": false, - "total_acs": 52547, - "total_submitted": 123997, + "total_acs": 52682, + "total_submitted": 124308, "total_column_articles": 313, "frontend_question_id": "440", "is_new_question": false @@ -65217,8 +65679,8 @@ "question__title": "Ternary Expression Parser", "question__title_slug": "ternary-expression-parser", "question__hide": false, - "total_acs": 5768, - "total_submitted": 9231, + "total_acs": 5875, + "total_submitted": 9372, "total_column_articles": 116, "frontend_question_id": "439", "is_new_question": false @@ -65238,9 +65700,9 @@ "question__title": "Find All Anagrams in a String", "question__title_slug": "find-all-anagrams-in-a-string", "question__hide": false, - "total_acs": 433518, - "total_submitted": 811736, - "total_column_articles": 2790, + "total_acs": 443103, + "total_submitted": 829746, + "total_column_articles": 2834, "frontend_question_id": "438", "is_new_question": false }, @@ -65259,9 +65721,9 @@ "question__title": "Path Sum III", "question__title_slug": "path-sum-iii", "question__hide": false, - "total_acs": 302238, - "total_submitted": 632704, - "total_column_articles": 1830, + "total_acs": 307050, + "total_submitted": 643745, + "total_column_articles": 1846, "frontend_question_id": "437", "is_new_question": false }, @@ -65280,9 +65742,9 @@ "question__title": "Find Right Interval", "question__title_slug": "find-right-interval", "question__hide": false, - "total_acs": 49891, - "total_submitted": 87460, - "total_column_articles": 600, + "total_acs": 50267, + "total_submitted": 88060, + "total_column_articles": 602, "frontend_question_id": "436", "is_new_question": false }, @@ -65301,9 +65763,9 @@ "question__title": "Non-overlapping Intervals", "question__title_slug": "non-overlapping-intervals", "question__hide": false, - "total_acs": 274805, - "total_submitted": 531531, - "total_column_articles": 1857, + "total_acs": 277420, + "total_submitted": 535955, + "total_column_articles": 1869, "frontend_question_id": "435", "is_new_question": false }, @@ -65322,9 +65784,9 @@ "question__title": "Number of Segments in a String", "question__title_slug": "number-of-segments-in-a-string", "question__hide": false, - "total_acs": 102957, - "total_submitted": 269639, - "total_column_articles": 1243, + "total_acs": 103529, + "total_submitted": 271440, + "total_column_articles": 1244, "frontend_question_id": "434", "is_new_question": false }, @@ -65343,9 +65805,9 @@ "question__title": "Minimum Genetic Mutation", "question__title_slug": "minimum-genetic-mutation", "question__hide": false, - "total_acs": 66253, - "total_submitted": 121828, - "total_column_articles": 843, + "total_acs": 67302, + "total_submitted": 123811, + "total_column_articles": 851, "frontend_question_id": "433", "is_new_question": false }, @@ -65364,8 +65826,8 @@ "question__title": "All O`one Data Structure", "question__title_slug": "all-oone-data-structure", "question__hide": false, - "total_acs": 30380, - "total_submitted": 65443, + "total_acs": 30492, + "total_submitted": 65680, "total_column_articles": 322, "frontend_question_id": "432", "is_new_question": false @@ -65385,8 +65847,8 @@ "question__title": "Word Squares", "question__title_slug": "word-squares", "question__hide": false, - "total_acs": 2700, - "total_submitted": 4315, + "total_acs": 2710, + "total_submitted": 4325, "total_column_articles": 51, "frontend_question_id": "425", "is_new_question": false @@ -65406,9 +65868,9 @@ "question__title": "Longest Repeating Character Replacement", "question__title_slug": "longest-repeating-character-replacement", "question__hide": false, - "total_acs": 98354, - "total_submitted": 178977, - "total_column_articles": 793, + "total_acs": 98924, + "total_submitted": 179816, + "total_column_articles": 794, "frontend_question_id": "424", "is_new_question": false }, @@ -65427,9 +65889,9 @@ "question__title": "Reconstruct Original Digits from English", "question__title_slug": "reconstruct-original-digits-from-english", "question__hide": false, - "total_acs": 42088, - "total_submitted": 69416, - "total_column_articles": 470, + "total_acs": 42205, + "total_submitted": 69598, + "total_column_articles": 471, "frontend_question_id": "423", "is_new_question": false }, @@ -65448,8 +65910,8 @@ "question__title": "Valid Word Square", "question__title_slug": "valid-word-square", "question__hide": false, - "total_acs": 6288, - "total_submitted": 14094, + "total_acs": 6427, + "total_submitted": 14401, "total_column_articles": 121, "frontend_question_id": "422", "is_new_question": false @@ -65469,9 +65931,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": 63896, - "total_submitted": 106965, - "total_column_articles": 543, + "total_acs": 64145, + "total_submitted": 107407, + "total_column_articles": 542, "frontend_question_id": "421", "is_new_question": false }, @@ -65490,9 +65952,9 @@ "question__title": "Strong Password Checker", "question__title_slug": "strong-password-checker", "question__hide": false, - "total_acs": 19025, - "total_submitted": 49297, - "total_column_articles": 169, + "total_acs": 19070, + "total_submitted": 49455, + "total_column_articles": 171, "frontend_question_id": "420", "is_new_question": false }, @@ -65511,9 +65973,9 @@ "question__title": "Battleships in a Board", "question__title_slug": "battleships-in-a-board", "question__hide": false, - "total_acs": 49261, - "total_submitted": 63350, - "total_column_articles": 597, + "total_acs": 49518, + "total_submitted": 63680, + "total_column_articles": 601, "frontend_question_id": "419", "is_new_question": false }, @@ -65532,9 +65994,9 @@ "question__title": "Sentence Screen Fitting", "question__title_slug": "sentence-screen-fitting", "question__hide": false, - "total_acs": 4334, - "total_submitted": 10963, - "total_column_articles": 65, + "total_acs": 4356, + "total_submitted": 11011, + "total_column_articles": 66, "frontend_question_id": "418", "is_new_question": false }, @@ -65553,9 +66015,9 @@ "question__title": "Pacific Atlantic Water Flow", "question__title_slug": "pacific-atlantic-water-flow", "question__hide": false, - "total_acs": 100627, - "total_submitted": 179324, - "total_column_articles": 946, + "total_acs": 101755, + "total_submitted": 181170, + "total_column_articles": 953, "frontend_question_id": "417", "is_new_question": false }, @@ -65574,9 +66036,9 @@ "question__title": "Partition Equal Subset Sum", "question__title_slug": "partition-equal-subset-sum", "question__hide": false, - "total_acs": 550129, - "total_submitted": 1049425, - "total_column_articles": 2443, + "total_acs": 558460, + "total_submitted": 1064476, + "total_column_articles": 2461, "frontend_question_id": "416", "is_new_question": false }, @@ -65595,9 +66057,9 @@ "question__title": "Add Strings", "question__title_slug": "add-strings", "question__hide": false, - "total_acs": 329953, - "total_submitted": 605263, - "total_column_articles": 2026, + "total_acs": 331949, + "total_submitted": 608967, + "total_column_articles": 2034, "frontend_question_id": "415", "is_new_question": false }, @@ -65616,9 +66078,9 @@ "question__title": "Third Maximum Number", "question__title_slug": "third-maximum-number", "question__hide": false, - "total_acs": 166399, - "total_submitted": 413266, - "total_column_articles": 1879, + "total_acs": 167578, + "total_submitted": 415625, + "total_column_articles": 1885, "frontend_question_id": "414", "is_new_question": false }, @@ -65637,9 +66099,9 @@ "question__title": "Arithmetic Slices", "question__title_slug": "arithmetic-slices", "question__hide": false, - "total_acs": 128025, - "total_submitted": 184280, - "total_column_articles": 1532, + "total_acs": 128436, + "total_submitted": 184903, + "total_column_articles": 1536, "frontend_question_id": "413", "is_new_question": false }, @@ -65658,9 +66120,9 @@ "question__title": "Fizz Buzz", "question__title_slug": "fizz-buzz", "question__hide": false, - "total_acs": 217566, - "total_submitted": 313126, - "total_column_articles": 1388, + "total_acs": 218323, + "total_submitted": 314053, + "total_column_articles": 1393, "frontend_question_id": "412", "is_new_question": false }, @@ -65679,9 +66141,9 @@ "question__title": "Minimum Unique Word Abbreviation", "question__title_slug": "minimum-unique-word-abbreviation", "question__hide": false, - "total_acs": 1724, - "total_submitted": 3473, - "total_column_articles": 37, + "total_acs": 1734, + "total_submitted": 3492, + "total_column_articles": 38, "frontend_question_id": "411", "is_new_question": false }, @@ -65700,9 +66162,9 @@ "question__title": "Split Array Largest Sum", "question__title_slug": "split-array-largest-sum", "question__hide": false, - "total_acs": 89600, - "total_submitted": 148242, - "total_column_articles": 682, + "total_acs": 90308, + "total_submitted": 149361, + "total_column_articles": 689, "frontend_question_id": "410", "is_new_question": false }, @@ -65721,9 +66183,9 @@ "question__title": "Longest Palindrome", "question__title_slug": "longest-palindrome", "question__hide": false, - "total_acs": 200275, - "total_submitted": 359858, - "total_column_articles": 2248, + "total_acs": 201722, + "total_submitted": 362441, + "total_column_articles": 2260, "frontend_question_id": "409", "is_new_question": false }, @@ -65742,9 +66204,9 @@ "question__title": "Valid Word Abbreviation", "question__title_slug": "valid-word-abbreviation", "question__hide": false, - "total_acs": 7635, - "total_submitted": 21092, - "total_column_articles": 131, + "total_acs": 7788, + "total_submitted": 21424, + "total_column_articles": 132, "frontend_question_id": "408", "is_new_question": false }, @@ -65763,9 +66225,9 @@ "question__title": "Trapping Rain Water II", "question__title_slug": "trapping-rain-water-ii", "question__hide": false, - "total_acs": 38884, - "total_submitted": 68254, - "total_column_articles": 328, + "total_acs": 39214, + "total_submitted": 68812, + "total_column_articles": 329, "frontend_question_id": "407", "is_new_question": false }, @@ -65784,9 +66246,9 @@ "question__title": "Queue Reconstruction by Height", "question__title_slug": "queue-reconstruction-by-height", "question__hide": false, - "total_acs": 293724, - "total_submitted": 384109, - "total_column_articles": 1574, + "total_acs": 296189, + "total_submitted": 387235, + "total_column_articles": 1582, "frontend_question_id": "406", "is_new_question": false }, @@ -65805,9 +66267,9 @@ "question__title": "Convert a Number to Hexadecimal", "question__title_slug": "convert-a-number-to-hexadecimal", "question__hide": false, - "total_acs": 72708, - "total_submitted": 132993, - "total_column_articles": 685, + "total_acs": 72997, + "total_submitted": 133474, + "total_column_articles": 687, "frontend_question_id": "405", "is_new_question": false }, @@ -65826,9 +66288,9 @@ "question__title": "Sum of Left Leaves", "question__title_slug": "sum-of-left-leaves", "question__hide": false, - "total_acs": 304505, - "total_submitted": 484525, - "total_column_articles": 2404, + "total_acs": 308111, + "total_submitted": 489878, + "total_column_articles": 2424, "frontend_question_id": "404", "is_new_question": false }, @@ -65847,9 +66309,9 @@ "question__title": "Frog Jump", "question__title_slug": "frog-jump", "question__hide": false, - "total_acs": 66749, - "total_submitted": 144665, - "total_column_articles": 597, + "total_acs": 67137, + "total_submitted": 145399, + "total_column_articles": 602, "frontend_question_id": "403", "is_new_question": false }, @@ -65868,9 +66330,9 @@ "question__title": "Remove K Digits", "question__title_slug": "remove-k-digits", "question__hide": false, - "total_acs": 157694, - "total_submitted": 494255, - "total_column_articles": 1025, + "total_acs": 159250, + "total_submitted": 498791, + "total_column_articles": 1036, "frontend_question_id": "402", "is_new_question": false }, @@ -65889,9 +66351,9 @@ "question__title": "Binary Watch", "question__title_slug": "binary-watch", "question__hide": false, - "total_acs": 78400, - "total_submitted": 124657, - "total_column_articles": 934, + "total_acs": 78682, + "total_submitted": 125042, + "total_column_articles": 938, "frontend_question_id": "401", "is_new_question": false }, @@ -65910,9 +66372,9 @@ "question__title": "Nth Digit", "question__title_slug": "nth-digit", "question__hide": false, - "total_acs": 63841, - "total_submitted": 140111, - "total_column_articles": 656, + "total_acs": 64112, + "total_submitted": 140722, + "total_column_articles": 660, "frontend_question_id": "400", "is_new_question": false }, @@ -65931,9 +66393,9 @@ "question__title": "Evaluate Division", "question__title_slug": "evaluate-division", "question__hide": false, - "total_acs": 97653, - "total_submitted": 166723, - "total_column_articles": 1050, + "total_acs": 98942, + "total_submitted": 168959, + "total_column_articles": 1056, "frontend_question_id": "399", "is_new_question": false }, @@ -65952,9 +66414,9 @@ "question__title": "Random Pick Index", "question__title_slug": "random-pick-index", "question__hide": false, - "total_acs": 60464, - "total_submitted": 87781, - "total_column_articles": 481, + "total_acs": 60608, + "total_submitted": 88037, + "total_column_articles": 482, "frontend_question_id": "398", "is_new_question": false }, @@ -65973,9 +66435,9 @@ "question__title": "Integer Replacement", "question__title_slug": "integer-replacement", "question__hide": false, - "total_acs": 74265, - "total_submitted": 175718, - "total_column_articles": 744, + "total_acs": 74590, + "total_submitted": 176503, + "total_column_articles": 745, "frontend_question_id": "397", "is_new_question": false }, @@ -65994,8 +66456,8 @@ "question__title": "Rotate Function", "question__title_slug": "rotate-function", "question__hide": false, - "total_acs": 55347, - "total_submitted": 104916, + "total_acs": 55615, + "total_submitted": 105412, "total_column_articles": 637, "frontend_question_id": "396", "is_new_question": false @@ -66015,9 +66477,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": 94585, - "total_submitted": 179793, - "total_column_articles": 721, + "total_acs": 95143, + "total_submitted": 180874, + "total_column_articles": 724, "frontend_question_id": "395", "is_new_question": false }, @@ -66036,9 +66498,9 @@ "question__title": "Decode String", "question__title_slug": "decode-string", "question__hide": false, - "total_acs": 318129, - "total_submitted": 552473, - "total_column_articles": 2641, + "total_acs": 323268, + "total_submitted": 560398, + "total_column_articles": 2660, "frontend_question_id": "394", "is_new_question": false }, @@ -66057,9 +66519,9 @@ "question__title": "UTF-8 Validation", "question__title_slug": "utf-8-validation", "question__hide": false, - "total_acs": 41253, - "total_submitted": 94309, - "total_column_articles": 506, + "total_acs": 41362, + "total_submitted": 94564, + "total_column_articles": 508, "frontend_question_id": "393", "is_new_question": false }, @@ -66078,9 +66540,9 @@ "question__title": "Is Subsequence", "question__title_slug": "is-subsequence", "question__hide": false, - "total_acs": 432112, - "total_submitted": 823866, - "total_column_articles": 3363, + "total_acs": 438842, + "total_submitted": 836279, + "total_column_articles": 3382, "frontend_question_id": "392", "is_new_question": false }, @@ -66099,9 +66561,9 @@ "question__title": "Perfect Rectangle", "question__title_slug": "perfect-rectangle", "question__hide": false, - "total_acs": 28819, - "total_submitted": 62705, - "total_column_articles": 338, + "total_acs": 28914, + "total_submitted": 62939, + "total_column_articles": 339, "frontend_question_id": "391", "is_new_question": false }, @@ -66120,9 +66582,9 @@ "question__title": "Elimination Game", "question__title_slug": "elimination-game", "question__hide": false, - "total_acs": 39659, - "total_submitted": 66927, - "total_column_articles": 486, + "total_acs": 39768, + "total_submitted": 67145, + "total_column_articles": 487, "frontend_question_id": "390", "is_new_question": false }, @@ -66141,9 +66603,9 @@ "question__title": "Find the Difference", "question__title_slug": "find-the-difference", "question__hide": false, - "total_acs": 205803, - "total_submitted": 319230, - "total_column_articles": 1930, + "total_acs": 207124, + "total_submitted": 321357, + "total_column_articles": 1936, "frontend_question_id": "389", "is_new_question": false }, @@ -66162,8 +66624,8 @@ "question__title": "Longest Absolute File Path", "question__title_slug": "longest-absolute-file-path", "question__hide": false, - "total_acs": 36709, - "total_submitted": 57573, + "total_acs": 36876, + "total_submitted": 57921, "total_column_articles": 536, "frontend_question_id": "388", "is_new_question": false @@ -66183,9 +66645,9 @@ "question__title": "First Unique Character in a String", "question__title_slug": "first-unique-character-in-a-string", "question__hide": false, - "total_acs": 424757, - "total_submitted": 751519, - "total_column_articles": 2336, + "total_acs": 426917, + "total_submitted": 754633, + "total_column_articles": 2342, "frontend_question_id": "387", "is_new_question": false }, @@ -66204,9 +66666,9 @@ "question__title": "Lexicographical Numbers", "question__title_slug": "lexicographical-numbers", "question__hide": false, - "total_acs": 77191, - "total_submitted": 103510, - "total_column_articles": 699, + "total_acs": 77676, + "total_submitted": 104192, + "total_column_articles": 703, "frontend_question_id": "386", "is_new_question": false }, @@ -66225,8 +66687,8 @@ "question__title": "Mini Parser", "question__title_slug": "mini-parser", "question__hide": false, - "total_acs": 33456, - "total_submitted": 60968, + "total_acs": 33543, + "total_submitted": 61098, "total_column_articles": 314, "frontend_question_id": "385", "is_new_question": false @@ -66246,9 +66708,9 @@ "question__title": "Shuffle an Array", "question__title_slug": "shuffle-an-array", "question__hide": false, - "total_acs": 132350, - "total_submitted": 214013, - "total_column_articles": 627, + "total_acs": 132747, + "total_submitted": 214538, + "total_column_articles": 629, "frontend_question_id": "384", "is_new_question": false }, @@ -66267,9 +66729,9 @@ "question__title": "Ransom Note", "question__title_slug": "ransom-note", "question__hide": false, - "total_acs": 488529, - "total_submitted": 759938, - "total_column_articles": 3655, + "total_acs": 495873, + "total_submitted": 769443, + "total_column_articles": 3678, "frontend_question_id": "383", "is_new_question": false }, @@ -66288,8 +66750,8 @@ "question__title": "Linked List Random Node", "question__title_slug": "linked-list-random-node", "question__hide": false, - "total_acs": 67232, - "total_submitted": 92548, + "total_acs": 67478, + "total_submitted": 92857, "total_column_articles": 472, "frontend_question_id": "382", "is_new_question": false @@ -66309,8 +66771,8 @@ "question__title": "Insert Delete GetRandom O(1) - Duplicates allowed", "question__title_slug": "insert-delete-getrandom-o1-duplicates-allowed", "question__hide": false, - "total_acs": 28611, - "total_submitted": 68486, + "total_acs": 28737, + "total_submitted": 68773, "total_column_articles": 251, "frontend_question_id": "381", "is_new_question": false @@ -66330,9 +66792,9 @@ "question__title": "Insert Delete GetRandom O(1)", "question__title_slug": "insert-delete-getrandom-o1", "question__hide": false, - "total_acs": 163536, - "total_submitted": 313315, - "total_column_articles": 1902, + "total_acs": 166876, + "total_submitted": 319511, + "total_column_articles": 1911, "frontend_question_id": "380", "is_new_question": false }, @@ -66351,8 +66813,8 @@ "question__title": "Design Phone Directory", "question__title_slug": "design-phone-directory", "question__hide": false, - "total_acs": 6146, - "total_submitted": 10031, + "total_acs": 6179, + "total_submitted": 10075, "total_column_articles": 123, "frontend_question_id": "379", "is_new_question": false @@ -66372,9 +66834,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": 134804, - "total_submitted": 211389, - "total_column_articles": 884, + "total_acs": 135524, + "total_submitted": 212433, + "total_column_articles": 888, "frontend_question_id": "378", "is_new_question": false }, @@ -66393,9 +66855,9 @@ "question__title": "Combination Sum IV", "question__title_slug": "combination-sum-iv", "question__hide": false, - "total_acs": 206754, - "total_submitted": 390543, - "total_column_articles": 1213, + "total_acs": 209775, + "total_submitted": 396121, + "total_column_articles": 1224, "frontend_question_id": "377", "is_new_question": false }, @@ -66414,9 +66876,9 @@ "question__title": "Wiggle Subsequence", "question__title_slug": "wiggle-subsequence", "question__hide": false, - "total_acs": 237020, - "total_submitted": 511795, - "total_column_articles": 1835, + "total_acs": 239746, + "total_submitted": 517630, + "total_column_articles": 1846, "frontend_question_id": "376", "is_new_question": false }, @@ -66435,9 +66897,9 @@ "question__title": "Guess Number Higher or Lower II", "question__title_slug": "guess-number-higher-or-lower-ii", "question__hide": false, - "total_acs": 50738, - "total_submitted": 80533, - "total_column_articles": 374, + "total_acs": 51033, + "total_submitted": 80917, + "total_column_articles": 377, "frontend_question_id": "375", "is_new_question": false }, @@ -66456,9 +66918,9 @@ "question__title": "Guess Number Higher or Lower", "question__title_slug": "guess-number-higher-or-lower", "question__hide": false, - "total_acs": 187911, - "total_submitted": 358599, - "total_column_articles": 1135, + "total_acs": 188997, + "total_submitted": 360583, + "total_column_articles": 1136, "frontend_question_id": "374", "is_new_question": false }, @@ -66477,9 +66939,9 @@ "question__title": "Find K Pairs with Smallest Sums", "question__title_slug": "find-k-pairs-with-smallest-sums", "question__hide": false, - "total_acs": 76295, - "total_submitted": 186317, - "total_column_articles": 606, + "total_acs": 77603, + "total_submitted": 189292, + "total_column_articles": 607, "frontend_question_id": "373", "is_new_question": false }, @@ -66498,9 +66960,9 @@ "question__title": "Super Pow", "question__title_slug": "super-pow", "question__hide": false, - "total_acs": 49735, - "total_submitted": 87662, - "total_column_articles": 531, + "total_acs": 49922, + "total_submitted": 88023, + "total_column_articles": 534, "frontend_question_id": "372", "is_new_question": false }, @@ -66519,9 +66981,9 @@ "question__title": "Sum of Two Integers", "question__title_slug": "sum-of-two-integers", "question__hide": false, - "total_acs": 123172, - "total_submitted": 196701, - "total_column_articles": 739, + "total_acs": 123726, + "total_submitted": 197441, + "total_column_articles": 740, "frontend_question_id": "371", "is_new_question": false }, @@ -66540,9 +67002,9 @@ "question__title": "Range Addition", "question__title_slug": "range-addition", "question__hide": false, - "total_acs": 14196, - "total_submitted": 18361, - "total_column_articles": 293, + "total_acs": 14267, + "total_submitted": 18435, + "total_column_articles": 294, "frontend_question_id": "370", "is_new_question": false }, @@ -66561,9 +67023,9 @@ "question__title": "Plus One Linked List", "question__title_slug": "plus-one-linked-list", "question__hide": false, - "total_acs": 10117, - "total_submitted": 16328, - "total_column_articles": 252, + "total_acs": 10304, + "total_submitted": 16631, + "total_column_articles": 253, "frontend_question_id": "369", "is_new_question": false }, @@ -66582,9 +67044,9 @@ "question__title": "Largest Divisible Subset", "question__title_slug": "largest-divisible-subset", "question__hide": false, - "total_acs": 61520, - "total_submitted": 134013, - "total_column_articles": 619, + "total_acs": 61759, + "total_submitted": 134445, + "total_column_articles": 620, "frontend_question_id": "368", "is_new_question": false }, @@ -66603,9 +67065,9 @@ "question__title": "Valid Perfect Square", "question__title_slug": "valid-perfect-square", "question__hide": false, - "total_acs": 273708, - "total_submitted": 609140, - "total_column_articles": 1905, + "total_acs": 275965, + "total_submitted": 613970, + "total_column_articles": 1909, "frontend_question_id": "367", "is_new_question": false }, @@ -66624,9 +67086,9 @@ "question__title": "Find Leaves of Binary Tree", "question__title_slug": "find-leaves-of-binary-tree", "question__hide": false, - "total_acs": 10955, - "total_submitted": 13607, - "total_column_articles": 243, + "total_acs": 11068, + "total_submitted": 13732, + "total_column_articles": 244, "frontend_question_id": "366", "is_new_question": false }, @@ -66645,9 +67107,9 @@ "question__title": "Water and Jug Problem", "question__title_slug": "water-and-jug-problem", "question__hide": false, - "total_acs": 65559, - "total_submitted": 150747, - "total_column_articles": 728, + "total_acs": 66085, + "total_submitted": 151629, + "total_column_articles": 732, "frontend_question_id": "365", "is_new_question": false }, @@ -66666,9 +67128,9 @@ "question__title": "Nested List Weight Sum II", "question__title_slug": "nested-list-weight-sum-ii", "question__hide": false, - "total_acs": 3574, - "total_submitted": 5532, - "total_column_articles": 82, + "total_acs": 3604, + "total_submitted": 5617, + "total_column_articles": 83, "frontend_question_id": "364", "is_new_question": false }, @@ -66687,9 +67149,9 @@ "question__title": "Max Sum of Rectangle No Larger Than K", "question__title_slug": "max-sum-of-rectangle-no-larger-than-k", "question__hide": false, - "total_acs": 44293, - "total_submitted": 91724, - "total_column_articles": 281, + "total_acs": 44394, + "total_submitted": 91915, + "total_column_articles": 283, "frontend_question_id": "363", "is_new_question": false }, @@ -66708,8 +67170,8 @@ "question__title": "Design Hit Counter", "question__title_slug": "design-hit-counter", "question__hide": false, - "total_acs": 7690, - "total_submitted": 11105, + "total_acs": 7744, + "total_submitted": 11168, "total_column_articles": 131, "frontend_question_id": "362", "is_new_question": false @@ -66729,9 +67191,9 @@ "question__title": "Bomb Enemy", "question__title_slug": "bomb-enemy", "question__hide": false, - "total_acs": 6417, - "total_submitted": 10736, - "total_column_articles": 109, + "total_acs": 6438, + "total_submitted": 10799, + "total_column_articles": 110, "frontend_question_id": "361", "is_new_question": false }, @@ -66750,9 +67212,9 @@ "question__title": "Sort Transformed Array", "question__title_slug": "sort-transformed-array", "question__hide": false, - "total_acs": 5787, - "total_submitted": 9252, - "total_column_articles": 95, + "total_acs": 5839, + "total_submitted": 9322, + "total_column_articles": 96, "frontend_question_id": "360", "is_new_question": false }, @@ -66771,9 +67233,9 @@ "question__title": "Logger Rate Limiter", "question__title_slug": "logger-rate-limiter", "question__hide": false, - "total_acs": 9516, - "total_submitted": 12693, - "total_column_articles": 110, + "total_acs": 9561, + "total_submitted": 12753, + "total_column_articles": 111, "frontend_question_id": "359", "is_new_question": false }, @@ -66792,8 +67254,8 @@ "question__title": "Rearrange String k Distance Apart", "question__title_slug": "rearrange-string-k-distance-apart", "question__hide": false, - "total_acs": 7609, - "total_submitted": 20288, + "total_acs": 7638, + "total_submitted": 20377, "total_column_articles": 97, "frontend_question_id": "358", "is_new_question": false @@ -66813,9 +67275,9 @@ "question__title": "Count Numbers with Unique Digits", "question__title_slug": "count-numbers-with-unique-digits", "question__hide": false, - "total_acs": 73318, - "total_submitted": 120786, - "total_column_articles": 965, + "total_acs": 73520, + "total_submitted": 121129, + "total_column_articles": 966, "frontend_question_id": "357", "is_new_question": false }, @@ -66834,9 +67296,9 @@ "question__title": "Line Reflection", "question__title_slug": "line-reflection", "question__hide": false, - "total_acs": 2932, - "total_submitted": 7974, - "total_column_articles": 66, + "total_acs": 2977, + "total_submitted": 8175, + "total_column_articles": 67, "frontend_question_id": "356", "is_new_question": false }, @@ -66855,9 +67317,9 @@ "question__title": "Design Twitter", "question__title_slug": "design-twitter", "question__hide": false, - "total_acs": 47174, - "total_submitted": 114436, - "total_column_articles": 747, + "total_acs": 47357, + "total_submitted": 114896, + "total_column_articles": 750, "frontend_question_id": "355", "is_new_question": false }, @@ -66876,9 +67338,9 @@ "question__title": "Russian Doll Envelopes", "question__title_slug": "russian-doll-envelopes", "question__hide": false, - "total_acs": 114914, - "total_submitted": 320855, - "total_column_articles": 881, + "total_acs": 115509, + "total_submitted": 322956, + "total_column_articles": 884, "frontend_question_id": "354", "is_new_question": false }, @@ -66897,9 +67359,9 @@ "question__title": "Design Snake Game", "question__title_slug": "design-snake-game", "question__hide": false, - "total_acs": 5112, - "total_submitted": 11857, - "total_column_articles": 92, + "total_acs": 5150, + "total_submitted": 11960, + "total_column_articles": 93, "frontend_question_id": "353", "is_new_question": false }, @@ -66918,9 +67380,9 @@ "question__title": "Data Stream as Disjoint Intervals", "question__title_slug": "data-stream-as-disjoint-intervals", "question__hide": false, - "total_acs": 26598, - "total_submitted": 39825, - "total_column_articles": 428, + "total_acs": 26659, + "total_submitted": 39904, + "total_column_articles": 429, "frontend_question_id": "352", "is_new_question": false }, @@ -66939,9 +67401,9 @@ "question__title": "Android Unlock Patterns", "question__title_slug": "android-unlock-patterns", "question__hide": false, - "total_acs": 7930, - "total_submitted": 12869, - "total_column_articles": 139, + "total_acs": 7977, + "total_submitted": 12955, + "total_column_articles": 140, "frontend_question_id": "351", "is_new_question": false }, @@ -66960,9 +67422,9 @@ "question__title": "Intersection of Two Arrays II", "question__title_slug": "intersection-of-two-arrays-ii", "question__hide": false, - "total_acs": 517523, - "total_submitted": 898799, - "total_column_articles": 3040, + "total_acs": 519349, + "total_submitted": 901420, + "total_column_articles": 3043, "frontend_question_id": "350", "is_new_question": false }, @@ -66981,9 +67443,9 @@ "question__title": "Intersection of Two Arrays", "question__title_slug": "intersection-of-two-arrays", "question__hide": false, - "total_acs": 567551, - "total_submitted": 761082, - "total_column_articles": 3477, + "total_acs": 573581, + "total_submitted": 768624, + "total_column_articles": 3504, "frontend_question_id": "349", "is_new_question": false }, @@ -67002,9 +67464,9 @@ "question__title": "Design Tic-Tac-Toe", "question__title_slug": "design-tic-tac-toe", "question__hide": false, - "total_acs": 10508, - "total_submitted": 17668, - "total_column_articles": 144, + "total_acs": 10624, + "total_submitted": 17843, + "total_column_articles": 145, "frontend_question_id": "348", "is_new_question": false }, @@ -67023,9 +67485,9 @@ "question__title": "Top K Frequent Elements", "question__title_slug": "top-k-frequent-elements", "question__hide": false, - "total_acs": 552715, - "total_submitted": 868050, - "total_column_articles": 3442, + "total_acs": 559856, + "total_submitted": 878675, + "total_column_articles": 3475, "frontend_question_id": "347", "is_new_question": false }, @@ -67044,9 +67506,9 @@ "question__title": "Moving Average from Data Stream", "question__title_slug": "moving-average-from-data-stream", "question__hide": false, - "total_acs": 23156, - "total_submitted": 31561, - "total_column_articles": 224, + "total_acs": 23340, + "total_submitted": 31778, + "total_column_articles": 225, "frontend_question_id": "346", "is_new_question": false }, @@ -67065,9 +67527,9 @@ "question__title": "Reverse Vowels of a String", "question__title_slug": "reverse-vowels-of-a-string", "question__hide": false, - "total_acs": 199611, - "total_submitted": 364175, - "total_column_articles": 1655, + "total_acs": 200924, + "total_submitted": 366464, + "total_column_articles": 1659, "frontend_question_id": "345", "is_new_question": false }, @@ -67086,9 +67548,9 @@ "question__title": "Reverse String", "question__title_slug": "reverse-string", "question__hide": false, - "total_acs": 908541, - "total_submitted": 1131994, - "total_column_articles": 4160, + "total_acs": 914547, + "total_submitted": 1139138, + "total_column_articles": 4178, "frontend_question_id": "344", "is_new_question": false }, @@ -67107,9 +67569,9 @@ "question__title": "Integer Break", "question__title_slug": "integer-break", "question__hide": false, - "total_acs": 332651, - "total_submitted": 525094, - "total_column_articles": 2194, + "total_acs": 336393, + "total_submitted": 530411, + "total_column_articles": 2211, "frontend_question_id": "343", "is_new_question": false }, @@ -67128,9 +67590,9 @@ "question__title": "Power of Four", "question__title_slug": "power-of-four", "question__hide": false, - "total_acs": 150096, - "total_submitted": 281488, - "total_column_articles": 1203, + "total_acs": 150925, + "total_submitted": 282932, + "total_column_articles": 1209, "frontend_question_id": "342", "is_new_question": false }, @@ -67149,9 +67611,9 @@ "question__title": "Flatten Nested List Iterator", "question__title_slug": "flatten-nested-list-iterator", "question__hide": false, - "total_acs": 80029, - "total_submitted": 110068, - "total_column_articles": 684, + "total_acs": 80239, + "total_submitted": 110336, + "total_column_articles": 685, "frontend_question_id": "341", "is_new_question": false }, @@ -67170,9 +67632,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": 29401, - "total_submitted": 57318, - "total_column_articles": 327, + "total_acs": 29652, + "total_submitted": 57798, + "total_column_articles": 329, "frontend_question_id": "340", "is_new_question": false }, @@ -67191,9 +67653,9 @@ "question__title": "Nested List Weight Sum", "question__title_slug": "nested-list-weight-sum", "question__hide": false, - "total_acs": 7061, - "total_submitted": 8419, - "total_column_articles": 88, + "total_acs": 7111, + "total_submitted": 8475, + "total_column_articles": 89, "frontend_question_id": "339", "is_new_question": false }, @@ -67212,9 +67674,9 @@ "question__title": "Counting Bits", "question__title_slug": "counting-bits", "question__hide": false, - "total_acs": 335675, - "total_submitted": 426487, - "total_column_articles": 2427, + "total_acs": 337552, + "total_submitted": 428678, + "total_column_articles": 2434, "frontend_question_id": "338", "is_new_question": false }, @@ -67233,9 +67695,9 @@ "question__title": "House Robber III", "question__title_slug": "house-robber-iii", "question__hide": false, - "total_acs": 349076, - "total_submitted": 566675, - "total_column_articles": 2042, + "total_acs": 351759, + "total_submitted": 570804, + "total_column_articles": 2051, "frontend_question_id": "337", "is_new_question": false }, @@ -67254,9 +67716,9 @@ "question__title": "Palindrome Pairs", "question__title_slug": "palindrome-pairs", "question__hide": false, - "total_acs": 29382, - "total_submitted": 77048, - "total_column_articles": 259, + "total_acs": 29449, + "total_submitted": 77213, + "total_column_articles": 260, "frontend_question_id": "336", "is_new_question": false }, @@ -67275,9 +67737,9 @@ "question__title": "Self Crossing", "question__title_slug": "self-crossing", "question__hide": false, - "total_acs": 19498, - "total_submitted": 45913, - "total_column_articles": 175, + "total_acs": 19541, + "total_submitted": 46018, + "total_column_articles": 176, "frontend_question_id": "335", "is_new_question": false }, @@ -67296,9 +67758,9 @@ "question__title": "Increasing Triplet Subsequence", "question__title_slug": "increasing-triplet-subsequence", "question__hide": false, - "total_acs": 150375, - "total_submitted": 351517, - "total_column_articles": 930, + "total_acs": 151296, + "total_submitted": 353689, + "total_column_articles": 934, "frontend_question_id": "334", "is_new_question": false }, @@ -67317,8 +67779,8 @@ "question__title": "Largest BST Subtree", "question__title_slug": "largest-bst-subtree", "question__hide": false, - "total_acs": 10563, - "total_submitted": 21425, + "total_acs": 10649, + "total_submitted": 21584, "total_column_articles": 169, "frontend_question_id": "333", "is_new_question": false @@ -67338,9 +67800,9 @@ "question__title": "Reconstruct Itinerary", "question__title_slug": "reconstruct-itinerary", "question__hide": false, - "total_acs": 106800, - "total_submitted": 235858, - "total_column_articles": 700, + "total_acs": 107833, + "total_submitted": 238610, + "total_column_articles": 704, "frontend_question_id": "332", "is_new_question": false }, @@ -67359,9 +67821,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": 78169, - "total_submitted": 158478, - "total_column_articles": 776, + "total_acs": 78431, + "total_submitted": 158957, + "total_column_articles": 777, "frontend_question_id": "331", "is_new_question": false }, @@ -67380,8 +67842,8 @@ "question__title": "Patching Array", "question__title_slug": "patching-array", "question__hide": false, - "total_acs": 25452, - "total_submitted": 48020, + "total_acs": 25530, + "total_submitted": 48140, "total_column_articles": 211, "frontend_question_id": "330", "is_new_question": false @@ -67401,9 +67863,9 @@ "question__title": "Longest Increasing Path in a Matrix", "question__title_slug": "longest-increasing-path-in-a-matrix", "question__hide": false, - "total_acs": 108882, - "total_submitted": 208808, - "total_column_articles": 902, + "total_acs": 109643, + "total_submitted": 210110, + "total_column_articles": 904, "frontend_question_id": "329", "is_new_question": false }, @@ -67422,9 +67884,9 @@ "question__title": "Odd Even Linked List", "question__title_slug": "odd-even-linked-list", "question__hide": false, - "total_acs": 239159, - "total_submitted": 370403, - "total_column_articles": 1748, + "total_acs": 240380, + "total_submitted": 372252, + "total_column_articles": 1750, "frontend_question_id": "328", "is_new_question": false }, @@ -67443,9 +67905,9 @@ "question__title": "Count of Range Sum", "question__title_slug": "count-of-range-sum", "question__hide": false, - "total_acs": 46190, - "total_submitted": 114446, - "total_column_articles": 385, + "total_acs": 46387, + "total_submitted": 114935, + "total_column_articles": 387, "frontend_question_id": "327", "is_new_question": false }, @@ -67464,9 +67926,9 @@ "question__title": "Power of Three", "question__title_slug": "power-of-three", "question__hide": false, - "total_acs": 239220, - "total_submitted": 465165, - "total_column_articles": 1038, + "total_acs": 240698, + "total_submitted": 467677, + "total_column_articles": 1045, "frontend_question_id": "326", "is_new_question": false }, @@ -67485,8 +67947,8 @@ "question__title": "Maximum Size Subarray Sum Equals k", "question__title_slug": "maximum-size-subarray-sum-equals-k", "question__hide": false, - "total_acs": 18518, - "total_submitted": 35931, + "total_acs": 18595, + "total_submitted": 36105, "total_column_articles": 202, "frontend_question_id": "325", "is_new_question": false @@ -67506,9 +67968,9 @@ "question__title": "Wiggle Sort II", "question__title_slug": "wiggle-sort-ii", "question__hide": false, - "total_acs": 68065, - "total_submitted": 166180, - "total_column_articles": 427, + "total_acs": 68437, + "total_submitted": 166968, + "total_column_articles": 428, "frontend_question_id": "324", "is_new_question": false }, @@ -67527,8 +67989,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": 27510, - "total_submitted": 42097, + "total_acs": 27700, + "total_submitted": 42423, "total_column_articles": 369, "frontend_question_id": "323", "is_new_question": false @@ -67548,9 +68010,9 @@ "question__title": "Coin Change", "question__title_slug": "coin-change", "question__hide": false, - "total_acs": 826588, - "total_submitted": 1711341, - "total_column_articles": 4098, + "total_acs": 837684, + "total_submitted": 1729611, + "total_column_articles": 4123, "frontend_question_id": "322", "is_new_question": false }, @@ -67569,9 +68031,9 @@ "question__title": "Create Maximum Number", "question__title_slug": "create-maximum-number", "question__hide": false, - "total_acs": 40464, - "total_submitted": 96117, - "total_column_articles": 334, + "total_acs": 40895, + "total_submitted": 97015, + "total_column_articles": 336, "frontend_question_id": "321", "is_new_question": false }, @@ -67590,8 +68052,8 @@ "question__title": "Generalized Abbreviation", "question__title_slug": "generalized-abbreviation", "question__hide": false, - "total_acs": 5150, - "total_submitted": 7359, + "total_acs": 5167, + "total_submitted": 7383, "total_column_articles": 85, "frontend_question_id": "320", "is_new_question": false @@ -67611,9 +68073,9 @@ "question__title": "Bulb Switcher", "question__title_slug": "bulb-switcher", "question__hide": false, - "total_acs": 66205, - "total_submitted": 114602, - "total_column_articles": 564, + "total_acs": 66418, + "total_submitted": 114971, + "total_column_articles": 565, "frontend_question_id": "319", "is_new_question": false }, @@ -67632,8 +68094,8 @@ "question__title": "Maximum Product of Word Lengths", "question__title_slug": "maximum-product-of-word-lengths", "question__hide": false, - "total_acs": 95439, - "total_submitted": 132911, + "total_acs": 95721, + "total_submitted": 133298, "total_column_articles": 783, "frontend_question_id": "318", "is_new_question": false @@ -67653,8 +68115,8 @@ "question__title": "Shortest Distance from All Buildings", "question__title_slug": "shortest-distance-from-all-buildings", "question__hide": false, - "total_acs": 8314, - "total_submitted": 17452, + "total_acs": 8389, + "total_submitted": 17583, "total_column_articles": 103, "frontend_question_id": "317", "is_new_question": false @@ -67674,9 +68136,9 @@ "question__title": "Remove Duplicate Letters", "question__title_slug": "remove-duplicate-letters", "question__hide": false, - "total_acs": 138018, - "total_submitted": 281977, - "total_column_articles": 984, + "total_acs": 139388, + "total_submitted": 284417, + "total_column_articles": 991, "frontend_question_id": "316", "is_new_question": false }, @@ -67695,9 +68157,9 @@ "question__title": "Count of Smaller Numbers After Self", "question__title_slug": "count-of-smaller-numbers-after-self", "question__hide": false, - "total_acs": 93147, - "total_submitted": 213242, - "total_column_articles": 875, + "total_acs": 93789, + "total_submitted": 214441, + "total_column_articles": 878, "frontend_question_id": "315", "is_new_question": false }, @@ -67716,8 +68178,8 @@ "question__title": "Binary Tree Vertical Order Traversal", "question__title_slug": "binary-tree-vertical-order-traversal", "question__hide": false, - "total_acs": 12812, - "total_submitted": 22759, + "total_acs": 12929, + "total_submitted": 22938, "total_column_articles": 202, "frontend_question_id": "314", "is_new_question": false @@ -67737,8 +68199,8 @@ "question__title": "Super Ugly Number", "question__title_slug": "super-ugly-number", "question__hide": false, - "total_acs": 64536, - "total_submitted": 116359, + "total_acs": 64798, + "total_submitted": 117011, "total_column_articles": 530, "frontend_question_id": "313", "is_new_question": false @@ -67758,9 +68220,9 @@ "question__title": "Burst Balloons", "question__title_slug": "burst-balloons", "question__hide": false, - "total_acs": 117631, - "total_submitted": 168156, - "total_column_articles": 711, + "total_acs": 118236, + "total_submitted": 169009, + "total_column_articles": 712, "frontend_question_id": "312", "is_new_question": false }, @@ -67779,8 +68241,8 @@ "question__title": "Sparse Matrix Multiplication", "question__title_slug": "sparse-matrix-multiplication", "question__hide": false, - "total_acs": 9085, - "total_submitted": 12021, + "total_acs": 9201, + "total_submitted": 12162, "total_column_articles": 98, "frontend_question_id": "311", "is_new_question": false @@ -67800,9 +68262,9 @@ "question__title": "Minimum Height Trees", "question__title_slug": "minimum-height-trees", "question__hide": false, - "total_acs": 79554, - "total_submitted": 181945, - "total_column_articles": 600, + "total_acs": 79929, + "total_submitted": 182925, + "total_column_articles": 603, "frontend_question_id": "310", "is_new_question": false }, @@ -67821,9 +68283,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": 322507, - "total_submitted": 498045, - "total_column_articles": 2198, + "total_acs": 325273, + "total_submitted": 502092, + "total_column_articles": 2207, "frontend_question_id": "309", "is_new_question": false }, @@ -67842,8 +68304,8 @@ "question__title": "Range Sum Query 2D - Mutable", "question__title_slug": "range-sum-query-2d-mutable", "question__hide": false, - "total_acs": 4595, - "total_submitted": 7185, + "total_acs": 4615, + "total_submitted": 7216, "total_column_articles": 89, "frontend_question_id": "308", "is_new_question": false @@ -67863,9 +68325,9 @@ "question__title": "Range Sum Query - Mutable", "question__title_slug": "range-sum-query-mutable", "question__hide": false, - "total_acs": 89206, - "total_submitted": 167027, - "total_column_articles": 692, + "total_acs": 89867, + "total_submitted": 168046, + "total_column_articles": 696, "frontend_question_id": "307", "is_new_question": false }, @@ -67884,9 +68346,9 @@ "question__title": "Additive Number", "question__title_slug": "additive-number", "question__hide": false, - "total_acs": 53719, - "total_submitted": 142905, - "total_column_articles": 733, + "total_acs": 53965, + "total_submitted": 143650, + "total_column_articles": 735, "frontend_question_id": "306", "is_new_question": false }, @@ -67905,9 +68367,9 @@ "question__title": "Number of Islands II", "question__title_slug": "number-of-islands-ii", "question__hide": false, - "total_acs": 10871, - "total_submitted": 25831, - "total_column_articles": 140, + "total_acs": 10925, + "total_submitted": 25970, + "total_column_articles": 141, "frontend_question_id": "305", "is_new_question": false }, @@ -67926,9 +68388,9 @@ "question__title": "Range Sum Query 2D - Immutable", "question__title_slug": "range-sum-query-2d-immutable", "question__hide": false, - "total_acs": 143731, - "total_submitted": 230469, - "total_column_articles": 1446, + "total_acs": 144713, + "total_submitted": 231800, + "total_column_articles": 1450, "frontend_question_id": "304", "is_new_question": false }, @@ -67947,9 +68409,9 @@ "question__title": "Range Sum Query - Immutable", "question__title_slug": "range-sum-query-immutable", "question__hide": false, - "total_acs": 269692, - "total_submitted": 343992, - "total_column_articles": 2390, + "total_acs": 271545, + "total_submitted": 346134, + "total_column_articles": 2393, "frontend_question_id": "303", "is_new_question": false }, @@ -67968,8 +68430,8 @@ "question__title": "Smallest Rectangle Enclosing Black Pixels", "question__title_slug": "smallest-rectangle-enclosing-black-pixels", "question__hide": false, - "total_acs": 4244, - "total_submitted": 6309, + "total_acs": 4258, + "total_submitted": 6324, "total_column_articles": 69, "frontend_question_id": "302", "is_new_question": false @@ -67989,8 +68451,8 @@ "question__title": "Remove Invalid Parentheses", "question__title_slug": "remove-invalid-parentheses", "question__hide": false, - "total_acs": 107900, - "total_submitted": 194993, + "total_acs": 108345, + "total_submitted": 195766, "total_column_articles": 628, "frontend_question_id": "301", "is_new_question": false @@ -68010,9 +68472,9 @@ "question__title": "Longest Increasing Subsequence", "question__title_slug": "longest-increasing-subsequence", "question__hide": false, - "total_acs": 941636, - "total_submitted": 1688657, - "total_column_articles": 4883, + "total_acs": 953819, + "total_submitted": 1708170, + "total_column_articles": 4909, "frontend_question_id": "300", "is_new_question": false }, @@ -68031,9 +68493,9 @@ "question__title": "Bulls and Cows", "question__title_slug": "bulls-and-cows", "question__hide": false, - "total_acs": 106357, - "total_submitted": 178420, - "total_column_articles": 1047, + "total_acs": 106696, + "total_submitted": 178947, + "total_column_articles": 1049, "frontend_question_id": "299", "is_new_question": false }, @@ -68052,8 +68514,8 @@ "question__title": "Binary Tree Longest Consecutive Sequence", "question__title_slug": "binary-tree-longest-consecutive-sequence", "question__hide": false, - "total_acs": 12235, - "total_submitted": 20447, + "total_acs": 12383, + "total_submitted": 20680, "total_column_articles": 162, "frontend_question_id": "298", "is_new_question": false @@ -68073,9 +68535,9 @@ "question__title": "Serialize and Deserialize Binary Tree", "question__title_slug": "serialize-and-deserialize-binary-tree", "question__hide": false, - "total_acs": 239634, - "total_submitted": 404944, - "total_column_articles": 1458, + "total_acs": 240732, + "total_submitted": 406562, + "total_column_articles": 1462, "frontend_question_id": "297", "is_new_question": false }, @@ -68094,8 +68556,8 @@ "question__title": "Best Meeting Point", "question__title_slug": "best-meeting-point", "question__hide": false, - "total_acs": 4862, - "total_submitted": 7908, + "total_acs": 4873, + "total_submitted": 7921, "total_column_articles": 72, "frontend_question_id": "296", "is_new_question": false @@ -68115,9 +68577,9 @@ "question__title": "Find Median from Data Stream", "question__title_slug": "find-median-from-data-stream", "question__hide": false, - "total_acs": 145265, - "total_submitted": 266819, - "total_column_articles": 940, + "total_acs": 147985, + "total_submitted": 271461, + "total_column_articles": 950, "frontend_question_id": "295", "is_new_question": false }, @@ -68136,8 +68598,8 @@ "question__title": "Flip Game II", "question__title_slug": "flip-game-ii", "question__hide": false, - "total_acs": 7173, - "total_submitted": 12141, + "total_acs": 7193, + "total_submitted": 12189, "total_column_articles": 88, "frontend_question_id": "294", "is_new_question": false @@ -68157,8 +68619,8 @@ "question__title": "Flip Game", "question__title_slug": "flip-game", "question__hide": false, - "total_acs": 8735, - "total_submitted": 11986, + "total_acs": 8757, + "total_submitted": 12013, "total_column_articles": 132, "frontend_question_id": "293", "is_new_question": false @@ -68178,9 +68640,9 @@ "question__title": "Nim Game", "question__title_slug": "nim-game", "question__hide": false, - "total_acs": 190929, - "total_submitted": 269540, - "total_column_articles": 1221, + "total_acs": 191695, + "total_submitted": 270670, + "total_column_articles": 1223, "frontend_question_id": "292", "is_new_question": false }, @@ -68199,8 +68661,8 @@ "question__title": "Word Pattern II", "question__title_slug": "word-pattern-ii", "question__hide": false, - "total_acs": 5545, - "total_submitted": 10703, + "total_acs": 5568, + "total_submitted": 10741, "total_column_articles": 113, "frontend_question_id": "291", "is_new_question": false @@ -68220,9 +68682,9 @@ "question__title": "Word Pattern", "question__title_slug": "word-pattern", "question__hide": false, - "total_acs": 181380, - "total_submitted": 406507, - "total_column_articles": 2032, + "total_acs": 184239, + "total_submitted": 412725, + "total_column_articles": 2045, "frontend_question_id": "290", "is_new_question": false }, @@ -68241,9 +68703,9 @@ "question__title": "Game of Life", "question__title_slug": "game-of-life", "question__hide": false, - "total_acs": 108490, - "total_submitted": 142541, - "total_column_articles": 1340, + "total_acs": 110768, + "total_submitted": 145439, + "total_column_articles": 1358, "frontend_question_id": "289", "is_new_question": false }, @@ -68262,8 +68724,8 @@ "question__title": "Unique Word Abbreviation", "question__title_slug": "unique-word-abbreviation", "question__hide": false, - "total_acs": 7002, - "total_submitted": 13995, + "total_acs": 7025, + "total_submitted": 14036, "total_column_articles": 97, "frontend_question_id": "288", "is_new_question": false @@ -68283,9 +68745,9 @@ "question__title": "Find the Duplicate Number", "question__title_slug": "find-the-duplicate-number", "question__hide": false, - "total_acs": 388567, - "total_submitted": 603737, - "total_column_articles": 2289, + "total_acs": 393139, + "total_submitted": 610182, + "total_column_articles": 2301, "frontend_question_id": "287", "is_new_question": false }, @@ -68304,9 +68766,9 @@ "question__title": "Walls and Gates", "question__title_slug": "walls-and-gates", "question__hide": false, - "total_acs": 21274, - "total_submitted": 38436, - "total_column_articles": 250, + "total_acs": 21355, + "total_submitted": 38535, + "total_column_articles": 251, "frontend_question_id": "286", "is_new_question": false }, @@ -68325,8 +68787,8 @@ "question__title": "Inorder Successor in BST", "question__title_slug": "inorder-successor-in-bst", "question__hide": false, - "total_acs": 17312, - "total_submitted": 26784, + "total_acs": 17394, + "total_submitted": 26899, "total_column_articles": 187, "frontend_question_id": "285", "is_new_question": false @@ -68346,9 +68808,9 @@ "question__title": "Peeking Iterator", "question__title_slug": "peeking-iterator", "question__hide": false, - "total_acs": 35008, - "total_submitted": 45764, - "total_column_articles": 272, + "total_acs": 35116, + "total_submitted": 45918, + "total_column_articles": 273, "frontend_question_id": "284", "is_new_question": false }, @@ -68367,9 +68829,9 @@ "question__title": "Move Zeroes", "question__title_slug": "move-zeroes", "question__hide": false, - "total_acs": 1387958, - "total_submitted": 2185284, - "total_column_articles": 7997, + "total_acs": 1405685, + "total_submitted": 2212234, + "total_column_articles": 8080, "frontend_question_id": "283", "is_new_question": false }, @@ -68388,9 +68850,9 @@ "question__title": "Expression Add Operators", "question__title_slug": "expression-add-operators", "question__hide": false, - "total_acs": 28697, - "total_submitted": 61406, - "total_column_articles": 231, + "total_acs": 28778, + "total_submitted": 61624, + "total_column_articles": 232, "frontend_question_id": "282", "is_new_question": false }, @@ -68409,9 +68871,9 @@ "question__title": "Zigzag Iterator", "question__title_slug": "zigzag-iterator", "question__hide": false, - "total_acs": 6708, - "total_submitted": 8726, - "total_column_articles": 142, + "total_acs": 6757, + "total_submitted": 8779, + "total_column_articles": 143, "frontend_question_id": "281", "is_new_question": false }, @@ -68430,9 +68892,9 @@ "question__title": "Wiggle Sort", "question__title_slug": "wiggle-sort", "question__hide": false, - "total_acs": 14929, - "total_submitted": 21514, - "total_column_articles": 138, + "total_acs": 15247, + "total_submitted": 21944, + "total_column_articles": 140, "frontend_question_id": "280", "is_new_question": false }, @@ -68451,9 +68913,9 @@ "question__title": "Perfect Squares", "question__title_slug": "perfect-squares", "question__hide": false, - "total_acs": 522854, - "total_submitted": 782215, - "total_column_articles": 2349, + "total_acs": 530309, + "total_submitted": 792466, + "total_column_articles": 2366, "frontend_question_id": "279", "is_new_question": false }, @@ -68472,9 +68934,9 @@ "question__title": "First Bad Version", "question__title_slug": "first-bad-version", "question__hide": false, - "total_acs": 497695, - "total_submitted": 1091114, - "total_column_articles": 2657, + "total_acs": 498868, + "total_submitted": 1093418, + "total_column_articles": 2658, "frontend_question_id": "278", "is_new_question": false }, @@ -68493,9 +68955,9 @@ "question__title": "Find the Celebrity", "question__title_slug": "find-the-celebrity", "question__hide": false, - "total_acs": 16744, - "total_submitted": 28905, - "total_column_articles": 152, + "total_acs": 16908, + "total_submitted": 29181, + "total_column_articles": 154, "frontend_question_id": "277", "is_new_question": false }, @@ -68514,9 +68976,9 @@ "question__title": "Paint Fence", "question__title_slug": "paint-fence", "question__hide": false, - "total_acs": 12770, - "total_submitted": 23133, - "total_column_articles": 212, + "total_acs": 12887, + "total_submitted": 23310, + "total_column_articles": 214, "frontend_question_id": "276", "is_new_question": false }, @@ -68535,9 +68997,9 @@ "question__title": "H-Index II", "question__title_slug": "h-index-ii", "question__hide": false, - "total_acs": 106014, - "total_submitted": 234249, - "total_column_articles": 727, + "total_acs": 106753, + "total_submitted": 235998, + "total_column_articles": 730, "frontend_question_id": "275", "is_new_question": false }, @@ -68556,9 +69018,9 @@ "question__title": "H-Index", "question__title_slug": "h-index", "question__hide": false, - "total_acs": 187024, - "total_submitted": 404350, - "total_column_articles": 1484, + "total_acs": 192061, + "total_submitted": 415121, + "total_column_articles": 1512, "frontend_question_id": "274", "is_new_question": false }, @@ -68577,8 +69039,8 @@ "question__title": "Integer to English Words", "question__title_slug": "integer-to-english-words", "question__hide": false, - "total_acs": 40524, - "total_submitted": 110875, + "total_acs": 40663, + "total_submitted": 111228, "total_column_articles": 454, "frontend_question_id": "273", "is_new_question": false @@ -68598,8 +69060,8 @@ "question__title": "Closest Binary Search Tree Value II", "question__title_slug": "closest-binary-search-tree-value-ii", "question__hide": false, - "total_acs": 7805, - "total_submitted": 11776, + "total_acs": 7860, + "total_submitted": 11845, "total_column_articles": 144, "frontend_question_id": "272", "is_new_question": false @@ -68619,8 +69081,8 @@ "question__title": "Encode and Decode Strings", "question__title_slug": "encode-and-decode-strings", "question__hide": false, - "total_acs": 6319, - "total_submitted": 10733, + "total_acs": 6376, + "total_submitted": 10829, "total_column_articles": 85, "frontend_question_id": "271", "is_new_question": false @@ -68640,8 +69102,8 @@ "question__title": "Closest Binary Search Tree Value", "question__title_slug": "closest-binary-search-tree-value", "question__hide": false, - "total_acs": 21046, - "total_submitted": 39590, + "total_acs": 21301, + "total_submitted": 40245, "total_column_articles": 230, "frontend_question_id": "270", "is_new_question": false @@ -68661,8 +69123,8 @@ "question__title": "Alien Dictionary", "question__title_slug": "alien-dictionary", "question__hide": false, - "total_acs": 14434, - "total_submitted": 38716, + "total_acs": 14517, + "total_submitted": 38902, "total_column_articles": 199, "frontend_question_id": "269", "is_new_question": false @@ -68682,9 +69144,9 @@ "question__title": "Missing Number", "question__title_slug": "missing-number", "question__hide": false, - "total_acs": 353533, - "total_submitted": 526926, - "total_column_articles": 2586, + "total_acs": 355794, + "total_submitted": 529878, + "total_column_articles": 2599, "frontend_question_id": "268", "is_new_question": false }, @@ -68703,8 +69165,8 @@ "question__title": "Palindrome Permutation II", "question__title_slug": "palindrome-permutation-ii", "question__hide": false, - "total_acs": 6906, - "total_submitted": 14801, + "total_acs": 6942, + "total_submitted": 14904, "total_column_articles": 140, "frontend_question_id": "267", "is_new_question": false @@ -68724,9 +69186,9 @@ "question__title": "Palindrome Permutation", "question__title_slug": "palindrome-permutation", "question__hide": false, - "total_acs": 15373, - "total_submitted": 21673, - "total_column_articles": 211, + "total_acs": 15549, + "total_submitted": 21929, + "total_column_articles": 213, "frontend_question_id": "266", "is_new_question": false }, @@ -68745,9 +69207,9 @@ "question__title": "Paint House II", "question__title_slug": "paint-house-ii", "question__hide": false, - "total_acs": 16350, - "total_submitted": 25243, - "total_column_articles": 288, + "total_acs": 16520, + "total_submitted": 25470, + "total_column_articles": 290, "frontend_question_id": "265", "is_new_question": false }, @@ -68766,8 +69228,8 @@ "question__title": "Ugly Number II", "question__title_slug": "ugly-number-ii", "question__hide": false, - "total_acs": 177897, - "total_submitted": 305787, + "total_acs": 179187, + "total_submitted": 307975, "total_column_articles": 1022, "frontend_question_id": "264", "is_new_question": false @@ -68787,9 +69249,9 @@ "question__title": "Ugly Number", "question__title_slug": "ugly-number", "question__hide": false, - "total_acs": 182405, - "total_submitted": 363437, - "total_column_articles": 1264, + "total_acs": 183706, + "total_submitted": 366073, + "total_column_articles": 1269, "frontend_question_id": "263", "is_new_question": false }, @@ -68808,9 +69270,9 @@ "question__title": "Trips and Users", "question__title_slug": "trips-and-users", "question__hide": false, - "total_acs": 77983, - "total_submitted": 190204, - "total_column_articles": 743, + "total_acs": 78680, + "total_submitted": 191993, + "total_column_articles": 747, "frontend_question_id": "262", "is_new_question": false }, @@ -68829,8 +69291,8 @@ "question__title": "Graph Valid Tree", "question__title_slug": "graph-valid-tree", "question__hide": false, - "total_acs": 20466, - "total_submitted": 39762, + "total_acs": 20625, + "total_submitted": 40018, "total_column_articles": 255, "frontend_question_id": "261", "is_new_question": false @@ -68850,9 +69312,9 @@ "question__title": "Single Number III", "question__title_slug": "single-number-iii", "question__hide": false, - "total_acs": 152373, - "total_submitted": 212354, - "total_column_articles": 1156, + "total_acs": 153715, + "total_submitted": 214396, + "total_column_articles": 1163, "frontend_question_id": "260", "is_new_question": false }, @@ -68871,8 +69333,8 @@ "question__title": "3Sum Smaller", "question__title_slug": "3sum-smaller", "question__hide": false, - "total_acs": 14194, - "total_submitted": 25814, + "total_acs": 14265, + "total_submitted": 25938, "total_column_articles": 151, "frontend_question_id": "259", "is_new_question": false @@ -68892,9 +69354,9 @@ "question__title": "Add Digits", "question__title_slug": "add-digits", "question__hide": false, - "total_acs": 194670, - "total_submitted": 276047, - "total_column_articles": 1571, + "total_acs": 196119, + "total_submitted": 278092, + "total_column_articles": 1578, "frontend_question_id": "258", "is_new_question": false }, @@ -68913,9 +69375,9 @@ "question__title": "Binary Tree Paths", "question__title_slug": "binary-tree-paths", "question__hide": false, - "total_acs": 395502, - "total_submitted": 559377, - "total_column_articles": 2305, + "total_acs": 399464, + "total_submitted": 564485, + "total_column_articles": 2328, "frontend_question_id": "257", "is_new_question": false }, @@ -68934,9 +69396,9 @@ "question__title": "Paint House", "question__title_slug": "paint-house", "question__hide": false, - "total_acs": 25143, - "total_submitted": 35296, - "total_column_articles": 340, + "total_acs": 25399, + "total_submitted": 35608, + "total_column_articles": 341, "frontend_question_id": "256", "is_new_question": false }, @@ -68955,9 +69417,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": 11583, - "total_submitted": 23240, - "total_column_articles": 129, + "total_acs": 11674, + "total_submitted": 23383, + "total_column_articles": 130, "frontend_question_id": "255", "is_new_question": false }, @@ -68976,8 +69438,8 @@ "question__title": "Factor Combinations", "question__title_slug": "factor-combinations", "question__hide": false, - "total_acs": 11952, - "total_submitted": 20930, + "total_acs": 12026, + "total_submitted": 21034, "total_column_articles": 151, "frontend_question_id": "254", "is_new_question": false @@ -68997,8 +69459,8 @@ "question__title": "Meeting Rooms II", "question__title_slug": "meeting-rooms-ii", "question__hide": false, - "total_acs": 72047, - "total_submitted": 137169, + "total_acs": 72413, + "total_submitted": 137791, "total_column_articles": 634, "frontend_question_id": "253", "is_new_question": false @@ -69018,8 +69480,8 @@ "question__title": "Meeting Rooms", "question__title_slug": "meeting-rooms", "question__hide": false, - "total_acs": 27773, - "total_submitted": 47544, + "total_acs": 28023, + "total_submitted": 47929, "total_column_articles": 262, "frontend_question_id": "252", "is_new_question": false @@ -69039,8 +69501,8 @@ "question__title": "Flatten 2D Vector", "question__title_slug": "flatten-2d-vector", "question__hide": false, - "total_acs": 8127, - "total_submitted": 14661, + "total_acs": 8172, + "total_submitted": 14731, "total_column_articles": 119, "frontend_question_id": "251", "is_new_question": false @@ -69060,9 +69522,9 @@ "question__title": "Count Univalue Subtrees", "question__title_slug": "count-univalue-subtrees", "question__hide": false, - "total_acs": 10313, - "total_submitted": 15901, - "total_column_articles": 180, + "total_acs": 10418, + "total_submitted": 16055, + "total_column_articles": 182, "frontend_question_id": "250", "is_new_question": false }, @@ -69081,8 +69543,8 @@ "question__title": "Group Shifted Strings", "question__title_slug": "group-shifted-strings", "question__hide": false, - "total_acs": 13486, - "total_submitted": 20572, + "total_acs": 13628, + "total_submitted": 20770, "total_column_articles": 205, "frontend_question_id": "249", "is_new_question": false @@ -69102,9 +69564,9 @@ "question__title": "Strobogrammatic Number III", "question__title_slug": "strobogrammatic-number-iii", "question__hide": false, - "total_acs": 4780, - "total_submitted": 9772, - "total_column_articles": 91, + "total_acs": 5021, + "total_submitted": 10135, + "total_column_articles": 93, "frontend_question_id": "248", "is_new_question": false }, @@ -69123,9 +69585,9 @@ "question__title": "Strobogrammatic Number II", "question__title_slug": "strobogrammatic-number-ii", "question__hide": false, - "total_acs": 9958, - "total_submitted": 18173, - "total_column_articles": 148, + "total_acs": 10414, + "total_submitted": 18780, + "total_column_articles": 153, "frontend_question_id": "247", "is_new_question": false }, @@ -69144,8 +69606,8 @@ "question__title": "Strobogrammatic Number", "question__title_slug": "strobogrammatic-number", "question__hide": false, - "total_acs": 12110, - "total_submitted": 25454, + "total_acs": 12347, + "total_submitted": 25890, "total_column_articles": 191, "frontend_question_id": "246", "is_new_question": false @@ -69165,8 +69627,8 @@ "question__title": "Shortest Word Distance III", "question__title_slug": "shortest-word-distance-iii", "question__hide": false, - "total_acs": 8662, - "total_submitted": 14968, + "total_acs": 8676, + "total_submitted": 14992, "total_column_articles": 104, "frontend_question_id": "245", "is_new_question": false @@ -69186,8 +69648,8 @@ "question__title": "Shortest Word Distance II", "question__title_slug": "shortest-word-distance-ii", "question__hide": false, - "total_acs": 11231, - "total_submitted": 18518, + "total_acs": 11251, + "total_submitted": 18553, "total_column_articles": 120, "frontend_question_id": "244", "is_new_question": false @@ -69207,9 +69669,9 @@ "question__title": "Shortest Word Distance", "question__title_slug": "shortest-word-distance", "question__hide": false, - "total_acs": 18179, - "total_submitted": 26886, - "total_column_articles": 202, + "total_acs": 18243, + "total_submitted": 26961, + "total_column_articles": 203, "frontend_question_id": "243", "is_new_question": false }, @@ -69228,9 +69690,9 @@ "question__title": "Valid Anagram", "question__title_slug": "valid-anagram", "question__hide": false, - "total_acs": 782542, - "total_submitted": 1176355, - "total_column_articles": 4214, + "total_acs": 790758, + "total_submitted": 1187573, + "total_column_articles": 4240, "frontend_question_id": "242", "is_new_question": false }, @@ -69249,9 +69711,9 @@ "question__title": "Different Ways to Add Parentheses", "question__title_slug": "different-ways-to-add-parentheses", "question__hide": false, - "total_acs": 84624, - "total_submitted": 112100, - "total_column_articles": 813, + "total_acs": 84950, + "total_submitted": 112522, + "total_column_articles": 815, "frontend_question_id": "241", "is_new_question": false }, @@ -69270,9 +69732,9 @@ "question__title": "Search a 2D Matrix II", "question__title_slug": "search-a-2d-matrix-ii", "question__hide": false, - "total_acs": 463655, - "total_submitted": 861946, - "total_column_articles": 2048, + "total_acs": 469812, + "total_submitted": 872346, + "total_column_articles": 2067, "frontend_question_id": "240", "is_new_question": false }, @@ -69291,9 +69753,9 @@ "question__title": "Sliding Window Maximum", "question__title_slug": "sliding-window-maximum", "question__hide": false, - "total_acs": 610445, - "total_submitted": 1247801, - "total_column_articles": 4003, + "total_acs": 620293, + "total_submitted": 1267623, + "total_column_articles": 4039, "frontend_question_id": "239", "is_new_question": false }, @@ -69312,9 +69774,9 @@ "question__title": "Product of Array Except Self", "question__title_slug": "product-of-array-except-self", "question__hide": false, - "total_acs": 444567, - "total_submitted": 588347, - "total_column_articles": 2399, + "total_acs": 455331, + "total_submitted": 601726, + "total_column_articles": 2445, "frontend_question_id": "238", "is_new_question": false }, @@ -69333,9 +69795,9 @@ "question__title": "Delete Node in a Linked List", "question__title_slug": "delete-node-in-a-linked-list", "question__hide": false, - "total_acs": 372279, - "total_submitted": 431083, - "total_column_articles": 1855, + "total_acs": 373596, + "total_submitted": 432502, + "total_column_articles": 1860, "frontend_question_id": "237", "is_new_question": false }, @@ -69354,9 +69816,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": 718076, - "total_submitted": 1008437, - "total_column_articles": 3403, + "total_acs": 727449, + "total_submitted": 1020138, + "total_column_articles": 3430, "frontend_question_id": "236", "is_new_question": false }, @@ -69375,9 +69837,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": 427388, - "total_submitted": 608347, - "total_column_articles": 2172, + "total_acs": 430818, + "total_submitted": 612520, + "total_column_articles": 2184, "frontend_question_id": "235", "is_new_question": false }, @@ -69396,9 +69858,9 @@ "question__title": "Palindrome Linked List", "question__title_slug": "palindrome-linked-list", "question__hide": false, - "total_acs": 744065, - "total_submitted": 1366001, - "total_column_articles": 4081, + "total_acs": 752824, + "total_submitted": 1379479, + "total_column_articles": 4127, "frontend_question_id": "234", "is_new_question": false }, @@ -69417,9 +69879,9 @@ "question__title": "Number of Digit One", "question__title_slug": "number-of-digit-one", "question__hide": false, - "total_acs": 64127, - "total_submitted": 129977, - "total_column_articles": 684, + "total_acs": 64566, + "total_submitted": 130888, + "total_column_articles": 687, "frontend_question_id": "233", "is_new_question": false }, @@ -69438,9 +69900,9 @@ "question__title": "Implement Queue using Stacks", "question__title_slug": "implement-queue-using-stacks", "question__hide": false, - "total_acs": 461334, - "total_submitted": 677723, - "total_column_articles": 2749, + "total_acs": 465933, + "total_submitted": 684693, + "total_column_articles": 2758, "frontend_question_id": "232", "is_new_question": false }, @@ -69459,9 +69921,9 @@ "question__title": "Power of Two", "question__title_slug": "power-of-two", "question__hide": false, - "total_acs": 338412, - "total_submitted": 679543, - "total_column_articles": 2363, + "total_acs": 340552, + "total_submitted": 683802, + "total_column_articles": 2373, "frontend_question_id": "231", "is_new_question": false }, @@ -69480,9 +69942,9 @@ "question__title": "Kth Smallest Element in a BST", "question__title_slug": "kth-smallest-element-in-a-bst", "question__hide": false, - "total_acs": 365706, - "total_submitted": 473329, - "total_column_articles": 2218, + "total_acs": 372225, + "total_submitted": 481074, + "total_column_articles": 2232, "frontend_question_id": "230", "is_new_question": false }, @@ -69501,9 +69963,9 @@ "question__title": "Majority Element II", "question__title_slug": "majority-element-ii", "question__hide": false, - "total_acs": 106882, - "total_submitted": 196687, - "total_column_articles": 907, + "total_acs": 107367, + "total_submitted": 197519, + "total_column_articles": 910, "frontend_question_id": "229", "is_new_question": false }, @@ -69522,9 +69984,9 @@ "question__title": "Summary Ranges", "question__title_slug": "summary-ranges", "question__hide": false, - "total_acs": 161153, - "total_submitted": 294720, - "total_column_articles": 1473, + "total_acs": 164197, + "total_submitted": 300099, + "total_column_articles": 1495, "frontend_question_id": "228", "is_new_question": false }, @@ -69543,9 +70005,9 @@ "question__title": "Basic Calculator II", "question__title_slug": "basic-calculator-ii", "question__hide": false, - "total_acs": 169327, - "total_submitted": 377226, - "total_column_articles": 1168, + "total_acs": 170430, + "total_submitted": 379297, + "total_column_articles": 1169, "frontend_question_id": "227", "is_new_question": false }, @@ -69564,9 +70026,9 @@ "question__title": "Invert Binary Tree", "question__title_slug": "invert-binary-tree", "question__hide": false, - "total_acs": 891677, - "total_submitted": 1108748, - "total_column_articles": 4901, + "total_acs": 904306, + "total_submitted": 1123549, + "total_column_articles": 4931, "frontend_question_id": "226", "is_new_question": false }, @@ -69585,9 +70047,9 @@ "question__title": "Implement Stack using Queues", "question__title_slug": "implement-stack-using-queues", "question__hide": false, - "total_acs": 381833, - "total_submitted": 581364, - "total_column_articles": 5923, + "total_acs": 385908, + "total_submitted": 588386, + "total_column_articles": 5934, "frontend_question_id": "225", "is_new_question": false }, @@ -69606,9 +70068,9 @@ "question__title": "Basic Calculator", "question__title_slug": "basic-calculator", "question__hide": false, - "total_acs": 144089, - "total_submitted": 337683, - "total_column_articles": 1168, + "total_acs": 145683, + "total_submitted": 341183, + "total_column_articles": 1172, "frontend_question_id": "224", "is_new_question": false }, @@ -69627,9 +70089,9 @@ "question__title": "Rectangle Area", "question__title_slug": "rectangle-area", "question__hide": false, - "total_acs": 63942, - "total_submitted": 118158, - "total_column_articles": 687, + "total_acs": 64246, + "total_submitted": 118625, + "total_column_articles": 688, "frontend_question_id": "223", "is_new_question": false }, @@ -69648,9 +70110,9 @@ "question__title": "Count Complete Tree Nodes", "question__title_slug": "count-complete-tree-nodes", "question__hide": false, - "total_acs": 394214, - "total_submitted": 482987, - "total_column_articles": 2181, + "total_acs": 399821, + "total_submitted": 489470, + "total_column_articles": 2196, "frontend_question_id": "222", "is_new_question": false }, @@ -69669,9 +70131,9 @@ "question__title": "Maximal Square", "question__title_slug": "maximal-square", "question__hide": false, - "total_acs": 324546, - "total_submitted": 645050, - "total_column_articles": 1915, + "total_acs": 327848, + "total_submitted": 650734, + "total_column_articles": 1923, "frontend_question_id": "221", "is_new_question": false }, @@ -69690,9 +70152,9 @@ "question__title": "Contains Duplicate III", "question__title_slug": "contains-duplicate-iii", "question__hide": false, - "total_acs": 101447, - "total_submitted": 331806, - "total_column_articles": 663, + "total_acs": 101752, + "total_submitted": 332664, + "total_column_articles": 664, "frontend_question_id": "220", "is_new_question": false }, @@ -69711,9 +70173,9 @@ "question__title": "Contains Duplicate II", "question__title_slug": "contains-duplicate-ii", "question__hide": false, - "total_acs": 301579, - "total_submitted": 648130, - "total_column_articles": 2107, + "total_acs": 305608, + "total_submitted": 654693, + "total_column_articles": 2123, "frontend_question_id": "219", "is_new_question": false }, @@ -69732,9 +70194,9 @@ "question__title": "The Skyline Problem", "question__title_slug": "the-skyline-problem", "question__hide": false, - "total_acs": 54562, - "total_submitted": 98663, - "total_column_articles": 470, + "total_acs": 54864, + "total_submitted": 99164, + "total_column_articles": 473, "frontend_question_id": "218", "is_new_question": false }, @@ -69753,9 +70215,9 @@ "question__title": "Contains Duplicate", "question__title_slug": "contains-duplicate", "question__hide": false, - "total_acs": 858857, - "total_submitted": 1555712, - "total_column_articles": 3977, + "total_acs": 861374, + "total_submitted": 1559548, + "total_column_articles": 3991, "frontend_question_id": "217", "is_new_question": false }, @@ -69774,9 +70236,9 @@ "question__title": "Combination Sum III", "question__title_slug": "combination-sum-iii", "question__hide": false, - "total_acs": 383516, - "total_submitted": 538073, - "total_column_articles": 2416, + "total_acs": 388613, + "total_submitted": 545164, + "total_column_articles": 2426, "frontend_question_id": "216", "is_new_question": false }, @@ -69795,9 +70257,9 @@ "question__title": "Kth Largest Element in an Array", "question__title_slug": "kth-largest-element-in-an-array", "question__hide": false, - "total_acs": 1067644, - "total_submitted": 1738306, - "total_column_articles": 4686, + "total_acs": 1079499, + "total_submitted": 1758818, + "total_column_articles": 4717, "frontend_question_id": "215", "is_new_question": false }, @@ -69816,9 +70278,9 @@ "question__title": "Shortest Palindrome", "question__title_slug": "shortest-palindrome", "question__hide": false, - "total_acs": 51912, - "total_submitted": 128523, - "total_column_articles": 521, + "total_acs": 52116, + "total_submitted": 128999, + "total_column_articles": 524, "frontend_question_id": "214", "is_new_question": false }, @@ -69837,9 +70299,9 @@ "question__title": "House Robber II", "question__title_slug": "house-robber-ii", "question__hide": false, - "total_acs": 424928, - "total_submitted": 944391, - "total_column_articles": 3086, + "total_acs": 428274, + "total_submitted": 951153, + "total_column_articles": 3101, "frontend_question_id": "213", "is_new_question": false }, @@ -69858,9 +70320,9 @@ "question__title": "Word Search II", "question__title_slug": "word-search-ii", "question__hide": false, - "total_acs": 106658, - "total_submitted": 247098, - "total_column_articles": 812, + "total_acs": 107633, + "total_submitted": 249412, + "total_column_articles": 811, "frontend_question_id": "212", "is_new_question": false }, @@ -69879,9 +70341,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": 88408, - "total_submitted": 176732, - "total_column_articles": 833, + "total_acs": 89390, + "total_submitted": 178499, + "total_column_articles": 835, "frontend_question_id": "211", "is_new_question": false }, @@ -69900,9 +70362,9 @@ "question__title": "Course Schedule II", "question__title_slug": "course-schedule-ii", "question__hide": false, - "total_acs": 232371, - "total_submitted": 400360, - "total_column_articles": 1566, + "total_acs": 234433, + "total_submitted": 403620, + "total_column_articles": 1571, "frontend_question_id": "210", "is_new_question": false }, @@ -69921,9 +70383,9 @@ "question__title": "Minimum Size Subarray Sum", "question__title_slug": "minimum-size-subarray-sum", "question__hide": false, - "total_acs": 768012, - "total_submitted": 1655542, - "total_column_articles": 4374, + "total_acs": 779772, + "total_submitted": 1679409, + "total_column_articles": 4419, "frontend_question_id": "209", "is_new_question": false }, @@ -69942,9 +70404,9 @@ "question__title": "Implement Trie (Prefix Tree)", "question__title_slug": "implement-trie-prefix-tree", "question__hide": false, - "total_acs": 330469, - "total_submitted": 459172, - "total_column_articles": 1900, + "total_acs": 334532, + "total_submitted": 464694, + "total_column_articles": 1914, "frontend_question_id": "208", "is_new_question": false }, @@ -69963,9 +70425,9 @@ "question__title": "Course Schedule", "question__title_slug": "course-schedule", "question__hide": false, - "total_acs": 408325, - "total_submitted": 756213, - "total_column_articles": 2628, + "total_acs": 414227, + "total_submitted": 766406, + "total_column_articles": 2647, "frontend_question_id": "207", "is_new_question": false }, @@ -69984,9 +70446,9 @@ "question__title": "Reverse Linked List", "question__title_slug": "reverse-linked-list", "question__hide": false, - "total_acs": 1895380, - "total_submitted": 2549200, - "total_column_articles": 12803, + "total_acs": 1915507, + "total_submitted": 2573704, + "total_column_articles": 12851, "frontend_question_id": "206", "is_new_question": false }, @@ -70005,9 +70467,9 @@ "question__title": "Isomorphic Strings", "question__title_slug": "isomorphic-strings", "question__hide": false, - "total_acs": 271110, - "total_submitted": 550000, - "total_column_articles": 1888, + "total_acs": 274926, + "total_submitted": 557805, + "total_column_articles": 1903, "frontend_question_id": "205", "is_new_question": false }, @@ -70026,9 +70488,9 @@ "question__title": "Count Primes", "question__title_slug": "count-primes", "question__hide": false, - "total_acs": 278523, - "total_submitted": 752675, - "total_column_articles": 1172, + "total_acs": 279920, + "total_submitted": 756305, + "total_column_articles": 1182, "frontend_question_id": "204", "is_new_question": false }, @@ -70047,9 +70509,9 @@ "question__title": "Remove Linked List Elements", "question__title_slug": "remove-linked-list-elements", "question__hide": false, - "total_acs": 732243, - "total_submitted": 1291175, - "total_column_articles": 3843, + "total_acs": 739815, + "total_submitted": 1301953, + "total_column_articles": 3870, "frontend_question_id": "203", "is_new_question": false }, @@ -70068,9 +70530,9 @@ "question__title": "Happy Number", "question__title_slug": "happy-number", "question__hide": false, - "total_acs": 514947, - "total_submitted": 800376, - "total_column_articles": 3475, + "total_acs": 521582, + "total_submitted": 809601, + "total_column_articles": 3512, "frontend_question_id": "202", "is_new_question": false }, @@ -70089,9 +70551,9 @@ "question__title": "Bitwise AND of Numbers Range", "question__title_slug": "bitwise-and-of-numbers-range", "question__hide": false, - "total_acs": 91597, - "total_submitted": 167810, - "total_column_articles": 592, + "total_acs": 92715, + "total_submitted": 169695, + "total_column_articles": 595, "frontend_question_id": "201", "is_new_question": false }, @@ -70110,9 +70572,9 @@ "question__title": "Number of Islands", "question__title_slug": "number-of-islands", "question__hide": false, - "total_acs": 837276, - "total_submitted": 1383234, - "total_column_articles": 4586, + "total_acs": 848278, + "total_submitted": 1398966, + "total_column_articles": 4612, "frontend_question_id": "200", "is_new_question": false }, @@ -70131,9 +70593,9 @@ "question__title": "Binary Tree Right Side View", "question__title_slug": "binary-tree-right-side-view", "question__hide": false, - "total_acs": 419597, - "total_submitted": 626020, - "total_column_articles": 3386, + "total_acs": 427612, + "total_submitted": 636795, + "total_column_articles": 3429, "frontend_question_id": "199", "is_new_question": false }, @@ -70152,9 +70614,9 @@ "question__title": "House Robber", "question__title_slug": "house-robber", "question__hide": false, - "total_acs": 986543, - "total_submitted": 1792491, - "total_column_articles": 5505, + "total_acs": 999008, + "total_submitted": 1813725, + "total_column_articles": 5548, "frontend_question_id": "198", "is_new_question": false }, @@ -70173,9 +70635,9 @@ "question__title": "Rising Temperature", "question__title_slug": "rising-temperature", "question__hide": false, - "total_acs": 235354, - "total_submitted": 438354, - "total_column_articles": 1230, + "total_acs": 238977, + "total_submitted": 444880, + "total_column_articles": 1248, "frontend_question_id": "197", "is_new_question": false }, @@ -70194,9 +70656,9 @@ "question__title": "Delete Duplicate Emails", "question__title_slug": "delete-duplicate-emails", "question__hide": false, - "total_acs": 251840, - "total_submitted": 371915, - "total_column_articles": 921, + "total_acs": 253951, + "total_submitted": 375075, + "total_column_articles": 926, "frontend_question_id": "196", "is_new_question": false }, @@ -70215,9 +70677,9 @@ "question__title": "Tenth Line", "question__title_slug": "tenth-line", "question__hide": false, - "total_acs": 58459, - "total_submitted": 133822, - "total_column_articles": 226, + "total_acs": 58752, + "total_submitted": 134525, + "total_column_articles": 227, "frontend_question_id": "195", "is_new_question": false }, @@ -70236,9 +70698,9 @@ "question__title": "Transpose File", "question__title_slug": "transpose-file", "question__hide": false, - "total_acs": 17312, - "total_submitted": 50722, - "total_column_articles": 114, + "total_acs": 17419, + "total_submitted": 51149, + "total_column_articles": 115, "frontend_question_id": "194", "is_new_question": false }, @@ -70257,8 +70719,8 @@ "question__title": "Valid Phone Numbers", "question__title_slug": "valid-phone-numbers", "question__hide": false, - "total_acs": 43759, - "total_submitted": 130919, + "total_acs": 43996, + "total_submitted": 131610, "total_column_articles": 214, "frontend_question_id": "193", "is_new_question": false @@ -70278,8 +70740,8 @@ "question__title": "Word Frequency", "question__title_slug": "word-frequency", "question__hide": false, - "total_acs": 34256, - "total_submitted": 97112, + "total_acs": 34409, + "total_submitted": 97600, "total_column_articles": 253, "frontend_question_id": "192", "is_new_question": false @@ -70299,9 +70761,9 @@ "question__title": "Number of 1 Bits", "question__title_slug": "number-of-1-bits", "question__hide": false, - "total_acs": 378652, - "total_submitted": 489340, - "total_column_articles": 2253, + "total_acs": 381490, + "total_submitted": 492428, + "total_column_articles": 2261, "frontend_question_id": "191", "is_new_question": false }, @@ -70320,9 +70782,9 @@ "question__title": "Reverse Bits", "question__title_slug": "reverse-bits", "question__hide": false, - "total_acs": 243918, - "total_submitted": 335629, - "total_column_articles": 1448, + "total_acs": 245744, + "total_submitted": 337876, + "total_column_articles": 1453, "frontend_question_id": "190", "is_new_question": false }, @@ -70341,9 +70803,9 @@ "question__title": "Rotate Array", "question__title_slug": "rotate-array", "question__hide": false, - "total_acs": 882591, - "total_submitted": 1962712, - "total_column_articles": 4297, + "total_acs": 896137, + "total_submitted": 1988921, + "total_column_articles": 4353, "frontend_question_id": "189", "is_new_question": false }, @@ -70362,9 +70824,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": 258871, - "total_submitted": 519776, - "total_column_articles": 1655, + "total_acs": 262174, + "total_submitted": 524571, + "total_column_articles": 1664, "frontend_question_id": "188", "is_new_question": false }, @@ -70383,9 +70845,9 @@ "question__title": "Repeated DNA Sequences", "question__title_slug": "repeated-dna-sequences", "question__hide": false, - "total_acs": 172593, - "total_submitted": 314169, - "total_column_articles": 1158, + "total_acs": 173676, + "total_submitted": 315909, + "total_column_articles": 1163, "frontend_question_id": "187", "is_new_question": false }, @@ -70404,9 +70866,9 @@ "question__title": "Reverse Words in a String II", "question__title_slug": "reverse-words-in-a-string-ii", "question__hide": false, - "total_acs": 18727, - "total_submitted": 24574, - "total_column_articles": 230, + "total_acs": 19022, + "total_submitted": 24946, + "total_column_articles": 231, "frontend_question_id": "186", "is_new_question": false }, @@ -70425,9 +70887,9 @@ "question__title": "Department Top Three Salaries", "question__title_slug": "department-top-three-salaries", "question__hide": false, - "total_acs": 148416, - "total_submitted": 272737, - "total_column_articles": 1196, + "total_acs": 150186, + "total_submitted": 275466, + "total_column_articles": 1212, "frontend_question_id": "185", "is_new_question": false }, @@ -70446,9 +70908,9 @@ "question__title": "Department Highest Salary", "question__title_slug": "department-highest-salary", "question__hide": false, - "total_acs": 204096, - "total_submitted": 389541, - "total_column_articles": 1291, + "total_acs": 205599, + "total_submitted": 392034, + "total_column_articles": 1298, "frontend_question_id": "184", "is_new_question": false }, @@ -70467,9 +70929,9 @@ "question__title": "Customers Who Never Order", "question__title_slug": "customers-who-never-order", "question__hide": false, - "total_acs": 385914, - "total_submitted": 579829, - "total_column_articles": 1262, + "total_acs": 388312, + "total_submitted": 583118, + "total_column_articles": 1266, "frontend_question_id": "183", "is_new_question": false }, @@ -70488,9 +70950,9 @@ "question__title": "Duplicate Emails", "question__title_slug": "duplicate-emails", "question__hide": false, - "total_acs": 343521, - "total_submitted": 436388, - "total_column_articles": 1162, + "total_acs": 345776, + "total_submitted": 439217, + "total_column_articles": 1166, "frontend_question_id": "182", "is_new_question": false }, @@ -70509,9 +70971,9 @@ "question__title": "Employees Earning More Than Their Managers", "question__title_slug": "employees-earning-more-than-their-managers", "question__hide": false, - "total_acs": 320831, - "total_submitted": 466072, - "total_column_articles": 1237, + "total_acs": 323157, + "total_submitted": 469231, + "total_column_articles": 1243, "frontend_question_id": "181", "is_new_question": false }, @@ -70530,9 +70992,9 @@ "question__title": "Consecutive Numbers", "question__title_slug": "consecutive-numbers", "question__hide": false, - "total_acs": 184489, - "total_submitted": 395787, - "total_column_articles": 1078, + "total_acs": 186375, + "total_submitted": 402289, + "total_column_articles": 1090, "frontend_question_id": "180", "is_new_question": false }, @@ -70551,9 +71013,9 @@ "question__title": "Largest Number", "question__title_slug": "largest-number", "question__hide": false, - "total_acs": 229250, - "total_submitted": 558587, - "total_column_articles": 1575, + "total_acs": 230952, + "total_submitted": 562370, + "total_column_articles": 1579, "frontend_question_id": "179", "is_new_question": false }, @@ -70572,9 +71034,9 @@ "question__title": "Rank Scores", "question__title_slug": "rank-scores", "question__hide": false, - "total_acs": 234899, - "total_submitted": 378298, - "total_column_articles": 1116, + "total_acs": 236480, + "total_submitted": 380460, + "total_column_articles": 1118, "frontend_question_id": "178", "is_new_question": false }, @@ -70593,9 +71055,9 @@ "question__title": "Nth Highest Salary", "question__title_slug": "nth-highest-salary", "question__hide": false, - "total_acs": 238718, - "total_submitted": 515281, - "total_column_articles": 953, + "total_acs": 240027, + "total_submitted": 518327, + "total_column_articles": 962, "frontend_question_id": "177", "is_new_question": false }, @@ -70614,9 +71076,9 @@ "question__title": "Second Highest Salary", "question__title_slug": "second-highest-salary", "question__hide": false, - "total_acs": 472993, - "total_submitted": 1263970, - "total_column_articles": 1903, + "total_acs": 475971, + "total_submitted": 1270120, + "total_column_articles": 1915, "frontend_question_id": "176", "is_new_question": false }, @@ -70635,9 +71097,9 @@ "question__title": "Combine Two Tables", "question__title_slug": "combine-two-tables", "question__hide": false, - "total_acs": 568004, - "total_submitted": 762867, - "total_column_articles": 2345, + "total_acs": 571405, + "total_submitted": 767067, + "total_column_articles": 2353, "frontend_question_id": "175", "is_new_question": false }, @@ -70656,9 +71118,9 @@ "question__title": "Dungeon Game", "question__title_slug": "dungeon-game", "question__hide": false, - "total_acs": 73878, - "total_submitted": 152245, - "total_column_articles": 1491, + "total_acs": 74474, + "total_submitted": 153436, + "total_column_articles": 1494, "frontend_question_id": "174", "is_new_question": false }, @@ -70677,9 +71139,9 @@ "question__title": "Binary Search Tree Iterator", "question__title_slug": "binary-search-tree-iterator", "question__hide": false, - "total_acs": 136722, - "total_submitted": 166731, - "total_column_articles": 980, + "total_acs": 138073, + "total_submitted": 168333, + "total_column_articles": 986, "frontend_question_id": "173", "is_new_question": false }, @@ -70698,9 +71160,9 @@ "question__title": "Factorial Trailing Zeroes", "question__title_slug": "factorial-trailing-zeroes", "question__hide": false, - "total_acs": 197681, - "total_submitted": 392266, - "total_column_articles": 1200, + "total_acs": 199501, + "total_submitted": 395524, + "total_column_articles": 1208, "frontend_question_id": "172", "is_new_question": false }, @@ -70719,9 +71181,9 @@ "question__title": "Excel Sheet Column Number", "question__title_slug": "excel-sheet-column-number", "question__hide": false, - "total_acs": 183168, - "total_submitted": 256158, - "total_column_articles": 1465, + "total_acs": 183974, + "total_submitted": 257173, + "total_column_articles": 1471, "frontend_question_id": "171", "is_new_question": false }, @@ -70740,9 +71202,9 @@ "question__title": "Two Sum III - Data structure design", "question__title_slug": "two-sum-iii-data-structure-design", "question__hide": false, - "total_acs": 17970, - "total_submitted": 42133, - "total_column_articles": 166, + "total_acs": 18034, + "total_submitted": 42289, + "total_column_articles": 168, "frontend_question_id": "170", "is_new_question": false }, @@ -70761,9 +71223,9 @@ "question__title": "Majority Element", "question__title_slug": "majority-element", "question__hide": false, - "total_acs": 954149, - "total_submitted": 1438002, - "total_column_articles": 4697, + "total_acs": 967776, + "total_submitted": 1458137, + "total_column_articles": 4735, "frontend_question_id": "169", "is_new_question": false }, @@ -70782,9 +71244,9 @@ "question__title": "Excel Sheet Column Title", "question__title_slug": "excel-sheet-column-title", "question__hide": false, - "total_acs": 156215, - "total_submitted": 349561, - "total_column_articles": 1246, + "total_acs": 156968, + "total_submitted": 350923, + "total_column_articles": 1251, "frontend_question_id": "168", "is_new_question": false }, @@ -70803,9 +71265,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": 689973, - "total_submitted": 1147737, - "total_column_articles": 4197, + "total_acs": 695901, + "total_submitted": 1156993, + "total_column_articles": 4219, "frontend_question_id": "167", "is_new_question": false }, @@ -70824,8 +71286,8 @@ "question__title": "Fraction to Recurring Decimal", "question__title_slug": "fraction-to-recurring-decimal", "question__hide": false, - "total_acs": 70121, - "total_submitted": 209347, + "total_acs": 70363, + "total_submitted": 210015, "total_column_articles": 564, "frontend_question_id": "166", "is_new_question": false @@ -70845,9 +71307,9 @@ "question__title": "Compare Version Numbers", "question__title_slug": "compare-version-numbers", "question__hide": false, - "total_acs": 176031, - "total_submitted": 337164, - "total_column_articles": 1391, + "total_acs": 177665, + "total_submitted": 339745, + "total_column_articles": 1395, "frontend_question_id": "165", "is_new_question": false }, @@ -70866,9 +71328,9 @@ "question__title": "Maximum Gap", "question__title_slug": "maximum-gap", "question__hide": false, - "total_acs": 97127, - "total_submitted": 162030, - "total_column_articles": 719, + "total_acs": 97783, + "total_submitted": 163152, + "total_column_articles": 721, "frontend_question_id": "164", "is_new_question": false }, @@ -70887,9 +71349,9 @@ "question__title": "Missing Ranges", "question__title_slug": "missing-ranges", "question__hide": false, - "total_acs": 21825, - "total_submitted": 60609, - "total_column_articles": 305, + "total_acs": 22005, + "total_submitted": 61034, + "total_column_articles": 307, "frontend_question_id": "163", "is_new_question": false }, @@ -70908,9 +71370,9 @@ "question__title": "Find Peak Element", "question__title_slug": "find-peak-element", "question__hide": false, - "total_acs": 395390, - "total_submitted": 799096, - "total_column_articles": 2359, + "total_acs": 399730, + "total_submitted": 807587, + "total_column_articles": 2375, "frontend_question_id": "162", "is_new_question": false }, @@ -70929,9 +71391,9 @@ "question__title": "One Edit Distance", "question__title_slug": "one-edit-distance", "question__hide": false, - "total_acs": 17603, - "total_submitted": 51606, - "total_column_articles": 224, + "total_acs": 17816, + "total_submitted": 52181, + "total_column_articles": 225, "frontend_question_id": "161", "is_new_question": false }, @@ -70950,9 +71412,9 @@ "question__title": "Intersection of Two Linked Lists", "question__title_slug": "intersection-of-two-linked-lists", "question__hide": false, - "total_acs": 856109, - "total_submitted": 1318207, - "total_column_articles": 4444, + "total_acs": 866928, + "total_submitted": 1332627, + "total_column_articles": 4477, "frontend_question_id": "160", "is_new_question": false }, @@ -70971,9 +71433,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": 37625, - "total_submitted": 66901, - "total_column_articles": 376, + "total_acs": 37958, + "total_submitted": 67409, + "total_column_articles": 378, "frontend_question_id": "159", "is_new_question": false }, @@ -70992,8 +71454,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": 5425, - "total_submitted": 9032, + "total_acs": 5438, + "total_submitted": 9049, "total_column_articles": 110, "frontend_question_id": "158", "is_new_question": false @@ -71013,9 +71475,9 @@ "question__title": "Read N Characters Given Read4", "question__title_slug": "read-n-characters-given-read4", "question__hide": false, - "total_acs": 11048, - "total_submitted": 20198, - "total_column_articles": 141, + "total_acs": 11096, + "total_submitted": 20287, + "total_column_articles": 142, "frontend_question_id": "157", "is_new_question": false }, @@ -71034,8 +71496,8 @@ "question__title": "Binary Tree Upside Down", "question__title_slug": "binary-tree-upside-down", "question__hide": false, - "total_acs": 15799, - "total_submitted": 21521, + "total_acs": 15849, + "total_submitted": 21585, "total_column_articles": 254, "frontend_question_id": "156", "is_new_question": false @@ -71055,9 +71517,9 @@ "question__title": "Min Stack", "question__title_slug": "min-stack", "question__hide": false, - "total_acs": 585212, - "total_submitted": 978560, - "total_column_articles": 2905, + "total_acs": 591764, + "total_submitted": 988486, + "total_column_articles": 2916, "frontend_question_id": "155", "is_new_question": false }, @@ -71076,9 +71538,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": 192815, - "total_submitted": 370066, - "total_column_articles": 1391, + "total_acs": 193779, + "total_submitted": 372074, + "total_column_articles": 1396, "frontend_question_id": "154", "is_new_question": false }, @@ -71097,9 +71559,9 @@ "question__title": "Find Minimum in Rotated Sorted Array", "question__title_slug": "find-minimum-in-rotated-sorted-array", "question__hide": false, - "total_acs": 470350, - "total_submitted": 817507, - "total_column_articles": 2853, + "total_acs": 476932, + "total_submitted": 828165, + "total_column_articles": 2878, "frontend_question_id": "153", "is_new_question": false }, @@ -71118,9 +71580,9 @@ "question__title": "Maximum Product Subarray", "question__title_slug": "maximum-product-subarray", "question__hide": false, - "total_acs": 436275, - "total_submitted": 1010047, - "total_column_articles": 2389, + "total_acs": 440942, + "total_submitted": 1021878, + "total_column_articles": 2409, "frontend_question_id": "152", "is_new_question": false }, @@ -71139,9 +71601,9 @@ "question__title": "Reverse Words in a String", "question__title_slug": "reverse-words-in-a-string", "question__hide": false, - "total_acs": 570750, - "total_submitted": 1033233, - "total_column_articles": 3973, + "total_acs": 579505, + "total_submitted": 1045532, + "total_column_articles": 4012, "frontend_question_id": "151", "is_new_question": false }, @@ -71160,9 +71622,9 @@ "question__title": "Evaluate Reverse Polish Notation", "question__title_slug": "evaluate-reverse-polish-notation", "question__hide": false, - "total_acs": 373415, - "total_submitted": 687489, - "total_column_articles": 2361, + "total_acs": 378722, + "total_submitted": 695643, + "total_column_articles": 2375, "frontend_question_id": "150", "is_new_question": false }, @@ -71181,9 +71643,9 @@ "question__title": "Max Points on a Line", "question__title_slug": "max-points-on-a-line", "question__hide": false, - "total_acs": 93280, - "total_submitted": 230399, - "total_column_articles": 867, + "total_acs": 94183, + "total_submitted": 232159, + "total_column_articles": 868, "frontend_question_id": "149", "is_new_question": false }, @@ -71202,9 +71664,9 @@ "question__title": "Sort List", "question__title_slug": "sort-list", "question__hide": false, - "total_acs": 512392, - "total_submitted": 781053, - "total_column_articles": 2601, + "total_acs": 519592, + "total_submitted": 791447, + "total_column_articles": 2618, "frontend_question_id": "148", "is_new_question": false }, @@ -71223,9 +71685,9 @@ "question__title": "Insertion Sort List", "question__title_slug": "insertion-sort-list", "question__hide": false, - "total_acs": 166712, - "total_submitted": 239296, - "total_column_articles": 1196, + "total_acs": 167647, + "total_submitted": 240553, + "total_column_articles": 1199, "frontend_question_id": "147", "is_new_question": false }, @@ -71244,9 +71706,9 @@ "question__title": "LRU Cache", "question__title_slug": "lru-cache", "question__hide": false, - "total_acs": 640409, - "total_submitted": 1194832, - "total_column_articles": 4155, + "total_acs": 648836, + "total_submitted": 1209658, + "total_column_articles": 4175, "frontend_question_id": "146", "is_new_question": false }, @@ -71265,9 +71727,9 @@ "question__title": "Binary Tree Postorder Traversal", "question__title_slug": "binary-tree-postorder-traversal", "question__hide": false, - "total_acs": 779311, - "total_submitted": 1017590, - "total_column_articles": 3105, + "total_acs": 785978, + "total_submitted": 1025769, + "total_column_articles": 3118, "frontend_question_id": "145", "is_new_question": false }, @@ -71286,9 +71748,9 @@ "question__title": "Binary Tree Preorder Traversal", "question__title_slug": "binary-tree-preorder-traversal", "question__hide": false, - "total_acs": 1073808, - "total_submitted": 1493917, - "total_column_articles": 4078, + "total_acs": 1083439, + "total_submitted": 1506580, + "total_column_articles": 4099, "frontend_question_id": "144", "is_new_question": false }, @@ -71307,9 +71769,9 @@ "question__title": "Reorder List", "question__title_slug": "reorder-list", "question__hide": false, - "total_acs": 318267, - "total_submitted": 480518, - "total_column_articles": 2175, + "total_acs": 320961, + "total_submitted": 484135, + "total_column_articles": 2188, "frontend_question_id": "143", "is_new_question": false }, @@ -71328,9 +71790,9 @@ "question__title": "Linked List Cycle II", "question__title_slug": "linked-list-cycle-ii", "question__hide": false, - "total_acs": 897366, - "total_submitted": 1522918, - "total_column_articles": 4665, + "total_acs": 909011, + "total_submitted": 1539804, + "total_column_articles": 4695, "frontend_question_id": "142", "is_new_question": false }, @@ -71349,9 +71811,9 @@ "question__title": "Linked List Cycle", "question__title_slug": "linked-list-cycle", "question__hide": false, - "total_acs": 1250466, - "total_submitted": 2387463, - "total_column_articles": 5837, + "total_acs": 1264019, + "total_submitted": 2411234, + "total_column_articles": 5883, "frontend_question_id": "141", "is_new_question": false }, @@ -71370,9 +71832,9 @@ "question__title": "Word Break II", "question__title_slug": "word-break-ii", "question__hide": false, - "total_acs": 100323, - "total_submitted": 170263, - "total_column_articles": 1073, + "total_acs": 100953, + "total_submitted": 171037, + "total_column_articles": 1081, "frontend_question_id": "140", "is_new_question": false }, @@ -71391,9 +71853,9 @@ "question__title": "Word Break", "question__title_slug": "word-break", "question__hide": false, - "total_acs": 585433, - "total_submitted": 1054069, - "total_column_articles": 2957, + "total_acs": 594256, + "total_submitted": 1067885, + "total_column_articles": 2992, "frontend_question_id": "139", "is_new_question": false }, @@ -71412,9 +71874,9 @@ "question__title": "Copy List with Random Pointer", "question__title_slug": "copy-list-with-random-pointer", "question__hide": false, - "total_acs": 287342, - "total_submitted": 429656, - "total_column_articles": 1798, + "total_acs": 293269, + "total_submitted": 437764, + "total_column_articles": 1817, "frontend_question_id": "138", "is_new_question": false }, @@ -71433,9 +71895,9 @@ "question__title": "Single Number II", "question__title_slug": "single-number-ii", "question__hide": false, - "total_acs": 204142, - "total_submitted": 282403, - "total_column_articles": 1342, + "total_acs": 206258, + "total_submitted": 285279, + "total_column_articles": 1352, "frontend_question_id": "137", "is_new_question": false }, @@ -71454,9 +71916,9 @@ "question__title": "Single Number", "question__title_slug": "single-number", "question__hide": false, - "total_acs": 1079829, - "total_submitted": 1465884, - "total_column_articles": 4694, + "total_acs": 1087946, + "total_submitted": 1475270, + "total_column_articles": 4713, "frontend_question_id": "136", "is_new_question": false }, @@ -71475,9 +71937,9 @@ "question__title": "Candy", "question__title_slug": "candy", "question__hide": false, - "total_acs": 315257, - "total_submitted": 644796, - "total_column_articles": 2000, + "total_acs": 320193, + "total_submitted": 655174, + "total_column_articles": 2026, "frontend_question_id": "135", "is_new_question": false }, @@ -71496,9 +71958,9 @@ "question__title": "Gas Station", "question__title_slug": "gas-station", "question__hide": false, - "total_acs": 364411, - "total_submitted": 763536, - "total_column_articles": 2228, + "total_acs": 370541, + "total_submitted": 777925, + "total_column_articles": 2253, "frontend_question_id": "134", "is_new_question": false }, @@ -71517,9 +71979,9 @@ "question__title": "Clone Graph", "question__title_slug": "clone-graph", "question__hide": false, - "total_acs": 145704, - "total_submitted": 206260, - "total_column_articles": 921, + "total_acs": 147576, + "total_submitted": 208571, + "total_column_articles": 925, "frontend_question_id": "133", "is_new_question": false }, @@ -71538,9 +72000,9 @@ "question__title": "Palindrome Partitioning II", "question__title_slug": "palindrome-partitioning-ii", "question__hide": false, - "total_acs": 88195, - "total_submitted": 177087, - "total_column_articles": 668, + "total_acs": 88793, + "total_submitted": 178309, + "total_column_articles": 669, "frontend_question_id": "132", "is_new_question": false }, @@ -71559,9 +72021,9 @@ "question__title": "Palindrome Partitioning", "question__title_slug": "palindrome-partitioning", "question__hide": false, - "total_acs": 403215, - "total_submitted": 548350, - "total_column_articles": 2095, + "total_acs": 410142, + "total_submitted": 557597, + "total_column_articles": 2115, "frontend_question_id": "131", "is_new_question": false }, @@ -71580,9 +72042,9 @@ "question__title": "Surrounded Regions", "question__title_slug": "surrounded-regions", "question__hide": false, - "total_acs": 281914, - "total_submitted": 606923, - "total_column_articles": 2467, + "total_acs": 285177, + "total_submitted": 613207, + "total_column_articles": 2478, "frontend_question_id": "130", "is_new_question": false }, @@ -71601,9 +72063,9 @@ "question__title": "Sum Root to Leaf Numbers", "question__title_slug": "sum-root-to-leaf-numbers", "question__hide": false, - "total_acs": 267549, - "total_submitted": 379228, - "total_column_articles": 2017, + "total_acs": 270893, + "total_submitted": 383571, + "total_column_articles": 2034, "frontend_question_id": "129", "is_new_question": false }, @@ -71622,9 +72084,9 @@ "question__title": "Longest Consecutive Sequence", "question__title_slug": "longest-consecutive-sequence", "question__hide": false, - "total_acs": 642154, - "total_submitted": 1241104, - "total_column_articles": 3587, + "total_acs": 658356, + "total_submitted": 1273371, + "total_column_articles": 3647, "frontend_question_id": "128", "is_new_question": false }, @@ -71643,9 +72105,9 @@ "question__title": "Word Ladder", "question__title_slug": "word-ladder", "question__hide": false, - "total_acs": 216312, - "total_submitted": 443466, - "total_column_articles": 1156, + "total_acs": 218225, + "total_submitted": 447010, + "total_column_articles": 1163, "frontend_question_id": "127", "is_new_question": false }, @@ -71664,9 +72126,9 @@ "question__title": "Word Ladder II", "question__title_slug": "word-ladder-ii", "question__hide": false, - "total_acs": 59292, - "total_submitted": 160696, - "total_column_articles": 527, + "total_acs": 59556, + "total_submitted": 161536, + "total_column_articles": 529, "frontend_question_id": "126", "is_new_question": false }, @@ -71685,9 +72147,9 @@ "question__title": "Valid Palindrome", "question__title_slug": "valid-palindrome", "question__hide": false, - "total_acs": 595071, - "total_submitted": 1264181, - "total_column_articles": 3487, + "total_acs": 601608, + "total_submitted": 1276487, + "total_column_articles": 3513, "frontend_question_id": "125", "is_new_question": false }, @@ -71706,9 +72168,9 @@ "question__title": "Binary Tree Maximum Path Sum", "question__title_slug": "binary-tree-maximum-path-sum", "question__hide": false, - "total_acs": 411722, - "total_submitted": 903946, - "total_column_articles": 2300, + "total_acs": 417057, + "total_submitted": 915028, + "total_column_articles": 2308, "frontend_question_id": "124", "is_new_question": false }, @@ -71727,9 +72189,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": 338433, - "total_submitted": 558445, - "total_column_articles": 1767, + "total_acs": 342244, + "total_submitted": 564045, + "total_column_articles": 1780, "frontend_question_id": "123", "is_new_question": false }, @@ -71748,9 +72210,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": 1114209, - "total_submitted": 1514562, - "total_column_articles": 5812, + "total_acs": 1126320, + "total_submitted": 1529248, + "total_column_articles": 5872, "frontend_question_id": "122", "is_new_question": false }, @@ -71769,9 +72231,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": 1421992, - "total_submitted": 2461926, - "total_column_articles": 7391, + "total_acs": 1438217, + "total_submitted": 2488310, + "total_column_articles": 7436, "frontend_question_id": "121", "is_new_question": false }, @@ -71790,9 +72252,9 @@ "question__title": "Triangle", "question__title_slug": "triangle", "question__hide": false, - "total_acs": 350867, - "total_submitted": 510709, - "total_column_articles": 2707, + "total_acs": 354467, + "total_submitted": 515714, + "total_column_articles": 2725, "frontend_question_id": "120", "is_new_question": false }, @@ -71811,9 +72273,9 @@ "question__title": "Pascal's Triangle II", "question__title_slug": "pascals-triangle-ii", "question__hide": false, - "total_acs": 308806, - "total_submitted": 447449, - "total_column_articles": 2243, + "total_acs": 310437, + "total_submitted": 449647, + "total_column_articles": 2251, "frontend_question_id": "119", "is_new_question": false }, @@ -71832,9 +72294,9 @@ "question__title": "Pascal's Triangle", "question__title_slug": "pascals-triangle", "question__hide": false, - "total_acs": 517826, - "total_submitted": 681947, - "total_column_articles": 3651, + "total_acs": 523962, + "total_submitted": 689443, + "total_column_articles": 3684, "frontend_question_id": "118", "is_new_question": false }, @@ -71853,9 +72315,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": 257942, - "total_submitted": 372497, - "total_column_articles": 1685, + "total_acs": 261235, + "total_submitted": 376480, + "total_column_articles": 1699, "frontend_question_id": "117", "is_new_question": false }, @@ -71874,9 +72336,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": 408987, - "total_submitted": 557416, - "total_column_articles": 2890, + "total_acs": 411891, + "total_submitted": 560934, + "total_column_articles": 2903, "frontend_question_id": "116", "is_new_question": false }, @@ -71895,9 +72357,9 @@ "question__title": "Distinct Subsequences", "question__title_slug": "distinct-subsequences", "question__hide": false, - "total_acs": 178365, - "total_submitted": 343206, - "total_column_articles": 1434, + "total_acs": 180588, + "total_submitted": 347152, + "total_column_articles": 1443, "frontend_question_id": "115", "is_new_question": false }, @@ -71916,9 +72378,9 @@ "question__title": "Flatten Binary Tree to Linked List", "question__title_slug": "flatten-binary-tree-to-linked-list", "question__hide": false, - "total_acs": 469303, - "total_submitted": 636909, - "total_column_articles": 3418, + "total_acs": 476213, + "total_submitted": 645648, + "total_column_articles": 3448, "frontend_question_id": "114", "is_new_question": false }, @@ -71937,9 +72399,9 @@ "question__title": "Path Sum II", "question__title_slug": "path-sum-ii", "question__hide": false, - "total_acs": 409268, - "total_submitted": 647194, - "total_column_articles": 2453, + "total_acs": 412265, + "total_submitted": 651630, + "total_column_articles": 2468, "frontend_question_id": "113", "is_new_question": false }, @@ -71958,9 +72420,9 @@ "question__title": "Path Sum", "question__title_slug": "path-sum", "question__hide": false, - "total_acs": 680332, - "total_submitted": 1253506, - "total_column_articles": 3614, + "total_acs": 686973, + "total_submitted": 1264600, + "total_column_articles": 3635, "frontend_question_id": "112", "is_new_question": false }, @@ -71979,9 +72441,9 @@ "question__title": "Minimum Depth of Binary Tree", "question__title_slug": "minimum-depth-of-binary-tree", "question__hide": false, - "total_acs": 689203, - "total_submitted": 1275048, - "total_column_articles": 4325, + "total_acs": 695341, + "total_submitted": 1283831, + "total_column_articles": 4345, "frontend_question_id": "111", "is_new_question": false }, @@ -72000,9 +72462,9 @@ "question__title": "Balanced Binary Tree", "question__title_slug": "balanced-binary-tree", "question__hide": false, - "total_acs": 611970, - "total_submitted": 1047708, - "total_column_articles": 2949, + "total_acs": 617452, + "total_submitted": 1056219, + "total_column_articles": 2975, "frontend_question_id": "110", "is_new_question": false }, @@ -72021,9 +72483,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": 162110, - "total_submitted": 211569, - "total_column_articles": 1199, + "total_acs": 162874, + "total_submitted": 212523, + "total_column_articles": 1203, "frontend_question_id": "109", "is_new_question": false }, @@ -72042,9 +72504,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": 476626, - "total_submitted": 607215, - "total_column_articles": 2460, + "total_acs": 483664, + "total_submitted": 615449, + "total_column_articles": 2482, "frontend_question_id": "108", "is_new_question": false }, @@ -72063,9 +72525,9 @@ "question__title": "Binary Tree Level Order Traversal II", "question__title_slug": "binary-tree-level-order-traversal-ii", "question__hide": false, - "total_acs": 338933, - "total_submitted": 457857, - "total_column_articles": 2226, + "total_acs": 341868, + "total_submitted": 461354, + "total_column_articles": 2238, "frontend_question_id": "107", "is_new_question": false }, @@ -72084,9 +72546,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": 383341, - "total_submitted": 531006, - "total_column_articles": 2132, + "total_acs": 387930, + "total_submitted": 537094, + "total_column_articles": 2145, "frontend_question_id": "106", "is_new_question": false }, @@ -72105,9 +72567,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": 649371, - "total_submitted": 906633, - "total_column_articles": 3130, + "total_acs": 657487, + "total_submitted": 917524, + "total_column_articles": 3154, "frontend_question_id": "105", "is_new_question": false }, @@ -72126,9 +72588,9 @@ "question__title": "Maximum Depth of Binary Tree", "question__title_slug": "maximum-depth-of-binary-tree", "question__hide": false, - "total_acs": 1312442, - "total_submitted": 1692411, - "total_column_articles": 5989, + "total_acs": 1328374, + "total_submitted": 1711816, + "total_column_articles": 6028, "frontend_question_id": "104", "is_new_question": false }, @@ -72147,9 +72609,9 @@ "question__title": "Binary Tree Zigzag Level Order Traversal", "question__title_slug": "binary-tree-zigzag-level-order-traversal", "question__hide": false, - "total_acs": 377036, - "total_submitted": 639840, - "total_column_articles": 2785, + "total_acs": 380473, + "total_submitted": 645065, + "total_column_articles": 2799, "frontend_question_id": "103", "is_new_question": false }, @@ -72168,9 +72630,9 @@ "question__title": "Binary Tree Level Order Traversal", "question__title_slug": "binary-tree-level-order-traversal", "question__hide": false, - "total_acs": 1051179, - "total_submitted": 1562553, - "total_column_articles": 5232, + "total_acs": 1063738, + "total_submitted": 1578672, + "total_column_articles": 5261, "frontend_question_id": "102", "is_new_question": false }, @@ -72189,9 +72651,9 @@ "question__title": "Symmetric Tree", "question__title_slug": "symmetric-tree", "question__hide": false, - "total_acs": 1060502, - "total_submitted": 1760017, - "total_column_articles": 5044, + "total_acs": 1073266, + "total_submitted": 1778378, + "total_column_articles": 5083, "frontend_question_id": "101", "is_new_question": false }, @@ -72210,9 +72672,9 @@ "question__title": "Same Tree", "question__title_slug": "same-tree", "question__hide": false, - "total_acs": 570958, - "total_submitted": 929758, - "total_column_articles": 3552, + "total_acs": 577253, + "total_submitted": 938473, + "total_column_articles": 3568, "frontend_question_id": "100", "is_new_question": false }, @@ -72231,9 +72693,9 @@ "question__title": "Recover Binary Search Tree", "question__title_slug": "recover-binary-search-tree", "question__hide": false, - "total_acs": 153289, - "total_submitted": 252875, - "total_column_articles": 1192, + "total_acs": 154049, + "total_submitted": 253971, + "total_column_articles": 1198, "frontend_question_id": "99", "is_new_question": false }, @@ -72252,9 +72714,9 @@ "question__title": "Validate Binary Search Tree", "question__title_slug": "validate-binary-search-tree", "question__hide": false, - "total_acs": 912251, - "total_submitted": 2405691, - "total_column_articles": 4674, + "total_acs": 922911, + "total_submitted": 2429755, + "total_column_articles": 4702, "frontend_question_id": "98", "is_new_question": false }, @@ -72273,9 +72735,9 @@ "question__title": "Interleaving String", "question__title_slug": "interleaving-string", "question__hide": false, - "total_acs": 147011, - "total_submitted": 327788, - "total_column_articles": 1006, + "total_acs": 148992, + "total_submitted": 331851, + "total_column_articles": 1013, "frontend_question_id": "97", "is_new_question": false }, @@ -72294,9 +72756,9 @@ "question__title": "Unique Binary Search Trees", "question__title_slug": "unique-binary-search-trees", "question__hide": false, - "total_acs": 443268, - "total_submitted": 623444, - "total_column_articles": 2776, + "total_acs": 446704, + "total_submitted": 628091, + "total_column_articles": 2784, "frontend_question_id": "96", "is_new_question": false }, @@ -72315,9 +72777,9 @@ "question__title": "Unique Binary Search Trees II", "question__title_slug": "unique-binary-search-trees-ii", "question__hide": false, - "total_acs": 189749, - "total_submitted": 256610, - "total_column_articles": 1139, + "total_acs": 190681, + "total_submitted": 257799, + "total_column_articles": 1143, "frontend_question_id": "95", "is_new_question": false }, @@ -72336,9 +72798,9 @@ "question__title": "Binary Tree Inorder Traversal", "question__title_slug": "binary-tree-inorder-traversal", "question__hide": false, - "total_acs": 1457955, - "total_submitted": 1898589, - "total_column_articles": 4956, + "total_acs": 1473652, + "total_submitted": 1917537, + "total_column_articles": 4983, "frontend_question_id": "94", "is_new_question": false }, @@ -72357,9 +72819,9 @@ "question__title": "Restore IP Addresses", "question__title_slug": "restore-ip-addresses", "question__hide": false, - "total_acs": 421980, - "total_submitted": 709714, - "total_column_articles": 2848, + "total_acs": 426609, + "total_submitted": 716575, + "total_column_articles": 2865, "frontend_question_id": "93", "is_new_question": false }, @@ -72378,9 +72840,9 @@ "question__title": "Reverse Linked List II", "question__title_slug": "reverse-linked-list-ii", "question__hide": false, - "total_acs": 511274, - "total_submitted": 909654, - "total_column_articles": 4228, + "total_acs": 517377, + "total_submitted": 919609, + "total_column_articles": 4246, "frontend_question_id": "92", "is_new_question": false }, @@ -72399,9 +72861,9 @@ "question__title": "Decode Ways", "question__title_slug": "decode-ways", "question__hide": false, - "total_acs": 303914, - "total_submitted": 902206, - "total_column_articles": 2475, + "total_acs": 305762, + "total_submitted": 906410, + "total_column_articles": 2487, "frontend_question_id": "91", "is_new_question": false }, @@ -72420,9 +72882,9 @@ "question__title": "Subsets II", "question__title_slug": "subsets-ii", "question__hide": false, - "total_acs": 370907, - "total_submitted": 585120, - "total_column_articles": 2537, + "total_acs": 374401, + "total_submitted": 590599, + "total_column_articles": 2552, "frontend_question_id": "90", "is_new_question": false }, @@ -72441,9 +72903,9 @@ "question__title": "Gray Code", "question__title_slug": "gray-code", "question__hide": false, - "total_acs": 128930, - "total_submitted": 170980, - "total_column_articles": 953, + "total_acs": 129511, + "total_submitted": 171713, + "total_column_articles": 955, "frontend_question_id": "89", "is_new_question": false }, @@ -72462,9 +72924,9 @@ "question__title": "Merge Sorted Array", "question__title_slug": "merge-sorted-array", "question__hide": false, - "total_acs": 1272318, - "total_submitted": 2375461, - "total_column_articles": 7830, + "total_acs": 1288831, + "total_submitted": 2403235, + "total_column_articles": 7895, "frontend_question_id": "88", "is_new_question": false }, @@ -72483,9 +72945,9 @@ "question__title": "Scramble String", "question__title_slug": "scramble-string", "question__hide": false, - "total_acs": 63293, - "total_submitted": 134505, - "total_column_articles": 479, + "total_acs": 63594, + "total_submitted": 135216, + "total_column_articles": 481, "frontend_question_id": "87", "is_new_question": false }, @@ -72504,9 +72966,9 @@ "question__title": "Partition List", "question__title_slug": "partition-list", "question__hide": false, - "total_acs": 281359, - "total_submitted": 435252, - "total_column_articles": 2467, + "total_acs": 284804, + "total_submitted": 440130, + "total_column_articles": 2486, "frontend_question_id": "86", "is_new_question": false }, @@ -72525,9 +72987,9 @@ "question__title": "Maximal Rectangle", "question__title_slug": "maximal-rectangle", "question__hide": false, - "total_acs": 197039, - "total_submitted": 357402, - "total_column_articles": 1289, + "total_acs": 197993, + "total_submitted": 358968, + "total_column_articles": 1293, "frontend_question_id": "85", "is_new_question": false }, @@ -72546,9 +73008,9 @@ "question__title": "Largest Rectangle in Histogram", "question__title_slug": "largest-rectangle-in-histogram", "question__hide": false, - "total_acs": 417028, - "total_submitted": 911391, - "total_column_articles": 2281, + "total_acs": 421425, + "total_submitted": 919987, + "total_column_articles": 2293, "frontend_question_id": "84", "is_new_question": false }, @@ -72567,9 +73029,9 @@ "question__title": "Remove Duplicates from Sorted List", "question__title_slug": "remove-duplicates-from-sorted-list", "question__hide": false, - "total_acs": 695369, - "total_submitted": 1291411, - "total_column_articles": 4098, + "total_acs": 699834, + "total_submitted": 1298779, + "total_column_articles": 4111, "frontend_question_id": "83", "is_new_question": false }, @@ -72588,9 +73050,9 @@ "question__title": "Remove Duplicates from Sorted List II", "question__title_slug": "remove-duplicates-from-sorted-list-ii", "question__hide": false, - "total_acs": 439875, - "total_submitted": 809441, - "total_column_articles": 3270, + "total_acs": 444488, + "total_submitted": 817396, + "total_column_articles": 3286, "frontend_question_id": "82", "is_new_question": false }, @@ -72609,9 +73071,9 @@ "question__title": "Search in Rotated Sorted Array II", "question__title_slug": "search-in-rotated-sorted-array-ii", "question__hide": false, - "total_acs": 221135, - "total_submitted": 538827, - "total_column_articles": 1577, + "total_acs": 222179, + "total_submitted": 541277, + "total_column_articles": 1582, "frontend_question_id": "81", "is_new_question": false }, @@ -72630,9 +73092,9 @@ "question__title": "Remove Duplicates from Sorted Array II", "question__title_slug": "remove-duplicates-from-sorted-array-ii", "question__hide": false, - "total_acs": 397604, - "total_submitted": 644038, - "total_column_articles": 2931, + "total_acs": 406074, + "total_submitted": 656966, + "total_column_articles": 2969, "frontend_question_id": "80", "is_new_question": false }, @@ -72651,9 +73113,9 @@ "question__title": "Word Search", "question__title_slug": "word-search", "question__hide": false, - "total_acs": 525486, - "total_submitted": 1119275, - "total_column_articles": 2988, + "total_acs": 531681, + "total_submitted": 1130854, + "total_column_articles": 3003, "frontend_question_id": "79", "is_new_question": false }, @@ -72672,9 +73134,9 @@ "question__title": "Subsets", "question__title_slug": "subsets", "question__hide": false, - "total_acs": 789160, - "total_submitted": 970897, - "total_column_articles": 4820, + "total_acs": 798347, + "total_submitted": 981688, + "total_column_articles": 4850, "frontend_question_id": "78", "is_new_question": false }, @@ -72693,9 +73155,9 @@ "question__title": "Combinations", "question__title_slug": "combinations", "question__hide": false, - "total_acs": 712122, - "total_submitted": 925441, - "total_column_articles": 3330, + "total_acs": 720700, + "total_submitted": 936100, + "total_column_articles": 3351, "frontend_question_id": "77", "is_new_question": false }, @@ -72714,9 +73176,9 @@ "question__title": "Minimum Window Substring", "question__title_slug": "minimum-window-substring", "question__hide": false, - "total_acs": 570248, - "total_submitted": 1246986, - "total_column_articles": 4110, + "total_acs": 579219, + "total_submitted": 1264475, + "total_column_articles": 4140, "frontend_question_id": "76", "is_new_question": false }, @@ -72735,9 +73197,9 @@ "question__title": "Sort Colors", "question__title_slug": "sort-colors", "question__hide": false, - "total_acs": 635847, - "total_submitted": 1038587, - "total_column_articles": 4031, + "total_acs": 641730, + "total_submitted": 1046979, + "total_column_articles": 4062, "frontend_question_id": "75", "is_new_question": false }, @@ -72756,9 +73218,9 @@ "question__title": "Search a 2D Matrix", "question__title_slug": "search-a-2d-matrix", "question__hide": false, - "total_acs": 405784, - "total_submitted": 817285, - "total_column_articles": 3390, + "total_acs": 412183, + "total_submitted": 828587, + "total_column_articles": 3419, "frontend_question_id": "74", "is_new_question": false }, @@ -72777,9 +73239,9 @@ "question__title": "Set Matrix Zeroes", "question__title_slug": "set-matrix-zeroes", "question__hide": false, - "total_acs": 366708, - "total_submitted": 550500, - "total_column_articles": 2296, + "total_acs": 374258, + "total_submitted": 559869, + "total_column_articles": 2328, "frontend_question_id": "73", "is_new_question": false }, @@ -72798,9 +73260,9 @@ "question__title": "Edit Distance", "question__title_slug": "edit-distance", "question__hide": false, - "total_acs": 484586, - "total_submitted": 771090, - "total_column_articles": 3481, + "total_acs": 491659, + "total_submitted": 782118, + "total_column_articles": 3497, "frontend_question_id": "72", "is_new_question": false }, @@ -72819,9 +73281,9 @@ "question__title": "Simplify Path", "question__title_slug": "simplify-path", "question__hide": false, - "total_acs": 232580, - "total_submitted": 516698, - "total_column_articles": 1890, + "total_acs": 235529, + "total_submitted": 521723, + "total_column_articles": 1905, "frontend_question_id": "71", "is_new_question": false }, @@ -72840,9 +73302,9 @@ "question__title": "Climbing Stairs", "question__title_slug": "climbing-stairs", "question__hide": false, - "total_acs": 1476128, - "total_submitted": 2705611, - "total_column_articles": 7390, + "total_acs": 1492098, + "total_submitted": 2733128, + "total_column_articles": 7424, "frontend_question_id": "70", "is_new_question": false }, @@ -72861,9 +73323,9 @@ "question__title": "Sqrt(x)", "question__title_slug": "sqrtx", "question__hide": false, - "total_acs": 902815, - "total_submitted": 2343124, - "total_column_articles": 4390, + "total_acs": 910792, + "total_submitted": 2363200, + "total_column_articles": 4423, "frontend_question_id": "69", "is_new_question": false }, @@ -72882,9 +73344,9 @@ "question__title": "Text Justification", "question__title_slug": "text-justification", "question__hide": false, - "total_acs": 78060, - "total_submitted": 144878, - "total_column_articles": 1025, + "total_acs": 79423, + "total_submitted": 147088, + "total_column_articles": 1036, "frontend_question_id": "68", "is_new_question": false }, @@ -72903,9 +73365,9 @@ "question__title": "Add Binary", "question__title_slug": "add-binary", "question__hide": false, - "total_acs": 396091, - "total_submitted": 746504, - "total_column_articles": 3436, + "total_acs": 399578, + "total_submitted": 752252, + "total_column_articles": 3461, "frontend_question_id": "67", "is_new_question": false }, @@ -72924,9 +73386,9 @@ "question__title": "Plus One", "question__title_slug": "plus-one", "question__hide": false, - "total_acs": 742679, - "total_submitted": 1622998, - "total_column_articles": 6530, + "total_acs": 747588, + "total_submitted": 1631680, + "total_column_articles": 6570, "frontend_question_id": "66", "is_new_question": false }, @@ -72945,9 +73407,9 @@ "question__title": "Valid Number", "question__title_slug": "valid-number", "question__hide": false, - "total_acs": 72843, - "total_submitted": 263248, - "total_column_articles": 987, + "total_acs": 73159, + "total_submitted": 264224, + "total_column_articles": 990, "frontend_question_id": "65", "is_new_question": false }, @@ -72966,9 +73428,9 @@ "question__title": "Minimum Path Sum", "question__title_slug": "minimum-path-sum", "question__hide": false, - "total_acs": 603298, - "total_submitted": 857439, - "total_column_articles": 3848, + "total_acs": 610475, + "total_submitted": 866669, + "total_column_articles": 3867, "frontend_question_id": "64", "is_new_question": false }, @@ -72987,9 +73449,9 @@ "question__title": "Unique Paths II", "question__title_slug": "unique-paths-ii", "question__hide": false, - "total_acs": 489460, - "total_submitted": 1183888, - "total_column_articles": 3527, + "total_acs": 495628, + "total_submitted": 1197539, + "total_column_articles": 3556, "frontend_question_id": "63", "is_new_question": false }, @@ -73008,9 +73470,9 @@ "question__title": "Unique Paths", "question__title_slug": "unique-paths", "question__hide": false, - "total_acs": 787942, - "total_submitted": 1154734, - "total_column_articles": 4869, + "total_acs": 796813, + "total_submitted": 1166780, + "total_column_articles": 4900, "frontend_question_id": "62", "is_new_question": false }, @@ -73029,9 +73491,9 @@ "question__title": "Rotate List", "question__title_slug": "rotate-list", "question__hide": false, - "total_acs": 381971, - "total_submitted": 924028, - "total_column_articles": 3454, + "total_acs": 385968, + "total_submitted": 933558, + "total_column_articles": 3480, "frontend_question_id": "61", "is_new_question": false }, @@ -73050,9 +73512,9 @@ "question__title": "Permutation Sequence", "question__title_slug": "permutation-sequence", "question__hide": false, - "total_acs": 141624, - "total_submitted": 263674, - "total_column_articles": 1556, + "total_acs": 142314, + "total_submitted": 264800, + "total_column_articles": 1563, "frontend_question_id": "60", "is_new_question": false }, @@ -73071,9 +73533,9 @@ "question__title": "Spiral Matrix II", "question__title_slug": "spiral-matrix-ii", "question__hide": false, - "total_acs": 425551, - "total_submitted": 600288, - "total_column_articles": 4146, + "total_acs": 430576, + "total_submitted": 607564, + "total_column_articles": 4182, "frontend_question_id": "59", "is_new_question": false }, @@ -73092,9 +73554,9 @@ "question__title": "Length of Last Word", "question__title_slug": "length-of-last-word", "question__hide": false, - "total_acs": 572448, - "total_submitted": 1254976, - "total_column_articles": 5620, + "total_acs": 579158, + "total_submitted": 1265802, + "total_column_articles": 5680, "frontend_question_id": "58", "is_new_question": false }, @@ -73113,9 +73575,9 @@ "question__title": "Insert Interval", "question__title_slug": "insert-interval", "question__hide": false, - "total_acs": 209472, - "total_submitted": 491523, - "total_column_articles": 1760, + "total_acs": 212271, + "total_submitted": 497962, + "total_column_articles": 1775, "frontend_question_id": "57", "is_new_question": false }, @@ -73134,9 +73596,9 @@ "question__title": "Merge Intervals", "question__title_slug": "merge-intervals", "question__hide": false, - "total_acs": 863597, - "total_submitted": 1727409, - "total_column_articles": 5094, + "total_acs": 876525, + "total_submitted": 1750859, + "total_column_articles": 5141, "frontend_question_id": "56", "is_new_question": false }, @@ -73155,9 +73617,9 @@ "question__title": "Jump Game", "question__title_slug": "jump-game", "question__hide": false, - "total_acs": 957209, - "total_submitted": 2210496, - "total_column_articles": 6136, + "total_acs": 970797, + "total_submitted": 2241212, + "total_column_articles": 6198, "frontend_question_id": "55", "is_new_question": false }, @@ -73176,9 +73638,9 @@ "question__title": "Spiral Matrix", "question__title_slug": "spiral-matrix", "question__hide": false, - "total_acs": 521706, - "total_submitted": 1026405, - "total_column_articles": 4946, + "total_acs": 531101, + "total_submitted": 1042261, + "total_column_articles": 4998, "frontend_question_id": "54", "is_new_question": false }, @@ -73197,9 +73659,9 @@ "question__title": "Maximum Subarray", "question__title_slug": "maximum-subarray", "question__hide": false, - "total_acs": 1726392, - "total_submitted": 3120563, - "total_column_articles": 7912, + "total_acs": 1743364, + "total_submitted": 3148915, + "total_column_articles": 7962, "frontend_question_id": "53", "is_new_question": false }, @@ -73218,9 +73680,9 @@ "question__title": "N-Queens II", "question__title_slug": "n-queens-ii", "question__hide": false, - "total_acs": 149236, - "total_submitted": 181413, - "total_column_articles": 1052, + "total_acs": 151160, + "total_submitted": 183776, + "total_column_articles": 1058, "frontend_question_id": "52", "is_new_question": false }, @@ -73239,9 +73701,9 @@ "question__title": "N-Queens", "question__title_slug": "n-queens", "question__hide": false, - "total_acs": 400244, - "total_submitted": 541370, - "total_column_articles": 3489, + "total_acs": 405579, + "total_submitted": 548097, + "total_column_articles": 3515, "frontend_question_id": "51", "is_new_question": false }, @@ -73260,9 +73722,9 @@ "question__title": "Pow(x, n)", "question__title_slug": "powx-n", "question__hide": false, - "total_acs": 450846, - "total_submitted": 1177888, - "total_column_articles": 2401, + "total_acs": 454425, + "total_submitted": 1186323, + "total_column_articles": 2408, "frontend_question_id": "50", "is_new_question": false }, @@ -73281,9 +73743,9 @@ "question__title": "Group Anagrams", "question__title_slug": "group-anagrams", "question__hide": false, - "total_acs": 708976, - "total_submitted": 1041802, - "total_column_articles": 3486, + "total_acs": 724515, + "total_submitted": 1063173, + "total_column_articles": 3527, "frontend_question_id": "49", "is_new_question": false }, @@ -73302,9 +73764,9 @@ "question__title": "Rotate Image", "question__title_slug": "rotate-image", "question__hide": false, - "total_acs": 578951, - "total_submitted": 760385, - "total_column_articles": 5231, + "total_acs": 586596, + "total_submitted": 769161, + "total_column_articles": 5270, "frontend_question_id": "48", "is_new_question": false }, @@ -73323,9 +73785,9 @@ "question__title": "Permutations II", "question__title_slug": "permutations-ii", "question__hide": false, - "total_acs": 554699, - "total_submitted": 843770, - "total_column_articles": 3200, + "total_acs": 559298, + "total_submitted": 850245, + "total_column_articles": 3216, "frontend_question_id": "47", "is_new_question": false }, @@ -73344,9 +73806,9 @@ "question__title": "Permutations", "question__title_slug": "permutations", "question__hide": false, - "total_acs": 1080960, - "total_submitted": 1364797, - "total_column_articles": 6485, + "total_acs": 1092863, + "total_submitted": 1378934, + "total_column_articles": 6524, "frontend_question_id": "46", "is_new_question": false }, @@ -73365,9 +73827,9 @@ "question__title": "Jump Game II", "question__title_slug": "jump-game-ii", "question__hide": false, - "total_acs": 704302, - "total_submitted": 1585763, - "total_column_articles": 4264, + "total_acs": 716340, + "total_submitted": 1612749, + "total_column_articles": 4320, "frontend_question_id": "45", "is_new_question": false }, @@ -73386,9 +73848,9 @@ "question__title": "Wildcard Matching", "question__title_slug": "wildcard-matching", "question__hide": false, - "total_acs": 156256, - "total_submitted": 459341, - "total_column_articles": 982, + "total_acs": 157137, + "total_submitted": 461865, + "total_column_articles": 985, "frontend_question_id": "44", "is_new_question": false }, @@ -73407,9 +73869,9 @@ "question__title": "Multiply Strings", "question__title_slug": "multiply-strings", "question__hide": false, - "total_acs": 343133, - "total_submitted": 774046, - "total_column_articles": 2281, + "total_acs": 345129, + "total_submitted": 778483, + "total_column_articles": 2289, "frontend_question_id": "43", "is_new_question": false }, @@ -73428,9 +73890,9 @@ "question__title": "Trapping Rain Water", "question__title_slug": "trapping-rain-water", "question__hide": false, - "total_acs": 960027, - "total_submitted": 1511173, - "total_column_articles": 5599, + "total_acs": 974868, + "total_submitted": 1532340, + "total_column_articles": 5655, "frontend_question_id": "42", "is_new_question": false }, @@ -73449,9 +73911,9 @@ "question__title": "First Missing Positive", "question__title_slug": "first-missing-positive", "question__hide": false, - "total_acs": 390538, - "total_submitted": 874861, - "total_column_articles": 2664, + "total_acs": 396790, + "total_submitted": 886264, + "total_column_articles": 2682, "frontend_question_id": "41", "is_new_question": false }, @@ -73470,9 +73932,9 @@ "question__title": "Combination Sum II", "question__title_slug": "combination-sum-ii", "question__hide": false, - "total_acs": 528108, - "total_submitted": 888545, - "total_column_articles": 3107, + "total_acs": 532892, + "total_submitted": 896424, + "total_column_articles": 3117, "frontend_question_id": "40", "is_new_question": false }, @@ -73491,9 +73953,9 @@ "question__title": "Combination Sum", "question__title_slug": "combination-sum", "question__hide": false, - "total_acs": 944226, - "total_submitted": 1298622, - "total_column_articles": 4587, + "total_acs": 955299, + "total_submitted": 1312882, + "total_column_articles": 4611, "frontend_question_id": "39", "is_new_question": false }, @@ -73512,9 +73974,9 @@ "question__title": "Count and Say", "question__title_slug": "count-and-say", "question__hide": false, - "total_acs": 367552, - "total_submitted": 604398, - "total_column_articles": 3464, + "total_acs": 368826, + "total_submitted": 606072, + "total_column_articles": 3473, "frontend_question_id": "38", "is_new_question": false }, @@ -73533,9 +73995,9 @@ "question__title": "Sudoku Solver", "question__title_slug": "sudoku-solver", "question__hide": false, - "total_acs": 249546, - "total_submitted": 368306, - "total_column_articles": 1798, + "total_acs": 251925, + "total_submitted": 371622, + "total_column_articles": 1807, "frontend_question_id": "37", "is_new_question": false }, @@ -73554,9 +74016,9 @@ "question__title": "Valid Sudoku", "question__title_slug": "valid-sudoku", "question__hide": false, - "total_acs": 438734, - "total_submitted": 692130, - "total_column_articles": 2978, + "total_acs": 442111, + "total_submitted": 696938, + "total_column_articles": 2991, "frontend_question_id": "36", "is_new_question": false }, @@ -73575,9 +74037,9 @@ "question__title": "Search Insert Position", "question__title_slug": "search-insert-position", "question__hide": false, - "total_acs": 1438834, - "total_submitted": 3107974, - "total_column_articles": 8660, + "total_acs": 1453532, + "total_submitted": 3133841, + "total_column_articles": 8715, "frontend_question_id": "35", "is_new_question": false }, @@ -73596,9 +74058,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": 988311, - "total_submitted": 2274852, - "total_column_articles": 8548, + "total_acs": 999468, + "total_submitted": 2295861, + "total_column_articles": 8609, "frontend_question_id": "34", "is_new_question": false }, @@ -73617,9 +74079,9 @@ "question__title": "Search in Rotated Sorted Array", "question__title_slug": "search-in-rotated-sorted-array", "question__hide": false, - "total_acs": 886093, - "total_submitted": 2000742, - "total_column_articles": 5279, + "total_acs": 894809, + "total_submitted": 2018313, + "total_column_articles": 5320, "frontend_question_id": "33", "is_new_question": false }, @@ -73638,9 +74100,9 @@ "question__title": "Longest Valid Parentheses", "question__title_slug": "longest-valid-parentheses", "question__hide": false, - "total_acs": 449395, - "total_submitted": 1183721, - "total_column_articles": 2607, + "total_acs": 453836, + "total_submitted": 1193637, + "total_column_articles": 2627, "frontend_question_id": "32", "is_new_question": false }, @@ -73659,9 +74121,9 @@ "question__title": "Next Permutation", "question__title_slug": "next-permutation", "question__hide": false, - "total_acs": 517023, - "total_submitted": 1315529, - "total_column_articles": 3596, + "total_acs": 522099, + "total_submitted": 1325868, + "total_column_articles": 3618, "frontend_question_id": "31", "is_new_question": false }, @@ -73680,9 +74142,9 @@ "question__title": "Substring with Concatenation of All Words", "question__title_slug": "substring-with-concatenation-of-all-words", "question__hide": false, - "total_acs": 205622, - "total_submitted": 527589, - "total_column_articles": 1538, + "total_acs": 208086, + "total_submitted": 534069, + "total_column_articles": 1548, "frontend_question_id": "30", "is_new_question": false }, @@ -73701,9 +74163,9 @@ "question__title": "Divide Two Integers", "question__title_slug": "divide-two-integers", "question__hide": false, - "total_acs": 237533, - "total_submitted": 1065213, - "total_column_articles": 1751, + "total_acs": 238718, + "total_submitted": 1069940, + "total_column_articles": 1759, "frontend_question_id": "29", "is_new_question": false }, @@ -73722,9 +74184,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": 1070084, - "total_submitted": 2449821, - "total_column_articles": 7198, + "total_acs": 1080441, + "total_submitted": 2470144, + "total_column_articles": 7252, "frontend_question_id": "28", "is_new_question": false }, @@ -73743,9 +74205,9 @@ "question__title": "Remove Element", "question__title_slug": "remove-element", "question__hide": false, - "total_acs": 1521121, - "total_submitted": 2553044, - "total_column_articles": 10195, + "total_acs": 1541743, + "total_submitted": 2585231, + "total_column_articles": 10274, "frontend_question_id": "27", "is_new_question": false }, @@ -73764,9 +74226,9 @@ "question__title": "Remove Duplicates from Sorted Array", "question__title_slug": "remove-duplicates-from-sorted-array", "question__hide": false, - "total_acs": 1866302, - "total_submitted": 3311132, - "total_column_articles": 10243, + "total_acs": 1883840, + "total_submitted": 3336635, + "total_column_articles": 10336, "frontend_question_id": "26", "is_new_question": false }, @@ -73785,9 +74247,9 @@ "question__title": "Reverse Nodes in k-Group", "question__title_slug": "reverse-nodes-in-k-group", "question__hide": false, - "total_acs": 601675, - "total_submitted": 885594, - "total_column_articles": 4675, + "total_acs": 609732, + "total_submitted": 896560, + "total_column_articles": 4714, "frontend_question_id": "25", "is_new_question": false }, @@ -73806,9 +74268,9 @@ "question__title": "Swap Nodes in Pairs", "question__title_slug": "swap-nodes-in-pairs", "question__hide": false, - "total_acs": 851952, - "total_submitted": 1179170, - "total_column_articles": 5523, + "total_acs": 863075, + "total_submitted": 1193132, + "total_column_articles": 5566, "frontend_question_id": "24", "is_new_question": false }, @@ -73827,9 +74289,9 @@ "question__title": "Merge k Sorted Lists", "question__title_slug": "merge-k-sorted-lists", "question__hide": false, - "total_acs": 807607, - "total_submitted": 1355710, - "total_column_articles": 4956, + "total_acs": 815422, + "total_submitted": 1366264, + "total_column_articles": 4980, "frontend_question_id": "23", "is_new_question": false }, @@ -73848,9 +74310,9 @@ "question__title": "Generate Parentheses", "question__title_slug": "generate-parentheses", "question__hide": false, - "total_acs": 843225, - "total_submitted": 1085418, - "total_column_articles": 5383, + "total_acs": 851561, + "total_submitted": 1095531, + "total_column_articles": 5419, "frontend_question_id": "22", "is_new_question": false }, @@ -73869,9 +74331,9 @@ "question__title": "Merge Two Sorted Lists", "question__title_slug": "merge-two-sorted-lists", "question__hide": false, - "total_acs": 1708197, - "total_submitted": 2568052, - "total_column_articles": 8292, + "total_acs": 1723905, + "total_submitted": 2588983, + "total_column_articles": 8329, "frontend_question_id": "21", "is_new_question": false }, @@ -73890,9 +74352,9 @@ "question__title": "Valid Parentheses", "question__title_slug": "valid-parentheses", "question__hide": false, - "total_acs": 1815342, - "total_submitted": 4129392, - "total_column_articles": 11069, + "total_acs": 1832163, + "total_submitted": 4165671, + "total_column_articles": 11121, "frontend_question_id": "20", "is_new_question": false }, @@ -73911,9 +74373,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": 1420919, - "total_submitted": 2953557, - "total_column_articles": 9178, + "total_acs": 1436018, + "total_submitted": 2975316, + "total_column_articles": 9236, "frontend_question_id": "19", "is_new_question": false }, @@ -73932,9 +74394,9 @@ "question__title": "4Sum", "question__title_slug": "4sum", "question__hide": false, - "total_acs": 586608, - "total_submitted": 1603129, - "total_column_articles": 3392, + "total_acs": 592208, + "total_submitted": 1617893, + "total_column_articles": 3413, "frontend_question_id": "18", "is_new_question": false }, @@ -73953,9 +74415,9 @@ "question__title": "Letter Combinations of a Phone Number", "question__title_slug": "letter-combinations-of-a-phone-number", "question__hide": false, - "total_acs": 877597, - "total_submitted": 1471504, - "total_column_articles": 6360, + "total_acs": 887778, + "total_submitted": 1485401, + "total_column_articles": 6401, "frontend_question_id": "17", "is_new_question": false }, @@ -73974,9 +74436,9 @@ "question__title": "3Sum Closest", "question__title_slug": "3sum-closest", "question__hide": false, - "total_acs": 560849, - "total_submitted": 1252574, - "total_column_articles": 2866, + "total_acs": 564538, + "total_submitted": 1260591, + "total_column_articles": 2881, "frontend_question_id": "16", "is_new_question": false }, @@ -73995,9 +74457,9 @@ "question__title": "3Sum", "question__title_slug": "3sum", "question__hide": false, - "total_acs": 1794891, - "total_submitted": 4729443, - "total_column_articles": 7218, + "total_acs": 1817419, + "total_submitted": 4780737, + "total_column_articles": 7279, "frontend_question_id": "15", "is_new_question": false }, @@ -74016,9 +74478,9 @@ "question__title": "Longest Common Prefix", "question__title_slug": "longest-common-prefix", "question__hide": false, - "total_acs": 1308839, - "total_submitted": 2973757, - "total_column_articles": 7759, + "total_acs": 1319111, + "total_submitted": 2993790, + "total_column_articles": 7810, "frontend_question_id": "14", "is_new_question": false }, @@ -74037,9 +74499,9 @@ "question__title": "Roman to Integer", "question__title_slug": "roman-to-integer", "question__hide": false, - "total_acs": 1010292, - "total_submitted": 1607468, - "total_column_articles": 7798, + "total_acs": 1018641, + "total_submitted": 1618807, + "total_column_articles": 7854, "frontend_question_id": "13", "is_new_question": false }, @@ -74058,9 +74520,9 @@ "question__title": "Integer to Roman", "question__title_slug": "integer-to-roman", "question__hide": false, - "total_acs": 476380, - "total_submitted": 710057, - "total_column_articles": 3523, + "total_acs": 480768, + "total_submitted": 715480, + "total_column_articles": 3539, "frontend_question_id": "12", "is_new_question": false }, @@ -74079,9 +74541,9 @@ "question__title": "Container With Most Water", "question__title_slug": "container-with-most-water", "question__hide": false, - "total_acs": 1290935, - "total_submitted": 2146044, - "total_column_articles": 6665, + "total_acs": 1307776, + "total_submitted": 2172372, + "total_column_articles": 6728, "frontend_question_id": "11", "is_new_question": false }, @@ -74100,9 +74562,9 @@ "question__title": "Regular Expression Matching", "question__title_slug": "regular-expression-matching", "question__hide": false, - "total_acs": 419089, - "total_submitted": 1365035, - "total_column_articles": 2414, + "total_acs": 421214, + "total_submitted": 1372215, + "total_column_articles": 2426, "frontend_question_id": "10", "is_new_question": false }, @@ -74121,9 +74583,9 @@ "question__title": "Palindrome Number", "question__title_slug": "palindrome-number", "question__hide": false, - "total_acs": 1617495, - "total_submitted": 2887372, - "total_column_articles": 9468, + "total_acs": 1628362, + "total_submitted": 2904880, + "total_column_articles": 9514, "frontend_question_id": "9", "is_new_question": false }, @@ -74142,9 +74604,9 @@ "question__title": "String to Integer (atoi)", "question__title_slug": "string-to-integer-atoi", "question__hide": false, - "total_acs": 646335, - "total_submitted": 3049192, - "total_column_articles": 4681, + "total_acs": 649835, + "total_submitted": 3062140, + "total_column_articles": 4694, "frontend_question_id": "8", "is_new_question": false }, @@ -74163,9 +74625,9 @@ "question__title": "Reverse Integer", "question__title_slug": "reverse-integer", "question__hide": false, - "total_acs": 1300665, - "total_submitted": 3665642, - "total_column_articles": 7727, + "total_acs": 1305164, + "total_submitted": 3676948, + "total_column_articles": 7753, "frontend_question_id": "7", "is_new_question": false }, @@ -74184,9 +74646,9 @@ "question__title": "Zigzag Conversion", "question__title_slug": "zigzag-conversion", "question__hide": false, - "total_acs": 680362, - "total_submitted": 1287900, - "total_column_articles": 5288, + "total_acs": 686506, + "total_submitted": 1298018, + "total_column_articles": 5316, "frontend_question_id": "6", "is_new_question": false }, @@ -74205,9 +74667,9 @@ "question__title": "Longest Palindromic Substring", "question__title_slug": "longest-palindromic-substring", "question__hide": false, - "total_acs": 1702956, - "total_submitted": 4442132, - "total_column_articles": 8705, + "total_acs": 1716815, + "total_submitted": 4472350, + "total_column_articles": 8750, "frontend_question_id": "5", "is_new_question": false }, @@ -74226,9 +74688,9 @@ "question__title": "Median of Two Sorted Arrays", "question__title_slug": "median-of-two-sorted-arrays", "question__hide": false, - "total_acs": 1115516, - "total_submitted": 2641032, - "total_column_articles": 7823, + "total_acs": 1123209, + "total_submitted": 2655953, + "total_column_articles": 7858, "frontend_question_id": "4", "is_new_question": false }, @@ -74247,9 +74709,9 @@ "question__title": "Longest Substring Without Repeating Characters", "question__title_slug": "longest-substring-without-repeating-characters", "question__hide": false, - "total_acs": 2854235, - "total_submitted": 7173551, - "total_column_articles": 15903, + "total_acs": 2881074, + "total_submitted": 7230962, + "total_column_articles": 16007, "frontend_question_id": "3", "is_new_question": false }, @@ -74268,9 +74730,9 @@ "question__title": "Add Two Numbers", "question__title_slug": "add-two-numbers", "question__hide": false, - "total_acs": 2079422, - "total_submitted": 4763129, - "total_column_articles": 13705, + "total_acs": 2095145, + "total_submitted": 4789351, + "total_column_articles": 13764, "frontend_question_id": "2", "is_new_question": false }, @@ -74289,9 +74751,9 @@ "question__title": "Two Sum", "question__title_slug": "two-sum", "question__hide": false, - "total_acs": 5432122, - "total_submitted": 10120079, - "total_column_articles": 24670, + "total_acs": 5473440, + "total_submitted": 10183607, + "total_column_articles": 24794, "frontend_question_id": "1", "is_new_question": false }, diff --git a/leetcode-cn/originData/[no content]better-compression-of-string.json b/leetcode-cn/originData/[no content]better-compression-of-string.json new file mode 100644 index 00000000..c804de99 --- /dev/null +++ b/leetcode-cn/originData/[no content]better-compression-of-string.json @@ -0,0 +1,76 @@ +{ + "data": { + "question": { + "questionId": "3474", + "questionFrontendId": "3167", + "categoryTitle": "Algorithms", + "boundTopicId": 2795068, + "title": "Better Compression of String", + "titleSlug": "better-compression-of-string", + "content": null, + "translatedTitle": "字符串的更好压缩", + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 0, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[{\"title\": \"String Compression\", \"titleSlug\": \"string-compression\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u538b\\u7f29\\u5b57\\u7b26\\u4e32\", \"isPaidOnly\": false}]", + "contributors": [], + "langToValidPlayground": null, + "topicTags": [ + { + "name": "Hash Table", + "slug": "hash-table", + "translatedName": "哈希表", + "__typename": "TopicTagNode" + }, + { + "name": "String", + "slug": "string", + "translatedName": "字符串", + "__typename": "TopicTagNode" + }, + { + "name": "Counting", + "slug": "counting", + "translatedName": "计数", + "__typename": "TopicTagNode" + }, + { + "name": "Sorting", + "slug": "sorting", + "translatedName": "排序", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"53\", \"totalSubmission\": \"57\", \"totalAcceptedRaw\": 53, \"totalSubmissionRaw\": 57, \"acRate\": \"93.0%\"}", + "hints": [ + "This is an implementation problem.", + "Try to extract each character with its corresponding frequency.", + "Sum the frequencies for a single character.", + "Sort characters and append them to a string in alphabetical order." + ], + "solution": null, + "status": null, + "sampleTestCase": "\"a3c9b2c1\"", + "metaData": "{\n \"name\": \"betterCompression\",\n \"params\": [\n {\n \"name\": \"compressed\",\n \"type\": \"string\"\n }\n ],\n \"return\": {\n \"type\": \"string\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -gline-tables-only<\\/code> \\u53c2\\u6570\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n

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

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

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

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

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

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

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

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

\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -g1<\\/code> \\u53c2\\u6570\\u3002 AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n

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

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

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

\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.1.0<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2\\u3002\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 collection<\\/a> \\u5305<\\/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": "\"a3c9b2c1\"\n\"c2b3a1\"\n\"a2b4c1\"",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/[no content]calculate-parking-fees-and-duration.json b/leetcode-cn/originData/[no content]calculate-parking-fees-and-duration.json
new file mode 100644
index 00000000..3ae76a6b
--- /dev/null
+++ b/leetcode-cn/originData/[no content]calculate-parking-fees-and-duration.json	
@@ -0,0 +1,62 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3473",
+            "questionFrontendId": "3166",
+            "categoryTitle": "Database",
+            "boundTopicId": 2791590,
+            "title": "Calculate Parking Fees and Duration",
+            "titleSlug": "calculate-parking-fees-and-duration",
+            "content": null,
+            "translatedTitle": "计算停车费与时长",
+            "translatedContent": null,
+            "isPaidOnly": true,
+            "difficulty": "Medium",
+            "likes": 0,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": null,
+            "topicTags": [
+                {
+                    "name": "Database",
+                    "slug": "database",
+                    "translatedName": "数据库",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": null,
+            "stats": "{\"totalAccepted\": \"45\", \"totalSubmission\": \"69\", \"totalAcceptedRaw\": 45, \"totalSubmissionRaw\": 69, \"acRate\": \"65.2%\"}",
+            "hints": [],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "{\"headers\":{\"ParkingTransactions\":[\"lot_id\",\"car_id\",\"entry_time\",\"exit_time\",\"fee_paid\"]},\"rows\":{\"ParkingTransactions\":[[1,1001,\"2023-06-01 08:00:00\",\"2023-06-01 10:30:00\",5.00],[1,1001,\"2023-06-02 11:00:00\",\"2023-06-02 12:45:00\",3.00],[2,1001,\"2023-06-01 10:45:00\",\"2023-06-01 12:00:00\",6.00],[2,1002,\"2023-06-01 09:00:00\",\"2023-06-01 11:30:00\",4.00],[3,1001,\"2023-06-03 07:00:00\",\"2023-06-03 09:00:00\",4.00],[3,1002,\"2023-06-02 12:00:00\",\"2023-06-02 14:00:00\",2.00]]}}",
+            "metaData": "{\"mysql\":[\"CREATE TABLE If not exists ParkingTransactions (\\n    lot_id INT,\\n    car_id INT,\\n    entry_time DATETIME,\\n    exit_time DATETIME,\\n    fee_paid DECIMAL(10, 2)\\n)\\n\"],\"mssql\":[\"CREATE TABLE ParkingTransactions (\\n    lot_id INT,\\n    car_id INT,\\n    entry_time DATETIME,\\n    exit_time DATETIME,\\n    fee_paid DECIMAL(10, 2)\\n);\\n\"],\"oraclesql\":[\"CREATE TABLE ParkingTransactions (\\n    lot_id NUMBER,\\n    car_id NUMBER,\\n    entry_time DATE,\\n    exit_time DATE,\\n    fee_paid NUMBER(10, 2)\\n)\\n\",\"ALTER SESSION SET nls_date_format='YYYY-MM-DD HH24:MI:SS'\"],\"database\":true,\"name\":\"calculate_fees_and_duration\",\"postgresql\":[\"CREATE TABLE IF NOT EXISTS ParkingTransactions (\\n    lot_id INTEGER,\\n    car_id INTEGER,\\n    entry_time TIMESTAMP,\\n    exit_time TIMESTAMP,\\n    fee_paid NUMERIC(10, 2)\\n);\"],\"pythondata\":[\"ParkingTransactions = pd.DataFrame([], columns=['lot_id', 'car_id', 'entry_time', 'exit_time', 'fee_paid']).astype({\\n    'lot_id': 'Int64',\\n    'car_id': 'Int64',\\n    'entry_time': 'datetime64[ns]',\\n    'exit_time': 'datetime64[ns]',\\n    'fee_paid': 'float64'\\n})\"],\"database_schema\":{\"ParkingTransactions\":{\"lot_id\":\"INT\",\"car_id\":\"INT\",\"entry_time\":\"DATETIME\",\"exit_time\":\"DATETIME\",\"fee_paid\":\"DECIMAL(10, 2)\"}}}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [
+                "CREATE TABLE If not exists ParkingTransactions (\n    lot_id INT,\n    car_id INT,\n    entry_time DATETIME,\n    exit_time DATETIME,\n    fee_paid DECIMAL(10, 2)\n)\n",
+                "Truncate table ParkingTransactions",
+                "insert into ParkingTransactions (lot_id, car_id, entry_time, exit_time, fee_paid) values ('1', '1001', '2023-06-01 08:00:00', '2023-06-01 10:30:00', '5.0')",
+                "insert into ParkingTransactions (lot_id, car_id, entry_time, exit_time, fee_paid) values ('1', '1001', '2023-06-02 11:00:00', '2023-06-02 12:45:00', '3.0')",
+                "insert into ParkingTransactions (lot_id, car_id, entry_time, exit_time, fee_paid) values ('2', '1001', '2023-06-01 10:45:00', '2023-06-01 12:00:00', '6.0')",
+                "insert into ParkingTransactions (lot_id, car_id, entry_time, exit_time, fee_paid) values ('2', '1002', '2023-06-01 09:00:00', '2023-06-01 11:30:00', '4.0')",
+                "insert into ParkingTransactions (lot_id, car_id, entry_time, exit_time, fee_paid) values ('3', '1001', '2023-06-03 07:00:00', '2023-06-03 09:00:00', '4.0')",
+                "insert into ParkingTransactions (lot_id, car_id, entry_time, exit_time, fee_paid) values ('3', '1002', '2023-06-02 12:00:00', '2023-06-02 14:00:00', '2.0')"
+            ],
+            "enableRunCode": true,
+            "envInfo": "{\"mysql\":[\"MySQL\",\"
\\u7248\\u672c\\uff1aMySQL 8.0<\\/code><\\/p>\"],\"mssql\":[\"MS SQL Server\",\"
mssql server 2019.<\\/p>\"],\"oraclesql\":[\"Oracle\",\"
Oracle Sql 11.2.<\\/p>\"],\"pythondata\":[\"Pandas\",\"
Python 3.10 with Pandas 2.0.2 and NumPy 1.25.0<\\/p>\"],\"postgresql\":[\"PostgreSQL\",\"
PostgreSQL 16<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "{\"headers\":{\"ParkingTransactions\":[\"lot_id\",\"car_id\",\"entry_time\",\"exit_time\",\"fee_paid\"]},\"rows\":{\"ParkingTransactions\":[[1,1001,\"2023-06-01 08:00:00\",\"2023-06-01 10:30:00\",5.00],[1,1001,\"2023-06-02 11:00:00\",\"2023-06-02 12:45:00\",3.00],[2,1001,\"2023-06-01 10:45:00\",\"2023-06-01 12:00:00\",6.00],[2,1002,\"2023-06-01 09:00:00\",\"2023-06-01 11:30:00\",4.00],[3,1001,\"2023-06-03 07:00:00\",\"2023-06-03 09:00:00\",4.00],[3,1002,\"2023-06-02 12:00:00\",\"2023-06-02 14:00:00\",2.00]]}}",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/[no content]employee-task-duration-and-concurrent-tasks.json b/leetcode-cn/originData/[no content]employee-task-duration-and-concurrent-tasks.json
new file mode 100644
index 00000000..c7f46d4b
--- /dev/null
+++ b/leetcode-cn/originData/[no content]employee-task-duration-and-concurrent-tasks.json	
@@ -0,0 +1,63 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3465",
+            "questionFrontendId": "3156",
+            "categoryTitle": "Database",
+            "boundTopicId": 2783743,
+            "title": "Employee Task Duration and Concurrent Tasks",
+            "titleSlug": "employee-task-duration-and-concurrent-tasks",
+            "content": null,
+            "translatedTitle": "员工任务持续时间和并发任务",
+            "translatedContent": null,
+            "isPaidOnly": true,
+            "difficulty": "Hard",
+            "likes": 1,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": null,
+            "topicTags": [
+                {
+                    "name": "Database",
+                    "slug": "database",
+                    "translatedName": "数据库",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": null,
+            "stats": "{\"totalAccepted\": \"40\", \"totalSubmission\": \"87\", \"totalAcceptedRaw\": 40, \"totalSubmissionRaw\": 87, \"acRate\": \"46.0%\"}",
+            "hints": [],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "{\"headers\":{\"Tasks\":[\"task_id\",\"employee_id\",\"start_time\",\"end_time\"]},\"rows\":{\"Tasks\":[[1,1001,\"2023-05-01 08:00:00\",\"2023-05-01 09:00:00\"],[2,1001,\"2023-05-01 08:30:00\",\"2023-05-01 10:30:00\"],[3,1001,\"2023-05-01 11:00:00\",\"2023-05-01 12:00:00\"],[7,1001,\"2023-05-01 13:00:00\",\"2023-05-01 15:30:00\"],[4,1002,\"2023-05-01 09:00:00\",\"2023-05-01 10:00:00\"],[5,1002,\"2023-05-01 09:30:00\",\"2023-05-01 11:30:00\"],[6,1003,\"2023-05-01 14:00:00\",\"2023-05-01 16:00:00\"]]}}",
+            "metaData": "{\"mysql\":[\"CREATE TABLE  if Not exists Tasks (\\n    task_id INT ,\\n    employee_id INT,\\n    start_time DATETIME,\\n    end_time DATETIME\\n);\"],\"mssql\":[\"CREATE TABLE Tasks (\\n    task_id INT PRIMARY KEY,\\n    employee_id INT,\\n    start_time DATETIME,\\n    end_time DATETIME\\n);\\n\"],\"oraclesql\":[\"CREATE TABLE Tasks (\\n    task_id int ,\\n    employee_id int,\\n    start_time DATE,\\n    end_time DATE\\n)\\n\\n\\n\\n\\n\\n\\n\",\"ALTER SESSION SET nls_date_format='YYYY-MM-DD HH24:MI:SS'\"],\"postgresql\":[\"CREATE TABLE IF NOT EXISTS Tasks (\\n    task_id INT,\\n    employee_id INT,\\n    start_time TIMESTAMP,\\n    end_time TIMESTAMP\\n);\\n\"],\"pythondata\":[\"Tasks = pd.DataFrame([], columns=['task_id', 'employee_id', 'start_time', 'end_time']).astype({\\n    'task_id': 'Int64',\\n    'employee_id': 'Int64',\\n    'start_time': 'datetime64[ns]',\\n    'end_time': 'datetime64[ns]'\\n})\"],\"database\":true,\"name\":\"find_total_duration\",\"database_schema\":{\"Tasks\":{\"task_id\":\"INT\",\"employee_id\":\"INT\",\"start_time\":\"DATETIME\",\"end_time\":\"DATETIME\"}}}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [
+                "CREATE TABLE  if Not exists Tasks (\n    task_id INT ,\n    employee_id INT,\n    start_time DATETIME,\n    end_time DATETIME\n);",
+                "Truncate table Tasks",
+                "insert into Tasks (task_id, employee_id, start_time, end_time) values ('1', '1001', '2023-05-01 08:00:00', '2023-05-01 09:00:00')",
+                "insert into Tasks (task_id, employee_id, start_time, end_time) values ('2', '1001', '2023-05-01 08:30:00', '2023-05-01 10:30:00')",
+                "insert into Tasks (task_id, employee_id, start_time, end_time) values ('3', '1001', '2023-05-01 11:00:00', '2023-05-01 12:00:00')",
+                "insert into Tasks (task_id, employee_id, start_time, end_time) values ('7', '1001', '2023-05-01 13:00:00', '2023-05-01 15:30:00')",
+                "insert into Tasks (task_id, employee_id, start_time, end_time) values ('4', '1002', '2023-05-01 09:00:00', '2023-05-01 10:00:00')",
+                "insert into Tasks (task_id, employee_id, start_time, end_time) values ('5', '1002', '2023-05-01 09:30:00', '2023-05-01 11:30:00')",
+                "insert into Tasks (task_id, employee_id, start_time, end_time) values ('6', '1003', '2023-05-01 14:00:00', '2023-05-01 16:00:00')"
+            ],
+            "enableRunCode": true,
+            "envInfo": "{\"mysql\":[\"MySQL\",\"
\\u7248\\u672c\\uff1aMySQL 8.0<\\/code><\\/p>\"],\"mssql\":[\"MS SQL Server\",\"
mssql server 2019.<\\/p>\"],\"oraclesql\":[\"Oracle\",\"
Oracle Sql 11.2.<\\/p>\"],\"pythondata\":[\"Pandas\",\"
Python 3.10 with Pandas 2.0.2 and NumPy 1.25.0<\\/p>\"],\"postgresql\":[\"PostgreSQL\",\"
PostgreSQL 16<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "{\"headers\":{\"Tasks\":[\"task_id\",\"employee_id\",\"start_time\",\"end_time\"]},\"rows\":{\"Tasks\":[[1,1001,\"2023-05-01 08:00:00\",\"2023-05-01 09:00:00\"],[2,1001,\"2023-05-01 08:30:00\",\"2023-05-01 10:30:00\"],[3,1001,\"2023-05-01 11:00:00\",\"2023-05-01 12:00:00\"],[7,1001,\"2023-05-01 13:00:00\",\"2023-05-01 15:30:00\"],[4,1002,\"2023-05-01 09:00:00\",\"2023-05-01 10:00:00\"],[5,1002,\"2023-05-01 09:30:00\",\"2023-05-01 11:30:00\"],[6,1003,\"2023-05-01 14:00:00\",\"2023-05-01 16:00:00\"]]}}",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/[no content]find-the-level-of-tree-with-minimum-sum.json b/leetcode-cn/originData/[no content]find-the-level-of-tree-with-minimum-sum.json
new file mode 100644
index 00000000..e337c459
--- /dev/null
+++ b/leetcode-cn/originData/[no content]find-the-level-of-tree-with-minimum-sum.json	
@@ -0,0 +1,74 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3467",
+            "questionFrontendId": "3157",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2787076,
+            "title": "Find the Level of Tree with Minimum Sum",
+            "titleSlug": "find-the-level-of-tree-with-minimum-sum",
+            "content": null,
+            "translatedTitle": "找到具有最小和的树的层数",
+            "translatedContent": null,
+            "isPaidOnly": true,
+            "difficulty": "Medium",
+            "likes": 0,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[{\"title\": \"Kth Largest Sum in a Binary Tree\", \"titleSlug\": \"kth-largest-sum-in-a-binary-tree\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u4e8c\\u53c9\\u6811\\u4e2d\\u7684\\u7b2c K \\u5927\\u5c42\\u548c\", \"isPaidOnly\": false}]",
+            "contributors": [],
+            "langToValidPlayground": null,
+            "topicTags": [
+                {
+                    "name": "Tree",
+                    "slug": "tree",
+                    "translatedName": "树",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Depth-First Search",
+                    "slug": "depth-first-search",
+                    "translatedName": "深度优先搜索",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Breadth-First Search",
+                    "slug": "breadth-first-search",
+                    "translatedName": "广度优先搜索",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Binary Tree",
+                    "slug": "binary-tree",
+                    "translatedName": "二叉树",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": null,
+            "stats": "{\"totalAccepted\": \"47\", \"totalSubmission\": \"56\", \"totalAcceptedRaw\": 47, \"totalSubmissionRaw\": 56, \"acRate\": \"83.9%\"}",
+            "hints": [
+                "Run a DFS on the tree and update an array sum where sum[i] is the sum for level i.",
+                "The answer is the first minimum element of sum."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[50,6,2,30,80,7]",
+            "metaData": "{\n  \"name\": \"minimumLevel\",\n  \"params\": [\n    {\n      \"name\": \"root\",\n      \"type\": \"TreeNode\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"integer\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0 C++ 20 \\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -gline-tables-only<\\/code> \\u53c2\\u6570\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528 GNU11 \\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -g1<\\/code> \\u53c2\\u6570\\u3002 AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.1.0<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2\\u3002\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 collection<\\/a> \\u5305<\\/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": "[50,6,2,30,80,7]\n[36,17,10,null,null,24]\n[5,null,5,null,5]",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/[no content]maximum-number-of-upgradable-servers.json b/leetcode-cn/originData/[no content]maximum-number-of-upgradable-servers.json
new file mode 100644
index 00000000..aba4776a
--- /dev/null
+++ b/leetcode-cn/originData/[no content]maximum-number-of-upgradable-servers.json	
@@ -0,0 +1,67 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3458",
+            "questionFrontendId": "3155",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2782911,
+            "title": "Maximum Number of Upgradable Servers",
+            "titleSlug": "maximum-number-of-upgradable-servers",
+            "content": null,
+            "translatedTitle": "可升级服务器的最大数量",
+            "translatedContent": null,
+            "isPaidOnly": true,
+            "difficulty": "Medium",
+            "likes": 0,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": null,
+            "topicTags": [
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Math",
+                    "slug": "math",
+                    "translatedName": "数学",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Binary Search",
+                    "slug": "binary-search",
+                    "translatedName": "二分查找",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": null,
+            "stats": "{\"totalAccepted\": \"58\", \"totalSubmission\": \"333\", \"totalAcceptedRaw\": 58, \"totalSubmissionRaw\": 333, \"acRate\": \"17.4%\"}",
+            "hints": [
+                "Use binary search to find the maximum number of servers that can be upgraded for each data center separately."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[4,3]\n[3,5]\n[4,2]\n[8,9]",
+            "metaData": "{\n  \"name\": \"maxUpgrades\",\n  \"params\": [\n    {\n      \"name\": \"count\",\n      \"type\": \"integer[]\"\n    },\n    {\n      \"type\": \"integer[]\",\n      \"name\": \"upgrade\"\n    },\n    {\n      \"type\": \"integer[]\",\n      \"name\": \"sell\"\n    },\n    {\n      \"type\": \"integer[]\",\n      \"name\": \"money\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"integer[]\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0 C++ 20 \\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -gline-tables-only<\\/code> \\u53c2\\u6570\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528 GNU11 \\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -g1<\\/code> \\u53c2\\u6570\\u3002 AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.1.0<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2\\u3002\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 collection<\\/a> \\u5305<\\/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]\n[3,5]\n[4,2]\n[8,9]\n[1]\n[2]\n[1]\n[1]",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/[no content]second-day-verification.json b/leetcode-cn/originData/[no content]second-day-verification.json
new file mode 100644
index 00000000..af57966b
--- /dev/null
+++ b/leetcode-cn/originData/[no content]second-day-verification.json	
@@ -0,0 +1,64 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3481",
+            "questionFrontendId": "3172",
+            "categoryTitle": "Database",
+            "boundTopicId": 2798976,
+            "title": "Second Day Verification",
+            "titleSlug": "second-day-verification",
+            "content": null,
+            "translatedTitle": "第二天验证",
+            "translatedContent": null,
+            "isPaidOnly": true,
+            "difficulty": "Easy",
+            "likes": 0,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": null,
+            "topicTags": [
+                {
+                    "name": "Database",
+                    "slug": "database",
+                    "translatedName": "数据库",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": null,
+            "stats": "{\"totalAccepted\": \"28\", \"totalSubmission\": \"36\", \"totalAcceptedRaw\": 28, \"totalSubmissionRaw\": 36, \"acRate\": \"77.8%\"}",
+            "hints": [],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "{\"headers\":{\"emails\":[\"email_id\",\"user_id\",\"signup_date\"],\"texts\":[\"text_id\",\"email_id\",\"signup_action\",\"action_date\"]},\"rows\":{\"emails\":[[125,7771,\"2022-06-14 09:30:00\"],[433,1052,\"2022-07-09 08:15:00\"],[234,7005,\"2022-08-20 10:00:00\"]],\"texts\":[[1,125,\"Verified\",\"2022-06-15 08:30:00\"],[2,433,\"Not Verified\",\"2022-07-10 10:45:00\"],[4,234,\"Verified\",\"2022-08-21 09:30:00\"]]}}",
+            "metaData": "{\"mysql\":[\"CREATE TABLE If not exists emails (\\n    email_id INT,\\n    user_id INT,\\n    signup_date DATETIME\\n);\",\"CREATE TABLE If not exists texts (\\n    text_id INT,\\n    email_id INT,\\n    signup_action ENUM('Verified', 'Not Verified'),\\n    action_date DATETIME\\n);\"],\"mssql\":[\"CREATE TABLE emails (\\n    email_id INT,\\n    user_id INT,\\n    signup_date DATETIME\\n);\",\"CREATE TABLE texts (\\n    text_id INT,\\n    email_id INT,\\n    signup_action VARCHAR(12),\\n    action_date DATETIME\\n);\"],\"oraclesql\":[\"CREATE TABLE emails (\\n    email_id NUMBER,\\n    user_id NUMBER,\\n    signup_date DATE\\n)\\n\",\"CREATE TABLE texts (\\n    text_id NUMBER,\\n    email_id NUMBER,\\n    signup_action VARCHAR(32),\\n    action_date DATE\\n)\",\"ALTER SESSION SET nls_date_format='YYYY-MM-DD HH24:MI:SS'\"],\"database\":true,\"name\":\"find_second_day_signups\",\"postgresql\":[\"CREATE TABLE emails (\\n    email_id INTEGER,\\n    user_id INTEGER,\\n    signup_date DATE\\n);\\n\",\"CREATE TABLE texts (\\n    text_id INTEGER,\\n    email_id INTEGER,\\n    signup_action VARCHAR(32),\\n    action_date DATE\\n);\\n\",\"SELECT to_char(action_date, 'YYYY-MM-DD HH24:MI:SS') FROM texts;\\n\"],\"pythondata\":[\"emails = pd.DataFrame([], columns=['email_id', 'user_id', 'signup_date']).astype({\\n    'email_id': 'Int64',  # Nullable integer type\\n    'user_id': 'Int64',   # Nullable integer type\\n    'signup_date': 'datetime64[ns]'  # DateTime type for signup date\\n})\",\"texts = pd.DataFrame([], columns=['text_id', 'email_id', 'signup_action', 'action_date']).astype({\\n    'text_id': 'Int64',             # Nullable integer type for text_id\\n    'email_id': 'Int64',            # Nullable integer type for email_id\\n    'signup_action': 'object',      # Using 'object' to store string values for ENUM\\n    'action_date': 'datetime64[ns]' # DateTime type for action_date\\n})\"],\"database_schema\":{\"emails\":{\"email_id\":\"INT\",\"user_id\":\"INT\",\"signup_date\":\"DATETIME\"},\"texts\":{\"text_id\":\"INT\",\"email_id\":\"INT\",\"signup_action\":\"ENUM('Verified', 'Not Verified')\",\"action_date\":\"DATETIME\"}}}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [
+                "CREATE TABLE If not exists emails (\n    email_id INT,\n    user_id INT,\n    signup_date DATETIME\n);",
+                "CREATE TABLE If not exists texts (\n    text_id INT,\n    email_id INT,\n    signup_action ENUM('Verified', 'Not Verified'),\n    action_date DATETIME\n);",
+                "Truncate table emails",
+                "insert into emails (email_id, user_id, signup_date) values ('125', '7771', '2022-06-14 09:30:00')",
+                "insert into emails (email_id, user_id, signup_date) values ('433', '1052', '2022-07-09 08:15:00')",
+                "insert into emails (email_id, user_id, signup_date) values ('234', '7005', '2022-08-20 10:00:00')",
+                "Truncate table texts",
+                "insert into texts (text_id, email_id, signup_action, action_date) values ('1', '125', 'Verified', '2022-06-15 08:30:00')",
+                "insert into texts (text_id, email_id, signup_action, action_date) values ('2', '433', 'Not Verified', '2022-07-10 10:45:00')",
+                "insert into texts (text_id, email_id, signup_action, action_date) values ('4', '234', 'Verified', '2022-08-21 09:30:00')"
+            ],
+            "enableRunCode": true,
+            "envInfo": "{\"mysql\":[\"MySQL\",\"
\\u7248\\u672c\\uff1aMySQL 8.0<\\/code><\\/p>\"],\"mssql\":[\"MS SQL Server\",\"
mssql server 2019.<\\/p>\"],\"oraclesql\":[\"Oracle\",\"
Oracle Sql 11.2.<\\/p>\"],\"pythondata\":[\"Pandas\",\"
Python 3.10 with Pandas 2.0.2 and NumPy 1.25.0<\\/p>\"],\"postgresql\":[\"PostgreSQL\",\"
PostgreSQL 16<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "{\"headers\":{\"emails\":[\"email_id\",\"user_id\",\"signup_date\"],\"texts\":[\"text_id\",\"email_id\",\"signup_action\",\"action_date\"]},\"rows\":{\"emails\":[[125,7771,\"2022-06-14 09:30:00\"],[433,1052,\"2022-07-09 08:15:00\"],[234,7005,\"2022-08-20 10:00:00\"]],\"texts\":[[1,125,\"Verified\",\"2022-06-15 08:30:00\"],[2,433,\"Not Verified\",\"2022-07-10 10:45:00\"],[4,234,\"Verified\",\"2022-08-21 09:30:00\"]]}}",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/block-placement-queries.json b/leetcode-cn/originData/block-placement-queries.json
new file mode 100644
index 00000000..33bf6ffd
--- /dev/null
+++ b/leetcode-cn/originData/block-placement-queries.json
@@ -0,0 +1,190 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3435",
+            "questionFrontendId": "3161",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2790205,
+            "title": "Block Placement Queries",
+            "titleSlug": "block-placement-queries",
+            "content": "
There exists an infinite number line, with its origin at 0 and extending towards the positive x-axis.
\n\n
You are given a 2D array queries, which contains two types of queries:
\n\n
    \n\t
  1. For a query of type 1, queries[i] = [1, x]. Build an obstacle at distance x from the origin. It is guaranteed that there is no obstacle at distance x when the query is asked.
    2. \n\t
  2. For a query of type 2, queries[i] = [2, x, sz]. Check if it is possible to place a block of size sz anywhere in the range [0, x] on the line, such that the block entirely lies in the range [0, x]. A block cannot be placed if it intersects with any obstacle, but it may touch it. Note that you do not actually place the block. Queries are separate.
    3. \n
\n\n
Return a boolean array results, where results[i] is true if you can place the block specified in the ith query of type 2, and false otherwise.
\n\n
 
\n
Example 1:
\n\n
\n
Input: queries = [[1,2],[2,3,3],[2,3,1],[2,2,2]]
\n\n
Output: [false,true,true]
\n\n
Explanation:
\n\n
\"\"
\n\n
For query 0, place an obstacle at x = 2. A block of size at most 2 can be placed before x = 3.
\n
\n\n
Example 2:
\n\n
\n
Input: queries = [[1,7],[2,7,6],[1,2],[2,7,5],[2,7,6]]
\n\n
Output: [true,true,false]
\n\n
Explanation:
\n\n
\"\"
\n\n
    \n\t
  • Place an obstacle at x = 7 for query 0. A block of size at most 7 can be placed before x = 7.
    • \n\t
  • Place an obstacle at x = 2 for query 2. Now, a block of size at most 5 can be placed before x = 7, and a block of size at most 2 before x = 2.
    • \n
\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 1 <= queries.length <= 15 * 104
    • \n\t
  • 2 <= queries[i].length <= 3
    • \n\t
  • 1 <= queries[i][0] <= 2
    • \n\t
  • 1 <= x, sz <= min(5 * 104, 3 * queries.length)
    • \n\t
  • The input is generated such that for queries of type 1, no obstacle exists at distance x when the query is asked.
    • \n\t
  • The input is generated such that there is at least one query of type 2.
    • \n
\n",
+            "translatedTitle": "物块放置查询",
+            "translatedContent": "
有一条无限长的数轴，原点在 0 处，沿着 x 轴 正 方向无限延伸。
\n\n
给你一个二维数组 queries ，它包含两种操作：
\n\n
    \n\t
  1. 操作类型 1 ：queries[i] = [1, x] 。在距离原点 x 处建一个障碍物。数据保证当操作执行的时候，位置 x 处 没有 任何障碍物。
    2. \n\t
  2. 操作类型 2 ：queries[i] = [2, x, sz] 。判断在数轴范围 [0, x] 内是否可以放置一个长度为 sz 的物块，这个物块需要 完全 放置在范围 [0, x] 内。如果物块与任何障碍物有重合，那么这个物块 不能 被放置，但物块可以与障碍物刚好接触。注意，你只是进行查询，并 不是 真的放置这个物块。每个查询都是相互独立的。
    3. \n
\n\n
请你返回一个 boolean 数组results ，如果第 i 个操作类型 2 的操作你可以放置物块，那么 results[i] 为 true ，否则为 false 。
\n\n
 
\n\n
示例 1：
\n\n
\n
输入：queries = [[1,2],[2,3,3],[2,3,1],[2,2,2]]
\n\n
输出：[false,true,true]
\n\n
解释：
\n\n
\"\"
\n\n
查询 0 ，在 x = 2 处放置一个障碍物。在 x = 3 之前任何大小不超过 2 的物块都可以被放置。
\n
\n\n
示例 2：
\n\n
\n
输入：queries = [[1,7],[2,7,6],[1,2],[2,7,5],[2,7,6]]
\n\n
输出：[true,true,false]
\n\n
解释：
\n\n
\"\"
\n\n
    \n\t
  • 查询 0 在 x = 7 处放置一个障碍物。在 x = 7 之前任何大小不超过 7 的物块都可以被放置。
    • \n\t
  • 查询 2 在 x = 2 处放置一个障碍物。现在，在 x = 7 之前任何大小不超过 5 的物块可以被放置，x = 2 之前任何大小不超过 2 的物块可以被放置。
    • \n
\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 1 <= queries.length <= 15 * 104
    • \n\t
  • 2 <= queries[i].length <= 3
    • \n\t
  • 1 <= queries[i][0] <= 2
    • \n\t
  • 1 <= x, sz <= min(5 * 104, 3 * queries.length)
    • \n\t
  • 输入保证操作 1 中，x 处不会有障碍物。
    • \n\t
  • 输入保证至少有一个操作类型 2 。
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Hard",
+            "likes": 10,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[{\"title\": \"Building Boxes\", \"titleSlug\": \"building-boxes\", \"difficulty\": \"Hard\", \"translatedTitle\": \"\\u653e\\u7f6e\\u76d2\\u5b50\", \"isPaidOnly\": false}]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": false, \"java\": false, \"python\": false, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false, \"cangjie\": false}",
+            "topicTags": [
+                {
+                    "name": "Binary Indexed Tree",
+                    "slug": "binary-indexed-tree",
+                    "translatedName": "树状数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Segment Tree",
+                    "slug": "segment-tree",
+                    "translatedName": "线段树",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Binary Search",
+                    "slug": "binary-search",
+                    "translatedName": "二分查找",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    vector getResults(vector>& queries) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public List getResults(int[][] queries) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def getResults(self, queries):\n        \"\"\"\n        :type queries: List[List[int]]\n        :rtype: List[bool]\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def getResults(self, queries: List[List[int]]) -> List[bool]:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "/**\n * Note: The returned array must be malloced, assume caller calls free().\n */\nbool* getResults(int** queries, int queriesSize, int* queriesColSize, int* returnSize) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public IList GetResults(int[][] queries) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number[][]} queries\n * @return {boolean[]}\n */\nvar getResults = function(queries) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function getResults(queries: number[][]): boolean[] {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer[][] $queries\n     * @return Boolean[]\n     */\n    function getResults($queries) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func getResults(_ queries: [[Int]]) -> [Bool] {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun getResults(queries: Array): List {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  List getResults(List> queries) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func getResults(queries [][]int) []bool {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer[][]} queries\n# @return {Boolean[]}\ndef get_results(queries)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def getResults(queries: Array[Array[Int]]): List[Boolean] = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn get_results(queries: Vec>) -> Vec {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (get-results queries)\n  (-> (listof (listof exact-integer?)) (listof boolean?))\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec get_results(Queries :: [[integer()]]) -> [boolean()].\nget_results(Queries) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec get_results(queries :: [[integer]]) :: [boolean]\n  def get_results(queries) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"1.6K\", \"totalSubmission\": \"5.6K\", \"totalAcceptedRaw\": 1560, \"totalSubmissionRaw\": 5611, \"acRate\": \"27.8%\"}",
+            "hints": [
+                "Let d[x] be the distance of the next obstacle after x.",
+                "For each query of type 2, we just need to check if max(d[0], d[1], d[2], …d[x - sz]) > sz.",
+                "Use segment tree to maintain d[x]."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[[1,2],[2,3,3],[2,3,1],[2,2,2]]",
+            "metaData": "{\n  \"name\": \"getResults\",\n  \"params\": [\n    {\n      \"name\": \"queries\",\n      \"type\": \"integer[][]\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"list\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0 C++ 20 \\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -gline-tables-only<\\/code> \\u53c2\\u6570\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528 GNU11 \\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -g1<\\/code> \\u53c2\\u6570\\u3002 AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.1.0<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2\\u3002\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 collection<\\/a> \\u5305<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "[[1,2],[2,3,3],[2,3,1],[2,2,2]]\n[[1,7],[2,7,6],[1,2],[2,7,5],[2,7,6]]",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/count-days-without-meetings.json b/leetcode-cn/originData/count-days-without-meetings.json
new file mode 100644
index 00000000..f1e6140a
--- /dev/null
+++ b/leetcode-cn/originData/count-days-without-meetings.json
@@ -0,0 +1,177 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3430",
+            "questionFrontendId": "3169",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2795611,
+            "title": "Count Days Without Meetings",
+            "titleSlug": "count-days-without-meetings",
+            "content": "
You are given a positive integer days representing the total number of days an employee is available for work (starting from day 1). You are also given a 2D array meetings of size n where, meetings[i] = [start_i, end_i] represents the starting and ending days of meeting i (inclusive).
\n\n
Return the count of days when the employee is available for work but no meetings are scheduled.
\n\n
Note: The meetings may overlap.
\n\n
 
\n
Example 1:
\n\n
\n
Input: days = 10, meetings = [[5,7],[1,3],[9,10]]
\n\n
Output: 2
\n\n
Explanation:
\n\n
There is no meeting scheduled on the 4th and 8th days.
\n
\n\n
Example 2:
\n\n
\n
Input: days = 5, meetings = [[2,4],[1,3]]
\n\n
Output: 1
\n\n
Explanation:
\n\n
There is no meeting scheduled on the 5th day.
\n
\n\n
Example 3:
\n\n
\n
Input: days = 6, meetings = [[1,6]]
\n\n
Output: 0
\n\n
Explanation:
\n\n
Meetings are scheduled for all working days.
\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 1 <= days <= 109
    • \n\t
  • 1 <= meetings.length <= 105
    • \n\t
  • meetings[i].length == 2
    • \n\t
  • 1 <= meetings[i][0] <= meetings[i][1] <= days
    • \n
\n",
+            "translatedTitle": "无需开会的工作日",
+            "translatedContent": "
给你一个正整数 days，表示员工可工作的总天数（从第 1 天开始）。另给你一个二维数组 meetings，长度为 n，其中 meetings[i] = [start_i, end_i] 表示第 i 次会议的开始和结束天数（包含首尾）。
\n\n
返回员工可工作且没有安排会议的天数。
\n\n
注意：会议时间可能会有重叠。
\n\n
 
\n\n
示例 1：
\n\n
\n
输入：days = 10, meetings = [[5,7],[1,3],[9,10]]
\n\n
输出：2
\n\n
解释：
\n\n
第 4 天和第 8 天没有安排会议。
\n
\n\n
示例 2：
\n\n
\n
输入：days = 5, meetings = [[2,4],[1,3]]
\n\n
输出：1
\n\n
解释：
\n\n
第 5 天没有安排会议。
\n
\n\n
示例 3：
\n\n
\n
输入：days = 6, meetings = [[1,6]]
\n\n
输出：0
\n\n
解释：
\n\n
所有工作日都安排了会议。
\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 1 <= days <= 109
    • \n\t
  • 1 <= meetings.length <= 105
    • \n\t
  • meetings[i].length == 2
    • \n\t
  • 1 <= meetings[i][0] <= meetings[i][1] <= days
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Medium",
+            "likes": 4,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[{\"title\": \"Merge Intervals\", \"titleSlug\": \"merge-intervals\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u5408\\u5e76\\u533a\\u95f4\", \"isPaidOnly\": false}]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": false, \"java\": true, \"python\": true, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false, \"cangjie\": false}",
+            "topicTags": [
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Sorting",
+                    "slug": "sorting",
+                    "translatedName": "排序",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    int countDays(int days, vector>& meetings) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public int countDays(int days, int[][] meetings) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def countDays(self, days, meetings):\n        \"\"\"\n        :type days: int\n        :type meetings: List[List[int]]\n        :rtype: int\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def countDays(self, days: int, meetings: List[List[int]]) -> int:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "int countDays(int days, int** meetings, int meetingsSize, int* meetingsColSize) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public int CountDays(int days, int[][] meetings) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number} days\n * @param {number[][]} meetings\n * @return {number}\n */\nvar countDays = function(days, meetings) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function countDays(days: number, meetings: number[][]): number {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer $days\n     * @param Integer[][] $meetings\n     * @return Integer\n     */\n    function countDays($days, $meetings) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func countDays(_ days: Int, _ meetings: [[Int]]) -> Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun countDays(days: Int, meetings: Array): Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  int countDays(int days, List> meetings) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func countDays(days int, meetings [][]int) int {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer} days\n# @param {Integer[][]} meetings\n# @return {Integer}\ndef count_days(days, meetings)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def countDays(days: Int, meetings: Array[Array[Int]]): Int = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn count_days(days: i32, meetings: Vec>) -> i32 {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (count-days days meetings)\n  (-> exact-integer? (listof (listof exact-integer?)) exact-integer?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec count_days(Days :: integer(), Meetings :: [[integer()]]) -> integer().\ncount_days(Days, Meetings) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec count_days(days :: integer, meetings :: [[integer]]) :: integer\n  def count_days(days, meetings) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"4.6K\", \"totalSubmission\": \"11.1K\", \"totalAcceptedRaw\": 4555, \"totalSubmissionRaw\": 11057, \"acRate\": \"41.2%\"}",
+            "hints": [
+                "Merge the overlapping meetings and sort the new meetings timings.",
+                "Return the sum of difference between the end time of a meeting and the start time of the next meeting for all adjacent pairs."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "10\n[[5,7],[1,3],[9,10]]",
+            "metaData": "{\n  \"name\": \"countDays\",\n  \"params\": [\n    {\n      \"name\": \"days\",\n      \"type\": \"integer\"\n    },\n    {\n      \"type\": \"integer[][]\",\n      \"name\": \"meetings\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"integer\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0 C++ 20 \\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -gline-tables-only<\\/code> \\u53c2\\u6570\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528 GNU11 \\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -g1<\\/code> \\u53c2\\u6570\\u3002 AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.1.0<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2\\u3002\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 collection<\\/a> \\u5305<\\/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\n[[5,7],[1,3],[9,10]]\n5\n[[2,4],[1,3]]\n6\n[[1,6]]",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/find-number-of-ways-to-reach-the-k-th-stair.json b/leetcode-cn/originData/find-number-of-ways-to-reach-the-k-th-stair.json
new file mode 100644
index 00000000..a3caeb90
--- /dev/null
+++ b/leetcode-cn/originData/find-number-of-ways-to-reach-the-k-th-stair.json
@@ -0,0 +1,196 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3414",
+            "questionFrontendId": "3154",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2782785,
+            "title": "Find Number of Ways to Reach the K-th Stair",
+            "titleSlug": "find-number-of-ways-to-reach-the-k-th-stair",
+            "content": "
You are given a non-negative integer k. There exists a staircase with an infinite number of stairs, with the lowest stair numbered 0.
\n\n
Alice has an integer jump, with an initial value of 0. She starts on stair 1 and wants to reach stair k using any number of operations. If she is on stair i, in one operation she can:
\n\n
    \n\t
  • Go down to stair i - 1. This operation cannot be used consecutively or on stair 0.
    • \n\t
  • Go up to stair i + 2jump. And then, jump becomes jump + 1.
    • \n
\n\n
Return the total number of ways Alice can reach stair k.
\n\n
Note that it is possible that Alice reaches the stair k, and performs some operations to reach the stair k again.
\n\n
 
\n
Example 1:
\n\n
\n
Input: k = 0
\n\n
Output: 2
\n\n
Explanation:
\n\n
The 2 possible ways of reaching stair 0 are:
\n\n
    \n\t
  • Alice starts at stair 1.\n\t
      \n\t\t
    • Using an operation of the first type, she goes down 1 stair to reach stair 0.
      • \n\t
    \n\t
    • \n\t
  • Alice starts at stair 1.\n\t
      \n\t\t
    • Using an operation of the first type, she goes down 1 stair to reach stair 0.
      • \n\t\t
    • Using an operation of the second type, she goes up 20 stairs to reach stair 1.
      • \n\t\t
    • Using an operation of the first type, she goes down 1 stair to reach stair 0.
      • \n\t
    \n\t
    • \n
\n
\n\n
Example 2:
\n\n
\n
Input: k = 1
\n\n
Output: 4
\n\n
Explanation:
\n\n
The 4 possible ways of reaching stair 1 are:
\n\n
    \n\t
  • Alice starts at stair 1. Alice is at stair 1.
    • \n\t
  • Alice starts at stair 1.\n\t
      \n\t\t
    • Using an operation of the first type, she goes down 1 stair to reach stair 0.
      • \n\t\t
    • Using an operation of the second type, she goes up 20 stairs to reach stair 1.
      • \n\t
    \n\t
    • \n\t
  • Alice starts at stair 1.\n\t
      \n\t\t
    • Using an operation of the second type, she goes up 20 stairs to reach stair 2.
      • \n\t\t
    • Using an operation of the first type, she goes down 1 stair to reach stair 1.
      • \n\t
    \n\t
    • \n\t
  • Alice starts at stair 1.\n\t
      \n\t\t
    • Using an operation of the first type, she goes down 1 stair to reach stair 0.
      • \n\t\t
    • Using an operation of the second type, she goes up 20 stairs to reach stair 1.
      • \n\t\t
    • Using an operation of the first type, she goes down 1 stair to reach stair 0.
      • \n\t\t
    • Using an operation of the second type, she goes up 21 stairs to reach stair 2.
      • \n\t\t
    • Using an operation of the first type, she goes down 1 stair to reach stair 1.
      • \n\t
    \n\t
    • \n
\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 0 <= k <= 109
    • \n
\n",
+            "translatedTitle": "到达第 K 级台阶的方案数",
+            "translatedContent": "
给你有一个 非负 整数 k 。有一个无限长度的台阶，最低 一层编号为 0 。
\n\n
虎老师有一个整数 jump ，一开始值为 0 。虎老师从台阶 1 开始，虎老师可以使用 任意 次操作，目标是到达第 k 级台阶。假设虎老师位于台阶 i ，一次 操作 中，虎老师可以：
\n\n
    \n\t
  • 向下走一级到 i - 1 ，但该操作 不能 连续使用，如果在台阶第 0 级也不能使用。
    • \n\t
  • 向上走到台阶 i + 2jump 处，然后 jump 变为 jump + 1 。
    • \n
\n\n
请你返回虎老师到达台阶 k 处的总方案数。
\n\n
注意 ，虎老师可能到达台阶 k 处后，通过一些操作重新回到台阶 k 处，这视为不同的方案。
\n\n
 
\n\n
示例 1：
\n\n
\n
输入：k = 0
\n\n
输出：2
\n\n
解释：
\n\n
2 种到达台阶 0 的方案为：
\n\n
    \n\t
  • 虎老师从台阶 1 开始。\n\t
      \n\t\t
    • 执行第一种操作，从台阶 1 向下走到台阶 0 。
      • \n\t
    \n\t
    • \n\t
  • 虎老师从台阶 1 开始。\n\t
      \n\t\t
    • 执行第一种操作，从台阶 1 向下走到台阶 0 。
      • \n\t\t
    • 执行第二种操作，向上走 20 级台阶到台阶 1 。
      • \n\t\t
    • 执行第一种操作，从台阶 1 向下走到台阶 0 。
      • \n\t
    \n\t
    • \n
\n
\n\n
示例 2：
\n\n
\n
输入：k = 1
\n\n
输出：4
\n\n
解释：
\n\n
4 种到达台阶 1 的方案为：
\n\n
    \n\t
  • 虎老师从台阶 1 开始，已经到达台阶 1 。
    • \n\t
  • 虎老师从台阶 1 开始。\n\t
      \n\t\t
    • 执行第一种操作，从台阶 1 向下走到台阶 0 。
      • \n\t\t
    • 执行第二种操作，向上走 20 级台阶到台阶 1 。
      • \n\t
    \n\t
    • \n\t
  • 虎老师从台阶 1 开始。\n\t
      \n\t\t
    • 执行第二种操作，向上走 20 级台阶到台阶 2 。
      • \n\t\t
    • 执行第一种操作，向下走 1 级台阶到台阶 1 。
      • \n\t
    \n\t
    • \n\t
  • 虎老师从台阶 1 开始。\n\t
      \n\t\t
    • 执行第一种操作，从台阶 1 向下走到台阶 0 。
      • \n\t\t
    • 执行第二种操作，向上走 20 级台阶到台阶 1 。
      • \n\t\t
    • 执行第一种操作，向下走 1 级台阶到台阶 0 。
      • \n\t\t
    • 执行第二种操作，向上走 21 级台阶到台阶 2 。
      • \n\t\t
    • 执行第一种操作，向下走 1 级台阶到台阶 1 。
      • \n\t
    \n\t
    • \n
\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 0 <= k <= 109
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Hard",
+            "likes": 10,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[{\"title\": \"Climbing Stairs\", \"titleSlug\": \"climbing-stairs\", \"difficulty\": \"Easy\", \"translatedTitle\": \"\\u722c\\u697c\\u68af\", \"isPaidOnly\": false}, {\"title\": \"Min Cost Climbing Stairs\", \"titleSlug\": \"min-cost-climbing-stairs\", \"difficulty\": \"Easy\", \"translatedTitle\": \"\\u4f7f\\u7528\\u6700\\u5c0f\\u82b1\\u8d39\\u722c\\u697c\\u68af\", \"isPaidOnly\": false}]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false, \"cangjie\": false}",
+            "topicTags": [
+                {
+                    "name": "Bit Manipulation",
+                    "slug": "bit-manipulation",
+                    "translatedName": "位运算",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Memoization",
+                    "slug": "memoization",
+                    "translatedName": "记忆化搜索",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Math",
+                    "slug": "math",
+                    "translatedName": "数学",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Dynamic Programming",
+                    "slug": "dynamic-programming",
+                    "translatedName": "动态规划",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Combinatorics",
+                    "slug": "combinatorics",
+                    "translatedName": "组合数学",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    int waysToReachStair(int k) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public int waysToReachStair(int k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def waysToReachStair(self, k):\n        \"\"\"\n        :type k: int\n        :rtype: int\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def waysToReachStair(self, k: int) -> int:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "int waysToReachStair(int k) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public int WaysToReachStair(int k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number} k\n * @return {number}\n */\nvar waysToReachStair = function(k) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function waysToReachStair(k: number): number {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer $k\n     * @return Integer\n     */\n    function waysToReachStair($k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func waysToReachStair(_ k: Int) -> Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun waysToReachStair(k: Int): Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  int waysToReachStair(int k) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func waysToReachStair(k int) int {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer} k\n# @return {Integer}\ndef ways_to_reach_stair(k)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def waysToReachStair(k: Int): Int = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn ways_to_reach_stair(k: i32) -> i32 {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (ways-to-reach-stair k)\n  (-> exact-integer? exact-integer?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec ways_to_reach_stair(K :: integer()) -> integer().\nways_to_reach_stair(K) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec ways_to_reach_stair(k :: integer) :: integer\n  def ways_to_reach_stair(k) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"3.3K\", \"totalSubmission\": \"7.2K\", \"totalAcceptedRaw\": 3260, \"totalSubmissionRaw\": 7168, \"acRate\": \"45.5%\"}",
+            "hints": [
+                "On using x operations of the second type and y operations of the first type, the stair 2x + 1 - y is reached.",
+                "Since first operations cannot be consecutive, there are exactly x + 1 positions (before and after each power of 2) to perform the second operation.",
+                "Using combinatorics, we have x + 1Cy number of ways to select the positions of second operations."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "0",
+            "metaData": "{\n  \"name\": \"waysToReachStair\",\n  \"params\": [\n    {\n      \"name\": \"k\",\n      \"type\": \"integer\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"integer\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0 C++ 20 \\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -gline-tables-only<\\/code> \\u53c2\\u6570\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528 GNU11 \\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -g1<\\/code> \\u53c2\\u6570\\u3002 AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.1.0<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2\\u3002\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 collection<\\/a> \\u5305<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "0\n1",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/find-occurrences-of-an-element-in-an-array.json b/leetcode-cn/originData/find-occurrences-of-an-element-in-an-array.json
new file mode 100644
index 00000000..e7f76a28
--- /dev/null
+++ b/leetcode-cn/originData/find-occurrences-of-an-element-in-an-array.json
@@ -0,0 +1,176 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3420",
+            "questionFrontendId": "3159",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2790208,
+            "title": "Find Occurrences of an Element in an Array",
+            "titleSlug": "find-occurrences-of-an-element-in-an-array",
+            "content": "
You are given an integer array nums, an integer array queries, and an integer x.
\n\n
For each queries[i], you need to find the index of the queries[i]th occurrence of x in the nums array. If there are fewer than queries[i] occurrences of x, the answer should be -1 for that query.
\n\n
Return an integer array answer containing the answers to all queries.
\n\n
 
\n
Example 1:
\n\n
\n
Input: nums = [1,3,1,7], queries = [1,3,2,4], x = 1
\n\n
Output: [0,-1,2,-1]
\n\n
Explanation:
\n\n
    \n\t
  • For the 1st query, the first occurrence of 1 is at index 0.
    • \n\t
  • For the 2nd query, there are only two occurrences of 1 in nums, so the answer is -1.
    • \n\t
  • For the 3rd query, the second occurrence of 1 is at index 2.
    • \n\t
  • For the 4th query, there are only two occurrences of 1 in nums, so the answer is -1.
    • \n
\n
\n\n
Example 2:
\n\n
\n
Input: nums = [1,2,3], queries = [10], x = 5
\n\n
Output: [-1]
\n\n
Explanation:
\n\n
    \n\t
  • For the 1st query, 5 doesn't exist in nums, so the answer is -1.
    • \n
\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 1 <= nums.length, queries.length <= 105
    • \n\t
  • 1 <= queries[i] <= 105
    • \n\t
  • 1 <= nums[i], x <= 104
    • \n
\n",
+            "translatedTitle": "查询数组中元素的出现位置",
+            "translatedContent": "
给你一个整数数组 nums ，一个整数数组 queries 和一个整数 x 。
\n\n
对于每个查询 queries[i] ，你需要找到 nums 中第 queries[i] 个 x 的位置，并返回它的下标。如果数组中 x 的出现次数少于 queries[i] ，该查询的答案为 -1 。
\n\n
请你返回一个整数数组 answer ，包含所有查询的答案。
\n\n
 
\n\n
示例 1：
\n\n
\n
输入：nums = [1,3,1,7], queries = [1,3,2,4], x = 1
\n\n
输出：[0,-1,2,-1]
\n\n
解释：
\n\n
    \n\t
  • 第 1 个查询，第一个 1 出现在下标 0 处。
    • \n\t
  • 第 2 个查询，nums 中只有两个 1 ，所以答案为 -1 。
    • \n\t
  • 第 3 个查询，第二个 1 出现在下标 2 处。
    • \n\t
  • 第 4 个查询，nums 中只有两个 1 ，所以答案为 -1 。
    • \n
\n
\n\n
示例 2：
\n\n
\n
输入：nums = [1,2,3], queries = [10], x = 5
\n\n
输出：[-1]
\n\n
解释：
\n\n
    \n\t
  • 第 1 个查询，nums 中没有 5 ，所以答案为 -1 。
    • \n
\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 1 <= nums.length, queries.length <= 105
    • \n\t
  • 1 <= queries[i] <= 105
    • \n\t
  • 1 <= nums[i], x <= 104
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Medium",
+            "likes": 3,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false, \"cangjie\": 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    vector occurrencesOfElement(vector& nums, vector& queries, int x) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public int[] occurrencesOfElement(int[] nums, int[] queries, int x) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def occurrencesOfElement(self, nums, queries, x):\n        \"\"\"\n        :type nums: List[int]\n        :type queries: List[int]\n        :type x: int\n        :rtype: List[int]\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def occurrencesOfElement(self, nums: List[int], queries: List[int], x: int) -> List[int]:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "/**\n * Note: The returned array must be malloced, assume caller calls free().\n */\nint* occurrencesOfElement(int* nums, int numsSize, int* queries, int queriesSize, int x, int* returnSize) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public int[] OccurrencesOfElement(int[] nums, int[] queries, int x) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number[]} nums\n * @param {number[]} queries\n * @param {number} x\n * @return {number[]}\n */\nvar occurrencesOfElement = function(nums, queries, x) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function occurrencesOfElement(nums: number[], queries: number[], x: number): number[] {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer[] $nums\n     * @param Integer[] $queries\n     * @param Integer $x\n     * @return Integer[]\n     */\n    function occurrencesOfElement($nums, $queries, $x) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func occurrencesOfElement(_ nums: [Int], _ queries: [Int], _ x: Int) -> [Int] {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun occurrencesOfElement(nums: IntArray, queries: IntArray, x: Int): IntArray {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  List occurrencesOfElement(List nums, List queries, int x) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func occurrencesOfElement(nums []int, queries []int, x int) []int {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer[]} nums\n# @param {Integer[]} queries\n# @param {Integer} x\n# @return {Integer[]}\ndef occurrences_of_element(nums, queries, x)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def occurrencesOfElement(nums: Array[Int], queries: Array[Int], x: Int): Array[Int] = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn occurrences_of_element(nums: Vec, queries: Vec, x: i32) -> Vec {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (occurrences-of-element nums queries x)\n  (-> (listof exact-integer?) (listof exact-integer?) exact-integer? (listof exact-integer?))\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec occurrences_of_element(Nums :: [integer()], Queries :: [integer()], X :: integer()) -> [integer()].\noccurrences_of_element(Nums, Queries, X) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec occurrences_of_element(nums :: [integer], queries :: [integer], x :: integer) :: [integer]\n  def occurrences_of_element(nums, queries, x) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"3.1K\", \"totalSubmission\": \"3.7K\", \"totalAcceptedRaw\": 3117, \"totalSubmissionRaw\": 3746, \"acRate\": \"83.2%\"}",
+            "hints": [
+                "Compress the array nums and save all the occurrences of each element in the separate arrays."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[1,3,1,7]\n[1,3,2,4]\n1",
+            "metaData": "{\n  \"name\": \"occurrencesOfElement\",\n  \"params\": [\n    {\n      \"name\": \"nums\",\n      \"type\": \"integer[]\"\n    },\n    {\n      \"type\": \"integer[]\",\n      \"name\": \"queries\"\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 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0 C++ 20 \\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -gline-tables-only<\\/code> \\u53c2\\u6570\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528 GNU11 \\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -g1<\\/code> \\u53c2\\u6570\\u3002 AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.1.0<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2\\u3002\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 collection<\\/a> \\u5305<\\/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,1,7]\n[1,3,2,4]\n1\n[1,2,3]\n[10]\n5",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/find-subarray-with-bitwise-and-closest-to-k.json b/leetcode-cn/originData/find-subarray-with-bitwise-and-closest-to-k.json
new file mode 100644
index 00000000..a6304b5b
--- /dev/null
+++ b/leetcode-cn/originData/find-subarray-with-bitwise-and-closest-to-k.json
@@ -0,0 +1,190 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3436",
+            "questionFrontendId": "3171",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2796501,
+            "title": "Find Subarray With Bitwise AND Closest to K",
+            "titleSlug": "find-subarray-with-bitwise-and-closest-to-k",
+            "content": "
You are given an array nums and an integer k. You need to find a subarray of nums such that the absolute difference between k and the bitwise AND of the subarray elements is as small as possible. In other words, select a subarray nums[l..r] such that |k - (nums[l] AND nums[l + 1] ... AND nums[r])| is minimum.
\n\n
Return the minimum possible value of the absolute difference.
\n\n
A subarray is a contiguous non-empty sequence of elements within an array.
\n\n
 
\n
Example 1:
\n\n
\n
Input: nums = [1,2,4,5], k = 3
\n\n
Output: 1
\n\n
Explanation:
\n\n
The subarray nums[2..3] has AND value 4, which gives the minimum absolute difference |3 - 4| = 1.
\n
\n\n
Example 2:
\n\n
\n
Input: nums = [1,2,1,2], k = 2
\n\n
Output: 0
\n\n
Explanation:
\n\n
The subarray nums[1..1] has AND value 2, which gives the minimum absolute difference |2 - 2| = 0.
\n
\n\n
Example 3:
\n\n
\n
Input: nums = [1], k = 10
\n\n
Output: 9
\n\n
Explanation:
\n\n
There is a single subarray with AND value 1, which gives the minimum absolute difference |10 - 1| = 9.
\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 1 <= nums.length <= 105
    • \n\t
  • 1 <= nums[i] <= 109
    • \n\t
  • 1 <= k <= 109
    • \n
\n",
+            "translatedTitle": "找到按位与最接近 K 的子数组",
+            "translatedContent": "
给你一个数组 nums 和一个整数 k 。你需要找到 nums 的一个 子数组 ，满足子数组中所有元素按位与运算 AND 的值与 k 的 绝对差 尽可能 小 。换言之，你需要选择一个子数组 nums[l..r] 满足 |k - (nums[l] AND nums[l + 1] ... AND nums[r])| 最小。
\n\n
请你返回 最小 的绝对差值。
\n\n
子数组是数组中连续的 非空 元素序列。
\n\n
 
\n\n
示例 1：
\n\n
\n
输入：nums = [1,2,4,5], k = 3
\n\n
输出：1
\n\n
解释：
\n\n
子数组 nums[2..3] 的按位 AND 运算值为 4 ，得到最小差值 |3 - 4| = 1 。
\n
\n\n
示例 2：
\n\n
\n
输入：nums = [1,2,1,2], k = 2
\n\n
输出：0
\n\n
解释：
\n\n
子数组 nums[1..1] 的按位 AND 运算值为 2 ，得到最小差值 |2 - 2| = 0 。
\n
\n\n
示例 3：
\n\n
\n
输入：nums = [1], k = 10
\n\n
输出：9
\n\n
解释：
\n\n
只有一个子数组，按位 AND 运算值为 1 ，得到最小差值 |10 - 1| = 9 。
\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 1 <= nums.length <= 105
    • \n\t
  • 1 <= nums[i] <= 109
    • \n\t
  • 1 <= k <= 109
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Hard",
+            "likes": 6,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[{\"title\": \"Minimum Sum of Values by Dividing Array\", \"titleSlug\": \"minimum-sum-of-values-by-dividing-array\", \"difficulty\": \"Hard\", \"translatedTitle\": \"\\u5212\\u5206\\u6570\\u7ec4\\u5f97\\u5230\\u6700\\u5c0f\\u7684\\u503c\\u4e4b\\u548c\", \"isPaidOnly\": false}]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false, \"cangjie\": false}",
+            "topicTags": [
+                {
+                    "name": "Bit Manipulation",
+                    "slug": "bit-manipulation",
+                    "translatedName": "位运算",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Segment Tree",
+                    "slug": "segment-tree",
+                    "translatedName": "线段树",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Binary Search",
+                    "slug": "binary-search",
+                    "translatedName": "二分查找",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    int minimumDifference(vector& nums, int k) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public int minimumDifference(int[] nums, int k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def minimumDifference(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 minimumDifference(self, nums: List[int], k: int) -> int:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "int minimumDifference(int* nums, int numsSize, int k) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public int MinimumDifference(int[] nums, int k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number[]} nums\n * @param {number} k\n * @return {number}\n */\nvar minimumDifference = function(nums, k) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function minimumDifference(nums: number[], k: number): number {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer[] $nums\n     * @param Integer $k\n     * @return Integer\n     */\n    function minimumDifference($nums, $k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func minimumDifference(_ nums: [Int], _ k: Int) -> Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun minimumDifference(nums: IntArray, k: Int): Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  int minimumDifference(List nums, int k) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func minimumDifference(nums []int, k int) int {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer[]} nums\n# @param {Integer} k\n# @return {Integer}\ndef minimum_difference(nums, k)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def minimumDifference(nums: Array[Int], k: Int): Int = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn minimum_difference(nums: Vec, k: i32) -> i32 {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (minimum-difference nums k)\n  (-> (listof exact-integer?) exact-integer? exact-integer?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec minimum_difference(Nums :: [integer()], K :: integer()) -> integer().\nminimum_difference(Nums, K) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec minimum_difference(nums :: [integer], k :: integer) :: integer\n  def minimum_difference(nums, k) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"2.8K\", \"totalSubmission\": \"7.3K\", \"totalAcceptedRaw\": 2751, \"totalSubmissionRaw\": 7318, \"acRate\": \"37.6%\"}",
+            "hints": [
+                "Let dp[i] be the set of all the bitwise AND of all the subarrays ending at index i.",
+                "We start from nums[i], taking the bitwise AND result by including elements one by one from i towards left. Notice that only set bits can become unset on adding a element, and unset bits never become set again.",
+                "Hence dp[i] can contain at most 30 elements."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[1,2,4,5]\n3",
+            "metaData": "{\n  \"name\": \"minimumDifference\",\n  \"params\": [\n    {\n      \"name\": \"nums\",\n      \"type\": \"integer[]\"\n    },\n    {\n      \"type\": \"integer\",\n      \"name\": \"k\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"integer\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0 C++ 20 \\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -gline-tables-only<\\/code> \\u53c2\\u6570\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528 GNU11 \\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -g1<\\/code> \\u53c2\\u6570\\u3002 AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.1.0<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2\\u3002\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 collection<\\/a> \\u5305<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "[1,2,4,5]\n3\n[1,2,1,2]\n2\n[1]\n10",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/find-the-number-of-distinct-colors-among-the-balls.json b/leetcode-cn/originData/find-the-number-of-distinct-colors-among-the-balls.json
new file mode 100644
index 00000000..620b4b34
--- /dev/null
+++ b/leetcode-cn/originData/find-the-number-of-distinct-colors-among-the-balls.json
@@ -0,0 +1,182 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3434",
+            "questionFrontendId": "3160",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2790207,
+            "title": "Find the Number of Distinct Colors Among the Balls",
+            "titleSlug": "find-the-number-of-distinct-colors-among-the-balls",
+            "content": "
You are given an integer limit and a 2D array queries of size n x 2.
\n\n
There are limit + 1 balls with distinct labels in the range [0, limit]. Initially, all balls are uncolored. For every query in queries that is of the form [x, y], you mark ball x with the color y. After each query, you need to find the number of distinct colors among the balls.
\n\n
Return an array result of length n, where result[i] denotes the number of distinct colors after ith query.
\n\n
Note that when answering a query, lack of a color will not be considered as a color.
\n\n
 
\n
Example 1:
\n\n
\n
Input: limit = 4, queries = [[1,4],[2,5],[1,3],[3,4]]
\n\n
Output: [1,2,2,3]
\n\n
Explanation:
\n\n
\"\"
\n\n
    \n\t
  • After query 0, ball 1 has color 4.
    • \n\t
  • After query 1, ball 1 has color 4, and ball 2 has color 5.
    • \n\t
  • After query 2, ball 1 has color 3, and ball 2 has color 5.
    • \n\t
  • After query 3, ball 1 has color 3, ball 2 has color 5, and ball 3 has color 4.
    • \n
\n
\n\n
Example 2:
\n\n
\n
Input: limit = 4, queries = [[0,1],[1,2],[2,2],[3,4],[4,5]]
\n\n
Output: [1,2,2,3,4]
\n\n
Explanation:
\n\n
\"\"
\n\n
    \n\t
  • After query 0, ball 0 has color 1.
    • \n\t
  • After query 1, ball 0 has color 1, and ball 1 has color 2.
    • \n\t
  • After query 2, ball 0 has color 1, and balls 1 and 2 have color 2.
    • \n\t
  • After query 3, ball 0 has color 1, balls 1 and 2 have color 2, and ball 3 has color 4.
    • \n\t
  • After query 4, ball 0 has color 1, balls 1 and 2 have color 2, ball 3 has color 4, and ball 4 has color 5.
    • \n
\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 1 <= limit <= 109
    • \n\t
  • 1 <= n == queries.length <= 105
    • \n\t
  • queries[i].length == 2
    • \n\t
  • 0 <= queries[i][0] <= limit
    • \n\t
  • 1 <= queries[i][1] <= 109
    • \n
\n",
+            "translatedTitle": "所有球里面不同颜色的数目",
+            "translatedContent": "
给你一个整数 limit 和一个大小为 n x 2 的二维数组 queries 。
\n\n
总共有 limit + 1 个球，每个球的编号为 [0, limit] 中一个 互不相同 的数字。一开始，所有球都没有颜色。queries 中每次操作的格式为 [x, y] ，你需要将球 x 染上颜色 y 。每次操作之后，你需要求出所有球中 不同 颜色的数目。
\n\n
请你返回一个长度为 n 的数组 result ，其中 result[i] 是第 i 次操作以后不同颜色的数目。
\n\n
注意 ，没有染色的球不算作一种颜色。
\n\n
 
\n\n
示例 1：
\n\n
\n
输入：limit = 4, queries = [[1,4],[2,5],[1,3],[3,4]]
\n\n
输出：[1,2,2,3]
\n\n
解释：
\n\n
\"\"
\n\n
    \n\t
  • 操作 0 后，球 1 颜色为 4 。
    • \n\t
  • 操作 1 后，球 1 颜色为 4 ，球 2 颜色为 5 。
    • \n\t
  • 操作 2 后，球 1 颜色为 3 ，球 2 颜色为 5 。
    • \n\t
  • 操作 3 后，球 1 颜色为 3 ，球 2 颜色为 5 ，球 3 颜色为 4 。
    • \n
\n
\n\n
示例 2：
\n\n
\n
输入：limit = 4, queries = [[0,1],[1,2],[2,2],[3,4],[4,5]]
\n\n
输出：[1,2,2,3,4]
\n\n
解释：
\n\n
\"\"
\n\n
    \n\t
  • 操作 0 后，球 0 颜色为 1 。
    • \n\t
  • 操作 1 后，球 0 颜色为 1 ，球 1 颜色为 2 。
    • \n\t
  • 操作 2 后，球 0 颜色为 1 ，球 1 和 2 颜色为 2 。
    • \n\t
  • 操作 3 后，球 0 颜色为 1 ，球 1 和 2 颜色为 2 ，球 3 颜色为 4 。
    • \n\t
  • 操作 4 后，球 0 颜色为 1 ，球 1 和 2 颜色为 2 ，球 3 颜色为 4 ，球 4 颜色为 5 。
    • \n
\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 1 <= limit <= 109
    • \n\t
  • 1 <= n == queries.length <= 105
    • \n\t
  • queries[i].length == 2
    • \n\t
  • 0 <= queries[i][0] <= limit
    • \n\t
  • 1 <= queries[i][1] <= 109
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Medium",
+            "likes": 3,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[{\"title\": \"Maximum Number of Balls in a Box\", \"titleSlug\": \"maximum-number-of-balls-in-a-box\", \"difficulty\": \"Easy\", \"translatedTitle\": \"\\u76d2\\u5b50\\u4e2d\\u5c0f\\u7403\\u7684\\u6700\\u5927\\u6570\\u91cf\", \"isPaidOnly\": false}]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": false, \"java\": true, \"python\": true, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false, \"cangjie\": false}",
+            "topicTags": [
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Hash Table",
+                    "slug": "hash-table",
+                    "translatedName": "哈希表",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Simulation",
+                    "slug": "simulation",
+                    "translatedName": "模拟",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    vector queryResults(int limit, vector>& queries) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public int[] queryResults(int limit, int[][] queries) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def queryResults(self, limit, queries):\n        \"\"\"\n        :type limit: int\n        :type queries: List[List[int]]\n        :rtype: List[int]\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def queryResults(self, limit: int, queries: List[List[int]]) -> List[int]:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "/**\n * Note: The returned array must be malloced, assume caller calls free().\n */\nint* queryResults(int limit, int** queries, int queriesSize, int* queriesColSize, int* returnSize) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public int[] QueryResults(int limit, int[][] queries) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number} limit\n * @param {number[][]} queries\n * @return {number[]}\n */\nvar queryResults = function(limit, queries) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function queryResults(limit: number, queries: number[][]): number[] {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer $limit\n     * @param Integer[][] $queries\n     * @return Integer[]\n     */\n    function queryResults($limit, $queries) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func queryResults(_ limit: Int, _ queries: [[Int]]) -> [Int] {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun queryResults(limit: Int, queries: Array): IntArray {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  List queryResults(int limit, List> queries) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func queryResults(limit int, queries [][]int) []int {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer} limit\n# @param {Integer[][]} queries\n# @return {Integer[]}\ndef query_results(limit, queries)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def queryResults(limit: Int, queries: Array[Array[Int]]): Array[Int] = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn query_results(limit: i32, queries: Vec>) -> Vec {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (query-results limit queries)\n  (-> exact-integer? (listof (listof exact-integer?)) (listof exact-integer?))\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec query_results(Limit :: integer(), Queries :: [[integer()]]) -> [integer()].\nquery_results(Limit, Queries) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec query_results(limit :: integer, queries :: [[integer]]) :: [integer]\n  def query_results(limit, queries) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"2.9K\", \"totalSubmission\": \"6.7K\", \"totalAcceptedRaw\": 2864, \"totalSubmissionRaw\": 6650, \"acRate\": \"43.1%\"}",
+            "hints": [
+                "Use two HashMaps to maintain the color of each ball and the set of balls with each color."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "4\n[[1,4],[2,5],[1,3],[3,4]]",
+            "metaData": "{\n  \"name\": \"queryResults\",\n  \"params\": [\n    {\n      \"name\": \"limit\",\n      \"type\": \"integer\"\n    },\n    {\n      \"type\": \"integer[][]\",\n      \"name\": \"queries\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"integer[]\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0 C++ 20 \\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -gline-tables-only<\\/code> \\u53c2\\u6570\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528 GNU11 \\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -g1<\\/code> \\u53c2\\u6570\\u3002 AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.1.0<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2\\u3002\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 collection<\\/a> \\u5305<\\/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\n[[1,4],[2,5],[1,3],[3,4]]\n4\n[[0,1],[1,2],[2,2],[3,4],[4,5]]",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/find-the-number-of-good-pairs-i.json b/leetcode-cn/originData/find-the-number-of-good-pairs-i.json
new file mode 100644
index 00000000..44e4f1f3
--- /dev/null
+++ b/leetcode-cn/originData/find-the-number-of-good-pairs-i.json
@@ -0,0 +1,176 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3446",
+            "questionFrontendId": "3162",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2789290,
+            "title": "Find the Number of Good Pairs I",
+            "titleSlug": "find-the-number-of-good-pairs-i",
+            "content": "
You are given 2 integer arrays nums1 and nums2 of lengths n and m respectively. You are also given a positive integer k.
\n\n
A pair (i, j) is called good if nums1[i] is divisible by nums2[j] * k (0 <= i <= n - 1, 0 <= j <= m - 1).
\n\n
Return the total number of good pairs.
\n\n
 
\n
Example 1:
\n\n
\n
Input: nums1 = [1,3,4], nums2 = [1,3,4], k = 1
\n\n
Output: 5
\n\n
Explanation:
\nThe 5 good pairs are (0, 0), (1, 0), (1, 1), (2, 0), and (2, 2).
\n\n
Example 2:
\n\n
\n
Input: nums1 = [1,2,4,12], nums2 = [2,4], k = 3
\n\n
Output: 2
\n\n
Explanation:
\n\n
The 2 good pairs are (3, 0) and (3, 1).
\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 1 <= n, m <= 50
    • \n\t
  • 1 <= nums1[i], nums2[j] <= 50
    • \n\t
  • 1 <= k <= 50
    • \n
\n",
+            "translatedTitle": "优质数对的总数 I",
+            "translatedContent": "
给你两个整数数组 nums1 和 nums2，长度分别为 n 和 m。同时给你一个正整数 k。
\n\n
如果 nums1[i] 可以被 nums2[j] * k 整除，则称数对 (i, j) 为 优质数对（0 <= i <= n - 1, 0 <= j <= m - 1）。
\n\n
返回 优质数对 的总数。
\n\n
 
\n\n
示例 1：
\n\n
\n
输入：nums1 = [1,3,4], nums2 = [1,3,4], k = 1
\n\n
输出：5
\n\n
解释：
\n\n
5个优质数对分别是 (0, 0), (1, 0), (1, 1), (2, 0), 和 (2, 2)。
\n
\n\n
示例 2：
\n\n
\n
输入：nums1 = [1,2,4,12], nums2 = [2,4], k = 3
\n\n
输出：2
\n\n
解释：
\n\n
2个优质数对分别是 (3, 0) 和 (3, 1)。
\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 1 <= n, m <= 50
    • \n\t
  • 1 <= nums1[i], nums2[j] <= 50
    • \n\t
  • 1 <= k <= 50
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Easy",
+            "likes": 1,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[{\"title\": \"Count Array Pairs Divisible by K\", \"titleSlug\": \"count-array-pairs-divisible-by-k\", \"difficulty\": \"Hard\", \"translatedTitle\": \"\\u7edf\\u8ba1\\u53ef\\u4ee5\\u88ab K \\u6574\\u9664\\u7684\\u4e0b\\u6807\\u5bf9\\u6570\\u76ee\", \"isPaidOnly\": false}]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false, \"cangjie\": 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 numberOfPairs(vector& nums1, vector& nums2, int k) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public int numberOfPairs(int[] nums1, int[] nums2, int k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def numberOfPairs(self, nums1, nums2, k):\n        \"\"\"\n        :type nums1: List[int]\n        :type nums2: List[int]\n        :type k: int\n        :rtype: int\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def numberOfPairs(self, nums1: List[int], nums2: List[int], k: int) -> int:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "int numberOfPairs(int* nums1, int nums1Size, int* nums2, int nums2Size, int k) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public int NumberOfPairs(int[] nums1, int[] nums2, int k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number[]} nums1\n * @param {number[]} nums2\n * @param {number} k\n * @return {number}\n */\nvar numberOfPairs = function(nums1, nums2, k) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function numberOfPairs(nums1: number[], nums2: number[], k: number): number {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer[] $nums1\n     * @param Integer[] $nums2\n     * @param Integer $k\n     * @return Integer\n     */\n    function numberOfPairs($nums1, $nums2, $k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func numberOfPairs(_ nums1: [Int], _ nums2: [Int], _ k: Int) -> Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun numberOfPairs(nums1: IntArray, nums2: IntArray, k: Int): Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  int numberOfPairs(List nums1, List nums2, int k) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func numberOfPairs(nums1 []int, nums2 []int, k int) int {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer[]} nums1\n# @param {Integer[]} nums2\n# @param {Integer} k\n# @return {Integer}\ndef number_of_pairs(nums1, nums2, k)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def numberOfPairs(nums1: Array[Int], nums2: Array[Int], k: Int): Int = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn number_of_pairs(nums1: Vec, nums2: Vec, k: i32) -> i32 {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (number-of-pairs nums1 nums2 k)\n  (-> (listof exact-integer?) (listof exact-integer?) exact-integer? exact-integer?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec number_of_pairs(Nums1 :: [integer()], Nums2 :: [integer()], K :: integer()) -> integer().\nnumber_of_pairs(Nums1, Nums2, K) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec number_of_pairs(nums1 :: [integer], nums2 :: [integer], k :: integer) :: integer\n  def number_of_pairs(nums1, nums2, k) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"5.2K\", \"totalSubmission\": \"6.4K\", \"totalAcceptedRaw\": 5216, \"totalSubmissionRaw\": 6397, \"acRate\": \"81.5%\"}",
+            "hints": [
+                "The constraints are small. Check all pairs."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[1,3,4]\n[1,3,4]\n1",
+            "metaData": "{\n  \"name\": \"numberOfPairs\",\n  \"params\": [\n    {\n      \"name\": \"nums1\",\n      \"type\": \"integer[]\"\n    },\n    {\n      \"type\": \"integer[]\",\n      \"name\": \"nums2\"\n    },\n    {\n      \"type\": \"integer\",\n      \"name\": \"k\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"integer\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0 C++ 20 \\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -gline-tables-only<\\/code> \\u53c2\\u6570\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528 GNU11 \\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -g1<\\/code> \\u53c2\\u6570\\u3002 AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.1.0<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2\\u3002\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 collection<\\/a> \\u5305<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "[1,3,4]\n[1,3,4]\n1\n[1,2,4,12]\n[2,4]\n3",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/find-the-number-of-good-pairs-ii.json b/leetcode-cn/originData/find-the-number-of-good-pairs-ii.json
new file mode 100644
index 00000000..81027a66
--- /dev/null
+++ b/leetcode-cn/originData/find-the-number-of-good-pairs-ii.json
@@ -0,0 +1,178 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3444",
+            "questionFrontendId": "3164",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2789292,
+            "title": "Find the Number of Good Pairs II",
+            "titleSlug": "find-the-number-of-good-pairs-ii",
+            "content": "
You are given 2 integer arrays nums1 and nums2 of lengths n and m respectively. You are also given a positive integer k.
\n\n
A pair (i, j) is called good if nums1[i] is divisible by nums2[j] * k (0 <= i <= n - 1, 0 <= j <= m - 1).
\n\n
Return the total number of good pairs.
\n\n
 
\n
Example 1:
\n\n
\n
Input: nums1 = [1,3,4], nums2 = [1,3,4], k = 1
\n\n
Output: 5
\n\n
Explanation:
\nThe 5 good pairs are (0, 0), (1, 0), (1, 1), (2, 0), and (2, 2).
\n\n
Example 2:
\n\n
\n
Input: nums1 = [1,2,4,12], nums2 = [2,4], k = 3
\n\n
Output: 2
\n\n
Explanation:
\n\n
The 2 good pairs are (3, 0) and (3, 1).
\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 1 <= n, m <= 105
    • \n\t
  • 1 <= nums1[i], nums2[j] <= 106
    • \n\t
  • 1 <= k <= 103
    • \n
\n",
+            "translatedTitle": "优质数对的总数 II",
+            "translatedContent": "
给你两个整数数组 nums1 和 nums2，长度分别为 n 和 m。同时给你一个正整数 k。
\n\n
如果 nums1[i] 可以被 nums2[j] * k 整除，则称数对 (i, j) 为 优质数对（0 <= i <= n - 1, 0 <= j <= m - 1）。
\n\n
返回 优质数对 的总数。
\n\n
 
\n\n
示例 1：
\n\n
\n
输入：nums1 = [1,3,4], nums2 = [1,3,4], k = 1
\n\n
输出：5
\n\n
解释：
\n\n
5个优质数对分别是 (0, 0), (1, 0), (1, 1), (2, 0), 和 (2, 2)。
\n
\n\n
示例 2：
\n\n
\n
输入：nums1 = [1,2,4,12], nums2 = [2,4], k = 3
\n\n
输出：2
\n\n
解释：
\n\n
2个优质数对分别是 (3, 0) 和 (3, 1)。
\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 1 <= n, m <= 105
    • \n\t
  • 1 <= nums1[i], nums2[j] <= 106
    • \n\t
  • 1 <= k <= 103
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Medium",
+            "likes": 11,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[{\"title\": \"Count Array Pairs Divisible by K\", \"titleSlug\": \"count-array-pairs-divisible-by-k\", \"difficulty\": \"Hard\", \"translatedTitle\": \"\\u7edf\\u8ba1\\u53ef\\u4ee5\\u88ab K \\u6574\\u9664\\u7684\\u4e0b\\u6807\\u5bf9\\u6570\\u76ee\", \"isPaidOnly\": false}]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": false, \"java\": false, \"python\": false, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false, \"cangjie\": 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    long long numberOfPairs(vector& nums1, vector& nums2, int k) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public long numberOfPairs(int[] nums1, int[] nums2, int k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def numberOfPairs(self, nums1, nums2, k):\n        \"\"\"\n        :type nums1: List[int]\n        :type nums2: List[int]\n        :type k: int\n        :rtype: int\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def numberOfPairs(self, nums1: List[int], nums2: List[int], k: int) -> int:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "long long numberOfPairs(int* nums1, int nums1Size, int* nums2, int nums2Size, int k) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public long NumberOfPairs(int[] nums1, int[] nums2, int k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number[]} nums1\n * @param {number[]} nums2\n * @param {number} k\n * @return {number}\n */\nvar numberOfPairs = function(nums1, nums2, k) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function numberOfPairs(nums1: number[], nums2: number[], k: number): number {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer[] $nums1\n     * @param Integer[] $nums2\n     * @param Integer $k\n     * @return Integer\n     */\n    function numberOfPairs($nums1, $nums2, $k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func numberOfPairs(_ nums1: [Int], _ nums2: [Int], _ k: Int) -> Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun numberOfPairs(nums1: IntArray, nums2: IntArray, k: Int): Long {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  int numberOfPairs(List nums1, List nums2, int k) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func numberOfPairs(nums1 []int, nums2 []int, k int) int64 {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer[]} nums1\n# @param {Integer[]} nums2\n# @param {Integer} k\n# @return {Integer}\ndef number_of_pairs(nums1, nums2, k)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def numberOfPairs(nums1: Array[Int], nums2: Array[Int], k: Int): Long = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn number_of_pairs(nums1: Vec, nums2: Vec, k: i32) -> i64 {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (number-of-pairs nums1 nums2 k)\n  (-> (listof exact-integer?) (listof exact-integer?) exact-integer? exact-integer?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec number_of_pairs(Nums1 :: [integer()], Nums2 :: [integer()], K :: integer()) -> integer().\nnumber_of_pairs(Nums1, Nums2, K) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec number_of_pairs(nums1 :: [integer], nums2 :: [integer], k :: integer) :: integer\n  def number_of_pairs(nums1, nums2, k) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"4.6K\", \"totalSubmission\": \"15.5K\", \"totalAcceptedRaw\": 4619, \"totalSubmissionRaw\": 15477, \"acRate\": \"29.8%\"}",
+            "hints": [
+                "Let f[v] be the number of occurrences of v/k in nums2.",
+                "For each value v in nums1, enumerating all its factors d (in sqrt(v) time) and sum up all the f[d] to get the final answer.",
+                "It is also possible to improve the complexity from v * sqrt(v) to v * log(v) - How?"
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[1,3,4]\n[1,3,4]\n1",
+            "metaData": "{\n  \"name\": \"numberOfPairs\",\n  \"params\": [\n    {\n      \"name\": \"nums1\",\n      \"type\": \"integer[]\"\n    },\n    {\n      \"type\": \"integer[]\",\n      \"name\": \"nums2\"\n    },\n    {\n      \"type\": \"integer\",\n      \"name\": \"k\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"long\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0 C++ 20 \\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -gline-tables-only<\\/code> \\u53c2\\u6570\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528 GNU11 \\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -g1<\\/code> \\u53c2\\u6570\\u3002 AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.1.0<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2\\u3002\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 collection<\\/a> \\u5305<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "[1,3,4]\n[1,3,4]\n1\n[1,2,4,12]\n[2,4]\n3",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/find-the-xor-of-numbers-which-appear-twice.json b/leetcode-cn/originData/find-the-xor-of-numbers-which-appear-twice.json
new file mode 100644
index 00000000..741a0993
--- /dev/null
+++ b/leetcode-cn/originData/find-the-xor-of-numbers-which-appear-twice.json
@@ -0,0 +1,182 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3428",
+            "questionFrontendId": "3158",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2787115,
+            "title": "Find the XOR of Numbers Which Appear Twice",
+            "titleSlug": "find-the-xor-of-numbers-which-appear-twice",
+            "content": "
You are given an array nums, where each number in the array appears either once or twice.
\n\n
Return the bitwise XOR of all the numbers that appear twice in the array, or 0 if no number appears twice.
\n\n
 
\n
Example 1:
\n\n
\n
Input: nums = [1,2,1,3]
\n\n
Output: 1
\n\n
Explanation:
\n\n
The only number that appears twice in nums is 1.
\n
\n\n
Example 2:
\n\n
\n
Input: nums = [1,2,3]
\n\n
Output: 0
\n\n
Explanation:
\n\n
No number appears twice in nums.
\n
\n\n
Example 3:
\n\n
\n
Input: nums = [1,2,2,1]
\n\n
Output: 3
\n\n
Explanation:
\n\n
Numbers 1 and 2 appeared twice. 1 XOR 2 == 3.
\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 1 <= nums.length <= 50
    • \n\t
  • 1 <= nums[i] <= 50
    • \n\t
  • Each number in nums appears either once or twice.
    • \n
\n",
+            "translatedTitle": "求出出现两次数字的 XOR 值",
+            "translatedContent": "
给你一个数组 nums ，数组中的数字 要么 出现一次，要么 出现两次。
\n\n
请你返回数组中所有出现两次数字的按位 XOR 值，如果没有数字出现过两次，返回 0 。
\n\n
 
\n\n
示例 1：
\n\n
\n
输入：nums = [1,2,1,3]
\n\n
输出：1
\n\n
解释：
\n\n
nums 中唯一出现过两次的数字是 1 。
\n
\n\n
示例 2：
\n\n
\n
输入：nums = [1,2,3]
\n\n
输出：0
\n\n
解释：
\n\n
nums 中没有数字出现两次。
\n
\n\n
示例 3：
\n\n
\n
输入：nums = [1,2,2,1]
\n\n
输出：3
\n\n
解释：
\n\n
数字 1 和 2 出现过两次。1 XOR 2 == 3 。
\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 1 <= nums.length <= 50
    • \n\t
  • 1 <= nums[i] <= 50
    • \n\t
  • nums 中每个数字要么出现过一次，要么出现过两次。
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Easy",
+            "likes": 1,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[{\"title\": \"Single Number\", \"titleSlug\": \"single-number\", \"difficulty\": \"Easy\", \"translatedTitle\": \"\\u53ea\\u51fa\\u73b0\\u4e00\\u6b21\\u7684\\u6570\\u5b57\", \"isPaidOnly\": false}, {\"title\": \"Single Number II\", \"titleSlug\": \"single-number-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u53ea\\u51fa\\u73b0\\u4e00\\u6b21\\u7684\\u6570\\u5b57 II\", \"isPaidOnly\": false}, {\"title\": \"Single Number III\", \"titleSlug\": \"single-number-iii\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u53ea\\u51fa\\u73b0\\u4e00\\u6b21\\u7684\\u6570\\u5b57 III\", \"isPaidOnly\": false}]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false, \"cangjie\": false}",
+            "topicTags": [
+                {
+                    "name": "Bit Manipulation",
+                    "slug": "bit-manipulation",
+                    "translatedName": "位运算",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "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 duplicateNumbersXOR(vector& nums) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public int duplicateNumbersXOR(int[] nums) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def duplicateNumbersXOR(self, nums):\n        \"\"\"\n        :type nums: List[int]\n        :rtype: int\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def duplicateNumbersXOR(self, nums: List[int]) -> int:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "int duplicateNumbersXOR(int* nums, int numsSize) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public int DuplicateNumbersXOR(int[] nums) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number[]} nums\n * @return {number}\n */\nvar duplicateNumbersXOR = function(nums) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function duplicateNumbersXOR(nums: number[]): number {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer[] $nums\n     * @return Integer\n     */\n    function duplicateNumbersXOR($nums) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func duplicateNumbersXOR(_ nums: [Int]) -> Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun duplicateNumbersXOR(nums: IntArray): Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  int duplicateNumbersXOR(List nums) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func duplicateNumbersXOR(nums []int) int {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer[]} nums\n# @return {Integer}\ndef duplicate_numbers_xor(nums)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def duplicateNumbersXOR(nums: Array[Int]): Int = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn duplicate_numbers_xor(nums: Vec) -> i32 {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (duplicate-numbers-xor nums)\n  (-> (listof exact-integer?) exact-integer?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec duplicate_numbers_xor(Nums :: [integer()]) -> integer().\nduplicate_numbers_xor(Nums) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec duplicate_numbers_xor(nums :: [integer]) :: integer\n  def duplicate_numbers_xor(nums) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"3.2K\", \"totalSubmission\": \"4K\", \"totalAcceptedRaw\": 3167, \"totalSubmissionRaw\": 3954, \"acRate\": \"80.1%\"}",
+            "hints": [
+                "The constraints are small. Brute force checking each value in the array."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[1,2,1,3]",
+            "metaData": "{\n  \"name\": \"duplicateNumbersXOR\",\n  \"params\": [\n    {\n      \"name\": \"nums\",\n      \"type\": \"integer[]\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"integer\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0 C++ 20 \\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -gline-tables-only<\\/code> \\u53c2\\u6570\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528 GNU11 \\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -g1<\\/code> \\u53c2\\u6570\\u3002 AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.1.0<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2\\u3002\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 collection<\\/a> \\u5305<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "[1,2,1,3]\n[1,2,3]\n[1,2,2,1]",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/lexicographically-minimum-string-after-removing-stars.json b/leetcode-cn/originData/lexicographically-minimum-string-after-removing-stars.json
new file mode 100644
index 00000000..1f37c9e8
--- /dev/null
+++ b/leetcode-cn/originData/lexicographically-minimum-string-after-removing-stars.json
@@ -0,0 +1,192 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3445",
+            "questionFrontendId": "3170",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2796495,
+            "title": "Lexicographically Minimum String After Removing Stars",
+            "titleSlug": "lexicographically-minimum-string-after-removing-stars",
+            "content": "
You are given a string s. It may contain any number of '*' characters. Your task is to remove all '*' characters.
\n\n
While there is a '*', do the following operation:
\n\n
    \n\t
  • Delete the leftmost '*' and the smallest non-'*' character to its left. If there are several smallest characters, you can delete any of them.
    • \n
\n\n
Return the lexicographically smallest resulting string after removing all '*' characters.
\n\n
 
\n
Example 1:
\n\n
\n
Input: s = "aaba*"
\n\n
Output: "aab"
\n\n
Explanation:
\n\n
We should delete one of the 'a' characters with '*'. If we choose s[3], s becomes the lexicographically smallest.
\n
\n\n
Example 2:
\n\n
\n
Input: s = "abc"
\n\n
Output: "abc"
\n\n
Explanation:
\n\n
There is no '*' in the string.
\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 1 <= s.length <= 105
    • \n\t
  • s consists only of lowercase English letters and '*'.
    • \n\t
  • The input is generated such that it is possible to delete all '*' characters.
    • \n
\n",
+            "translatedTitle": "删除星号以后字典序最小的字符串",
+            "translatedContent": "
给你一个字符串 s 。它可能包含任意数量的 '*' 字符。你的任务是删除所有的 '*' 字符。
\n\n
当字符串还存在至少一个 '*' 字符时，你可以执行以下操作：
\n\n
    \n\t
  • 删除最左边的 '*' 字符，同时删除该星号字符左边一个字典序 最小 的字符。如果有多个字典序最小的字符，你可以删除它们中的任意一个。
    • \n
\n\n
请你返回删除所有 '*' 字符以后，剩余字符连接而成的 字典序最小 的字符串。
\n\n
 
\n\n
示例 1：
\n\n
\n
输入：s = \"aaba*\"
\n\n
输出：\"aab\"
\n\n
解释：
\n\n
删除 '*' 号和它左边的其中一个 'a' 字符。如果我们选择删除 s[3] ，s 字典序最小。
\n
\n\n
示例 2：
\n\n
\n
输入：s = \"abc\"
\n\n
输出：\"abc\"
\n\n
解释：
\n\n
字符串中没有 '*' 字符。
\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 1 <= s.length <= 105
    • \n\t
  • s 只含有小写英文字母和 '*' 字符。
    • \n\t
  • 输入保证操作可以删除所有的 '*' 字符。
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Medium",
+            "likes": 6,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false, \"cangjie\": false}",
+            "topicTags": [
+                {
+                    "name": "Stack",
+                    "slug": "stack",
+                    "translatedName": "栈",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Greedy",
+                    "slug": "greedy",
+                    "translatedName": "贪心",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Hash Table",
+                    "slug": "hash-table",
+                    "translatedName": "哈希表",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "String",
+                    "slug": "string",
+                    "translatedName": "字符串",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Heap (Priority Queue)",
+                    "slug": "heap-priority-queue",
+                    "translatedName": "堆（优先队列）",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    string clearStars(string s) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public String clearStars(String s) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def clearStars(self, s):\n        \"\"\"\n        :type s: str\n        :rtype: str\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def clearStars(self, s: str) -> str:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "char* clearStars(char* s) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public string ClearStars(string s) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {string} s\n * @return {string}\n */\nvar clearStars = function(s) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function clearStars(s: string): string {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param String $s\n     * @return String\n     */\n    function clearStars($s) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func clearStars(_ s: String) -> String {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun clearStars(s: String): String {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  String clearStars(String s) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func clearStars(s string) string {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {String} s\n# @return {String}\ndef clear_stars(s)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def clearStars(s: String): String = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn clear_stars(s: String) -> String {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (clear-stars s)\n  (-> string? string?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec clear_stars(S :: unicode:unicode_binary()) -> unicode:unicode_binary().\nclear_stars(S) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec clear_stars(s :: String.t) :: String.t\n  def clear_stars(s) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"3.7K\", \"totalSubmission\": \"9K\", \"totalAcceptedRaw\": 3718, \"totalSubmissionRaw\": 8953, \"acRate\": \"41.5%\"}",
+            "hints": [],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "\"aaba*\"",
+            "metaData": "{\n  \"name\": \"clearStars\",\n  \"params\": [\n    {\n      \"name\": \"s\",\n      \"type\": \"string\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"string\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0 C++ 20 \\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -gline-tables-only<\\/code> \\u53c2\\u6570\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528 GNU11 \\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -g1<\\/code> \\u53c2\\u6570\\u3002 AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.1.0<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2\\u3002\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 collection<\\/a> \\u5305<\\/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": "\"aaba*\"\n\"abc\"",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/maximum-sum-of-subsequence-with-non-adjacent-elements.json b/leetcode-cn/originData/maximum-sum-of-subsequence-with-non-adjacent-elements.json
new file mode 100644
index 00000000..4954389e
--- /dev/null
+++ b/leetcode-cn/originData/maximum-sum-of-subsequence-with-non-adjacent-elements.json
@@ -0,0 +1,189 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3423",
+            "questionFrontendId": "3165",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2789293,
+            "title": "Maximum Sum of Subsequence With Non-adjacent Elements",
+            "titleSlug": "maximum-sum-of-subsequence-with-non-adjacent-elements",
+            "content": "
You are given an array nums consisting of integers. You are also given a 2D array queries, where queries[i] = [posi, xi].
\n\n
For query i, we first set nums[posi] equal to xi, then we calculate the answer to query i which is the maximum sum of a subsequence of nums where no two adjacent elements are selected.
\n\n
Return the sum of the answers to all queries.
\n\n
Since the final answer may be very large, return it modulo 109 + 7.
\n\n
A subsequence is an array that can be derived from another array by deleting some or no elements without changing the order of the remaining elements.
\n\n
 
\n
Example 1:
\n\n
\n
Input: nums = [3,5,9], queries = [[1,-2],[0,-3]]
\n\n
Output: 21
\n\n
Explanation:
\nAfter the 1st query, nums = [3,-2,9] and the maximum sum of a subsequence with non-adjacent elements is 3 + 9 = 12.
\nAfter the 2nd query, nums = [-3,-2,9] and the maximum sum of a subsequence with non-adjacent elements is 9.
\n
\n\n
Example 2:
\n\n
\n
Input: nums = [0,-1], queries = [[0,-5]]
\n\n
Output: 0
\n\n
Explanation:
\nAfter the 1st query, nums = [-5,-1] and the maximum sum of a subsequence with non-adjacent elements is 0 (choosing an empty subsequence).
\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 1 <= nums.length <= 5 * 104
    • \n\t
  • -105 <= nums[i] <= 105
    • \n\t
  • 1 <= queries.length <= 5 * 104
    • \n\t
  • queries[i] == [posi, xi]
    • \n\t
  • 0 <= posi <= nums.length - 1
    • \n\t
  • -105 <= xi <= 105
    • \n
\n",
+            "translatedTitle": "不包含相邻元素的子序列的最大和",
+            "translatedContent": "
给你一个整数数组 nums 和一个二维数组 queries，其中 queries[i] = [posi, xi]。
\n\n
对于每个查询 i，首先将 nums[posi] 设置为 xi，然后计算查询 i 的答案，该答案为 nums 中 不包含相邻元素 的 子序列 的 最大 和。
\n\n
返回所有查询的答案之和。
\n\n
由于最终答案可能非常大，返回其对 109 + 7 取余 的结果。
\n\n
子序列 是指从另一个数组中删除一些或不删除元素而不改变剩余元素顺序得到的数组。
\n\n
 
\n\n
示例 1：
\n\n
\n
输入：nums = [3,5,9], queries = [[1,-2],[0,-3]]
\n\n
输出：21
\n\n
解释：
\n执行第 1 个查询后，nums = [3,-2,9]，不包含相邻元素的子序列的最大和为 3 + 9 = 12。
\n执行第 2 个查询后，nums = [-3,-2,9]，不包含相邻元素的子序列的最大和为 9 。
\n
\n\n
示例 2：
\n\n
\n
输入：nums = [0,-1], queries = [[0,-5]]
\n\n
输出：0
\n\n
解释：
\n执行第 1 个查询后，nums = [-5,-1]，不包含相邻元素的子序列的最大和为 0（选择空子序列）。
\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 1 <= nums.length <= 5 * 104
    • \n\t
  • -105 <= nums[i] <= 105
    • \n\t
  • 1 <= queries.length <= 5 * 104
    • \n\t
  • queries[i] == [posi, xi]
    • \n\t
  • 0 <= posi <= nums.length - 1
    • \n\t
  • -105 <= xi <= 105
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Hard",
+            "likes": 9,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": false, \"java\": true, \"python\": true, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false, \"cangjie\": false}",
+            "topicTags": [
+                {
+                    "name": "Segment Tree",
+                    "slug": "segment-tree",
+                    "translatedName": "线段树",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Divide and Conquer",
+                    "slug": "divide-and-conquer",
+                    "translatedName": "分治",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Dynamic Programming",
+                    "slug": "dynamic-programming",
+                    "translatedName": "动态规划",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    int maximumSumSubsequence(vector& nums, vector>& queries) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public int maximumSumSubsequence(int[] nums, int[][] queries) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def maximumSumSubsequence(self, nums, queries):\n        \"\"\"\n        :type nums: List[int]\n        :type queries: List[List[int]]\n        :rtype: int\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def maximumSumSubsequence(self, nums: List[int], queries: List[List[int]]) -> int:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "int maximumSumSubsequence(int* nums, int numsSize, int** queries, int queriesSize, int* queriesColSize) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public int MaximumSumSubsequence(int[] nums, int[][] queries) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number[]} nums\n * @param {number[][]} queries\n * @return {number}\n */\nvar maximumSumSubsequence = function(nums, queries) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function maximumSumSubsequence(nums: number[], queries: number[][]): number {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer[] $nums\n     * @param Integer[][] $queries\n     * @return Integer\n     */\n    function maximumSumSubsequence($nums, $queries) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func maximumSumSubsequence(_ nums: [Int], _ queries: [[Int]]) -> Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun maximumSumSubsequence(nums: IntArray, queries: Array): Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  int maximumSumSubsequence(List nums, List> queries) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func maximumSumSubsequence(nums []int, queries [][]int) int {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer[]} nums\n# @param {Integer[][]} queries\n# @return {Integer}\ndef maximum_sum_subsequence(nums, queries)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def maximumSumSubsequence(nums: Array[Int], queries: Array[Array[Int]]): Int = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn maximum_sum_subsequence(nums: Vec, queries: Vec>) -> i32 {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (maximum-sum-subsequence nums queries)\n  (-> (listof exact-integer?) (listof (listof exact-integer?)) exact-integer?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec maximum_sum_subsequence(Nums :: [integer()], Queries :: [[integer()]]) -> integer().\nmaximum_sum_subsequence(Nums, Queries) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec maximum_sum_subsequence(nums :: [integer], queries :: [[integer]]) :: integer\n  def maximum_sum_subsequence(nums, queries) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"1.5K\", \"totalSubmission\": \"5.5K\", \"totalAcceptedRaw\": 1539, \"totalSubmissionRaw\": 5508, \"acRate\": \"27.9%\"}",
+            "hints": [
+                "Can you solve each query in O(nums.length) with dynamic programming?",
+                "In order to optimize, we will use segment tree where each node contains the maximum value of (front element has been chosen or not, back element has been chosen or not)."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[3,5,9]\n[[1,-2],[0,-3]]",
+            "metaData": "{\n  \"name\": \"maximumSumSubsequence\",\n  \"params\": [\n    {\n      \"name\": \"nums\",\n      \"type\": \"integer[]\"\n    },\n    {\n      \"type\": \"integer[][]\",\n      \"name\": \"queries\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"integer\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0 C++ 20 \\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -gline-tables-only<\\/code> \\u53c2\\u6570\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528 GNU11 \\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -g1<\\/code> \\u53c2\\u6570\\u3002 AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.1.0<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2\\u3002\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 collection<\\/a> \\u5305<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "[3,5,9]\n[[1,-2],[0,-3]]\n[0,-1]\n[[0,-5]]",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/minimum-number-of-chairs-in-a-waiting-room.json b/leetcode-cn/originData/minimum-number-of-chairs-in-a-waiting-room.json
new file mode 100644
index 00000000..ae3b8c2a
--- /dev/null
+++ b/leetcode-cn/originData/minimum-number-of-chairs-in-a-waiting-room.json
@@ -0,0 +1,177 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3426",
+            "questionFrontendId": "3168",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2795610,
+            "title": "Minimum Number of Chairs in a Waiting Room",
+            "titleSlug": "minimum-number-of-chairs-in-a-waiting-room",
+            "content": "
You are given a string s. Simulate events at each second i:
\n\n
    \n\t
  • If s[i] == 'E', a person enters the waiting room and takes one of the chairs in it.
    • \n\t
  • If s[i] == 'L', a person leaves the waiting room, freeing up a chair.
    • \n
\n\n
Return the minimum number of chairs needed so that a chair is available for every person who enters the waiting room given that it is initially empty.
\n\n
 
\n
Example 1:
\n\n
\n
Input: s = "EEEEEEE"
\n\n
Output: 7
\n\n
Explanation:
\n\n
After each second, a person enters the waiting room and no person leaves it. Therefore, a minimum of 7 chairs is needed.
\n
\n\n
Example 2:
\n\n
\n
Input: s = "ELELEEL"
\n\n
Output: 2
\n\n
Explanation:
\n\n
Let's consider that there are 2 chairs in the waiting room. The table below shows the state of the waiting room at each second.
\n
\n\n\n\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\n
SecondEventPeople in the Waiting RoomAvailable Chairs
0Enter11
1Leave02
2Enter11
3Leave02
4Enter11
5Enter20
6Leave11
\n\n
Example 3:
\n\n
\n
Input: s = "ELEELEELLL"
\n\n
Output: 3
\n\n
Explanation:
\n\n
Let's consider that there are 3 chairs in the waiting room. The table below shows the state of the waiting room at each second.
\n
\n\n\n\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\n
SecondEventPeople in the Waiting RoomAvailable Chairs
0Enter12
1Leave03
2Enter12
3Enter21
4Leave12
5Enter21
6Enter30
7Leave21
8Leave12
9Leave03
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 1 <= s.length <= 50
    • \n\t
  • s consists only of the letters 'E' and 'L'.
    • \n\t
  • s represents a valid sequence of entries and exits.
    • \n
\n",
+            "translatedTitle": "候诊室中的最少椅子数",
+            "translatedContent": "
给你一个字符串 s，模拟每秒钟的事件 i：
\n\n
    \n\t
  • 如果 s[i] == 'E'，表示有一位顾客进入候诊室并占用一把椅子。
    • \n\t
  • 如果 s[i] == 'L'，表示有一位顾客离开候诊室，从而释放一把椅子。
    • \n
\n\n
返回保证每位进入候诊室的顾客都能有椅子坐的 最少 椅子数，假设候诊室最初是 空的 。
\n\n
 
\n\n
示例 1：
\n\n
\n
输入：s = \"EEEEEEE\"
\n\n
输出：7
\n\n
解释：
\n\n
每秒后都有一个顾客进入候诊室，没有人离开。因此，至少需要 7 把椅子。
\n
\n\n
示例 2：
\n\n
\n
输入：s = \"ELELEEL\"
\n\n
输出：2
\n\n
解释：
\n\n
假设候诊室里有 2 把椅子。下表显示了每秒钟等候室的状态。
\n
\n\n\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\n
秒事件候诊室的人数可用的椅子数
0Enter11
1Leave02
2Enter11
3Leave02
4Enter11
5Enter20
6Leave11
\n\n\n
示例 3：
\n\n
\n
输入：s = \"ELEELEELLL\"
\n\n
输出：3
\n\n
解释：
\n\n
假设候诊室里有 3 把椅子。下表显示了每秒钟等候室的状态。
\n
\n\n\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\n
秒事件候诊室的人数可用的椅子数
0Enter12
1Leave03
2Enter12
3Enter21
4Leave12
5Enter21
6Enter30
7Leave21
8Leave12
9Leave03
\n\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 1 <= s.length <= 50
    • \n\t
  • s 仅由字母 'E' 和 'L' 组成。
    • \n\t
  • s 表示一个有效的进出序列。
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Easy",
+            "likes": 1,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[{\"title\": \"Consecutive Characters\", \"titleSlug\": \"consecutive-characters\", \"difficulty\": \"Easy\", \"translatedTitle\": \"\\u8fde\\u7eed\\u5b57\\u7b26\", \"isPaidOnly\": false}]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false, \"cangjie\": false}",
+            "topicTags": [
+                {
+                    "name": "String",
+                    "slug": "string",
+                    "translatedName": "字符串",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Simulation",
+                    "slug": "simulation",
+                    "translatedName": "模拟",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    int minimumChairs(string s) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public int minimumChairs(String s) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def minimumChairs(self, s):\n        \"\"\"\n        :type s: str\n        :rtype: int\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def minimumChairs(self, s: str) -> int:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "int minimumChairs(char* s) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public int MinimumChairs(string s) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {string} s\n * @return {number}\n */\nvar minimumChairs = function(s) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function minimumChairs(s: string): number {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param String $s\n     * @return Integer\n     */\n    function minimumChairs($s) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func minimumChairs(_ s: String) -> Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun minimumChairs(s: String): Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  int minimumChairs(String s) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func minimumChairs(s string) int {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {String} s\n# @return {Integer}\ndef minimum_chairs(s)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def minimumChairs(s: String): Int = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn minimum_chairs(s: String) -> i32 {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (minimum-chairs s)\n  (-> string? exact-integer?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec minimum_chairs(S :: unicode:unicode_binary()) -> integer().\nminimum_chairs(S) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec minimum_chairs(s :: String.t) :: integer\n  def minimum_chairs(s) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"4.7K\", \"totalSubmission\": \"5.5K\", \"totalAcceptedRaw\": 4729, \"totalSubmissionRaw\": 5480, \"acRate\": \"86.3%\"}",
+            "hints": [
+                "Iterate from left to right over the string and keep track of the number of people in the waiting room using a variable that you will increment on every occurrence of ‘E’ and decrement on every occurrence of ‘L’.",
+                "The answer is the maximum number of people in the waiting room at any instance."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "\"EEEEEEE\"",
+            "metaData": "{\n  \"name\": \"minimumChairs\",\n  \"params\": [\n    {\n      \"name\": \"s\",\n      \"type\": \"string\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"integer\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0 C++ 20 \\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -gline-tables-only<\\/code> \\u53c2\\u6570\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528 GNU11 \\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -g1<\\/code> \\u53c2\\u6570\\u3002 AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.1.0<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2\\u3002\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 collection<\\/a> \\u5305<\\/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": "\"EEEEEEE\"\n\"ELELEEL\"\n\"ELEELEELLL\"",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/special-array-i.json b/leetcode-cn/originData/special-array-i.json
new file mode 100644
index 00000000..a6e6e096
--- /dev/null
+++ b/leetcode-cn/originData/special-array-i.json
@@ -0,0 +1,170 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3429",
+            "questionFrontendId": "3151",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2781008,
+            "title": "Special Array I",
+            "titleSlug": "special-array-i",
+            "content": "
An array is considered special if every pair of its adjacent elements contains two numbers with different parity.
\n\n
You are given an array of integers nums. Return true if nums is a special array, otherwise, return false.
\n\n
 
\n
Example 1:
\n\n
\n
Input: nums = [1]
\n\n
Output: true
\n\n
Explanation:
\n\n
There is only one element. So the answer is true.
\n
\n\n
Example 2:
\n\n
\n
Input: nums = [2,1,4]
\n\n
Output: true
\n\n
Explanation:
\n\n
There is only two pairs: (2,1) and (1,4), and both of them contain numbers with different parity. So the answer is true.
\n
\n\n
Example 3:
\n\n
\n
Input: nums = [4,3,1,6]
\n\n
Output: false
\n\n
Explanation:
\n\n
nums[1] and nums[2] are both odd. So the answer is false.
\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 1 <= nums.length <= 100
    • \n\t
  • 1 <= nums[i] <= 100
    • \n
\n",
+            "translatedTitle": "特殊数组 I",
+            "translatedContent": "
如果数组的每一对相邻元素都是两个奇偶性不同的数字，则该数组被认为是一个 特殊数组 。
\n\n
Aging 有一个整数数组 nums。如果 nums 是一个 特殊数组 ，返回 true，否则返回 false。
\n\n
 
\n\n
示例 1：
\n\n
\n
输入：nums = [1]
\n\n
输出：true
\n\n
解释：
\n\n
只有一个元素，所以答案为 true。
\n
\n\n
示例 2：
\n\n
\n
输入：nums = [2,1,4]
\n\n
输出：true
\n\n
解释：
\n\n
只有两对相邻元素： (2,1) 和 (1,4)，它们都包含了奇偶性不同的数字，因此答案为 true。
\n
\n\n
示例 3：
\n\n
\n
输入：nums = [4,3,1,6]
\n\n
输出：false
\n\n
解释：
\n\n
nums[1] 和 nums[2] 都是奇数。因此答案为 false。
\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 1 <= nums.length <= 100
    • \n\t
  • 1 <= nums[i] <= 100
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Easy",
+            "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, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false, \"cangjie\": false}",
+            "topicTags": [
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    bool isArraySpecial(vector& nums) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public boolean isArraySpecial(int[] nums) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def isArraySpecial(self, nums):\n        \"\"\"\n        :type nums: List[int]\n        :rtype: bool\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def isArraySpecial(self, nums: List[int]) -> bool:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "bool isArraySpecial(int* nums, int numsSize) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public bool IsArraySpecial(int[] nums) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number[]} nums\n * @return {boolean}\n */\nvar isArraySpecial = function(nums) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function isArraySpecial(nums: number[]): boolean {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer[] $nums\n     * @return Boolean\n     */\n    function isArraySpecial($nums) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func isArraySpecial(_ nums: [Int]) -> Bool {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun isArraySpecial(nums: IntArray): Boolean {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  bool isArraySpecial(List nums) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func isArraySpecial(nums []int) bool {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer[]} nums\n# @return {Boolean}\ndef is_array_special(nums)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def isArraySpecial(nums: Array[Int]): Boolean = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn is_array_special(nums: Vec) -> bool {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (is-array-special nums)\n  (-> (listof exact-integer?) boolean?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec is_array_special(Nums :: [integer()]) -> boolean().\nis_array_special(Nums) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec is_array_special(nums :: [integer]) :: boolean\n  def is_array_special(nums) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"5.9K\", \"totalSubmission\": \"7.1K\", \"totalAcceptedRaw\": 5888, \"totalSubmissionRaw\": 7059, \"acRate\": \"83.4%\"}",
+            "hints": [
+                "Try to check the parity of each element and its previous element."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[1]",
+            "metaData": "{\n  \"name\": \"isArraySpecial\",\n  \"params\": [\n    {\n      \"name\": \"nums\",\n      \"type\": \"integer[]\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"boolean\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0 C++ 20 \\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -gline-tables-only<\\/code> \\u53c2\\u6570\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528 GNU11 \\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -g1<\\/code> \\u53c2\\u6570\\u3002 AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.1.0<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2\\u3002\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 collection<\\/a> \\u5305<\\/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]\n[2,1,4]\n[4,3,1,6]",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/special-array-ii.json b/leetcode-cn/originData/special-array-ii.json
new file mode 100644
index 00000000..27cad510
--- /dev/null
+++ b/leetcode-cn/originData/special-array-ii.json
@@ -0,0 +1,183 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3427",
+            "questionFrontendId": "3152",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2781009,
+            "title": "Special Array II",
+            "titleSlug": "special-array-ii",
+            "content": "
An array is considered special if every pair of its adjacent elements contains two numbers with different parity.
\n\n
You are given an array of integer nums and a 2D integer matrix queries, where for queries[i] = [fromi, toi] your task is to check that subarray nums[fromi..toi] is special or not.
\n\n
Return an array of booleans answer such that answer[i] is true if nums[fromi..toi] is special.
\n\n
 
\n
Example 1:
\n\n
\n
Input: nums = [3,4,1,2,6], queries = [[0,4]]
\n\n
Output: [false]
\n\n
Explanation:
\n\n
The subarray is [3,4,1,2,6]. 2 and 6 are both even.
\n
\n\n
Example 2:
\n\n
\n
Input: nums = [4,3,1,6], queries = [[0,2],[2,3]]
\n\n
Output: [false,true]
\n\n
Explanation:
\n\n
    \n\t
  1. The subarray is [4,3,1]. 3 and 1 are both odd. So the answer to this query is false.
    2. \n\t
  2. The subarray is [1,6]. There is only one pair: (1,6) and it contains numbers with different parity. So the answer to this query is true.
    3. \n
\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 1 <= nums.length <= 105
    • \n\t
  • 1 <= nums[i] <= 105
    • \n\t
  • 1 <= queries.length <= 105
    • \n\t
  • queries[i].length == 2
    • \n\t
  • 0 <= queries[i][0] <= queries[i][1] <= nums.length - 1
    • \n
\n",
+            "translatedTitle": "特殊数组 II",
+            "translatedContent": "
如果数组的每一对相邻元素都是两个奇偶性不同的数字，则该数组被认为是一个 特殊数组 。
\n\n
周洋哥有一个整数数组 nums 和一个二维整数矩阵 queries，对于 queries[i] = [fromi, toi]，请你帮助周洋哥检查子数组 nums[fromi..toi] 是不是一个 特殊数组 。
\n\n
返回布尔数组 answer，如果 nums[fromi..toi] 是特殊数组，则 answer[i] 为 true ，否则，answer[i] 为 false 。
\n\n
 
\n\n
示例 1：
\n\n
\n
输入：nums = [3,4,1,2,6], queries = [[0,4]]
\n\n
输出：[false]
\n\n
解释：
\n\n
子数组是 [3,4,1,2,6]。2 和 6 都是偶数。
\n
\n\n
示例 2：
\n\n
\n
输入：nums = [4,3,1,6], queries = [[0,2],[2,3]]
\n\n
输出：[false,true]
\n\n
解释：
\n\n
    \n\t
  1. 子数组是 [4,3,1]。3 和 1 都是奇数。因此这个查询的答案是 false。
    2. \n\t
  2. 子数组是 [1,6]。只有一对：(1,6)，且包含了奇偶性不同的数字。因此这个查询的答案是 true。
    3. \n
\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 1 <= nums.length <= 105
    • \n\t
  • 1 <= nums[i] <= 105
    • \n\t
  • 1 <= queries.length <= 105
    • \n\t
  • queries[i].length == 2
    • \n\t
  • 0 <= queries[i][0] <= queries[i][1] <= nums.length - 1
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Medium",
+            "likes": 9,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": false, \"java\": false, \"python\": false, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false, \"cangjie\": false}",
+            "topicTags": [
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Binary Search",
+                    "slug": "binary-search",
+                    "translatedName": "二分查找",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Prefix Sum",
+                    "slug": "prefix-sum",
+                    "translatedName": "前缀和",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    vector isArraySpecial(vector& nums, vector>& queries) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public boolean[] isArraySpecial(int[] nums, int[][] queries) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def isArraySpecial(self, nums, queries):\n        \"\"\"\n        :type nums: List[int]\n        :type queries: List[List[int]]\n        :rtype: List[bool]\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def isArraySpecial(self, nums: List[int], queries: List[List[int]]) -> List[bool]:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "/**\n * Note: The returned array must be malloced, assume caller calls free().\n */\nbool* isArraySpecial(int* nums, int numsSize, int** queries, int queriesSize, int* queriesColSize, int* returnSize) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public bool[] IsArraySpecial(int[] nums, int[][] queries) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number[]} nums\n * @param {number[][]} queries\n * @return {boolean[]}\n */\nvar isArraySpecial = function(nums, queries) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function isArraySpecial(nums: number[], queries: number[][]): boolean[] {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer[] $nums\n     * @param Integer[][] $queries\n     * @return Boolean[]\n     */\n    function isArraySpecial($nums, $queries) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func isArraySpecial(_ nums: [Int], _ queries: [[Int]]) -> [Bool] {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun isArraySpecial(nums: IntArray, queries: Array): BooleanArray {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  List isArraySpecial(List nums, List> queries) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func isArraySpecial(nums []int, queries [][]int) []bool {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer[]} nums\n# @param {Integer[][]} queries\n# @return {Boolean[]}\ndef is_array_special(nums, queries)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def isArraySpecial(nums: Array[Int], queries: Array[Array[Int]]): Array[Boolean] = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn is_array_special(nums: Vec, queries: Vec>) -> Vec {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (is-array-special nums queries)\n  (-> (listof exact-integer?) (listof (listof exact-integer?)) (listof boolean?))\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec is_array_special(Nums :: [integer()], Queries :: [[integer()]]) -> [boolean()].\nis_array_special(Nums, Queries) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec is_array_special(nums :: [integer], queries :: [[integer]]) :: [boolean]\n  def is_array_special(nums, queries) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"5.1K\", \"totalSubmission\": \"16.8K\", \"totalAcceptedRaw\": 5121, \"totalSubmissionRaw\": 16771, \"acRate\": \"30.5%\"}",
+            "hints": [
+                "Try to split the array into some non-intersected continues special subarrays.",
+                "For each query check that the first and the last elements of that query are in the same subarray or not."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[3,4,1,2,6]\n[[0,4]]",
+            "metaData": "{\n  \"name\": \"isArraySpecial\",\n  \"params\": [\n    {\n      \"name\": \"nums\",\n      \"type\": \"integer[]\"\n    },\n    {\n      \"type\": \"integer[][]\",\n      \"name\": \"queries\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"boolean[]\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0 C++ 20 \\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -gline-tables-only<\\/code> \\u53c2\\u6570\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528 GNU11 \\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -g1<\\/code> \\u53c2\\u6570\\u3002 AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.1.0<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2\\u3002\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 collection<\\/a> \\u5305<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "[3,4,1,2,6]\n[[0,4]]\n[4,3,1,6]\n[[0,2],[2,3]]",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/string-compression-iii.json b/leetcode-cn/originData/string-compression-iii.json
new file mode 100644
index 00000000..2f61c13a
--- /dev/null
+++ b/leetcode-cn/originData/string-compression-iii.json
@@ -0,0 +1,170 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3451",
+            "questionFrontendId": "3163",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2789291,
+            "title": "String Compression III",
+            "titleSlug": "string-compression-iii",
+            "content": "
Given a string word, compress it using the following algorithm:
\n\n
    \n\t
  • Begin with an empty string comp. While word is not empty, use the following operation:\n\n\t
      \n\t\t
    • Remove a maximum length prefix of word made of a single character c repeating at most 9 times.
      • \n\t\t
    • Append the length of the prefix followed by c to comp.
      • \n\t
    \n\t
    • \n
\n\n
Return the string comp.
\n\n
 
\n
Example 1:
\n\n
\n
Input: word = "abcde"
\n\n
Output: "1a1b1c1d1e"
\n\n
Explanation:
\n\n
Initially, comp = "". Apply the operation 5 times, choosing "a", "b", "c", "d", and "e" as the prefix in each operation.
\n\n
For each prefix, append "1" followed by the character to comp.
\n
\n\n
Example 2:
\n\n
\n
Input: word = "aaaaaaaaaaaaaabb"
\n\n
Output: "9a5a2b"
\n\n
Explanation:
\n\n
Initially, comp = "". Apply the operation 3 times, choosing "aaaaaaaaa", "aaaaa", and "bb" as the prefix in each operation.
\n\n
    \n\t
  • For prefix "aaaaaaaaa", append "9" followed by "a" to comp.
    • \n\t
  • For prefix "aaaaa", append "5" followed by "a" to comp.
    • \n\t
  • For prefix "bb", append "2" followed by "b" to comp.
    • \n
\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 1 <= word.length <= 2 * 105
    • \n\t
  • word consists only of lowercase English letters.
    • \n
\n",
+            "translatedTitle": "压缩字符串 III",
+            "translatedContent": "
给你一个字符串 word，请你使用以下算法进行压缩：
\n\n
    \n\t
  • 从空字符串 comp 开始。当 word 不为空 时，执行以下操作：\n\n\t
      \n\t\t
    • 移除 word 的最长单字符前缀，该前缀由单一字符 c 重复多次组成，且该前缀长度 最多 为 9 。
      • \n\t\t
    • 将前缀的长度和字符 c 追加到 comp 。
      • \n\t
    \n\t
    • \n
\n\n
返回字符串 comp 。
\n\n
 
\n\n
 
\n\n
示例 1：
\n\n
\n
输入：word = \"abcde\"
\n\n
输出：\"1a1b1c1d1e\"
\n\n
解释：
\n\n
初始时，comp = \"\" 。进行 5 次操作，每次操作分别选择 \"a\"、\"b\"、\"c\"、\"d\" 和 \"e\" 作为前缀。
\n\n
对每个前缀，将 \"1\" 和对应的字符追加到 comp。
\n
\n\n
示例 2：
\n\n
\n
输入：word = \"aaaaaaaaaaaaaabb\"
\n\n
输出：\"9a5a2b\"
\n\n
解释：
\n\n
初始时，comp = \"\"。进行 3 次操作，每次操作分别选择 \"aaaaaaaaa\"、\"aaaaa\" 和 \"bb\" 作为前缀。
\n\n
    \n\t
  • 对于前缀 \"aaaaaaaaa\"，将 \"9\" 和 \"a\" 追加到 comp。
    • \n\t
  • 对于前缀 \"aaaaa\"，将 \"5\" 和 \"a\" 追加到 comp。
    • \n\t
  • 对于前缀 \"bb\"，将 \"2\" 和 \"b\" 追加到 comp。
    • \n
\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 1 <= word.length <= 2 * 105
    • \n\t
  • word 仅由小写英文字母组成。
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Medium",
+            "likes": 2,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[{\"title\": \"String Compression\", \"titleSlug\": \"string-compression\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u538b\\u7f29\\u5b57\\u7b26\\u4e32\", \"isPaidOnly\": false}, {\"title\": \"String Compression II\", \"titleSlug\": \"string-compression-ii\", \"difficulty\": \"Hard\", \"translatedTitle\": \"\\u538b\\u7f29\\u5b57\\u7b26\\u4e32 II\", \"isPaidOnly\": false}]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false, \"cangjie\": false}",
+            "topicTags": [
+                {
+                    "name": "String",
+                    "slug": "string",
+                    "translatedName": "字符串",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    string compressedString(string word) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public String compressedString(String word) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def compressedString(self, word):\n        \"\"\"\n        :type word: str\n        :rtype: str\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def compressedString(self, word: str) -> str:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "char* compressedString(char* word) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public string CompressedString(string word) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {string} word\n * @return {string}\n */\nvar compressedString = function(word) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function compressedString(word: string): string {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param String $word\n     * @return String\n     */\n    function compressedString($word) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func compressedString(_ word: String) -> String {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun compressedString(word: String): String {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  String compressedString(String word) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func compressedString(word string) string {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {String} word\n# @return {String}\ndef compressed_string(word)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def compressedString(word: String): String = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn compressed_string(word: String) -> String {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (compressed-string word)\n  (-> string? string?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec compressed_string(Word :: unicode:unicode_binary()) -> unicode:unicode_binary().\ncompressed_string(Word) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec compressed_string(word :: String.t) :: String.t\n  def compressed_string(word) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"4.9K\", \"totalSubmission\": \"8.5K\", \"totalAcceptedRaw\": 4923, \"totalSubmissionRaw\": 8525, \"acRate\": \"57.7%\"}",
+            "hints": [
+                "Each time, just cut the same character in prefix up to at max 9 times. It’s always better to cut a bigger prefix."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "\"abcde\"",
+            "metaData": "{\n  \"name\": \"compressedString\",\n  \"params\": [\n    {\n      \"name\": \"word\",\n      \"type\": \"string\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"string\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0 C++ 20 \\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -gline-tables-only<\\/code> \\u53c2\\u6570\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528 GNU11 \\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -g1<\\/code> \\u53c2\\u6570\\u3002 AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.1.0<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2\\u3002\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 collection<\\/a> \\u5305<\\/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": "\"abcde\"\n\"aaaaaaaaaaaaaabb\"",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/sum-of-digit-differences-of-all-pairs.json b/leetcode-cn/originData/sum-of-digit-differences-of-all-pairs.json
new file mode 100644
index 00000000..e86f0b7e
--- /dev/null
+++ b/leetcode-cn/originData/sum-of-digit-differences-of-all-pairs.json
@@ -0,0 +1,190 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3416",
+            "questionFrontendId": "3153",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2782784,
+            "title": "Sum of Digit Differences of All Pairs",
+            "titleSlug": "sum-of-digit-differences-of-all-pairs",
+            "content": "
You are given an array nums consisting of positive integers where all integers have the same number of digits.
\n\n
The digit difference between two integers is the count of different digits that are in the same position in the two integers.
\n\n
Return the sum of the digit differences between all pairs of integers in nums.
\n\n
 
\n
Example 1:
\n\n
\n
Input: nums = [13,23,12]
\n\n
Output: 4
\n\n
Explanation:
\nWe have the following:
\n- The digit difference between 13 and 23 is 1.
\n- The digit difference between 13 and 12 is 1.
\n- The digit difference between 23 and 12 is 2.
\nSo the total sum of digit differences between all pairs of integers is 1 + 1 + 2 = 4.
\n
\n\n
Example 2:
\n\n
\n
Input: nums = [10,10,10,10]
\n\n
Output: 0
\n\n
Explanation:
\nAll the integers in the array are the same. So the total sum of digit differences between all pairs of integers will be 0.
\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 2 <= nums.length <= 105
    • \n\t
  • 1 <= nums[i] < 109
    • \n\t
  • All integers in nums have the same number of digits.
    • \n
\n",
+            "translatedTitle": "所有数对中数位不同之和",
+            "translatedContent": "
车尔尼有一个数组 nums ，它只包含 正 整数，所有正整数的数位长度都 相同 。
\n\n
两个整数的 数位不同 指的是两个整数 相同 位置上不同数字的数目。
\n\n
请车尔尼返回 nums 中 所有 整数对里，数位不同之和。
\n\n
 
\n\n
示例 1：
\n\n
\n
输入：nums = [13,23,12]
\n\n
输出：4
\n\n
解释：
\n计算过程如下：
\n- 13 和 23 的数位不同为 1 。
\n- 13 和 12 的数位不同为 1 。
\n- 23 和 12 的数位不同为 2 。
\n所以所有整数数对的数位不同之和为 1 + 1 + 2 = 4 。
\n
\n\n
示例 2：
\n\n
\n
输入：nums = [10,10,10,10]
\n\n
输出：0
\n\n
解释：
\n数组中所有整数都相同，所以所有整数数对的数位不同之和为 0 。
\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 2 <= nums.length <= 105
    • \n\t
  • 1 <= nums[i] < 109
    • \n\t
  • nums 中的整数都有相同的数位长度。
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Medium",
+            "likes": 5,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[{\"title\": \"Total Hamming Distance\", \"titleSlug\": \"total-hamming-distance\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u6c49\\u660e\\u8ddd\\u79bb\\u603b\\u548c\", \"isPaidOnly\": false}]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": false, \"java\": false, \"python\": false, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false, \"cangjie\": false}",
+            "topicTags": [
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Hash Table",
+                    "slug": "hash-table",
+                    "translatedName": "哈希表",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Math",
+                    "slug": "math",
+                    "translatedName": "数学",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Counting",
+                    "slug": "counting",
+                    "translatedName": "计数",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    long long sumDigitDifferences(vector& nums) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public long sumDigitDifferences(int[] nums) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def sumDigitDifferences(self, nums):\n        \"\"\"\n        :type nums: List[int]\n        :rtype: int\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def sumDigitDifferences(self, nums: List[int]) -> int:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "long long sumDigitDifferences(int* nums, int numsSize) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public long SumDigitDifferences(int[] nums) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number[]} nums\n * @return {number}\n */\nvar sumDigitDifferences = function(nums) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function sumDigitDifferences(nums: number[]): number {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer[] $nums\n     * @return Integer\n     */\n    function sumDigitDifferences($nums) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func sumDigitDifferences(_ nums: [Int]) -> Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun sumDigitDifferences(nums: IntArray): Long {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  int sumDigitDifferences(List nums) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func sumDigitDifferences(nums []int) int64 {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer[]} nums\n# @return {Integer}\ndef sum_digit_differences(nums)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def sumDigitDifferences(nums: Array[Int]): Long = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn sum_digit_differences(nums: Vec) -> i64 {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (sum-digit-differences nums)\n  (-> (listof exact-integer?) exact-integer?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec sum_digit_differences(Nums :: [integer()]) -> integer().\nsum_digit_differences(Nums) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec sum_digit_differences(nums :: [integer]) :: integer\n  def sum_digit_differences(nums) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"4.2K\", \"totalSubmission\": \"7.7K\", \"totalAcceptedRaw\": 4235, \"totalSubmissionRaw\": 7730, \"acRate\": \"54.8%\"}",
+            "hints": [
+                "You can solve the problem for digits that are on the same position separately, and then sum up all the answers.",
+                "For each position, count the number of occurences of each digit from 0 to 9 that appear on that position.",
+                "Let c be the number of occurences of a digit on a position, that will contribute with c * (n - c) to the final answer, where n is the number of integers in nums."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[13,23,12]",
+            "metaData": "{\n  \"name\": \"sumDigitDifferences\",\n  \"params\": [\n    {\n      \"name\": \"nums\",\n      \"type\": \"integer[]\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"long\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0 C++ 20 \\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -gline-tables-only<\\/code> \\u53c2\\u6570\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528 GNU11 \\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528 -O2<\\/code> \\u7ea7\\u4f18\\u5316\\uff0c\\u5e76\\u63d0\\u4f9b -g1<\\/code> \\u53c2\\u6570\\u3002 AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b out-of-bounds<\\/code> \\u548c use-after-free<\\/code> \\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.1.0<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2\\u3002\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 collection<\\/a> \\u5305<\\/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": "[13,23,12]\n[10,10,10,10]",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/problem (Chinese)/不包含相邻元素的子序列的最大和 [maximum-sum-of-subsequence-with-non-adjacent-elements].html b/leetcode-cn/problem (Chinese)/不包含相邻元素的子序列的最大和 [maximum-sum-of-subsequence-with-non-adjacent-elements].html
new file mode 100644
index 00000000..086b75bb
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/不包含相邻元素的子序列的最大和 [maximum-sum-of-subsequence-with-non-adjacent-elements].html	
@@ -0,0 +1,47 @@
+
给你一个整数数组 nums 和一个二维数组 queries，其中 queries[i] = [posi, xi]。

+
+
对于每个查询 i，首先将 nums[posi] 设置为 xi，然后计算查询 i 的答案，该答案为 nums 中 不包含相邻元素 的 子序列 的 最大 和。

+
+
返回所有查询的答案之和。

+
+
由于最终答案可能非常大，返回其对 109 + 7 取余 的结果。

+
+
子序列 是指从另一个数组中删除一些或不删除元素而不改变剩余元素顺序得到的数组。

+
+
 

+
+
示例 1：

+
+

+
输入：nums = [3,5,9], queries = [[1,-2],[0,-3]]

+
+
输出：21

+
+
解释：

+执行第 1 个查询后，nums = [3,-2,9]，不包含相邻元素的子序列的最大和为 3 + 9 = 12。

+执行第 2 个查询后，nums = [-3,-2,9]，不包含相邻元素的子序列的最大和为 9 。

+

+
+
示例 2：

+
+

+
输入：nums = [0,-1], queries = [[0,-5]]

+
+
输出：0

+
+
解释：

+执行第 1 个查询后，nums = [-5,-1]，不包含相邻元素的子序列的最大和为 0（选择空子序列）。

+

+
+
 

+
+
提示：

+
+
    
+	
  • 1 <= nums.length <= 5 * 104
    • 
+	
  • -105 <= nums[i] <= 105
    • 
+	
  • 1 <= queries.length <= 5 * 104
    • 
+	
  • queries[i] == [posi, xi]
    • 
+	
  • 0 <= posi <= nums.length - 1
    • 
+	
  • -105 <= xi <= 105
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/优质数对的总数 I [find-the-number-of-good-pairs-i].html b/leetcode-cn/problem (Chinese)/优质数对的总数 I [find-the-number-of-good-pairs-i].html
new file mode 100644
index 00000000..1baa6a09
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/优质数对的总数 I [find-the-number-of-good-pairs-i].html	
@@ -0,0 +1,41 @@
+
给你两个整数数组 nums1 和 nums2，长度分别为 n 和 m。同时给你一个正整数 k。

+
+
如果 nums1[i] 可以被 nums2[j] * k 整除，则称数对 (i, j) 为 优质数对（0 <= i <= n - 1, 0 <= j <= m - 1）。

+
+
返回 优质数对 的总数。

+
+
 

+
+
示例 1：

+
+

+
输入：nums1 = [1,3,4], nums2 = [1,3,4], k = 1

+
+
输出：5

+
+
解释：

+
+
5个优质数对分别是 (0, 0), (1, 0), (1, 1), (2, 0), 和 (2, 2)。

+

+
+
示例 2：

+
+

+
输入：nums1 = [1,2,4,12], nums2 = [2,4], k = 3

+
+
输出：2

+
+
解释：

+
+
2个优质数对分别是 (3, 0) 和 (3, 1)。

+

+
+
 

+
+
提示：

+
+
    
+	
  • 1 <= n, m <= 50
    • 
+	
  • 1 <= nums1[i], nums2[j] <= 50
    • 
+	
  • 1 <= k <= 50
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/优质数对的总数 II [find-the-number-of-good-pairs-ii].html b/leetcode-cn/problem (Chinese)/优质数对的总数 II [find-the-number-of-good-pairs-ii].html
new file mode 100644
index 00000000..087ee672
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/优质数对的总数 II [find-the-number-of-good-pairs-ii].html	
@@ -0,0 +1,41 @@
+
给你两个整数数组 nums1 和 nums2，长度分别为 n 和 m。同时给你一个正整数 k。

+
+
如果 nums1[i] 可以被 nums2[j] * k 整除，则称数对 (i, j) 为 优质数对（0 <= i <= n - 1, 0 <= j <= m - 1）。

+
+
返回 优质数对 的总数。

+
+
 

+
+
示例 1：

+
+

+
输入：nums1 = [1,3,4], nums2 = [1,3,4], k = 1

+
+
输出：5

+
+
解释：

+
+
5个优质数对分别是 (0, 0), (1, 0), (1, 1), (2, 0), 和 (2, 2)。

+

+
+
示例 2：

+
+

+
输入：nums1 = [1,2,4,12], nums2 = [2,4], k = 3

+
+
输出：2

+
+
解释：

+
+
2个优质数对分别是 (3, 0) 和 (3, 1)。

+

+
+
 

+
+
提示：

+
+
    
+	
  • 1 <= n, m <= 105
    • 
+	
  • 1 <= nums1[i], nums2[j] <= 106
    • 
+	
  • 1 <= k <= 103
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/候诊室中的最少椅子数 [minimum-number-of-chairs-in-a-waiting-room].html b/leetcode-cn/problem (Chinese)/候诊室中的最少椅子数 [minimum-number-of-chairs-in-a-waiting-room].html
new file mode 100644
index 00000000..eb7606d7
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/候诊室中的最少椅子数 [minimum-number-of-chairs-in-a-waiting-room].html	
@@ -0,0 +1,180 @@
+
给你一个字符串 s，模拟每秒钟的事件 i：

+
+
    
+	
  • 如果 s[i] == 'E'，表示有一位顾客进入候诊室并占用一把椅子。
    • 
+	
  • 如果 s[i] == 'L'，表示有一位顾客离开候诊室，从而释放一把椅子。
    • 
+

+
+
返回保证每位进入候诊室的顾客都能有椅子坐的 最少 椅子数，假设候诊室最初是 空的 。

+
+
 

+
+
示例 1：

+
+

+
输入：s = "EEEEEEE"

+
+
输出：7

+
+
解释：

+
+
每秒后都有一个顾客进入候诊室，没有人离开。因此，至少需要 7 把椅子。

+

+
+
示例 2：

+
+

+
输入：s = "ELELEEL"

+
+
输出：2

+
+
解释：

+
+
假设候诊室里有 2 把椅子。下表显示了每秒钟等候室的状态。

+

+
+	
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+	
+
秒事件候诊室的人数可用的椅子数
0Enter11
1Leave02
2Enter11
3Leave02
4Enter11
5Enter20
6Leave11

+
+
+
示例 3：

+
+

+
输入：s = "ELEELEELLL"

+
+
输出：3

+
+
解释：

+
+
假设候诊室里有 3 把椅子。下表显示了每秒钟等候室的状态。

+

+
+	
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+	
+
秒事件候诊室的人数可用的椅子数
0Enter12
1Leave03
2Enter12
3Enter21
4Leave12
5Enter21
6Enter30
7Leave21
8Leave12
9Leave03

+
+
+
 

+
+
提示：

+
+
    
+	
  • 1 <= s.length <= 50
    • 
+	
  • s 仅由字母 'E' 和 'L' 组成。
    • 
+	
  • s 表示一个有效的进出序列。
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/删除星号以后字典序最小的字符串 [lexicographically-minimum-string-after-removing-stars].html b/leetcode-cn/problem (Chinese)/删除星号以后字典序最小的字符串 [lexicographically-minimum-string-after-removing-stars].html
new file mode 100644
index 00000000..dca5b9d4
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/删除星号以后字典序最小的字符串 [lexicographically-minimum-string-after-removing-stars].html	
@@ -0,0 +1,45 @@
+
给你一个字符串 s 。它可能包含任意数量的 '*' 字符。你的任务是删除所有的 '*' 字符。

+
+
当字符串还存在至少一个 '*' 字符时，你可以执行以下操作：

+
+
    
+	
  • 删除最左边的 '*' 字符，同时删除该星号字符左边一个字典序 最小 的字符。如果有多个字典序最小的字符，你可以删除它们中的任意一个。
    • 
+

+
+
请你返回删除所有 '*' 字符以后，剩余字符连接而成的 字典序最小 的字符串。

+
+
 

+
+
示例 1：

+
+

+
输入：s = "aaba*"

+
+
输出："aab"

+
+
解释：

+
+
删除 '*' 号和它左边的其中一个 'a' 字符。如果我们选择删除 s[3] ，s 字典序最小。

+

+
+
示例 2：

+
+

+
输入：s = "abc"

+
+
输出："abc"

+
+
解释：

+
+
字符串中没有 '*' 字符。

+

+
+
 

+
+
提示：

+
+
    
+	
  • 1 <= s.length <= 105
    • 
+	
  • s 只含有小写英文字母和 '*' 字符。
    • 
+	
  • 输入保证操作可以删除所有的 '*' 字符。
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/到达第 K 级台阶的方案数 [find-number-of-ways-to-reach-the-k-th-stair].html b/leetcode-cn/problem (Chinese)/到达第 K 级台阶的方案数 [find-number-of-ways-to-reach-the-k-th-stair].html
new file mode 100644
index 00000000..f153ba2a
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/到达第 K 级台阶的方案数 [find-number-of-ways-to-reach-the-k-th-stair].html	
@@ -0,0 +1,86 @@
+
给你有一个 非负 整数 k 。有一个无限长度的台阶，最低 一层编号为 0 。

+
+
虎老师有一个整数 jump ，一开始值为 0 。虎老师从台阶 1 开始，虎老师可以使用 任意 次操作，目标是到达第 k 级台阶。假设虎老师位于台阶 i ，一次 操作 中，虎老师可以：

+
+
    
+	
  • 向下走一级到 i - 1 ，但该操作 不能 连续使用，如果在台阶第 0 级也不能使用。
    • 
+	
  • 向上走到台阶 i + 2jump 处，然后 jump 变为 jump + 1 。
    • 
+

+
+
请你返回虎老师到达台阶 k 处的总方案数。

+
+
注意 ，虎老师可能到达台阶 k 处后，通过一些操作重新回到台阶 k 处，这视为不同的方案。

+
+
 

+
+
示例 1：

+
+

+
输入：k = 0

+
+
输出：2

+
+
解释：

+
+
2 种到达台阶 0 的方案为：

+
+
    
+	
  • 虎老师从台阶 1 开始。
+	
      
+		
    • 执行第一种操作，从台阶 1 向下走到台阶 0 。
      • 
+	
    
+	
    • 
+	
  • 虎老师从台阶 1 开始。
+	
      
+		
    • 执行第一种操作，从台阶 1 向下走到台阶 0 。
      • 
+		
    • 执行第二种操作，向上走 20 级台阶到台阶 1 。
      • 
+		
    • 执行第一种操作，从台阶 1 向下走到台阶 0 。
      • 
+	
    
+	
    • 
+

+

+
+
示例 2：

+
+

+
输入：k = 1

+
+
输出：4

+
+
解释：

+
+
4 种到达台阶 1 的方案为：

+
+
    
+	
  • 虎老师从台阶 1 开始，已经到达台阶 1 。
    • 
+	
  • 虎老师从台阶 1 开始。
+	
      
+		
    • 执行第一种操作，从台阶 1 向下走到台阶 0 。
      • 
+		
    • 执行第二种操作，向上走 20 级台阶到台阶 1 。
      • 
+	
    
+	
    • 
+	
  • 虎老师从台阶 1 开始。
+	
      
+		
    • 执行第二种操作，向上走 20 级台阶到台阶 2 。
      • 
+		
    • 执行第一种操作，向下走 1 级台阶到台阶 1 。
      • 
+	
    
+	
    • 
+	
  • 虎老师从台阶 1 开始。
+	
      
+		
    • 执行第一种操作，从台阶 1 向下走到台阶 0 。
      • 
+		
    • 执行第二种操作，向上走 20 级台阶到台阶 1 。
      • 
+		
    • 执行第一种操作，向下走 1 级台阶到台阶 0 。
      • 
+		
    • 执行第二种操作，向上走 21 级台阶到台阶 2 。
      • 
+		
    • 执行第一种操作，向下走 1 级台阶到台阶 1 。
      • 
+	
    
+	
    • 
+

+

+
+
 

+
+
提示：

+
+
    
+	
  • 0 <= k <= 109
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/压缩字符串 III [string-compression-iii].html b/leetcode-cn/problem (Chinese)/压缩字符串 III [string-compression-iii].html
new file mode 100644
index 00000000..581d3400
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/压缩字符串 III [string-compression-iii].html	
@@ -0,0 +1,58 @@
+
给你一个字符串 word，请你使用以下算法进行压缩：

+
+
    
+	
  • 从空字符串 comp 开始。当 word 不为空 时，执行以下操作：
+
+	
      
+		
    • 移除 word 的最长单字符前缀，该前缀由单一字符 c 重复多次组成，且该前缀长度 最多 为 9 。
      • 
+		
    • 将前缀的长度和字符 c 追加到 comp 。
      • 
+	
    
+	
    • 
+

+
+
返回字符串 comp 。

+
+
 

+
+
 

+
+
示例 1：

+
+

+
输入：word = "abcde"

+
+
输出："1a1b1c1d1e"

+
+
解释：

+
+
初始时，comp = "" 。进行 5 次操作，每次操作分别选择 "a"、"b"、"c"、"d" 和 "e" 作为前缀。

+
+
对每个前缀，将 "1" 和对应的字符追加到 comp。

+

+
+
示例 2：

+
+

+
输入：word = "aaaaaaaaaaaaaabb"

+
+
输出："9a5a2b"

+
+
解释：

+
+
初始时，comp = ""。进行 3 次操作，每次操作分别选择 "aaaaaaaaa"、"aaaaa" 和 "bb" 作为前缀。

+
+
    
+	
  • 对于前缀 "aaaaaaaaa"，将 "9" 和 "a" 追加到 comp。
    • 
+	
  • 对于前缀 "aaaaa"，将 "5" 和 "a" 追加到 comp。
    • 
+	
  • 对于前缀 "bb"，将 "2" 和 "b" 追加到 comp。
    • 
+

+

+
+
 

+
+
提示：

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

diff --git a/leetcode-cn/problem (Chinese)/所有数对中数位不同之和 [sum-of-digit-differences-of-all-pairs].html b/leetcode-cn/problem (Chinese)/所有数对中数位不同之和 [sum-of-digit-differences-of-all-pairs].html
new file mode 100644
index 00000000..d51905f5
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/所有数对中数位不同之和 [sum-of-digit-differences-of-all-pairs].html	
@@ -0,0 +1,43 @@
+
车尔尼有一个数组 nums ，它只包含 正 整数，所有正整数的数位长度都 相同 。

+
+
两个整数的 数位不同 指的是两个整数 相同 位置上不同数字的数目。

+
+
请车尔尼返回 nums 中 所有 整数对里，数位不同之和。

+
+
 

+
+
示例 1：

+
+

+
输入：nums = [13,23,12]

+
+
输出：4

+
+
解释：

+计算过程如下：

+- 13 和 23 的数位不同为 1 。

+- 13 和 12 的数位不同为 1 。

+- 23 和 12 的数位不同为 2 。

+所以所有整数数对的数位不同之和为 1 + 1 + 2 = 4 。

+

+
+
示例 2：

+
+

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

+
+
输出：0

+
+
解释：

+数组中所有整数都相同，所以所有整数数对的数位不同之和为 0 。

+

+
+
 

+
+
提示：

+
+
    
+	
  • 2 <= nums.length <= 105
    • 
+	
  • 1 <= nums[i] < 109
    • 
+	
  • nums 中的整数都有相同的数位长度。
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/所有球里面不同颜色的数目 [find-the-number-of-distinct-colors-among-the-balls].html b/leetcode-cn/problem (Chinese)/所有球里面不同颜色的数目 [find-the-number-of-distinct-colors-among-the-balls].html
new file mode 100644
index 00000000..764c9bb9
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/所有球里面不同颜色的数目 [find-the-number-of-distinct-colors-among-the-balls].html	
@@ -0,0 +1,60 @@
+
给你一个整数 limit 和一个大小为 n x 2 的二维数组 queries 。

+
+
总共有 limit + 1 个球，每个球的编号为 [0, limit] 中一个 互不相同 的数字。一开始，所有球都没有颜色。queries 中每次操作的格式为 [x, y] ，你需要将球 x 染上颜色 y 。每次操作之后，你需要求出所有球中 不同 颜色的数目。

+
+
请你返回一个长度为 n 的数组 result ，其中 result[i] 是第 i 次操作以后不同颜色的数目。

+
+
注意 ，没有染色的球不算作一种颜色。

+
+
 

+
+
示例 1：

+
+

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

+
+
输出：[1,2,2,3]

+
+
解释：

+
+

+
+
    
+	
  • 操作 0 后，球 1 颜色为 4 。
    • 
+	
  • 操作 1 后，球 1 颜色为 4 ，球 2 颜色为 5 。
    • 
+	
  • 操作 2 后，球 1 颜色为 3 ，球 2 颜色为 5 。
    • 
+	
  • 操作 3 后，球 1 颜色为 3 ，球 2 颜色为 5 ，球 3 颜色为 4 。
    • 
+

+

+
+
示例 2：

+
+

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

+
+
输出：[1,2,2,3,4]

+
+
解释：

+
+

+
+
    
+	
  • 操作 0 后，球 0 颜色为 1 。
    • 
+	
  • 操作 1 后，球 0 颜色为 1 ，球 1 颜色为 2 。
    • 
+	
  • 操作 2 后，球 0 颜色为 1 ，球 1 和 2 颜色为 2 。
    • 
+	
  • 操作 3 后，球 0 颜色为 1 ，球 1 和 2 颜色为 2 ，球 3 颜色为 4 。
    • 
+	
  • 操作 4 后，球 0 颜色为 1 ，球 1 和 2 颜色为 2 ，球 3 颜色为 4 ，球 4 颜色为 5 。
    • 
+

+

+
+
 

+
+
提示：

+
+
    
+	
  • 1 <= limit <= 109
    • 
+	
  • 1 <= n == queries.length <= 105
    • 
+	
  • queries[i].length == 2
    • 
+	
  • 0 <= queries[i][0] <= limit
    • 
+	
  • 1 <= queries[i][1] <= 109
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/找到按位与最接近 K 的子数组 [find-subarray-with-bitwise-and-closest-to-k].html b/leetcode-cn/problem (Chinese)/找到按位与最接近 K 的子数组 [find-subarray-with-bitwise-and-closest-to-k].html
new file mode 100644
index 00000000..4b7c6189
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/找到按位与最接近 K 的子数组 [find-subarray-with-bitwise-and-closest-to-k].html	
@@ -0,0 +1,53 @@
+
给你一个数组 nums 和一个整数 k 。你需要找到 nums 的一个 子数组 ，满足子数组中所有元素按位与运算 AND 的值与 k 的 绝对差 尽可能 小 。换言之，你需要选择一个子数组 nums[l..r] 满足 |k - (nums[l] AND nums[l + 1] ... AND nums[r])| 最小。

+
+
请你返回 最小 的绝对差值。

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

+
+
 

+
+
示例 1：

+
+

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

+
+
输出：1

+
+
解释：

+
+
子数组 nums[2..3] 的按位 AND 运算值为 4 ，得到最小差值 |3 - 4| = 1 。

+

+
+
示例 2：

+
+

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

+
+
输出：0

+
+
解释：

+
+
子数组 nums[1..1] 的按位 AND 运算值为 2 ，得到最小差值 |2 - 2| = 0 。

+

+
+
示例 3：

+
+

+
输入：nums = [1], k = 10

+
+
输出：9

+
+
解释：

+
+
只有一个子数组，按位 AND 运算值为 1 ，得到最小差值 |10 - 1| = 9 。

+

+
+
 

+
+
提示：

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

diff --git a/leetcode-cn/problem (Chinese)/无需开会的工作日 [count-days-without-meetings].html b/leetcode-cn/problem (Chinese)/无需开会的工作日 [count-days-without-meetings].html
new file mode 100644
index 00000000..afb53eb2
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/无需开会的工作日 [count-days-without-meetings].html	
@@ -0,0 +1,54 @@
+
给你一个正整数 days，表示员工可工作的总天数（从第 1 天开始）。另给你一个二维数组 meetings，长度为 n，其中 meetings[i] = [start_i, end_i] 表示第 i 次会议的开始和结束天数（包含首尾）。

+
+
返回员工可工作且没有安排会议的天数。

+
+
注意：会议时间可能会有重叠。

+
+
 

+
+
示例 1：

+
+

+
输入：days = 10, meetings = [[5,7],[1,3],[9,10]]

+
+
输出：2

+
+
解释：

+
+
第 4 天和第 8 天没有安排会议。

+

+
+
示例 2：

+
+

+
输入：days = 5, meetings = [[2,4],[1,3]]

+
+
输出：1

+
+
解释：

+
+
第 5 天没有安排会议。

+

+
+
示例 3：

+
+

+
输入：days = 6, meetings = [[1,6]]

+
+
输出：0

+
+
解释：

+
+
所有工作日都安排了会议。

+

+
+
 

+
+
提示：

+
+
    
+	
  • 1 <= days <= 109
    • 
+	
  • 1 <= meetings.length <= 105
    • 
+	
  • meetings[i].length == 2
    • 
+	
  • 1 <= meetings[i][0] <= meetings[i][1] <= days
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/查询数组中元素的出现位置 [find-occurrences-of-an-element-in-an-array].html b/leetcode-cn/problem (Chinese)/查询数组中元素的出现位置 [find-occurrences-of-an-element-in-an-array].html
new file mode 100644
index 00000000..08fd78fd
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/查询数组中元素的出现位置 [find-occurrences-of-an-element-in-an-array].html	
@@ -0,0 +1,48 @@
+
给你一个整数数组 nums ，一个整数数组 queries 和一个整数 x 。

+
+
对于每个查询 queries[i] ，你需要找到 nums 中第 queries[i] 个 x 的位置，并返回它的下标。如果数组中 x 的出现次数少于 queries[i] ，该查询的答案为 -1 。

+
+
请你返回一个整数数组 answer ，包含所有查询的答案。

+
+
 

+
+
示例 1：

+
+

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

+
+
输出：[0,-1,2,-1]

+
+
解释：

+
+
    
+	
  • 第 1 个查询，第一个 1 出现在下标 0 处。
    • 
+	
  • 第 2 个查询，nums 中只有两个 1 ，所以答案为 -1 。
    • 
+	
  • 第 3 个查询，第二个 1 出现在下标 2 处。
    • 
+	
  • 第 4 个查询，nums 中只有两个 1 ，所以答案为 -1 。
    • 
+

+

+
+
示例 2：

+
+

+
输入：nums = [1,2,3], queries = [10], x = 5

+
+
输出：[-1]

+
+
解释：

+
+
    
+	
  • 第 1 个查询，nums 中没有 5 ，所以答案为 -1 。
    • 
+

+

+
+
 

+
+
提示：

+
+
    
+	
  • 1 <= nums.length, queries.length <= 105
    • 
+	
  • 1 <= queries[i] <= 105
    • 
+	
  • 1 <= nums[i], x <= 104
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/求出出现两次数字的 XOR 值 [find-the-xor-of-numbers-which-appear-twice].html b/leetcode-cn/problem (Chinese)/求出出现两次数字的 XOR 值 [find-the-xor-of-numbers-which-appear-twice].html
new file mode 100644
index 00000000..c81da814
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/求出出现两次数字的 XOR 值 [find-the-xor-of-numbers-which-appear-twice].html	
@@ -0,0 +1,51 @@
+
给你一个数组 nums ，数组中的数字 要么 出现一次，要么 出现两次。

+
+
请你返回数组中所有出现两次数字的按位 XOR 值，如果没有数字出现过两次，返回 0 。

+
+
 

+
+
示例 1：

+
+

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

+
+
输出：1

+
+
解释：

+
+
nums 中唯一出现过两次的数字是 1 。

+

+
+
示例 2：

+
+

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

+
+
输出：0

+
+
解释：

+
+
nums 中没有数字出现两次。

+

+
+
示例 3：

+
+

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

+
+
输出：3

+
+
解释：

+
+
数字 1 和 2 出现过两次。1 XOR 2 == 3 。

+

+
+
 

+
+
提示：

+
+
    
+	
  • 1 <= nums.length <= 50
    • 
+	
  • 1 <= nums[i] <= 50
    • 
+	
  • nums 中每个数字要么出现过一次，要么出现过两次。
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/物块放置查询 [block-placement-queries].html b/leetcode-cn/problem (Chinese)/物块放置查询 [block-placement-queries].html
new file mode 100644
index 00000000..dd8222b8
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/物块放置查询 [block-placement-queries].html	
@@ -0,0 +1,56 @@
+
有一条无限长的数轴，原点在 0 处，沿着 x 轴 正 方向无限延伸。

+
+
给你一个二维数组 queries ，它包含两种操作：

+
+
    
+	
  1. 操作类型 1 ：queries[i] = [1, x] 。在距离原点 x 处建一个障碍物。数据保证当操作执行的时候，位置 x 处 没有 任何障碍物。
    2. 
+	
  2. 操作类型 2 ：queries[i] = [2, x, sz] 。判断在数轴范围 [0, x] 内是否可以放置一个长度为 sz 的物块，这个物块需要 完全 放置在范围 [0, x] 内。如果物块与任何障碍物有重合，那么这个物块 不能 被放置，但物块可以与障碍物刚好接触。注意，你只是进行查询，并 不是 真的放置这个物块。每个查询都是相互独立的。
    3. 
+

+
+
请你返回一个 boolean 数组results ，如果第 i 个操作类型 2 的操作你可以放置物块，那么 results[i] 为 true ，否则为 false 。

+
+
 

+
+
示例 1：

+
+

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

+
+
输出：[false,true,true]

+
+
解释：

+
+

+
+
查询 0 ，在 x = 2 处放置一个障碍物。在 x = 3 之前任何大小不超过 2 的物块都可以被放置。

+

+
+
示例 2：

+
+

+
输入：queries = [[1,7],[2,7,6],[1,2],[2,7,5],[2,7,6]]

+
+
输出：[true,true,false]

+
+
解释：

+
+

+
+
    
+	
  • 查询 0 在 x = 7 处放置一个障碍物。在 x = 7 之前任何大小不超过 7 的物块都可以被放置。
    • 
+	
  • 查询 2 在 x = 2 处放置一个障碍物。现在，在 x = 7 之前任何大小不超过 5 的物块可以被放置，x = 2 之前任何大小不超过 2 的物块可以被放置。
    • 
+

+

+
+
 

+
+
提示：

+
+
    
+	
  • 1 <= queries.length <= 15 * 104
    • 
+	
  • 2 <= queries[i].length <= 3
    • 
+	
  • 1 <= queries[i][0] <= 2
    • 
+	
  • 1 <= x, sz <= min(5 * 104, 3 * queries.length)
    • 
+	
  • 输入保证操作 1 中，x 处不会有障碍物。
    • 
+	
  • 输入保证至少有一个操作类型 2 。
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/特殊数组 I [special-array-i].html b/leetcode-cn/problem (Chinese)/特殊数组 I [special-array-i].html
new file mode 100644
index 00000000..1fa2d1b4
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/特殊数组 I [special-array-i].html	
@@ -0,0 +1,50 @@
+
如果数组的每一对相邻元素都是两个奇偶性不同的数字，则该数组被认为是一个 特殊数组 。

+
+
Aging 有一个整数数组 nums。如果 nums 是一个 特殊数组 ，返回 true，否则返回 false。

+
+
 

+
+
示例 1：

+
+

+
输入：nums = [1]

+
+
输出：true

+
+
解释：

+
+
只有一个元素，所以答案为 true。

+

+
+
示例 2：

+
+

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

+
+
输出：true

+
+
解释：

+
+
只有两对相邻元素： (2,1) 和 (1,4)，它们都包含了奇偶性不同的数字，因此答案为 true。

+

+
+
示例 3：

+
+

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

+
+
输出：false

+
+
解释：

+
+
nums[1] 和 nums[2] 都是奇数。因此答案为 false。

+

+
+
 

+
+
提示：

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

diff --git a/leetcode-cn/problem (Chinese)/特殊数组 II [special-array-ii].html b/leetcode-cn/problem (Chinese)/特殊数组 II [special-array-ii].html
new file mode 100644
index 00000000..7f5c96d1
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/特殊数组 II [special-array-ii].html	
@@ -0,0 +1,46 @@
+
如果数组的每一对相邻元素都是两个奇偶性不同的数字，则该数组被认为是一个 特殊数组 。

+
+
周洋哥有一个整数数组 nums 和一个二维整数矩阵 queries，对于 queries[i] = [fromi, toi]，请你帮助周洋哥检查子数组 nums[fromi..toi] 是不是一个 特殊数组 。

+
+
返回布尔数组 answer，如果 nums[fromi..toi] 是特殊数组，则 answer[i] 为 true ，否则，answer[i] 为 false 。

+
+
 

+
+
示例 1：

+
+

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

+
+
输出：[false]

+
+
解释：

+
+
子数组是 [3,4,1,2,6]。2 和 6 都是偶数。

+

+
+
示例 2：

+
+

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

+
+
输出：[false,true]

+
+
解释：

+
+
    
+	
  1. 子数组是 [4,3,1]。3 和 1 都是奇数。因此这个查询的答案是 false。
    2. 
+	
  2. 子数组是 [1,6]。只有一对：(1,6)，且包含了奇偶性不同的数字。因此这个查询的答案是 true。
    3. 
+

+

+
+
 

+
+
提示：

+
+
    
+	
  • 1 <= nums.length <= 105
    • 
+	
  • 1 <= nums[i] <= 105
    • 
+	
  • 1 <= queries.length <= 105
    • 
+	
  • queries[i].length == 2
    • 
+	
  • 0 <= queries[i][0] <= queries[i][1] <= nums.length - 1
    • 
+

diff --git a/leetcode-cn/problem (English)/不包含相邻元素的子序列的最大和(English) [maximum-sum-of-subsequence-with-non-adjacent-elements].html b/leetcode-cn/problem (English)/不包含相邻元素的子序列的最大和(English) [maximum-sum-of-subsequence-with-non-adjacent-elements].html
new file mode 100644
index 00000000..e452a1e7
--- /dev/null
+++ b/leetcode-cn/problem (English)/不包含相邻元素的子序列的最大和(English) [maximum-sum-of-subsequence-with-non-adjacent-elements].html	
@@ -0,0 +1,45 @@
+
You are given an array nums consisting of integers. You are also given a 2D array queries, where queries[i] = [posi, xi].

+
+
For query i, we first set nums[posi] equal to xi, then we calculate the answer to query i which is the maximum sum of a subsequence of nums where no two adjacent elements are selected.

+
+
Return the sum of the answers to all queries.

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

+
+
A subsequence is an array that can be derived from another array by deleting some or no elements without changing the order of the remaining elements.

+
+
 

+
Example 1:

+
+

+
Input: nums = [3,5,9], queries = [[1,-2],[0,-3]]

+
+
Output: 21

+
+
Explanation:

+After the 1st query, nums = [3,-2,9] and the maximum sum of a subsequence with non-adjacent elements is 3 + 9 = 12.

+After the 2nd query, nums = [-3,-2,9] and the maximum sum of a subsequence with non-adjacent elements is 9.

+

+
+
Example 2:

+
+

+
Input: nums = [0,-1], queries = [[0,-5]]

+
+
Output: 0

+
+
Explanation:

+After the 1st query, nums = [-5,-1] and the maximum sum of a subsequence with non-adjacent elements is 0 (choosing an empty subsequence).

+

+
+
 

+
Constraints:

+
+
    
+	
  • 1 <= nums.length <= 5 * 104
    • 
+	
  • -105 <= nums[i] <= 105
    • 
+	
  • 1 <= queries.length <= 5 * 104
    • 
+	
  • queries[i] == [posi, xi]
    • 
+	
  • 0 <= posi <= nums.length - 1
    • 
+	
  • -105 <= xi <= 105
    • 
+

diff --git a/leetcode-cn/problem (English)/优质数对的总数 I(English) [find-the-number-of-good-pairs-i].html b/leetcode-cn/problem (English)/优质数对的总数 I(English) [find-the-number-of-good-pairs-i].html
new file mode 100644
index 00000000..45a93c65
--- /dev/null
+++ b/leetcode-cn/problem (English)/优质数对的总数 I(English) [find-the-number-of-good-pairs-i].html	
@@ -0,0 +1,37 @@
+
You are given 2 integer arrays nums1 and nums2 of lengths n and m respectively. You are also given a positive integer k.

+
+
A pair (i, j) is called good if nums1[i] is divisible by nums2[j] * k (0 <= i <= n - 1, 0 <= j <= m - 1).

+
+
Return the total number of good pairs.

+
+
 

+
Example 1:

+
+

+
Input: nums1 = [1,3,4], nums2 = [1,3,4], k = 1

+
+
Output: 5

+
+
Explanation:

+The 5 good pairs are (0, 0), (1, 0), (1, 1), (2, 0), and (2, 2).

+
+
Example 2:

+
+

+
Input: nums1 = [1,2,4,12], nums2 = [2,4], k = 3

+
+
Output: 2

+
+
Explanation:

+
+
The 2 good pairs are (3, 0) and (3, 1).

+

+
+
 

+
Constraints:

+
+
    
+	
  • 1 <= n, m <= 50
    • 
+	
  • 1 <= nums1[i], nums2[j] <= 50
    • 
+	
  • 1 <= k <= 50
    • 
+

diff --git a/leetcode-cn/problem (English)/优质数对的总数 II(English) [find-the-number-of-good-pairs-ii].html b/leetcode-cn/problem (English)/优质数对的总数 II(English) [find-the-number-of-good-pairs-ii].html
new file mode 100644
index 00000000..d2d7a4c1
--- /dev/null
+++ b/leetcode-cn/problem (English)/优质数对的总数 II(English) [find-the-number-of-good-pairs-ii].html	
@@ -0,0 +1,37 @@
+
You are given 2 integer arrays nums1 and nums2 of lengths n and m respectively. You are also given a positive integer k.

+
+
A pair (i, j) is called good if nums1[i] is divisible by nums2[j] * k (0 <= i <= n - 1, 0 <= j <= m - 1).

+
+
Return the total number of good pairs.

+
+
 

+
Example 1:

+
+

+
Input: nums1 = [1,3,4], nums2 = [1,3,4], k = 1

+
+
Output: 5

+
+
Explanation:

+The 5 good pairs are (0, 0), (1, 0), (1, 1), (2, 0), and (2, 2).

+
+
Example 2:

+
+

+
Input: nums1 = [1,2,4,12], nums2 = [2,4], k = 3

+
+
Output: 2

+
+
Explanation:

+
+
The 2 good pairs are (3, 0) and (3, 1).

+

+
+
 

+
Constraints:

+
+
    
+	
  • 1 <= n, m <= 105
    • 
+	
  • 1 <= nums1[i], nums2[j] <= 106
    • 
+	
  • 1 <= k <= 103
    • 
+

diff --git a/leetcode-cn/problem (English)/候诊室中的最少椅子数(English) [minimum-number-of-chairs-in-a-waiting-room].html b/leetcode-cn/problem (English)/候诊室中的最少椅子数(English) [minimum-number-of-chairs-in-a-waiting-room].html
new file mode 100644
index 00000000..6fe2157f
--- /dev/null
+++ b/leetcode-cn/problem (English)/候诊室中的最少椅子数(English) [minimum-number-of-chairs-in-a-waiting-room].html	
@@ -0,0 +1,178 @@
+
You are given a string s. Simulate events at each second i:

+
+
    
+	
  • If s[i] == 'E', a person enters the waiting room and takes one of the chairs in it.
    • 
+	
  • If s[i] == 'L', a person leaves the waiting room, freeing up a chair.
    • 
+

+
+
Return the minimum number of chairs needed so that a chair is available for every person who enters the waiting room given that it is initially empty.

+
+
 

+
Example 1:

+
+

+
Input: s = "EEEEEEE"

+
+
Output: 7

+
+
Explanation:

+
+
After each second, a person enters the waiting room and no person leaves it. Therefore, a minimum of 7 chairs is needed.

+

+
+
Example 2:

+
+

+
Input: s = "ELELEEL"

+
+
Output: 2

+
+
Explanation:

+
+
Let's consider that there are 2 chairs in the waiting room. The table below shows the state of the waiting room at each second.

+

+
+
+	
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+	
+
SecondEventPeople in the Waiting RoomAvailable Chairs
0Enter11
1Leave02
2Enter11
3Leave02
4Enter11
5Enter20
6Leave11

+
+
Example 3:

+
+

+
Input: s = "ELEELEELLL"

+
+
Output: 3

+
+
Explanation:

+
+
Let's consider that there are 3 chairs in the waiting room. The table below shows the state of the waiting room at each second.

+

+
+
+	
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+		
+			
+			
+			
+			
+		
+	
+
SecondEventPeople in the Waiting RoomAvailable Chairs
0Enter12
1Leave03
2Enter12
3Enter21
4Leave12
5Enter21
6Enter30
7Leave21
8Leave12
9Leave03

+
+
 

+
Constraints:

+
+
    
+	
  • 1 <= s.length <= 50
    • 
+	
  • s consists only of the letters 'E' and 'L'.
    • 
+	
  • s represents a valid sequence of entries and exits.
    • 
+

diff --git a/leetcode-cn/problem (English)/删除星号以后字典序最小的字符串(English) [lexicographically-minimum-string-after-removing-stars].html b/leetcode-cn/problem (English)/删除星号以后字典序最小的字符串(English) [lexicographically-minimum-string-after-removing-stars].html
new file mode 100644
index 00000000..74c754bf
--- /dev/null
+++ b/leetcode-cn/problem (English)/删除星号以后字典序最小的字符串(English) [lexicographically-minimum-string-after-removing-stars].html	
@@ -0,0 +1,43 @@
+
You are given a string s. It may contain any number of '*' characters. Your task is to remove all '*' characters.

+
+
While there is a '*', do the following operation:

+
+
    
+	
  • Delete the leftmost '*' and the smallest non-'*' character to its left. If there are several smallest characters, you can delete any of them.
    • 
+

+
+
Return the lexicographically smallest resulting string after removing all '*' characters.

+
+
 

+
Example 1:

+
+

+
Input: s = "aaba*"

+
+
Output: "aab"

+
+
Explanation:

+
+
We should delete one of the 'a' characters with '*'. If we choose s[3], s becomes the lexicographically smallest.

+

+
+
Example 2:

+
+

+
Input: s = "abc"

+
+
Output: "abc"

+
+
Explanation:

+
+
There is no '*' in the string.

+

+
+
 

+
Constraints:

+
+
    
+	
  • 1 <= s.length <= 105
    • 
+	
  • s consists only of lowercase English letters and '*'.
    • 
+	
  • The input is generated such that it is possible to delete all '*' characters.
    • 
+

diff --git a/leetcode-cn/problem (English)/到达第 K 级台阶的方案数(English) [find-number-of-ways-to-reach-the-k-th-stair].html b/leetcode-cn/problem (English)/到达第 K 级台阶的方案数(English) [find-number-of-ways-to-reach-the-k-th-stair].html
new file mode 100644
index 00000000..edb2754e
--- /dev/null
+++ b/leetcode-cn/problem (English)/到达第 K 级台阶的方案数(English) [find-number-of-ways-to-reach-the-k-th-stair].html	
@@ -0,0 +1,84 @@
+
You are given a non-negative integer k. There exists a staircase with an infinite number of stairs, with the lowest stair numbered 0.

+
+
Alice has an integer jump, with an initial value of 0. She starts on stair 1 and wants to reach stair k using any number of operations. If she is on stair i, in one operation she can:

+
+
    
+	
  • Go down to stair i - 1. This operation cannot be used consecutively or on stair 0.
    • 
+	
  • Go up to stair i + 2jump. And then, jump becomes jump + 1.
    • 
+

+
+
Return the total number of ways Alice can reach stair k.

+
+
Note that it is possible that Alice reaches the stair k, and performs some operations to reach the stair k again.

+
+
 

+
Example 1:

+
+

+
Input: k = 0

+
+
Output: 2

+
+
Explanation:

+
+
The 2 possible ways of reaching stair 0 are:

+
+
    
+	
  • Alice starts at stair 1.
+	
      
+		
    • Using an operation of the first type, she goes down 1 stair to reach stair 0.
      • 
+	
    
+	
    • 
+	
  • Alice starts at stair 1.
+	
      
+		
    • Using an operation of the first type, she goes down 1 stair to reach stair 0.
      • 
+		
    • Using an operation of the second type, she goes up 20 stairs to reach stair 1.
      • 
+		
    • Using an operation of the first type, she goes down 1 stair to reach stair 0.
      • 
+	
    
+	
    • 
+

+

+
+
Example 2:

+
+

+
Input: k = 1

+
+
Output: 4

+
+
Explanation:

+
+
The 4 possible ways of reaching stair 1 are:

+
+
    
+	
  • Alice starts at stair 1. Alice is at stair 1.
    • 
+	
  • Alice starts at stair 1.
+	
      
+		
    • Using an operation of the first type, she goes down 1 stair to reach stair 0.
      • 
+		
    • Using an operation of the second type, she goes up 20 stairs to reach stair 1.
      • 
+	
    
+	
    • 
+	
  • Alice starts at stair 1.
+	
      
+		
    • Using an operation of the second type, she goes up 20 stairs to reach stair 2.
      • 
+		
    • Using an operation of the first type, she goes down 1 stair to reach stair 1.
      • 
+	
    
+	
    • 
+	
  • Alice starts at stair 1.
+	
      
+		
    • Using an operation of the first type, she goes down 1 stair to reach stair 0.
      • 
+		
    • Using an operation of the second type, she goes up 20 stairs to reach stair 1.
      • 
+		
    • Using an operation of the first type, she goes down 1 stair to reach stair 0.
      • 
+		
    • Using an operation of the second type, she goes up 21 stairs to reach stair 2.
      • 
+		
    • Using an operation of the first type, she goes down 1 stair to reach stair 1.
      • 
+	
    
+	
    • 
+

+

+
+
 

+
Constraints:

+
+
    
+	
  • 0 <= k <= 109
    • 
+

diff --git a/leetcode-cn/problem (English)/压缩字符串 III(English) [string-compression-iii].html b/leetcode-cn/problem (English)/压缩字符串 III(English) [string-compression-iii].html
new file mode 100644
index 00000000..9c5b3585
--- /dev/null
+++ b/leetcode-cn/problem (English)/压缩字符串 III(English) [string-compression-iii].html	
@@ -0,0 +1,54 @@
+
Given a string word, compress it using the following algorithm:

+
+
    
+	
  • Begin with an empty string comp. While word is not empty, use the following operation:
+
+	
      
+		
    • Remove a maximum length prefix of word made of a single character c repeating at most 9 times.
      • 
+		
    • Append the length of the prefix followed by c to comp.
      • 
+	
    
+	
    • 
+

+
+
Return the string comp.

+
+
 

+
Example 1:

+
+

+
Input: word = "abcde"

+
+
Output: "1a1b1c1d1e"

+
+
Explanation:

+
+
Initially, comp = "". Apply the operation 5 times, choosing "a", "b", "c", "d", and "e" as the prefix in each operation.

+
+
For each prefix, append "1" followed by the character to comp.

+

+
+
Example 2:

+
+

+
Input: word = "aaaaaaaaaaaaaabb"

+
+
Output: "9a5a2b"

+
+
Explanation:

+
+
Initially, comp = "". Apply the operation 3 times, choosing "aaaaaaaaa", "aaaaa", and "bb" as the prefix in each operation.

+
+
    
+	
  • For prefix "aaaaaaaaa", append "9" followed by "a" to comp.
    • 
+	
  • For prefix "aaaaa", append "5" followed by "a" to comp.
    • 
+	
  • For prefix "bb", append "2" followed by "b" to comp.
    • 
+

+

+
+
 

+
Constraints:

+
+
    
+	
  • 1 <= word.length <= 2 * 105
    • 
+	
  • word consists only of lowercase English letters.
    • 
+

diff --git a/leetcode-cn/problem (English)/所有数对中数位不同之和(English) [sum-of-digit-differences-of-all-pairs].html b/leetcode-cn/problem (English)/所有数对中数位不同之和(English) [sum-of-digit-differences-of-all-pairs].html
new file mode 100644
index 00000000..21272fa8
--- /dev/null
+++ b/leetcode-cn/problem (English)/所有数对中数位不同之和(English) [sum-of-digit-differences-of-all-pairs].html	
@@ -0,0 +1,41 @@
+
You are given an array nums consisting of positive integers where all integers have the same number of digits.

+
+
The digit difference between two integers is the count of different digits that are in the same position in the two integers.

+
+
Return the sum of the digit differences between all pairs of integers in nums.

+
+
 

+
Example 1:

+
+

+
Input: nums = [13,23,12]

+
+
Output: 4

+
+
Explanation:

+We have the following:

+- The digit difference between 13 and 23 is 1.

+- The digit difference between 13 and 12 is 1.

+- The digit difference between 23 and 12 is 2.

+So the total sum of digit differences between all pairs of integers is 1 + 1 + 2 = 4.

+

+
+
Example 2:

+
+

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

+
+
Output: 0

+
+
Explanation:

+All the integers in the array are the same. So the total sum of digit differences between all pairs of integers will be 0.

+

+
+
 

+
Constraints:

+
+
    
+	
  • 2 <= nums.length <= 105
    • 
+	
  • 1 <= nums[i] < 109
    • 
+	
  • All integers in nums have the same number of digits.
    • 
+

diff --git a/leetcode-cn/problem (English)/所有球里面不同颜色的数目(English) [find-the-number-of-distinct-colors-among-the-balls].html b/leetcode-cn/problem (English)/所有球里面不同颜色的数目(English) [find-the-number-of-distinct-colors-among-the-balls].html
new file mode 100644
index 00000000..a604e471
--- /dev/null
+++ b/leetcode-cn/problem (English)/所有球里面不同颜色的数目(English) [find-the-number-of-distinct-colors-among-the-balls].html	
@@ -0,0 +1,58 @@
+
You are given an integer limit and a 2D array queries of size n x 2.

+
+
There are limit + 1 balls with distinct labels in the range [0, limit]. Initially, all balls are uncolored. For every query in queries that is of the form [x, y], you mark ball x with the color y. After each query, you need to find the number of distinct colors among the balls.

+
+
Return an array result of length n, where result[i] denotes the number of distinct colors after ith query.

+
+
Note that when answering a query, lack of a color will not be considered as a color.

+
+
 

+
Example 1:

+
+

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

+
+
Output: [1,2,2,3]

+
+
Explanation:

+
+

+
+
    
+	
  • After query 0, ball 1 has color 4.
    • 
+	
  • After query 1, ball 1 has color 4, and ball 2 has color 5.
    • 
+	
  • After query 2, ball 1 has color 3, and ball 2 has color 5.
    • 
+	
  • After query 3, ball 1 has color 3, ball 2 has color 5, and ball 3 has color 4.
    • 
+

+

+
+
Example 2:

+
+

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

+
+
Output: [1,2,2,3,4]

+
+
Explanation:

+
+

+
+
    
+	
  • After query 0, ball 0 has color 1.
    • 
+	
  • After query 1, ball 0 has color 1, and ball 1 has color 2.
    • 
+	
  • After query 2, ball 0 has color 1, and balls 1 and 2 have color 2.
    • 
+	
  • After query 3, ball 0 has color 1, balls 1 and 2 have color 2, and ball 3 has color 4.
    • 
+	
  • After query 4, ball 0 has color 1, balls 1 and 2 have color 2, ball 3 has color 4, and ball 4 has color 5.
    • 
+

+

+
+
 

+
Constraints:

+
+
    
+	
  • 1 <= limit <= 109
    • 
+	
  • 1 <= n == queries.length <= 105
    • 
+	
  • queries[i].length == 2
    • 
+	
  • 0 <= queries[i][0] <= limit
    • 
+	
  • 1 <= queries[i][1] <= 109
    • 
+

diff --git a/leetcode-cn/problem (English)/找到按位与最接近 K 的子数组(English) [find-subarray-with-bitwise-and-closest-to-k].html b/leetcode-cn/problem (English)/找到按位与最接近 K 的子数组(English) [find-subarray-with-bitwise-and-closest-to-k].html
new file mode 100644
index 00000000..1dc9692c
--- /dev/null
+++ b/leetcode-cn/problem (English)/找到按位与最接近 K 的子数组(English) [find-subarray-with-bitwise-and-closest-to-k].html	
@@ -0,0 +1,51 @@
+
You are given an array nums and an integer k. You need to find a subarray of nums such that the absolute difference between k and the bitwise AND of the subarray elements is as small as possible. In other words, select a subarray nums[l..r] such that |k - (nums[l] AND nums[l + 1] ... AND nums[r])| is minimum.

+
+
Return the minimum possible value of the absolute difference.

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

+
+
 

+
Example 1:

+
+

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

+
+
Output: 1

+
+
Explanation:

+
+
The subarray nums[2..3] has AND value 4, which gives the minimum absolute difference |3 - 4| = 1.

+

+
+
Example 2:

+
+

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

+
+
Output: 0

+
+
Explanation:

+
+
The subarray nums[1..1] has AND value 2, which gives the minimum absolute difference |2 - 2| = 0.

+

+
+
Example 3:

+
+

+
Input: nums = [1], k = 10

+
+
Output: 9

+
+
Explanation:

+
+
There is a single subarray with AND value 1, which gives the minimum absolute difference |10 - 1| = 9.

+

+
+
 

+
Constraints:

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

diff --git a/leetcode-cn/problem (English)/无需开会的工作日(English) [count-days-without-meetings].html b/leetcode-cn/problem (English)/无需开会的工作日(English) [count-days-without-meetings].html
new file mode 100644
index 00000000..6a7d58bd
--- /dev/null
+++ b/leetcode-cn/problem (English)/无需开会的工作日(English) [count-days-without-meetings].html	
@@ -0,0 +1,52 @@
+
You are given a positive integer days representing the total number of days an employee is available for work (starting from day 1). You are also given a 2D array meetings of size n where, meetings[i] = [start_i, end_i] represents the starting and ending days of meeting i (inclusive).

+
+
Return the count of days when the employee is available for work but no meetings are scheduled.

+
+
Note: The meetings may overlap.

+
+
 

+
Example 1:

+
+

+
Input: days = 10, meetings = [[5,7],[1,3],[9,10]]

+
+
Output: 2

+
+
Explanation:

+
+
There is no meeting scheduled on the 4th and 8th days.

+

+
+
Example 2:

+
+

+
Input: days = 5, meetings = [[2,4],[1,3]]

+
+
Output: 1

+
+
Explanation:

+
+
There is no meeting scheduled on the 5th day.

+

+
+
Example 3:

+
+

+
Input: days = 6, meetings = [[1,6]]

+
+
Output: 0

+
+
Explanation:

+
+
Meetings are scheduled for all working days.

+

+
+
 

+
Constraints:

+
+
    
+	
  • 1 <= days <= 109
    • 
+	
  • 1 <= meetings.length <= 105
    • 
+	
  • meetings[i].length == 2
    • 
+	
  • 1 <= meetings[i][0] <= meetings[i][1] <= days
    • 
+

diff --git a/leetcode-cn/problem (English)/查询数组中元素的出现位置(English) [find-occurrences-of-an-element-in-an-array].html b/leetcode-cn/problem (English)/查询数组中元素的出现位置(English) [find-occurrences-of-an-element-in-an-array].html
new file mode 100644
index 00000000..1bcb31ec
--- /dev/null
+++ b/leetcode-cn/problem (English)/查询数组中元素的出现位置(English) [find-occurrences-of-an-element-in-an-array].html	
@@ -0,0 +1,46 @@
+
You are given an integer array nums, an integer array queries, and an integer x.

+
+
For each queries[i], you need to find the index of the queries[i]th occurrence of x in the nums array. If there are fewer than queries[i] occurrences of x, the answer should be -1 for that query.

+
+
Return an integer array answer containing the answers to all queries.

+
+
 

+
Example 1:

+
+

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

+
+
Output: [0,-1,2,-1]

+
+
Explanation:

+
+
    
+	
  • For the 1st query, the first occurrence of 1 is at index 0.
    • 
+	
  • For the 2nd query, there are only two occurrences of 1 in nums, so the answer is -1.
    • 
+	
  • For the 3rd query, the second occurrence of 1 is at index 2.
    • 
+	
  • For the 4th query, there are only two occurrences of 1 in nums, so the answer is -1.
    • 
+

+

+
+
Example 2:

+
+

+
Input: nums = [1,2,3], queries = [10], x = 5

+
+
Output: [-1]

+
+
Explanation:

+
+
    
+	
  • For the 1st query, 5 doesn't exist in nums, so the answer is -1.
    • 
+

+

+
+
 

+
Constraints:

+
+
    
+	
  • 1 <= nums.length, queries.length <= 105
    • 
+	
  • 1 <= queries[i] <= 105
    • 
+	
  • 1 <= nums[i], x <= 104
    • 
+

diff --git a/leetcode-cn/problem (English)/求出出现两次数字的 XOR 值(English) [find-the-xor-of-numbers-which-appear-twice].html b/leetcode-cn/problem (English)/求出出现两次数字的 XOR 值(English) [find-the-xor-of-numbers-which-appear-twice].html
new file mode 100644
index 00000000..cd99898f
--- /dev/null
+++ b/leetcode-cn/problem (English)/求出出现两次数字的 XOR 值(English) [find-the-xor-of-numbers-which-appear-twice].html	
@@ -0,0 +1,49 @@
+
You are given an array nums, where each number in the array appears either once or twice.

+
+
Return the bitwise XOR of all the numbers that appear twice in the array, or 0 if no number appears twice.

+
+
 

+
Example 1:

+
+

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

+
+
Output: 1

+
+
Explanation:

+
+
The only number that appears twice in nums is 1.

+

+
+
Example 2:

+
+

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

+
+
Output: 0

+
+
Explanation:

+
+
No number appears twice in nums.

+

+
+
Example 3:

+
+

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

+
+
Output: 3

+
+
Explanation:

+
+
Numbers 1 and 2 appeared twice. 1 XOR 2 == 3.

+

+
+
 

+
Constraints:

+
+
    
+	
  • 1 <= nums.length <= 50
    • 
+	
  • 1 <= nums[i] <= 50
    • 
+	
  • Each number in nums appears either once or twice.
    • 
+

diff --git a/leetcode-cn/problem (English)/物块放置查询(English) [block-placement-queries].html b/leetcode-cn/problem (English)/物块放置查询(English) [block-placement-queries].html
new file mode 100644
index 00000000..7cd6ffc4
--- /dev/null
+++ b/leetcode-cn/problem (English)/物块放置查询(English) [block-placement-queries].html	
@@ -0,0 +1,54 @@
+
There exists an infinite number line, with its origin at 0 and extending towards the positive x-axis.

+
+
You are given a 2D array queries, which contains two types of queries:

+
+
    
+	
  1. For a query of type 1, queries[i] = [1, x]. Build an obstacle at distance x from the origin. It is guaranteed that there is no obstacle at distance x when the query is asked.
    2. 
+	
  2. For a query of type 2, queries[i] = [2, x, sz]. Check if it is possible to place a block of size sz anywhere in the range [0, x] on the line, such that the block entirely lies in the range [0, x]. A block cannot be placed if it intersects with any obstacle, but it may touch it. Note that you do not actually place the block. Queries are separate.
    3. 
+

+
+
Return a boolean array results, where results[i] is true if you can place the block specified in the ith query of type 2, and false otherwise.

+
+
 

+
Example 1:

+
+

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

+
+
Output: [false,true,true]

+
+
Explanation:

+
+

+
+
For query 0, place an obstacle at x = 2. A block of size at most 2 can be placed before x = 3.

+

+
+
Example 2:

+
+

+
Input: queries = [[1,7],[2,7,6],[1,2],[2,7,5],[2,7,6]]

+
+
Output: [true,true,false]

+
+
Explanation:

+
+

+
+
    
+	
  • Place an obstacle at x = 7 for query 0. A block of size at most 7 can be placed before x = 7.
    • 
+	
  • Place an obstacle at x = 2 for query 2. Now, a block of size at most 5 can be placed before x = 7, and a block of size at most 2 before x = 2.
    • 
+

+

+
+
 

+
Constraints:

+
+
    
+	
  • 1 <= queries.length <= 15 * 104
    • 
+	
  • 2 <= queries[i].length <= 3
    • 
+	
  • 1 <= queries[i][0] <= 2
    • 
+	
  • 1 <= x, sz <= min(5 * 104, 3 * queries.length)
    • 
+	
  • The input is generated such that for queries of type 1, no obstacle exists at distance x when the query is asked.
    • 
+	
  • The input is generated such that there is at least one query of type 2.
    • 
+

diff --git a/leetcode-cn/problem (English)/特殊数组 I(English) [special-array-i].html b/leetcode-cn/problem (English)/特殊数组 I(English) [special-array-i].html
new file mode 100644
index 00000000..c540d7de
--- /dev/null
+++ b/leetcode-cn/problem (English)/特殊数组 I(English) [special-array-i].html	
@@ -0,0 +1,48 @@
+
An array is considered special if every pair of its adjacent elements contains two numbers with different parity.

+
+
You are given an array of integers nums. Return true if nums is a special array, otherwise, return false.

+
+
 

+
Example 1:

+
+

+
Input: nums = [1]

+
+
Output: true

+
+
Explanation:

+
+
There is only one element. So the answer is true.

+

+
+
Example 2:

+
+

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

+
+
Output: true

+
+
Explanation:

+
+
There is only two pairs: (2,1) and (1,4), and both of them contain numbers with different parity. So the answer is true.

+

+
+
Example 3:

+
+

+
Input: nums = [4,3,1,6]

+
+
Output: false

+
+
Explanation:

+
+
nums[1] and nums[2] are both odd. So the answer is false.

+

+
+
 

+
Constraints:

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

diff --git a/leetcode-cn/problem (English)/特殊数组 II(English) [special-array-ii].html b/leetcode-cn/problem (English)/特殊数组 II(English) [special-array-ii].html
new file mode 100644
index 00000000..7a29508a
--- /dev/null
+++ b/leetcode-cn/problem (English)/特殊数组 II(English) [special-array-ii].html	
@@ -0,0 +1,44 @@
+
An array is considered special if every pair of its adjacent elements contains two numbers with different parity.

+
+
You are given an array of integer nums and a 2D integer matrix queries, where for queries[i] = [fromi, toi] your task is to check that subarray nums[fromi..toi] is special or not.

+
+
Return an array of booleans answer such that answer[i] is true if nums[fromi..toi] is special.

+
+
 

+
Example 1:

+
+

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

+
+
Output: [false]

+
+
Explanation:

+
+
The subarray is [3,4,1,2,6]. 2 and 6 are both even.

+

+
+
Example 2:

+
+

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

+
+
Output: [false,true]

+
+
Explanation:

+
+
    
+	
  1. The subarray is [4,3,1]. 3 and 1 are both odd. So the answer to this query is false.
    2. 
+	
  2. The subarray is [1,6]. There is only one pair: (1,6) and it contains numbers with different parity. So the answer to this query is true.
    3. 
+

+

+
+
 

+
Constraints:

+
+
    
+	
  • 1 <= nums.length <= 105
    • 
+	
  • 1 <= nums[i] <= 105
    • 
+	
  • 1 <= queries.length <= 105
    • 
+	
  • queries[i].length == 2
    • 
+	
  • 0 <= queries[i][0] <= queries[i][1] <= nums.length - 1
    • 
+