diff --git a/leetcode-cn/origin-data.json b/leetcode-cn/origin-data.json index 574172d2..97cbf9ea 100644 --- a/leetcode-cn/origin-data.json +++ b/leetcode-cn/origin-data.json @@ -1,7 +1,7 @@ { "user_name": "", "num_solved": 0, - "num_total": 2617, + "num_total": 2628, "ac_easy": 0, "ac_medium": 0, "ac_hard": 0, @@ -12,11 +12,11 @@ "question__title": "积木拼接", "question__title_slug": "De4qBB", "question__hide": false, - "total_acs": 125, - "total_submitted": 690, - "total_column_articles": 5, + "total_acs": 186, + "total_submitted": 787, + "total_column_articles": 9, "frontend_question_id": "LCP 58", - "is_new_question": true + "is_new_question": false }, "status": null, "difficulty": { @@ -33,11 +33,11 @@ "question__title": "力扣泡泡龙", "question__title_slug": "WInSav", "question__hide": false, - "total_acs": 105, - "total_submitted": 1382, - "total_column_articles": 5, + "total_acs": 175, + "total_submitted": 1610, + "total_column_articles": 10, "frontend_question_id": "LCP 60", - "is_new_question": true + "is_new_question": false }, "status": null, "difficulty": { @@ -54,11 +54,11 @@ "question__title": "搭桥过河", "question__title_slug": "NfY1m5", "question__hide": false, - "total_acs": 33, - "total_submitted": 180, - "total_column_articles": 1, + "total_acs": 56, + "total_submitted": 233, + "total_column_articles": 2, "frontend_question_id": "LCP 59", - "is_new_question": true + "is_new_question": false }, "status": null, "difficulty": { @@ -75,11 +75,11 @@ "question__title": "打地鼠", "question__title_slug": "ZbAuEH", "question__hide": false, - "total_acs": 958, - "total_submitted": 4624, - "total_column_articles": 23, + "total_acs": 1237, + "total_submitted": 5112, + "total_column_articles": 30, "frontend_question_id": "LCP 57", - "is_new_question": true + "is_new_question": false }, "status": null, "difficulty": { @@ -96,11 +96,11 @@ "question__title": "信物传送", "question__title_slug": "6UEx57", "question__hide": false, - "total_acs": 1153, - "total_submitted": 3715, - "total_column_articles": 24, + "total_acs": 1392, + "total_submitted": 4072, + "total_column_articles": 38, "frontend_question_id": "LCP 56", - "is_new_question": true + "is_new_question": false }, "status": null, "difficulty": { @@ -117,11 +117,11 @@ "question__title": "采集果实", "question__title_slug": "PTXy4P", "question__hide": false, - "total_acs": 2020, - "total_submitted": 2777, - "total_column_articles": 17, + "total_acs": 2343, + "total_submitted": 3159, + "total_column_articles": 24, "frontend_question_id": "LCP 55", - "is_new_question": true + "is_new_question": false }, "status": null, "difficulty": { @@ -138,9 +138,9 @@ "question__title": "夺回据点", "question__title_slug": "s5kipK", "question__hide": false, - "total_acs": 201, - "total_submitted": 732, - "total_column_articles": 4, + "total_acs": 236, + "total_submitted": 781, + "total_column_articles": 5, "frontend_question_id": "LCP 54", "is_new_question": false }, @@ -159,9 +159,9 @@ "question__title": "守护太空城", "question__title_slug": "EJvmW4", "question__hide": false, - "total_acs": 634, - "total_submitted": 1662, - "total_column_articles": 13, + "total_acs": 660, + "total_submitted": 1717, + "total_column_articles": 14, "frontend_question_id": "LCP 53", "is_new_question": false }, @@ -180,9 +180,9 @@ "question__title": "二叉搜索树染色", "question__title_slug": "QO5KpG", "question__hide": false, - "total_acs": 2302, - "total_submitted": 10257, - "total_column_articles": 65, + "total_acs": 2403, + "total_submitted": 10502, + "total_column_articles": 67, "frontend_question_id": "LCP 52", "is_new_question": false }, @@ -201,9 +201,9 @@ "question__title": "烹饪料理", "question__title_slug": "UEcfPD", "question__hide": false, - "total_acs": 3376, - "total_submitted": 7606, - "total_column_articles": 57, + "total_acs": 3455, + "total_submitted": 7714, + "total_column_articles": 60, "frontend_question_id": "LCP 51", "is_new_question": false }, @@ -222,9 +222,9 @@ "question__title": "宝石补给", "question__title_slug": "WHnhjV", "question__hide": false, - "total_acs": 4864, - "total_submitted": 7373, - "total_column_articles": 40, + "total_acs": 4950, + "total_submitted": 7491, + "total_column_articles": 43, "frontend_question_id": "LCP 50", "is_new_question": false }, @@ -243,9 +243,9 @@ "question__title": "自行车炫技赛场", "question__title_slug": "kplEvH", "question__hide": false, - "total_acs": 1578, - "total_submitted": 6784, - "total_column_articles": 34, + "total_acs": 1599, + "total_submitted": 6837, + "total_column_articles": 35, "frontend_question_id": "LCP 45", "is_new_question": false }, @@ -264,8 +264,8 @@ "question__title": "无限棋局", "question__title_slug": "fsa7oZ", "question__hide": false, - "total_acs": 553, - "total_submitted": 2545, + "total_acs": 561, + "total_submitted": 2555, "total_column_articles": 13, "frontend_question_id": "LCP 48", "is_new_question": false @@ -285,8 +285,8 @@ "question__title": "志愿者调配", "question__title_slug": "05ZEDJ", "question__hide": false, - "total_acs": 1242, - "total_submitted": 2899, + "total_acs": 1253, + "total_submitted": 2923, "total_column_articles": 30, "frontend_question_id": "LCP 46", "is_new_question": false @@ -306,8 +306,8 @@ "question__title": "玩具套圈", "question__title_slug": "vFjcfV", "question__hide": false, - "total_acs": 1540, - "total_submitted": 6473, + "total_acs": 1556, + "total_submitted": 6515, "total_column_articles": 36, "frontend_question_id": "LCP 42", "is_new_question": false @@ -327,9 +327,9 @@ "question__title": "黑白翻转棋", "question__title_slug": "fHi6rV", "question__hide": false, - "total_acs": 1732, - "total_submitted": 3768, - "total_column_articles": 35, + "total_acs": 1756, + "total_submitted": 3802, + "total_column_articles": 37, "frontend_question_id": "LCP 41", "is_new_question": false }, @@ -348,8 +348,8 @@ "question__title": "无人机方阵", "question__title_slug": "0jQkd0", "question__hide": false, - "total_acs": 5439, - "total_submitted": 10282, + "total_acs": 5481, + "total_submitted": 10342, "total_column_articles": 52, "frontend_question_id": "LCP 39", "is_new_question": false @@ -369,9 +369,9 @@ "question__title": "心算挑战", "question__title_slug": "uOAnQW", "question__hide": false, - "total_acs": 4844, - "total_submitted": 17545, - "total_column_articles": 97, + "total_acs": 4915, + "total_submitted": 17749, + "total_column_articles": 98, "frontend_question_id": "LCP 40", "is_new_question": false }, @@ -390,8 +390,8 @@ "question__title": "十字路口的交通", "question__title_slug": "Y1VbOX", "question__hide": false, - "total_acs": 622, - "total_submitted": 1330, + "total_acs": 636, + "total_submitted": 1348, "total_column_articles": 22, "frontend_question_id": "LCP 43", "is_new_question": false @@ -411,9 +411,9 @@ "question__title": "开幕式焰火", "question__title_slug": "sZ59z6", "question__hide": false, - "total_acs": 7492, - "total_submitted": 9430, - "total_column_articles": 101, + "total_acs": 7670, + "total_submitted": 9645, + "total_column_articles": 104, "frontend_question_id": "LCP 44", "is_new_question": false }, @@ -432,8 +432,8 @@ "question__title": "入场安检", "question__title_slug": "oPs9Bm", "question__hide": false, - "total_acs": 1163, - "total_submitted": 2897, + "total_acs": 1174, + "total_submitted": 2918, "total_column_articles": 20, "frontend_question_id": "LCP 47", "is_new_question": false @@ -453,8 +453,8 @@ "question__title": "环形闯关游戏", "question__title_slug": "K8GULz", "question__hide": false, - "total_acs": 555, - "total_submitted": 1921, + "total_acs": 564, + "total_submitted": 1953, "total_column_articles": 16, "frontend_question_id": "LCP 49", "is_new_question": false @@ -474,9 +474,9 @@ "question__title": "省份数量", "question__title_slug": "bLyHh0", "question__hide": false, - "total_acs": 9452, - "total_submitted": 14104, - "total_column_articles": 138, + "total_acs": 9779, + "total_submitted": 14570, + "total_column_articles": 140, "frontend_question_id": "剑指 Offer II 116", "is_new_question": false }, @@ -495,9 +495,9 @@ "question__title": "路径的数目", "question__title_slug": "2AoeFn", "question__hide": false, - "total_acs": 8044, - "total_submitted": 10529, - "total_column_articles": 119, + "total_acs": 8432, + "total_submitted": 11015, + "total_column_articles": 124, "frontend_question_id": "剑指 Offer II 098", "is_new_question": false }, @@ -516,9 +516,9 @@ "question__title": "含有 k 个元素的组合", "question__title_slug": "uUsW3B", "question__hide": false, - "total_acs": 10803, - "total_submitted": 12991, - "total_column_articles": 113, + "total_acs": 11297, + "total_submitted": 13575, + "total_column_articles": 115, "frontend_question_id": "剑指 Offer II 080", "is_new_question": false }, @@ -537,9 +537,9 @@ "question__title": "所有子集", "question__title_slug": "TVdhkn", "question__hide": false, - "total_acs": 12328, - "total_submitted": 14354, - "total_column_articles": 181, + "total_acs": 12831, + "total_submitted": 14935, + "total_column_articles": 184, "frontend_question_id": "剑指 Offer II 079", "is_new_question": false }, @@ -558,9 +558,9 @@ "question__title": "合并排序链表", "question__title_slug": "vvXgSW", "question__hide": false, - "total_acs": 11671, - "total_submitted": 18269, - "total_column_articles": 153, + "total_acs": 12214, + "total_submitted": 19146, + "total_column_articles": 156, "frontend_question_id": "剑指 Offer II 078", "is_new_question": false }, @@ -579,9 +579,9 @@ "question__title": "链表排序", "question__title_slug": "7WHec2", "question__hide": false, - "total_acs": 15637, - "total_submitted": 25784, - "total_column_articles": 204, + "total_acs": 16341, + "total_submitted": 26967, + "total_column_articles": 209, "frontend_question_id": "剑指 Offer II 077", "is_new_question": false }, @@ -600,9 +600,9 @@ "question__title": "数组中的第 k 大的数字", "question__title_slug": "xx4gT2", "question__hide": false, - "total_acs": 17916, - "total_submitted": 26441, - "total_column_articles": 167, + "total_acs": 18735, + "total_submitted": 27628, + "total_column_articles": 169, "frontend_question_id": "剑指 Offer II 076", "is_new_question": false }, @@ -621,9 +621,9 @@ "question__title": "数组相对排序", "question__title_slug": "0H97ZC", "question__hide": false, - "total_acs": 10970, - "total_submitted": 15503, - "total_column_articles": 173, + "total_acs": 11450, + "total_submitted": 16157, + "total_column_articles": 176, "frontend_question_id": "剑指 Offer II 075", "is_new_question": false }, @@ -642,9 +642,9 @@ "question__title": "合并区间", "question__title_slug": "SsGoHC", "question__hide": false, - "total_acs": 10358, - "total_submitted": 18072, - "total_column_articles": 121, + "total_acs": 10892, + "total_submitted": 19029, + "total_column_articles": 124, "frontend_question_id": "剑指 Offer II 074", "is_new_question": false }, @@ -663,9 +663,9 @@ "question__title": "狒狒吃香蕉", "question__title_slug": "nZZqjQ", "question__hide": false, - "total_acs": 8875, - "total_submitted": 16875, - "total_column_articles": 110, + "total_acs": 9309, + "total_submitted": 17715, + "total_column_articles": 112, "frontend_question_id": "剑指 Offer II 073", "is_new_question": false }, @@ -684,9 +684,9 @@ "question__title": "求平方根", "question__title_slug": "jJ0w9p", "question__hide": false, - "total_acs": 14513, - "total_submitted": 34708, - "total_column_articles": 144, + "total_acs": 15136, + "total_submitted": 36035, + "total_column_articles": 149, "frontend_question_id": "剑指 Offer II 072", "is_new_question": false }, @@ -705,9 +705,9 @@ "question__title": "按权重生成随机数", "question__title_slug": "cuyjEf", "question__hide": false, - "total_acs": 6233, - "total_submitted": 12456, - "total_column_articles": 65, + "total_acs": 6593, + "total_submitted": 13182, + "total_column_articles": 67, "frontend_question_id": "剑指 Offer II 071", "is_new_question": false }, @@ -726,9 +726,9 @@ "question__title": "排序数组中只出现一次的数字", "question__title_slug": "skFtm2", "question__hide": false, - "total_acs": 12032, - "total_submitted": 18732, - "total_column_articles": 142, + "total_acs": 12647, + "total_submitted": 19689, + "total_column_articles": 147, "frontend_question_id": "剑指 Offer II 070", "is_new_question": false }, @@ -747,9 +747,9 @@ "question__title": "山峰数组的顶部", "question__title_slug": "B1IidL", "question__hide": false, - "total_acs": 46491, - "total_submitted": 65315, - "total_column_articles": 473, + "total_acs": 47054, + "total_submitted": 66127, + "total_column_articles": 476, "frontend_question_id": "剑指 Offer II 069", "is_new_question": false }, @@ -768,9 +768,9 @@ "question__title": "查找插入位置", "question__title_slug": "N6YdxV", "question__hide": false, - "total_acs": 12475, - "total_submitted": 24886, - "total_column_articles": 145, + "total_acs": 13044, + "total_submitted": 25974, + "total_column_articles": 149, "frontend_question_id": "剑指 Offer II 068", "is_new_question": false }, @@ -789,9 +789,9 @@ "question__title": "最大的异或", "question__title_slug": "ms70jA", "question__hide": false, - "total_acs": 5325, - "total_submitted": 8113, - "total_column_articles": 75, + "total_acs": 5589, + "total_submitted": 8514, + "total_column_articles": 76, "frontend_question_id": "剑指 Offer II 067", "is_new_question": false }, @@ -810,9 +810,9 @@ "question__title": "单词之和", "question__title_slug": "z1R5dt", "question__hide": false, - "total_acs": 6084, - "total_submitted": 9389, - "total_column_articles": 133, + "total_acs": 6421, + "total_submitted": 9884, + "total_column_articles": 134, "frontend_question_id": "剑指 Offer II 066", "is_new_question": false }, @@ -831,9 +831,9 @@ "question__title": "最短的单词编码", "question__title_slug": "iSwD2y", "question__hide": false, - "total_acs": 5971, - "total_submitted": 9366, - "total_column_articles": 92, + "total_acs": 6315, + "total_submitted": 9941, + "total_column_articles": 99, "frontend_question_id": "剑指 Offer II 065", "is_new_question": false }, @@ -852,9 +852,9 @@ "question__title": "神奇的字典", "question__title_slug": "US1pGT", "question__hide": false, - "total_acs": 6317, - "total_submitted": 10311, - "total_column_articles": 99, + "total_acs": 6646, + "total_submitted": 10837, + "total_column_articles": 102, "frontend_question_id": "剑指 Offer II 064", "is_new_question": false }, @@ -873,9 +873,9 @@ "question__title": "替换单词", "question__title_slug": "UhWRSj", "question__hide": false, - "total_acs": 7544, - "total_submitted": 10621, - "total_column_articles": 144, + "total_acs": 7949, + "total_submitted": 11187, + "total_column_articles": 149, "frontend_question_id": "剑指 Offer II 063", "is_new_question": false }, @@ -894,9 +894,9 @@ "question__title": "和最小的 k 个数对", "question__title_slug": "qn8gGX", "question__hide": false, - "total_acs": 8284, - "total_submitted": 15242, - "total_column_articles": 104, + "total_acs": 8684, + "total_submitted": 15956, + "total_column_articles": 106, "frontend_question_id": "剑指 Offer II 061", "is_new_question": false }, @@ -915,9 +915,9 @@ "question__title": "实现前缀树", "question__title_slug": "QC3q1f", "question__hide": false, - "total_acs": 8962, - "total_submitted": 11682, - "total_column_articles": 111, + "total_acs": 9377, + "total_submitted": 12220, + "total_column_articles": 113, "frontend_question_id": "剑指 Offer II 062", "is_new_question": false }, @@ -936,9 +936,9 @@ "question__title": "出现频率最高的 k 个数字", "question__title_slug": "g5c51o", "question__hide": false, - "total_acs": 10663, - "total_submitted": 15367, - "total_column_articles": 146, + "total_acs": 11161, + "total_submitted": 16073, + "total_column_articles": 151, "frontend_question_id": "剑指 Offer II 060", "is_new_question": false }, @@ -957,9 +957,9 @@ "question__title": "数据流的第 K 大数值", "question__title_slug": "jBjn9C", "question__hide": false, - "total_acs": 9908, - "total_submitted": 15619, - "total_column_articles": 115, + "total_acs": 10325, + "total_submitted": 16289, + "total_column_articles": 117, "frontend_question_id": "剑指 Offer II 059", "is_new_question": false }, @@ -978,9 +978,9 @@ "question__title": "日程表", "question__title_slug": "fi9suh", "question__hide": false, - "total_acs": 7053, - "total_submitted": 11477, - "total_column_articles": 86, + "total_acs": 7372, + "total_submitted": 12008, + "total_column_articles": 91, "frontend_question_id": "剑指 Offer II 058", "is_new_question": false }, @@ -999,8 +999,8 @@ "question__title": "值和下标之差都在给定的范围内", "question__title_slug": "7WqeDu", "question__hide": false, - "total_acs": 7549, - "total_submitted": 21722, + "total_acs": 7911, + "total_submitted": 22710, "total_column_articles": 76, "frontend_question_id": "剑指 Offer II 057", "is_new_question": false @@ -1020,9 +1020,9 @@ "question__title": "最长连续序列", "question__title_slug": "WhsWhI", "question__hide": false, - "total_acs": 10447, - "total_submitted": 21271, - "total_column_articles": 106, + "total_acs": 10876, + "total_submitted": 22099, + "total_column_articles": 111, "frontend_question_id": "剑指 Offer II 119", "is_new_question": false }, @@ -1041,8 +1041,8 @@ "question__title": "二叉搜索树中两个节点之和", "question__title_slug": "opLdQZ", "question__hide": false, - "total_acs": 13050, - "total_submitted": 17840, + "total_acs": 13570, + "total_submitted": 18489, "total_column_articles": 176, "frontend_question_id": "剑指 Offer II 056", "is_new_question": false @@ -1062,9 +1062,9 @@ "question__title": "多余的边", "question__title_slug": "7LpjUW", "question__hide": false, - "total_acs": 4315, - "total_submitted": 6180, - "total_column_articles": 78, + "total_acs": 4517, + "total_submitted": 6482, + "total_column_articles": 79, "frontend_question_id": "剑指 Offer II 118", "is_new_question": false }, @@ -1083,9 +1083,9 @@ "question__title": "相似的字符串", "question__title_slug": "H6lPxb", "question__hide": false, - "total_acs": 3544, - "total_submitted": 5641, - "total_column_articles": 55, + "total_acs": 3743, + "total_submitted": 5971, + "total_column_articles": 56, "frontend_question_id": "剑指 Offer II 117", "is_new_question": false }, @@ -1104,9 +1104,9 @@ "question__title": "二叉搜索树迭代器", "question__title_slug": "kTOapQ", "question__hide": false, - "total_acs": 9232, - "total_submitted": 10690, - "total_column_articles": 116, + "total_acs": 9608, + "total_submitted": 11119, + "total_column_articles": 119, "frontend_question_id": "剑指 Offer II 055", "is_new_question": false }, @@ -1125,9 +1125,9 @@ "question__title": "所有大于等于节点的值之和", "question__title_slug": "w6cpku", "question__hide": false, - "total_acs": 10634, - "total_submitted": 12427, - "total_column_articles": 152, + "total_acs": 11060, + "total_submitted": 12922, + "total_column_articles": 157, "frontend_question_id": "剑指 Offer II 054", "is_new_question": false }, @@ -1146,9 +1146,9 @@ "question__title": "重建序列", "question__title_slug": "ur2n8P", "question__hide": false, - "total_acs": 3568, - "total_submitted": 11725, - "total_column_articles": 59, + "total_acs": 3743, + "total_submitted": 12361, + "total_column_articles": 62, "frontend_question_id": "剑指 Offer II 115", "is_new_question": false }, @@ -1167,9 +1167,9 @@ "question__title": "二叉搜索树中的中序后继", "question__title_slug": "P5rCT8", "question__hide": false, - "total_acs": 13554, - "total_submitted": 21484, - "total_column_articles": 155, + "total_acs": 14179, + "total_submitted": 22442, + "total_column_articles": 159, "frontend_question_id": "剑指 Offer II 053", "is_new_question": false }, @@ -1188,9 +1188,9 @@ "question__title": "外星文字典", "question__title_slug": "Jf1JuT", "question__hide": false, - "total_acs": 2941, - "total_submitted": 6969, - "total_column_articles": 57, + "total_acs": 3083, + "total_submitted": 7308, + "total_column_articles": 58, "frontend_question_id": "剑指 Offer II 114", "is_new_question": false }, @@ -1209,9 +1209,9 @@ "question__title": "展平二叉搜索树", "question__title_slug": "NYBBNL", "question__hide": false, - "total_acs": 13520, - "total_submitted": 18145, - "total_column_articles": 155, + "total_acs": 14088, + "total_submitted": 18902, + "total_column_articles": 160, "frontend_question_id": "剑指 Offer II 052", "is_new_question": false }, @@ -1230,9 +1230,9 @@ "question__title": "课程顺序", "question__title_slug": "QA2IGt", "question__hide": false, - "total_acs": 5224, - "total_submitted": 9092, - "total_column_articles": 77, + "total_acs": 5430, + "total_submitted": 9471, + "total_column_articles": 78, "frontend_question_id": "剑指 Offer II 113", "is_new_question": false }, @@ -1251,9 +1251,9 @@ "question__title": "节点之和最大的路径", "question__title_slug": "jC7MId", "question__hide": false, - "total_acs": 8384, - "total_submitted": 18214, - "total_column_articles": 97, + "total_acs": 8743, + "total_submitted": 18943, + "total_column_articles": 98, "frontend_question_id": "剑指 Offer II 051", "is_new_question": false }, @@ -1272,9 +1272,9 @@ "question__title": "最长递增路径", "question__title_slug": "fpTFWP", "question__hide": false, - "total_acs": 5216, - "total_submitted": 9031, - "total_column_articles": 67, + "total_acs": 5454, + "total_submitted": 9525, + "total_column_articles": 70, "frontend_question_id": "剑指 Offer II 112", "is_new_question": false }, @@ -1293,9 +1293,9 @@ "question__title": "向下的路径节点之和", "question__title_slug": "6eUYwP", "question__hide": false, - "total_acs": 10892, - "total_submitted": 18057, - "total_column_articles": 117, + "total_acs": 11385, + "total_submitted": 18913, + "total_column_articles": 124, "frontend_question_id": "剑指 Offer II 050", "is_new_question": false }, @@ -1314,9 +1314,9 @@ "question__title": "从根节点到叶节点的路径数字之和", "question__title_slug": "3Etpl5", "question__hide": false, - "total_acs": 12583, - "total_submitted": 16841, - "total_column_articles": 163, + "total_acs": 13133, + "total_submitted": 17636, + "total_column_articles": 170, "frontend_question_id": "剑指 Offer II 049", "is_new_question": false }, @@ -1335,9 +1335,9 @@ "question__title": "计算除法", "question__title_slug": "vlzXQL", "question__hide": false, - "total_acs": 3274, - "total_submitted": 4911, - "total_column_articles": 63, + "total_acs": 3462, + "total_submitted": 5200, + "total_column_articles": 64, "frontend_question_id": "剑指 Offer II 111", "is_new_question": false }, @@ -1356,9 +1356,9 @@ "question__title": "序列化与反序列化二叉树", "question__title_slug": "h54YBf", "question__hide": false, - "total_acs": 9020, - "total_submitted": 13362, - "total_column_articles": 94, + "total_acs": 9538, + "total_submitted": 14072, + "total_column_articles": 97, "frontend_question_id": "剑指 Offer II 048", "is_new_question": false }, @@ -1377,9 +1377,9 @@ "question__title": "所有路径", "question__title_slug": "bP4bmD", "question__hide": false, - "total_acs": 6909, - "total_submitted": 8549, - "total_column_articles": 112, + "total_acs": 7223, + "total_submitted": 8955, + "total_column_articles": 116, "frontend_question_id": "剑指 Offer II 110", "is_new_question": false }, @@ -1398,9 +1398,9 @@ "question__title": "开密码锁", "question__title_slug": "zlDJc7", "question__hide": false, - "total_acs": 5160, - "total_submitted": 8896, - "total_column_articles": 63, + "total_acs": 5369, + "total_submitted": 9284, + "total_column_articles": 65, "frontend_question_id": "剑指 Offer II 109", "is_new_question": false }, @@ -1419,9 +1419,9 @@ "question__title": "二叉树剪枝", "question__title_slug": "pOCWxh", "question__hide": false, - "total_acs": 12521, - "total_submitted": 18239, - "total_column_articles": 183, + "total_acs": 13037, + "total_submitted": 19008, + "total_column_articles": 186, "frontend_question_id": "剑指 Offer II 047", "is_new_question": false }, @@ -1440,9 +1440,9 @@ "question__title": "单词演变", "question__title_slug": "om3reC", "question__hide": false, - "total_acs": 3805, - "total_submitted": 6258, - "total_column_articles": 47, + "total_acs": 4000, + "total_submitted": 6684, + "total_column_articles": 48, "frontend_question_id": "剑指 Offer II 108", "is_new_question": false }, @@ -1461,9 +1461,9 @@ "question__title": "二叉树的右侧视图", "question__title_slug": "WNC0Lk", "question__hide": false, - "total_acs": 11803, - "total_submitted": 16467, - "total_column_articles": 180, + "total_acs": 12305, + "total_submitted": 17179, + "total_column_articles": 185, "frontend_question_id": "剑指 Offer II 046", "is_new_question": false }, @@ -1482,9 +1482,9 @@ "question__title": "二叉树最底层最左边的值", "question__title_slug": "LwUNpT", "question__hide": false, - "total_acs": 13060, - "total_submitted": 16348, - "total_column_articles": 204, + "total_acs": 13628, + "total_submitted": 17090, + "total_column_articles": 207, "frontend_question_id": "剑指 Offer II 045", "is_new_question": false }, @@ -1503,9 +1503,9 @@ "question__title": "二叉树每层的最大值", "question__title_slug": "hPov7L", "question__hide": false, - "total_acs": 13230, - "total_submitted": 20945, - "total_column_articles": 182, + "total_acs": 13753, + "total_submitted": 21763, + "total_column_articles": 184, "frontend_question_id": "剑指 Offer II 044", "is_new_question": false }, @@ -1524,9 +1524,9 @@ "question__title": "矩阵中的距离", "question__title_slug": "2bCMpM", "question__hide": false, - "total_acs": 5476, - "total_submitted": 10366, - "total_column_articles": 58, + "total_acs": 5735, + "total_submitted": 10914, + "total_column_articles": 60, "frontend_question_id": "剑指 Offer II 107", "is_new_question": false }, @@ -1545,9 +1545,9 @@ "question__title": "往完全二叉树添加节点", "question__title_slug": "NaqhDT", "question__hide": false, - "total_acs": 9402, - "total_submitted": 15085, - "total_column_articles": 150, + "total_acs": 9819, + "total_submitted": 15768, + "total_column_articles": 152, "frontend_question_id": "剑指 Offer II 043", "is_new_question": false }, @@ -1566,9 +1566,9 @@ "question__title": "二分图", "question__title_slug": "vEAB3K", "question__hide": false, - "total_acs": 5707, - "total_submitted": 10398, - "total_column_articles": 77, + "total_acs": 5964, + "total_submitted": 10874, + "total_column_articles": 79, "frontend_question_id": "剑指 Offer II 106", "is_new_question": false }, @@ -1587,9 +1587,9 @@ "question__title": "最近请求次数", "question__title_slug": "H8086Q", "question__hide": false, - "total_acs": 11769, - "total_submitted": 14209, - "total_column_articles": 128, + "total_acs": 12257, + "total_submitted": 14790, + "total_column_articles": 131, "frontend_question_id": "剑指 Offer II 042", "is_new_question": false }, @@ -1608,9 +1608,9 @@ "question__title": "滑动窗口的平均值", "question__title_slug": "qIsx9U", "question__hide": false, - "total_acs": 13837, - "total_submitted": 17821, - "total_column_articles": 151, + "total_acs": 14419, + "total_submitted": 18545, + "total_column_articles": 156, "frontend_question_id": "剑指 Offer II 041", "is_new_question": false }, @@ -1629,9 +1629,9 @@ "question__title": "岛屿的最大面积", "question__title_slug": "ZL6zAn", "question__hide": false, - "total_acs": 11585, - "total_submitted": 16549, - "total_column_articles": 143, + "total_acs": 12128, + "total_submitted": 17312, + "total_column_articles": 144, "frontend_question_id": "剑指 Offer II 105", "is_new_question": false }, @@ -1650,9 +1650,9 @@ "question__title": "排列的数目", "question__title_slug": "D0F0SV", "question__hide": false, - "total_acs": 5577, - "total_submitted": 9488, - "total_column_articles": 57, + "total_acs": 5861, + "total_submitted": 9995, + "total_column_articles": 58, "frontend_question_id": "剑指 Offer II 104", "is_new_question": false }, @@ -1671,9 +1671,9 @@ "question__title": "最少的硬币数目", "question__title_slug": "gaM7Ch", "question__hide": false, - "total_acs": 11059, - "total_submitted": 21845, - "total_column_articles": 90, + "total_acs": 11560, + "total_submitted": 22773, + "total_column_articles": 92, "frontend_question_id": "剑指 Offer II 103", "is_new_question": false }, @@ -1692,9 +1692,9 @@ "question__title": "加减的目标值", "question__title_slug": "YaVDxD", "question__hide": false, - "total_acs": 7427, - "total_submitted": 12814, - "total_column_articles": 70, + "total_acs": 7796, + "total_submitted": 13490, + "total_column_articles": 71, "frontend_question_id": "剑指 Offer II 102", "is_new_question": false }, @@ -1713,8 +1713,8 @@ "question__title": "分割等和子集", "question__title_slug": "NUPfPr", "question__hide": false, - "total_acs": 9746, - "total_submitted": 19434, + "total_acs": 10169, + "total_submitted": 20315, "total_column_articles": 93, "frontend_question_id": "剑指 Offer II 101", "is_new_question": false @@ -1734,9 +1734,9 @@ "question__title": "三角形中最小路径之和", "question__title_slug": "IlPe0q", "question__hide": false, - "total_acs": 8241, - "total_submitted": 10830, - "total_column_articles": 110, + "total_acs": 8622, + "total_submitted": 11323, + "total_column_articles": 114, "frontend_question_id": "剑指 Offer II 100", "is_new_question": false }, @@ -1755,9 +1755,9 @@ "question__title": "最小路径之和", "question__title_slug": "0i0mDW", "question__hide": false, - "total_acs": 9785, - "total_submitted": 13516, - "total_column_articles": 115, + "total_acs": 10175, + "total_submitted": 14045, + "total_column_articles": 119, "frontend_question_id": "剑指 Offer II 099", "is_new_question": false }, @@ -1776,9 +1776,9 @@ "question__title": "矩阵中最大的矩形", "question__title_slug": "PLYXKQ", "question__hide": false, - "total_acs": 7240, - "total_submitted": 12468, - "total_column_articles": 110, + "total_acs": 7538, + "total_submitted": 12961, + "total_column_articles": 111, "frontend_question_id": "剑指 Offer II 040", "is_new_question": false }, @@ -1797,9 +1797,9 @@ "question__title": "直方图最大矩形面积", "question__title_slug": "0ynMMM", "question__hide": false, - "total_acs": 11019, - "total_submitted": 21879, - "total_column_articles": 106, + "total_acs": 11475, + "total_submitted": 22818, + "total_column_articles": 107, "frontend_question_id": "剑指 Offer II 039", "is_new_question": false }, @@ -1818,9 +1818,9 @@ "question__title": "每日温度", "question__title_slug": "iIQa4I", "question__hide": false, - "total_acs": 15678, - "total_submitted": 20337, - "total_column_articles": 180, + "total_acs": 16305, + "total_submitted": 21112, + "total_column_articles": 183, "frontend_question_id": "剑指 Offer II 038", "is_new_question": false }, @@ -1839,9 +1839,9 @@ "question__title": "小行星碰撞", "question__title_slug": "XagZNi", "question__hide": false, - "total_acs": 12782, - "total_submitted": 28943, - "total_column_articles": 202, + "total_acs": 13287, + "total_submitted": 30009, + "total_column_articles": 204, "frontend_question_id": "剑指 Offer II 037", "is_new_question": false }, @@ -1860,8 +1860,8 @@ "question__title": "子序列的数目", "question__title_slug": "21dk04", "question__hide": false, - "total_acs": 5108, - "total_submitted": 9439, + "total_acs": 5382, + "total_submitted": 9940, "total_column_articles": 66, "frontend_question_id": "剑指 Offer II 097", "is_new_question": false @@ -1881,9 +1881,9 @@ "question__title": "后缀表达式", "question__title_slug": "8Zf90G", "question__hide": false, - "total_acs": 12260, - "total_submitted": 21761, - "total_column_articles": 170, + "total_acs": 12744, + "total_submitted": 22567, + "total_column_articles": 171, "frontend_question_id": "剑指 Offer II 036", "is_new_question": false }, @@ -1902,9 +1902,9 @@ "question__title": "最小时间差", "question__title_slug": "569nqc", "question__hide": false, - "total_acs": 12293, - "total_submitted": 18432, - "total_column_articles": 124, + "total_acs": 12759, + "total_submitted": 19095, + "total_column_articles": 125, "frontend_question_id": "剑指 Offer II 035", "is_new_question": false }, @@ -1923,8 +1923,8 @@ "question__title": "字符串交织", "question__title_slug": "IY6buf", "question__hide": false, - "total_acs": 6054, - "total_submitted": 12791, + "total_acs": 6377, + "total_submitted": 13443, "total_column_articles": 69, "frontend_question_id": "剑指 Offer II 096", "is_new_question": false @@ -1944,9 +1944,9 @@ "question__title": "外星语言是否排序", "question__title_slug": "lwyVBB", "question__hide": false, - "total_acs": 10906, - "total_submitted": 19531, - "total_column_articles": 165, + "total_acs": 11356, + "total_submitted": 20302, + "total_column_articles": 170, "frontend_question_id": "剑指 Offer II 034", "is_new_question": false }, @@ -1965,9 +1965,9 @@ "question__title": "变位词组", "question__title_slug": "sfvd7V", "question__hide": false, - "total_acs": 12619, - "total_submitted": 16812, - "total_column_articles": 141, + "total_acs": 13141, + "total_submitted": 17471, + "total_column_articles": 143, "frontend_question_id": "剑指 Offer II 033", "is_new_question": false }, @@ -1986,9 +1986,9 @@ "question__title": "最长公共子序列", "question__title_slug": "qJnOS7", "question__hide": false, - "total_acs": 18589, - "total_submitted": 28219, - "total_column_articles": 137, + "total_acs": 19239, + "total_submitted": 29147, + "total_column_articles": 141, "frontend_question_id": "剑指 Offer II 095", "is_new_question": false }, @@ -2007,9 +2007,9 @@ "question__title": "有效的变位词", "question__title_slug": "dKk3P7", "question__hide": false, - "total_acs": 15190, - "total_submitted": 25240, - "total_column_articles": 148, + "total_acs": 15749, + "total_submitted": 26149, + "total_column_articles": 149, "frontend_question_id": "剑指 Offer II 032", "is_new_question": false }, @@ -2028,9 +2028,9 @@ "question__title": "最少回文分割", "question__title_slug": "omKAoA", "question__hide": false, - "total_acs": 5413, - "total_submitted": 9330, - "total_column_articles": 58, + "total_acs": 5703, + "total_submitted": 9786, + "total_column_articles": 60, "frontend_question_id": "剑指 Offer II 094", "is_new_question": false }, @@ -2049,9 +2049,9 @@ "question__title": "最长斐波那契数列", "question__title_slug": "Q91FMA", "question__hide": false, - "total_acs": 7288, - "total_submitted": 12473, - "total_column_articles": 68, + "total_acs": 7722, + "total_submitted": 13268, + "total_column_articles": 69, "frontend_question_id": "剑指 Offer II 093", "is_new_question": false }, @@ -2070,9 +2070,9 @@ "question__title": "最近最少使用缓存", "question__title_slug": "OrIXps", "question__hide": false, - "total_acs": 11204, - "total_submitted": 20780, - "total_column_articles": 128, + "total_acs": 11596, + "total_submitted": 21485, + "total_column_articles": 130, "frontend_question_id": "剑指 Offer II 031", "is_new_question": false }, @@ -2091,9 +2091,9 @@ "question__title": "翻转字符", "question__title_slug": "cyJERH", "question__hide": false, - "total_acs": 8025, - "total_submitted": 12064, - "total_column_articles": 126, + "total_acs": 8428, + "total_submitted": 12635, + "total_column_articles": 129, "frontend_question_id": "剑指 Offer II 092", "is_new_question": false }, @@ -2112,9 +2112,9 @@ "question__title": "粉刷房子", "question__title_slug": "JEj789", "question__hide": false, - "total_acs": 9219, - "total_submitted": 11939, - "total_column_articles": 170, + "total_acs": 9644, + "total_submitted": 12498, + "total_column_articles": 177, "frontend_question_id": "剑指 Offer II 091", "is_new_question": false }, @@ -2133,9 +2133,9 @@ "question__title": "插入、删除和随机访问都是 O(1) 的容器", "question__title_slug": "FortPu", "question__hide": false, - "total_acs": 10224, - "total_submitted": 18813, - "total_column_articles": 93, + "total_acs": 10657, + "total_submitted": 19641, + "total_column_articles": 94, "frontend_question_id": "剑指 Offer II 030", "is_new_question": false }, @@ -2154,9 +2154,9 @@ "question__title": "环形房屋偷盗", "question__title_slug": "PzWKhm", "question__hide": false, - "total_acs": 7120, - "total_submitted": 14534, - "total_column_articles": 86, + "total_acs": 7453, + "total_submitted": 15229, + "total_column_articles": 88, "frontend_question_id": "剑指 Offer II 090", "is_new_question": false }, @@ -2175,9 +2175,9 @@ "question__title": "排序的循环链表", "question__title_slug": "4ueAj6", "question__hide": false, - "total_acs": 11738, - "total_submitted": 38290, - "total_column_articles": 217, + "total_acs": 12186, + "total_submitted": 39984, + "total_column_articles": 221, "frontend_question_id": "剑指 Offer II 029", "is_new_question": false }, @@ -2196,9 +2196,9 @@ "question__title": "展平多级双向链表", "question__title_slug": "Qv1Da2", "question__hide": false, - "total_acs": 10911, - "total_submitted": 17916, - "total_column_articles": 180, + "total_acs": 11363, + "total_submitted": 18628, + "total_column_articles": 184, "frontend_question_id": "剑指 Offer II 028", "is_new_question": false }, @@ -2217,9 +2217,9 @@ "question__title": "回文链表", "question__title_slug": "aMhZSa", "question__hide": false, - "total_acs": 27048, - "total_submitted": 43939, - "total_column_articles": 278, + "total_acs": 28162, + "total_submitted": 45728, + "total_column_articles": 280, "frontend_question_id": "剑指 Offer II 027", "is_new_question": false }, @@ -2238,9 +2238,9 @@ "question__title": "重排链表", "question__title_slug": "LGjMqU", "question__hide": false, - "total_acs": 17660, - "total_submitted": 26667, - "total_column_articles": 207, + "total_acs": 18331, + "total_submitted": 27685, + "total_column_articles": 209, "frontend_question_id": "剑指 Offer II 026", "is_new_question": false }, @@ -2259,9 +2259,9 @@ "question__title": "链表中的两数相加", "question__title_slug": "lMSNwu", "question__hide": false, - "total_acs": 17093, - "total_submitted": 28670, - "total_column_articles": 225, + "total_acs": 17757, + "total_submitted": 29854, + "total_column_articles": 232, "frontend_question_id": "剑指 Offer II 025", "is_new_question": false }, @@ -2280,9 +2280,9 @@ "question__title": "反转链表", "question__title_slug": "UHnkqh", "question__hide": false, - "total_acs": 43653, - "total_submitted": 57842, - "total_column_articles": 296, + "total_acs": 45058, + "total_submitted": 59660, + "total_column_articles": 302, "frontend_question_id": "剑指 Offer II 024", "is_new_question": false }, @@ -2301,9 +2301,9 @@ "question__title": "两个链表的第一个重合节点", "question__title_slug": "3u1WK4", "question__hide": false, - "total_acs": 19535, - "total_submitted": 27932, - "total_column_articles": 158, + "total_acs": 20227, + "total_submitted": 28922, + "total_column_articles": 159, "frontend_question_id": "剑指 Offer II 023", "is_new_question": false }, @@ -2322,9 +2322,9 @@ "question__title": "链表中环的入口节点", "question__title_slug": "c32eOV", "question__hide": false, - "total_acs": 24985, - "total_submitted": 45260, - "total_column_articles": 204, + "total_acs": 25844, + "total_submitted": 46899, + "total_column_articles": 207, "frontend_question_id": "剑指 Offer II 022", "is_new_question": false }, @@ -2343,9 +2343,9 @@ "question__title": "删除链表的倒数第 n 个结点", "question__title_slug": "SLwz0R", "question__hide": false, - "total_acs": 22088, - "total_submitted": 41990, - "total_column_articles": 260, + "total_acs": 22903, + "total_submitted": 43454, + "total_column_articles": 264, "frontend_question_id": "剑指 Offer II 021", "is_new_question": false }, @@ -2364,9 +2364,9 @@ "question__title": "回文子字符串的个数", "question__title_slug": "a7VOhD", "question__hide": false, - "total_acs": 16261, - "total_submitted": 22610, - "total_column_articles": 175, + "total_acs": 16905, + "total_submitted": 23547, + "total_column_articles": 178, "frontend_question_id": "剑指 Offer II 020", "is_new_question": false }, @@ -2385,9 +2385,9 @@ "question__title": "最多删除一个字符得到回文", "question__title_slug": "RQku0D", "question__hide": false, - "total_acs": 16793, - "total_submitted": 36676, - "total_column_articles": 186, + "total_acs": 17400, + "total_submitted": 37931, + "total_column_articles": 189, "frontend_question_id": "剑指 Offer II 019", "is_new_question": false }, @@ -2406,9 +2406,9 @@ "question__title": "有效的回文", "question__title_slug": "XltzEq", "question__hide": false, - "total_acs": 18969, - "total_submitted": 36857, - "total_column_articles": 189, + "total_acs": 19671, + "total_submitted": 38222, + "total_column_articles": 194, "frontend_question_id": "剑指 Offer II 018", "is_new_question": false }, @@ -2427,9 +2427,9 @@ "question__title": "含有所有字符的最短字符串", "question__title_slug": "M1oyTv", "question__hide": false, - "total_acs": 12949, - "total_submitted": 25726, - "total_column_articles": 160, + "total_acs": 13437, + "total_submitted": 26784, + "total_column_articles": 164, "frontend_question_id": "剑指 Offer II 017", "is_new_question": false }, @@ -2448,9 +2448,9 @@ "question__title": "不含重复字符的最长子字符串", "question__title_slug": "wtcaE1", "question__hide": false, - "total_acs": 20286, - "total_submitted": 42617, - "total_column_articles": 229, + "total_acs": 21041, + "total_submitted": 44130, + "total_column_articles": 238, "frontend_question_id": "剑指 Offer II 016", "is_new_question": false }, @@ -2469,9 +2469,9 @@ "question__title": "字符串中的所有变位词", "question__title_slug": "VabMRr", "question__hide": false, - "total_acs": 14537, - "total_submitted": 23470, - "total_column_articles": 163, + "total_acs": 15103, + "total_submitted": 24425, + "total_column_articles": 165, "frontend_question_id": "剑指 Offer II 015", "is_new_question": false }, @@ -2490,9 +2490,9 @@ "question__title": "字符串中的变位词", "question__title_slug": "MPnaiL", "question__hide": false, - "total_acs": 18434, - "total_submitted": 35897, - "total_column_articles": 182, + "total_acs": 19134, + "total_submitted": 37255, + "total_column_articles": 191, "frontend_question_id": "剑指 Offer II 014", "is_new_question": false }, @@ -2511,9 +2511,9 @@ "question__title": "二维子矩阵的和", "question__title_slug": "O4NDxx", "question__hide": false, - "total_acs": 14611, - "total_submitted": 22118, - "total_column_articles": 161, + "total_acs": 15216, + "total_submitted": 23026, + "total_column_articles": 162, "frontend_question_id": "剑指 Offer II 013", "is_new_question": false }, @@ -2532,9 +2532,9 @@ "question__title": "左右两边子数组的和相等", "question__title_slug": "tvdfij", "question__hide": false, - "total_acs": 20697, - "total_submitted": 30922, - "total_column_articles": 227, + "total_acs": 21466, + "total_submitted": 32114, + "total_column_articles": 232, "frontend_question_id": "剑指 Offer II 012", "is_new_question": false }, @@ -2553,9 +2553,9 @@ "question__title": "0 和 1 个数相同的子数组", "question__title_slug": "A1NYOS", "question__hide": false, - "total_acs": 17813, - "total_submitted": 31955, - "total_column_articles": 192, + "total_acs": 18479, + "total_submitted": 33187, + "total_column_articles": 194, "frontend_question_id": "剑指 Offer II 011", "is_new_question": false }, @@ -2574,9 +2574,9 @@ "question__title": "和为 k 的子数组", "question__title_slug": "QTMn0o", "question__hide": false, - "total_acs": 22840, - "total_submitted": 52519, - "total_column_articles": 211, + "total_acs": 23746, + "total_submitted": 54603, + "total_column_articles": 215, "frontend_question_id": "剑指 Offer II 010", "is_new_question": false }, @@ -2595,9 +2595,9 @@ "question__title": "房屋偷盗", "question__title_slug": "Gu0c2T", "question__hide": false, - "total_acs": 10769, - "total_submitted": 17661, - "total_column_articles": 105, + "total_acs": 11211, + "total_submitted": 18375, + "total_column_articles": 108, "frontend_question_id": "剑指 Offer II 089", "is_new_question": false }, @@ -2616,9 +2616,9 @@ "question__title": "乘积小于 K 的子数组", "question__title_slug": "ZVAVXX", "question__hide": false, - "total_acs": 21562, - "total_submitted": 40167, - "total_column_articles": 219, + "total_acs": 22404, + "total_submitted": 41721, + "total_column_articles": 229, "frontend_question_id": "剑指 Offer II 009", "is_new_question": false }, @@ -2637,9 +2637,9 @@ "question__title": "爬楼梯的最少成本", "question__title_slug": "GzCJIP", "question__hide": false, - "total_acs": 15442, - "total_submitted": 20902, - "total_column_articles": 154, + "total_acs": 16070, + "total_submitted": 21781, + "total_column_articles": 160, "frontend_question_id": "剑指 Offer II 088", "is_new_question": false }, @@ -2658,9 +2658,9 @@ "question__title": "和大于等于 target 的最短子数组", "question__title_slug": "2VG8Kg", "question__hide": false, - "total_acs": 25651, - "total_submitted": 52509, - "total_column_articles": 246, + "total_acs": 26664, + "total_submitted": 54639, + "total_column_articles": 255, "frontend_question_id": "剑指 Offer II 008", "is_new_question": false }, @@ -2679,9 +2679,9 @@ "question__title": "复原 IP ", "question__title_slug": "0on3uN", "question__hide": false, - "total_acs": 8709, - "total_submitted": 13852, - "total_column_articles": 117, + "total_acs": 9104, + "total_submitted": 14495, + "total_column_articles": 120, "frontend_question_id": "剑指 Offer II 087", "is_new_question": false }, @@ -2700,9 +2700,9 @@ "question__title": "分割回文子字符串", "question__title_slug": "M99OJA", "question__hide": false, - "total_acs": 8468, - "total_submitted": 11302, - "total_column_articles": 102, + "total_acs": 8884, + "total_submitted": 11793, + "total_column_articles": 104, "frontend_question_id": "剑指 Offer II 086", "is_new_question": false }, @@ -2721,9 +2721,9 @@ "question__title": "数组中和为 0 的三个数", "question__title_slug": "1fGaJU", "question__hide": false, - "total_acs": 25247, - "total_submitted": 57060, - "total_column_articles": 203, + "total_acs": 26174, + "total_submitted": 59160, + "total_column_articles": 208, "frontend_question_id": "剑指 Offer II 007", "is_new_question": false }, @@ -2742,9 +2742,9 @@ "question__title": "生成匹配的括号", "question__title_slug": "IDBivT", "question__hide": false, - "total_acs": 12016, - "total_submitted": 14095, - "total_column_articles": 165, + "total_acs": 12543, + "total_submitted": 14712, + "total_column_articles": 171, "frontend_question_id": "剑指 Offer II 085", "is_new_question": false }, @@ -2763,9 +2763,9 @@ "question__title": "排序数组中两个数字之和", "question__title_slug": "kLl5u1", "question__hide": false, - "total_acs": 27916, - "total_submitted": 43446, - "total_column_articles": 248, + "total_acs": 28904, + "total_submitted": 45008, + "total_column_articles": 256, "frontend_question_id": "剑指 Offer II 006", "is_new_question": false }, @@ -2784,9 +2784,9 @@ "question__title": "单词长度的最大乘积", "question__title_slug": "aseY1I", "question__hide": false, - "total_acs": 24299, - "total_submitted": 34352, - "total_column_articles": 233, + "total_acs": 25142, + "total_submitted": 35506, + "total_column_articles": 237, "frontend_question_id": "剑指 Offer II 005", "is_new_question": false }, @@ -2805,9 +2805,9 @@ "question__title": "含有重复元素集合的全排列 ", "question__title_slug": "7p8L0Z", "question__hide": false, - "total_acs": 10071, - "total_submitted": 14559, - "total_column_articles": 108, + "total_acs": 10459, + "total_submitted": 15138, + "total_column_articles": 109, "frontend_question_id": "剑指 Offer II 084", "is_new_question": false }, @@ -2826,9 +2826,9 @@ "question__title": "没有重复元素集合的全排列", "question__title_slug": "VvJkup", "question__hide": false, - "total_acs": 11571, - "total_submitted": 13480, - "total_column_articles": 150, + "total_acs": 12025, + "total_submitted": 13995, + "total_column_articles": 151, "frontend_question_id": "剑指 Offer II 083", "is_new_question": false }, @@ -2847,9 +2847,9 @@ "question__title": "只出现一次的数字 ", "question__title_slug": "WGki4K", "question__hide": false, - "total_acs": 30573, - "total_submitted": 43196, - "total_column_articles": 270, + "total_acs": 31585, + "total_submitted": 44594, + "total_column_articles": 274, "frontend_question_id": "剑指 Offer II 004", "is_new_question": false }, @@ -2868,9 +2868,9 @@ "question__title": "含有重复元素集合的组合", "question__title_slug": "4sjJUc", "question__hide": false, - "total_acs": 10416, - "total_submitted": 15893, - "total_column_articles": 115, + "total_acs": 10847, + "total_submitted": 16489, + "total_column_articles": 120, "frontend_question_id": "剑指 Offer II 082", "is_new_question": false }, @@ -2889,9 +2889,9 @@ "question__title": "二进制加法", "question__title_slug": "JFETK5", "question__hide": false, - "total_acs": 28166, - "total_submitted": 50872, - "total_column_articles": 306, + "total_acs": 29148, + "total_submitted": 52710, + "total_column_articles": 310, "frontend_question_id": "剑指 Offer II 002", "is_new_question": false }, @@ -2910,9 +2910,9 @@ "question__title": "前 n 个数字二进制中 1 的个数", "question__title_slug": "w3tCBm", "question__hide": false, - "total_acs": 36153, - "total_submitted": 45978, - "total_column_articles": 355, + "total_acs": 37310, + "total_submitted": 47442, + "total_column_articles": 361, "frontend_question_id": "剑指 Offer II 003", "is_new_question": false }, @@ -2931,9 +2931,9 @@ "question__title": "允许重复选择元素的组合", "question__title_slug": "Ygoe9J", "question__hide": false, - "total_acs": 12797, - "total_submitted": 15991, - "total_column_articles": 152, + "total_acs": 13251, + "total_submitted": 16545, + "total_column_articles": 153, "frontend_question_id": "剑指 Offer II 081", "is_new_question": false }, @@ -2952,9 +2952,9 @@ "question__title": "整数除法", "question__title_slug": "xoh6Oh", "question__hide": false, - "total_acs": 32234, - "total_submitted": 153889, - "total_column_articles": 299, + "total_acs": 33284, + "total_submitted": 158598, + "total_column_articles": 301, "frontend_question_id": "剑指 Offer II 001", "is_new_question": false }, @@ -2973,9 +2973,9 @@ "question__title": "主题空间", "question__title_slug": "YesdPw", "question__hide": false, - "total_acs": 2474, - "total_submitted": 6043, - "total_column_articles": 72, + "total_acs": 2491, + "total_submitted": 6103, + "total_column_articles": 73, "frontend_question_id": "LCS 03", "is_new_question": false }, @@ -2994,9 +2994,9 @@ "question__title": "完成一半题目", "question__title_slug": "WqXACV", "question__hide": false, - "total_acs": 5632, - "total_submitted": 8519, - "total_column_articles": 111, + "total_acs": 5729, + "total_submitted": 8668, + "total_column_articles": 112, "frontend_question_id": "LCS 02", "is_new_question": false }, @@ -3015,9 +3015,9 @@ "question__title": "下载插件", "question__title_slug": "Ju9Xwi", "question__hide": false, - "total_acs": 7906, - "total_submitted": 14477, - "total_column_articles": 167, + "total_acs": 8045, + "total_submitted": 14748, + "total_column_articles": 172, "frontend_question_id": "LCS 01", "is_new_question": false }, @@ -3036,9 +3036,9 @@ "question__title": "魔塔游戏", "question__title_slug": "p0NxJO", "question__hide": false, - "total_acs": 7408, - "total_submitted": 20061, - "total_column_articles": 123, + "total_acs": 7490, + "total_submitted": 20245, + "total_column_articles": 124, "frontend_question_id": "LCP 30", "is_new_question": false }, @@ -3057,8 +3057,8 @@ "question__title": "守卫城堡", "question__title_slug": "7rLGCR", "question__hide": false, - "total_acs": 739, - "total_submitted": 1163, + "total_acs": 750, + "total_submitted": 1179, "total_column_articles": 16, "frontend_question_id": "LCP 38", "is_new_question": false @@ -3078,8 +3078,8 @@ "question__title": "最多牌组数", "question__title_slug": "Up5XYM", "question__hide": false, - "total_acs": 1245, - "total_submitted": 3840, + "total_acs": 1253, + "total_submitted": 3852, "total_column_articles": 22, "frontend_question_id": "LCP 36", "is_new_question": false @@ -3099,9 +3099,9 @@ "question__title": "蓄水", "question__title_slug": "o8SXZn", "question__hide": false, - "total_acs": 6512, - "total_submitted": 26426, - "total_column_articles": 113, + "total_acs": 6606, + "total_submitted": 26699, + "total_column_articles": 114, "frontend_question_id": "LCP 33", "is_new_question": false }, @@ -3120,8 +3120,8 @@ "question__title": "电动车游城市", "question__title_slug": "DFPeFJ", "question__hide": false, - "total_acs": 1731, - "total_submitted": 3757, + "total_acs": 1744, + "total_submitted": 3773, "total_column_articles": 29, "frontend_question_id": "LCP 35", "is_new_question": false @@ -3141,8 +3141,8 @@ "question__title": "批量处理任务", "question__title_slug": "t3fKg1", "question__hide": false, - "total_acs": 1495, - "total_submitted": 3343, + "total_acs": 1515, + "total_submitted": 3381, "total_column_articles": 23, "frontend_question_id": "LCP 32", "is_new_question": false @@ -3162,8 +3162,8 @@ "question__title": "变换的迷宫", "question__title_slug": "Db3wC1", "question__hide": false, - "total_acs": 2331, - "total_submitted": 8266, + "total_acs": 2357, + "total_submitted": 8337, "total_column_articles": 40, "frontend_question_id": "LCP 31", "is_new_question": false @@ -3183,8 +3183,8 @@ "question__title": "乐团站位", "question__title_slug": "SNJvJP", "question__hide": false, - "total_acs": 7022, - "total_submitted": 33910, + "total_acs": 7074, + "total_submitted": 34114, "total_column_articles": 161, "frontend_question_id": "LCP 29", "is_new_question": false @@ -3204,9 +3204,9 @@ "question__title": "采购方案", "question__title_slug": "4xy4Wx", "question__hide": false, - "total_acs": 14478, - "total_submitted": 47544, - "total_column_articles": 237, + "total_acs": 14614, + "total_submitted": 47931, + "total_column_articles": 238, "frontend_question_id": "LCP 28", "is_new_question": false }, @@ -3225,8 +3225,8 @@ "question__title": "黑盒光线反射", "question__title_slug": "IQvJ9i", "question__hide": false, - "total_acs": 1416, - "total_submitted": 4192, + "total_acs": 1421, + "total_submitted": 4208, "total_column_articles": 28, "frontend_question_id": "LCP 27", "is_new_question": false @@ -3246,9 +3246,9 @@ "question__title": "早餐组合", "question__title_slug": "2vYnGI", "question__hide": false, - "total_acs": 20586, - "total_submitted": 69664, - "total_column_articles": 280, + "total_acs": 20683, + "total_submitted": 69937, + "total_column_articles": 282, "frontend_question_id": "LCP 18", "is_new_question": false }, @@ -3267,9 +3267,9 @@ "question__title": "黑白方格画", "question__title_slug": "ccw6C7", "question__hide": false, - "total_acs": 9831, - "total_submitted": 28869, - "total_column_articles": 198, + "total_acs": 9864, + "total_submitted": 28951, + "total_column_articles": 200, "frontend_question_id": "LCP 22", "is_new_question": false }, @@ -3288,9 +3288,9 @@ "question__title": "速算机器人", "question__title_slug": "nGK0Fy", "question__hide": false, - "total_acs": 26825, - "total_submitted": 33533, - "total_column_articles": 298, + "total_acs": 26960, + "total_submitted": 33691, + "total_column_articles": 300, "frontend_question_id": "LCP 17", "is_new_question": false }, @@ -3309,8 +3309,8 @@ "question__title": "古董键盘", "question__title_slug": "Uh984O", "question__hide": false, - "total_acs": 1452, - "total_submitted": 4035, + "total_acs": 1466, + "total_submitted": 4072, "total_column_articles": 31, "frontend_question_id": "LCP 25", "is_new_question": false @@ -3330,8 +3330,8 @@ "question__title": "追逐游戏", "question__title_slug": "Za25hA", "question__hide": false, - "total_acs": 1161, - "total_submitted": 3221, + "total_acs": 1164, + "total_submitted": 3230, "total_column_articles": 31, "frontend_question_id": "LCP 21", "is_new_question": false @@ -3351,8 +3351,8 @@ "question__title": "快速公交", "question__title_slug": "meChtZ", "question__hide": false, - "total_acs": 2098, - "total_submitted": 6287, + "total_acs": 2106, + "total_submitted": 6304, "total_column_articles": 34, "frontend_question_id": "LCP 20", "is_new_question": false @@ -3372,8 +3372,8 @@ "question__title": "导航装置", "question__title_slug": "hSRGyL", "question__hide": false, - "total_acs": 699, - "total_submitted": 1942, + "total_acs": 704, + "total_submitted": 1954, "total_column_articles": 23, "frontend_question_id": "LCP 26", "is_new_question": false @@ -3393,8 +3393,8 @@ "question__title": "数字游戏", "question__title_slug": "5TxKeK", "question__hide": false, - "total_acs": 1116, - "total_submitted": 3700, + "total_acs": 1118, + "total_submitted": 3703, "total_column_articles": 28, "frontend_question_id": "LCP 24", "is_new_question": false @@ -3414,8 +3414,8 @@ "question__title": "秋叶收藏集", "question__title_slug": "UlBDOe", "question__hide": false, - "total_acs": 20615, - "total_submitted": 39763, + "total_acs": 20651, + "total_submitted": 39831, "total_column_articles": 219, "frontend_question_id": "LCP 19", "is_new_question": false @@ -3435,8 +3435,8 @@ "question__title": "寻宝", "question__title_slug": "xun-bao", "question__hide": false, - "total_acs": 9710, - "total_submitted": 15932, + "total_acs": 9755, + "total_submitted": 15990, "total_column_articles": 88, "frontend_question_id": "LCP 13", "is_new_question": false @@ -3456,8 +3456,8 @@ "question__title": "最小矩形面积", "question__title_slug": "zui-xiao-ju-xing-mian-ji", "question__hide": false, - "total_acs": 1163, - "total_submitted": 5031, + "total_acs": 1172, + "total_submitted": 5067, "total_column_articles": 26, "frontend_question_id": "LCP 37", "is_new_question": false @@ -3477,9 +3477,9 @@ "question__title": "最小跳跃次数", "question__title_slug": "zui-xiao-tiao-yue-ci-shu", "question__hide": false, - "total_acs": 8137, - "total_submitted": 27367, - "total_column_articles": 118, + "total_acs": 8210, + "total_submitted": 27587, + "total_column_articles": 119, "frontend_question_id": "LCP 09", "is_new_question": false }, @@ -3498,8 +3498,8 @@ "question__title": "二叉树染色", "question__title_slug": "er-cha-shu-ran-se-UGC", "question__hide": false, - "total_acs": 3552, - "total_submitted": 6694, + "total_acs": 3603, + "total_submitted": 6764, "total_column_articles": 76, "frontend_question_id": "LCP 34", "is_new_question": false @@ -3519,9 +3519,9 @@ "question__title": "游乐园的迷宫", "question__title_slug": "you-le-yuan-de-mi-gong", "question__hide": false, - "total_acs": 1064, - "total_submitted": 1789, - "total_column_articles": 24, + "total_acs": 1083, + "total_submitted": 1834, + "total_column_articles": 25, "frontend_question_id": "LCP 15", "is_new_question": false }, @@ -3540,9 +3540,9 @@ "question__title": "小张刷题计划", "question__title_slug": "xiao-zhang-shua-ti-ji-hua", "question__hide": false, - "total_acs": 8084, - "total_submitted": 19072, - "total_column_articles": 127, + "total_acs": 8181, + "total_submitted": 19268, + "total_column_articles": 128, "frontend_question_id": "LCP 12", "is_new_question": false }, @@ -3561,8 +3561,8 @@ "question__title": "期望个数统计", "question__title_slug": "qi-wang-ge-shu-tong-ji", "question__hide": false, - "total_acs": 8111, - "total_submitted": 11525, + "total_acs": 8145, + "total_submitted": 11574, "total_column_articles": 83, "frontend_question_id": "LCP 11", "is_new_question": false @@ -3582,9 +3582,9 @@ "question__title": "游乐园的游览计划", "question__title_slug": "you-le-yuan-de-you-lan-ji-hua", "question__hide": false, - "total_acs": 780, - "total_submitted": 2379, - "total_column_articles": 17, + "total_acs": 785, + "total_submitted": 2388, + "total_column_articles": 18, "frontend_question_id": "LCP 16", "is_new_question": false }, @@ -3603,9 +3603,9 @@ "question__title": "传递信息", "question__title_slug": "chuan-di-xin-xi", "question__hide": false, - "total_acs": 44871, - "total_submitted": 58706, - "total_column_articles": 533, + "total_acs": 45081, + "total_submitted": 58991, + "total_column_articles": 536, "frontend_question_id": "LCP 07", "is_new_question": false }, @@ -3624,8 +3624,8 @@ "question__title": "二叉树任务调度", "question__title_slug": "er-cha-shu-ren-wu-diao-du", "question__hide": false, - "total_acs": 2173, - "total_submitted": 3659, + "total_acs": 2196, + "total_submitted": 3699, "total_column_articles": 41, "frontend_question_id": "LCP 10", "is_new_question": false @@ -3645,8 +3645,8 @@ "question__title": "切分数组", "question__title_slug": "qie-fen-shu-zu", "question__hide": false, - "total_acs": 3160, - "total_submitted": 14090, + "total_acs": 3196, + "total_submitted": 14178, "total_column_articles": 49, "frontend_question_id": "LCP 14", "is_new_question": false @@ -3666,8 +3666,8 @@ "question__title": "魔术排列", "question__title_slug": "er94lq", "question__hide": false, - "total_acs": 3035, - "total_submitted": 8740, + "total_acs": 3060, + "total_submitted": 8785, "total_column_articles": 57, "frontend_question_id": "LCP 23", "is_new_question": false @@ -3687,8 +3687,8 @@ "question__title": "剧情触发时间", "question__title_slug": "ju-qing-hong-fa-shi-jian", "question__hide": false, - "total_acs": 5956, - "total_submitted": 19395, + "total_acs": 5986, + "total_submitted": 19462, "total_column_articles": 114, "frontend_question_id": "LCP 08", "is_new_question": false @@ -3708,8 +3708,8 @@ "question__title": "拿硬币", "question__title_slug": "na-ying-bi", "question__hide": false, - "total_acs": 49190, - "total_submitted": 58562, + "total_acs": 49404, + "total_submitted": 58799, "total_column_articles": 738, "frontend_question_id": "LCP 06", "is_new_question": false @@ -3729,8 +3729,8 @@ "question__title": "Sparse Similarity LCCI", "question__title_slug": "sparse-similarity-lcci", "question__hide": false, - "total_acs": 4364, - "total_submitted": 12516, + "total_acs": 4401, + "total_submitted": 12597, "total_column_articles": 74, "frontend_question_id": "面试题 17.26", "is_new_question": false @@ -3750,8 +3750,8 @@ "question__title": "Langtons Ant LCCI", "question__title_slug": "langtons-ant-lcci", "question__hide": false, - "total_acs": 3385, - "total_submitted": 5811, + "total_acs": 3421, + "total_submitted": 5873, "total_column_articles": 69, "frontend_question_id": "面试题 16.22", "is_new_question": false @@ -3771,8 +3771,8 @@ "question__title": "Word Rectangle LCCI", "question__title_slug": "word-rectangle-lcci", "question__hide": false, - "total_acs": 2097, - "total_submitted": 4091, + "total_acs": 2109, + "total_submitted": 4125, "total_column_articles": 45, "frontend_question_id": "面试题 17.25", "is_new_question": false @@ -3792,9 +3792,9 @@ "question__title": "Sum Swap LCCI", "question__title_slug": "sum-swap-lcci", "question__hide": false, - "total_acs": 11824, - "total_submitted": 25163, - "total_column_articles": 214, + "total_acs": 11924, + "total_submitted": 25345, + "total_column_articles": 215, "frontend_question_id": "面试题 16.21", "is_new_question": false }, @@ -3813,8 +3813,8 @@ "question__title": "T9 LCCI", "question__title_slug": "t9-lcci", "question__hide": false, - "total_acs": 11018, - "total_submitted": 15337, + "total_acs": 11094, + "total_submitted": 15432, "total_column_articles": 209, "frontend_question_id": "面试题 16.20", "is_new_question": false @@ -3834,8 +3834,8 @@ "question__title": "Max Submatrix LCCI", "question__title_slug": "max-submatrix-lcci", "question__hide": false, - "total_acs": 15646, - "total_submitted": 29407, + "total_acs": 15979, + "total_submitted": 29961, "total_column_articles": 160, "frontend_question_id": "面试题 17.24", "is_new_question": false @@ -3855,9 +3855,9 @@ "question__title": "Max Black Square LCCI", "question__title_slug": "max-black-square-lcci", "question__hide": false, - "total_acs": 5819, - "total_submitted": 15522, - "total_column_articles": 126, + "total_acs": 5870, + "total_submitted": 15629, + "total_column_articles": 130, "frontend_question_id": "面试题 17.23", "is_new_question": false }, @@ -3876,9 +3876,9 @@ "question__title": "Missing Two LCCI", "question__title_slug": "missing-two-lcci", "question__hide": false, - "total_acs": 10509, - "total_submitted": 18153, - "total_column_articles": 213, + "total_acs": 10583, + "total_submitted": 18281, + "total_column_articles": 216, "frontend_question_id": "面试题 17.19", "is_new_question": false }, @@ -3897,9 +3897,9 @@ "question__title": "Shortest Supersequence LCCI", "question__title_slug": "shortest-supersequence-lcci", "question__hide": false, - "total_acs": 9345, - "total_submitted": 21026, - "total_column_articles": 145, + "total_acs": 9443, + "total_submitted": 21252, + "total_column_articles": 146, "frontend_question_id": "面试题 17.18", "is_new_question": false }, @@ -3918,8 +3918,8 @@ "question__title": "Pairs With Sum LCCI", "question__title_slug": "pairs-with-sum-lcci", "question__hide": false, - "total_acs": 13228, - "total_submitted": 27838, + "total_acs": 13331, + "total_submitted": 27991, "total_column_articles": 198, "frontend_question_id": "面试题 16.24", "is_new_question": false @@ -3939,8 +3939,8 @@ "question__title": "Rank from Stream LCCI", "question__title_slug": "rank-from-stream-lcci", "question__hide": false, - "total_acs": 6595, - "total_submitted": 10642, + "total_acs": 6670, + "total_submitted": 10767, "total_column_articles": 119, "frontend_question_id": "面试题 10.10", "is_new_question": false @@ -3960,8 +3960,8 @@ "question__title": "Group Anagrams LCCI", "question__title_slug": "group-anagrams-lcci", "question__hide": false, - "total_acs": 37541, - "total_submitted": 50736, + "total_acs": 37667, + "total_submitted": 50915, "total_column_articles": 448, "frontend_question_id": "面试题 10.02", "is_new_question": false @@ -3981,9 +3981,9 @@ "question__title": "Find Closest LCCI", "question__title_slug": "find-closest-lcci", "question__hide": false, - "total_acs": 16823, - "total_submitted": 24563, - "total_column_articles": 301, + "total_acs": 16928, + "total_submitted": 24700, + "total_column_articles": 307, "frontend_question_id": "面试题 17.11", "is_new_question": false }, @@ -4002,9 +4002,9 @@ "question__title": "Find Majority Element LCCI", "question__title_slug": "find-majority-element-lcci", "question__hide": false, - "total_acs": 71246, - "total_submitted": 125469, - "total_column_articles": 977, + "total_acs": 71422, + "total_submitted": 125888, + "total_column_articles": 978, "frontend_question_id": "面试题 17.10", "is_new_question": false }, @@ -4023,9 +4023,9 @@ "question__title": "Get Kth Magic Number LCCI", "question__title_slug": "get-kth-magic-number-lcci", "question__hide": false, - "total_acs": 16924, - "total_submitted": 30807, - "total_column_articles": 177, + "total_acs": 17043, + "total_submitted": 31008, + "total_column_articles": 178, "frontend_question_id": "面试题 17.09", "is_new_question": false }, @@ -4044,9 +4044,9 @@ "question__title": "Circus Tower LCCI", "question__title_slug": "circus-tower-lcci", "question__hide": false, - "total_acs": 9826, - "total_submitted": 35639, - "total_column_articles": 133, + "total_acs": 9902, + "total_submitted": 35906, + "total_column_articles": 135, "frontend_question_id": "面试题 17.08", "is_new_question": false }, @@ -4065,9 +4065,9 @@ "question__title": "Baby Names LCCI", "question__title_slug": "baby-names-lcci", "question__hide": false, - "total_acs": 10169, - "total_submitted": 24645, - "total_column_articles": 237, + "total_acs": 10240, + "total_submitted": 24839, + "total_column_articles": 239, "frontend_question_id": "面试题 17.07", "is_new_question": false }, @@ -4086,9 +4086,9 @@ "question__title": "Number Of 2s In Range LCCI", "question__title_slug": "number-of-2s-in-range-lcci", "question__hide": false, - "total_acs": 5816, - "total_submitted": 12690, - "total_column_articles": 127, + "total_acs": 5870, + "total_submitted": 12786, + "total_column_articles": 128, "frontend_question_id": "面试题 17.06", "is_new_question": false }, @@ -4107,8 +4107,8 @@ "question__title": "Find Longest Subarray LCCI", "question__title_slug": "find-longest-subarray-lcci", "question__hide": false, - "total_acs": 7090, - "total_submitted": 17959, + "total_acs": 7183, + "total_submitted": 18151, "total_column_articles": 112, "frontend_question_id": "面试题 17.05", "is_new_question": false @@ -4128,9 +4128,9 @@ "question__title": "Missing Number LCCI", "question__title_slug": "missing-number-lcci", "question__hide": false, - "total_acs": 35989, - "total_submitted": 57492, - "total_column_articles": 550, + "total_acs": 36313, + "total_submitted": 58034, + "total_column_articles": 558, "frontend_question_id": "面试题 17.04", "is_new_question": false }, @@ -4149,8 +4149,8 @@ "question__title": "Boolean Evaluation LCCI", "question__title_slug": "boolean-evaluation-lcci", "question__hide": false, - "total_acs": 5519, - "total_submitted": 10369, + "total_acs": 5586, + "total_submitted": 10496, "total_column_articles": 89, "frontend_question_id": "面试题 08.14", "is_new_question": false @@ -4170,9 +4170,9 @@ "question__title": "Word Transformer LCCI", "question__title_slug": "word-transformer-lcci", "question__hide": false, - "total_acs": 11007, - "total_submitted": 28438, - "total_column_articles": 175, + "total_acs": 11102, + "total_submitted": 28627, + "total_column_articles": 176, "frontend_question_id": "面试题 17.22", "is_new_question": false }, @@ -4191,9 +4191,9 @@ "question__title": "Volume of Histogram LCCI", "question__title_slug": "volume-of-histogram-lcci", "question__hide": false, - "total_acs": 46944, - "total_submitted": 73790, - "total_column_articles": 556, + "total_acs": 47038, + "total_submitted": 73933, + "total_column_articles": 561, "frontend_question_id": "面试题 17.21", "is_new_question": false }, @@ -4212,9 +4212,9 @@ "question__title": "Continuous Median LCCI", "question__title_slug": "continuous-median-lcci", "question__hide": false, - "total_acs": 5071, - "total_submitted": 8851, - "total_column_articles": 87, + "total_acs": 5115, + "total_submitted": 8922, + "total_column_articles": 89, "frontend_question_id": "面试题 17.20", "is_new_question": false }, @@ -4233,8 +4233,8 @@ "question__title": "Calculator LCCI", "question__title_slug": "calculator-lcci", "question__hide": false, - "total_acs": 18227, - "total_submitted": 46397, + "total_acs": 18421, + "total_submitted": 46808, "total_column_articles": 251, "frontend_question_id": "面试题 16.26", "is_new_question": false @@ -4254,9 +4254,9 @@ "question__title": "LRU Cache LCCI", "question__title_slug": "lru-cache-lcci", "question__hide": false, - "total_acs": 38975, - "total_submitted": 71220, - "total_column_articles": 315, + "total_acs": 39201, + "total_submitted": 71600, + "total_column_articles": 317, "frontend_question_id": "面试题 16.25", "is_new_question": false }, @@ -4275,8 +4275,8 @@ "question__title": "Add Without Plus LCCI", "question__title_slug": "add-without-plus-lcci", "question__hide": false, - "total_acs": 16383, - "total_submitted": 27093, + "total_acs": 16516, + "total_submitted": 27303, "total_column_articles": 199, "frontend_question_id": "面试题 17.01", "is_new_question": false @@ -4296,9 +4296,9 @@ "question__title": "Multi Search LCCI", "question__title_slug": "multi-search-lcci", "question__hide": false, - "total_acs": 10104, - "total_submitted": 22437, - "total_column_articles": 218, + "total_acs": 10172, + "total_submitted": 22609, + "total_column_articles": 219, "frontend_question_id": "面试题 17.17", "is_new_question": false }, @@ -4317,9 +4317,9 @@ "question__title": "The Masseuse LCCI", "question__title_slug": "the-masseuse-lcci", "question__hide": false, - "total_acs": 67362, - "total_submitted": 130913, - "total_column_articles": 1204, + "total_acs": 67648, + "total_submitted": 131556, + "total_column_articles": 1207, "frontend_question_id": "面试题 17.16", "is_new_question": false }, @@ -4338,9 +4338,9 @@ "question__title": "Longest Word LCCI", "question__title_slug": "longest-word-lcci", "question__hide": false, - "total_acs": 7895, - "total_submitted": 19410, - "total_column_articles": 146, + "total_acs": 7991, + "total_submitted": 19684, + "total_column_articles": 147, "frontend_question_id": "面试题 17.15", "is_new_question": false }, @@ -4359,9 +4359,9 @@ "question__title": "Smallest K LCCI", "question__title_slug": "smallest-k-lcci", "question__hide": false, - "total_acs": 88677, - "total_submitted": 149182, - "total_column_articles": 830, + "total_acs": 89027, + "total_submitted": 149715, + "total_column_articles": 832, "frontend_question_id": "面试题 17.14", "is_new_question": false }, @@ -4380,9 +4380,9 @@ "question__title": "Re-Space LCCI", "question__title_slug": "re-space-lcci", "question__hide": false, - "total_acs": 26223, - "total_submitted": 47407, - "total_column_articles": 288, + "total_acs": 26302, + "total_submitted": 47533, + "total_column_articles": 290, "frontend_question_id": "面试题 17.13", "is_new_question": false }, @@ -4401,9 +4401,9 @@ "question__title": "BiNode LCCI", "question__title_slug": "binode-lcci", "question__hide": false, - "total_acs": 25080, - "total_submitted": 39498, - "total_column_articles": 336, + "total_acs": 25304, + "total_submitted": 39825, + "total_column_articles": 337, "frontend_question_id": "面试题 17.12", "is_new_question": false }, @@ -4422,8 +4422,8 @@ "question__title": "English Int LCCI", "question__title_slug": "english-int-lcci", "question__hide": false, - "total_acs": 2953, - "total_submitted": 7746, + "total_acs": 2979, + "total_submitted": 7805, "total_column_articles": 70, "frontend_question_id": "面试题 16.08", "is_new_question": false @@ -4443,9 +4443,9 @@ "question__title": "Factorial Zeros LCCI", "question__title_slug": "factorial-zeros-lcci", "question__hide": false, - "total_acs": 13430, - "total_submitted": 29405, - "total_column_articles": 143, + "total_acs": 13537, + "total_submitted": 29685, + "total_column_articles": 144, "frontend_question_id": "面试题 16.05", "is_new_question": false }, @@ -4464,8 +4464,8 @@ "question__title": "Sorted Matrix Search LCCI", "question__title_slug": "sorted-matrix-search-lcci", "question__hide": false, - "total_acs": 15781, - "total_submitted": 34796, + "total_acs": 15898, + "total_submitted": 35047, "total_column_articles": 197, "frontend_question_id": "面试题 10.09", "is_new_question": false @@ -4485,9 +4485,9 @@ "question__title": "Hanota LCCI", "question__title_slug": "hanota-lcci", "question__hide": false, - "total_acs": 31261, - "total_submitted": 47914, - "total_column_articles": 324, + "total_acs": 31570, + "total_submitted": 48406, + "total_column_articles": 327, "frontend_question_id": "面试题 08.06", "is_new_question": false }, @@ -4506,9 +4506,9 @@ "question__title": "Peaks and Valleys LCCI", "question__title_slug": "peaks-and-valleys-lcci", "question__hide": false, - "total_acs": 10020, - "total_submitted": 15122, - "total_column_articles": 133, + "total_acs": 10123, + "total_submitted": 15288, + "total_column_articles": 134, "frontend_question_id": "面试题 10.11", "is_new_question": false }, @@ -4527,9 +4527,9 @@ "question__title": "Sorted Merge LCCI", "question__title_slug": "sorted-merge-lcci", "question__hide": false, - "total_acs": 65307, - "total_submitted": 116800, - "total_column_articles": 2444, + "total_acs": 65645, + "total_submitted": 117391, + "total_column_articles": 2447, "frontend_question_id": "面试题 10.01", "is_new_question": false }, @@ -4548,9 +4548,9 @@ "question__title": "Robot in a Grid LCCI", "question__title_slug": "robot-in-a-grid-lcci", "question__hide": false, - "total_acs": 16020, - "total_submitted": 44359, - "total_column_articles": 245, + "total_acs": 16186, + "total_submitted": 44767, + "total_column_articles": 248, "frontend_question_id": "面试题 08.02", "is_new_question": false }, @@ -4569,8 +4569,8 @@ "question__title": "BST Sequences LCCI", "question__title_slug": "bst-sequences-lcci", "question__hide": false, - "total_acs": 8542, - "total_submitted": 17752, + "total_acs": 8599, + "total_submitted": 17884, "total_column_articles": 133, "frontend_question_id": "面试题 04.09", "is_new_question": false @@ -4590,9 +4590,9 @@ "question__title": "Paths with Sum LCCI", "question__title_slug": "paths-with-sum-lcci", "question__hide": false, - "total_acs": 22286, - "total_submitted": 45827, - "total_column_articles": 303, + "total_acs": 22537, + "total_submitted": 46329, + "total_column_articles": 306, "frontend_question_id": "面试题 04.12", "is_new_question": false }, @@ -4611,9 +4611,9 @@ "question__title": "Partition List LCCI", "question__title_slug": "partition-list-lcci", "question__hide": false, - "total_acs": 32587, - "total_submitted": 50985, - "total_column_articles": 454, + "total_acs": 32986, + "total_submitted": 51750, + "total_column_articles": 457, "frontend_question_id": "面试题 02.04", "is_new_question": false }, @@ -4632,9 +4632,9 @@ "question__title": "Kth Node From End of List LCCI", "question__title_slug": "kth-node-from-end-of-list-lcci", "question__hide": false, - "total_acs": 76067, - "total_submitted": 97465, - "total_column_articles": 1076, + "total_acs": 76460, + "total_submitted": 97932, + "total_column_articles": 1081, "frontend_question_id": "面试题 02.02", "is_new_question": false }, @@ -4653,9 +4653,9 @@ "question__title": "One Away LCCI", "question__title_slug": "one-away-lcci", "question__hide": false, - "total_acs": 43189, - "total_submitted": 133006, - "total_column_articles": 703, + "total_acs": 43594, + "total_submitted": 134368, + "total_column_articles": 708, "frontend_question_id": "面试题 01.05", "is_new_question": false }, @@ -4674,9 +4674,9 @@ "question__title": "Pond Sizes LCCI", "question__title_slug": "pond-sizes-lcci", "question__hide": false, - "total_acs": 23213, - "total_submitted": 37413, - "total_column_articles": 421, + "total_acs": 23355, + "total_submitted": 37633, + "total_column_articles": 422, "frontend_question_id": "面试题 16.19", "is_new_question": false }, @@ -4695,9 +4695,9 @@ "question__title": "Pattern Matching LCCI", "question__title_slug": "pattern-matching-lcci", "question__hide": false, - "total_acs": 16161, - "total_submitted": 47223, - "total_column_articles": 325, + "total_acs": 16222, + "total_submitted": 47397, + "total_column_articles": 328, "frontend_question_id": "面试题 16.18", "is_new_question": false }, @@ -4716,8 +4716,8 @@ "question__title": "Contiguous Sequence LCCI", "question__title_slug": "contiguous-sequence-lcci", "question__hide": false, - "total_acs": 40095, - "total_submitted": 67384, + "total_acs": 40329, + "total_submitted": 67758, "total_column_articles": 436, "frontend_question_id": "面试题 16.17", "is_new_question": false @@ -4737,9 +4737,9 @@ "question__title": "Sub Sort LCCI", "question__title_slug": "sub-sort-lcci", "question__hide": false, - "total_acs": 18790, - "total_submitted": 40900, - "total_column_articles": 268, + "total_acs": 18939, + "total_submitted": 41242, + "total_column_articles": 270, "frontend_question_id": "面试题 16.16", "is_new_question": false }, @@ -4758,9 +4758,9 @@ "question__title": "Master Mind LCCI", "question__title_slug": "master-mind-lcci", "question__hide": false, - "total_acs": 11805, - "total_submitted": 24196, - "total_column_articles": 287, + "total_acs": 11931, + "total_submitted": 24495, + "total_column_articles": 289, "frontend_question_id": "面试题 16.15", "is_new_question": false }, @@ -4779,9 +4779,9 @@ "question__title": "Best Line LCCI", "question__title_slug": "best-line-lcci", "question__hide": false, - "total_acs": 4522, - "total_submitted": 8058, - "total_column_articles": 71, + "total_acs": 4572, + "total_submitted": 8146, + "total_column_articles": 72, "frontend_question_id": "面试题 16.14", "is_new_question": false }, @@ -4800,8 +4800,8 @@ "question__title": "Bisect Squares LCCI", "question__title_slug": "bisect-squares-lcci", "question__hide": false, - "total_acs": 2542, - "total_submitted": 5874, + "total_acs": 2570, + "total_submitted": 5933, "total_column_articles": 68, "frontend_question_id": "面试题 16.13", "is_new_question": false @@ -4821,9 +4821,9 @@ "question__title": "Diving Board LCCI", "question__title_slug": "diving-board-lcci", "question__hide": false, - "total_acs": 54280, - "total_submitted": 123211, - "total_column_articles": 621, + "total_acs": 54458, + "total_submitted": 123603, + "total_column_articles": 623, "frontend_question_id": "面试题 16.11", "is_new_question": false }, @@ -4842,8 +4842,8 @@ "question__title": "Living People LCCI", "question__title_slug": "living-people-lcci", "question__hide": false, - "total_acs": 12744, - "total_submitted": 18729, + "total_acs": 12864, + "total_submitted": 18883, "total_column_articles": 226, "frontend_question_id": "面试题 16.10", "is_new_question": false @@ -4863,8 +4863,8 @@ "question__title": "Operations LCCI", "question__title_slug": "operations-lcci", "question__hide": false, - "total_acs": 2788, - "total_submitted": 5036, + "total_acs": 2823, + "total_submitted": 5107, "total_column_articles": 46, "frontend_question_id": "面试题 16.09", "is_new_question": false @@ -4884,9 +4884,9 @@ "question__title": "Maximum LCCI", "question__title_slug": "maximum-lcci", "question__hide": false, - "total_acs": 24501, - "total_submitted": 33429, - "total_column_articles": 337, + "total_acs": 24652, + "total_submitted": 33650, + "total_column_articles": 338, "frontend_question_id": "面试题 16.07", "is_new_question": false }, @@ -4905,9 +4905,9 @@ "question__title": "Permutation II LCCI", "question__title_slug": "permutation-ii-lcci", "question__hide": false, - "total_acs": 20549, - "total_submitted": 28949, - "total_column_articles": 289, + "total_acs": 20743, + "total_submitted": 29219, + "total_column_articles": 296, "frontend_question_id": "面试题 08.08", "is_new_question": false }, @@ -4926,9 +4926,9 @@ "question__title": "二叉树的最近公共祖先 LCOF", "question__title_slug": "er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof", "question__hide": false, - "total_acs": 159034, - "total_submitted": 226132, - "total_column_articles": 884, + "total_acs": 160950, + "total_submitted": 228791, + "total_column_articles": 894, "frontend_question_id": "剑指 Offer 68 - II", "is_new_question": false }, @@ -4947,9 +4947,9 @@ "question__title": "二叉搜索树的最近公共祖先 LCOF", "question__title_slug": "er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof", "question__hide": false, - "total_acs": 163597, - "total_submitted": 235505, - "total_column_articles": 882, + "total_acs": 165450, + "total_submitted": 238237, + "total_column_articles": 892, "frontend_question_id": "剑指 Offer 68 - I", "is_new_question": false }, @@ -4968,9 +4968,9 @@ "question__title": "求1+2+…+n LCOF", "question__title_slug": "qiu-12n-lcof", "question__hide": false, - "total_acs": 181058, - "total_submitted": 210849, - "total_column_articles": 1521, + "total_acs": 182799, + "total_submitted": 212802, + "total_column_articles": 1530, "frontend_question_id": "剑指 Offer 64", "is_new_question": false }, @@ -4989,9 +4989,9 @@ "question__title": "股票的最大利润 LCOF", "question__title_slug": "gu-piao-de-zui-da-li-run-lcof", "question__hide": false, - "total_acs": 192502, - "total_submitted": 303147, - "total_column_articles": 1269, + "total_acs": 194579, + "total_submitted": 306428, + "total_column_articles": 1277, "frontend_question_id": "剑指 Offer 63", "is_new_question": false }, @@ -5010,9 +5010,9 @@ "question__title": "圆圈中最后剩下的数字 LCOF", "question__title_slug": "yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof", "question__hide": false, - "total_acs": 143701, - "total_submitted": 218464, - "total_column_articles": 898, + "total_acs": 145193, + "total_submitted": 220751, + "total_column_articles": 904, "frontend_question_id": "剑指 Offer 62", "is_new_question": false }, @@ -5031,9 +5031,9 @@ "question__title": "平衡二叉树 LCOF", "question__title_slug": "ping-heng-er-cha-shu-lcof", "question__hide": false, - "total_acs": 186618, - "total_submitted": 313984, - "total_column_articles": 1174, + "total_acs": 188685, + "total_submitted": 317365, + "total_column_articles": 1188, "frontend_question_id": "剑指 Offer 55 - II", "is_new_question": false }, @@ -5052,9 +5052,9 @@ "question__title": "扑克牌中的顺子 LCOF", "question__title_slug": "bu-ke-pai-zhong-de-shun-zi-lcof", "question__hide": false, - "total_acs": 151228, - "total_submitted": 328585, - "total_column_articles": 1301, + "total_acs": 153051, + "total_submitted": 332440, + "total_column_articles": 1311, "frontend_question_id": "剑指 Offer 61", "is_new_question": false }, @@ -5073,9 +5073,9 @@ "question__title": "把字符串转换成整数 LCOF", "question__title_slug": "ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof", "question__hide": false, - "total_acs": 95029, - "total_submitted": 327430, - "total_column_articles": 734, + "total_acs": 96234, + "total_submitted": 331314, + "total_column_articles": 742, "frontend_question_id": "剑指 Offer 67", "is_new_question": false }, @@ -5094,9 +5094,9 @@ "question__title": "n个骰子的点数 LCOF", "question__title_slug": "nge-tou-zi-de-dian-shu-lcof", "question__hide": false, - "total_acs": 89012, - "total_submitted": 155618, - "total_column_articles": 751, + "total_acs": 90126, + "total_submitted": 157421, + "total_column_articles": 756, "frontend_question_id": "剑指 Offer 60", "is_new_question": false }, @@ -5115,9 +5115,9 @@ "question__title": "构建乘积数组 LCOF", "question__title_slug": "gou-jian-cheng-ji-shu-zu-lcof", "question__hide": false, - "total_acs": 103890, - "total_submitted": 173213, - "total_column_articles": 725, + "total_acs": 105230, + "total_submitted": 175482, + "total_column_articles": 740, "frontend_question_id": "剑指 Offer 66", "is_new_question": false }, @@ -5136,9 +5136,9 @@ "question__title": "队列的最大值 LCOF", "question__title_slug": "dui-lie-de-zui-da-zhi-lcof", "question__hide": false, - "total_acs": 124379, - "total_submitted": 260750, - "total_column_articles": 1208, + "total_acs": 125557, + "total_submitted": 263108, + "total_column_articles": 1215, "frontend_question_id": "剑指 Offer 59 - II", "is_new_question": false }, @@ -5157,9 +5157,9 @@ "question__title": "滑动窗口的最大值 LCOF", "question__title_slug": "hua-dong-chuang-kou-de-zui-da-zhi-lcof", "question__hide": false, - "total_acs": 170099, - "total_submitted": 381081, - "total_column_articles": 1433, + "total_acs": 171697, + "total_submitted": 384478, + "total_column_articles": 1448, "frontend_question_id": "剑指 Offer 59 - I", "is_new_question": false }, @@ -5178,9 +5178,9 @@ "question__title": "不用加减乘除做加法 LCOF", "question__title_slug": "bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof", "question__hide": false, - "total_acs": 102600, - "total_submitted": 173265, - "total_column_articles": 654, + "total_acs": 103844, + "total_submitted": 175290, + "total_column_articles": 663, "frontend_question_id": "剑指 Offer 65", "is_new_question": false }, @@ -5199,9 +5199,9 @@ "question__title": "丑数 LCOF", "question__title_slug": "chou-shu-lcof", "question__hide": false, - "total_acs": 119159, - "total_submitted": 182462, - "total_column_articles": 664, + "total_acs": 120535, + "total_submitted": 184656, + "total_column_articles": 671, "frontend_question_id": "剑指 Offer 49", "is_new_question": false }, @@ -5220,9 +5220,9 @@ "question__title": "二叉搜索树的第k大节点 LCOF", "question__title_slug": "er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof", "question__hide": false, - "total_acs": 224557, - "total_submitted": 294610, - "total_column_articles": 1493, + "total_acs": 227134, + "total_submitted": 297884, + "total_column_articles": 1508, "frontend_question_id": "剑指 Offer 54", "is_new_question": false }, @@ -5241,9 +5241,9 @@ "question__title": "最长不含重复字符的子字符串 LCOF", "question__title_slug": "zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 216941, - "total_submitted": 467963, - "total_column_articles": 1407, + "total_acs": 219344, + "total_submitted": 473089, + "total_column_articles": 1420, "frontend_question_id": "剑指 Offer 48", "is_new_question": false }, @@ -5262,9 +5262,9 @@ "question__title": "缺失的数字 LCOF", "question__title_slug": "que-shi-de-shu-zi-lcof", "question__hide": false, - "total_acs": 248507, - "total_submitted": 556273, - "total_column_articles": 1983, + "total_acs": 251062, + "total_submitted": 561782, + "total_column_articles": 1998, "frontend_question_id": "剑指 Offer 53 - II", "is_new_question": false }, @@ -5283,9 +5283,9 @@ "question__title": "左旋转字符串 LCOF", "question__title_slug": "zuo-xuan-zhuan-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 311495, - "total_submitted": 362071, - "total_column_articles": 2394, + "total_acs": 315238, + "total_submitted": 366363, + "total_column_articles": 2415, "frontend_question_id": "剑指 Offer 58 - II", "is_new_question": false }, @@ -5304,9 +5304,9 @@ "question__title": "在排序数组中查找数字 LCOF", "question__title_slug": "zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof", "question__hide": false, - "total_acs": 275831, - "total_submitted": 519070, - "total_column_articles": 2085, + "total_acs": 278559, + "total_submitted": 524164, + "total_column_articles": 2100, "frontend_question_id": "剑指 Offer 53 - I", "is_new_question": false }, @@ -5325,9 +5325,9 @@ "question__title": "翻转单词顺序 LCOF", "question__title_slug": "fan-zhuan-dan-ci-shun-xu-lcof", "question__hide": false, - "total_acs": 184033, - "total_submitted": 413762, - "total_column_articles": 1278, + "total_acs": 185912, + "total_submitted": 417768, + "total_column_articles": 1288, "frontend_question_id": "剑指 Offer 58 - I", "is_new_question": false }, @@ -5346,9 +5346,9 @@ "question__title": "礼物的最大价值 LCOF", "question__title_slug": "li-wu-de-zui-da-jie-zhi-lcof", "question__hide": false, - "total_acs": 174914, - "total_submitted": 253304, - "total_column_articles": 1337, + "total_acs": 176761, + "total_submitted": 256008, + "total_column_articles": 1348, "frontend_question_id": "剑指 Offer 47", "is_new_question": false }, @@ -5367,9 +5367,9 @@ "question__title": "两个链表的第一个公共节点 LCOF", "question__title_slug": "liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof", "question__hide": false, - "total_acs": 233253, - "total_submitted": 356134, - "total_column_articles": 1278, + "total_acs": 235249, + "total_submitted": 359078, + "total_column_articles": 1287, "frontend_question_id": "剑指 Offer 52", "is_new_question": false }, @@ -5388,9 +5388,9 @@ "question__title": "把数字翻译成字符串 LCOF", "question__title_slug": "ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 175917, - "total_submitted": 336133, - "total_column_articles": 1859, + "total_acs": 178008, + "total_submitted": 340192, + "total_column_articles": 1871, "frontend_question_id": "剑指 Offer 46", "is_new_question": false }, @@ -5409,9 +5409,9 @@ "question__title": "和为s的连续正数序列 LCOF", "question__title_slug": "he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof", "question__hide": false, - "total_acs": 181409, - "total_submitted": 255335, - "total_column_articles": 2125, + "total_acs": 183193, + "total_submitted": 257816, + "total_column_articles": 2140, "frontend_question_id": "剑指 Offer 57 - II", "is_new_question": false }, @@ -5430,9 +5430,9 @@ "question__title": "把数组排成最小的数 LCOF", "question__title_slug": "ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof", "question__hide": false, - "total_acs": 159268, - "total_submitted": 286447, - "total_column_articles": 1119, + "total_acs": 161360, + "total_submitted": 290167, + "total_column_articles": 1131, "frontend_question_id": "剑指 Offer 45", "is_new_question": false }, @@ -5451,9 +5451,9 @@ "question__title": "和为s的两个数字 LCOF", "question__title_slug": "he-wei-sde-liang-ge-shu-zi-lcof", "question__hide": false, - "total_acs": 190713, - "total_submitted": 281789, - "total_column_articles": 1109, + "total_acs": 192802, + "total_submitted": 284757, + "total_column_articles": 1122, "frontend_question_id": "剑指 Offer 57", "is_new_question": false }, @@ -5472,9 +5472,9 @@ "question__title": "数组中数字出现的次数 II LCOF", "question__title_slug": "shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof", "question__hide": false, - "total_acs": 123463, - "total_submitted": 153401, - "total_column_articles": 856, + "total_acs": 124923, + "total_submitted": 155162, + "total_column_articles": 865, "frontend_question_id": "剑指 Offer 56 - II", "is_new_question": false }, @@ -5493,9 +5493,9 @@ "question__title": "数组中数字出现的次数 LCOF", "question__title_slug": "shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof", "question__hide": false, - "total_acs": 151657, - "total_submitted": 218916, - "total_column_articles": 1262, + "total_acs": 153248, + "total_submitted": 221170, + "total_column_articles": 1267, "frontend_question_id": "剑指 Offer 56 - I", "is_new_question": false }, @@ -5514,9 +5514,9 @@ "question__title": "二叉树的深度 LCOF", "question__title_slug": "er-cha-shu-de-shen-du-lcof", "question__hide": false, - "total_acs": 232776, - "total_submitted": 294059, - "total_column_articles": 1529, + "total_acs": 234970, + "total_submitted": 296823, + "total_column_articles": 1538, "frontend_question_id": "剑指 Offer 55 - I", "is_new_question": false }, @@ -5535,9 +5535,9 @@ "question__title": "数组中的逆序对 LCOF", "question__title_slug": "shu-zu-zhong-de-ni-xu-dui-lcof", "question__hide": false, - "total_acs": 139166, - "total_submitted": 283607, - "total_column_articles": 1105, + "total_acs": 141012, + "total_submitted": 287108, + "total_column_articles": 1114, "frontend_question_id": "剑指 Offer 51", "is_new_question": false }, @@ -5556,9 +5556,9 @@ "question__title": "二叉树中和为某一值的路径 LCOF", "question__title_slug": "er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof", "question__hide": false, - "total_acs": 188549, - "total_submitted": 322240, - "total_column_articles": 1153, + "total_acs": 190722, + "total_submitted": 325777, + "total_column_articles": 1162, "frontend_question_id": "剑指 Offer 34", "is_new_question": false }, @@ -5577,9 +5577,9 @@ "question__title": "第一个只出现一次的字符 LCOF", "question__title_slug": "di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof", "question__hide": false, - "total_acs": 228313, - "total_submitted": 367448, - "total_column_articles": 1435, + "total_acs": 230731, + "total_submitted": 371336, + "total_column_articles": 1452, "frontend_question_id": "剑指 Offer 50", "is_new_question": false }, @@ -5598,9 +5598,9 @@ "question__title": "二叉搜索树的后序遍历序列 LCOF", "question__title_slug": "er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof", "question__hide": false, - "total_acs": 157974, - "total_submitted": 282027, - "total_column_articles": 1267, + "total_acs": 160044, + "total_submitted": 285596, + "total_column_articles": 1282, "frontend_question_id": "剑指 Offer 33", "is_new_question": false }, @@ -5619,9 +5619,9 @@ "question__title": "从上到下打印二叉树 III LCOF", "question__title_slug": "cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof", "question__hide": false, - "total_acs": 180103, - "total_submitted": 306681, - "total_column_articles": 1604, + "total_acs": 182246, + "total_submitted": 310446, + "total_column_articles": 1624, "frontend_question_id": "剑指 Offer 32 - III", "is_new_question": false }, @@ -5640,9 +5640,9 @@ "question__title": "数字序列中某一位的数字 LCOF", "question__title_slug": "shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof", "question__hide": false, - "total_acs": 76097, - "total_submitted": 179021, - "total_column_articles": 614, + "total_acs": 77028, + "total_submitted": 181100, + "total_column_articles": 618, "frontend_question_id": "剑指 Offer 44", "is_new_question": false }, @@ -5661,9 +5661,9 @@ "question__title": "从上到下打印二叉树 II LCOF", "question__title_slug": "cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof", "question__hide": false, - "total_acs": 198706, - "total_submitted": 288836, - "total_column_articles": 1488, + "total_acs": 200859, + "total_submitted": 291930, + "total_column_articles": 1501, "frontend_question_id": "剑指 Offer 32 - II", "is_new_question": false }, @@ -5682,9 +5682,9 @@ "question__title": "从上到下打印二叉树 LCOF", "question__title_slug": "cong-shang-dao-xia-da-yin-er-cha-shu-lcof", "question__hide": false, - "total_acs": 198996, - "total_submitted": 311622, - "total_column_articles": 1331, + "total_acs": 201246, + "total_submitted": 315237, + "total_column_articles": 1345, "frontend_question_id": "剑指 Offer 32 - I", "is_new_question": false }, @@ -5703,9 +5703,9 @@ "question__title": "数组中出现次数超过一半的数字 LCOF", "question__title_slug": "shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof", "question__hide": false, - "total_acs": 224231, - "total_submitted": 320945, - "total_column_articles": 1250, + "total_acs": 226813, + "total_submitted": 324542, + "total_column_articles": 1264, "frontend_question_id": "剑指 Offer 39", "is_new_question": false }, @@ -5724,9 +5724,9 @@ "question__title": "1~n整数中1出现的次数 LCOF", "question__title_slug": "1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof", "question__hide": false, - "total_acs": 65331, - "total_submitted": 131109, - "total_column_articles": 637, + "total_acs": 66030, + "total_submitted": 132389, + "total_column_articles": 640, "frontend_question_id": "剑指 Offer 43", "is_new_question": false }, @@ -5745,9 +5745,9 @@ "question__title": "字符串的排列 LCOF", "question__title_slug": "zi-fu-chuan-de-pai-lie-lcof", "question__hide": false, - "total_acs": 203973, - "total_submitted": 351672, - "total_column_articles": 1335, + "total_acs": 206152, + "total_submitted": 355513, + "total_column_articles": 1343, "frontend_question_id": "剑指 Offer 38", "is_new_question": false }, @@ -5766,9 +5766,9 @@ "question__title": "序列化二叉树 LCOF", "question__title_slug": "xu-lie-hua-er-cha-shu-lcof", "question__hide": false, - "total_acs": 101566, - "total_submitted": 178696, - "total_column_articles": 690, + "total_acs": 102648, + "total_submitted": 180386, + "total_column_articles": 694, "frontend_question_id": "剑指 Offer 37", "is_new_question": false }, @@ -5787,9 +5787,9 @@ "question__title": "栈的压入、弹出序列 LCOF", "question__title_slug": "zhan-de-ya-ru-dan-chu-xu-lie-lcof", "question__hide": false, - "total_acs": 155388, - "total_submitted": 250965, - "total_column_articles": 1229, + "total_acs": 157237, + "total_submitted": 253828, + "total_column_articles": 1246, "frontend_question_id": "剑指 Offer 31", "is_new_question": false }, @@ -5808,9 +5808,9 @@ "question__title": "二叉搜索树与双向链表 LCOF", "question__title_slug": "er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof", "question__hide": false, - "total_acs": 150661, - "total_submitted": 230904, - "total_column_articles": 1251, + "total_acs": 152707, + "total_submitted": 234009, + "total_column_articles": 1268, "frontend_question_id": "剑指 Offer 36", "is_new_question": false }, @@ -5829,9 +5829,9 @@ "question__title": "连续子数组的最大和 LCOF", "question__title_slug": "lian-xu-zi-shu-zu-de-zui-da-he-lcof", "question__hide": false, - "total_acs": 297425, - "total_submitted": 489975, - "total_column_articles": 1860, + "total_acs": 300329, + "total_submitted": 494757, + "total_column_articles": 1874, "frontend_question_id": "剑指 Offer 42", "is_new_question": false }, @@ -5850,9 +5850,9 @@ "question__title": "数据流中的中位数 LCOF", "question__title_slug": "shu-ju-liu-zhong-de-zhong-wei-shu-lcof", "question__hide": false, - "total_acs": 93910, - "total_submitted": 160768, - "total_column_articles": 663, + "total_acs": 95200, + "total_submitted": 162981, + "total_column_articles": 674, "frontend_question_id": "剑指 Offer 41", "is_new_question": false }, @@ -5871,9 +5871,9 @@ "question__title": "包含min函数的栈 LCOF", "question__title_slug": "bao-han-minhan-shu-de-zhan-lcof", "question__hide": false, - "total_acs": 237196, - "total_submitted": 429641, - "total_column_articles": 1517, + "total_acs": 239771, + "total_submitted": 434211, + "total_column_articles": 1533, "frontend_question_id": "剑指 Offer 30", "is_new_question": false }, @@ -5892,9 +5892,9 @@ "question__title": "最小的k个数 LCOF", "question__title_slug": "zui-xiao-de-kge-shu-lcof", "question__hide": false, - "total_acs": 330963, - "total_submitted": 577518, - "total_column_articles": 2163, + "total_acs": 334364, + "total_submitted": 583313, + "total_column_articles": 2178, "frontend_question_id": "剑指 Offer 40", "is_new_question": false }, @@ -5913,9 +5913,9 @@ "question__title": "复杂链表的复制 LCOF", "question__title_slug": "fu-za-lian-biao-de-fu-zhi-lcof", "question__hide": false, - "total_acs": 193914, - "total_submitted": 270920, - "total_column_articles": 1291, + "total_acs": 196123, + "total_submitted": 274003, + "total_column_articles": 1303, "frontend_question_id": "剑指 Offer 35", "is_new_question": false }, @@ -5934,9 +5934,9 @@ "question__title": "删除链表的节点 LCOF", "question__title_slug": "shan-chu-lian-biao-de-jie-dian-lcof", "question__hide": false, - "total_acs": 257649, - "total_submitted": 428829, - "total_column_articles": 1818, + "total_acs": 260199, + "total_submitted": 433092, + "total_column_articles": 1831, "frontend_question_id": "剑指 Offer 18", "is_new_question": false }, @@ -5955,9 +5955,9 @@ "question__title": "反转链表 LCOF", "question__title_slug": "fan-zhuan-lian-biao-lcof", "question__hide": false, - "total_acs": 410497, - "total_submitted": 552400, - "total_column_articles": 2339, + "total_acs": 414142, + "total_submitted": 557288, + "total_column_articles": 2352, "frontend_question_id": "剑指 Offer 24", "is_new_question": false }, @@ -5976,9 +5976,9 @@ "question__title": "正则表达式匹配 LCOF", "question__title_slug": "zheng-ze-biao-da-shi-pi-pei-lcof", "question__hide": false, - "total_acs": 86817, - "total_submitted": 224793, - "total_column_articles": 549, + "total_acs": 87828, + "total_submitted": 227364, + "total_column_articles": 554, "frontend_question_id": "剑指 Offer 19", "is_new_question": false }, @@ -5997,9 +5997,9 @@ "question__title": "打印从1到最大的n位数 LCOF", "question__title_slug": "da-yin-cong-1dao-zui-da-de-nwei-shu-lcof", "question__hide": false, - "total_acs": 193441, - "total_submitted": 248408, - "total_column_articles": 1308, + "total_acs": 195343, + "total_submitted": 250879, + "total_column_articles": 1313, "frontend_question_id": "剑指 Offer 17", "is_new_question": false }, @@ -6018,9 +6018,9 @@ "question__title": "数值的整数次方 LCOF", "question__title_slug": "shu-zhi-de-zheng-shu-ci-fang-lcof", "question__hide": false, - "total_acs": 168634, - "total_submitted": 489411, - "total_column_articles": 986, + "total_acs": 170761, + "total_submitted": 495166, + "total_column_articles": 999, "frontend_question_id": "剑指 Offer 16", "is_new_question": false }, @@ -6039,9 +6039,9 @@ "question__title": "链表中倒数第k个节点 LCOF", "question__title_slug": "lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof", "question__hide": false, - "total_acs": 343219, - "total_submitted": 427967, - "total_column_articles": 2939, + "total_acs": 346327, + "total_submitted": 431914, + "total_column_articles": 2957, "frontend_question_id": "剑指 Offer 22", "is_new_question": false }, @@ -6060,9 +6060,9 @@ "question__title": "顺时针打印矩阵 LCOF", "question__title_slug": "shun-shi-zhen-da-yin-ju-zhen-lcof", "question__hide": false, - "total_acs": 190156, - "total_submitted": 434481, - "total_column_articles": 1765, + "total_acs": 192137, + "total_submitted": 439109, + "total_column_articles": 1779, "frontend_question_id": "剑指 Offer 29", "is_new_question": false }, @@ -6081,9 +6081,9 @@ "question__title": "二进制中1的个数 LCOF", "question__title_slug": "er-jin-zhi-zhong-1de-ge-shu-lcof", "question__hide": false, - "total_acs": 253446, - "total_submitted": 337750, - "total_column_articles": 1479, + "total_acs": 255857, + "total_submitted": 340770, + "total_column_articles": 1488, "frontend_question_id": "剑指 Offer 15", "is_new_question": false }, @@ -6102,9 +6102,9 @@ "question__title": "调整数组顺序使奇数位于偶数前面 LCOF", "question__title_slug": "diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof", "question__hide": false, - "total_acs": 269566, - "total_submitted": 416667, - "total_column_articles": 2077, + "total_acs": 272441, + "total_submitted": 421084, + "total_column_articles": 2091, "frontend_question_id": "剑指 Offer 21", "is_new_question": false }, @@ -6123,9 +6123,9 @@ "question__title": "表示数值的字符串 LCOF", "question__title_slug": "biao-shi-shu-zhi-de-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 102413, - "total_submitted": 408682, - "total_column_articles": 1125, + "total_acs": 103507, + "total_submitted": 412692, + "total_column_articles": 1138, "frontend_question_id": "剑指 Offer 20", "is_new_question": false }, @@ -6144,9 +6144,9 @@ "question__title": "对称的二叉树 LCOF", "question__title_slug": "dui-cheng-de-er-cha-shu-lcof", "question__hide": false, - "total_acs": 212675, - "total_submitted": 368818, - "total_column_articles": 1478, + "total_acs": 214874, + "total_submitted": 372830, + "total_column_articles": 1484, "frontend_question_id": "剑指 Offer 28", "is_new_question": false }, @@ -6165,9 +6165,9 @@ "question__title": "二叉树的镜像 LCOF", "question__title_slug": "er-cha-shu-de-jing-xiang-lcof", "question__hide": false, - "total_acs": 265206, - "total_submitted": 333931, - "total_column_articles": 1807, + "total_acs": 267781, + "total_submitted": 337220, + "total_column_articles": 1818, "frontend_question_id": "剑指 Offer 27", "is_new_question": false }, @@ -6186,9 +6186,9 @@ "question__title": "树的子结构 LCOF", "question__title_slug": "shu-de-zi-jie-gou-lcof", "question__hide": false, - "total_acs": 214828, - "total_submitted": 459662, - "total_column_articles": 1617, + "total_acs": 217264, + "total_submitted": 464880, + "total_column_articles": 1629, "frontend_question_id": "剑指 Offer 26", "is_new_question": false }, @@ -6207,9 +6207,9 @@ "question__title": "合并两个排序的链表 LCOF", "question__title_slug": "he-bing-liang-ge-pai-xu-de-lian-biao-lcof", "question__hide": false, - "total_acs": 256593, - "total_submitted": 353075, - "total_column_articles": 1513, + "total_acs": 259201, + "total_submitted": 356731, + "total_column_articles": 1528, "frontend_question_id": "剑指 Offer 25", "is_new_question": false }, @@ -6228,9 +6228,9 @@ "question__title": "剪绳子 II LCOF", "question__title_slug": "jian-sheng-zi-ii-lcof", "question__hide": false, - "total_acs": 109700, - "total_submitted": 346377, - "total_column_articles": 604, + "total_acs": 111011, + "total_submitted": 350301, + "total_column_articles": 611, "frontend_question_id": "剑指 Offer 14- II", "is_new_question": false }, @@ -6249,9 +6249,9 @@ "question__title": "剪绳子 LCOF", "question__title_slug": "jian-sheng-zi-lcof", "question__hide": false, - "total_acs": 208854, - "total_submitted": 364831, - "total_column_articles": 1643, + "total_acs": 211243, + "total_submitted": 368778, + "total_column_articles": 1658, "frontend_question_id": "剑指 Offer 14- I", "is_new_question": false }, @@ -6270,9 +6270,9 @@ "question__title": "重建二叉树 LCOF", "question__title_slug": "zhong-jian-er-cha-shu-lcof", "question__hide": false, - "total_acs": 247919, - "total_submitted": 353011, - "total_column_articles": 1744, + "total_acs": 250526, + "total_submitted": 356625, + "total_column_articles": 1766, "frontend_question_id": "剑指 Offer 07", "is_new_question": false }, @@ -6291,9 +6291,9 @@ "question__title": "从尾到头打印链表 LCOF", "question__title_slug": "cong-wei-dao-tou-da-yin-lian-biao-lcof", "question__hide": false, - "total_acs": 437023, - "total_submitted": 582785, - "total_column_articles": 2775, + "total_acs": 441560, + "total_submitted": 588955, + "total_column_articles": 2804, "frontend_question_id": "剑指 Offer 06", "is_new_question": false }, @@ -6312,9 +6312,9 @@ "question__title": "机器人的运动范围 LCOF", "question__title_slug": "ji-qi-ren-de-yun-dong-fan-wei-lcof", "question__hide": false, - "total_acs": 243337, - "total_submitted": 456722, - "total_column_articles": 2127, + "total_acs": 246082, + "total_submitted": 461731, + "total_column_articles": 2144, "frontend_question_id": "剑指 Offer 13", "is_new_question": false }, @@ -6333,9 +6333,9 @@ "question__title": "替换空格 LCOF", "question__title_slug": "ti-huan-kong-ge-lcof", "question__hide": false, - "total_acs": 431495, - "total_submitted": 568472, - "total_column_articles": 2612, + "total_acs": 436955, + "total_submitted": 575876, + "total_column_articles": 2637, "frontend_question_id": "剑指 Offer 05", "is_new_question": false }, @@ -6354,9 +6354,9 @@ "question__title": "矩阵中的路径 LCOF", "question__title_slug": "ju-zhen-zhong-de-lu-jing-lcof", "question__hide": false, - "total_acs": 238411, - "total_submitted": 526484, - "total_column_articles": 1473, + "total_acs": 241113, + "total_submitted": 532603, + "total_column_articles": 1488, "frontend_question_id": "剑指 Offer 12", "is_new_question": false }, @@ -6375,9 +6375,9 @@ "question__title": "旋转数组的最小数字 LCOF", "question__title_slug": "xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof", "question__hide": false, - "total_acs": 360558, - "total_submitted": 733108, - "total_column_articles": 2095, + "total_acs": 364014, + "total_submitted": 740125, + "total_column_articles": 2109, "frontend_question_id": "剑指 Offer 11", "is_new_question": false }, @@ -6396,9 +6396,9 @@ "question__title": "青蛙跳台阶问题 LCOF", "question__title_slug": "qing-wa-tiao-tai-jie-wen-ti-lcof", "question__hide": false, - "total_acs": 272216, - "total_submitted": 599349, - "total_column_articles": 1670, + "total_acs": 275088, + "total_submitted": 605742, + "total_column_articles": 1684, "frontend_question_id": "剑指 Offer 10- II", "is_new_question": false }, @@ -6417,9 +6417,9 @@ "question__title": "二维数组中的查找 LCOF", "question__title_slug": "er-wei-shu-zu-zhong-de-cha-zhao-lcof", "question__hide": false, - "total_acs": 363890, - "total_submitted": 906873, - "total_column_articles": 2716, + "total_acs": 367912, + "total_submitted": 917188, + "total_column_articles": 2745, "frontend_question_id": "剑指 Offer 04", "is_new_question": false }, @@ -6438,9 +6438,9 @@ "question__title": "数组中重复的数字 LCOF", "question__title_slug": "shu-zu-zhong-zhong-fu-de-shu-zi-lcof", "question__hide": false, - "total_acs": 544260, - "total_submitted": 801169, - "total_column_articles": 3473, + "total_acs": 549849, + "total_submitted": 809552, + "total_column_articles": 3501, "frontend_question_id": "剑指 Offer 03", "is_new_question": false }, @@ -6459,9 +6459,9 @@ "question__title": "斐波那契数列 LCOF", "question__title_slug": "fei-bo-na-qi-shu-lie-lcof", "question__hide": false, - "total_acs": 359901, - "total_submitted": 994927, - "total_column_articles": 2289, + "total_acs": 363314, + "total_submitted": 1004851, + "total_column_articles": 2306, "frontend_question_id": "剑指 Offer 10- I", "is_new_question": false }, @@ -6480,9 +6480,9 @@ "question__title": "用两个栈实现队列 LCOF", "question__title_slug": "yong-liang-ge-zhan-shi-xian-dui-lie-lcof", "question__hide": false, - "total_acs": 400524, - "total_submitted": 564560, - "total_column_articles": 2305, + "total_acs": 404499, + "total_submitted": 570277, + "total_column_articles": 2327, "frontend_question_id": "剑指 Offer 09", "is_new_question": false }, @@ -6501,8 +6501,8 @@ "question__title": "Smallest Difference LCCI", "question__title_slug": "smallest-difference-lcci", "question__hide": false, - "total_acs": 16371, - "total_submitted": 38209, + "total_acs": 16511, + "total_submitted": 38537, "total_column_articles": 239, "frontend_question_id": "面试题 16.06", "is_new_question": false @@ -6522,9 +6522,9 @@ "question__title": "Tic-Tac-Toe LCCI", "question__title_slug": "tic-tac-toe-lcci", "question__hide": false, - "total_acs": 9022, - "total_submitted": 19456, - "total_column_articles": 181, + "total_acs": 9125, + "total_submitted": 19673, + "total_column_articles": 182, "frontend_question_id": "面试题 16.04", "is_new_question": false }, @@ -6543,8 +6543,8 @@ "question__title": "Intersection LCCI", "question__title_slug": "intersection-lcci", "question__hide": false, - "total_acs": 10171, - "total_submitted": 23105, + "total_acs": 10212, + "total_submitted": 23224, "total_column_articles": 246, "frontend_question_id": "面试题 16.03", "is_new_question": false @@ -6564,9 +6564,9 @@ "question__title": "Words Frequency LCCI", "question__title_slug": "words-frequency-lcci", "question__hide": false, - "total_acs": 18504, - "total_submitted": 24108, - "total_column_articles": 236, + "total_acs": 18648, + "total_submitted": 24292, + "total_column_articles": 237, "frontend_question_id": "面试题 16.02", "is_new_question": false }, @@ -6585,9 +6585,9 @@ "question__title": "Swap Numbers LCCI", "question__title_slug": "swap-numbers-lcci", "question__hide": false, - "total_acs": 29959, - "total_submitted": 36299, - "total_column_articles": 468, + "total_acs": 30203, + "total_submitted": 36606, + "total_column_articles": 469, "frontend_question_id": "面试题 16.01", "is_new_question": false }, @@ -6606,9 +6606,9 @@ "question__title": "Sparse Array Search LCCI", "question__title_slug": "sparse-array-search-lcci", "question__hide": false, - "total_acs": 23856, - "total_submitted": 42476, - "total_column_articles": 294, + "total_acs": 24043, + "total_submitted": 42799, + "total_column_articles": 296, "frontend_question_id": "面试题 10.05", "is_new_question": false }, @@ -6627,9 +6627,9 @@ "question__title": "Permutation I LCCI", "question__title_slug": "permutation-i-lcci", "question__hide": false, - "total_acs": 25821, - "total_submitted": 31737, - "total_column_articles": 376, + "total_acs": 25988, + "total_submitted": 31935, + "total_column_articles": 378, "frontend_question_id": "面试题 08.07", "is_new_question": false }, @@ -6648,9 +6648,9 @@ "question__title": "Magic Index LCCI", "question__title_slug": "magic-index-lcci", "question__hide": false, - "total_acs": 56211, - "total_submitted": 83261, - "total_column_articles": 456, + "total_acs": 56377, + "total_submitted": 83527, + "total_column_articles": 457, "frontend_question_id": "面试题 08.03", "is_new_question": false }, @@ -6669,9 +6669,9 @@ "question__title": "Eight Queens LCCI", "question__title_slug": "eight-queens-lcci", "question__hide": false, - "total_acs": 22033, - "total_submitted": 28716, - "total_column_articles": 347, + "total_acs": 22280, + "total_submitted": 29041, + "total_column_articles": 350, "frontend_question_id": "面试题 08.12", "is_new_question": false }, @@ -6690,9 +6690,9 @@ "question__title": "Search Rotate Array LCCI", "question__title_slug": "search-rotate-array-lcci", "question__hide": false, - "total_acs": 18104, - "total_submitted": 46308, - "total_column_articles": 250, + "total_acs": 18359, + "total_submitted": 46926, + "total_column_articles": 253, "frontend_question_id": "面试题 10.03", "is_new_question": false }, @@ -6711,8 +6711,8 @@ "question__title": "Coin LCCI", "question__title_slug": "coin-lcci", "question__hide": false, - "total_acs": 37592, - "total_submitted": 75965, + "total_acs": 37753, + "total_submitted": 76277, "total_column_articles": 348, "frontend_question_id": "面试题 08.11", "is_new_question": false @@ -6732,9 +6732,9 @@ "question__title": "Reverse Bits LCCI", "question__title_slug": "reverse-bits-lcci", "question__hide": false, - "total_acs": 15020, - "total_submitted": 39375, - "total_column_articles": 285, + "total_acs": 15212, + "total_submitted": 39882, + "total_column_articles": 286, "frontend_question_id": "面试题 05.03", "is_new_question": false }, @@ -6753,9 +6753,9 @@ "question__title": "Check SubTree LCCI", "question__title_slug": "check-subtree-lcci", "question__hide": false, - "total_acs": 20624, - "total_submitted": 28872, - "total_column_articles": 312, + "total_acs": 20833, + "total_submitted": 29177, + "total_column_articles": 314, "frontend_question_id": "面试题 04.10", "is_new_question": false }, @@ -6774,9 +6774,9 @@ "question__title": "Animal Shelter LCCI", "question__title_slug": "animal-shelter-lcci", "question__hide": false, - "total_acs": 14164, - "total_submitted": 24198, - "total_column_articles": 219, + "total_acs": 14277, + "total_submitted": 24420, + "total_column_articles": 223, "frontend_question_id": "面试题 03.06", "is_new_question": false }, @@ -6795,9 +6795,9 @@ "question__title": "Binary Number to String LCCI", "question__title_slug": "bianry-number-to-string-lcci", "question__hide": false, - "total_acs": 9926, - "total_submitted": 14052, - "total_column_articles": 158, + "total_acs": 10027, + "total_submitted": 14178, + "total_column_articles": 159, "frontend_question_id": "面试题 05.02", "is_new_question": false }, @@ -6816,8 +6816,8 @@ "question__title": "Pile Box LCCI", "question__title_slug": "pile-box-lcci", "question__hide": false, - "total_acs": 8871, - "total_submitted": 17470, + "total_acs": 8935, + "total_submitted": 17613, "total_column_articles": 109, "frontend_question_id": "面试题 08.13", "is_new_question": false @@ -6837,9 +6837,9 @@ "question__title": "Color Fill LCCI", "question__title_slug": "color-fill-lcci", "question__hide": false, - "total_acs": 17334, - "total_submitted": 31103, - "total_column_articles": 270, + "total_acs": 17532, + "total_submitted": 31424, + "total_column_articles": 272, "frontend_question_id": "面试题 08.10", "is_new_question": false }, @@ -6858,9 +6858,9 @@ "question__title": "Bracket LCCI", "question__title_slug": "bracket-lcci", "question__hide": false, - "total_acs": 26352, - "total_submitted": 32351, - "total_column_articles": 422, + "total_acs": 26570, + "total_submitted": 32625, + "total_column_articles": 427, "frontend_question_id": "面试题 08.09", "is_new_question": false }, @@ -6879,9 +6879,9 @@ "question__title": "Recursive Mulitply LCCI", "question__title_slug": "recursive-mulitply-lcci", "question__hide": false, - "total_acs": 30204, - "total_submitted": 44969, - "total_column_articles": 606, + "total_acs": 30541, + "total_submitted": 45449, + "total_column_articles": 611, "frontend_question_id": "面试题 08.05", "is_new_question": false }, @@ -6900,9 +6900,9 @@ "question__title": "Power Set LCCI", "question__title_slug": "power-set-lcci", "question__hide": false, - "total_acs": 25126, - "total_submitted": 30604, - "total_column_articles": 390, + "total_acs": 25266, + "total_submitted": 30772, + "total_column_articles": 392, "frontend_question_id": "面试题 08.04", "is_new_question": false }, @@ -6921,9 +6921,9 @@ "question__title": "Three Steps Problem LCCI", "question__title_slug": "three-steps-problem-lcci", "question__hide": false, - "total_acs": 50804, - "total_submitted": 139212, - "total_column_articles": 554, + "total_acs": 51089, + "total_submitted": 139912, + "total_column_articles": 559, "frontend_question_id": "面试题 08.01", "is_new_question": false }, @@ -6942,9 +6942,9 @@ "question__title": "Draw Line LCCI", "question__title_slug": "draw-line-lcci", "question__hide": false, - "total_acs": 4770, - "total_submitted": 8673, - "total_column_articles": 93, + "total_acs": 4810, + "total_submitted": 8775, + "total_column_articles": 96, "frontend_question_id": "面试题 05.08", "is_new_question": false }, @@ -6963,8 +6963,8 @@ "question__title": "Stack of Plates LCCI", "question__title_slug": "stack-of-plates-lcci", "question__hide": false, - "total_acs": 11521, - "total_submitted": 29719, + "total_acs": 11619, + "total_submitted": 29986, "total_column_articles": 179, "frontend_question_id": "面试题 03.03", "is_new_question": false @@ -6984,9 +6984,9 @@ "question__title": "Sum Lists LCCI", "question__title_slug": "sum-lists-lcci", "question__hide": false, - "total_acs": 47764, - "total_submitted": 102302, - "total_column_articles": 632, + "total_acs": 48219, + "total_submitted": 103240, + "total_column_articles": 637, "frontend_question_id": "面试题 02.05", "is_new_question": false }, @@ -7005,9 +7005,9 @@ "question__title": "Delete Middle Node LCCI", "question__title_slug": "delete-middle-node-lcci", "question__hide": false, - "total_acs": 80726, - "total_submitted": 94132, - "total_column_articles": 761, + "total_acs": 81085, + "total_submitted": 94541, + "total_column_articles": 766, "frontend_question_id": "面试题 02.03", "is_new_question": false }, @@ -7026,9 +7026,9 @@ "question__title": "Zero Matrix LCCI", "question__title_slug": "zero-matrix-lcci", "question__hide": false, - "total_acs": 59444, - "total_submitted": 95675, - "total_column_articles": 590, + "total_acs": 60147, + "total_submitted": 96796, + "total_column_articles": 594, "frontend_question_id": "面试题 01.08", "is_new_question": false }, @@ -7047,9 +7047,9 @@ "question__title": "Rotate Matrix LCCI", "question__title_slug": "rotate-matrix-lcci", "question__hide": false, - "total_acs": 82394, - "total_submitted": 110866, - "total_column_articles": 1081, + "total_acs": 83105, + "total_submitted": 111902, + "total_column_articles": 1085, "frontend_question_id": "面试题 01.07", "is_new_question": false }, @@ -7068,9 +7068,9 @@ "question__title": "Palindrome Permutation LCCI", "question__title_slug": "palindrome-permutation-lcci", "question__hide": false, - "total_acs": 52300, - "total_submitted": 96206, - "total_column_articles": 938, + "total_acs": 52766, + "total_submitted": 97146, + "total_column_articles": 947, "frontend_question_id": "面试题 01.04", "is_new_question": false }, @@ -7089,9 +7089,9 @@ "question__title": "Closed Number LCCI", "question__title_slug": "closed-number-lcci", "question__hide": false, - "total_acs": 6758, - "total_submitted": 18479, - "total_column_articles": 162, + "total_acs": 6816, + "total_submitted": 18669, + "total_column_articles": 164, "frontend_question_id": "面试题 05.04", "is_new_question": false }, @@ -7110,9 +7110,9 @@ "question__title": "Exchange LCCI", "question__title_slug": "exchange-lcci", "question__hide": false, - "total_acs": 14338, - "total_submitted": 20232, - "total_column_articles": 256, + "total_acs": 14463, + "total_submitted": 20391, + "total_column_articles": 257, "frontend_question_id": "面试题 05.07", "is_new_question": false }, @@ -7131,9 +7131,9 @@ "question__title": "Convert Integer LCCI", "question__title_slug": "convert-integer-lcci", "question__hide": false, - "total_acs": 15221, - "total_submitted": 29206, - "total_column_articles": 274, + "total_acs": 15337, + "total_submitted": 29411, + "total_column_articles": 277, "frontend_question_id": "面试题 05.06", "is_new_question": false }, @@ -7152,9 +7152,9 @@ "question__title": "Insert Into Bits LCCI", "question__title_slug": "insert-into-bits-lcci", "question__hide": false, - "total_acs": 12475, - "total_submitted": 24543, - "total_column_articles": 237, + "total_acs": 12640, + "total_submitted": 24844, + "total_column_articles": 242, "frontend_question_id": "面试题 05.01", "is_new_question": false }, @@ -7173,9 +7173,9 @@ "question__title": "First Common Ancestor LCCI", "question__title_slug": "first-common-ancestor-lcci", "question__hide": false, - "total_acs": 21420, - "total_submitted": 29947, - "total_column_articles": 219, + "total_acs": 21640, + "total_submitted": 30258, + "total_column_articles": 223, "frontend_question_id": "面试题 04.08", "is_new_question": false }, @@ -7194,9 +7194,9 @@ "question__title": "Successor LCCI", "question__title_slug": "successor-lcci", "question__hide": false, - "total_acs": 26102, - "total_submitted": 44182, - "total_column_articles": 304, + "total_acs": 26359, + "total_submitted": 44616, + "total_column_articles": 308, "frontend_question_id": "面试题 04.06", "is_new_question": false }, @@ -7215,9 +7215,9 @@ "question__title": "Legal Binary Search Tree LCCI", "question__title_slug": "legal-binary-search-tree-lcci", "question__hide": false, - "total_acs": 31212, - "total_submitted": 88478, - "total_column_articles": 384, + "total_acs": 31467, + "total_submitted": 89154, + "total_column_articles": 388, "frontend_question_id": "面试题 04.05", "is_new_question": false }, @@ -7236,9 +7236,9 @@ "question__title": "Check Balance LCCI", "question__title_slug": "check-balance-lcci", "question__hide": false, - "total_acs": 38493, - "total_submitted": 65211, - "total_column_articles": 425, + "total_acs": 38712, + "total_submitted": 65551, + "total_column_articles": 426, "frontend_question_id": "面试题 04.04", "is_new_question": false }, @@ -7257,9 +7257,9 @@ "question__title": "List of Depth LCCI", "question__title_slug": "list-of-depth-lcci", "question__hide": false, - "total_acs": 28702, - "total_submitted": 35690, - "total_column_articles": 620, + "total_acs": 28875, + "total_submitted": 35912, + "total_column_articles": 621, "frontend_question_id": "面试题 04.03", "is_new_question": false }, @@ -7278,9 +7278,9 @@ "question__title": "Minimum Height Tree LCCI", "question__title_slug": "minimum-height-tree-lcci", "question__hide": false, - "total_acs": 40719, - "total_submitted": 51679, - "total_column_articles": 490, + "total_acs": 40973, + "total_submitted": 51988, + "total_column_articles": 493, "frontend_question_id": "面试题 04.02", "is_new_question": false }, @@ -7299,9 +7299,9 @@ "question__title": "Sort of Stacks LCCI", "question__title_slug": "sort-of-stacks-lcci", "question__hide": false, - "total_acs": 19766, - "total_submitted": 36684, - "total_column_articles": 262, + "total_acs": 19941, + "total_submitted": 36996, + "total_column_articles": 264, "frontend_question_id": "面试题 03.05", "is_new_question": false }, @@ -7320,9 +7320,9 @@ "question__title": "Three in One LCCI", "question__title_slug": "three-in-one-lcci", "question__hide": false, - "total_acs": 15198, - "total_submitted": 28659, - "total_column_articles": 241, + "total_acs": 15346, + "total_submitted": 28936, + "total_column_articles": 242, "frontend_question_id": "面试题 03.01", "is_new_question": false }, @@ -7341,9 +7341,9 @@ "question__title": "Route Between Nodes LCCI", "question__title_slug": "route-between-nodes-lcci", "question__hide": false, - "total_acs": 23007, - "total_submitted": 43063, - "total_column_articles": 307, + "total_acs": 23236, + "total_submitted": 43488, + "total_column_articles": 313, "frontend_question_id": "面试题 04.01", "is_new_question": false }, @@ -7362,9 +7362,9 @@ "question__title": "Implement Queue using Stacks LCCI", "question__title_slug": "implement-queue-using-stacks-lcci", "question__hide": false, - "total_acs": 28176, - "total_submitted": 39456, - "total_column_articles": 391, + "total_acs": 28344, + "total_submitted": 39689, + "total_column_articles": 394, "frontend_question_id": "面试题 03.04", "is_new_question": false }, @@ -7383,9 +7383,9 @@ "question__title": "Min Stack LCCI", "question__title_slug": "min-stack-lcci", "question__hide": false, - "total_acs": 31446, - "total_submitted": 51076, - "total_column_articles": 350, + "total_acs": 31676, + "total_submitted": 51472, + "total_column_articles": 355, "frontend_question_id": "面试题 03.02", "is_new_question": false }, @@ -7404,9 +7404,9 @@ "question__title": "Linked List Cycle LCCI", "question__title_slug": "linked-list-cycle-lcci", "question__hide": false, - "total_acs": 34296, - "total_submitted": 63454, - "total_column_articles": 340, + "total_acs": 34493, + "total_submitted": 63782, + "total_column_articles": 343, "frontend_question_id": "面试题 02.08", "is_new_question": false }, @@ -7425,9 +7425,9 @@ "question__title": "Intersection of Two Linked Lists LCCI", "question__title_slug": "intersection-of-two-linked-lists-lcci", "question__hide": false, - "total_acs": 87342, - "total_submitted": 129946, - "total_column_articles": 692, + "total_acs": 89576, + "total_submitted": 133263, + "total_column_articles": 705, "frontend_question_id": "面试题 02.07", "is_new_question": false }, @@ -7446,9 +7446,9 @@ "question__title": "Palindrome Linked List LCCI", "question__title_slug": "palindrome-linked-list-lcci", "question__hide": false, - "total_acs": 49321, - "total_submitted": 101572, - "total_column_articles": 592, + "total_acs": 49662, + "total_submitted": 102321, + "total_column_articles": 596, "frontend_question_id": "面试题 02.06", "is_new_question": false }, @@ -7467,9 +7467,9 @@ "question__title": "Remove Duplicate Node LCCI", "question__title_slug": "remove-duplicate-node-lcci", "question__hide": false, - "total_acs": 75439, - "total_submitted": 111959, - "total_column_articles": 786, + "total_acs": 75900, + "total_submitted": 112689, + "total_column_articles": 787, "frontend_question_id": "面试题 02.01", "is_new_question": false }, @@ -7488,9 +7488,9 @@ "question__title": "String Rotation LCCI", "question__title_slug": "string-rotation-lcci", "question__hide": false, - "total_acs": 42673, - "total_submitted": 77878, - "total_column_articles": 514, + "total_acs": 43007, + "total_submitted": 78584, + "total_column_articles": 519, "frontend_question_id": "面试题 01.09", "is_new_question": false }, @@ -7509,9 +7509,9 @@ "question__title": "Compress String LCCI", "question__title_slug": "compress-string-lcci", "question__hide": false, - "total_acs": 88049, - "total_submitted": 188235, - "total_column_articles": 1311, + "total_acs": 88586, + "total_submitted": 189487, + "total_column_articles": 1317, "frontend_question_id": "面试题 01.06", "is_new_question": false }, @@ -7530,9 +7530,9 @@ "question__title": "String to URL LCCI", "question__title_slug": "string-to-url-lcci", "question__hide": false, - "total_acs": 58426, - "total_submitted": 101461, - "total_column_articles": 599, + "total_acs": 58912, + "total_submitted": 102303, + "total_column_articles": 607, "frontend_question_id": "面试题 01.03", "is_new_question": false }, @@ -7551,9 +7551,9 @@ "question__title": "Check Permutation LCCI", "question__title_slug": "check-permutation-lcci", "question__hide": false, - "total_acs": 75249, - "total_submitted": 118064, - "total_column_articles": 1325, + "total_acs": 75812, + "total_submitted": 118962, + "total_column_articles": 1337, "frontend_question_id": "面试题 01.02", "is_new_question": false }, @@ -7572,9 +7572,9 @@ "question__title": "Is Unique LCCI", "question__title_slug": "is-unique-lcci", "question__hide": false, - "total_acs": 119417, - "total_submitted": 167553, - "total_column_articles": 1843, + "total_acs": 120259, + "total_submitted": 168742, + "total_column_articles": 1862, "frontend_question_id": "面试题 01.01", "is_new_question": false }, @@ -7593,9 +7593,9 @@ "question__title": "Guess Numbers", "question__title_slug": "guess-numbers", "question__hide": false, - "total_acs": 87865, - "total_submitted": 103962, - "total_column_articles": 692, + "total_acs": 88141, + "total_submitted": 104303, + "total_column_articles": 695, "frontend_question_id": "LCP 01", "is_new_question": false }, @@ -7614,8 +7614,8 @@ "question__title": "Programmable Robot", "question__title_slug": "programmable-robot", "question__hide": false, - "total_acs": 12828, - "total_submitted": 56760, + "total_acs": 12932, + "total_submitted": 57033, "total_column_articles": 200, "frontend_question_id": "LCP 03", "is_new_question": false @@ -7635,8 +7635,8 @@ "question__title": "Coin Bonus", "question__title_slug": "coin-bonus", "question__hide": false, - "total_acs": 2416, - "total_submitted": 11451, + "total_acs": 2432, + "total_submitted": 11501, "total_column_articles": 59, "frontend_question_id": "LCP 05", "is_new_question": false @@ -7656,9 +7656,9 @@ "question__title": "Broken Board Dominoes", "question__title_slug": "broken-board-dominoes", "question__hide": false, - "total_acs": 3258, - "total_submitted": 8150, - "total_column_articles": 72, + "total_acs": 3280, + "total_submitted": 8198, + "total_column_articles": 73, "frontend_question_id": "LCP 04", "is_new_question": false }, @@ -7677,9 +7677,9 @@ "question__title": "Deep Dark Fraction", "question__title_slug": "deep-dark-fraction", "question__hide": false, - "total_acs": 15829, - "total_submitted": 22791, - "total_column_articles": 276, + "total_acs": 15948, + "total_submitted": 22962, + "total_column_articles": 278, "frontend_question_id": "LCP 02", "is_new_question": false }, @@ -7692,15 +7692,36 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2396, + "question__title": "Design Video Sharing Platform", + "question__title_slug": "design-video-sharing-platform", + "question__hide": false, + "total_acs": 26, + "total_submitted": 41, + "total_column_articles": 4, + "frontend_question_id": "2254", + "is_new_question": true + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2385, "question__title": "Count Positions on Street With Required Brightness", "question__title_slug": "count-positions-on-street-with-required-brightness", "question__hide": false, - "total_acs": 48, - "total_submitted": 61, - "total_column_articles": 5, + "total_acs": 62, + "total_submitted": 78, + "total_column_articles": 6, "frontend_question_id": "2237", "is_new_question": false }, @@ -7719,9 +7740,9 @@ "question__title": "Root Equals Sum of Children", "question__title_slug": "root-equals-sum-of-children", "question__hide": false, - "total_acs": 1123, - "total_submitted": 1299, - "total_column_articles": 10, + "total_acs": 1496, + "total_submitted": 1720, + "total_column_articles": 12, "frontend_question_id": "2236", "is_new_question": false }, @@ -7740,9 +7761,9 @@ "question__title": "Add Two Integers", "question__title_slug": "add-two-integers", "question__hide": false, - "total_acs": 2093, - "total_submitted": 2382, - "total_column_articles": 19, + "total_acs": 2967, + "total_submitted": 3345, + "total_column_articles": 20, "frontend_question_id": "2235", "is_new_question": false }, @@ -7755,15 +7776,57 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2382, + "question__title": "Dynamic Unpivoting of a Table", + "question__title_slug": "dynamic-unpivoting-of-a-table", + "question__hide": false, + "total_acs": 9, + "total_submitted": 15, + "total_column_articles": 1, + "frontend_question_id": "2253", + "is_new_question": true + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2381, + "question__title": "Dynamic Pivoting of a Table", + "question__title_slug": "dynamic-pivoting-of-a-table", + "question__hide": false, + "total_acs": 16, + "total_submitted": 32, + "total_column_articles": 0, + "frontend_question_id": "2252", + "is_new_question": true + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2376, "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": 72, - "total_submitted": 93, - "total_column_articles": 3, + "total_acs": 113, + "total_submitted": 139, + "total_column_articles": 5, "frontend_question_id": "2238", "is_new_question": false }, @@ -7782,9 +7845,9 @@ "question__title": "The Users That Are Eligible for Discount", "question__title_slug": "the-users-that-are-eligible-for-discount", "question__hide": false, - "total_acs": 107, - "total_submitted": 205, - "total_column_articles": 2, + "total_acs": 137, + "total_submitted": 257, + "total_column_articles": 4, "frontend_question_id": "2230", "is_new_question": false }, @@ -7803,9 +7866,9 @@ "question__title": "Users With Two Purchases Within Seven Days", "question__title_slug": "users-with-two-purchases-within-seven-days", "question__hide": false, - "total_acs": 134, - "total_submitted": 248, - "total_column_articles": 6, + "total_acs": 162, + "total_submitted": 307, + "total_column_articles": 7, "frontend_question_id": "2228", "is_new_question": false }, @@ -7824,8 +7887,8 @@ "question__title": "Maximum Sum Score of Array", "question__title_slug": "maximum-sum-score-of-array", "question__hide": false, - "total_acs": 85, - "total_submitted": 108, + "total_acs": 93, + "total_submitted": 122, "total_column_articles": 7, "frontend_question_id": "2219", "is_new_question": false @@ -7845,9 +7908,9 @@ "question__title": "Longest Path With Different Adjacent Characters", "question__title_slug": "longest-path-with-different-adjacent-characters", "question__hide": false, - "total_acs": 2894, - "total_submitted": 6945, - "total_column_articles": 48, + "total_acs": 3102, + "total_submitted": 7386, + "total_column_articles": 49, "frontend_question_id": "2246", "is_new_question": false }, @@ -7866,9 +7929,9 @@ "question__title": "Maximum Trailing Zeros in a Cornered Path", "question__title_slug": "maximum-trailing-zeros-in-a-cornered-path", "question__hide": false, - "total_acs": 3483, - "total_submitted": 10668, - "total_column_articles": 83, + "total_acs": 3690, + "total_submitted": 11063, + "total_column_articles": 84, "frontend_question_id": "2245", "is_new_question": false }, @@ -7887,9 +7950,9 @@ "question__title": "Minimum Rounds to Complete All Tasks", "question__title_slug": "minimum-rounds-to-complete-all-tasks", "question__hide": false, - "total_acs": 7714, - "total_submitted": 14152, - "total_column_articles": 114, + "total_acs": 8072, + "total_submitted": 14744, + "total_column_articles": 119, "frontend_question_id": "2244", "is_new_question": false }, @@ -7908,9 +7971,9 @@ "question__title": "Calculate Digit Sum of a String", "question__title_slug": "calculate-digit-sum-of-a-string", "question__hide": false, - "total_acs": 8100, - "total_submitted": 12964, - "total_column_articles": 87, + "total_acs": 8448, + "total_submitted": 13449, + "total_column_articles": 89, "frontend_question_id": "2243", "is_new_question": false }, @@ -7929,9 +7992,9 @@ "question__title": "Minimum Health to Beat Game", "question__title_slug": "minimum-health-to-beat-game", "question__hide": false, - "total_acs": 68, - "total_submitted": 117, - "total_column_articles": 5, + "total_acs": 75, + "total_submitted": 135, + "total_column_articles": 6, "frontend_question_id": "2214", "is_new_question": false }, @@ -7950,9 +8013,9 @@ "question__title": "Maximum Score of a Node Sequence", "question__title_slug": "maximum-score-of-a-node-sequence", "question__hide": false, - "total_acs": 1991, - "total_submitted": 6869, - "total_column_articles": 34, + "total_acs": 2104, + "total_submitted": 7125, + "total_column_articles": 35, "frontend_question_id": "2242", "is_new_question": false }, @@ -7971,9 +8034,9 @@ "question__title": "Design an ATM Machine", "question__title_slug": "design-an-atm-machine", "question__hide": false, - "total_acs": 3652, - "total_submitted": 10899, - "total_column_articles": 47, + "total_acs": 3874, + "total_submitted": 11411, + "total_column_articles": 51, "frontend_question_id": "2241", "is_new_question": false }, @@ -7992,9 +8055,9 @@ "question__title": "Number of Ways to Buy Pens and Pencils", "question__title_slug": "number-of-ways-to-buy-pens-and-pencils", "question__hide": false, - "total_acs": 4332, - "total_submitted": 7645, - "total_column_articles": 47, + "total_acs": 4576, + "total_submitted": 8048, + "total_column_articles": 51, "frontend_question_id": "2240", "is_new_question": false }, @@ -8013,9 +8076,9 @@ "question__title": "Find Closest Number to Zero", "question__title_slug": "find-closest-number-to-zero", "question__hide": false, - "total_acs": 4853, - "total_submitted": 8400, - "total_column_articles": 45, + "total_acs": 5477, + "total_submitted": 9594, + "total_column_articles": 51, "frontend_question_id": "2239", "is_new_question": false }, @@ -8034,9 +8097,9 @@ "question__title": "Minimum Number of Operations to Convert Time", "question__title_slug": "minimum-number-of-operations-to-convert-time", "question__hide": false, - "total_acs": 8735, - "total_submitted": 12648, - "total_column_articles": 106, + "total_acs": 8901, + "total_submitted": 12883, + "total_column_articles": 107, "frontend_question_id": "2224", "is_new_question": false }, @@ -8049,15 +8112,183 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2344, + "question__title": "Escape the Spreading Fire", + "question__title_slug": "escape-the-spreading-fire", + "question__hide": false, + "total_acs": 1426, + "total_submitted": 4676, + "total_column_articles": 52, + "frontend_question_id": "2258", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2343, + "question__title": "Count Unguarded Cells in the Grid", + "question__title_slug": "count-unguarded-cells-in-the-grid", + "question__hide": false, + "total_acs": 3039, + "total_submitted": 6242, + "total_column_articles": 80, + "frontend_question_id": "2257", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2342, + "question__title": "Minimum Average Difference", + "question__title_slug": "minimum-average-difference", + "question__hide": false, + "total_acs": 3597, + "total_submitted": 10613, + "total_column_articles": 56, + "frontend_question_id": "2256", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2341, + "question__title": "Count Prefixes of a Given String", + "question__title_slug": "count-prefixes-of-a-given-string", + "question__hide": false, + "total_acs": 3908, + "total_submitted": 4818, + "total_column_articles": 48, + "frontend_question_id": "2255", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2340, + "question__title": "Total Appeal of A String", + "question__title_slug": "total-appeal-of-a-string", + "question__hide": false, + "total_acs": 3523, + "total_submitted": 6990, + "total_column_articles": 82, + "frontend_question_id": "2262", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2339, + "question__title": "K Divisible Elements Subarrays", + "question__title_slug": "k-divisible-elements-subarrays", + "question__hide": false, + "total_acs": 5355, + "total_submitted": 10771, + "total_column_articles": 88, + "frontend_question_id": "2261", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2338, + "question__title": "Minimum Consecutive Cards to Pick Up", + "question__title_slug": "minimum-consecutive-cards-to-pick-up", + "question__hide": false, + "total_acs": 6338, + "total_submitted": 12995, + "total_column_articles": 96, + "frontend_question_id": "2260", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2337, + "question__title": "Remove Digit From Number to Maximize Result", + "question__title_slug": "remove-digit-from-number-to-maximize-result", + "question__hide": false, + "total_acs": 6690, + "total_submitted": 13959, + "total_column_articles": 83, + "frontend_question_id": "2259", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2336, "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": 219, - "total_submitted": 480, - "total_column_articles": 7, + "total_acs": 241, + "total_submitted": 530, + "total_column_articles": 9, "frontend_question_id": "2205", "is_new_question": false }, @@ -8076,9 +8307,9 @@ "question__title": "Finding the Topic of Each Post", "question__title_slug": "finding-the-topic-of-each-post", "question__hide": false, - "total_acs": 116, - "total_submitted": 227, - "total_column_articles": 5, + "total_acs": 131, + "total_submitted": 252, + "total_column_articles": 6, "frontend_question_id": "2199", "is_new_question": false }, @@ -8097,10 +8328,10 @@ "question__title": "Number of Flowers in Full Bloom", "question__title_slug": "number-of-flowers-in-full-bloom", "question__hide": false, - "total_acs": 1957, - "total_submitted": 4773, - "total_column_articles": 38, - "frontend_question_id": "6044", + "total_acs": 3932, + "total_submitted": 8229, + "total_column_articles": 90, + "frontend_question_id": "2251", "is_new_question": false }, "status": null, @@ -8118,9 +8349,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": 2240, - "total_submitted": 9433, - "total_column_articles": 49, + "total_acs": 4493, + "total_submitted": 13924, + "total_column_articles": 99, "frontend_question_id": "6043", "is_new_question": false }, @@ -8139,10 +8370,10 @@ "question__title": "Count Lattice Points Inside a Circle", "question__title_slug": "count-lattice-points-inside-a-circle", "question__hide": false, - "total_acs": 4511, - "total_submitted": 9347, - "total_column_articles": 52, - "frontend_question_id": "6042", + "total_acs": 6746, + "total_submitted": 13143, + "total_column_articles": 95, + "frontend_question_id": "2249", "is_new_question": false }, "status": null, @@ -8160,10 +8391,10 @@ "question__title": "Intersection of Multiple Arrays", "question__title_slug": "intersection-of-multiple-arrays", "question__hide": false, - "total_acs": 5546, - "total_submitted": 8275, - "total_column_articles": 40, - "frontend_question_id": "6041", + "total_acs": 8434, + "total_submitted": 12474, + "total_column_articles": 107, + "frontend_question_id": "2248", "is_new_question": false }, "status": null, @@ -8181,9 +8412,9 @@ "question__title": "Maximum Total Beauty of the Gardens", "question__title_slug": "maximum-total-beauty-of-the-gardens", "question__hide": false, - "total_acs": 2337, - "total_submitted": 8652, - "total_column_articles": 59, + "total_acs": 2389, + "total_submitted": 8812, + "total_column_articles": 62, "frontend_question_id": "2234", "is_new_question": false }, @@ -8202,9 +8433,9 @@ "question__title": "Maximum Product After K Increments", "question__title_slug": "maximum-product-after-k-increments", "question__hide": false, - "total_acs": 6464, - "total_submitted": 18388, - "total_column_articles": 142, + "total_acs": 6590, + "total_submitted": 18702, + "total_column_articles": 143, "frontend_question_id": "2233", "is_new_question": false }, @@ -8223,9 +8454,9 @@ "question__title": "Minimize Result by Adding Parentheses to Expression", "question__title_slug": "minimize-result-by-adding-parentheses-to-expression", "question__hide": false, - "total_acs": 5956, - "total_submitted": 9804, - "total_column_articles": 113, + "total_acs": 6082, + "total_submitted": 10000, + "total_column_articles": 116, "frontend_question_id": "2232", "is_new_question": false }, @@ -8244,9 +8475,9 @@ "question__title": "Largest Number After Digit Swaps by Parity", "question__title_slug": "largest-number-after-digit-swaps-by-parity", "question__hide": false, - "total_acs": 7936, - "total_submitted": 12713, - "total_column_articles": 130, + "total_acs": 8136, + "total_submitted": 12972, + "total_column_articles": 131, "frontend_question_id": "2231", "is_new_question": false }, @@ -8265,9 +8496,9 @@ "question__title": "Sum of Scores of Built Strings", "question__title_slug": "sum-of-scores-of-built-strings", "question__hide": false, - "total_acs": 2364, - "total_submitted": 7167, - "total_column_articles": 42, + "total_acs": 2442, + "total_submitted": 7357, + "total_column_articles": 43, "frontend_question_id": "2223", "is_new_question": false }, @@ -8286,9 +8517,9 @@ "question__title": "Number of Ways to Select Buildings", "question__title_slug": "number-of-ways-to-select-buildings", "question__hide": false, - "total_acs": 4324, - "total_submitted": 9346, - "total_column_articles": 104, + "total_acs": 4461, + "total_submitted": 9544, + "total_column_articles": 108, "frontend_question_id": "2222", "is_new_question": false }, @@ -8307,8 +8538,8 @@ "question__title": "Find Triangular Sum of an Array", "question__title_slug": "find-triangular-sum-of-an-array", "question__hide": false, - "total_acs": 5229, - "total_submitted": 6523, + "total_acs": 5351, + "total_submitted": 6681, "total_column_articles": 64, "frontend_question_id": "2221", "is_new_question": false @@ -8328,8 +8559,8 @@ "question__title": "Minimum Bit Flips to Convert Number", "question__title_slug": "minimum-bit-flips-to-convert-number", "question__hide": false, - "total_acs": 5534, - "total_submitted": 6684, + "total_acs": 5690, + "total_submitted": 6864, "total_column_articles": 87, "frontend_question_id": "2220", "is_new_question": false @@ -8349,8 +8580,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": 106, - "total_submitted": 203, + "total_acs": 115, + "total_submitted": 232, "total_column_articles": 9, "frontend_question_id": "2184", "is_new_question": false @@ -8370,8 +8601,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": 3263, - "total_submitted": 9040, + "total_acs": 3295, + "total_submitted": 9124, "total_column_articles": 64, "frontend_question_id": "2203", "is_new_question": false @@ -8391,8 +8622,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": 9673, - "total_submitted": 18789, + "total_acs": 9744, + "total_submitted": 18914, "total_column_articles": 113, "frontend_question_id": "2200", "is_new_question": false @@ -8412,8 +8643,8 @@ "question__title": "Longest Substring of One Repeating Character", "question__title_slug": "longest-substring-of-one-repeating-character", "question__hide": false, - "total_acs": 1972, - "total_submitted": 5499, + "total_acs": 2001, + "total_submitted": 5564, "total_column_articles": 67, "frontend_question_id": "2213", "is_new_question": false @@ -8433,9 +8664,9 @@ "question__title": "Maximum Points in an Archery Competition", "question__title_slug": "maximum-points-in-an-archery-competition", "question__hide": false, - "total_acs": 5839, - "total_submitted": 12565, - "total_column_articles": 148, + "total_acs": 5905, + "total_submitted": 12688, + "total_column_articles": 149, "frontend_question_id": "2212", "is_new_question": false }, @@ -8454,9 +8685,9 @@ "question__title": "Count Collisions on a Road", "question__title_slug": "count-collisions-on-a-road", "question__hide": false, - "total_acs": 7747, - "total_submitted": 20114, - "total_column_articles": 125, + "total_acs": 7810, + "total_submitted": 20271, + "total_column_articles": 127, "frontend_question_id": "2211", "is_new_question": false }, @@ -8475,9 +8706,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": 9281, - "total_submitted": 16122, - "total_column_articles": 104, + "total_acs": 9378, + "total_submitted": 16277, + "total_column_articles": 105, "frontend_question_id": "2210", "is_new_question": false }, @@ -8496,9 +8727,9 @@ "question__title": "The Change in Global Rankings", "question__title_slug": "the-change-in-global-rankings", "question__hide": false, - "total_acs": 240, - "total_submitted": 435, - "total_column_articles": 5, + "total_acs": 258, + "total_submitted": 459, + "total_column_articles": 7, "frontend_question_id": "2175", "is_new_question": false }, @@ -8517,9 +8748,9 @@ "question__title": "Remove All Ones With Row and Column Flips II", "question__title_slug": "remove-all-ones-with-row-and-column-flips-ii", "question__hide": false, - "total_acs": 86, - "total_submitted": 128, - "total_column_articles": 7, + "total_acs": 90, + "total_submitted": 133, + "total_column_articles": 8, "frontend_question_id": "2174", "is_new_question": false }, @@ -8538,9 +8769,9 @@ "question__title": "Longest Winning Streak", "question__title_slug": "longest-winning-streak", "question__hide": false, - "total_acs": 235, - "total_submitted": 453, - "total_column_articles": 10, + "total_acs": 258, + "total_submitted": 483, + "total_column_articles": 13, "frontend_question_id": "2173", "is_new_question": false }, @@ -8559,8 +8790,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": 6158, - "total_submitted": 10535, + "total_acs": 6236, + "total_submitted": 10665, "total_column_articles": 67, "frontend_question_id": "2190", "is_new_question": false @@ -8580,9 +8811,9 @@ "question__title": "Minimum White Tiles After Covering With Carpets", "question__title_slug": "minimum-white-tiles-after-covering-with-carpets", "question__hide": false, - "total_acs": 3213, - "total_submitted": 9123, - "total_column_articles": 42, + "total_acs": 3275, + "total_submitted": 9257, + "total_column_articles": 43, "frontend_question_id": "2209", "is_new_question": false }, @@ -8601,9 +8832,9 @@ "question__title": "Minimum Operations to Halve Array Sum", "question__title_slug": "minimum-operations-to-halve-array-sum", "question__hide": false, - "total_acs": 4816, - "total_submitted": 12488, - "total_column_articles": 78, + "total_acs": 4894, + "total_submitted": 12625, + "total_column_articles": 81, "frontend_question_id": "2208", "is_new_question": false }, @@ -8622,9 +8853,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": 5207, - "total_submitted": 17704, - "total_column_articles": 84, + "total_acs": 5291, + "total_submitted": 17952, + "total_column_articles": 87, "frontend_question_id": "2207", "is_new_question": false }, @@ -8643,9 +8874,9 @@ "question__title": "Divide Array Into Equal Pairs", "question__title_slug": "divide-array-into-equal-pairs", "question__hide": false, - "total_acs": 6845, - "total_submitted": 8946, - "total_column_articles": 79, + "total_acs": 7018, + "total_submitted": 9169, + "total_column_articles": 82, "frontend_question_id": "2206", "is_new_question": false }, @@ -8664,8 +8895,8 @@ "question__title": "Replace Non-Coprime Numbers in Array", "question__title_slug": "replace-non-coprime-numbers-in-array", "question__hide": false, - "total_acs": 4623, - "total_submitted": 14096, + "total_acs": 4641, + "total_submitted": 14132, "total_column_articles": 83, "frontend_question_id": "2197", "is_new_question": false @@ -8685,9 +8916,9 @@ "question__title": "Create Binary Tree From Descriptions", "question__title_slug": "create-binary-tree-from-descriptions", "question__hide": false, - "total_acs": 6896, - "total_submitted": 9423, - "total_column_articles": 121, + "total_acs": 6964, + "total_submitted": 9521, + "total_column_articles": 122, "frontend_question_id": "2196", "is_new_question": false }, @@ -8706,9 +8937,9 @@ "question__title": "Append K Integers With Minimal Sum", "question__title_slug": "append-k-integers-with-minimal-sum", "question__hide": false, - "total_acs": 9231, - "total_submitted": 40361, - "total_column_articles": 198, + "total_acs": 9290, + "total_submitted": 40514, + "total_column_articles": 199, "frontend_question_id": "2195", "is_new_question": false }, @@ -8727,9 +8958,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": 9912, - "total_submitted": 11655, - "total_column_articles": 89, + "total_acs": 10044, + "total_submitted": 11822, + "total_column_articles": 93, "frontend_question_id": "2194", "is_new_question": false }, @@ -8748,9 +8979,9 @@ "question__title": "Unique Substrings With Equal Digit Frequency", "question__title_slug": "unique-substrings-with-equal-digit-frequency", "question__hide": false, - "total_acs": 166, - "total_submitted": 273, - "total_column_articles": 6, + "total_acs": 184, + "total_submitted": 298, + "total_column_articles": 7, "frontend_question_id": "2168", "is_new_question": false }, @@ -8769,9 +9000,9 @@ "question__title": "Order Two Columns Independently", "question__title_slug": "order-two-columns-independently", "question__hide": false, - "total_acs": 309, - "total_submitted": 489, - "total_column_articles": 6, + "total_acs": 330, + "total_submitted": 520, + "total_column_articles": 7, "frontend_question_id": "2159", "is_new_question": false }, @@ -8790,8 +9021,8 @@ "question__title": "Count Array Pairs Divisible by K", "question__title_slug": "count-array-pairs-divisible-by-k", "question__hide": false, - "total_acs": 3805, - "total_submitted": 14187, + "total_acs": 3847, + "total_submitted": 14306, "total_column_articles": 53, "frontend_question_id": "2183", "is_new_question": false @@ -8811,9 +9042,9 @@ "question__title": "Construct String With Repeat Limit", "question__title_slug": "construct-string-with-repeat-limit", "question__hide": false, - "total_acs": 5806, - "total_submitted": 12160, - "total_column_articles": 128, + "total_acs": 5861, + "total_submitted": 12254, + "total_column_articles": 129, "frontend_question_id": "2182", "is_new_question": false }, @@ -8832,9 +9063,9 @@ "question__title": "Merge Nodes in Between Zeros", "question__title_slug": "merge-nodes-in-between-zeros", "question__hide": false, - "total_acs": 8862, - "total_submitted": 10261, - "total_column_articles": 119, + "total_acs": 9045, + "total_submitted": 10509, + "total_column_articles": 121, "frontend_question_id": "2181", "is_new_question": false }, @@ -8853,9 +9084,9 @@ "question__title": "Count Integers With Even Digit Sum", "question__title_slug": "count-integers-with-even-digit-sum", "question__hide": false, - "total_acs": 8560, - "total_submitted": 13170, - "total_column_articles": 94, + "total_acs": 8637, + "total_submitted": 13287, + "total_column_articles": 96, "frontend_question_id": "2180", "is_new_question": false }, @@ -8874,8 +9105,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": 110, - "total_submitted": 210, + "total_acs": 130, + "total_submitted": 257, "total_column_articles": 8, "frontend_question_id": "2158", "is_new_question": false @@ -8895,8 +9126,8 @@ "question__title": "The Number of Passengers in Each Bus II", "question__title_slug": "the-number-of-passengers-in-each-bus-ii", "question__hide": false, - "total_acs": 161, - "total_submitted": 391, + "total_acs": 171, + "total_submitted": 407, "total_column_articles": 4, "frontend_question_id": "2153", "is_new_question": false @@ -8916,8 +9147,8 @@ "question__title": "Minimum Time to Finish the Race", "question__title_slug": "minimum-time-to-finish-the-race", "question__hide": false, - "total_acs": 3531, - "total_submitted": 8319, + "total_acs": 3557, + "total_submitted": 8395, "total_column_articles": 62, "frontend_question_id": "2188", "is_new_question": false @@ -8937,9 +9168,9 @@ "question__title": "Minimum Time to Complete Trips", "question__title_slug": "minimum-time-to-complete-trips", "question__hide": false, - "total_acs": 9213, - "total_submitted": 35374, - "total_column_articles": 127, + "total_acs": 9300, + "total_submitted": 35643, + "total_column_articles": 128, "frontend_question_id": "2187", "is_new_question": false }, @@ -8958,8 +9189,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": 8725, - "total_submitted": 12194, + "total_acs": 8792, + "total_submitted": 12270, "total_column_articles": 97, "frontend_question_id": "2186", "is_new_question": false @@ -8979,9 +9210,9 @@ "question__title": "Counting Words With a Given Prefix", "question__title_slug": "counting-words-with-a-given-prefix", "question__hide": false, - "total_acs": 10343, - "total_submitted": 13030, - "total_column_articles": 100, + "total_acs": 10489, + "total_submitted": 13213, + "total_column_articles": 103, "frontend_question_id": "2185", "is_new_question": false }, @@ -9000,9 +9231,9 @@ "question__title": "Maximum AND Sum of Array", "question__title_slug": "maximum-and-sum-of-array", "question__hide": false, - "total_acs": 3207, - "total_submitted": 6773, - "total_column_articles": 60, + "total_acs": 3246, + "total_submitted": 6822, + "total_column_articles": 61, "frontend_question_id": "2172", "is_new_question": false }, @@ -9021,9 +9252,9 @@ "question__title": "Removing Minimum Number of Magic Beans", "question__title_slug": "removing-minimum-number-of-magic-beans", "question__hide": false, - "total_acs": 7047, - "total_submitted": 18051, - "total_column_articles": 157, + "total_acs": 7119, + "total_submitted": 18209, + "total_column_articles": 158, "frontend_question_id": "2171", "is_new_question": false }, @@ -9042,9 +9273,9 @@ "question__title": "Minimum Operations to Make the Array Alternating", "question__title_slug": "minimum-operations-to-make-the-array-alternating", "question__hide": false, - "total_acs": 6522, - "total_submitted": 22346, - "total_column_articles": 135, + "total_acs": 6565, + "total_submitted": 22461, + "total_column_articles": 136, "frontend_question_id": "2170", "is_new_question": false }, @@ -9063,9 +9294,9 @@ "question__title": "Count Operations to Obtain Zero", "question__title_slug": "count-operations-to-obtain-zero", "question__hide": false, - "total_acs": 10878, - "total_submitted": 14313, - "total_column_articles": 85, + "total_acs": 11044, + "total_submitted": 14537, + "total_column_articles": 87, "frontend_question_id": "2169", "is_new_question": false }, @@ -9084,9 +9315,9 @@ "question__title": "Minimum Number of Lines to Cover Points", "question__title_slug": "minimum-number-of-lines-to-cover-points", "question__hide": false, - "total_acs": 137, - "total_submitted": 279, - "total_column_articles": 11, + "total_acs": 149, + "total_submitted": 292, + "total_column_articles": 12, "frontend_question_id": "2152", "is_new_question": false }, @@ -9105,8 +9336,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": 3586, - "total_submitted": 7524, + "total_acs": 3615, + "total_submitted": 7575, "total_column_articles": 70, "frontend_question_id": "2167", "is_new_question": false @@ -9126,8 +9357,8 @@ "question__title": "Design Bitset", "question__title_slug": "design-bitset", "question__hide": false, - "total_acs": 4802, - "total_submitted": 16511, + "total_acs": 4876, + "total_submitted": 16693, "total_column_articles": 141, "frontend_question_id": "2166", "is_new_question": false @@ -9147,8 +9378,8 @@ "question__title": "Smallest Value of the Rearranged Number", "question__title_slug": "smallest-value-of-the-rearranged-number", "question__hide": false, - "total_acs": 6282, - "total_submitted": 11398, + "total_acs": 6346, + "total_submitted": 11514, "total_column_articles": 113, "frontend_question_id": "2165", "is_new_question": false @@ -9168,9 +9399,9 @@ "question__title": "Sort Even and Odd Indices Independently", "question__title_slug": "sort-even-and-odd-indices-independently", "question__hide": false, - "total_acs": 7520, - "total_submitted": 10785, - "total_column_articles": 90, + "total_acs": 7625, + "total_submitted": 10924, + "total_column_articles": 93, "frontend_question_id": "2164", "is_new_question": false }, @@ -9189,9 +9420,9 @@ "question__title": "Choose Numbers From Two Arrays in Range", "question__title_slug": "choose-numbers-from-two-arrays-in-range", "question__hide": false, - "total_acs": 64, - "total_submitted": 125, - "total_column_articles": 6, + "total_acs": 71, + "total_submitted": 136, + "total_column_articles": 7, "frontend_question_id": "2143", "is_new_question": false }, @@ -9210,9 +9441,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": 397, - "total_submitted": 737, - "total_column_articles": 10, + "total_acs": 420, + "total_submitted": 783, + "total_column_articles": 11, "frontend_question_id": "2142", "is_new_question": false }, @@ -9231,8 +9462,8 @@ "question__title": "Count Good Triplets in an Array", "question__title_slug": "count-good-triplets-in-an-array", "question__hide": false, - "total_acs": 2357, - "total_submitted": 7267, + "total_acs": 2389, + "total_submitted": 7329, "total_column_articles": 60, "frontend_question_id": "2179", "is_new_question": false @@ -9252,9 +9483,9 @@ "question__title": "Maximum Split of Positive Even Integers", "question__title_slug": "maximum-split-of-positive-even-integers", "question__hide": false, - "total_acs": 5343, - "total_submitted": 9663, - "total_column_articles": 90, + "total_acs": 5422, + "total_submitted": 9805, + "total_column_articles": 91, "frontend_question_id": "2178", "is_new_question": false }, @@ -9273,9 +9504,9 @@ "question__title": "Find Three Consecutive Integers That Sum to a Given Number", "question__title_slug": "find-three-consecutive-integers-that-sum-to-a-given-number", "question__hide": false, - "total_acs": 5733, - "total_submitted": 8322, - "total_column_articles": 55, + "total_acs": 5807, + "total_submitted": 8417, + "total_column_articles": 57, "frontend_question_id": "2177", "is_new_question": false }, @@ -9294,9 +9525,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": 6466, - "total_submitted": 7991, - "total_column_articles": 69, + "total_acs": 6572, + "total_submitted": 8133, + "total_column_articles": 70, "frontend_question_id": "2176", "is_new_question": false }, @@ -9315,8 +9546,8 @@ "question__title": "Groups of Strings", "question__title_slug": "groups-of-strings", "question__hide": false, - "total_acs": 2751, - "total_submitted": 9283, + "total_acs": 2785, + "total_submitted": 9353, "total_column_articles": 65, "frontend_question_id": "2157", "is_new_question": false @@ -9336,8 +9567,8 @@ "question__title": "Find Substring With Given Hash Value", "question__title_slug": "find-substring-with-given-hash-value", "question__hide": false, - "total_acs": 4525, - "total_submitted": 18783, + "total_acs": 4565, + "total_submitted": 18932, "total_column_articles": 77, "frontend_question_id": "2156", "is_new_question": false @@ -9357,9 +9588,9 @@ "question__title": "Keep Multiplying Found Values by Two", "question__title_slug": "keep-multiplying-found-values-by-two", "question__hide": false, - "total_acs": 9600, - "total_submitted": 12856, - "total_column_articles": 119, + "total_acs": 9789, + "total_submitted": 13145, + "total_column_articles": 121, "frontend_question_id": "2154", "is_new_question": false }, @@ -9378,9 +9609,9 @@ "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": 134, - "total_submitted": 221, - "total_column_articles": 8, + "total_acs": 151, + "total_submitted": 241, + "total_column_articles": 9, "frontend_question_id": "2137", "is_new_question": false }, @@ -9399,8 +9630,8 @@ "question__title": "Maximum Good People Based on Statements", "question__title_slug": "maximum-good-people-based-on-statements", "question__hide": false, - "total_acs": 4455, - "total_submitted": 9205, + "total_acs": 4482, + "total_submitted": 9260, "total_column_articles": 87, "frontend_question_id": "2151", "is_new_question": false @@ -9420,9 +9651,9 @@ "question__title": "Rearrange Array Elements by Sign", "question__title_slug": "rearrange-array-elements-by-sign", "question__hide": false, - "total_acs": 7865, - "total_submitted": 9722, - "total_column_articles": 88, + "total_acs": 8097, + "total_submitted": 10000, + "total_column_articles": 89, "frontend_question_id": "2149", "is_new_question": false }, @@ -9441,8 +9672,8 @@ "question__title": "Find All Lonely Numbers in the Array", "question__title_slug": "find-all-lonely-numbers-in-the-array", "question__hide": false, - "total_acs": 7199, - "total_submitted": 11925, + "total_acs": 7268, + "total_submitted": 12055, "total_column_articles": 84, "frontend_question_id": "2150", "is_new_question": false @@ -9462,9 +9693,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": 8522, - "total_submitted": 14727, - "total_column_articles": 105, + "total_acs": 8639, + "total_submitted": 14923, + "total_column_articles": 108, "frontend_question_id": "2148", "is_new_question": false }, @@ -9483,9 +9714,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": 205, - "total_submitted": 292, - "total_column_articles": 6, + "total_acs": 219, + "total_submitted": 308, + "total_column_articles": 7, "frontend_question_id": "2128", "is_new_question": false }, @@ -9504,8 +9735,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": 2285, - "total_submitted": 4743, + "total_acs": 2315, + "total_submitted": 4808, "total_column_articles": 52, "frontend_question_id": "2163", "is_new_question": false @@ -9525,8 +9756,8 @@ "question__title": "Minimum Cost to Set Cooking Time", "question__title_slug": "minimum-cost-to-set-cooking-time", "question__hide": false, - "total_acs": 2708, - "total_submitted": 8438, + "total_acs": 2728, + "total_submitted": 8497, "total_column_articles": 73, "frontend_question_id": "2162", "is_new_question": false @@ -9546,9 +9777,9 @@ "question__title": "Partition Array According to Given Pivot", "question__title_slug": "partition-array-according-to-given-pivot", "question__hide": false, - "total_acs": 5324, - "total_submitted": 6240, - "total_column_articles": 86, + "total_acs": 5423, + "total_submitted": 6372, + "total_column_articles": 87, "frontend_question_id": "2161", "is_new_question": false }, @@ -9567,9 +9798,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": 7188, - "total_submitted": 8408, - "total_column_articles": 108, + "total_acs": 7380, + "total_submitted": 8639, + "total_column_articles": 109, "frontend_question_id": "2160", "is_new_question": false }, @@ -9588,9 +9819,9 @@ "question__title": "Maximum Running Time of N Computers", "question__title_slug": "maximum-running-time-of-n-computers", "question__hide": false, - "total_acs": 3943, - "total_submitted": 10024, - "total_column_articles": 65, + "total_acs": 4037, + "total_submitted": 10192, + "total_column_articles": 66, "frontend_question_id": "2141", "is_new_question": false }, @@ -9609,9 +9840,9 @@ "question__title": "Solving Questions With Brainpower", "question__title_slug": "solving-questions-with-brainpower", "question__hide": false, - "total_acs": 6420, - "total_submitted": 15559, - "total_column_articles": 134, + "total_acs": 6510, + "total_submitted": 15735, + "total_column_articles": 137, "frontend_question_id": "2140", "is_new_question": false }, @@ -9630,8 +9861,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": 6447, - "total_submitted": 10090, + "total_acs": 6493, + "total_submitted": 10149, "total_column_articles": 96, "frontend_question_id": "2155", "is_new_question": false @@ -9651,9 +9882,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": 7731, - "total_submitted": 11483, - "total_column_articles": 106, + "total_acs": 7825, + "total_submitted": 11608, + "total_column_articles": 107, "frontend_question_id": "2138", "is_new_question": false }, @@ -9672,8 +9903,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": 123, - "total_submitted": 251, + "total_acs": 124, + "total_submitted": 252, "total_column_articles": 5, "frontend_question_id": "2123", "is_new_question": false @@ -9693,9 +9924,9 @@ "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": 127, - "total_submitted": 182, - "total_column_articles": 7, + "total_acs": 135, + "total_submitted": 192, + "total_column_articles": 9, "frontend_question_id": "2113", "is_new_question": false }, @@ -9714,8 +9945,8 @@ "question__title": "Earliest Possible Day of Full Bloom", "question__title_slug": "earliest-possible-day-of-full-bloom", "question__hide": false, - "total_acs": 3098, - "total_submitted": 4852, + "total_acs": 3124, + "total_submitted": 4901, "total_column_articles": 59, "frontend_question_id": "2136", "is_new_question": false @@ -9735,9 +9966,9 @@ "question__title": "Count Words Obtained After Adding a Letter", "question__title_slug": "count-words-obtained-after-adding-a-letter", "question__hide": false, - "total_acs": 4307, - "total_submitted": 12608, - "total_column_articles": 85, + "total_acs": 4331, + "total_submitted": 12683, + "total_column_articles": 87, "frontend_question_id": "2135", "is_new_question": false }, @@ -9756,8 +9987,8 @@ "question__title": "Minimum Swaps to Group All 1's Together II", "question__title_slug": "minimum-swaps-to-group-all-1s-together-ii", "question__hide": false, - "total_acs": 5560, - "total_submitted": 11832, + "total_acs": 5611, + "total_submitted": 11938, "total_column_articles": 150, "frontend_question_id": "2134", "is_new_question": false @@ -9777,9 +10008,9 @@ "question__title": "Check if Every Row and Column Contains All Numbers", "question__title_slug": "check-if-every-row-and-column-contains-all-numbers", "question__hide": false, - "total_acs": 7613, - "total_submitted": 13437, - "total_column_articles": 112, + "total_acs": 7701, + "total_submitted": 13621, + "total_column_articles": 114, "frontend_question_id": "2133", "is_new_question": false }, @@ -9798,9 +10029,9 @@ "question__title": "Build the Equation", "question__title_slug": "build-the-equation", "question__hide": false, - "total_acs": 233, - "total_submitted": 415, - "total_column_articles": 7, + "total_acs": 243, + "total_submitted": 435, + "total_column_articles": 9, "frontend_question_id": "2118", "is_new_question": false }, @@ -9819,9 +10050,9 @@ "question__title": "The Airport With the Most Traffic", "question__title_slug": "the-airport-with-the-most-traffic", "question__hide": false, - "total_acs": 480, - "total_submitted": 651, - "total_column_articles": 10, + "total_acs": 498, + "total_submitted": 682, + "total_column_articles": 11, "frontend_question_id": "2112", "is_new_question": false }, @@ -9840,9 +10071,9 @@ "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": 2721, - "total_submitted": 6833, - "total_column_articles": 71, + "total_acs": 2741, + "total_submitted": 6884, + "total_column_articles": 72, "frontend_question_id": "2147", "is_new_question": false }, @@ -9861,8 +10092,8 @@ "question__title": "K Highest Ranked Items Within a Price Range", "question__title_slug": "k-highest-ranked-items-within-a-price-range", "question__hide": false, - "total_acs": 3116, - "total_submitted": 8077, + "total_acs": 3144, + "total_submitted": 8127, "total_column_articles": 83, "frontend_question_id": "2146", "is_new_question": false @@ -9882,8 +10113,8 @@ "question__title": "Count the Hidden Sequences", "question__title_slug": "count-the-hidden-sequences", "question__hide": false, - "total_acs": 4242, - "total_submitted": 12475, + "total_acs": 4273, + "total_submitted": 12548, "total_column_articles": 100, "frontend_question_id": "2145", "is_new_question": false @@ -9903,9 +10134,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": 5899, - "total_submitted": 8587, - "total_column_articles": 98, + "total_acs": 6030, + "total_submitted": 8770, + "total_column_articles": 101, "frontend_question_id": "2144", "is_new_question": false }, @@ -9924,9 +10155,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": 136, - "total_submitted": 291, - "total_column_articles": 7, + "total_acs": 151, + "total_submitted": 325, + "total_column_articles": 9, "frontend_question_id": "2107", "is_new_question": false }, @@ -9945,9 +10176,9 @@ "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": 2357, - "total_submitted": 7911, - "total_column_articles": 59, + "total_acs": 2383, + "total_submitted": 7966, + "total_column_articles": 58, "frontend_question_id": "2127", "is_new_question": false }, @@ -9966,9 +10197,9 @@ "question__title": "Destroying Asteroids", "question__title_slug": "destroying-asteroids", "question__hide": false, - "total_acs": 6610, - "total_submitted": 13667, - "total_column_articles": 85, + "total_acs": 6681, + "total_submitted": 13782, + "total_column_articles": 86, "frontend_question_id": "2126", "is_new_question": false }, @@ -9987,8 +10218,8 @@ "question__title": "Number of Laser Beams in a Bank", "question__title_slug": "number-of-laser-beams-in-a-bank", "question__hide": false, - "total_acs": 7077, - "total_submitted": 8433, + "total_acs": 7166, + "total_submitted": 8537, "total_column_articles": 95, "frontend_question_id": "2125", "is_new_question": false @@ -10008,9 +10239,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": 8283, - "total_submitted": 11707, - "total_column_articles": 132, + "total_acs": 8391, + "total_submitted": 11861, + "total_column_articles": 133, "frontend_question_id": "2124", "is_new_question": false }, @@ -10029,8 +10260,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": 124, - "total_submitted": 296, + "total_acs": 132, + "total_submitted": 306, "total_column_articles": 7, "frontend_question_id": "2098", "is_new_question": false @@ -10050,8 +10281,8 @@ "question__title": "Recover the Original Array", "question__title_slug": "recover-the-original-array", "question__hide": false, - "total_acs": 3245, - "total_submitted": 7970, + "total_acs": 3257, + "total_submitted": 8010, "total_column_articles": 58, "frontend_question_id": "2122", "is_new_question": false @@ -10071,8 +10302,8 @@ "question__title": "Intervals Between Identical Elements", "question__title_slug": "intervals-between-identical-elements", "question__hide": false, - "total_acs": 5123, - "total_submitted": 14071, + "total_acs": 5183, + "total_submitted": 14220, "total_column_articles": 135, "frontend_question_id": "2121", "is_new_question": false @@ -10092,9 +10323,9 @@ "question__title": "Execution of All Suffix Instructions Staying in a Grid", "question__title_slug": "execution-of-all-suffix-instructions-staying-in-a-grid", "question__hide": false, - "total_acs": 6115, - "total_submitted": 7403, - "total_column_articles": 89, + "total_acs": 6171, + "total_submitted": 7480, + "total_column_articles": 90, "frontend_question_id": "2120", "is_new_question": false }, @@ -10113,9 +10344,9 @@ "question__title": "A Number After a Double Reversal", "question__title_slug": "a-number-after-a-double-reversal", "question__hide": false, - "total_acs": 9596, - "total_submitted": 12537, - "total_column_articles": 113, + "total_acs": 9716, + "total_submitted": 12724, + "total_column_articles": 117, "frontend_question_id": "2119", "is_new_question": false }, @@ -10134,9 +10365,9 @@ "question__title": "Longest Palindrome by Concatenating Two Letter Words", "question__title_slug": "longest-palindrome-by-concatenating-two-letter-words", "question__hide": false, - "total_acs": 4060, - "total_submitted": 10651, - "total_column_articles": 91, + "total_acs": 4108, + "total_submitted": 10758, + "total_column_articles": 92, "frontend_question_id": "2131", "is_new_question": false }, @@ -10155,8 +10386,8 @@ "question__title": "Maximum Twin Sum of a Linked List", "question__title_slug": "maximum-twin-sum-of-a-linked-list", "question__hide": false, - "total_acs": 5523, - "total_submitted": 6644, + "total_acs": 5642, + "total_submitted": 6798, "total_column_articles": 84, "frontend_question_id": "2130", "is_new_question": false @@ -10176,9 +10407,9 @@ "question__title": "Capitalize the Title", "question__title_slug": "capitalize-the-title", "question__hide": false, - "total_acs": 5498, - "total_submitted": 8919, - "total_column_articles": 93, + "total_acs": 5592, + "total_submitted": 9077, + "total_column_articles": 96, "frontend_question_id": "2129", "is_new_question": false }, @@ -10197,8 +10428,8 @@ "question__title": "Minimum Operations to Make the Array K-Increasing", "question__title_slug": "minimum-operations-to-make-the-array-k-increasing", "question__hide": false, - "total_acs": 3840, - "total_submitted": 11595, + "total_acs": 3859, + "total_submitted": 11643, "total_column_articles": 86, "frontend_question_id": "2111", "is_new_question": false @@ -10218,9 +10449,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": 7158, - "total_submitted": 13877, - "total_column_articles": 125, + "total_acs": 7263, + "total_submitted": 14047, + "total_column_articles": 126, "frontend_question_id": "2110", "is_new_question": false }, @@ -10239,9 +10470,9 @@ "question__title": "Adding Spaces to a String", "question__title_slug": "adding-spaces-to-a-string", "question__hide": false, - "total_acs": 7345, - "total_submitted": 12021, - "total_column_articles": 95, + "total_acs": 7417, + "total_submitted": 12142, + "total_column_articles": 96, "frontend_question_id": "2109", "is_new_question": false }, @@ -10260,9 +10491,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": 8925, - "total_submitted": 11256, - "total_column_articles": 133, + "total_acs": 9097, + "total_submitted": 11468, + "total_column_articles": 134, "frontend_question_id": "2108", "is_new_question": false }, @@ -10281,9 +10512,9 @@ "question__title": "Minimum Cost to Reach City With Discounts", "question__title_slug": "minimum-cost-to-reach-city-with-discounts", "question__hide": false, - "total_acs": 158, - "total_submitted": 263, - "total_column_articles": 8, + "total_acs": 189, + "total_submitted": 297, + "total_column_articles": 9, "frontend_question_id": "2093", "is_new_question": false }, @@ -10302,9 +10533,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": 3795, - "total_submitted": 11550, - "total_column_articles": 80, + "total_acs": 3825, + "total_submitted": 11610, + "total_column_articles": 82, "frontend_question_id": "2106", "is_new_question": false }, @@ -10323,8 +10554,8 @@ "question__title": "Watering Plants II", "question__title_slug": "watering-plants-ii", "question__hide": false, - "total_acs": 5270, - "total_submitted": 9685, + "total_acs": 5314, + "total_submitted": 9758, "total_column_articles": 86, "frontend_question_id": "2105", "is_new_question": false @@ -10344,9 +10575,9 @@ "question__title": "Sum of Subarray Ranges", "question__title_slug": "sum-of-subarray-ranges", "question__hide": false, - "total_acs": 35575, - "total_submitted": 56735, - "total_column_articles": 336, + "total_acs": 35793, + "total_submitted": 57049, + "total_column_articles": 338, "frontend_question_id": "2104", "is_new_question": false }, @@ -10365,9 +10596,9 @@ "question__title": "Rings and Rods", "question__title_slug": "rings-and-rods", "question__hide": false, - "total_acs": 7698, - "total_submitted": 9570, - "total_column_articles": 140, + "total_acs": 7787, + "total_submitted": 9686, + "total_column_articles": 143, "frontend_question_id": "2103", "is_new_question": false }, @@ -10386,9 +10617,9 @@ "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": 243, - "total_submitted": 392, - "total_column_articles": 12, + "total_acs": 256, + "total_submitted": 410, + "total_column_articles": 13, "frontend_question_id": "2083", "is_new_question": false }, @@ -10407,9 +10638,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": 828, - "total_submitted": 992, - "total_column_articles": 25, + "total_acs": 867, + "total_submitted": 1048, + "total_column_articles": 26, "frontend_question_id": "2084", "is_new_question": false }, @@ -10428,8 +10659,8 @@ "question__title": "The Number of Rich Customers", "question__title_slug": "the-number-of-rich-customers", "question__hide": false, - "total_acs": 1186, - "total_submitted": 1551, + "total_acs": 1223, + "total_submitted": 1613, "total_column_articles": 21, "frontend_question_id": "2082", "is_new_question": false @@ -10449,8 +10680,8 @@ "question__title": "Abbreviating the Product of a Range", "question__title_slug": "abbreviating-the-product-of-a-range", "question__hide": false, - "total_acs": 1173, - "total_submitted": 3481, + "total_acs": 1176, + "total_submitted": 3503, "total_column_articles": 17, "frontend_question_id": "2117", "is_new_question": false @@ -10470,9 +10701,9 @@ "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": 2705, - "total_submitted": 8993, - "total_column_articles": 50, + "total_acs": 2734, + "total_submitted": 9075, + "total_column_articles": 51, "frontend_question_id": "2116", "is_new_question": false }, @@ -10491,8 +10722,8 @@ "question__title": "Find All Possible Recipes from Given Supplies", "question__title_slug": "find-all-possible-recipes-from-given-supplies", "question__hide": false, - "total_acs": 4036, - "total_submitted": 10513, + "total_acs": 4082, + "total_submitted": 10597, "total_column_articles": 88, "frontend_question_id": "2115", "is_new_question": false @@ -10512,9 +10743,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": 10053, - "total_submitted": 11669, - "total_column_articles": 132, + "total_acs": 10302, + "total_submitted": 11970, + "total_column_articles": 138, "frontend_question_id": "2114", "is_new_question": false }, @@ -10533,8 +10764,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": 107, - "total_submitted": 189, + "total_acs": 111, + "total_submitted": 198, "total_column_articles": 6, "frontend_question_id": "2077", "is_new_question": false @@ -10554,8 +10785,8 @@ "question__title": "Step-By-Step Directions From a Binary Tree Node to Another", "question__title_slug": "step-by-step-directions-from-a-binary-tree-node-to-another", "question__hide": false, - "total_acs": 5255, - "total_submitted": 12419, + "total_acs": 5304, + "total_submitted": 12528, "total_column_articles": 166, "frontend_question_id": "2096", "is_new_question": false @@ -10575,9 +10806,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": 8448, - "total_submitted": 14393, - "total_column_articles": 121, + "total_acs": 8658, + "total_submitted": 14766, + "total_column_articles": 124, "frontend_question_id": "2095", "is_new_question": false }, @@ -10596,9 +10827,9 @@ "question__title": "Finding 3-Digit Even Numbers", "question__title_slug": "finding-3-digit-even-numbers", "question__hide": false, - "total_acs": 7933, - "total_submitted": 14292, - "total_column_articles": 129, + "total_acs": 8052, + "total_submitted": 14493, + "total_column_articles": 130, "frontend_question_id": "2094", "is_new_question": false }, @@ -10617,9 +10848,9 @@ "question__title": "The Winner University", "question__title_slug": "the-winner-university", "question__hide": false, - "total_acs": 1085, - "total_submitted": 1571, - "total_column_articles": 18, + "total_acs": 1124, + "total_submitted": 1635, + "total_column_articles": 19, "frontend_question_id": "2072", "is_new_question": false }, @@ -10638,9 +10869,9 @@ "question__title": "Find All People With Secret", "question__title_slug": "find-all-people-with-secret", "question__hide": false, - "total_acs": 4516, - "total_submitted": 16487, - "total_column_articles": 113, + "total_acs": 4579, + "total_submitted": 16628, + "total_column_articles": 114, "frontend_question_id": "2092", "is_new_question": false }, @@ -10659,9 +10890,9 @@ "question__title": "Removing Minimum and Maximum From Array", "question__title_slug": "removing-minimum-and-maximum-from-array", "question__hide": false, - "total_acs": 6295, - "total_submitted": 11088, - "total_column_articles": 122, + "total_acs": 6346, + "total_submitted": 11181, + "total_column_articles": 124, "frontend_question_id": "2091", "is_new_question": false }, @@ -10680,8 +10911,8 @@ "question__title": "K Radius Subarray Averages", "question__title_slug": "k-radius-subarray-averages", "question__hide": false, - "total_acs": 6233, - "total_submitted": 17391, + "total_acs": 6269, + "total_submitted": 17466, "total_column_articles": 95, "frontend_question_id": "2090", "is_new_question": false @@ -10701,9 +10932,9 @@ "question__title": "Find Target Indices After Sorting Array", "question__title_slug": "find-target-indices-after-sorting-array", "question__hide": false, - "total_acs": 10827, - "total_submitted": 13334, - "total_column_articles": 141, + "total_acs": 11107, + "total_submitted": 13702, + "total_column_articles": 148, "frontend_question_id": "2089", "is_new_question": false }, @@ -10722,9 +10953,9 @@ "question__title": "Number of Equal Count Substrings", "question__title_slug": "number-of-equal-count-substrings", "question__hide": false, - "total_acs": 103, - "total_submitted": 210, - "total_column_articles": 8, + "total_acs": 107, + "total_submitted": 216, + "total_column_articles": 9, "frontend_question_id": "2067", "is_new_question": false }, @@ -10743,9 +10974,9 @@ "question__title": "Account Balance", "question__title_slug": "account-balance", "question__hide": false, - "total_acs": 788, - "total_submitted": 980, - "total_column_articles": 19, + "total_acs": 827, + "total_submitted": 1035, + "total_column_articles": 20, "frontend_question_id": "2066", "is_new_question": false }, @@ -10764,9 +10995,9 @@ "question__title": "Sequentially Ordinal Rank Tracker", "question__title_slug": "sequentially-ordinal-rank-tracker", "question__hide": false, - "total_acs": 2218, - "total_submitted": 4137, - "total_column_articles": 66, + "total_acs": 2237, + "total_submitted": 4179, + "total_column_articles": 67, "frontend_question_id": "2102", "is_new_question": false }, @@ -10785,8 +11016,8 @@ "question__title": "Detonate the Maximum Bombs", "question__title_slug": "detonate-the-maximum-bombs", "question__hide": false, - "total_acs": 3311, - "total_submitted": 8615, + "total_acs": 3364, + "total_submitted": 8749, "total_column_articles": 78, "frontend_question_id": "2101", "is_new_question": false @@ -10806,8 +11037,8 @@ "question__title": "Find Good Days to Rob the Bank", "question__title_slug": "find-good-days-to-rob-the-bank", "question__hide": false, - "total_acs": 32030, - "total_submitted": 65912, + "total_acs": 32131, + "total_submitted": 66095, "total_column_articles": 402, "frontend_question_id": "2100", "is_new_question": false @@ -10827,9 +11058,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": 5459, - "total_submitted": 11278, - "total_column_articles": 117, + "total_acs": 5537, + "total_submitted": 11426, + "total_column_articles": 119, "frontend_question_id": "2099", "is_new_question": false }, @@ -10848,9 +11079,9 @@ "question__title": "Number of Spaces Cleaning Robot Cleaned", "question__title_slug": "number-of-spaces-cleaning-robot-cleaned", "question__hide": false, - "total_acs": 244, - "total_submitted": 495, - "total_column_articles": 12, + "total_acs": 266, + "total_submitted": 534, + "total_column_articles": 13, "frontend_question_id": "2061", "is_new_question": false }, @@ -10869,8 +11100,8 @@ "question__title": "Sum of k-Mirror Numbers", "question__title_slug": "sum-of-k-mirror-numbers", "question__hide": false, - "total_acs": 2654, - "total_submitted": 6340, + "total_acs": 2679, + "total_submitted": 6374, "total_column_articles": 70, "frontend_question_id": "2081", "is_new_question": false @@ -10890,9 +11121,9 @@ "question__title": "Valid Arrangement of Pairs", "question__title_slug": "valid-arrangement-of-pairs", "question__hide": false, - "total_acs": 2059, - "total_submitted": 5784, - "total_column_articles": 46, + "total_acs": 2072, + "total_submitted": 5818, + "total_column_articles": 47, "frontend_question_id": "2097", "is_new_question": false }, @@ -10911,8 +11142,8 @@ "question__title": "Stamping the Grid", "question__title_slug": "stamping-the-grid", "question__hide": false, - "total_acs": 1822, - "total_submitted": 7208, + "total_acs": 1841, + "total_submitted": 7235, "total_column_articles": 46, "frontend_question_id": "2132", "is_new_question": false @@ -10932,9 +11163,9 @@ "question__title": "Two Furthest Houses With Different Colors", "question__title_slug": "two-furthest-houses-with-different-colors", "question__hide": false, - "total_acs": 8300, - "total_submitted": 11266, - "total_column_articles": 127, + "total_acs": 8415, + "total_submitted": 11443, + "total_column_articles": 130, "frontend_question_id": "2078", "is_new_question": false }, @@ -10953,8 +11184,8 @@ "question__title": "Process Restricted Friend Requests", "question__title_slug": "process-restricted-friend-requests", "question__hide": false, - "total_acs": 2908, - "total_submitted": 5826, + "total_acs": 2940, + "total_submitted": 5883, "total_column_articles": 72, "frontend_question_id": "2076", "is_new_question": false @@ -10974,8 +11205,8 @@ "question__title": "Decode the Slanted Ciphertext", "question__title_slug": "decode-the-slanted-ciphertext", "question__hide": false, - "total_acs": 3729, - "total_submitted": 8068, + "total_acs": 3745, + "total_submitted": 8099, "total_column_articles": 69, "frontend_question_id": "2075", "is_new_question": false @@ -10995,8 +11226,8 @@ "question__title": "Reverse Nodes in Even Length Groups", "question__title_slug": "reverse-nodes-in-even-length-groups", "question__hide": false, - "total_acs": 4752, - "total_submitted": 11025, + "total_acs": 4813, + "total_submitted": 11157, "total_column_articles": 128, "frontend_question_id": "2074", "is_new_question": false @@ -11016,9 +11247,9 @@ "question__title": "Time Needed to Buy Tickets", "question__title_slug": "time-needed-to-buy-tickets", "question__hide": false, - "total_acs": 8143, - "total_submitted": 13104, - "total_column_articles": 135, + "total_acs": 8244, + "total_submitted": 13248, + "total_column_articles": 137, "frontend_question_id": "2073", "is_new_question": false }, @@ -11037,9 +11268,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": 613, - "total_submitted": 902, - "total_column_articles": 12, + "total_acs": 636, + "total_submitted": 946, + "total_column_articles": 13, "frontend_question_id": "2051", "is_new_question": false }, @@ -11058,9 +11289,9 @@ "question__title": "Count Fertile Pyramids in a Land", "question__title_slug": "count-fertile-pyramids-in-a-land", "question__hide": false, - "total_acs": 1828, - "total_submitted": 2917, - "total_column_articles": 45, + "total_acs": 1836, + "total_submitted": 2932, + "total_column_articles": 46, "frontend_question_id": "2088", "is_new_question": false }, @@ -11079,8 +11310,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": 2790, - "total_submitted": 5792, + "total_acs": 2816, + "total_submitted": 5835, "total_column_articles": 65, "frontend_question_id": "2087", "is_new_question": false @@ -11100,9 +11331,9 @@ "question__title": "Minimum Number of Buckets Required to Collect Rainwater from Houses", "question__title_slug": "minimum-number-of-buckets-required-to-collect-rainwater-from-houses", "question__hide": false, - "total_acs": 3716, - "total_submitted": 8196, - "total_column_articles": 76, + "total_acs": 3767, + "total_submitted": 8299, + "total_column_articles": 77, "frontend_question_id": "2086", "is_new_question": false }, @@ -11121,9 +11352,9 @@ "question__title": "Count Common Words With One Occurrence", "question__title_slug": "count-common-words-with-one-occurrence", "question__hide": false, - "total_acs": 5286, - "total_submitted": 7257, - "total_column_articles": 91, + "total_acs": 5356, + "total_submitted": 7361, + "total_column_articles": 94, "frontend_question_id": "2085", "is_new_question": false }, @@ -11142,8 +11373,8 @@ "question__title": "Maximum Path Quality of a Graph", "question__title_slug": "maximum-path-quality-of-a-graph", "question__hide": false, - "total_acs": 2295, - "total_submitted": 4277, + "total_acs": 2310, + "total_submitted": 4325, "total_column_articles": 62, "frontend_question_id": "2065", "is_new_question": false @@ -11163,8 +11394,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": 4245, - "total_submitted": 9913, + "total_acs": 4277, + "total_submitted": 10001, "total_column_articles": 83, "frontend_question_id": "2064", "is_new_question": false @@ -11184,9 +11415,9 @@ "question__title": "Vowels of All Substrings", "question__title_slug": "vowels-of-all-substrings", "question__hide": false, - "total_acs": 4869, - "total_submitted": 9792, - "total_column_articles": 109, + "total_acs": 4950, + "total_submitted": 9923, + "total_column_articles": 110, "frontend_question_id": "2063", "is_new_question": false }, @@ -11205,9 +11436,9 @@ "question__title": "Count Vowel Substrings of a String", "question__title_slug": "count-vowel-substrings-of-a-string", "question__hide": false, - "total_acs": 6296, - "total_submitted": 10259, - "total_column_articles": 109, + "total_acs": 6373, + "total_submitted": 10379, + "total_column_articles": 110, "frontend_question_id": "2062", "is_new_question": false }, @@ -11226,8 +11457,8 @@ "question__title": "Accepted Candidates From the Interviews", "question__title_slug": "accepted-candidates-from-the-interviews", "question__hide": false, - "total_acs": 801, - "total_submitted": 1093, + "total_acs": 847, + "total_submitted": 1148, "total_column_articles": 20, "frontend_question_id": "2041", "is_new_question": false @@ -11247,9 +11478,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": 1198, - "total_submitted": 3191, - "total_column_articles": 22, + "total_acs": 1209, + "total_submitted": 3215, + "total_column_articles": 23, "frontend_question_id": "2060", "is_new_question": false }, @@ -11268,8 +11499,8 @@ "question__title": "Minimum Operations to Convert Number", "question__title_slug": "minimum-operations-to-convert-number", "question__hide": false, - "total_acs": 4800, - "total_submitted": 10831, + "total_acs": 4825, + "total_submitted": 10877, "total_column_articles": 101, "frontend_question_id": "2059", "is_new_question": false @@ -11289,8 +11520,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": 5957, - "total_submitted": 10508, + "total_acs": 6002, + "total_submitted": 10631, "total_column_articles": 83, "frontend_question_id": "2058", "is_new_question": false @@ -11310,8 +11541,8 @@ "question__title": "Smallest Index With Equal Value", "question__title_slug": "smallest-index-with-equal-value", "question__hide": false, - "total_acs": 8188, - "total_submitted": 10640, + "total_acs": 8271, + "total_submitted": 10753, "total_column_articles": 72, "frontend_question_id": "2057", "is_new_question": false @@ -11331,8 +11562,8 @@ "question__title": "Maximum Number of Tasks You Can Assign", "question__title_slug": "maximum-number-of-tasks-you-can-assign", "question__hide": false, - "total_acs": 1475, - "total_submitted": 4146, + "total_acs": 1508, + "total_submitted": 4223, "total_column_articles": 38, "frontend_question_id": "2071", "is_new_question": false @@ -11352,8 +11583,8 @@ "question__title": "Most Beautiful Item for Each Query", "question__title_slug": "most-beautiful-item-for-each-query", "question__hide": false, - "total_acs": 2900, - "total_submitted": 6694, + "total_acs": 2938, + "total_submitted": 6760, "total_column_articles": 94, "frontend_question_id": "2070", "is_new_question": false @@ -11373,8 +11604,8 @@ "question__title": "Walking Robot Simulation II", "question__title_slug": "walking-robot-simulation-ii", "question__hide": false, - "total_acs": 3192, - "total_submitted": 15619, + "total_acs": 3248, + "total_submitted": 15813, "total_column_articles": 92, "frontend_question_id": "2069", "is_new_question": false @@ -11394,9 +11625,9 @@ "question__title": "Check Whether Two Strings are Almost Equivalent", "question__title_slug": "check-whether-two-strings-are-almost-equivalent", "question__hide": false, - "total_acs": 5232, - "total_submitted": 7317, - "total_column_articles": 96, + "total_acs": 5327, + "total_submitted": 7443, + "total_column_articles": 99, "frontend_question_id": "2068", "is_new_question": false }, @@ -11415,9 +11646,9 @@ "question__title": "Parallel Courses III", "question__title_slug": "parallel-courses-iii", "question__hide": false, - "total_acs": 2651, - "total_submitted": 4636, - "total_column_articles": 85, + "total_acs": 2676, + "total_submitted": 4672, + "total_column_articles": 86, "frontend_question_id": "2050", "is_new_question": false }, @@ -11436,8 +11667,8 @@ "question__title": "Count Nodes With the Highest Score", "question__title_slug": "count-nodes-with-the-highest-score", "question__hide": false, - "total_acs": 25070, - "total_submitted": 48465, + "total_acs": 25116, + "total_submitted": 48558, "total_column_articles": 296, "frontend_question_id": "2049", "is_new_question": false @@ -11457,9 +11688,9 @@ "question__title": "Next Greater Numerically Balanced Number", "question__title_slug": "next-greater-numerically-balanced-number", "question__hide": false, - "total_acs": 4691, - "total_submitted": 10966, - "total_column_articles": 100, + "total_acs": 4735, + "total_submitted": 11047, + "total_column_articles": 101, "frontend_question_id": "2048", "is_new_question": false }, @@ -11478,9 +11709,9 @@ "question__title": "Number of Valid Words in a Sentence", "question__title_slug": "number-of-valid-words-in-a-sentence", "question__hide": false, - "total_acs": 25950, - "total_submitted": 66238, - "total_column_articles": 389, + "total_acs": 26036, + "total_submitted": 66567, + "total_column_articles": 390, "frontend_question_id": "2047", "is_new_question": false }, @@ -11499,8 +11730,8 @@ "question__title": "Low-Quality Problems", "question__title_slug": "low-quality-problems", "question__hide": false, - "total_acs": 2029, - "total_submitted": 2515, + "total_acs": 2108, + "total_submitted": 2610, "total_column_articles": 26, "frontend_question_id": "2026", "is_new_question": false @@ -11520,8 +11751,8 @@ "question__title": "Second Minimum Time to Reach Destination", "question__title_slug": "second-minimum-time-to-reach-destination", "question__hide": false, - "total_acs": 15592, - "total_submitted": 29051, + "total_acs": 15631, + "total_submitted": 29124, "total_column_articles": 156, "frontend_question_id": "2045", "is_new_question": false @@ -11541,8 +11772,8 @@ "question__title": "Count Number of Maximum Bitwise-OR Subsets", "question__title_slug": "count-number-of-maximum-bitwise-or-subsets", "question__hide": false, - "total_acs": 33244, - "total_submitted": 40601, + "total_acs": 33356, + "total_submitted": 40735, "total_column_articles": 366, "frontend_question_id": "2044", "is_new_question": false @@ -11562,8 +11793,8 @@ "question__title": "Simple Bank System", "question__title_slug": "simple-bank-system", "question__hide": false, - "total_acs": 32154, - "total_submitted": 47585, + "total_acs": 32246, + "total_submitted": 47735, "total_column_articles": 282, "frontend_question_id": "2043", "is_new_question": false @@ -11583,9 +11814,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": 9118, - "total_submitted": 13769, - "total_column_articles": 153, + "total_acs": 9185, + "total_submitted": 13913, + "total_column_articles": 154, "frontend_question_id": "2042", "is_new_question": false }, @@ -11604,9 +11835,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": 745, - "total_submitted": 1023, - "total_column_articles": 19, + "total_acs": 782, + "total_submitted": 1071, + "total_column_articles": 20, "frontend_question_id": "2020", "is_new_question": false }, @@ -11625,8 +11856,8 @@ "question__title": "Number of Valid Move Combinations On Chessboard", "question__title_slug": "number-of-valid-move-combinations-on-chessboard", "question__hide": false, - "total_acs": 796, - "total_submitted": 1311, + "total_acs": 804, + "total_submitted": 1319, "total_column_articles": 17, "frontend_question_id": "2056", "is_new_question": false @@ -11646,9 +11877,9 @@ "question__title": "Plates Between Candles", "question__title_slug": "plates-between-candles", "question__hide": false, - "total_acs": 31697, - "total_submitted": 73295, - "total_column_articles": 413, + "total_acs": 31772, + "total_submitted": 73468, + "total_column_articles": 412, "frontend_question_id": "2055", "is_new_question": false }, @@ -11667,8 +11898,8 @@ "question__title": "Two Best Non-Overlapping Events", "question__title_slug": "two-best-non-overlapping-events", "question__hide": false, - "total_acs": 3172, - "total_submitted": 9009, + "total_acs": 3220, + "total_submitted": 9097, "total_column_articles": 68, "frontend_question_id": "2054", "is_new_question": false @@ -11688,9 +11919,9 @@ "question__title": "Kth Distinct String in an Array", "question__title_slug": "kth-distinct-string-in-an-array", "question__hide": false, - "total_acs": 5969, - "total_submitted": 8198, - "total_column_articles": 90, + "total_acs": 6090, + "total_submitted": 8355, + "total_column_articles": 96, "frontend_question_id": "2053", "is_new_question": false }, @@ -11709,8 +11940,8 @@ "question__title": "Partition Array Into Two Arrays to Minimize Sum Difference", "question__title_slug": "partition-array-into-two-arrays-to-minimize-sum-difference", "question__hide": false, - "total_acs": 2422, - "total_submitted": 7498, + "total_acs": 2437, + "total_submitted": 7554, "total_column_articles": 50, "frontend_question_id": "2035", "is_new_question": false @@ -11730,8 +11961,8 @@ "question__title": "Stock Price Fluctuation ", "question__title_slug": "stock-price-fluctuation", "question__hide": false, - "total_acs": 20920, - "total_submitted": 44600, + "total_acs": 21005, + "total_submitted": 44816, "total_column_articles": 219, "frontend_question_id": "2034", "is_new_question": false @@ -11751,8 +11982,8 @@ "question__title": "Minimum Operations to Make a Uni-Value Grid", "question__title_slug": "minimum-operations-to-make-a-uni-value-grid", "question__hide": false, - "total_acs": 5047, - "total_submitted": 12404, + "total_acs": 5083, + "total_submitted": 12470, "total_column_articles": 100, "frontend_question_id": "2033", "is_new_question": false @@ -11772,9 +12003,9 @@ "question__title": "Two Out of Three", "question__title_slug": "two-out-of-three", "question__hide": false, - "total_acs": 8137, - "total_submitted": 12372, - "total_column_articles": 147, + "total_acs": 8224, + "total_submitted": 12510, + "total_column_articles": 149, "frontend_question_id": "2032", "is_new_question": false }, @@ -11793,9 +12024,9 @@ "question__title": "The Number of Seniors and Juniors to Join the Company II", "question__title_slug": "the-number-of-seniors-and-juniors-to-join-the-company-ii", "question__hide": false, - "total_acs": 417, - "total_submitted": 674, - "total_column_articles": 13, + "total_acs": 456, + "total_submitted": 719, + "total_column_articles": 16, "frontend_question_id": "2010", "is_new_question": false }, @@ -11814,9 +12045,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": 1582, - "total_submitted": 4588, - "total_column_articles": 47, + "total_acs": 1595, + "total_submitted": 4615, + "total_column_articles": 48, "frontend_question_id": "2030", "is_new_question": false }, @@ -11835,9 +12066,9 @@ "question__title": "Stone Game IX", "question__title_slug": "stone-game-ix", "question__hide": false, - "total_acs": 19385, - "total_submitted": 41098, - "total_column_articles": 195, + "total_acs": 19415, + "total_submitted": 41157, + "total_column_articles": 196, "frontend_question_id": "2029", "is_new_question": false }, @@ -11856,9 +12087,9 @@ "question__title": "Find Missing Observations", "question__title_slug": "find-missing-observations", "question__hide": false, - "total_acs": 32735, - "total_submitted": 64616, - "total_column_articles": 381, + "total_acs": 32782, + "total_submitted": 64728, + "total_column_articles": 380, "frontend_question_id": "2028", "is_new_question": false }, @@ -11877,8 +12108,8 @@ "question__title": "Minimum Moves to Convert String", "question__title_slug": "minimum-moves-to-convert-string", "question__hide": false, - "total_acs": 6735, - "total_submitted": 11737, + "total_acs": 6824, + "total_submitted": 11903, "total_column_articles": 90, "frontend_question_id": "2027", "is_new_question": false @@ -11919,9 +12150,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": 507, - "total_submitted": 1225, - "total_column_articles": 17, + "total_acs": 534, + "total_submitted": 1278, + "total_column_articles": 19, "frontend_question_id": "2004", "is_new_question": false }, @@ -11940,8 +12171,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": 19355, - "total_submitted": 34693, + "total_acs": 19386, + "total_submitted": 34762, "total_column_articles": 177, "frontend_question_id": "2039", "is_new_question": false @@ -11961,8 +12192,8 @@ "question__title": "Kth Smallest Product of Two Sorted Arrays", "question__title_slug": "kth-smallest-product-of-two-sorted-arrays", "question__hide": false, - "total_acs": 1368, - "total_submitted": 4139, + "total_acs": 1377, + "total_submitted": 4170, "total_column_articles": 25, "frontend_question_id": "2040", "is_new_question": false @@ -11982,8 +12213,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": 33296, - "total_submitted": 52294, + "total_acs": 33386, + "total_submitted": 52439, "total_column_articles": 440, "frontend_question_id": "2038", "is_new_question": false @@ -12003,9 +12234,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": 5691, - "total_submitted": 6921, - "total_column_articles": 86, + "total_acs": 5819, + "total_submitted": 7086, + "total_column_articles": 87, "frontend_question_id": "2037", "is_new_question": false }, @@ -12024,8 +12255,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": 1428, - "total_submitted": 3968, + "total_acs": 1441, + "total_submitted": 4001, "total_column_articles": 39, "frontend_question_id": "2019", "is_new_question": false @@ -12045,9 +12276,9 @@ "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": 2482, - "total_submitted": 5969, - "total_column_articles": 56, + "total_acs": 2503, + "total_submitted": 6011, + "total_column_articles": 55, "frontend_question_id": "2018", "is_new_question": false }, @@ -12066,8 +12297,8 @@ "question__title": "Grid Game", "question__title_slug": "grid-game", "question__hide": false, - "total_acs": 4568, - "total_submitted": 12430, + "total_acs": 4614, + "total_submitted": 12531, "total_column_articles": 113, "frontend_question_id": "2017", "is_new_question": false @@ -12087,9 +12318,9 @@ "question__title": "Maximum Difference Between Increasing Elements", "question__title_slug": "maximum-difference-between-increasing-elements", "question__hide": false, - "total_acs": 39640, - "total_submitted": 65765, - "total_column_articles": 455, + "total_acs": 40014, + "total_submitted": 66439, + "total_column_articles": 456, "frontend_question_id": "2016", "is_new_question": false }, @@ -12108,8 +12339,8 @@ "question__title": "Count the Number of Experiments", "question__title_slug": "count-the-number-of-experiments", "question__hide": false, - "total_acs": 1222, - "total_submitted": 2479, + "total_acs": 1249, + "total_submitted": 2563, "total_column_articles": 19, "frontend_question_id": "1990", "is_new_question": false @@ -12129,8 +12360,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": 128, - "total_submitted": 228, + "total_acs": 134, + "total_submitted": 235, "total_column_articles": 9, "frontend_question_id": "2015", "is_new_question": false @@ -12150,8 +12381,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": 143, - "total_submitted": 314, + "total_acs": 147, + "total_submitted": 321, "total_column_articles": 11, "frontend_question_id": "1999", "is_new_question": false @@ -12171,8 +12402,8 @@ "question__title": "Longest Subsequence Repeated k Times", "question__title_slug": "longest-subsequence-repeated-k-times", "question__hide": false, - "total_acs": 1783, - "total_submitted": 3310, + "total_acs": 1814, + "total_submitted": 3358, "total_column_articles": 27, "frontend_question_id": "2014", "is_new_question": false @@ -12192,9 +12423,9 @@ "question__title": "Detect Squares", "question__title_slug": "detect-squares", "question__hide": false, - "total_acs": 19780, - "total_submitted": 34967, - "total_column_articles": 228, + "total_acs": 19803, + "total_submitted": 35016, + "total_column_articles": 229, "frontend_question_id": "2013", "is_new_question": false }, @@ -12213,8 +12444,8 @@ "question__title": "Sum of Beauty in the Array", "question__title_slug": "sum-of-beauty-in-the-array", "question__hide": false, - "total_acs": 4909, - "total_submitted": 13205, + "total_acs": 4934, + "total_submitted": 13252, "total_column_articles": 88, "frontend_question_id": "2012", "is_new_question": false @@ -12234,9 +12465,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": 13671, - "total_submitted": 15782, - "total_column_articles": 144, + "total_acs": 13928, + "total_submitted": 16089, + "total_column_articles": 149, "frontend_question_id": "2011", "is_new_question": false }, @@ -12255,9 +12486,9 @@ "question__title": "Find Cutoff Score for Each School", "question__title_slug": "find-cutoff-score-for-each-school", "question__hide": false, - "total_acs": 1397, - "total_submitted": 2100, - "total_column_articles": 24, + "total_acs": 1482, + "total_submitted": 2221, + "total_column_articles": 26, "frontend_question_id": "1988", "is_new_question": false }, @@ -12276,8 +12507,8 @@ "question__title": "Maximum Number of Ways to Partition an Array", "question__title_slug": "maximum-number-of-ways-to-partition-an-array", "question__hide": false, - "total_acs": 1662, - "total_submitted": 5971, + "total_acs": 1678, + "total_submitted": 6003, "total_column_articles": 48, "frontend_question_id": "2025", "is_new_question": false @@ -12297,9 +12528,9 @@ "question__title": "Maximize the Confusion of an Exam", "question__title_slug": "maximize-the-confusion-of-an-exam", "question__hide": false, - "total_acs": 33634, - "total_submitted": 58769, - "total_column_articles": 387, + "total_acs": 33838, + "total_submitted": 59070, + "total_column_articles": 388, "frontend_question_id": "2024", "is_new_question": false }, @@ -12318,8 +12549,8 @@ "question__title": "Number of Pairs of Strings With Concatenation Equal to Target", "question__title_slug": "number-of-pairs-of-strings-with-concatenation-equal-to-target", "question__hide": false, - "total_acs": 4284, - "total_submitted": 5824, + "total_acs": 4338, + "total_submitted": 5896, "total_column_articles": 76, "frontend_question_id": "2023", "is_new_question": false @@ -12339,9 +12570,9 @@ "question__title": "Convert 1D Array Into 2D Array", "question__title_slug": "convert-1d-array-into-2d-array", "question__hide": false, - "total_acs": 35704, - "total_submitted": 53492, - "total_column_articles": 419, + "total_acs": 35816, + "total_submitted": 53697, + "total_column_articles": 420, "frontend_question_id": "2022", "is_new_question": false }, @@ -12360,8 +12591,8 @@ "question__title": "Smallest Missing Genetic Value in Each Subtree", "question__title_slug": "smallest-missing-genetic-value-in-each-subtree", "question__hide": false, - "total_acs": 2273, - "total_submitted": 5604, + "total_acs": 2284, + "total_submitted": 5633, "total_column_articles": 48, "frontend_question_id": "2003", "is_new_question": false @@ -12381,8 +12612,8 @@ "question__title": "Maximum Product of the Length of Two Palindromic Subsequences", "question__title_slug": "maximum-product-of-the-length-of-two-palindromic-subsequences", "question__hide": false, - "total_acs": 4584, - "total_submitted": 7738, + "total_acs": 4621, + "total_submitted": 7788, "total_column_articles": 99, "frontend_question_id": "2002", "is_new_question": false @@ -12402,9 +12633,9 @@ "question__title": "Number of Pairs of Interchangeable Rectangles", "question__title_slug": "number-of-pairs-of-interchangeable-rectangles", "question__hide": false, - "total_acs": 6872, - "total_submitted": 18550, - "total_column_articles": 140, + "total_acs": 6910, + "total_submitted": 18621, + "total_column_articles": 141, "frontend_question_id": "2001", "is_new_question": false }, @@ -12423,8 +12654,8 @@ "question__title": "Reverse Prefix of Word", "question__title_slug": "reverse-prefix-of-word", "question__hide": false, - "total_acs": 31364, - "total_submitted": 39440, + "total_acs": 31539, + "total_submitted": 39677, "total_column_articles": 386, "frontend_question_id": "2000", "is_new_question": false @@ -12444,8 +12675,8 @@ "question__title": "Employees Whose Manager Left the Company", "question__title_slug": "employees-whose-manager-left-the-company", "question__hide": false, - "total_acs": 1445, - "total_submitted": 2761, + "total_acs": 1478, + "total_submitted": 2839, "total_column_articles": 21, "frontend_question_id": "1978", "is_new_question": false @@ -12465,8 +12696,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": 225, - "total_submitted": 373, + "total_acs": 230, + "total_submitted": 378, "total_column_articles": 12, "frontend_question_id": "1973", "is_new_question": false @@ -12486,8 +12717,8 @@ "question__title": "GCD Sort of an Array", "question__title_slug": "gcd-sort-of-an-array", "question__hide": false, - "total_acs": 1996, - "total_submitted": 4641, + "total_acs": 2015, + "total_submitted": 4676, "total_column_articles": 37, "frontend_question_id": "1998", "is_new_question": false @@ -12507,9 +12738,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": 2698, - "total_submitted": 7861, - "total_column_articles": 43, + "total_acs": 2713, + "total_submitted": 7920, + "total_column_articles": 44, "frontend_question_id": "1997", "is_new_question": false }, @@ -12528,9 +12759,9 @@ "question__title": "The Number of Weak Characters in the Game", "question__title_slug": "the-number-of-weak-characters-in-the-game", "question__hide": false, - "total_acs": 26627, - "total_submitted": 64332, - "total_column_articles": 275, + "total_acs": 26741, + "total_submitted": 64585, + "total_column_articles": 277, "frontend_question_id": "1996", "is_new_question": false }, @@ -12549,8 +12780,8 @@ "question__title": "Count Special Quadruplets", "question__title_slug": "count-special-quadruplets", "question__hide": false, - "total_acs": 33853, - "total_submitted": 51083, + "total_acs": 33948, + "total_submitted": 51209, "total_column_articles": 244, "frontend_question_id": "1995", "is_new_question": false @@ -12570,9 +12801,9 @@ "question__title": "Find if Path Exists in Graph", "question__title_slug": "find-if-path-exists-in-graph", "question__hide": false, - "total_acs": 3445, - "total_submitted": 7806, - "total_column_articles": 77, + "total_acs": 3559, + "total_submitted": 8089, + "total_column_articles": 80, "frontend_question_id": "1971", "is_new_question": false }, @@ -12591,8 +12822,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": 747, - "total_submitted": 1608, + "total_acs": 786, + "total_submitted": 1693, "total_column_articles": 19, "frontend_question_id": "1972", "is_new_question": false @@ -12612,8 +12843,8 @@ "question__title": "Minimum Number of Operations to Make Array Continuous", "question__title_slug": "minimum-number-of-operations-to-make-array-continuous", "question__hide": false, - "total_acs": 1875, - "total_submitted": 4538, + "total_acs": 1898, + "total_submitted": 4588, "total_column_articles": 48, "frontend_question_id": "2009", "is_new_question": false @@ -12633,8 +12864,8 @@ "question__title": "Maximum Earnings From Taxi", "question__title_slug": "maximum-earnings-from-taxi", "question__hide": false, - "total_acs": 3643, - "total_submitted": 8338, + "total_acs": 3698, + "total_submitted": 8436, "total_column_articles": 60, "frontend_question_id": "2008", "is_new_question": false @@ -12654,9 +12885,9 @@ "question__title": "Find Original Array From Doubled Array", "question__title_slug": "find-original-array-from-doubled-array", "question__hide": false, - "total_acs": 4675, - "total_submitted": 14273, - "total_column_articles": 92, + "total_acs": 4736, + "total_submitted": 14417, + "total_column_articles": 93, "frontend_question_id": "2007", "is_new_question": false }, @@ -12675,9 +12906,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": 43502, - "total_submitted": 50858, - "total_column_articles": 441, + "total_acs": 43838, + "total_submitted": 51292, + "total_column_articles": 442, "frontend_question_id": "2006", "is_new_question": false }, @@ -12696,9 +12927,9 @@ "question__title": "Number of Unique Good Subsequences", "question__title_slug": "number-of-unique-good-subsequences", "question__hide": false, - "total_acs": 1755, - "total_submitted": 3616, - "total_column_articles": 28, + "total_acs": 1771, + "total_submitted": 3639, + "total_column_articles": 29, "frontend_question_id": "1987", "is_new_question": false }, @@ -12717,8 +12948,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": 4659, - "total_submitted": 15704, + "total_acs": 4707, + "total_submitted": 15850, "total_column_articles": 83, "frontend_question_id": "1986", "is_new_question": false @@ -12738,9 +12969,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": 7854, - "total_submitted": 18870, - "total_column_articles": 112, + "total_acs": 7913, + "total_submitted": 19003, + "total_column_articles": 113, "frontend_question_id": "1985", "is_new_question": false }, @@ -12759,9 +12990,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": 38514, - "total_submitted": 61239, - "total_column_articles": 468, + "total_acs": 38692, + "total_submitted": 61546, + "total_column_articles": 470, "frontend_question_id": "1984", "is_new_question": false }, @@ -12780,8 +13011,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": 110, - "total_submitted": 175, + "total_acs": 113, + "total_submitted": 181, "total_column_articles": 8, "frontend_question_id": "1966", "is_new_question": false @@ -12801,9 +13032,9 @@ "question__title": "Employees With Missing Information", "question__title_slug": "employees-with-missing-information", "question__hide": false, - "total_acs": 5329, - "total_submitted": 7075, - "total_column_articles": 53, + "total_acs": 6449, + "total_submitted": 8547, + "total_column_articles": 65, "frontend_question_id": "1965", "is_new_question": false }, @@ -12822,8 +13053,8 @@ "question__title": "Find Array Given Subset Sums", "question__title_slug": "find-array-given-subset-sums", "question__hide": false, - "total_acs": 1059, - "total_submitted": 2326, + "total_acs": 1080, + "total_submitted": 2353, "total_column_articles": 23, "frontend_question_id": "1982", "is_new_question": false @@ -12843,8 +13074,8 @@ "question__title": "Minimize the Difference Between Target and Chosen Elements", "question__title_slug": "minimize-the-difference-between-target-and-chosen-elements", "question__hide": false, - "total_acs": 5365, - "total_submitted": 17151, + "total_acs": 5405, + "total_submitted": 17259, "total_column_articles": 91, "frontend_question_id": "1981", "is_new_question": false @@ -12864,9 +13095,9 @@ "question__title": "Find Unique Binary String", "question__title_slug": "find-unique-binary-string", "question__hide": false, - "total_acs": 6936, - "total_submitted": 11726, - "total_column_articles": 121, + "total_acs": 6996, + "total_submitted": 11820, + "total_column_articles": 123, "frontend_question_id": "1980", "is_new_question": false }, @@ -12885,8 +13116,8 @@ "question__title": "Find Greatest Common Divisor of Array", "question__title_slug": "find-greatest-common-divisor-of-array", "question__hide": false, - "total_acs": 12505, - "total_submitted": 15958, + "total_acs": 12650, + "total_submitted": 16157, "total_column_articles": 172, "frontend_question_id": "1979", "is_new_question": false @@ -12906,9 +13137,9 @@ "question__title": "The Number of Good Subsets", "question__title_slug": "the-number-of-good-subsets", "question__hide": false, - "total_acs": 15084, - "total_submitted": 26557, - "total_column_articles": 171, + "total_acs": 15110, + "total_submitted": 26606, + "total_column_articles": 172, "frontend_question_id": "1994", "is_new_question": false }, @@ -12927,9 +13158,9 @@ "question__title": "Operations on Tree", "question__title_slug": "operations-on-tree", "question__hide": false, - "total_acs": 2305, - "total_submitted": 5958, - "total_column_articles": 53, + "total_acs": 2332, + "total_submitted": 6017, + "total_column_articles": 54, "frontend_question_id": "1993", "is_new_question": false }, @@ -12948,9 +13179,9 @@ "question__title": "Find All Groups of Farmland", "question__title_slug": "find-all-groups-of-farmland", "question__hide": false, - "total_acs": 4129, - "total_submitted": 6930, - "total_column_articles": 86, + "total_acs": 4150, + "total_submitted": 6968, + "total_column_articles": 85, "frontend_question_id": "1992", "is_new_question": false }, @@ -12969,9 +13200,9 @@ "question__title": "Find the Middle Index in Array", "question__title_slug": "find-the-middle-index-in-array", "question__hide": false, - "total_acs": 10133, - "total_submitted": 15524, - "total_column_articles": 139, + "total_acs": 10380, + "total_submitted": 15906, + "total_column_articles": 143, "frontend_question_id": "1991", "is_new_question": false }, @@ -12990,8 +13221,8 @@ "question__title": "Last Day Where You Can Still Cross", "question__title_slug": "last-day-where-you-can-still-cross", "question__hide": false, - "total_acs": 2672, - "total_submitted": 5492, + "total_acs": 2677, + "total_submitted": 5497, "total_column_articles": 54, "frontend_question_id": "1970", "is_new_question": false @@ -13011,8 +13242,8 @@ "question__title": "Minimum Non-Zero Product of the Array Elements", "question__title_slug": "minimum-non-zero-product-of-the-array-elements", "question__hide": false, - "total_acs": 3274, - "total_submitted": 11364, + "total_acs": 3285, + "total_submitted": 11388, "total_column_articles": 50, "frontend_question_id": "1969", "is_new_question": false @@ -13032,9 +13263,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": 8271, - "total_submitted": 10502, - "total_column_articles": 112, + "total_acs": 8351, + "total_submitted": 10599, + "total_column_articles": 113, "frontend_question_id": "1967", "is_new_question": false }, @@ -13053,9 +13284,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": 1182, - "total_submitted": 1676, - "total_column_articles": 23, + "total_acs": 1252, + "total_submitted": 1770, + "total_column_articles": 24, "frontend_question_id": "1951", "is_new_question": false }, @@ -13074,9 +13305,9 @@ "question__title": "Strong Friendship", "question__title_slug": "strong-friendship", "question__hide": false, - "total_acs": 951, - "total_submitted": 1678, - "total_column_articles": 18, + "total_acs": 1024, + "total_submitted": 1831, + "total_column_articles": 20, "frontend_question_id": "1949", "is_new_question": false }, @@ -13095,8 +13326,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": 3652, - "total_submitted": 9162, + "total_acs": 3679, + "total_submitted": 9215, "total_column_articles": 55, "frontend_question_id": "1964", "is_new_question": false @@ -13116,8 +13347,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": 5326, - "total_submitted": 8506, + "total_acs": 5364, + "total_submitted": 8567, "total_column_articles": 69, "frontend_question_id": "1963", "is_new_question": false @@ -13137,8 +13368,8 @@ "question__title": "Remove Stones to Minimize the Total", "question__title_slug": "remove-stones-to-minimize-the-total", "question__hide": false, - "total_acs": 6696, - "total_submitted": 14831, + "total_acs": 6718, + "total_submitted": 14888, "total_column_articles": 91, "frontend_question_id": "1962", "is_new_question": false @@ -13158,9 +13389,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": 9007, - "total_submitted": 16840, - "total_column_articles": 89, + "total_acs": 9064, + "total_submitted": 16936, + "total_column_articles": 91, "frontend_question_id": "1961", "is_new_question": false }, @@ -13179,9 +13410,9 @@ "question__title": "Users That Actively Request Confirmation Messages", "question__title_slug": "users-that-actively-request-confirmation-messages", "question__hide": false, - "total_acs": 1372, - "total_submitted": 2289, - "total_column_articles": 19, + "total_acs": 1428, + "total_submitted": 2381, + "total_column_articles": 20, "frontend_question_id": "1939", "is_new_question": false }, @@ -13200,9 +13431,9 @@ "question__title": "Number of Ways to Separate Numbers", "question__title_slug": "number-of-ways-to-separate-numbers", "question__hide": false, - "total_acs": 1022, - "total_submitted": 3819, - "total_column_articles": 19, + "total_acs": 1039, + "total_submitted": 3855, + "total_column_articles": 21, "frontend_question_id": "1977", "is_new_question": false }, @@ -13221,9 +13452,9 @@ "question__title": "Number of Ways to Arrive at Destination", "question__title_slug": "number-of-ways-to-arrive-at-destination", "question__hide": false, - "total_acs": 3219, - "total_submitted": 9974, - "total_column_articles": 63, + "total_acs": 3258, + "total_submitted": 10091, + "total_column_articles": 64, "frontend_question_id": "1976", "is_new_question": false }, @@ -13242,8 +13473,8 @@ "question__title": "Maximum Matrix Sum", "question__title_slug": "maximum-matrix-sum", "question__hide": false, - "total_acs": 3754, - "total_submitted": 9431, + "total_acs": 3773, + "total_submitted": 9470, "total_column_articles": 54, "frontend_question_id": "1975", "is_new_question": false @@ -13263,8 +13494,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": 6004, - "total_submitted": 8295, + "total_acs": 6086, + "total_submitted": 8412, "total_column_articles": 96, "frontend_question_id": "1974", "is_new_question": false @@ -13284,8 +13515,8 @@ "question__title": "Confirmation Rate", "question__title_slug": "confirmation-rate", "question__hide": false, - "total_acs": 886, - "total_submitted": 1226, + "total_acs": 933, + "total_submitted": 1282, "total_column_articles": 25, "frontend_question_id": "1934", "is_new_question": false @@ -13305,9 +13536,9 @@ "question__title": "Count Number of Special Subsequences", "question__title_slug": "count-number-of-special-subsequences", "question__hide": false, - "total_acs": 3040, - "total_submitted": 5942, - "total_column_articles": 46, + "total_acs": 3058, + "total_submitted": 5967, + "total_column_articles": 47, "frontend_question_id": "1955", "is_new_question": false }, @@ -13326,9 +13557,9 @@ "question__title": "Array With Elements Not Equal to Average of Neighbors", "question__title_slug": "array-with-elements-not-equal-to-average-of-neighbors", "question__hide": false, - "total_acs": 5290, - "total_submitted": 14199, - "total_column_articles": 77, + "total_acs": 5331, + "total_submitted": 14274, + "total_column_articles": 78, "frontend_question_id": "1968", "is_new_question": false }, @@ -13347,9 +13578,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": 5004, - "total_submitted": 14591, - "total_column_articles": 89, + "total_acs": 5033, + "total_submitted": 14646, + "total_column_articles": 90, "frontend_question_id": "1953", "is_new_question": false }, @@ -13368,9 +13599,9 @@ "question__title": "Three Divisors", "question__title_slug": "three-divisors", "question__hide": false, - "total_acs": 9166, - "total_submitted": 16844, - "total_column_articles": 108, + "total_acs": 9279, + "total_submitted": 17038, + "total_column_articles": 111, "frontend_question_id": "1952", "is_new_question": false }, @@ -13389,8 +13620,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": 152, - "total_submitted": 330, + "total_acs": 155, + "total_submitted": 335, "total_column_articles": 13, "frontend_question_id": "2052", "is_new_question": false @@ -13410,8 +13641,8 @@ "question__title": "Minimum Total Space Wasted With K Resizing Operations", "question__title_slug": "minimum-total-space-wasted-with-k-resizing-operations", "question__hide": false, - "total_acs": 1806, - "total_submitted": 4193, + "total_acs": 1824, + "total_submitted": 4218, "total_column_articles": 37, "frontend_question_id": "1959", "is_new_question": false @@ -13431,9 +13662,9 @@ "question__title": "Check if Move is Legal", "question__title_slug": "check-if-move-is-legal", "question__hide": false, - "total_acs": 2885, - "total_submitted": 6717, - "total_column_articles": 49, + "total_acs": 2897, + "total_submitted": 6757, + "total_column_articles": 50, "frontend_question_id": "1958", "is_new_question": false }, @@ -13452,9 +13683,9 @@ "question__title": "Delete Duplicate Folders in System", "question__title_slug": "delete-duplicate-folders-in-system", "question__hide": false, - "total_acs": 1172, - "total_submitted": 2305, - "total_column_articles": 20, + "total_acs": 1186, + "total_submitted": 2333, + "total_column_articles": 21, "frontend_question_id": "1948", "is_new_question": false }, @@ -13473,8 +13704,8 @@ "question__title": "Maximum Compatibility Score Sum", "question__title_slug": "maximum-compatibility-score-sum", "question__hide": false, - "total_acs": 4855, - "total_submitted": 8732, + "total_acs": 4910, + "total_submitted": 8821, "total_column_articles": 100, "frontend_question_id": "1947", "is_new_question": false @@ -13494,8 +13725,8 @@ "question__title": "Largest Number After Mutating Substring", "question__title_slug": "largest-number-after-mutating-substring", "question__hide": false, - "total_acs": 6068, - "total_submitted": 19477, + "total_acs": 6093, + "total_submitted": 19534, "total_column_articles": 87, "frontend_question_id": "1946", "is_new_question": false @@ -13515,8 +13746,8 @@ "question__title": "Sum of Digits of String After Convert", "question__title_slug": "sum-of-digits-of-string-after-convert", "question__hide": false, - "total_acs": 8372, - "total_submitted": 12789, + "total_acs": 8443, + "total_submitted": 12898, "total_column_articles": 111, "frontend_question_id": "1945", "is_new_question": false @@ -13536,8 +13767,8 @@ "question__title": "Brightest Position on Street", "question__title_slug": "brightest-position-on-street", "question__hide": false, - "total_acs": 295, - "total_submitted": 497, + "total_acs": 303, + "total_submitted": 513, "total_column_articles": 16, "frontend_question_id": "2021", "is_new_question": false @@ -13579,7 +13810,7 @@ "question__title_slug": "minimum-time-for-k-virus-variants-to-spread", "question__hide": false, "total_acs": 225, - "total_submitted": 615, + "total_submitted": 616, "total_column_articles": 14, "frontend_question_id": "1956", "is_new_question": false @@ -13599,8 +13830,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": 258, - "total_submitted": 489, + "total_acs": 263, + "total_submitted": 497, "total_column_articles": 9, "frontend_question_id": "1950", "is_new_question": false @@ -13620,8 +13851,8 @@ "question__title": "Longest Common Subsequence Between Sorted Arrays", "question__title_slug": "longest-common-subsequence-between-sorted-arrays", "question__hide": false, - "total_acs": 611, - "total_submitted": 812, + "total_acs": 619, + "total_submitted": 822, "total_column_articles": 33, "frontend_question_id": "1940", "is_new_question": false @@ -13641,8 +13872,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": 739, - "total_submitted": 1494, + "total_acs": 746, + "total_submitted": 1505, "total_column_articles": 31, "frontend_question_id": "1933", "is_new_question": false @@ -13662,8 +13893,8 @@ "question__title": "Kth Smallest Subarray Sum", "question__title_slug": "kth-smallest-subarray-sum", "question__hide": false, - "total_acs": 439, - "total_submitted": 924, + "total_acs": 452, + "total_submitted": 940, "total_column_articles": 7, "frontend_question_id": "1918", "is_new_question": false @@ -13683,8 +13914,8 @@ "question__title": "Maximum Genetic Difference Query", "question__title_slug": "maximum-genetic-difference-query", "question__hide": false, - "total_acs": 1331, - "total_submitted": 3650, + "total_acs": 1336, + "total_submitted": 3664, "total_column_articles": 44, "frontend_question_id": "1938", "is_new_question": false @@ -13704,8 +13935,8 @@ "question__title": "Maximum Number of Points with Cost", "question__title_slug": "maximum-number-of-points-with-cost", "question__hide": false, - "total_acs": 3841, - "total_submitted": 14741, + "total_acs": 3878, + "total_submitted": 14837, "total_column_articles": 69, "frontend_question_id": "1937", "is_new_question": false @@ -13725,9 +13956,9 @@ "question__title": "Add Minimum Number of Rungs", "question__title_slug": "add-minimum-number-of-rungs", "question__hide": false, - "total_acs": 6616, - "total_submitted": 14525, - "total_column_articles": 77, + "total_acs": 6649, + "total_submitted": 14600, + "total_column_articles": 78, "frontend_question_id": "1936", "is_new_question": false }, @@ -13746,9 +13977,9 @@ "question__title": "Leetcodify Similar Friends", "question__title_slug": "leetcodify-similar-friends", "question__hide": false, - "total_acs": 987, - "total_submitted": 2376, - "total_column_articles": 27, + "total_acs": 1027, + "total_submitted": 2448, + "total_column_articles": 29, "frontend_question_id": "1919", "is_new_question": false }, @@ -13767,9 +13998,9 @@ "question__title": "Leetcodify Friends Recommendations", "question__title_slug": "leetcodify-friends-recommendations", "question__hide": false, - "total_acs": 1043, - "total_submitted": 3107, - "total_column_articles": 16, + "total_acs": 1098, + "total_submitted": 3289, + "total_column_articles": 18, "frontend_question_id": "1917", "is_new_question": false }, @@ -13788,8 +14019,8 @@ "question__title": "Game of Nim", "question__title_slug": "game-of-nim", "question__hide": false, - "total_acs": 313, - "total_submitted": 500, + "total_acs": 319, + "total_submitted": 508, "total_column_articles": 13, "frontend_question_id": "1908", "is_new_question": false @@ -13809,8 +14040,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": 2390, - "total_submitted": 4159, + "total_acs": 2407, + "total_submitted": 4206, "total_column_articles": 68, "frontend_question_id": "1931", "is_new_question": false @@ -13830,8 +14061,8 @@ "question__title": "Merge BSTs to Create Single BST", "question__title_slug": "merge-bsts-to-create-single-bst", "question__hide": false, - "total_acs": 1465, - "total_submitted": 4411, + "total_acs": 1480, + "total_submitted": 4450, "total_column_articles": 41, "frontend_question_id": "1932", "is_new_question": false @@ -13851,9 +14082,9 @@ "question__title": "Unique Length-3 Palindromic Subsequences", "question__title_slug": "unique-length-3-palindromic-subsequences", "question__hide": false, - "total_acs": 6324, - "total_submitted": 12903, - "total_column_articles": 110, + "total_acs": 6364, + "total_submitted": 12985, + "total_column_articles": 111, "frontend_question_id": "1930", "is_new_question": false }, @@ -13872,9 +14103,9 @@ "question__title": "Concatenation of Array", "question__title_slug": "concatenation-of-array", "question__hide": false, - "total_acs": 24698, - "total_submitted": 28267, - "total_column_articles": 217, + "total_acs": 25069, + "total_submitted": 28718, + "total_column_articles": 218, "frontend_question_id": "1929", "is_new_question": false }, @@ -13893,8 +14124,8 @@ "question__title": "Count Salary Categories", "question__title_slug": "count-salary-categories", "question__hide": false, - "total_acs": 1355, - "total_submitted": 2226, + "total_acs": 1393, + "total_submitted": 2316, "total_column_articles": 32, "frontend_question_id": "1907", "is_new_question": false @@ -13914,8 +14145,8 @@ "question__title": "Describe the Painting", "question__title_slug": "describe-the-painting", "question__hide": false, - "total_acs": 2316, - "total_submitted": 5518, + "total_acs": 2339, + "total_submitted": 5561, "total_column_articles": 61, "frontend_question_id": "1943", "is_new_question": false @@ -13935,8 +14166,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": 3658, - "total_submitted": 9037, + "total_acs": 3688, + "total_submitted": 9114, "total_column_articles": 83, "frontend_question_id": "1942", "is_new_question": false @@ -13956,9 +14187,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": 7829, - "total_submitted": 10501, - "total_column_articles": 130, + "total_acs": 7955, + "total_submitted": 10680, + "total_column_articles": 132, "frontend_question_id": "1941", "is_new_question": false }, @@ -13977,8 +14208,8 @@ "question__title": "Depth of BST Given Insertion Order", "question__title_slug": "depth-of-bst-given-insertion-order", "question__hide": false, - "total_acs": 224, - "total_submitted": 464, + "total_acs": 235, + "total_submitted": 480, "total_column_articles": 7, "frontend_question_id": "1902", "is_new_question": false @@ -13998,9 +14229,9 @@ "question__title": "Longest Common Subpath", "question__title_slug": "longest-common-subpath", "question__hide": false, - "total_acs": 1946, - "total_submitted": 7789, - "total_column_articles": 37, + "total_acs": 1963, + "total_submitted": 7834, + "total_column_articles": 38, "frontend_question_id": "1923", "is_new_question": false }, @@ -14019,8 +14250,8 @@ "question__title": "Count Good Numbers", "question__title_slug": "count-good-numbers", "question__hide": false, - "total_acs": 5414, - "total_submitted": 14881, + "total_acs": 5436, + "total_submitted": 14962, "total_column_articles": 86, "frontend_question_id": "1922", "is_new_question": false @@ -14040,9 +14271,9 @@ "question__title": "Eliminate Maximum Number of Monsters", "question__title_slug": "eliminate-maximum-number-of-monsters", "question__hide": false, - "total_acs": 6517, - "total_submitted": 18413, - "total_column_articles": 106, + "total_acs": 6567, + "total_submitted": 18517, + "total_column_articles": 107, "frontend_question_id": "1921", "is_new_question": false }, @@ -14061,9 +14292,9 @@ "question__title": "Build Array from Permutation", "question__title_slug": "build-array-from-permutation", "question__hide": false, - "total_acs": 21906, - "total_submitted": 25057, - "total_column_articles": 188, + "total_acs": 22194, + "total_submitted": 25387, + "total_column_articles": 191, "frontend_question_id": "1920", "is_new_question": false }, @@ -14082,9 +14313,9 @@ "question__title": "Find a Peak Element II", "question__title_slug": "find-a-peak-element-ii", "question__hide": false, - "total_acs": 3077, - "total_submitted": 5252, - "total_column_articles": 71, + "total_acs": 3261, + "total_submitted": 5532, + "total_column_articles": 78, "frontend_question_id": "1901", "is_new_question": false }, @@ -14103,9 +14334,9 @@ "question__title": "Page Recommendations II", "question__title_slug": "page-recommendations-ii", "question__hide": false, - "total_acs": 1174, - "total_submitted": 3288, - "total_column_articles": 24, + "total_acs": 1205, + "total_submitted": 3388, + "total_column_articles": 25, "frontend_question_id": "1892", "is_new_question": false }, @@ -14124,9 +14355,9 @@ "question__title": "Cutting Ribbons", "question__title_slug": "cutting-ribbons", "question__hide": false, - "total_acs": 3049, - "total_submitted": 7585, - "total_column_articles": 33, + "total_acs": 3119, + "total_submitted": 7698, + "total_column_articles": 34, "frontend_question_id": "1891", "is_new_question": false }, @@ -14145,8 +14376,8 @@ "question__title": "Number of Wonderful Substrings", "question__title_slug": "number-of-wonderful-substrings", "question__hide": false, - "total_acs": 3331, - "total_submitted": 8266, + "total_acs": 3364, + "total_submitted": 8327, "total_column_articles": 63, "frontend_question_id": "1915", "is_new_question": false @@ -14166,9 +14397,9 @@ "question__title": "Cyclically Rotating a Grid", "question__title_slug": "cyclically-rotating-a-grid", "question__hide": false, - "total_acs": 3598, - "total_submitted": 8009, - "total_column_articles": 77, + "total_acs": 3622, + "total_submitted": 8047, + "total_column_articles": 78, "frontend_question_id": "1914", "is_new_question": false }, @@ -14187,9 +14418,9 @@ "question__title": "Maximum Product Difference Between Two Pairs", "question__title_slug": "maximum-product-difference-between-two-pairs", "question__hide": false, - "total_acs": 12971, - "total_submitted": 15694, - "total_column_articles": 156, + "total_acs": 13139, + "total_submitted": 15879, + "total_column_articles": 157, "frontend_question_id": "1913", "is_new_question": false }, @@ -14208,9 +14439,9 @@ "question__title": "The Latest Login in 2020", "question__title_slug": "the-latest-login-in-2020", "question__hide": false, - "total_acs": 4292, - "total_submitted": 5826, - "total_column_articles": 38, + "total_acs": 4936, + "total_submitted": 6750, + "total_column_articles": 43, "frontend_question_id": "1890", "is_new_question": false }, @@ -14229,9 +14460,9 @@ "question__title": "Minimum Cost to Reach Destination in Time", "question__title_slug": "minimum-cost-to-reach-destination-in-time", "question__hide": false, - "total_acs": 3196, - "total_submitted": 7689, - "total_column_articles": 57, + "total_acs": 3266, + "total_submitted": 7818, + "total_column_articles": 58, "frontend_question_id": "1928", "is_new_question": false }, @@ -14250,8 +14481,8 @@ "question__title": "Sum Game", "question__title_slug": "sum-game", "question__hide": false, - "total_acs": 2244, - "total_submitted": 5336, + "total_acs": 2268, + "total_submitted": 5394, "total_column_articles": 44, "frontend_question_id": "1927", "is_new_question": false @@ -14271,9 +14502,9 @@ "question__title": "Nearest Exit from Entrance in Maze", "question__title_slug": "nearest-exit-from-entrance-in-maze", "question__hide": false, - "total_acs": 5823, - "total_submitted": 15648, - "total_column_articles": 109, + "total_acs": 5988, + "total_submitted": 15965, + "total_column_articles": 111, "frontend_question_id": "1926", "is_new_question": false }, @@ -14292,9 +14523,9 @@ "question__title": "Count Square Sum Triples", "question__title_slug": "count-square-sum-triples", "question__hide": false, - "total_acs": 7702, - "total_submitted": 11099, - "total_column_articles": 92, + "total_acs": 7795, + "total_submitted": 11231, + "total_column_articles": 93, "frontend_question_id": "1925", "is_new_question": false }, @@ -14313,9 +14544,9 @@ "question__title": "Count Pairs in Two Arrays", "question__title_slug": "count-pairs-in-two-arrays", "question__hide": false, - "total_acs": 631, - "total_submitted": 1130, - "total_column_articles": 21, + "total_acs": 665, + "total_submitted": 1188, + "total_column_articles": 22, "frontend_question_id": "1885", "is_new_question": false }, @@ -14334,9 +14565,9 @@ "question__title": "Count Sub Islands", "question__title_slug": "count-sub-islands", "question__hide": false, - "total_acs": 11920, - "total_submitted": 18538, - "total_column_articles": 219, + "total_acs": 12384, + "total_submitted": 19211, + "total_column_articles": 227, "frontend_question_id": "1905", "is_new_question": false }, @@ -14355,8 +14586,8 @@ "question__title": "Minimum Absolute Difference Queries", "question__title_slug": "minimum-absolute-difference-queries", "question__hide": false, - "total_acs": 2894, - "total_submitted": 6798, + "total_acs": 2911, + "total_submitted": 6829, "total_column_articles": 59, "frontend_question_id": "1906", "is_new_question": false @@ -14376,9 +14607,9 @@ "question__title": "The Number of Full Rounds You Have Played", "question__title_slug": "the-number-of-full-rounds-you-have-played", "question__hide": false, - "total_acs": 4407, - "total_submitted": 14738, - "total_column_articles": 84, + "total_acs": 4433, + "total_submitted": 14812, + "total_column_articles": 85, "frontend_question_id": "1904", "is_new_question": false }, @@ -14397,9 +14628,9 @@ "question__title": "Largest Odd Number in String", "question__title_slug": "largest-odd-number-in-string", "question__hide": false, - "total_acs": 10756, - "total_submitted": 17199, - "total_column_articles": 138, + "total_acs": 10899, + "total_submitted": 17407, + "total_column_articles": 139, "frontend_question_id": "1903", "is_new_question": false }, @@ -14418,9 +14649,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": 4431, - "total_submitted": 6420, - "total_column_articles": 68, + "total_acs": 4551, + "total_submitted": 6585, + "total_column_articles": 70, "frontend_question_id": "1884", "is_new_question": false }, @@ -14439,9 +14670,9 @@ "question__title": "Group Employees of the Same Salary", "question__title_slug": "group-employees-of-the-same-salary", "question__hide": false, - "total_acs": 1119, - "total_submitted": 1691, - "total_column_articles": 31, + "total_acs": 1158, + "total_submitted": 1760, + "total_column_articles": 32, "frontend_question_id": "1875", "is_new_question": false }, @@ -14460,8 +14691,8 @@ "question__title": "Minimize Product Sum of Two Arrays", "question__title_slug": "minimize-product-sum-of-two-arrays", "question__hide": false, - "total_acs": 667, - "total_submitted": 776, + "total_acs": 673, + "total_submitted": 784, "total_column_articles": 28, "frontend_question_id": "1874", "is_new_question": false @@ -14481,8 +14712,8 @@ "question__title": "The Earliest and Latest Rounds Where Players Compete", "question__title_slug": "the-earliest-and-latest-rounds-where-players-compete", "question__hide": false, - "total_acs": 1460, - "total_submitted": 3253, + "total_acs": 1472, + "total_submitted": 3277, "total_column_articles": 41, "frontend_question_id": "1900", "is_new_question": false @@ -14502,9 +14733,9 @@ "question__title": "Maximum Number of Removable Characters", "question__title_slug": "maximum-number-of-removable-characters", "question__hide": false, - "total_acs": 5039, - "total_submitted": 15178, - "total_column_articles": 78, + "total_acs": 5173, + "total_submitted": 15458, + "total_column_articles": 80, "frontend_question_id": "1898", "is_new_question": false }, @@ -14523,8 +14754,8 @@ "question__title": "Merge Triplets to Form Target Triplet", "question__title_slug": "merge-triplets-to-form-target-triplet", "question__hide": false, - "total_acs": 4286, - "total_submitted": 6733, + "total_acs": 4308, + "total_submitted": 6780, "total_column_articles": 49, "frontend_question_id": "1899", "is_new_question": false @@ -14544,8 +14775,8 @@ "question__title": "Redistribute Characters to Make All Strings Equal", "question__title_slug": "redistribute-characters-to-make-all-strings-equal", "question__hide": false, - "total_acs": 7910, - "total_submitted": 14513, + "total_acs": 7981, + "total_submitted": 14618, "total_column_articles": 103, "frontend_question_id": "1897", "is_new_question": false @@ -14565,9 +14796,9 @@ "question__title": "Calculate Special Bonus", "question__title_slug": "calculate-special-bonus", "question__hide": false, - "total_acs": 10831, - "total_submitted": 13584, - "total_column_articles": 89, + "total_acs": 12698, + "total_submitted": 15958, + "total_column_articles": 100, "frontend_question_id": "1873", "is_new_question": false }, @@ -14586,9 +14817,9 @@ "question__title": "Design Movie Rental System", "question__title_slug": "design-movie-rental-system", "question__hide": false, - "total_acs": 2851, - "total_submitted": 12018, - "total_column_articles": 60, + "total_acs": 2886, + "total_submitted": 12177, + "total_column_articles": 62, "frontend_question_id": "1912", "is_new_question": false }, @@ -14607,9 +14838,9 @@ "question__title": "Maximum Alternating Subsequence Sum", "question__title_slug": "maximum-alternating-subsequence-sum", "question__hide": false, - "total_acs": 4602, - "total_submitted": 8058, - "total_column_articles": 88, + "total_acs": 4637, + "total_submitted": 8131, + "total_column_articles": 89, "frontend_question_id": "1911", "is_new_question": false }, @@ -14628,9 +14859,9 @@ "question__title": "Remove All Occurrences of a Substring", "question__title_slug": "remove-all-occurrences-of-a-substring", "question__hide": false, - "total_acs": 4765, - "total_submitted": 7162, - "total_column_articles": 85, + "total_acs": 4820, + "total_submitted": 7245, + "total_column_articles": 89, "frontend_question_id": "1910", "is_new_question": false }, @@ -14649,9 +14880,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": 6632, - "total_submitted": 21217, - "total_column_articles": 106, + "total_acs": 6694, + "total_submitted": 21407, + "total_column_articles": 107, "frontend_question_id": "1909", "is_new_question": false }, @@ -14670,8 +14901,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": 1086, - "total_submitted": 2018, + "total_acs": 1106, + "total_submitted": 2049, "total_column_articles": 30, "frontend_question_id": "1868", "is_new_question": false @@ -14691,9 +14922,9 @@ "question__title": "Minimum Space Wasted From Packaging", "question__title_slug": "minimum-space-wasted-from-packaging", "question__hide": false, - "total_acs": 2634, - "total_submitted": 9635, - "total_column_articles": 47, + "total_acs": 2657, + "total_submitted": 9701, + "total_column_articles": 48, "frontend_question_id": "1889", "is_new_question": false }, @@ -14712,8 +14943,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": 3243, - "total_submitted": 9693, + "total_acs": 3260, + "total_submitted": 9734, "total_column_articles": 73, "frontend_question_id": "1888", "is_new_question": false @@ -14733,9 +14964,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": 5958, - "total_submitted": 9219, - "total_column_articles": 81, + "total_acs": 6019, + "total_submitted": 9301, + "total_column_articles": 83, "frontend_question_id": "1887", "is_new_question": false }, @@ -14754,9 +14985,9 @@ "question__title": "Determine Whether Matrix Can Be Obtained By Rotation", "question__title_slug": "determine-whether-matrix-can-be-obtained-by-rotation", "question__hide": false, - "total_acs": 7328, - "total_submitted": 12630, - "total_column_articles": 115, + "total_acs": 7467, + "total_submitted": 12860, + "total_column_articles": 117, "frontend_question_id": "1886", "is_new_question": false }, @@ -14775,8 +15006,8 @@ "question__title": "Orders With Maximum Quantity Above Average", "question__title_slug": "orders-with-maximum-quantity-above-average", "question__hide": false, - "total_acs": 1588, - "total_submitted": 2215, + "total_acs": 1685, + "total_submitted": 2328, "total_column_articles": 25, "frontend_question_id": "1867", "is_new_question": false @@ -14796,8 +15027,8 @@ "question__title": "Minimum Skips to Arrive at Meeting On Time", "question__title_slug": "minimum-skips-to-arrive-at-meeting-on-time", "question__hide": false, - "total_acs": 1969, - "total_submitted": 5103, + "total_acs": 1984, + "total_submitted": 5129, "total_column_articles": 32, "frontend_question_id": "1883", "is_new_question": false @@ -14817,8 +15048,8 @@ "question__title": "Process Tasks Using Servers", "question__title_slug": "process-tasks-using-servers", "question__hide": false, - "total_acs": 4300, - "total_submitted": 15001, + "total_acs": 4315, + "total_submitted": 15067, "total_column_articles": 126, "frontend_question_id": "1882", "is_new_question": false @@ -14838,9 +15069,9 @@ "question__title": "Maximum Value after Insertion", "question__title_slug": "maximum-value-after-insertion", "question__hide": false, - "total_acs": 7166, - "total_submitted": 19691, - "total_column_articles": 75, + "total_acs": 7205, + "total_submitted": 19795, + "total_column_articles": 76, "frontend_question_id": "1881", "is_new_question": false }, @@ -14859,9 +15090,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": 9257, - "total_submitted": 12053, - "total_column_articles": 139, + "total_acs": 9315, + "total_submitted": 12116, + "total_column_articles": 141, "frontend_question_id": "1880", "is_new_question": false }, @@ -14880,8 +15111,8 @@ "question__title": "Longest Word With All Prefixes", "question__title_slug": "longest-word-with-all-prefixes", "question__hide": false, - "total_acs": 633, - "total_submitted": 978, + "total_acs": 642, + "total_submitted": 998, "total_column_articles": 30, "frontend_question_id": "1858", "is_new_question": false @@ -14901,8 +15132,8 @@ "question__title": "Minimum Cost to Change the Final Value of Expression", "question__title_slug": "minimum-cost-to-change-the-final-value-of-expression", "question__hide": false, - "total_acs": 1020, - "total_submitted": 1980, + "total_acs": 1025, + "total_submitted": 1986, "total_column_articles": 32, "frontend_question_id": "1896", "is_new_question": false @@ -14922,11 +15153,11 @@ "question__title": "Maximum Cost of Trip With K Highways", "question__title_slug": "maximum-cost-of-trip-with-k-highways", "question__hide": false, - "total_acs": 37, - "total_submitted": 51, - "total_column_articles": 6, - "frontend_question_id": "5769", - "is_new_question": true + "total_acs": 57, + "total_submitted": 85, + "total_column_articles": 7, + "frontend_question_id": "2247", + "is_new_question": false }, "status": null, "difficulty": { @@ -14943,9 +15174,9 @@ "question__title": "Find the Student that Will Replace the Chalk", "question__title_slug": "find-the-student-that-will-replace-the-chalk", "question__hide": false, - "total_acs": 40090, - "total_submitted": 87513, - "total_column_articles": 545, + "total_acs": 40455, + "total_submitted": 88266, + "total_column_articles": 547, "frontend_question_id": "1894", "is_new_question": false }, @@ -14964,9 +15195,9 @@ "question__title": "Check if All the Integers in a Range Are Covered", "question__title_slug": "check-if-all-the-integers-in-a-range-are-covered", "question__hide": false, - "total_acs": 34244, - "total_submitted": 58011, - "total_column_articles": 447, + "total_acs": 34360, + "total_submitted": 58240, + "total_column_articles": 450, "frontend_question_id": "1893", "is_new_question": false }, @@ -14985,8 +15216,8 @@ "question__title": "Convert Date Format", "question__title_slug": "convert-date-format", "question__hide": false, - "total_acs": 2065, - "total_submitted": 3312, + "total_acs": 2105, + "total_submitted": 3383, "total_column_articles": 25, "frontend_question_id": "1853", "is_new_question": false @@ -15006,8 +15237,8 @@ "question__title": "Distinct Numbers in Each Subarray", "question__title_slug": "distinct-numbers-in-each-subarray", "question__hide": false, - "total_acs": 544, - "total_submitted": 982, + "total_acs": 547, + "total_submitted": 985, "total_column_articles": 14, "frontend_question_id": "1852", "is_new_question": false @@ -15027,8 +15258,8 @@ "question__title": "Stone Game VIII", "question__title_slug": "stone-game-viii", "question__hide": false, - "total_acs": 2559, - "total_submitted": 4093, + "total_acs": 2577, + "total_submitted": 4122, "total_column_articles": 35, "frontend_question_id": "1872", "is_new_question": false @@ -15048,8 +15279,8 @@ "question__title": "Jump Game VII", "question__title_slug": "jump-game-vii", "question__hide": false, - "total_acs": 7230, - "total_submitted": 25788, + "total_acs": 7282, + "total_submitted": 25948, "total_column_articles": 143, "frontend_question_id": "1871", "is_new_question": false @@ -15069,9 +15300,9 @@ "question__title": "Minimum Speed to Arrive on Time", "question__title_slug": "minimum-speed-to-arrive-on-time", "question__hide": false, - "total_acs": 8762, - "total_submitted": 19902, - "total_column_articles": 90, + "total_acs": 8924, + "total_submitted": 20258, + "total_column_articles": 91, "frontend_question_id": "1870", "is_new_question": false }, @@ -15090,9 +15321,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": 14602, - "total_submitted": 19319, - "total_column_articles": 180, + "total_acs": 14661, + "total_submitted": 19413, + "total_column_articles": 181, "frontend_question_id": "1869", "is_new_question": false }, @@ -15111,9 +15342,9 @@ "question__title": "Suspicious Bank Accounts", "question__title_slug": "suspicious-bank-accounts", "question__hide": false, - "total_acs": 1430, - "total_submitted": 3040, - "total_column_articles": 34, + "total_acs": 1478, + "total_submitted": 3131, + "total_column_articles": 36, "frontend_question_id": "1843", "is_new_question": false }, @@ -15153,8 +15384,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": 2694, - "total_submitted": 4405, + "total_acs": 2773, + "total_submitted": 4522, "total_column_articles": 60, "frontend_question_id": "1866", "is_new_question": false @@ -15174,8 +15405,8 @@ "question__title": "Finding Pairs With a Certain Sum", "question__title_slug": "finding-pairs-with-a-certain-sum", "question__hide": false, - "total_acs": 5952, - "total_submitted": 11710, + "total_acs": 5975, + "total_submitted": 11755, "total_column_articles": 71, "frontend_question_id": "1865", "is_new_question": false @@ -15195,9 +15426,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": 5125, - "total_submitted": 12997, - "total_column_articles": 117, + "total_acs": 5209, + "total_submitted": 13231, + "total_column_articles": 120, "frontend_question_id": "1864", "is_new_question": false }, @@ -15216,9 +15447,9 @@ "question__title": "Sum of All Subset XOR Totals", "question__title_slug": "sum-of-all-subset-xor-totals", "question__hide": false, - "total_acs": 16788, - "total_submitted": 19376, - "total_column_articles": 211, + "total_acs": 16967, + "total_submitted": 19596, + "total_column_articles": 212, "frontend_question_id": "1863", "is_new_question": false }, @@ -15237,9 +15468,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": 400, - "total_submitted": 595, - "total_column_articles": 21, + "total_acs": 412, + "total_submitted": 612, + "total_column_articles": 22, "frontend_question_id": "2046", "is_new_question": false }, @@ -15258,9 +15489,9 @@ "question__title": "League Statistics", "question__title_slug": "league-statistics", "question__hide": false, - "total_acs": 1682, - "total_submitted": 3203, - "total_column_articles": 43, + "total_acs": 1716, + "total_submitted": 3263, + "total_column_articles": 44, "frontend_question_id": "1841", "is_new_question": false }, @@ -15279,8 +15510,8 @@ "question__title": "Get Biggest Three Rhombus Sums in a Grid", "question__title_slug": "get-biggest-three-rhombus-sums-in-a-grid", "question__hide": false, - "total_acs": 2429, - "total_submitted": 5558, + "total_acs": 2435, + "total_submitted": 5569, "total_column_articles": 61, "frontend_question_id": "1878", "is_new_question": false @@ -15300,8 +15531,8 @@ "question__title": "Minimum XOR Sum of Two Arrays", "question__title_slug": "minimum-xor-sum-of-two-arrays", "question__hide": false, - "total_acs": 2653, - "total_submitted": 5864, + "total_acs": 2689, + "total_submitted": 5904, "total_column_articles": 48, "frontend_question_id": "1879", "is_new_question": false @@ -15321,8 +15552,8 @@ "question__title": "Minimize Maximum Pair Sum in Array", "question__title_slug": "minimize-maximum-pair-sum-in-array", "question__hide": false, - "total_acs": 33712, - "total_submitted": 41376, + "total_acs": 33830, + "total_submitted": 41532, "total_column_articles": 432, "frontend_question_id": "1877", "is_new_question": false @@ -15342,9 +15573,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": 9589, - "total_submitted": 13350, - "total_column_articles": 150, + "total_acs": 9724, + "total_submitted": 13564, + "total_column_articles": 152, "frontend_question_id": "1876", "is_new_question": false }, @@ -15363,9 +15594,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": 2789, - "total_submitted": 5997, - "total_column_articles": 41, + "total_acs": 2824, + "total_submitted": 6064, + "total_column_articles": 43, "frontend_question_id": "1857", "is_new_question": false }, @@ -15384,8 +15615,8 @@ "question__title": "Maximum Subarray Min-Product", "question__title_slug": "maximum-subarray-min-product", "question__hide": false, - "total_acs": 5654, - "total_submitted": 15905, + "total_acs": 5734, + "total_submitted": 16105, "total_column_articles": 95, "frontend_question_id": "1856", "is_new_question": false @@ -15405,9 +15636,9 @@ "question__title": "Maximum Distance Between a Pair of Values", "question__title_slug": "maximum-distance-between-a-pair-of-values", "question__hide": false, - "total_acs": 13311, - "total_submitted": 20795, - "total_column_articles": 150, + "total_acs": 13726, + "total_submitted": 21488, + "total_column_articles": 154, "frontend_question_id": "1855", "is_new_question": false }, @@ -15426,9 +15657,9 @@ "question__title": "Maximum Population Year", "question__title_slug": "maximum-population-year", "question__hide": false, - "total_acs": 13891, - "total_submitted": 18275, - "total_column_articles": 157, + "total_acs": 13981, + "total_submitted": 18461, + "total_column_articles": 159, "frontend_question_id": "1854", "is_new_question": false }, @@ -15447,8 +15678,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": 897, - "total_submitted": 1223, + "total_acs": 926, + "total_submitted": 1266, "total_column_articles": 45, "frontend_question_id": "1836", "is_new_question": false @@ -15468,8 +15699,8 @@ "question__title": "Maximum Transaction Each Day", "question__title_slug": "maximum-transaction-each-day", "question__hide": false, - "total_acs": 1777, - "total_submitted": 2330, + "total_acs": 1860, + "total_submitted": 2435, "total_column_articles": 35, "frontend_question_id": "1831", "is_new_question": false @@ -15489,8 +15720,8 @@ "question__title": "Faulty Sensor", "question__title_slug": "faulty-sensor", "question__hide": false, - "total_acs": 488, - "total_submitted": 1169, + "total_acs": 493, + "total_submitted": 1180, "total_column_articles": 30, "frontend_question_id": "1826", "is_new_question": false @@ -15510,8 +15741,8 @@ "question__title": "Maximum Number of People That Can Be Caught in Tag", "question__title_slug": "maximum-number-of-people-that-can-be-caught-in-tag", "question__hide": false, - "total_acs": 133, - "total_submitted": 244, + "total_acs": 135, + "total_submitted": 247, "total_column_articles": 6, "frontend_question_id": "1989", "is_new_question": false @@ -15531,8 +15762,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": 2750, - "total_submitted": 4503, + "total_acs": 2762, + "total_submitted": 4521, "total_column_articles": 54, "frontend_question_id": "1850", "is_new_question": false @@ -15552,8 +15783,8 @@ "question__title": "Minimum Interval to Include Each Query", "question__title_slug": "minimum-interval-to-include-each-query", "question__hide": false, - "total_acs": 2425, - "total_submitted": 5870, + "total_acs": 2452, + "total_submitted": 5916, "total_column_articles": 58, "frontend_question_id": "1851", "is_new_question": false @@ -15573,8 +15804,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": 6259, - "total_submitted": 19088, + "total_acs": 6287, + "total_submitted": 19148, "total_column_articles": 124, "frontend_question_id": "1849", "is_new_question": false @@ -15594,9 +15825,9 @@ "question__title": "Minimum Distance to the Target Element", "question__title_slug": "minimum-distance-to-the-target-element", "question__hide": false, - "total_acs": 9607, - "total_submitted": 14238, - "total_column_articles": 126, + "total_acs": 9690, + "total_submitted": 14355, + "total_column_articles": 128, "frontend_question_id": "1848", "is_new_question": false }, @@ -15615,8 +15846,8 @@ "question__title": "Find Customers With Positive Revenue this Year", "question__title_slug": "find-customers-with-positive-revenue-this-year", "question__hide": false, - "total_acs": 3885, - "total_submitted": 4308, + "total_acs": 3941, + "total_submitted": 4370, "total_column_articles": 30, "frontend_question_id": "1821", "is_new_question": false @@ -15636,9 +15867,9 @@ "question__title": "Rotating the Box", "question__title_slug": "rotating-the-box", "question__hide": false, - "total_acs": 4226, - "total_submitted": 6753, - "total_column_articles": 86, + "total_acs": 4321, + "total_submitted": 6869, + "total_column_articles": 87, "frontend_question_id": "1861", "is_new_question": false }, @@ -15657,8 +15888,8 @@ "question__title": "Incremental Memory Leak", "question__title_slug": "incremental-memory-leak", "question__hide": false, - "total_acs": 4934, - "total_submitted": 6450, + "total_acs": 5006, + "total_submitted": 6558, "total_column_articles": 93, "frontend_question_id": "1860", "is_new_question": false @@ -15678,9 +15909,9 @@ "question__title": "Sorting the Sentence", "question__title_slug": "sorting-the-sentence", "question__hide": false, - "total_acs": 9761, - "total_submitted": 13000, - "total_column_articles": 204, + "total_acs": 9868, + "total_submitted": 13149, + "total_column_articles": 206, "frontend_question_id": "1859", "is_new_question": false }, @@ -15699,9 +15930,9 @@ "question__title": "Maximum Number of Accepted Invitations", "question__title_slug": "maximum-number-of-accepted-invitations", "question__hide": false, - "total_acs": 198, - "total_submitted": 438, - "total_column_articles": 14, + "total_acs": 201, + "total_submitted": 445, + "total_column_articles": 15, "frontend_question_id": "1820", "is_new_question": false }, @@ -15720,8 +15951,8 @@ "question__title": "Maximum Building Height", "question__title_slug": "maximum-building-height", "question__hide": false, - "total_acs": 2254, - "total_submitted": 5738, + "total_acs": 2267, + "total_submitted": 5761, "total_column_articles": 52, "frontend_question_id": "1840", "is_new_question": false @@ -15741,9 +15972,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": 7910, - "total_submitted": 14426, - "total_column_articles": 154, + "total_acs": 7947, + "total_submitted": 14504, + "total_column_articles": 156, "frontend_question_id": "1839", "is_new_question": false }, @@ -15762,9 +15993,9 @@ "question__title": "Frequency of the Most Frequent Element", "question__title_slug": "frequency-of-the-most-frequent-element", "question__hide": false, - "total_acs": 31728, - "total_submitted": 74106, - "total_column_articles": 333, + "total_acs": 31905, + "total_submitted": 74465, + "total_column_articles": 335, "frontend_question_id": "1838", "is_new_question": false }, @@ -15783,9 +16014,9 @@ "question__title": "Sum of Digits in Base K", "question__title_slug": "sum-of-digits-in-base-k", "question__hide": false, - "total_acs": 9949, - "total_submitted": 12473, - "total_column_articles": 123, + "total_acs": 10058, + "total_submitted": 12613, + "total_column_articles": 125, "frontend_question_id": "1837", "is_new_question": false }, @@ -15804,9 +16035,9 @@ "question__title": "Find Interview Candidates", "question__title_slug": "find-interview-candidates", "question__hide": false, - "total_acs": 1827, - "total_submitted": 2837, - "total_column_articles": 40, + "total_acs": 1880, + "total_submitted": 2910, + "total_column_articles": 42, "frontend_question_id": "1811", "is_new_question": false }, @@ -15825,8 +16056,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": 4022, - "total_submitted": 7716, + "total_acs": 4033, + "total_submitted": 7734, "total_column_articles": 64, "frontend_question_id": "1835", "is_new_question": false @@ -15846,9 +16077,9 @@ "question__title": "Single-Threaded CPU", "question__title_slug": "single-threaded-cpu", "question__hide": false, - "total_acs": 7519, - "total_submitted": 20776, - "total_column_articles": 145, + "total_acs": 7621, + "total_submitted": 21008, + "total_column_articles": 146, "frontend_question_id": "1834", "is_new_question": false }, @@ -15867,9 +16098,9 @@ "question__title": "Maximum Ice Cream Bars", "question__title_slug": "maximum-ice-cream-bars", "question__hide": false, - "total_acs": 45507, - "total_submitted": 66695, - "total_column_articles": 407, + "total_acs": 45583, + "total_submitted": 66801, + "total_column_articles": 410, "frontend_question_id": "1833", "is_new_question": false }, @@ -15888,9 +16119,9 @@ "question__title": "Check if the Sentence Is Pangram", "question__title_slug": "check-if-the-sentence-is-pangram", "question__hide": false, - "total_acs": 17111, - "total_submitted": 20809, - "total_column_articles": 277, + "total_acs": 17291, + "total_submitted": 21036, + "total_column_articles": 278, "frontend_question_id": "1832", "is_new_question": false }, @@ -15909,8 +16140,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": 289, - "total_submitted": 465, + "total_acs": 293, + "total_submitted": 470, "total_column_articles": 8, "frontend_question_id": "1810", "is_new_question": false @@ -15930,8 +16161,8 @@ "question__title": "Ad-Free Sessions", "question__title_slug": "ad-free-sessions", "question__hide": false, - "total_acs": 2934, - "total_submitted": 4759, + "total_acs": 2981, + "total_submitted": 4844, "total_column_articles": 44, "frontend_question_id": "1809", "is_new_question": false @@ -15951,8 +16182,8 @@ "question__title": "Closest Room", "question__title_slug": "closest-room", "question__hide": false, - "total_acs": 2824, - "total_submitted": 7618, + "total_acs": 2896, + "total_submitted": 7786, "total_column_articles": 50, "frontend_question_id": "1847", "is_new_question": false @@ -15972,8 +16203,8 @@ "question__title": "Maximum Element After Decreasing and Rearranging", "question__title_slug": "maximum-element-after-decreasing-and-rearranging", "question__hide": false, - "total_acs": 28784, - "total_submitted": 45543, + "total_acs": 28834, + "total_submitted": 45619, "total_column_articles": 387, "frontend_question_id": "1846", "is_new_question": false @@ -15993,9 +16224,9 @@ "question__title": "Seat Reservation Manager", "question__title_slug": "seat-reservation-manager", "question__hide": false, - "total_acs": 9987, - "total_submitted": 20433, - "total_column_articles": 100, + "total_acs": 10108, + "total_submitted": 20709, + "total_column_articles": 103, "frontend_question_id": "1845", "is_new_question": false }, @@ -16014,8 +16245,8 @@ "question__title": "Replace All Digits with Characters", "question__title_slug": "replace-all-digits-with-characters", "question__hide": false, - "total_acs": 9150, - "total_submitted": 11519, + "total_acs": 9223, + "total_submitted": 11611, "total_column_articles": 158, "frontend_question_id": "1844", "is_new_question": false @@ -16035,9 +16266,9 @@ "question__title": "Finding MK Average", "question__title_slug": "finding-mk-average", "question__hide": false, - "total_acs": 2919, - "total_submitted": 10087, - "total_column_articles": 59, + "total_acs": 2929, + "total_submitted": 10116, + "total_column_articles": 61, "frontend_question_id": "1825", "is_new_question": false }, @@ -16056,8 +16287,8 @@ "question__title": "Minimum Sideway Jumps", "question__title_slug": "minimum-sideway-jumps", "question__hide": false, - "total_acs": 8533, - "total_submitted": 13189, + "total_acs": 8594, + "total_submitted": 13284, "total_column_articles": 168, "frontend_question_id": "1824", "is_new_question": false @@ -16077,9 +16308,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": 13453, - "total_submitted": 18485, - "total_column_articles": 180, + "total_acs": 13779, + "total_submitted": 18887, + "total_column_articles": 186, "frontend_question_id": "1823", "is_new_question": false }, @@ -16098,9 +16329,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": 28332, - "total_submitted": 37533, - "total_column_articles": 316, + "total_acs": 28731, + "total_submitted": 38142, + "total_column_articles": 318, "frontend_question_id": "1822", "is_new_question": false }, @@ -16119,9 +16350,9 @@ "question__title": "Implement Trie II (Prefix Tree)", "question__title_slug": "implement-trie-ii-prefix-tree", "question__hide": false, - "total_acs": 1054, - "total_submitted": 1902, - "total_column_articles": 44, + "total_acs": 1100, + "total_submitted": 1984, + "total_column_articles": 46, "frontend_question_id": "1804", "is_new_question": false }, @@ -16140,9 +16371,9 @@ "question__title": "Rearrange Products Table", "question__title_slug": "rearrange-products-table", "question__hide": false, - "total_acs": 5966, - "total_submitted": 7563, - "total_column_articles": 48, + "total_acs": 6879, + "total_submitted": 8674, + "total_column_articles": 54, "frontend_question_id": "1795", "is_new_question": false }, @@ -16161,8 +16392,8 @@ "question__title": "Number of Different Subsequences GCDs", "question__title_slug": "number-of-different-subsequences-gcds", "question__hide": false, - "total_acs": 2913, - "total_submitted": 7319, + "total_acs": 2934, + "total_submitted": 7348, "total_column_articles": 37, "frontend_question_id": "1819", "is_new_question": false @@ -16182,9 +16413,9 @@ "question__title": "Minimum Absolute Sum Difference", "question__title_slug": "minimum-absolute-sum-difference", "question__hide": false, - "total_acs": 27360, - "total_submitted": 73460, - "total_column_articles": 358, + "total_acs": 27511, + "total_submitted": 73829, + "total_column_articles": 359, "frontend_question_id": "1818", "is_new_question": false }, @@ -16203,8 +16434,8 @@ "question__title": "Finding the Users Active Minutes", "question__title_slug": "finding-the-users-active-minutes", "question__hide": false, - "total_acs": 6894, - "total_submitted": 9860, + "total_acs": 6935, + "total_submitted": 9910, "total_column_articles": 116, "frontend_question_id": "1817", "is_new_question": false @@ -16224,8 +16455,8 @@ "question__title": "Truncate Sentence", "question__title_slug": "truncate-sentence", "question__hide": false, - "total_acs": 49528, - "total_submitted": 67819, + "total_acs": 49646, + "total_submitted": 67985, "total_column_articles": 658, "frontend_question_id": "1816", "is_new_question": false @@ -16266,8 +16497,8 @@ "question__title": "Primary Department for Each Employee", "question__title_slug": "primary-department-for-each-employee", "question__hide": false, - "total_acs": 2750, - "total_submitted": 3865, + "total_acs": 2801, + "total_submitted": 3928, "total_column_articles": 37, "frontend_question_id": "1789", "is_new_question": false @@ -16287,8 +16518,8 @@ "question__title": "Minimum Number of Operations to Make String Sorted", "question__title_slug": "minimum-number-of-operations-to-make-string-sorted", "question__hide": false, - "total_acs": 1019, - "total_submitted": 2043, + "total_acs": 1028, + "total_submitted": 2056, "total_column_articles": 23, "frontend_question_id": "1830", "is_new_question": false @@ -16308,8 +16539,8 @@ "question__title": "Maximum XOR for Each Query", "question__title_slug": "maximum-xor-for-each-query", "question__hide": false, - "total_acs": 4828, - "total_submitted": 6906, + "total_acs": 4859, + "total_submitted": 6945, "total_column_articles": 91, "frontend_question_id": "1829", "is_new_question": false @@ -16329,9 +16560,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": 10083, - "total_submitted": 11651, - "total_column_articles": 142, + "total_acs": 10219, + "total_submitted": 11803, + "total_column_articles": 143, "frontend_question_id": "1828", "is_new_question": false }, @@ -16350,9 +16581,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": 13444, - "total_submitted": 17088, - "total_column_articles": 186, + "total_acs": 13602, + "total_submitted": 17310, + "total_column_articles": 189, "frontend_question_id": "1827", "is_new_question": false }, @@ -16371,8 +16602,8 @@ "question__title": "Maximize the Beauty of the Garden", "question__title_slug": "maximize-the-beauty-of-the-garden", "question__hide": false, - "total_acs": 357, - "total_submitted": 568, + "total_acs": 360, + "total_submitted": 571, "total_column_articles": 24, "frontend_question_id": "1788", "is_new_question": false @@ -16392,8 +16623,8 @@ "question__title": "Maximize Number of Nice Divisors", "question__title_slug": "maximize-number-of-nice-divisors", "question__hide": false, - "total_acs": 2700, - "total_submitted": 9896, + "total_acs": 2733, + "total_submitted": 9966, "total_column_articles": 50, "frontend_question_id": "1808", "is_new_question": false @@ -16413,8 +16644,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": 5655, - "total_submitted": 8532, + "total_acs": 5678, + "total_submitted": 8558, "total_column_articles": 87, "frontend_question_id": "1806", "is_new_question": false @@ -16434,9 +16665,9 @@ "question__title": "Evaluate the Bracket Pairs of a String", "question__title_slug": "evaluate-the-bracket-pairs-of-a-string", "question__hide": false, - "total_acs": 6624, - "total_submitted": 11238, - "total_column_articles": 100, + "total_acs": 6647, + "total_submitted": 11285, + "total_column_articles": 101, "frontend_question_id": "1807", "is_new_question": false }, @@ -16455,9 +16686,9 @@ "question__title": "Number of Different Integers in a String", "question__title_slug": "number-of-different-integers-in-a-string", "question__hide": false, - "total_acs": 13222, - "total_submitted": 28392, - "total_column_articles": 191, + "total_acs": 13305, + "total_submitted": 28670, + "total_column_articles": 194, "frontend_question_id": "1805", "is_new_question": false }, @@ -16476,9 +16707,9 @@ "question__title": "Grand Slam Titles", "question__title_slug": "grand-slam-titles", "question__hide": false, - "total_acs": 2183, - "total_submitted": 2728, - "total_column_articles": 36, + "total_acs": 2308, + "total_submitted": 2877, + "total_column_articles": 37, "frontend_question_id": "1783", "is_new_question": false }, @@ -16497,8 +16728,8 @@ "question__title": "Shortest Path in a Hidden Grid", "question__title_slug": "shortest-path-in-a-hidden-grid", "question__hide": false, - "total_acs": 326, - "total_submitted": 633, + "total_acs": 329, + "total_submitted": 637, "total_column_articles": 14, "frontend_question_id": "1778", "is_new_question": false @@ -16518,8 +16749,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": 3747, - "total_submitted": 7003, + "total_acs": 3793, + "total_submitted": 7060, "total_column_articles": 57, "frontend_question_id": "1798", "is_new_question": false @@ -16539,9 +16770,9 @@ "question__title": "Maximum Value at a Given Index in a Bounded Array", "question__title_slug": "maximum-value-at-a-given-index-in-a-bounded-array", "question__hide": false, - "total_acs": 4836, - "total_submitted": 17976, - "total_column_articles": 124, + "total_acs": 4931, + "total_submitted": 18169, + "total_column_articles": 127, "frontend_question_id": "1802", "is_new_question": false }, @@ -16560,8 +16791,8 @@ "question__title": "Number of Orders in the Backlog", "question__title_slug": "number-of-orders-in-the-backlog", "question__hide": false, - "total_acs": 4958, - "total_submitted": 12653, + "total_acs": 4979, + "total_submitted": 12718, "total_column_articles": 125, "frontend_question_id": "1801", "is_new_question": false @@ -16581,9 +16812,9 @@ "question__title": "Maximum Ascending Subarray Sum", "question__title_slug": "maximum-ascending-subarray-sum", "question__hide": false, - "total_acs": 11899, - "total_submitted": 17613, - "total_column_articles": 199, + "total_acs": 12027, + "total_submitted": 17840, + "total_column_articles": 201, "frontend_question_id": "1800", "is_new_question": false }, @@ -16602,8 +16833,8 @@ "question__title": "Product's Price for Each Store", "question__title_slug": "products-price-for-each-store", "question__hide": false, - "total_acs": 6896, - "total_submitted": 8769, + "total_acs": 6946, + "total_submitted": 8834, "total_column_articles": 72, "frontend_question_id": "1777", "is_new_question": false @@ -16623,8 +16854,8 @@ "question__title": "Count Nice Pairs in an Array", "question__title_slug": "count-nice-pairs-in-an-array", "question__hide": false, - "total_acs": 4206, - "total_submitted": 11830, + "total_acs": 4243, + "total_submitted": 11907, "total_column_articles": 96, "frontend_question_id": "1814", "is_new_question": false @@ -16644,9 +16875,9 @@ "question__title": "Maximum Number of Groups Getting Fresh Donuts", "question__title_slug": "maximum-number-of-groups-getting-fresh-donuts", "question__hide": false, - "total_acs": 2021, - "total_submitted": 6669, - "total_column_articles": 45, + "total_acs": 2042, + "total_submitted": 6715, + "total_column_articles": 46, "frontend_question_id": "1815", "is_new_question": false }, @@ -16665,8 +16896,8 @@ "question__title": "Sentence Similarity III", "question__title_slug": "sentence-similarity-iii", "question__hide": false, - "total_acs": 6028, - "total_submitted": 12494, + "total_acs": 6051, + "total_submitted": 12570, "total_column_articles": 93, "frontend_question_id": "1813", "is_new_question": false @@ -16686,9 +16917,9 @@ "question__title": "Determine Color of a Chessboard Square", "question__title_slug": "determine-color-of-a-chessboard-square", "question__hide": false, - "total_acs": 10520, - "total_submitted": 13350, - "total_column_articles": 262, + "total_acs": 10598, + "total_submitted": 13451, + "total_column_articles": 265, "frontend_question_id": "1812", "is_new_question": false }, @@ -16707,8 +16938,8 @@ "question__title": "Sort Features by Popularity", "question__title_slug": "sort-features-by-popularity", "question__hide": false, - "total_acs": 566, - "total_submitted": 1176, + "total_acs": 569, + "total_submitted": 1183, "total_column_articles": 16, "frontend_question_id": "1772", "is_new_question": false @@ -16728,8 +16959,8 @@ "question__title": "Maximum Score of a Good Subarray", "question__title_slug": "maximum-score-of-a-good-subarray", "question__hide": false, - "total_acs": 4444, - "total_submitted": 10441, + "total_acs": 4488, + "total_submitted": 10523, "total_column_articles": 102, "frontend_question_id": "1793", "is_new_question": false @@ -16749,8 +16980,8 @@ "question__title": "Maximum Average Pass Ratio", "question__title_slug": "maximum-average-pass-ratio", "question__hide": false, - "total_acs": 7316, - "total_submitted": 14339, + "total_acs": 7339, + "total_submitted": 14384, "total_column_articles": 115, "frontend_question_id": "1792", "is_new_question": false @@ -16770,9 +17001,9 @@ "question__title": "Find Center of Star Graph", "question__title_slug": "find-center-of-star-graph", "question__hide": false, - "total_acs": 48024, - "total_submitted": 57198, - "total_column_articles": 451, + "total_acs": 48212, + "total_submitted": 57422, + "total_column_articles": 456, "frontend_question_id": "1791", "is_new_question": false }, @@ -16791,9 +17022,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": 19310, - "total_submitted": 33512, - "total_column_articles": 294, + "total_acs": 19614, + "total_submitted": 34196, + "total_column_articles": 299, "frontend_question_id": "1790", "is_new_question": false }, @@ -16812,9 +17043,9 @@ "question__title": "Find the Subtasks That Did Not Execute", "question__title_slug": "find-the-subtasks-that-did-not-execute", "question__hide": false, - "total_acs": 1424, - "total_submitted": 1810, - "total_column_articles": 29, + "total_acs": 1466, + "total_submitted": 1857, + "total_column_articles": 31, "frontend_question_id": "1767", "is_new_question": false }, @@ -16833,8 +17064,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": 12098, - "total_submitted": 18571, + "total_acs": 12172, + "total_submitted": 18660, "total_column_articles": 63, "frontend_question_id": "1787", "is_new_question": false @@ -16854,9 +17085,9 @@ "question__title": "Number of Restricted Paths From First to Last Node", "question__title_slug": "number-of-restricted-paths-from-first-to-last-node", "question__hide": false, - "total_acs": 4252, - "total_submitted": 12214, - "total_column_articles": 105, + "total_acs": 4291, + "total_submitted": 12330, + "total_column_articles": 106, "frontend_question_id": "1786", "is_new_question": false }, @@ -16875,9 +17106,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": 7096, - "total_submitted": 19836, - "total_column_articles": 70, + "total_acs": 7130, + "total_submitted": 19924, + "total_column_articles": 71, "frontend_question_id": "1785", "is_new_question": false }, @@ -16896,8 +17127,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": 10372, - "total_submitted": 24420, + "total_acs": 10484, + "total_submitted": 24735, "total_column_articles": 127, "frontend_question_id": "1784", "is_new_question": false @@ -16917,9 +17148,9 @@ "question__title": "Buildings With an Ocean View", "question__title_slug": "buildings-with-an-ocean-view", "question__hide": false, - "total_acs": 1958, - "total_submitted": 2776, - "total_column_articles": 36, + "total_acs": 1995, + "total_submitted": 2825, + "total_column_articles": 37, "frontend_question_id": "1762", "is_new_question": false }, @@ -16938,9 +17169,9 @@ "question__title": "Recyclable and Low Fat Products", "question__title_slug": "recyclable-and-low-fat-products", "question__hide": false, - "total_acs": 15368, - "total_submitted": 17171, - "total_column_articles": 68, + "total_acs": 17859, + "total_submitted": 20025, + "total_column_articles": 78, "frontend_question_id": "1757", "is_new_question": false }, @@ -16959,8 +17190,8 @@ "question__title": "Count Pairs With XOR in a Range", "question__title_slug": "count-pairs-with-xor-in-a-range", "question__hide": false, - "total_acs": 2387, - "total_submitted": 5759, + "total_acs": 2400, + "total_submitted": 5784, "total_column_articles": 57, "frontend_question_id": "1803", "is_new_question": false @@ -16980,8 +17211,8 @@ "question__title": "Maximize Score After N Operations", "question__title_slug": "maximize-score-after-n-operations", "question__hide": false, - "total_acs": 2860, - "total_submitted": 5435, + "total_acs": 2895, + "total_submitted": 5494, "total_column_articles": 38, "frontend_question_id": "1799", "is_new_question": false @@ -17001,9 +17232,9 @@ "question__title": "Design Authentication Manager", "question__title_slug": "design-authentication-manager", "question__hide": false, - "total_acs": 7338, - "total_submitted": 12796, - "total_column_articles": 108, + "total_acs": 7459, + "total_submitted": 13008, + "total_column_articles": 110, "frontend_question_id": "1797", "is_new_question": false }, @@ -17022,8 +17253,8 @@ "question__title": "Second Largest Digit in a String", "question__title_slug": "second-largest-digit-in-a-string", "question__hide": false, - "total_acs": 9206, - "total_submitted": 18838, + "total_acs": 9325, + "total_submitted": 19096, "total_column_articles": 172, "frontend_question_id": "1796", "is_new_question": false @@ -17043,8 +17274,8 @@ "question__title": "Design Most Recently Used Queue", "question__title_slug": "design-most-recently-used-queue", "question__hide": false, - "total_acs": 847, - "total_submitted": 1039, + "total_acs": 858, + "total_submitted": 1052, "total_column_articles": 20, "frontend_question_id": "1756", "is_new_question": false @@ -17064,8 +17295,8 @@ "question__title": "Car Fleet II", "question__title_slug": "car-fleet-ii", "question__hide": false, - "total_acs": 2157, - "total_submitted": 4639, + "total_acs": 2190, + "total_submitted": 4693, "total_column_articles": 47, "frontend_question_id": "1776", "is_new_question": false @@ -17085,8 +17316,8 @@ "question__title": "Equal Sum Arrays With Minimum Number of Operations", "question__title_slug": "equal-sum-arrays-with-minimum-number-of-operations", "question__hide": false, - "total_acs": 4928, - "total_submitted": 10218, + "total_acs": 4967, + "total_submitted": 10271, "total_column_articles": 106, "frontend_question_id": "1775", "is_new_question": false @@ -17106,8 +17337,8 @@ "question__title": "Closest Dessert Cost", "question__title_slug": "closest-dessert-cost", "question__hide": false, - "total_acs": 6951, - "total_submitted": 12929, + "total_acs": 7006, + "total_submitted": 13042, "total_column_articles": 101, "frontend_question_id": "1774", "is_new_question": false @@ -17127,9 +17358,9 @@ "question__title": "Count Items Matching a Rule", "question__title_slug": "count-items-matching-a-rule", "question__hide": false, - "total_acs": 18950, - "total_submitted": 22480, - "total_column_articles": 233, + "total_acs": 19087, + "total_submitted": 22643, + "total_column_articles": 234, "frontend_question_id": "1773", "is_new_question": false }, @@ -17148,9 +17379,9 @@ "question__title": "Leetflex Banned Accounts", "question__title_slug": "leetflex-banned-accounts", "question__hide": false, - "total_acs": 2271, - "total_submitted": 3337, - "total_column_articles": 40, + "total_acs": 2377, + "total_submitted": 3508, + "total_column_articles": 43, "frontend_question_id": "1747", "is_new_question": false }, @@ -17169,8 +17400,8 @@ "question__title": "Maximize Palindrome Length From Subsequences", "question__title_slug": "maximize-palindrome-length-from-subsequences", "question__hide": false, - "total_acs": 2614, - "total_submitted": 7057, + "total_acs": 2631, + "total_submitted": 7109, "total_column_articles": 48, "frontend_question_id": "1771", "is_new_question": false @@ -17190,9 +17421,9 @@ "question__title": "Maximum Score from Performing Multiplication Operations", "question__title_slug": "maximum-score-from-performing-multiplication-operations", "question__hide": false, - "total_acs": 4754, - "total_submitted": 12552, - "total_column_articles": 112, + "total_acs": 4788, + "total_submitted": 12613, + "total_column_articles": 113, "frontend_question_id": "1770", "is_new_question": false }, @@ -17211,8 +17442,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": 11810, - "total_submitted": 13826, + "total_acs": 11880, + "total_submitted": 13911, "total_column_articles": 211, "frontend_question_id": "1769", "is_new_question": false @@ -17232,9 +17463,9 @@ "question__title": "Merge Strings Alternately", "question__title_slug": "merge-strings-alternately", "question__hide": false, - "total_acs": 16782, - "total_submitted": 22096, - "total_column_articles": 322, + "total_acs": 17061, + "total_submitted": 22458, + "total_column_articles": 324, "frontend_question_id": "1768", "is_new_question": false }, @@ -17253,9 +17484,9 @@ "question__title": "Maximum Subarray Sum After One Operation", "question__title_slug": "maximum-subarray-sum-after-one-operation", "question__hide": false, - "total_acs": 1896, - "total_submitted": 3200, - "total_column_articles": 62, + "total_acs": 1914, + "total_submitted": 3226, + "total_column_articles": 63, "frontend_question_id": "1746", "is_new_question": false }, @@ -17274,9 +17505,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": 5288, - "total_submitted": 6236, - "total_column_articles": 44, + "total_acs": 5914, + "total_submitted": 6951, + "total_column_articles": 47, "frontend_question_id": "1741", "is_new_question": false }, @@ -17295,9 +17526,9 @@ "question__title": "Count Pairs Of Nodes", "question__title_slug": "count-pairs-of-nodes", "question__hide": false, - "total_acs": 1407, - "total_submitted": 4513, - "total_column_articles": 38, + "total_acs": 1429, + "total_submitted": 4544, + "total_column_articles": 39, "frontend_question_id": "1782", "is_new_question": false }, @@ -17316,8 +17547,8 @@ "question__title": "Sum of Beauty of All Substrings", "question__title_slug": "sum-of-beauty-of-all-substrings", "question__hide": false, - "total_acs": 4757, - "total_submitted": 8864, + "total_acs": 4786, + "total_submitted": 8905, "total_column_articles": 69, "frontend_question_id": "1781", "is_new_question": false @@ -17337,9 +17568,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": 6856, - "total_submitted": 10212, - "total_column_articles": 130, + "total_acs": 6895, + "total_submitted": 10269, + "total_column_articles": 131, "frontend_question_id": "1780", "is_new_question": false }, @@ -17358,9 +17589,9 @@ "question__title": "Find Nearest Point That Has the Same X or Y Coordinate", "question__title_slug": "find-nearest-point-that-has-the-same-x-or-y-coordinate", "question__hide": false, - "total_acs": 11812, - "total_submitted": 18230, - "total_column_articles": 200, + "total_acs": 12102, + "total_submitted": 18655, + "total_column_articles": 203, "frontend_question_id": "1779", "is_new_question": false }, @@ -17379,8 +17610,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": 2991, - "total_submitted": 6725, + "total_acs": 3011, + "total_submitted": 6775, "total_column_articles": 45, "frontend_question_id": "1761", "is_new_question": false @@ -17400,9 +17631,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": 5929, - "total_submitted": 10548, - "total_column_articles": 102, + "total_acs": 6194, + "total_submitted": 10976, + "total_column_articles": 105, "frontend_question_id": "1760", "is_new_question": false }, @@ -17421,9 +17652,9 @@ "question__title": "Count Number of Homogenous Substrings", "question__title_slug": "count-number-of-homogenous-substrings", "question__hide": false, - "total_acs": 5404, - "total_submitted": 12287, - "total_column_articles": 106, + "total_acs": 5435, + "total_submitted": 12358, + "total_column_articles": 107, "frontend_question_id": "1759", "is_new_question": false }, @@ -17442,9 +17673,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": 8741, - "total_submitted": 13672, - "total_column_articles": 137, + "total_acs": 8808, + "total_submitted": 13799, + "total_column_articles": 138, "frontend_question_id": "1758", "is_new_question": false }, @@ -17463,8 +17694,8 @@ "question__title": "Find Distance in a Binary Tree", "question__title_slug": "find-distance-in-a-binary-tree", "question__hide": false, - "total_acs": 1019, - "total_submitted": 1522, + "total_acs": 1031, + "total_submitted": 1547, "total_column_articles": 37, "frontend_question_id": "1740", "is_new_question": false @@ -17484,9 +17715,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": 3099, - "total_submitted": 6794, - "total_column_articles": 37, + "total_acs": 3232, + "total_submitted": 7077, + "total_column_articles": 38, "frontend_question_id": "1731", "is_new_question": false }, @@ -17505,9 +17736,9 @@ "question__title": "Closest Subsequence Sum", "question__title_slug": "closest-subsequence-sum", "question__hide": false, - "total_acs": 3971, - "total_submitted": 9250, - "total_column_articles": 63, + "total_acs": 4019, + "total_submitted": 9353, + "total_column_articles": 64, "frontend_question_id": "1755", "is_new_question": false }, @@ -17526,8 +17757,8 @@ "question__title": "Largest Merge Of Two Strings", "question__title_slug": "largest-merge-of-two-strings", "question__hide": false, - "total_acs": 4888, - "total_submitted": 11334, + "total_acs": 4916, + "total_submitted": 11403, "total_column_articles": 96, "frontend_question_id": "1754", "is_new_question": false @@ -17547,8 +17778,8 @@ "question__title": "Maximum Score From Removing Stones", "question__title_slug": "maximum-score-from-removing-stones", "question__hide": false, - "total_acs": 7380, - "total_submitted": 11682, + "total_acs": 7429, + "total_submitted": 11762, "total_column_articles": 153, "frontend_question_id": "1753", "is_new_question": false @@ -17568,9 +17799,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": 11002, - "total_submitted": 16993, - "total_column_articles": 144, + "total_acs": 11051, + "total_submitted": 17088, + "total_column_articles": 145, "frontend_question_id": "1752", "is_new_question": false }, @@ -17589,9 +17820,9 @@ "question__title": "Find Followers Count", "question__title_slug": "find-followers-count", "question__hide": false, - "total_acs": 5412, - "total_submitted": 8584, - "total_column_articles": 37, + "total_acs": 6109, + "total_submitted": 9686, + "total_column_articles": 40, "frontend_question_id": "1729", "is_new_question": false }, @@ -17610,9 +17841,9 @@ "question__title": "Map of Highest Peak", "question__title_slug": "map-of-highest-peak", "question__hide": false, - "total_acs": 21627, - "total_submitted": 32510, - "total_column_articles": 305, + "total_acs": 21684, + "total_submitted": 32620, + "total_column_articles": 307, "frontend_question_id": "1765", "is_new_question": false }, @@ -17631,8 +17862,8 @@ "question__title": "Tree of Coprimes", "question__title_slug": "tree-of-coprimes", "question__hide": false, - "total_acs": 1704, - "total_submitted": 4403, + "total_acs": 1711, + "total_submitted": 4425, "total_column_articles": 33, "frontend_question_id": "1766", "is_new_question": false @@ -17652,9 +17883,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": 2877, - "total_submitted": 6072, - "total_column_articles": 69, + "total_acs": 2910, + "total_submitted": 6130, + "total_column_articles": 70, "frontend_question_id": "1764", "is_new_question": false }, @@ -17673,9 +17904,9 @@ "question__title": "Longest Nice Substring", "question__title_slug": "longest-nice-substring", "question__hide": false, - "total_acs": 24472, - "total_submitted": 35414, - "total_column_articles": 260, + "total_acs": 24571, + "total_submitted": 35577, + "total_column_articles": 261, "frontend_question_id": "1763", "is_new_question": false }, @@ -17694,8 +17925,8 @@ "question__title": "Can You Eat Your Favorite Candy on Your Favorite Day?", "question__title_slug": "can-you-eat-your-favorite-candy-on-your-favorite-day", "question__hide": false, - "total_acs": 29019, - "total_submitted": 80153, + "total_acs": 29056, + "total_submitted": 80280, "total_column_articles": 373, "frontend_question_id": "1744", "is_new_question": false @@ -17715,8 +17946,8 @@ "question__title": "Palindrome Partitioning IV", "question__title_slug": "palindrome-partitioning-iv", "question__hide": false, - "total_acs": 4021, - "total_submitted": 8226, + "total_acs": 4045, + "total_submitted": 8274, "total_column_articles": 80, "frontend_question_id": "1745", "is_new_question": false @@ -17736,9 +17967,9 @@ "question__title": "Restore the Array From Adjacent Pairs", "question__title_slug": "restore-the-array-from-adjacent-pairs", "question__hide": false, - "total_acs": 23188, - "total_submitted": 33302, - "total_column_articles": 337, + "total_acs": 23235, + "total_submitted": 33367, + "total_column_articles": 339, "frontend_question_id": "1743", "is_new_question": false }, @@ -17757,8 +17988,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": 451, - "total_submitted": 811, + "total_acs": 452, + "total_submitted": 814, "total_column_articles": 17, "frontend_question_id": "1724", "is_new_question": false @@ -17778,8 +18009,8 @@ "question__title": "Count Apples and Oranges", "question__title_slug": "count-apples-and-oranges", "question__hide": false, - "total_acs": 2571, - "total_submitted": 3569, + "total_acs": 2623, + "total_submitted": 3633, "total_column_articles": 42, "frontend_question_id": "1715", "is_new_question": false @@ -17799,9 +18030,9 @@ "question__title": "Building Boxes", "question__title_slug": "building-boxes", "question__hide": false, - "total_acs": 3163, - "total_submitted": 6555, - "total_column_articles": 70, + "total_acs": 3182, + "total_submitted": 6584, + "total_column_articles": 71, "frontend_question_id": "1739", "is_new_question": false }, @@ -17820,8 +18051,8 @@ "question__title": "Find Kth Largest XOR Coordinate Value", "question__title_slug": "find-kth-largest-xor-coordinate-value", "question__hide": false, - "total_acs": 29577, - "total_submitted": 45347, + "total_acs": 29674, + "total_submitted": 45475, "total_column_articles": 401, "frontend_question_id": "1738", "is_new_question": false @@ -17841,8 +18072,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": 4423, - "total_submitted": 13207, + "total_acs": 4432, + "total_submitted": 13228, "total_column_articles": 109, "frontend_question_id": "1737", "is_new_question": false @@ -17862,8 +18093,8 @@ "question__title": "Latest Time by Replacing Hidden Digits", "question__title_slug": "latest-time-by-replacing-hidden-digits", "question__hide": false, - "total_acs": 30328, - "total_submitted": 67767, + "total_acs": 30399, + "total_submitted": 67955, "total_column_articles": 374, "frontend_question_id": "1736", "is_new_question": false @@ -17883,9 +18114,9 @@ "question__title": "Biggest Window Between Visits", "question__title_slug": "biggest-window-between-visits", "question__hide": false, - "total_acs": 2511, - "total_submitted": 3476, - "total_column_articles": 49, + "total_acs": 2619, + "total_submitted": 3610, + "total_column_articles": 50, "frontend_question_id": "1709", "is_new_question": false }, @@ -17904,9 +18135,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": 3449, - "total_submitted": 6878, - "total_column_articles": 52, + "total_acs": 3516, + "total_submitted": 7023, + "total_column_articles": 53, "frontend_question_id": "1751", "is_new_question": false }, @@ -17925,8 +18156,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": 4135, - "total_submitted": 9232, + "total_acs": 4171, + "total_submitted": 9315, "total_column_articles": 96, "frontend_question_id": "1750", "is_new_question": false @@ -17946,8 +18177,8 @@ "question__title": "Maximum Absolute Sum of Any Subarray", "question__title_slug": "maximum-absolute-sum-of-any-subarray", "question__hide": false, - "total_acs": 4846, - "total_submitted": 9009, + "total_acs": 4908, + "total_submitted": 9114, "total_column_articles": 108, "frontend_question_id": "1749", "is_new_question": false @@ -17967,8 +18198,8 @@ "question__title": "Sum of Unique Elements", "question__title_slug": "sum-of-unique-elements", "question__hide": false, - "total_acs": 39331, - "total_submitted": 49812, + "total_acs": 39609, + "total_submitted": 50259, "total_column_articles": 565, "frontend_question_id": "1748", "is_new_question": false @@ -17988,8 +18219,8 @@ "question__title": "Largest Subarray Length K", "question__title_slug": "largest-subarray-length-k", "question__hide": false, - "total_acs": 1295, - "total_submitted": 1860, + "total_acs": 1310, + "total_submitted": 1883, "total_column_articles": 37, "frontend_question_id": "1708", "is_new_question": false @@ -18009,8 +18240,8 @@ "question__title": "Largest Submatrix With Rearrangements", "question__title_slug": "largest-submatrix-with-rearrangements", "question__hide": false, - "total_acs": 3816, - "total_submitted": 6585, + "total_acs": 3827, + "total_submitted": 6598, "total_column_articles": 84, "frontend_question_id": "1727", "is_new_question": false @@ -18030,9 +18261,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": 10209, - "total_submitted": 14353, - "total_column_articles": 154, + "total_acs": 10300, + "total_submitted": 14478, + "total_column_articles": 156, "frontend_question_id": "1742", "is_new_question": false }, @@ -18051,9 +18282,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": 34670, - "total_submitted": 41585, - "total_column_articles": 419, + "total_acs": 34818, + "total_submitted": 41778, + "total_column_articles": 420, "frontend_question_id": "1725", "is_new_question": false }, @@ -18072,9 +18303,9 @@ "question__title": "Number of Calls Between Two Persons", "question__title_slug": "number-of-calls-between-two-persons", "question__hide": false, - "total_acs": 3619, - "total_submitted": 4594, - "total_column_articles": 55, + "total_acs": 3861, + "total_submitted": 4932, + "total_column_articles": 56, "frontend_question_id": "1699", "is_new_question": false }, @@ -18093,8 +18324,8 @@ "question__title": "Minimize Hamming Distance After Swap Operations", "question__title_slug": "minimize-hamming-distance-after-swap-operations", "question__hide": false, - "total_acs": 5272, - "total_submitted": 10359, + "total_acs": 5294, + "total_submitted": 10407, "total_column_articles": 124, "frontend_question_id": "1722", "is_new_question": false @@ -18114,8 +18345,8 @@ "question__title": "Decode XORed Array", "question__title_slug": "decode-xored-array", "question__hide": false, - "total_acs": 49532, - "total_submitted": 57098, + "total_acs": 49730, + "total_submitted": 57342, "total_column_articles": 520, "frontend_question_id": "1720", "is_new_question": false @@ -18135,9 +18366,9 @@ "question__title": "Number of Distinct Substrings in a String", "question__title_slug": "number-of-distinct-substrings-in-a-string", "question__hide": false, - "total_acs": 696, - "total_submitted": 1350, - "total_column_articles": 21, + "total_acs": 709, + "total_submitted": 1375, + "total_column_articles": 22, "frontend_question_id": "1698", "is_new_question": false }, @@ -18156,9 +18387,9 @@ "question__title": "Daily Leads and Partners", "question__title_slug": "daily-leads-and-partners", "question__hide": false, - "total_acs": 5381, - "total_submitted": 6584, - "total_column_articles": 56, + "total_acs": 6003, + "total_submitted": 7349, + "total_column_articles": 59, "frontend_question_id": "1693", "is_new_question": false }, @@ -18177,9 +18408,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": 1209, - "total_submitted": 2444, - "total_column_articles": 30, + "total_acs": 1219, + "total_submitted": 2464, + "total_column_articles": 31, "frontend_question_id": "1735", "is_new_question": false }, @@ -18198,8 +18429,8 @@ "question__title": "Decode XORed Permutation", "question__title_slug": "decode-xored-permutation", "question__hide": false, - "total_acs": 28538, - "total_submitted": 39463, + "total_acs": 28563, + "total_submitted": 39493, "total_column_articles": 372, "frontend_question_id": "1734", "is_new_question": false @@ -18219,8 +18450,8 @@ "question__title": "Minimum Number of People to Teach", "question__title_slug": "minimum-number-of-people-to-teach", "question__hide": false, - "total_acs": 2602, - "total_submitted": 5532, + "total_acs": 2613, + "total_submitted": 5546, "total_column_articles": 65, "frontend_question_id": "1733", "is_new_question": false @@ -18240,9 +18471,9 @@ "question__title": "Find the Highest Altitude", "question__title_slug": "find-the-highest-altitude", "question__hide": false, - "total_acs": 15455, - "total_submitted": 19665, - "total_column_articles": 247, + "total_acs": 15696, + "total_submitted": 20001, + "total_column_articles": 252, "frontend_question_id": "1732", "is_new_question": false }, @@ -18261,9 +18492,9 @@ "question__title": "Minimum Operations to Make a Subsequence", "question__title_slug": "minimum-operations-to-make-a-subsequence", "question__hide": false, - "total_acs": 16679, - "total_submitted": 33711, - "total_column_articles": 182, + "total_acs": 16741, + "total_submitted": 33845, + "total_column_articles": 184, "frontend_question_id": "1713", "is_new_question": false }, @@ -18282,9 +18513,9 @@ "question__title": "Ways to Split Array Into Three Subarrays", "question__title_slug": "ways-to-split-array-into-three-subarrays", "question__hide": false, - "total_acs": 8219, - "total_submitted": 30546, - "total_column_articles": 123, + "total_acs": 8437, + "total_submitted": 31190, + "total_column_articles": 128, "frontend_question_id": "1712", "is_new_question": false }, @@ -18303,8 +18534,8 @@ "question__title": "Count Good Meals", "question__title_slug": "count-good-meals", "question__hide": false, - "total_acs": 31093, - "total_submitted": 86612, + "total_acs": 31159, + "total_submitted": 86778, "total_column_articles": 366, "frontend_question_id": "1711", "is_new_question": false @@ -18324,9 +18555,9 @@ "question__title": "Maximum Units on a Truck", "question__title_slug": "maximum-units-on-a-truck", "question__hide": false, - "total_acs": 15430, - "total_submitted": 22158, - "total_column_articles": 228, + "total_acs": 15620, + "total_submitted": 22443, + "total_column_articles": 233, "frontend_question_id": "1710", "is_new_question": false }, @@ -18345,8 +18576,8 @@ "question__title": "Count Ways to Distribute Candies", "question__title_slug": "count-ways-to-distribute-candies", "question__hide": false, - "total_acs": 388, - "total_submitted": 589, + "total_acs": 397, + "total_submitted": 599, "total_column_articles": 15, "frontend_question_id": "1692", "is_new_question": false @@ -18366,8 +18597,8 @@ "question__title": "Invalid Tweets", "question__title_slug": "invalid-tweets", "question__hide": false, - "total_acs": 5031, - "total_submitted": 5585, + "total_acs": 5079, + "total_submitted": 5636, "total_column_articles": 45, "frontend_question_id": "1683", "is_new_question": false @@ -18387,9 +18618,9 @@ "question__title": "Maximum XOR With an Element From Array", "question__title_slug": "maximum-xor-with-an-element-from-array", "question__hide": false, - "total_acs": 14946, - "total_submitted": 29711, - "total_column_articles": 161, + "total_acs": 14996, + "total_submitted": 29780, + "total_column_articles": 160, "frontend_question_id": "1707", "is_new_question": false }, @@ -18408,8 +18639,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": 25362, - "total_submitted": 50068, + "total_acs": 25476, + "total_submitted": 50268, "total_column_articles": 187, "frontend_question_id": "1723", "is_new_question": false @@ -18429,8 +18660,8 @@ "question__title": "Maximum Number of Eaten Apples", "question__title_slug": "maximum-number-of-eaten-apples", "question__hide": false, - "total_acs": 26396, - "total_submitted": 58251, + "total_acs": 26466, + "total_submitted": 58454, "total_column_articles": 353, "frontend_question_id": "1705", "is_new_question": false @@ -18450,9 +18681,9 @@ "question__title": "Determine if String Halves Are Alike", "question__title_slug": "determine-if-string-halves-are-alike", "question__hide": false, - "total_acs": 14522, - "total_submitted": 18715, - "total_column_articles": 224, + "total_acs": 14607, + "total_submitted": 18834, + "total_column_articles": 225, "frontend_question_id": "1704", "is_new_question": false }, @@ -18471,8 +18702,8 @@ "question__title": "Longest Palindromic Subsequence II", "question__title_slug": "longest-palindromic-subsequence-ii", "question__hide": false, - "total_acs": 615, - "total_submitted": 1120, + "total_acs": 620, + "total_submitted": 1127, "total_column_articles": 27, "frontend_question_id": "1682", "is_new_question": false @@ -18492,8 +18723,8 @@ "question__title": "Product's Worth Over Invoices", "question__title_slug": "products-worth-over-invoices", "question__hide": false, - "total_acs": 3105, - "total_submitted": 8550, + "total_acs": 3144, + "total_submitted": 8677, "total_column_articles": 44, "frontend_question_id": "1677", "is_new_question": false @@ -18513,9 +18744,9 @@ "question__title": "Number Of Ways To Reconstruct A Tree", "question__title_slug": "number-of-ways-to-reconstruct-a-tree", "question__hide": false, - "total_acs": 12627, - "total_submitted": 18096, - "total_column_articles": 90, + "total_acs": 12640, + "total_submitted": 18113, + "total_column_articles": 91, "frontend_question_id": "1719", "is_new_question": false }, @@ -18534,8 +18765,8 @@ "question__title": "Construct the Lexicographically Largest Valid Sequence", "question__title_slug": "construct-the-lexicographically-largest-valid-sequence", "question__hide": false, - "total_acs": 2499, - "total_submitted": 4995, + "total_acs": 2520, + "total_submitted": 5030, "total_column_articles": 58, "frontend_question_id": "1718", "is_new_question": false @@ -18555,8 +18786,8 @@ "question__title": "Maximum Score From Removing Substrings", "question__title_slug": "maximum-score-from-removing-substrings", "question__hide": false, - "total_acs": 2810, - "total_submitted": 6278, + "total_acs": 2815, + "total_submitted": 6344, "total_column_articles": 60, "frontend_question_id": "1717", "is_new_question": false @@ -18576,9 +18807,9 @@ "question__title": "Calculate Money in Leetcode Bank", "question__title_slug": "calculate-money-in-leetcode-bank", "question__hide": false, - "total_acs": 37674, - "total_submitted": 53619, - "total_column_articles": 678, + "total_acs": 37783, + "total_submitted": 53794, + "total_column_articles": 680, "frontend_question_id": "1716", "is_new_question": false }, @@ -18597,9 +18828,9 @@ "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": 1480, - "total_submitted": 1884, - "total_column_articles": 35, + "total_acs": 1531, + "total_submitted": 1943, + "total_column_articles": 36, "frontend_question_id": "1676", "is_new_question": false }, @@ -18618,8 +18849,8 @@ "question__title": "Checking Existence of Edge Length Limited Paths", "question__title_slug": "checking-existence-of-edge-length-limited-paths", "question__hide": false, - "total_acs": 2615, - "total_submitted": 4886, + "total_acs": 2651, + "total_submitted": 4929, "total_column_articles": 50, "frontend_question_id": "1697", "is_new_question": false @@ -18639,8 +18870,8 @@ "question__title": "Jump Game VI", "question__title_slug": "jump-game-vi", "question__hide": false, - "total_acs": 8311, - "total_submitted": 20978, + "total_acs": 8390, + "total_submitted": 21198, "total_column_articles": 137, "frontend_question_id": "1696", "is_new_question": false @@ -18660,9 +18891,9 @@ "question__title": "Maximum Erasure Value", "question__title_slug": "maximum-erasure-value", "question__hide": false, - "total_acs": 9179, - "total_submitted": 18634, - "total_column_articles": 168, + "total_acs": 9342, + "total_submitted": 18888, + "total_column_articles": 171, "frontend_question_id": "1695", "is_new_question": false }, @@ -18681,9 +18912,9 @@ "question__title": "Reformat Phone Number", "question__title_slug": "reformat-phone-number", "question__hide": false, - "total_acs": 9356, - "total_submitted": 14844, - "total_column_articles": 160, + "total_acs": 9452, + "total_submitted": 15024, + "total_column_articles": 161, "frontend_question_id": "1694", "is_new_question": false }, @@ -18702,9 +18933,9 @@ "question__title": "Fix Names in a Table", "question__title_slug": "fix-names-in-a-table", "question__hide": false, - "total_acs": 7840, - "total_submitted": 12403, - "total_column_articles": 71, + "total_acs": 9037, + "total_submitted": 14229, + "total_column_articles": 82, "frontend_question_id": "1667", "is_new_question": false }, @@ -18723,8 +18954,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": 362, - "total_submitted": 557, + "total_acs": 366, + "total_submitted": 562, "total_column_articles": 17, "frontend_question_id": "1666", "is_new_question": false @@ -18744,8 +18975,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": 311, - "total_submitted": 535, + "total_acs": 321, + "total_submitted": 558, "total_column_articles": 11, "frontend_question_id": "1714", "is_new_question": false @@ -18765,8 +18996,8 @@ "question__title": "Stone Game VII", "question__title_slug": "stone-game-vii", "question__hide": false, - "total_acs": 5151, - "total_submitted": 9632, + "total_acs": 5181, + "total_submitted": 9668, "total_column_articles": 112, "frontend_question_id": "1690", "is_new_question": false @@ -18786,8 +19017,8 @@ "question__title": "Partitioning Into Minimum Number Of Deci-Binary Numbers", "question__title_slug": "partitioning-into-minimum-number-of-deci-binary-numbers", "question__hide": false, - "total_acs": 17313, - "total_submitted": 20016, + "total_acs": 17432, + "total_submitted": 20169, "total_column_articles": 232, "frontend_question_id": "1689", "is_new_question": false @@ -18807,9 +19038,9 @@ "question__title": "Count of Matches in Tournament", "question__title_slug": "count-of-matches-in-tournament", "question__hide": false, - "total_acs": 53584, - "total_submitted": 63527, - "total_column_articles": 571, + "total_acs": 53810, + "total_submitted": 63837, + "total_column_articles": 574, "frontend_question_id": "1688", "is_new_question": false }, @@ -18828,8 +19059,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": 1750, - "total_submitted": 4445, + "total_acs": 1777, + "total_submitted": 4570, "total_column_articles": 29, "frontend_question_id": "1703", "is_new_question": false @@ -18849,8 +19080,8 @@ "question__title": "Maximum Binary String After Change", "question__title_slug": "maximum-binary-string-after-change", "question__hide": false, - "total_acs": 3543, - "total_submitted": 7379, + "total_acs": 3574, + "total_submitted": 7441, "total_column_articles": 70, "frontend_question_id": "1702", "is_new_question": false @@ -18870,9 +19101,9 @@ "question__title": "Average Waiting Time", "question__title_slug": "average-waiting-time", "question__hide": false, - "total_acs": 4914, - "total_submitted": 8025, - "total_column_articles": 104, + "total_acs": 4973, + "total_submitted": 8108, + "total_column_articles": 105, "frontend_question_id": "1701", "is_new_question": false }, @@ -18891,9 +19122,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": 11502, - "total_submitted": 16525, - "total_column_articles": 244, + "total_acs": 11611, + "total_submitted": 16755, + "total_column_articles": 246, "frontend_question_id": "1700", "is_new_question": false }, @@ -18912,8 +19143,8 @@ "question__title": "Average Time of Process per Machine", "question__title_slug": "average-time-of-process-per-machine", "question__hide": false, - "total_acs": 4176, - "total_submitted": 5615, + "total_acs": 4233, + "total_submitted": 5706, "total_column_articles": 75, "frontend_question_id": "1661", "is_new_question": false @@ -18933,9 +19164,9 @@ "question__title": "Concatenation of Consecutive Binary Numbers", "question__title_slug": "concatenation-of-consecutive-binary-numbers", "question__hide": false, - "total_acs": 6236, - "total_submitted": 13083, - "total_column_articles": 79, + "total_acs": 6282, + "total_submitted": 13150, + "total_column_articles": 81, "frontend_question_id": "1680", "is_new_question": false }, @@ -18954,8 +19185,8 @@ "question__title": "Minimum Incompatibility", "question__title_slug": "minimum-incompatibility", "question__hide": false, - "total_acs": 2825, - "total_submitted": 6979, + "total_acs": 2849, + "total_submitted": 7020, "total_column_articles": 55, "frontend_question_id": "1681", "is_new_question": false @@ -18975,9 +19206,9 @@ "question__title": "Max Number of K-Sum Pairs", "question__title_slug": "max-number-of-k-sum-pairs", "question__hide": false, - "total_acs": 8203, - "total_submitted": 16212, - "total_column_articles": 133, + "total_acs": 8249, + "total_submitted": 16281, + "total_column_articles": 134, "frontend_question_id": "1679", "is_new_question": false }, @@ -18996,9 +19227,9 @@ "question__title": "Goal Parser Interpretation", "question__title_slug": "goal-parser-interpretation", "question__hide": false, - "total_acs": 22084, - "total_submitted": 26532, - "total_column_articles": 378, + "total_acs": 22310, + "total_submitted": 26786, + "total_column_articles": 383, "frontend_question_id": "1678", "is_new_question": false }, @@ -19017,8 +19248,8 @@ "question__title": "Correct a Binary Tree", "question__title_slug": "correct-a-binary-tree", "question__hide": false, - "total_acs": 621, - "total_submitted": 841, + "total_acs": 633, + "total_submitted": 853, "total_column_articles": 29, "frontend_question_id": "1660", "is_new_question": false @@ -19038,9 +19269,9 @@ "question__title": "Hopper Company Queries III", "question__title_slug": "hopper-company-queries-iii", "question__hide": false, - "total_acs": 1213, - "total_submitted": 1829, - "total_column_articles": 28, + "total_acs": 1234, + "total_submitted": 1856, + "total_column_articles": 29, "frontend_question_id": "1651", "is_new_question": false }, @@ -19059,9 +19290,9 @@ "question__title": "Minimize Deviation in Array", "question__title_slug": "minimize-deviation-in-array", "question__hide": false, - "total_acs": 3263, - "total_submitted": 7566, - "total_column_articles": 55, + "total_acs": 3279, + "total_submitted": 7594, + "total_column_articles": 56, "frontend_question_id": "1675", "is_new_question": false }, @@ -19080,8 +19311,8 @@ "question__title": "Minimum Moves to Make Array Complementary", "question__title_slug": "minimum-moves-to-make-array-complementary", "question__hide": false, - "total_acs": 2995, - "total_submitted": 7774, + "total_acs": 3019, + "total_submitted": 7827, "total_column_articles": 61, "frontend_question_id": "1674", "is_new_question": false @@ -19101,9 +19332,9 @@ "question__title": "Find the Most Competitive Subsequence", "question__title_slug": "find-the-most-competitive-subsequence", "question__hide": false, - "total_acs": 8983, - "total_submitted": 24271, - "total_column_articles": 192, + "total_acs": 9022, + "total_submitted": 24380, + "total_column_articles": 193, "frontend_question_id": "1673", "is_new_question": false }, @@ -19122,9 +19353,9 @@ "question__title": "Richest Customer Wealth", "question__title_slug": "richest-customer-wealth", "question__hide": false, - "total_acs": 82563, - "total_submitted": 93942, - "total_column_articles": 848, + "total_acs": 83512, + "total_submitted": 95150, + "total_column_articles": 857, "frontend_question_id": "1672", "is_new_question": false }, @@ -19143,9 +19374,9 @@ "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": 2752, - "total_submitted": 3447, - "total_column_articles": 42, + "total_acs": 2830, + "total_submitted": 3536, + "total_column_articles": 44, "frontend_question_id": "1650", "is_new_question": false }, @@ -19164,9 +19395,9 @@ "question__title": "Delivering Boxes from Storage to Ports", "question__title_slug": "delivering-boxes-from-storage-to-ports", "question__hide": false, - "total_acs": 1318, - "total_submitted": 3091, - "total_column_articles": 27, + "total_acs": 1349, + "total_submitted": 3137, + "total_column_articles": 29, "frontend_question_id": "1687", "is_new_question": false }, @@ -19185,8 +19416,8 @@ "question__title": "Stone Game VI", "question__title_slug": "stone-game-vi", "question__hide": false, - "total_acs": 3368, - "total_submitted": 6971, + "total_acs": 3394, + "total_submitted": 7020, "total_column_articles": 55, "frontend_question_id": "1686", "is_new_question": false @@ -19206,8 +19437,8 @@ "question__title": "Sum of Absolute Differences in a Sorted Array", "question__title_slug": "sum-of-absolute-differences-in-a-sorted-array", "question__hide": false, - "total_acs": 5138, - "total_submitted": 8111, + "total_acs": 5208, + "total_submitted": 8204, "total_column_articles": 114, "frontend_question_id": "1685", "is_new_question": false @@ -19227,9 +19458,9 @@ "question__title": "Count the Number of Consistent Strings", "question__title_slug": "count-the-number-of-consistent-strings", "question__hide": false, - "total_acs": 21024, - "total_submitted": 25490, - "total_column_articles": 423, + "total_acs": 21161, + "total_submitted": 25648, + "total_column_articles": 424, "frontend_question_id": "1684", "is_new_question": false }, @@ -19248,8 +19479,8 @@ "question__title": "Hopper Company Queries II", "question__title_slug": "hopper-company-queries-ii", "question__hide": false, - "total_acs": 1208, - "total_submitted": 2928, + "total_acs": 1217, + "total_submitted": 2943, "total_column_articles": 30, "frontend_question_id": "1645", "is_new_question": false @@ -19269,8 +19500,8 @@ "question__title": "Minimum Initial Energy to Finish Tasks", "question__title_slug": "minimum-initial-energy-to-finish-tasks", "question__hide": false, - "total_acs": 5898, - "total_submitted": 8956, + "total_acs": 5936, + "total_submitted": 9013, "total_column_articles": 93, "frontend_question_id": "1665", "is_new_question": false @@ -19290,9 +19521,9 @@ "question__title": "Ways to Make a Fair Array", "question__title_slug": "ways-to-make-a-fair-array", "question__hide": false, - "total_acs": 6171, - "total_submitted": 11167, - "total_column_articles": 122, + "total_acs": 6202, + "total_submitted": 11210, + "total_column_articles": 123, "frontend_question_id": "1664", "is_new_question": false }, @@ -19311,8 +19542,8 @@ "question__title": "Smallest String With A Given Numeric Value", "question__title_slug": "smallest-string-with-a-given-numeric-value", "question__hide": false, - "total_acs": 8894, - "total_submitted": 15495, + "total_acs": 8926, + "total_submitted": 15544, "total_column_articles": 146, "frontend_question_id": "1663", "is_new_question": false @@ -19332,9 +19563,9 @@ "question__title": "Check If Two String Arrays are Equivalent", "question__title_slug": "check-if-two-string-arrays-are-equivalent", "question__hide": false, - "total_acs": 24312, - "total_submitted": 30022, - "total_column_articles": 349, + "total_acs": 24434, + "total_submitted": 30176, + "total_column_articles": 350, "frontend_question_id": "1662", "is_new_question": false }, @@ -19353,9 +19584,9 @@ "question__title": "Lowest Common Ancestor of a Binary Tree II", "question__title_slug": "lowest-common-ancestor-of-a-binary-tree-ii", "question__hide": false, - "total_acs": 2146, - "total_submitted": 3942, - "total_column_articles": 34, + "total_acs": 2219, + "total_submitted": 4073, + "total_column_articles": 36, "frontend_question_id": "1644", "is_new_question": false }, @@ -19374,8 +19605,8 @@ "question__title": "Hopper Company Queries I", "question__title_slug": "hopper-company-queries-i", "question__hide": false, - "total_acs": 1737, - "total_submitted": 3229, + "total_acs": 1751, + "total_submitted": 3269, "total_column_articles": 41, "frontend_question_id": "1635", "is_new_question": false @@ -19395,9 +19626,9 @@ "question__title": "Maximize Grid Happiness", "question__title_slug": "maximize-grid-happiness", "question__hide": false, - "total_acs": 1563, - "total_submitted": 3721, - "total_column_articles": 24, + "total_acs": 1582, + "total_submitted": 3750, + "total_column_articles": 25, "frontend_question_id": "1659", "is_new_question": false }, @@ -19416,9 +19647,9 @@ "question__title": "Determine if Two Strings Are Close", "question__title_slug": "determine-if-two-strings-are-close", "question__hide": false, - "total_acs": 6326, - "total_submitted": 13562, - "total_column_articles": 90, + "total_acs": 6355, + "total_submitted": 13622, + "total_column_articles": 91, "frontend_question_id": "1657", "is_new_question": false }, @@ -19437,9 +19668,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": 11853, - "total_submitted": 37914, - "total_column_articles": 174, + "total_acs": 12092, + "total_submitted": 38553, + "total_column_articles": 181, "frontend_question_id": "1658", "is_new_question": false }, @@ -19458,9 +19689,9 @@ "question__title": "Design an Ordered Stream", "question__title_slug": "design-an-ordered-stream", "question__hide": false, - "total_acs": 9362, - "total_submitted": 12018, - "total_column_articles": 112, + "total_acs": 9429, + "total_submitted": 12116, + "total_column_articles": 113, "frontend_question_id": "1656", "is_new_question": false }, @@ -19479,9 +19710,9 @@ "question__title": "Add Two Polynomials Represented as Linked Lists", "question__title_slug": "add-two-polynomials-represented-as-linked-lists", "question__hide": false, - "total_acs": 965, - "total_submitted": 1680, - "total_column_articles": 37, + "total_acs": 995, + "total_submitted": 1739, + "total_column_articles": 38, "frontend_question_id": "1634", "is_new_question": false }, @@ -19500,8 +19731,8 @@ "question__title": "Percentage of Users Attended a Contest", "question__title_slug": "percentage-of-users-attended-a-contest", "question__hide": false, - "total_acs": 4140, - "total_submitted": 6383, + "total_acs": 4295, + "total_submitted": 6611, "total_column_articles": 35, "frontend_question_id": "1633", "is_new_question": false @@ -19521,8 +19752,8 @@ "question__title": "Create Sorted Array through Instructions", "question__title_slug": "create-sorted-array-through-instructions", "question__hide": false, - "total_acs": 3177, - "total_submitted": 6583, + "total_acs": 3200, + "total_submitted": 6642, "total_column_articles": 78, "frontend_question_id": "1649", "is_new_question": false @@ -19542,9 +19773,9 @@ "question__title": "Sell Diminishing-Valued Colored Balls", "question__title_slug": "sell-diminishing-valued-colored-balls", "question__hide": false, - "total_acs": 4456, - "total_submitted": 15657, - "total_column_articles": 107, + "total_acs": 4641, + "total_submitted": 16034, + "total_column_articles": 113, "frontend_question_id": "1648", "is_new_question": false }, @@ -19563,9 +19794,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": 9090, - "total_submitted": 17224, - "total_column_articles": 137, + "total_acs": 9188, + "total_submitted": 17388, + "total_column_articles": 139, "frontend_question_id": "1647", "is_new_question": false }, @@ -19584,9 +19815,9 @@ "question__title": "Get Maximum in Generated Array", "question__title_slug": "get-maximum-in-generated-array", "question__hide": false, - "total_acs": 40188, - "total_submitted": 75894, - "total_column_articles": 407, + "total_acs": 40421, + "total_submitted": 76336, + "total_column_articles": 409, "frontend_question_id": "1646", "is_new_question": false }, @@ -19605,8 +19836,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": 588, - "total_submitted": 715, + "total_acs": 599, + "total_submitted": 730, "total_column_articles": 22, "frontend_question_id": "1628", "is_new_question": false @@ -19626,9 +19857,9 @@ "question__title": "Design Front Middle Back Queue", "question__title_slug": "design-front-middle-back-queue", "question__hide": false, - "total_acs": 5660, - "total_submitted": 10728, - "total_column_articles": 102, + "total_acs": 5690, + "total_submitted": 10777, + "total_column_articles": 103, "frontend_question_id": "1670", "is_new_question": false }, @@ -19647,8 +19878,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": 2538, - "total_submitted": 5430, + "total_acs": 2573, + "total_submitted": 5510, "total_column_articles": 51, "frontend_question_id": "1671", "is_new_question": false @@ -19668,9 +19899,9 @@ "question__title": "Merge In Between Linked Lists", "question__title_slug": "merge-in-between-linked-lists", "question__hide": false, - "total_acs": 16897, - "total_submitted": 22409, - "total_column_articles": 305, + "total_acs": 17094, + "total_submitted": 22654, + "total_column_articles": 308, "frontend_question_id": "1669", "is_new_question": false }, @@ -19689,8 +19920,8 @@ "question__title": "Maximum Repeating Substring", "question__title_slug": "maximum-repeating-substring", "question__hide": false, - "total_acs": 9031, - "total_submitted": 20378, + "total_acs": 9097, + "total_submitted": 20520, "total_column_articles": 168, "frontend_question_id": "1668", "is_new_question": false @@ -19710,8 +19941,8 @@ "question__title": "All Valid Triplets That Can Represent a Country", "question__title_slug": "all-valid-triplets-that-can-represent-a-country", "question__hide": false, - "total_acs": 4548, - "total_submitted": 5815, + "total_acs": 4592, + "total_submitted": 5885, "total_column_articles": 55, "frontend_question_id": "1623", "is_new_question": false @@ -19731,8 +19962,8 @@ "question__title": "Furthest Building You Can Reach", "question__title_slug": "furthest-building-you-can-reach", "question__hide": false, - "total_acs": 7911, - "total_submitted": 17590, + "total_acs": 7953, + "total_submitted": 17674, "total_column_articles": 126, "frontend_question_id": "1642", "is_new_question": false @@ -19752,9 +19983,9 @@ "question__title": "Count Sorted Vowel Strings", "question__title_slug": "count-sorted-vowel-strings", "question__hide": false, - "total_acs": 13391, - "total_submitted": 17296, - "total_column_articles": 309, + "total_acs": 13460, + "total_submitted": 17387, + "total_column_articles": 311, "frontend_question_id": "1641", "is_new_question": false }, @@ -19773,9 +20004,9 @@ "question__title": "Check Array Formation Through Concatenation", "question__title_slug": "check-array-formation-through-concatenation", "question__hide": false, - "total_acs": 14407, - "total_submitted": 22173, - "total_column_articles": 244, + "total_acs": 14448, + "total_submitted": 22263, + "total_column_articles": 245, "frontend_question_id": "1640", "is_new_question": false }, @@ -19794,9 +20025,9 @@ "question__title": "Find the Missing IDs", "question__title_slug": "find-the-missing-ids", "question__hide": false, - "total_acs": 2612, - "total_submitted": 3609, - "total_column_articles": 41, + "total_acs": 2697, + "total_submitted": 3705, + "total_column_articles": 43, "frontend_question_id": "1613", "is_new_question": false }, @@ -19815,9 +20046,9 @@ "question__title": "Distribute Repeating Integers", "question__title_slug": "distribute-repeating-integers", "question__hide": false, - "total_acs": 2719, - "total_submitted": 6997, - "total_column_articles": 41, + "total_acs": 2744, + "total_submitted": 7060, + "total_column_articles": 42, "frontend_question_id": "1655", "is_new_question": false }, @@ -19836,9 +20067,9 @@ "question__title": "Minimum Jumps to Reach Home", "question__title_slug": "minimum-jumps-to-reach-home", "question__hide": false, - "total_acs": 5346, - "total_submitted": 17949, - "total_column_articles": 74, + "total_acs": 5434, + "total_submitted": 18240, + "total_column_articles": 75, "frontend_question_id": "1654", "is_new_question": false }, @@ -19857,9 +20088,9 @@ "question__title": "Minimum Deletions to Make String Balanced", "question__title_slug": "minimum-deletions-to-make-string-balanced", "question__hide": false, - "total_acs": 4866, - "total_submitted": 9216, - "total_column_articles": 110, + "total_acs": 4915, + "total_submitted": 9298, + "total_column_articles": 111, "frontend_question_id": "1653", "is_new_question": false }, @@ -19878,8 +20109,8 @@ "question__title": "Defuse the Bomb", "question__title_slug": "defuse-the-bomb", "question__hide": false, - "total_acs": 9094, - "total_submitted": 14175, + "total_acs": 9157, + "total_submitted": 14301, "total_column_articles": 221, "frontend_question_id": "1652", "is_new_question": false @@ -19899,9 +20130,9 @@ "question__title": "Path With Minimum Effort", "question__title_slug": "path-with-minimum-effort", "question__hide": false, - "total_acs": 30890, - "total_submitted": 61950, - "total_column_articles": 344, + "total_acs": 31271, + "total_submitted": 62611, + "total_column_articles": 350, "frontend_question_id": "1631", "is_new_question": false }, @@ -19920,9 +20151,9 @@ "question__title": "Arithmetic Subarrays", "question__title_slug": "arithmetic-subarrays", "question__hide": false, - "total_acs": 9182, - "total_submitted": 12104, - "total_column_articles": 157, + "total_acs": 9309, + "total_submitted": 12251, + "total_column_articles": 159, "frontend_question_id": "1630", "is_new_question": false }, @@ -19941,8 +20172,8 @@ "question__title": "Slowest Key", "question__title_slug": "slowest-key", "question__hide": false, - "total_acs": 33907, - "total_submitted": 60478, + "total_acs": 33980, + "total_submitted": 60616, "total_column_articles": 401, "frontend_question_id": "1629", "is_new_question": false @@ -19962,8 +20193,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": 602, - "total_submitted": 820, + "total_acs": 604, + "total_submitted": 824, "total_column_articles": 28, "frontend_question_id": "1612", "is_new_question": false @@ -19983,9 +20214,9 @@ "question__title": "Sellers With No Sales", "question__title_slug": "sellers-with-no-sales", "question__hide": false, - "total_acs": 4279, - "total_submitted": 8012, - "total_column_articles": 49, + "total_acs": 4438, + "total_submitted": 8286, + "total_column_articles": 52, "frontend_question_id": "1607", "is_new_question": false }, @@ -20004,8 +20235,8 @@ "question__title": "Best Team With No Conflicts", "question__title_slug": "best-team-with-no-conflicts", "question__hide": false, - "total_acs": 4604, - "total_submitted": 11560, + "total_acs": 4640, + "total_submitted": 11624, "total_column_articles": 97, "frontend_question_id": "1626", "is_new_question": false @@ -20025,9 +20256,9 @@ "question__title": "Lexicographically Smallest String After Applying Operations", "question__title_slug": "lexicographically-smallest-string-after-applying-operations", "question__hide": false, - "total_acs": 3327, - "total_submitted": 6046, - "total_column_articles": 71, + "total_acs": 3336, + "total_submitted": 6065, + "total_column_articles": 72, "frontend_question_id": "1625", "is_new_question": false }, @@ -20046,9 +20277,9 @@ "question__title": "Largest Substring Between Two Equal Characters", "question__title_slug": "largest-substring-between-two-equal-characters", "question__hide": false, - "total_acs": 15040, - "total_submitted": 24310, - "total_column_articles": 269, + "total_acs": 15140, + "total_submitted": 24459, + "total_column_articles": 271, "frontend_question_id": "1624", "is_new_question": false }, @@ -20067,9 +20298,9 @@ "question__title": "Find Nearest Right Node in Binary Tree", "question__title_slug": "find-nearest-right-node-in-binary-tree", "question__hide": false, - "total_acs": 1190, - "total_submitted": 1594, - "total_column_articles": 46, + "total_acs": 1203, + "total_submitted": 1612, + "total_column_articles": 47, "frontend_question_id": "1602", "is_new_question": false }, @@ -20088,8 +20319,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": 1563, - "total_submitted": 3804, + "total_acs": 1580, + "total_submitted": 3828, "total_column_articles": 36, "frontend_question_id": "1639", "is_new_question": false @@ -20109,9 +20340,9 @@ "question__title": "Count Substrings That Differ by One Character", "question__title_slug": "count-substrings-that-differ-by-one-character", "question__hide": false, - "total_acs": 3518, - "total_submitted": 4907, - "total_column_articles": 60, + "total_acs": 3559, + "total_submitted": 4957, + "total_column_articles": 61, "frontend_question_id": "1638", "is_new_question": false }, @@ -20130,8 +20361,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": 6586, - "total_submitted": 8157, + "total_acs": 6634, + "total_submitted": 8208, "total_column_articles": 99, "frontend_question_id": "1637", "is_new_question": false @@ -20151,8 +20382,8 @@ "question__title": "Sort Array by Increasing Frequency", "question__title_slug": "sort-array-by-increasing-frequency", "question__hide": false, - "total_acs": 12396, - "total_submitted": 17748, + "total_acs": 12478, + "total_submitted": 17878, "total_column_articles": 236, "frontend_question_id": "1636", "is_new_question": false @@ -20172,8 +20403,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": 2036, - "total_submitted": 3243, + "total_acs": 2048, + "total_submitted": 3257, "total_column_articles": 41, "frontend_question_id": "1617", "is_new_question": false @@ -20193,8 +20424,8 @@ "question__title": "Split Two Strings to Make Palindrome", "question__title_slug": "split-two-strings-to-make-palindrome", "question__hide": false, - "total_acs": 5631, - "total_submitted": 20199, + "total_acs": 5650, + "total_submitted": 20260, "total_column_articles": 106, "frontend_question_id": "1616", "is_new_question": false @@ -20214,9 +20445,9 @@ "question__title": "Maximal Network Rank", "question__title_slug": "maximal-network-rank", "question__hide": false, - "total_acs": 7210, - "total_submitted": 13358, - "total_column_articles": 83, + "total_acs": 7308, + "total_submitted": 13526, + "total_column_articles": 85, "frontend_question_id": "1615", "is_new_question": false }, @@ -20235,9 +20466,9 @@ "question__title": "Maximum Nesting Depth of the Parentheses", "question__title_slug": "maximum-nesting-depth-of-the-parentheses", "question__hide": false, - "total_acs": 49516, - "total_submitted": 58643, - "total_column_articles": 703, + "total_acs": 49880, + "total_submitted": 59125, + "total_column_articles": 706, "frontend_question_id": "1614", "is_new_question": false }, @@ -20256,8 +20487,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": 435, - "total_submitted": 642, + "total_acs": 449, + "total_submitted": 669, "total_column_articles": 23, "frontend_question_id": "1597", "is_new_question": false @@ -20277,9 +20508,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": 3527, - "total_submitted": 4697, - "total_column_articles": 51, + "total_acs": 3626, + "total_submitted": 4806, + "total_column_articles": 52, "frontend_question_id": "1596", "is_new_question": false }, @@ -20298,9 +20529,9 @@ "question__title": "Bank Account Summary II", "question__title_slug": "bank-account-summary-ii", "question__hide": false, - "total_acs": 6576, - "total_submitted": 7823, - "total_column_articles": 60, + "total_acs": 7152, + "total_submitted": 8471, + "total_column_articles": 64, "frontend_question_id": "1587", "is_new_question": false }, @@ -20319,8 +20550,8 @@ "question__title": "Maximum Number of Visible Points", "question__title_slug": "maximum-number-of-visible-points", "question__hide": false, - "total_acs": 16566, - "total_submitted": 37402, + "total_acs": 16590, + "total_submitted": 37445, "total_column_articles": 156, "frontend_question_id": "1610", "is_new_question": false @@ -20340,8 +20571,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": 2433, - "total_submitted": 3954, + "total_acs": 2450, + "total_submitted": 3977, "total_column_articles": 61, "frontend_question_id": "1611", "is_new_question": false @@ -20361,9 +20592,9 @@ "question__title": "Even Odd Tree", "question__title_slug": "even-odd-tree", "question__hide": false, - "total_acs": 28997, - "total_submitted": 49117, - "total_column_articles": 440, + "total_acs": 29114, + "total_submitted": 49298, + "total_column_articles": 441, "frontend_question_id": "1609", "is_new_question": false }, @@ -20382,9 +20613,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": 14493, - "total_submitted": 23722, - "total_column_articles": 267, + "total_acs": 14979, + "total_submitted": 24533, + "total_column_articles": 279, "frontend_question_id": "1608", "is_new_question": false }, @@ -20403,9 +20634,9 @@ "question__title": "Binary Search Tree Iterator II", "question__title_slug": "binary-search-tree-iterator-ii", "question__hide": false, - "total_acs": 570, - "total_submitted": 930, - "total_column_articles": 28, + "total_acs": 583, + "total_submitted": 947, + "total_column_articles": 29, "frontend_question_id": "1586", "is_new_question": false }, @@ -20424,8 +20655,8 @@ "question__title": "Fancy Sequence", "question__title_slug": "fancy-sequence", "question__hide": false, - "total_acs": 3388, - "total_submitted": 21201, + "total_acs": 3410, + "total_submitted": 21279, "total_column_articles": 73, "frontend_question_id": "1622", "is_new_question": false @@ -20445,8 +20676,8 @@ "question__title": "Cat and Mouse II", "question__title_slug": "cat-and-mouse-ii", "question__hide": false, - "total_acs": 1512, - "total_submitted": 3987, + "total_acs": 1533, + "total_submitted": 4013, "total_column_articles": 31, "frontend_question_id": "1728", "is_new_question": false @@ -20466,8 +20697,8 @@ "question__title": "Coordinate With Maximum Network Quality", "question__title_slug": "coordinate-with-maximum-network-quality", "question__hide": false, - "total_acs": 2948, - "total_submitted": 7936, + "total_acs": 2961, + "total_submitted": 7977, "total_column_articles": 52, "frontend_question_id": "1620", "is_new_question": false @@ -20487,8 +20718,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": 2086, - "total_submitted": 4632, + "total_acs": 2109, + "total_submitted": 4661, "total_column_articles": 38, "frontend_question_id": "1621", "is_new_question": false @@ -20508,9 +20739,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": 7905, - "total_submitted": 9653, - "total_column_articles": 90, + "total_acs": 8844, + "total_submitted": 10790, + "total_column_articles": 97, "frontend_question_id": "1581", "is_new_question": false }, @@ -20529,8 +20760,8 @@ "question__title": "Maximum Number of Achievable Transfer Requests", "question__title_slug": "maximum-number-of-achievable-transfer-requests", "question__hide": false, - "total_acs": 20632, - "total_submitted": 33466, + "total_acs": 20657, + "total_submitted": 33500, "total_column_articles": 225, "frontend_question_id": "1601", "is_new_question": false @@ -20550,9 +20781,9 @@ "question__title": "Throne Inheritance", "question__title_slug": "throne-inheritance", "question__hide": false, - "total_acs": 17759, - "total_submitted": 26482, - "total_column_articles": 220, + "total_acs": 17795, + "total_submitted": 26549, + "total_column_articles": 221, "frontend_question_id": "1600", "is_new_question": false }, @@ -20571,9 +20802,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": 4326, - "total_submitted": 10203, - "total_column_articles": 76, + "total_acs": 4347, + "total_submitted": 10264, + "total_column_articles": 77, "frontend_question_id": "1599", "is_new_question": false }, @@ -20592,9 +20823,9 @@ "question__title": "Crawler Log Folder", "question__title_slug": "crawler-log-folder", "question__hide": false, - "total_acs": 12974, - "total_submitted": 19248, - "total_column_articles": 172, + "total_acs": 13052, + "total_submitted": 19347, + "total_column_articles": 173, "frontend_question_id": "1598", "is_new_question": false }, @@ -20613,8 +20844,8 @@ "question__title": "Put Boxes Into the Warehouse II", "question__title_slug": "put-boxes-into-the-warehouse-ii", "question__hide": false, - "total_acs": 371, - "total_submitted": 630, + "total_acs": 372, + "total_submitted": 631, "total_column_articles": 24, "frontend_question_id": "1580", "is_new_question": false @@ -20634,9 +20865,9 @@ "question__title": "Warehouse Manager", "question__title_slug": "warehouse-manager", "question__hide": false, - "total_acs": 4963, - "total_submitted": 6482, - "total_column_articles": 55, + "total_acs": 5132, + "total_submitted": 6691, + "total_column_articles": 58, "frontend_question_id": "1571", "is_new_question": false }, @@ -20655,8 +20886,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": 2265, - "total_submitted": 4648, + "total_acs": 2333, + "total_submitted": 4755, "total_column_articles": 42, "frontend_question_id": "1595", "is_new_question": false @@ -20676,8 +20907,8 @@ "question__title": "Maximum Non Negative Product in a Matrix", "question__title_slug": "maximum-non-negative-product-in-a-matrix", "question__hide": false, - "total_acs": 4823, - "total_submitted": 15043, + "total_acs": 4839, + "total_submitted": 15075, "total_column_articles": 109, "frontend_question_id": "1594", "is_new_question": false @@ -20697,8 +20928,8 @@ "question__title": "Split a String Into the Max Number of Unique Substrings", "question__title_slug": "split-a-string-into-the-max-number-of-unique-substrings", "question__hide": false, - "total_acs": 6650, - "total_submitted": 12070, + "total_acs": 6721, + "total_submitted": 12172, "total_column_articles": 110, "frontend_question_id": "1593", "is_new_question": false @@ -20718,9 +20949,9 @@ "question__title": "Rearrange Spaces Between Words", "question__title_slug": "rearrange-spaces-between-words", "question__hide": false, - "total_acs": 9131, - "total_submitted": 20553, - "total_column_articles": 147, + "total_acs": 9204, + "total_submitted": 20714, + "total_column_articles": 149, "frontend_question_id": "1592", "is_new_question": false }, @@ -20739,8 +20970,8 @@ "question__title": "Dot Product of Two Sparse Vectors", "question__title_slug": "dot-product-of-two-sparse-vectors", "question__hide": false, - "total_acs": 3096, - "total_submitted": 3487, + "total_acs": 3134, + "total_submitted": 3528, "total_column_articles": 46, "frontend_question_id": "1570", "is_new_question": false @@ -20760,8 +20991,8 @@ "question__title": "Unique Orders and Customers Per Month", "question__title_slug": "unique-orders-and-customers-per-month", "question__hide": false, - "total_acs": 4540, - "total_submitted": 6197, + "total_acs": 4578, + "total_submitted": 6246, "total_column_articles": 50, "frontend_question_id": "1565", "is_new_question": false @@ -20781,8 +21012,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": 4505, - "total_submitted": 6047, + "total_acs": 4549, + "total_submitted": 6097, "total_column_articles": 85, "frontend_question_id": "1605", "is_new_question": false @@ -20802,9 +21033,9 @@ "question__title": "Find Servers That Handled Most Number of Requests", "question__title_slug": "find-servers-that-handled-most-number-of-requests", "question__hide": false, - "total_acs": 19033, - "total_submitted": 39512, - "total_column_articles": 181, + "total_acs": 19070, + "total_submitted": 39602, + "total_column_articles": 180, "frontend_question_id": "1606", "is_new_question": false }, @@ -20823,8 +21054,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": 4585, - "total_submitted": 11011, + "total_acs": 4621, + "total_submitted": 11085, "total_column_articles": 79, "frontend_question_id": "1604", "is_new_question": false @@ -20844,9 +21075,9 @@ "question__title": "Design Parking System", "question__title_slug": "design-parking-system", "question__hide": false, - "total_acs": 63564, - "total_submitted": 75241, - "total_column_articles": 502, + "total_acs": 63862, + "total_submitted": 75588, + "total_column_articles": 507, "frontend_question_id": "1603", "is_new_question": false }, @@ -20865,8 +21096,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": 2629, - "total_submitted": 6095, + "total_acs": 2639, + "total_submitted": 6129, "total_column_articles": 44, "frontend_question_id": "1585", "is_new_question": false @@ -20886,9 +21117,9 @@ "question__title": "Min Cost to Connect All Points", "question__title_slug": "min-cost-to-connect-all-points", "question__hide": false, - "total_acs": 33918, - "total_submitted": 51258, - "total_column_articles": 428, + "total_acs": 34601, + "total_submitted": 52267, + "total_column_articles": 438, "frontend_question_id": "1584", "is_new_question": false }, @@ -20907,8 +21138,8 @@ "question__title": "Count Unhappy Friends", "question__title_slug": "count-unhappy-friends", "question__hide": false, - "total_acs": 19302, - "total_submitted": 28187, + "total_acs": 19330, + "total_submitted": 28228, "total_column_articles": 247, "frontend_question_id": "1583", "is_new_question": false @@ -20928,9 +21159,9 @@ "question__title": "Special Positions in a Binary Matrix", "question__title_slug": "special-positions-in-a-binary-matrix", "question__hide": false, - "total_acs": 11749, - "total_submitted": 17463, - "total_column_articles": 143, + "total_acs": 11816, + "total_submitted": 17576, + "total_column_articles": 145, "frontend_question_id": "1582", "is_new_question": false }, @@ -20949,8 +21180,8 @@ "question__title": "Put Boxes Into the Warehouse I", "question__title_slug": "put-boxes-into-the-warehouse-i", "question__hide": false, - "total_acs": 862, - "total_submitted": 1541, + "total_acs": 866, + "total_submitted": 1549, "total_column_articles": 35, "frontend_question_id": "1564", "is_new_question": false @@ -20970,9 +21201,9 @@ "question__title": "Bank Account Summary", "question__title_slug": "bank-account-summary", "question__hide": false, - "total_acs": 3889, - "total_submitted": 8794, - "total_column_articles": 64, + "total_acs": 3922, + "total_submitted": 8850, + "total_column_articles": 65, "frontend_question_id": "1555", "is_new_question": false }, @@ -20991,8 +21222,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": 16900, - "total_submitted": 27280, + "total_acs": 16951, + "total_submitted": 27409, "total_column_articles": 308, "frontend_question_id": "1579", "is_new_question": false @@ -21012,9 +21243,9 @@ "question__title": "Minimum Time to Make Rope Colorful", "question__title_slug": "minimum-time-to-make-rope-colorful", "question__hide": false, - "total_acs": 12329, - "total_submitted": 20907, - "total_column_articles": 228, + "total_acs": 12481, + "total_submitted": 21155, + "total_column_articles": 231, "frontend_question_id": "1578", "is_new_question": false }, @@ -21033,9 +21264,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": 5635, - "total_submitted": 17019, - "total_column_articles": 90, + "total_acs": 5665, + "total_submitted": 17089, + "total_column_articles": 91, "frontend_question_id": "1577", "is_new_question": false }, @@ -21054,9 +21285,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": 48901, - "total_submitted": 95030, - "total_column_articles": 590, + "total_acs": 48975, + "total_submitted": 95180, + "total_column_articles": 591, "frontend_question_id": "1576", "is_new_question": false }, @@ -21075,8 +21306,8 @@ "question__title": "Strings Differ by One Character", "question__title_slug": "strings-differ-by-one-character", "question__hide": false, - "total_acs": 837, - "total_submitted": 1249, + "total_acs": 839, + "total_submitted": 1266, "total_column_articles": 27, "frontend_question_id": "1554", "is_new_question": false @@ -21096,8 +21327,8 @@ "question__title": "Strange Printer II", "question__title_slug": "strange-printer-ii", "question__hide": false, - "total_acs": 1502, - "total_submitted": 2506, + "total_acs": 1516, + "total_submitted": 2523, "total_column_articles": 46, "frontend_question_id": "1591", "is_new_question": false @@ -21117,8 +21348,8 @@ "question__title": "Maximum Sum Obtained of Any Permutation", "question__title_slug": "maximum-sum-obtained-of-any-permutation", "question__hide": false, - "total_acs": 4653, - "total_submitted": 15324, + "total_acs": 4688, + "total_submitted": 15388, "total_column_articles": 71, "frontend_question_id": "1589", "is_new_question": false @@ -21138,8 +21369,8 @@ "question__title": "Make Sum Divisible by P", "question__title_slug": "make-sum-divisible-by-p", "question__hide": false, - "total_acs": 4599, - "total_submitted": 16711, + "total_acs": 4657, + "total_submitted": 16875, "total_column_articles": 65, "frontend_question_id": "1590", "is_new_question": false @@ -21159,9 +21390,9 @@ "question__title": "Sum of All Odd Length Subarrays", "question__title_slug": "sum-of-all-odd-length-subarrays", "question__hide": false, - "total_acs": 51424, - "total_submitted": 61289, - "total_column_articles": 808, + "total_acs": 51776, + "total_submitted": 61700, + "total_column_articles": 814, "frontend_question_id": "1588", "is_new_question": false }, @@ -21180,8 +21411,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": 2381, - "total_submitted": 5015, + "total_acs": 2386, + "total_submitted": 5030, "total_column_articles": 49, "frontend_question_id": "1569", "is_new_question": false @@ -21201,9 +21432,9 @@ "question__title": "Minimum Number of Days to Disconnect Island", "question__title_slug": "minimum-number-of-days-to-disconnect-island", "question__hide": false, - "total_acs": 3024, - "total_submitted": 6610, - "total_column_articles": 59, + "total_acs": 3060, + "total_submitted": 6722, + "total_column_articles": 61, "frontend_question_id": "1568", "is_new_question": false }, @@ -21222,9 +21453,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": 25739, - "total_submitted": 61209, - "total_column_articles": 355, + "total_acs": 25987, + "total_submitted": 61814, + "total_column_articles": 360, "frontend_question_id": "1567", "is_new_question": false }, @@ -21243,9 +21474,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": 9413, - "total_submitted": 21301, - "total_column_articles": 144, + "total_acs": 9457, + "total_submitted": 21403, + "total_column_articles": 145, "frontend_question_id": "1566", "is_new_question": false }, @@ -21264,9 +21495,9 @@ "question__title": "The Most Recent Orders for Each Product", "question__title_slug": "the-most-recent-orders-for-each-product", "question__hide": false, - "total_acs": 3570, - "total_submitted": 5312, - "total_column_articles": 62, + "total_acs": 3713, + "total_submitted": 5504, + "total_column_articles": 64, "frontend_question_id": "1549", "is_new_question": false }, @@ -21285,8 +21516,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": 448, - "total_submitted": 650, + "total_acs": 449, + "total_submitted": 654, "total_column_articles": 19, "frontend_question_id": "1548", "is_new_question": false @@ -21306,8 +21537,8 @@ "question__title": "Fix Product Name Format", "question__title_slug": "fix-product-name-format", "question__hide": false, - "total_acs": 4176, - "total_submitted": 7564, + "total_acs": 4229, + "total_submitted": 7654, "total_column_articles": 51, "frontend_question_id": "1543", "is_new_question": false @@ -21327,8 +21558,8 @@ "question__title": "Stone Game V", "question__title_slug": "stone-game-v", "question__hide": false, - "total_acs": 4531, - "total_submitted": 11657, + "total_acs": 4571, + "total_submitted": 11731, "total_column_articles": 70, "frontend_question_id": "1563", "is_new_question": false @@ -21348,9 +21579,9 @@ "question__title": "Find Latest Group of Size M", "question__title_slug": "find-latest-group-of-size-m", "question__hide": false, - "total_acs": 4748, - "total_submitted": 14904, - "total_column_articles": 101, + "total_acs": 4858, + "total_submitted": 15073, + "total_column_articles": 103, "frontend_question_id": "1562", "is_new_question": false }, @@ -21369,9 +21600,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": 13665, - "total_submitted": 17547, - "total_column_articles": 202, + "total_acs": 13747, + "total_submitted": 17645, + "total_column_articles": 205, "frontend_question_id": "1561", "is_new_question": false }, @@ -21390,8 +21621,8 @@ "question__title": "Most Visited Sector in a Circular Track", "question__title_slug": "most-visited-sector-in-a-circular-track", "question__hide": false, - "total_acs": 9694, - "total_submitted": 16934, + "total_acs": 9744, + "total_submitted": 17009, "total_column_articles": 102, "frontend_question_id": "1560", "is_new_question": false @@ -21411,8 +21642,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": 178, - "total_submitted": 319, + "total_acs": 181, + "total_submitted": 322, "total_column_articles": 10, "frontend_question_id": "1538", "is_new_question": false @@ -21432,8 +21663,8 @@ "question__title": "Count All Possible Routes", "question__title_slug": "count-all-possible-routes", "question__hide": false, - "total_acs": 6844, - "total_submitted": 11488, + "total_acs": 6983, + "total_submitted": 11761, "total_column_articles": 84, "frontend_question_id": "1575", "is_new_question": false @@ -21453,9 +21684,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": 6264, - "total_submitted": 18386, - "total_column_articles": 111, + "total_acs": 6509, + "total_submitted": 18931, + "total_column_articles": 117, "frontend_question_id": "1574", "is_new_question": false }, @@ -21474,8 +21705,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": 5233, - "total_submitted": 17287, + "total_acs": 5269, + "total_submitted": 17394, "total_column_articles": 71, "frontend_question_id": "1573", "is_new_question": false @@ -21495,9 +21726,9 @@ "question__title": "Matrix Diagonal Sum", "question__title_slug": "matrix-diagonal-sum", "question__hide": false, - "total_acs": 25740, - "total_submitted": 31974, - "total_column_articles": 431, + "total_acs": 26001, + "total_submitted": 32277, + "total_column_articles": 437, "frontend_question_id": "1572", "is_new_question": false }, @@ -21516,8 +21747,8 @@ "question__title": "Minimum Number of Days to Eat N Oranges", "question__title_slug": "minimum-number-of-days-to-eat-n-oranges", "question__hide": false, - "total_acs": 8772, - "total_submitted": 28582, + "total_acs": 8805, + "total_submitted": 28651, "total_column_articles": 134, "frontend_question_id": "1553", "is_new_question": false @@ -21537,9 +21768,9 @@ "question__title": "Magnetic Force Between Two Balls", "question__title_slug": "magnetic-force-between-two-balls", "question__hide": false, - "total_acs": 11237, - "total_submitted": 21401, - "total_column_articles": 151, + "total_acs": 11461, + "total_submitted": 21745, + "total_column_articles": 152, "frontend_question_id": "1552", "is_new_question": false }, @@ -21558,9 +21789,9 @@ "question__title": "Minimum Operations to Make Array Equal", "question__title_slug": "minimum-operations-to-make-array-equal", "question__hide": false, - "total_acs": 12531, - "total_submitted": 15315, - "total_column_articles": 177, + "total_acs": 12594, + "total_submitted": 15388, + "total_column_articles": 180, "frontend_question_id": "1551", "is_new_question": false }, @@ -21579,9 +21810,9 @@ "question__title": "Find the Index of the Large Integer", "question__title_slug": "find-the-index-of-the-large-integer", "question__hide": false, - "total_acs": 487, - "total_submitted": 833, - "total_column_articles": 26, + "total_acs": 505, + "total_submitted": 861, + "total_column_articles": 27, "frontend_question_id": "1533", "is_new_question": false }, @@ -21600,9 +21831,9 @@ "question__title": "The Most Recent Three Orders", "question__title_slug": "the-most-recent-three-orders", "question__hide": false, - "total_acs": 4331, - "total_submitted": 6966, - "total_column_articles": 60, + "total_acs": 4421, + "total_submitted": 7090, + "total_column_articles": 61, "frontend_question_id": "1532", "is_new_question": false }, @@ -21621,9 +21852,9 @@ "question__title": "Patients With a Condition", "question__title_slug": "patients-with-a-condition", "question__hide": false, - "total_acs": 9365, - "total_submitted": 19224, - "total_column_articles": 75, + "total_acs": 10618, + "total_submitted": 21702, + "total_column_articles": 85, "frontend_question_id": "1527", "is_new_question": false }, @@ -21642,8 +21873,8 @@ "question__title": "Minimum Cost to Cut a Stick", "question__title_slug": "minimum-cost-to-cut-a-stick", "question__hide": false, - "total_acs": 4619, - "total_submitted": 8408, + "total_acs": 4688, + "total_submitted": 8508, "total_column_articles": 79, "frontend_question_id": "1547", "is_new_question": false @@ -21663,8 +21894,8 @@ "question__title": "Find Longest Awesome Substring", "question__title_slug": "find-longest-awesome-substring", "question__hide": false, - "total_acs": 3078, - "total_submitted": 7644, + "total_acs": 3117, + "total_submitted": 7715, "total_column_articles": 55, "frontend_question_id": "1542", "is_new_question": false @@ -21684,8 +21915,8 @@ "question__title": "Find Kth Bit in Nth Binary String", "question__title_slug": "find-kth-bit-in-nth-binary-string", "question__hide": false, - "total_acs": 8286, - "total_submitted": 14900, + "total_acs": 8329, + "total_submitted": 14969, "total_column_articles": 109, "frontend_question_id": "1545", "is_new_question": false @@ -21705,9 +21936,9 @@ "question__title": "Make The String Great", "question__title_slug": "make-the-string-great", "question__hide": false, - "total_acs": 22811, - "total_submitted": 41278, - "total_column_articles": 364, + "total_acs": 22904, + "total_submitted": 41407, + "total_column_articles": 365, "frontend_question_id": "1544", "is_new_question": false }, @@ -21726,9 +21957,9 @@ "question__title": "Diameter of N-Ary Tree", "question__title_slug": "diameter-of-n-ary-tree", "question__hide": false, - "total_acs": 1412, - "total_submitted": 1982, - "total_column_articles": 42, + "total_acs": 1441, + "total_submitted": 2027, + "total_column_articles": 45, "frontend_question_id": "1522", "is_new_question": false }, @@ -21747,8 +21978,8 @@ "question__title": "Find Users With Valid E-Mails", "question__title_slug": "find-users-with-valid-e-mails", "question__hide": false, - "total_acs": 4623, - "total_submitted": 8038, + "total_acs": 4672, + "total_submitted": 8157, "total_column_articles": 47, "frontend_question_id": "1517", "is_new_question": false @@ -21768,8 +21999,8 @@ "question__title": "Detect Cycles in 2D Grid", "question__title_slug": "detect-cycles-in-2d-grid", "question__hide": false, - "total_acs": 4811, - "total_submitted": 12585, + "total_acs": 4848, + "total_submitted": 12676, "total_column_articles": 82, "frontend_question_id": "1559", "is_new_question": false @@ -21789,8 +22020,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": 5130, - "total_submitted": 8203, + "total_acs": 5142, + "total_submitted": 8228, "total_column_articles": 80, "frontend_question_id": "1558", "is_new_question": false @@ -21810,9 +22041,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": 11554, - "total_submitted": 14526, - "total_column_articles": 165, + "total_acs": 11774, + "total_submitted": 14783, + "total_column_articles": 168, "frontend_question_id": "1557", "is_new_question": false }, @@ -21831,9 +22062,9 @@ "question__title": "Thousand Separator", "question__title_slug": "thousand-separator", "question__hide": false, - "total_acs": 13917, - "total_submitted": 24461, - "total_column_articles": 221, + "total_acs": 14064, + "total_submitted": 24718, + "total_column_articles": 224, "frontend_question_id": "1556", "is_new_question": false }, @@ -21852,9 +22083,9 @@ "question__title": "Get the Maximum Score", "question__title_slug": "get-the-maximum-score", "question__hide": false, - "total_acs": 5081, - "total_submitted": 13581, - "total_column_articles": 106, + "total_acs": 5110, + "total_submitted": 13648, + "total_column_articles": 107, "frontend_question_id": "1537", "is_new_question": false }, @@ -21873,8 +22104,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": 4474, - "total_submitted": 10013, + "total_acs": 4487, + "total_submitted": 10036, "total_column_articles": 87, "frontend_question_id": "1536", "is_new_question": false @@ -21894,8 +22125,8 @@ "question__title": "Find the Winner of an Array Game", "question__title_slug": "find-the-winner-of-an-array-game", "question__hide": false, - "total_acs": 14435, - "total_submitted": 31564, + "total_acs": 14492, + "total_submitted": 31647, "total_column_articles": 198, "frontend_question_id": "1535", "is_new_question": false @@ -21915,8 +22146,8 @@ "question__title": "Count Good Triplets", "question__title_slug": "count-good-triplets", "question__hide": false, - "total_acs": 19901, - "total_submitted": 25505, + "total_acs": 20003, + "total_submitted": 25632, "total_column_articles": 187, "frontend_question_id": "1534", "is_new_question": false @@ -21936,8 +22167,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": 287, - "total_submitted": 515, + "total_acs": 289, + "total_submitted": 518, "total_column_articles": 16, "frontend_question_id": "1516", "is_new_question": false @@ -21957,8 +22188,8 @@ "question__title": "Customer Order Frequency", "question__title_slug": "customer-order-frequency", "question__hide": false, - "total_acs": 5896, - "total_submitted": 8573, + "total_acs": 5964, + "total_submitted": 8695, "total_column_articles": 74, "frontend_question_id": "1511", "is_new_question": false @@ -21978,9 +22209,9 @@ "question__title": "Number of Good Leaf Nodes Pairs", "question__title_slug": "number-of-good-leaf-nodes-pairs", "question__hide": false, - "total_acs": 9690, - "total_submitted": 16845, - "total_column_articles": 167, + "total_acs": 9747, + "total_submitted": 16928, + "total_column_articles": 169, "frontend_question_id": "1530", "is_new_question": false }, @@ -21999,8 +22230,8 @@ "question__title": "Minimum Suffix Flips", "question__title_slug": "minimum-suffix-flips", "question__hide": false, - "total_acs": 9851, - "total_submitted": 14132, + "total_acs": 9884, + "total_submitted": 14181, "total_column_articles": 150, "frontend_question_id": "1529", "is_new_question": false @@ -22020,9 +22251,9 @@ "question__title": "Shuffle String", "question__title_slug": "shuffle-string", "question__hide": false, - "total_acs": 33156, - "total_submitted": 42157, - "total_column_articles": 403, + "total_acs": 33271, + "total_submitted": 42327, + "total_column_articles": 405, "frontend_question_id": "1528", "is_new_question": false }, @@ -22041,8 +22272,8 @@ "question__title": "Find Root of N-Ary Tree", "question__title_slug": "find-root-of-n-ary-tree", "question__hide": false, - "total_acs": 766, - "total_submitted": 933, + "total_acs": 768, + "total_submitted": 938, "total_column_articles": 20, "frontend_question_id": "1506", "is_new_question": false @@ -22062,9 +22293,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": 5894, - "total_submitted": 13799, - "total_column_articles": 92, + "total_acs": 5934, + "total_submitted": 13888, + "total_column_articles": 93, "frontend_question_id": "1546", "is_new_question": false }, @@ -22083,9 +22314,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": 10584, - "total_submitted": 21984, - "total_column_articles": 133, + "total_acs": 10813, + "total_submitted": 22495, + "total_column_articles": 136, "frontend_question_id": "1541", "is_new_question": false }, @@ -22104,8 +22335,8 @@ "question__title": "Can Convert String in K Moves", "question__title_slug": "can-convert-string-in-k-moves", "question__hide": false, - "total_acs": 5391, - "total_submitted": 16811, + "total_acs": 5409, + "total_submitted": 16855, "total_column_articles": 94, "frontend_question_id": "1540", "is_new_question": false @@ -22125,9 +22356,9 @@ "question__title": "Kth Missing Positive Number", "question__title_slug": "kth-missing-positive-number", "question__hide": false, - "total_acs": 23283, - "total_submitted": 43186, - "total_column_articles": 345, + "total_acs": 23908, + "total_submitted": 44323, + "total_column_articles": 356, "frontend_question_id": "1539", "is_new_question": false }, @@ -22146,9 +22377,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": 2942, - "total_submitted": 7426, - "total_column_articles": 59, + "total_acs": 2979, + "total_submitted": 7486, + "total_column_articles": 60, "frontend_question_id": "1521", "is_new_question": false }, @@ -22167,8 +22398,8 @@ "question__title": "Maximum Number of Non-Overlapping Substrings", "question__title_slug": "maximum-number-of-non-overlapping-substrings", "question__hide": false, - "total_acs": 2745, - "total_submitted": 8083, + "total_acs": 2751, + "total_submitted": 8100, "total_column_articles": 75, "frontend_question_id": "1520", "is_new_question": false @@ -22188,9 +22419,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": 6127, - "total_submitted": 19804, - "total_column_articles": 130, + "total_acs": 6160, + "total_submitted": 19873, + "total_column_articles": 132, "frontend_question_id": "1519", "is_new_question": false }, @@ -22209,9 +22440,9 @@ "question__title": "Water Bottles", "question__title_slug": "water-bottles", "question__hide": false, - "total_acs": 55731, - "total_submitted": 79328, - "total_column_articles": 835, + "total_acs": 55895, + "total_submitted": 79565, + "total_column_articles": 836, "frontend_question_id": "1518", "is_new_question": false }, @@ -22230,9 +22461,9 @@ "question__title": "Countries You Can Safely Invest In", "question__title_slug": "countries-you-can-safely-invest-in", "question__hide": false, - "total_acs": 5497, - "total_submitted": 9177, - "total_column_articles": 69, + "total_acs": 5693, + "total_submitted": 9482, + "total_column_articles": 76, "frontend_question_id": "1501", "is_new_question": false }, @@ -22251,9 +22482,9 @@ "question__title": "Design a File Sharing System", "question__title_slug": "design-a-file-sharing-system", "question__hide": false, - "total_acs": 1400, - "total_submitted": 4775, - "total_column_articles": 39, + "total_acs": 1419, + "total_submitted": 4841, + "total_column_articles": 40, "frontend_question_id": "1500", "is_new_question": false }, @@ -22272,8 +22503,8 @@ "question__title": "Friendly Movies Streamed Last Month", "question__title_slug": "friendly-movies-streamed-last-month", "question__hide": false, - "total_acs": 5303, - "total_submitted": 9869, + "total_acs": 5343, + "total_submitted": 9945, "total_column_articles": 46, "frontend_question_id": "1495", "is_new_question": false @@ -22293,9 +22524,9 @@ "question__title": "Best Position for a Service Centre", "question__title_slug": "best-position-for-a-service-centre", "question__hide": false, - "total_acs": 3630, - "total_submitted": 10411, - "total_column_articles": 65, + "total_acs": 3650, + "total_submitted": 10458, + "total_column_articles": 66, "frontend_question_id": "1515", "is_new_question": false }, @@ -22314,8 +22545,8 @@ "question__title": "String Compression II", "question__title_slug": "string-compression-ii", "question__hide": false, - "total_acs": 2311, - "total_submitted": 6466, + "total_acs": 2322, + "total_submitted": 6484, "total_column_articles": 43, "frontend_question_id": "1531", "is_new_question": false @@ -22335,9 +22566,9 @@ "question__title": "Number of Substrings With Only 1s", "question__title_slug": "number-of-substrings-with-only-1s", "question__hide": false, - "total_acs": 12176, - "total_submitted": 31538, - "total_column_articles": 175, + "total_acs": 12242, + "total_submitted": 31705, + "total_column_articles": 176, "frontend_question_id": "1513", "is_new_question": false }, @@ -22356,9 +22587,9 @@ "question__title": "Number of Good Pairs", "question__title_slug": "number-of-good-pairs", "question__hide": false, - "total_acs": 63743, - "total_submitted": 75134, - "total_column_articles": 822, + "total_acs": 63941, + "total_submitted": 75369, + "total_column_articles": 825, "frontend_question_id": "1512", "is_new_question": false }, @@ -22377,8 +22608,8 @@ "question__title": "Clone N-ary Tree", "question__title_slug": "clone-n-ary-tree", "question__hide": false, - "total_acs": 1468, - "total_submitted": 1757, + "total_acs": 1474, + "total_submitted": 1764, "total_column_articles": 35, "frontend_question_id": "1490", "is_new_question": false @@ -22398,8 +22629,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": 3757, - "total_submitted": 5954, + "total_acs": 3786, + "total_submitted": 5998, "total_column_articles": 62, "frontend_question_id": "1526", "is_new_question": false @@ -22419,8 +22650,8 @@ "question__title": "Number of Good Ways to Split a String", "question__title_slug": "number-of-good-ways-to-split-a-string", "question__hide": false, - "total_acs": 6501, - "total_submitted": 9853, + "total_acs": 6537, + "total_submitted": 9908, "total_column_articles": 125, "frontend_question_id": "1525", "is_new_question": false @@ -22440,8 +22671,8 @@ "question__title": "Number of Sub-arrays With Odd Sum", "question__title_slug": "number-of-sub-arrays-with-odd-sum", "question__hide": false, - "total_acs": 6578, - "total_submitted": 14985, + "total_acs": 6672, + "total_submitted": 15159, "total_column_articles": 122, "frontend_question_id": "1524", "is_new_question": false @@ -22461,9 +22692,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": 23729, - "total_submitted": 46270, - "total_column_articles": 385, + "total_acs": 24385, + "total_submitted": 47577, + "total_column_articles": 391, "frontend_question_id": "1523", "is_new_question": false }, @@ -22482,8 +22713,8 @@ "question__title": "Minimum Possible Integer After at Most K Adjacent Swaps On Digits", "question__title_slug": "minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits", "question__hide": false, - "total_acs": 3685, - "total_submitted": 9947, + "total_acs": 3697, + "total_submitted": 9995, "total_column_articles": 78, "frontend_question_id": "1505", "is_new_question": false @@ -22503,8 +22734,8 @@ "question__title": "Count Submatrices With All Ones", "question__title_slug": "count-submatrices-with-all-ones", "question__hide": false, - "total_acs": 8964, - "total_submitted": 14730, + "total_acs": 9028, + "total_submitted": 14821, "total_column_articles": 147, "frontend_question_id": "1504", "is_new_question": false @@ -22524,8 +22755,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": 9584, - "total_submitted": 18369, + "total_acs": 9623, + "total_submitted": 18434, "total_column_articles": 97, "frontend_question_id": "1503", "is_new_question": false @@ -22545,9 +22776,9 @@ "question__title": "Can Make Arithmetic Progression From Sequence", "question__title_slug": "can-make-arithmetic-progression-from-sequence", "question__hide": false, - "total_acs": 32869, - "total_submitted": 46407, - "total_column_articles": 406, + "total_acs": 33208, + "total_submitted": 46858, + "total_column_articles": 410, "frontend_question_id": "1502", "is_new_question": false }, @@ -22566,9 +22797,9 @@ "question__title": "Group Sold Products By The Date", "question__title_slug": "group-sold-products-by-the-date", "question__hide": false, - "total_acs": 9443, - "total_submitted": 13862, - "total_column_articles": 76, + "total_acs": 10641, + "total_submitted": 15605, + "total_column_articles": 84, "frontend_question_id": "1484", "is_new_question": false }, @@ -22587,8 +22818,8 @@ "question__title": "Clone Binary Tree With Random Pointer", "question__title_slug": "clone-binary-tree-with-random-pointer", "question__hide": false, - "total_acs": 1036, - "total_submitted": 1302, + "total_acs": 1049, + "total_submitted": 1323, "total_column_articles": 32, "frontend_question_id": "1485", "is_new_question": false @@ -22608,8 +22839,8 @@ "question__title": "Sales by Day of the Week", "question__title_slug": "sales-by-day-of-the-week", "question__hide": false, - "total_acs": 2738, - "total_submitted": 4891, + "total_acs": 2754, + "total_submitted": 4917, "total_column_articles": 52, "frontend_question_id": "1479", "is_new_question": false @@ -22629,9 +22860,9 @@ "question__title": "Max Value of Equation", "question__title_slug": "max-value-of-equation", "question__hide": false, - "total_acs": 3412, - "total_submitted": 8885, - "total_column_articles": 73, + "total_acs": 3445, + "total_submitted": 8955, + "total_column_articles": 74, "frontend_question_id": "1499", "is_new_question": false }, @@ -22650,9 +22881,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": 6181, - "total_submitted": 18074, - "total_column_articles": 85, + "total_acs": 6372, + "total_submitted": 18464, + "total_column_articles": 91, "frontend_question_id": "1498", "is_new_question": false }, @@ -22671,8 +22902,8 @@ "question__title": "Check If Array Pairs Are Divisible by k", "question__title_slug": "check-if-array-pairs-are-divisible-by-k", "question__hide": false, - "total_acs": 9849, - "total_submitted": 24713, + "total_acs": 9919, + "total_submitted": 24924, "total_column_articles": 123, "frontend_question_id": "1497", "is_new_question": false @@ -22692,9 +22923,9 @@ "question__title": "Path Crossing", "question__title_slug": "path-crossing", "question__hide": false, - "total_acs": 12850, - "total_submitted": 24012, - "total_column_articles": 192, + "total_acs": 12932, + "total_submitted": 24162, + "total_column_articles": 193, "frontend_question_id": "1496", "is_new_question": false }, @@ -22713,8 +22944,8 @@ "question__title": "Delete N Nodes After M Nodes of a Linked List", "question__title_slug": "delete-n-nodes-after-m-nodes-of-a-linked-list", "question__hide": false, - "total_acs": 2458, - "total_submitted": 3441, + "total_acs": 2472, + "total_submitted": 3459, "total_column_articles": 78, "frontend_question_id": "1474", "is_new_question": false @@ -22734,8 +22965,8 @@ "question__title": "Stone Game IV", "question__title_slug": "stone-game-iv", "question__hide": false, - "total_acs": 6224, - "total_submitted": 10542, + "total_acs": 6287, + "total_submitted": 10634, "total_column_articles": 75, "frontend_question_id": "1510", "is_new_question": false @@ -22755,9 +22986,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": 6240, - "total_submitted": 11271, - "total_column_articles": 103, + "total_acs": 6275, + "total_submitted": 11333, + "total_column_articles": 104, "frontend_question_id": "1509", "is_new_question": false }, @@ -22776,9 +23007,9 @@ "question__title": "Range Sum of Sorted Subarray Sums", "question__title_slug": "range-sum-of-sorted-subarray-sums", "question__hide": false, - "total_acs": 7296, - "total_submitted": 13155, - "total_column_articles": 74, + "total_acs": 7504, + "total_submitted": 13472, + "total_column_articles": 75, "frontend_question_id": "1508", "is_new_question": false }, @@ -22797,9 +23028,9 @@ "question__title": "Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree", "question__title_slug": "find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree", "question__hide": false, - "total_acs": 12167, - "total_submitted": 17770, - "total_column_articles": 134, + "total_acs": 12217, + "total_submitted": 17871, + "total_column_articles": 135, "frontend_question_id": "1489", "is_new_question": false }, @@ -22818,9 +23049,9 @@ "question__title": "Avoid Flood in The City", "question__title_slug": "avoid-flood-in-the-city", "question__hide": false, - "total_acs": 9008, - "total_submitted": 36257, - "total_column_articles": 131, + "total_acs": 9153, + "total_submitted": 36655, + "total_column_articles": 134, "frontend_question_id": "1488", "is_new_question": false }, @@ -22839,9 +23070,9 @@ "question__title": "Making File Names Unique", "question__title_slug": "making-file-names-unique", "question__hide": false, - "total_acs": 8715, - "total_submitted": 27323, - "total_column_articles": 115, + "total_acs": 8758, + "total_submitted": 27436, + "total_column_articles": 116, "frontend_question_id": "1487", "is_new_question": false }, @@ -22860,8 +23091,8 @@ "question__title": "XOR Operation in an Array", "question__title_slug": "xor-operation-in-an-array", "question__hide": false, - "total_acs": 74581, - "total_submitted": 86967, + "total_acs": 74710, + "total_submitted": 87116, "total_column_articles": 722, "frontend_question_id": "1486", "is_new_question": false @@ -22881,8 +23112,8 @@ "question__title": "Find All The Lonely Nodes", "question__title_slug": "find-all-the-lonely-nodes", "question__hide": false, - "total_acs": 3500, - "total_submitted": 4306, + "total_acs": 3553, + "total_submitted": 4362, "total_column_articles": 111, "frontend_question_id": "1469", "is_new_question": false @@ -22902,9 +23133,9 @@ "question__title": "Calculate Salaries", "question__title_slug": "calculate-salaries", "question__hide": false, - "total_acs": 3946, - "total_submitted": 5663, - "total_column_articles": 57, + "total_acs": 3995, + "total_submitted": 5726, + "total_column_articles": 59, "frontend_question_id": "1468", "is_new_question": false }, @@ -22923,8 +23154,8 @@ "question__title": "Rectangles Area", "question__title_slug": "rectangles-area", "question__hide": false, - "total_acs": 3166, - "total_submitted": 5213, + "total_acs": 3239, + "total_submitted": 5311, "total_column_articles": 55, "frontend_question_id": "1459", "is_new_question": false @@ -22944,9 +23175,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": 33944, - "total_submitted": 57612, - "total_column_articles": 439, + "total_acs": 34215, + "total_submitted": 58018, + "total_column_articles": 445, "frontend_question_id": "1482", "is_new_question": false }, @@ -22965,9 +23196,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": 11539, - "total_submitted": 22070, - "total_column_articles": 164, + "total_acs": 11583, + "total_submitted": 22161, + "total_column_articles": 166, "frontend_question_id": "1481", "is_new_question": false }, @@ -22986,9 +23217,9 @@ "question__title": "Running Sum of 1d Array", "question__title_slug": "running-sum-of-1d-array", "question__hide": false, - "total_acs": 139695, - "total_submitted": 160723, - "total_column_articles": 1396, + "total_acs": 140200, + "total_submitted": 161366, + "total_column_articles": 1399, "frontend_question_id": "1480", "is_new_question": false }, @@ -23007,8 +23238,8 @@ "question__title": "Parallel Courses II", "question__title_slug": "parallel-courses-ii", "question__hide": false, - "total_acs": 2938, - "total_submitted": 7717, + "total_acs": 2968, + "total_submitted": 7796, "total_column_articles": 45, "frontend_question_id": "1494", "is_new_question": false @@ -23028,9 +23259,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": 10984, - "total_submitted": 18920, - "total_column_articles": 202, + "total_acs": 11175, + "total_submitted": 19207, + "total_column_articles": 204, "frontend_question_id": "1493", "is_new_question": false }, @@ -23049,9 +23280,9 @@ "question__title": "The kth Factor of n", "question__title_slug": "the-kth-factor-of-n", "question__hide": false, - "total_acs": 9969, - "total_submitted": 15824, - "total_column_articles": 112, + "total_acs": 10058, + "total_submitted": 15966, + "total_column_articles": 114, "frontend_question_id": "1492", "is_new_question": false }, @@ -23070,9 +23301,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": 31645, - "total_submitted": 49009, - "total_column_articles": 450, + "total_acs": 32166, + "total_submitted": 49827, + "total_column_articles": 455, "frontend_question_id": "1491", "is_new_question": false }, @@ -23091,8 +23322,8 @@ "question__title": "Paint House III", "question__title_slug": "paint-house-iii", "question__hide": false, - "total_acs": 16130, - "total_submitted": 24029, + "total_acs": 16167, + "total_submitted": 24085, "total_column_articles": 171, "frontend_question_id": "1473", "is_new_question": false @@ -23112,9 +23343,9 @@ "question__title": "Design Browser History", "question__title_slug": "design-browser-history", "question__hide": false, - "total_acs": 11082, - "total_submitted": 17929, - "total_column_articles": 173, + "total_acs": 11182, + "total_submitted": 18107, + "total_column_articles": 178, "frontend_question_id": "1472", "is_new_question": false }, @@ -23133,8 +23364,8 @@ "question__title": "The k Strongest Values in an Array", "question__title_slug": "the-k-strongest-values-in-an-array", "question__hide": false, - "total_acs": 8130, - "total_submitted": 14831, + "total_acs": 8180, + "total_submitted": 14915, "total_column_articles": 119, "frontend_question_id": "1471", "is_new_question": false @@ -23154,9 +23385,9 @@ "question__title": "Shuffle the Array", "question__title_slug": "shuffle-the-array", "question__hide": false, - "total_acs": 59032, - "total_submitted": 70302, - "total_column_articles": 786, + "total_acs": 59223, + "total_submitted": 70546, + "total_column_articles": 790, "frontend_question_id": "1470", "is_new_question": false }, @@ -23175,9 +23406,9 @@ "question__title": "Active Users", "question__title_slug": "active-users", "question__hide": false, - "total_acs": 6775, - "total_submitted": 17141, - "total_column_articles": 98, + "total_acs": 6912, + "total_submitted": 17417, + "total_column_articles": 99, "frontend_question_id": "1454", "is_new_question": false }, @@ -23196,9 +23427,9 @@ "question__title": "Apples & Oranges", "question__title_slug": "apples-oranges", "question__hide": false, - "total_acs": 5699, - "total_submitted": 6621, - "total_column_articles": 65, + "total_acs": 5921, + "total_submitted": 6875, + "total_column_articles": 67, "frontend_question_id": "1445", "is_new_question": false }, @@ -23217,9 +23448,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": 1885, - "total_submitted": 3008, - "total_column_articles": 51, + "total_acs": 1893, + "total_submitted": 3021, + "total_column_articles": 52, "frontend_question_id": "1467", "is_new_question": false }, @@ -23238,9 +23469,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": 7755, - "total_submitted": 15887, - "total_column_articles": 156, + "total_acs": 7841, + "total_submitted": 16030, + "total_column_articles": 159, "frontend_question_id": "1466", "is_new_question": false }, @@ -23259,8 +23490,8 @@ "question__title": "Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts", "question__title_slug": "maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts", "question__hide": false, - "total_acs": 7246, - "total_submitted": 22770, + "total_acs": 7281, + "total_submitted": 22878, "total_column_articles": 90, "frontend_question_id": "1465", "is_new_question": false @@ -23280,9 +23511,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": 32296, - "total_submitted": 42302, - "total_column_articles": 451, + "total_acs": 32566, + "total_submitted": 42658, + "total_column_articles": 454, "frontend_question_id": "1464", "is_new_question": false }, @@ -23301,9 +23532,9 @@ "question__title": "Find Two Non-overlapping Sub-arrays Each With Target Sum", "question__title_slug": "find-two-non-overlapping-sub-arrays-each-with-target-sum", "question__hide": false, - "total_acs": 6249, - "total_submitted": 21080, - "total_column_articles": 113, + "total_acs": 6300, + "total_submitted": 21260, + "total_column_articles": 114, "frontend_question_id": "1477", "is_new_question": false }, @@ -23322,9 +23553,9 @@ "question__title": "Subrectangle Queries", "question__title_slug": "subrectangle-queries", "question__hide": false, - "total_acs": 13755, - "total_submitted": 15920, - "total_column_articles": 127, + "total_acs": 13816, + "total_submitted": 15988, + "total_column_articles": 128, "frontend_question_id": "1476", "is_new_question": false }, @@ -23343,8 +23574,8 @@ "question__title": "Allocate Mailboxes", "question__title_slug": "allocate-mailboxes", "question__hide": false, - "total_acs": 3518, - "total_submitted": 5865, + "total_acs": 3571, + "total_submitted": 5944, "total_column_articles": 68, "frontend_question_id": "1478", "is_new_question": false @@ -23364,9 +23595,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": 19363, - "total_submitted": 27106, - "total_column_articles": 304, + "total_acs": 19711, + "total_submitted": 27569, + "total_column_articles": 311, "frontend_question_id": "1475", "is_new_question": false }, @@ -23385,8 +23616,8 @@ "question__title": "Max Dot Product of Two Subsequences", "question__title_slug": "max-dot-product-of-two-subsequences", "question__hide": false, - "total_acs": 6174, - "total_submitted": 13772, + "total_acs": 6212, + "total_submitted": 13841, "total_column_articles": 99, "frontend_question_id": "1458", "is_new_question": false @@ -23406,8 +23637,8 @@ "question__title": "Pseudo-Palindromic Paths in a Binary Tree", "question__title_slug": "pseudo-palindromic-paths-in-a-binary-tree", "question__hide": false, - "total_acs": 9038, - "total_submitted": 14433, + "total_acs": 9070, + "total_submitted": 14491, "total_column_articles": 156, "frontend_question_id": "1457", "is_new_question": false @@ -23427,9 +23658,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": 18272, - "total_submitted": 34480, - "total_column_articles": 261, + "total_acs": 18501, + "total_submitted": 34923, + "total_column_articles": 264, "frontend_question_id": "1456", "is_new_question": false }, @@ -23448,9 +23679,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": 13918, - "total_submitted": 22200, - "total_column_articles": 250, + "total_acs": 13972, + "total_submitted": 22292, + "total_column_articles": 251, "frontend_question_id": "1455", "is_new_question": false }, @@ -23469,9 +23700,9 @@ "question__title": "Evaluate Boolean Expression", "question__title_slug": "evaluate-boolean-expression", "question__hide": false, - "total_acs": 3780, - "total_submitted": 5356, - "total_column_articles": 46, + "total_acs": 3909, + "total_submitted": 5559, + "total_column_articles": 49, "frontend_question_id": "1440", "is_new_question": false }, @@ -23490,9 +23721,9 @@ "question__title": "Create a Session Bar Chart", "question__title_slug": "create-a-session-bar-chart", "question__hide": false, - "total_acs": 5433, - "total_submitted": 8706, - "total_column_articles": 53, + "total_acs": 5472, + "total_submitted": 8774, + "total_column_articles": 54, "frontend_question_id": "1435", "is_new_question": false }, @@ -23511,9 +23742,9 @@ "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": 1821, - "total_submitted": 4941, - "total_column_articles": 35, + "total_acs": 1824, + "total_submitted": 4945, + "total_column_articles": 36, "frontend_question_id": "1453", "is_new_question": false }, @@ -23532,8 +23763,8 @@ "question__title": "People Whose List of Favorite Companies Is Not a Subset of Another List", "question__title_slug": "people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list", "question__hide": false, - "total_acs": 6604, - "total_submitted": 13007, + "total_acs": 6680, + "total_submitted": 13174, "total_column_articles": 101, "frontend_question_id": "1452", "is_new_question": false @@ -23553,9 +23784,9 @@ "question__title": "Rearrange Words in a Sentence", "question__title_slug": "rearrange-words-in-a-sentence", "question__hide": false, - "total_acs": 11428, - "total_submitted": 21561, - "total_column_articles": 172, + "total_acs": 11482, + "total_submitted": 21642, + "total_column_articles": 174, "frontend_question_id": "1451", "is_new_question": false }, @@ -23574,9 +23805,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": 26273, - "total_submitted": 32649, - "total_column_articles": 372, + "total_acs": 26375, + "total_submitted": 32780, + "total_column_articles": 373, "frontend_question_id": "1450", "is_new_question": false }, @@ -23595,8 +23826,8 @@ "question__title": "Cherry Pickup II", "question__title_slug": "cherry-pickup-ii", "question__hide": false, - "total_acs": 3256, - "total_submitted": 5368, + "total_acs": 3294, + "total_submitted": 5418, "total_column_articles": 74, "frontend_question_id": "1463", "is_new_question": false @@ -23616,9 +23847,9 @@ "question__title": "Course Schedule IV", "question__title_slug": "course-schedule-iv", "question__hide": false, - "total_acs": 8599, - "total_submitted": 19365, - "total_column_articles": 169, + "total_acs": 8689, + "total_submitted": 19561, + "total_column_articles": 170, "frontend_question_id": "1462", "is_new_question": false }, @@ -23637,9 +23868,9 @@ "question__title": "Check If a String Contains All Binary Codes of Size K", "question__title_slug": "check-if-a-string-contains-all-binary-codes-of-size-k", "question__hide": false, - "total_acs": 6978, - "total_submitted": 13679, - "total_column_articles": 97, + "total_acs": 7036, + "total_submitted": 13802, + "total_column_articles": 98, "frontend_question_id": "1461", "is_new_question": false }, @@ -23658,9 +23889,9 @@ "question__title": "Make Two Arrays Equal by Reversing Sub-arrays", "question__title_slug": "make-two-arrays-equal-by-reversing-sub-arrays", "question__hide": false, - "total_acs": 17833, - "total_submitted": 24094, - "total_column_articles": 361, + "total_acs": 17930, + "total_submitted": 24225, + "total_column_articles": 364, "frontend_question_id": "1460", "is_new_question": false }, @@ -23679,8 +23910,8 @@ "question__title": "Number of Ways of Cutting a Pizza", "question__title_slug": "number-of-ways-of-cutting-a-pizza", "question__hide": false, - "total_acs": 3063, - "total_submitted": 5754, + "total_acs": 3101, + "total_submitted": 5815, "total_column_articles": 70, "frontend_question_id": "1444", "is_new_question": false @@ -23700,9 +23931,9 @@ "question__title": "Minimum Time to Collect All Apples in a Tree", "question__title_slug": "minimum-time-to-collect-all-apples-in-a-tree", "question__hide": false, - "total_acs": 6382, - "total_submitted": 15272, - "total_column_articles": 158, + "total_acs": 6401, + "total_submitted": 15314, + "total_column_articles": 159, "frontend_question_id": "1443", "is_new_question": false }, @@ -23721,8 +23952,8 @@ "question__title": "Count Triplets That Can Form Two Arrays of Equal XOR", "question__title_slug": "count-triplets-that-can-form-two-arrays-of-equal-xor", "question__hide": false, - "total_acs": 36163, - "total_submitted": 45682, + "total_acs": 36210, + "total_submitted": 45739, "total_column_articles": 385, "frontend_question_id": "1442", "is_new_question": false @@ -23742,9 +23973,9 @@ "question__title": "Build an Array With Stack Operations", "question__title_slug": "build-an-array-with-stack-operations", "question__hide": false, - "total_acs": 20651, - "total_submitted": 31768, - "total_column_articles": 422, + "total_acs": 20748, + "total_submitted": 31930, + "total_column_articles": 426, "frontend_question_id": "1441", "is_new_question": false }, @@ -23763,8 +23994,8 @@ "question__title": "NPV Queries", "question__title_slug": "npv-queries", "question__hide": false, - "total_acs": 4282, - "total_submitted": 5936, + "total_acs": 4330, + "total_submitted": 6017, "total_column_articles": 44, "frontend_question_id": "1421", "is_new_question": false @@ -23784,8 +24015,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": 5934, - "total_submitted": 10754, + "total_acs": 5993, + "total_submitted": 10832, "total_column_articles": 83, "frontend_question_id": "1439", "is_new_question": false @@ -23805,9 +24036,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": 36761, - "total_submitted": 75610, - "total_column_articles": 509, + "total_acs": 36973, + "total_submitted": 76011, + "total_column_articles": 510, "frontend_question_id": "1438", "is_new_question": false }, @@ -23826,9 +24057,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": 12498, - "total_submitted": 21565, - "total_column_articles": 207, + "total_acs": 12565, + "total_submitted": 21704, + "total_column_articles": 208, "frontend_question_id": "1437", "is_new_question": false }, @@ -23847,9 +24078,9 @@ "question__title": "Destination City", "question__title_slug": "destination-city", "question__hide": false, - "total_acs": 48143, - "total_submitted": 58630, - "total_column_articles": 691, + "total_acs": 48271, + "total_submitted": 58788, + "total_column_articles": 693, "frontend_question_id": "1436", "is_new_question": false }, @@ -23868,9 +24099,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": 3721, - "total_submitted": 6765, - "total_column_articles": 81, + "total_acs": 3775, + "total_submitted": 6856, + "total_column_articles": 84, "frontend_question_id": "1412", "is_new_question": false }, @@ -23889,8 +24120,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": 17417, - "total_submitted": 27804, + "total_acs": 17459, + "total_submitted": 27892, "total_column_articles": 215, "frontend_question_id": "1449", "is_new_question": false @@ -23910,9 +24141,9 @@ "question__title": "Count Good Nodes in Binary Tree", "question__title_slug": "count-good-nodes-in-binary-tree", "question__hide": false, - "total_acs": 13649, - "total_submitted": 19041, - "total_column_articles": 217, + "total_acs": 13793, + "total_submitted": 19239, + "total_column_articles": 222, "frontend_question_id": "1448", "is_new_question": false }, @@ -23931,8 +24162,8 @@ "question__title": "Simplified Fractions", "question__title_slug": "simplified-fractions", "question__hide": false, - "total_acs": 39463, - "total_submitted": 58198, + "total_acs": 39504, + "total_submitted": 58273, "total_column_articles": 505, "frontend_question_id": "1447", "is_new_question": false @@ -23952,9 +24183,9 @@ "question__title": "Consecutive Characters", "question__title_slug": "consecutive-characters", "question__hide": false, - "total_acs": 53062, - "total_submitted": 87043, - "total_column_articles": 708, + "total_acs": 53207, + "total_submitted": 87280, + "total_column_articles": 710, "frontend_question_id": "1446", "is_new_question": false }, @@ -23973,9 +24204,9 @@ "question__title": "Top Travellers", "question__title_slug": "top-travellers", "question__hide": false, - "total_acs": 9648, - "total_submitted": 14240, - "total_column_articles": 95, + "total_acs": 10297, + "total_submitted": 15163, + "total_column_articles": 102, "frontend_question_id": "1407", "is_new_question": false }, @@ -23994,8 +24225,8 @@ "question__title": "Diagonal Traverse II", "question__title_slug": "diagonal-traverse-ii", "question__hide": false, - "total_acs": 8082, - "total_submitted": 19755, + "total_acs": 8139, + "total_submitted": 19887, "total_column_articles": 174, "frontend_question_id": "1424", "is_new_question": false @@ -24015,8 +24246,8 @@ "question__title": "Maximum Points You Can Obtain from Cards", "question__title_slug": "maximum-points-you-can-obtain-from-cards", "question__hide": false, - "total_acs": 39648, - "total_submitted": 71376, + "total_acs": 39907, + "total_submitted": 71882, "total_column_articles": 572, "frontend_question_id": "1423", "is_new_question": false @@ -24036,9 +24267,9 @@ "question__title": "Maximum Score After Splitting a String", "question__title_slug": "maximum-score-after-splitting-a-string", "question__hide": false, - "total_acs": 12238, - "total_submitted": 22559, - "total_column_articles": 233, + "total_acs": 12318, + "total_submitted": 22712, + "total_column_articles": 236, "frontend_question_id": "1422", "is_new_question": false }, @@ -24057,9 +24288,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": 5917, - "total_submitted": 7890, - "total_column_articles": 83, + "total_acs": 6119, + "total_submitted": 8191, + "total_column_articles": 84, "frontend_question_id": "1398", "is_new_question": false }, @@ -24078,9 +24309,9 @@ "question__title": "Build Array Where You Can Find The Maximum Exactly K Comparisons", "question__title_slug": "build-array-where-you-can-find-the-maximum-exactly-k-comparisons", "question__hide": false, - "total_acs": 2791, - "total_submitted": 4566, - "total_column_articles": 50, + "total_acs": 2815, + "total_submitted": 4604, + "total_column_articles": 51, "frontend_question_id": "1420", "is_new_question": false }, @@ -24099,8 +24330,8 @@ "question__title": "Minimum Number of Frogs Croaking", "question__title_slug": "minimum-number-of-frogs-croaking", "question__hide": false, - "total_acs": 8828, - "total_submitted": 20767, + "total_acs": 8871, + "total_submitted": 20873, "total_column_articles": 175, "frontend_question_id": "1419", "is_new_question": false @@ -24120,8 +24351,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": 27025, - "total_submitted": 36980, + "total_acs": 27050, + "total_submitted": 37018, "total_column_articles": 427, "frontend_question_id": "1418", "is_new_question": false @@ -24141,9 +24372,9 @@ "question__title": "Reformat The String", "question__title_slug": "reformat-the-string", "question__hide": false, - "total_acs": 14653, - "total_submitted": 28094, - "total_column_articles": 211, + "total_acs": 14722, + "total_submitted": 28214, + "total_column_articles": 214, "frontend_question_id": "1417", "is_new_question": false }, @@ -24162,9 +24393,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": 3038, - "total_submitted": 6258, - "total_column_articles": 51, + "total_acs": 3072, + "total_submitted": 6312, + "total_column_articles": 52, "frontend_question_id": "1434", "is_new_question": false }, @@ -24183,8 +24414,8 @@ "question__title": "Check If a String Can Break Another String", "question__title_slug": "check-if-a-string-can-break-another-string", "question__hide": false, - "total_acs": 6794, - "total_submitted": 10597, + "total_acs": 6821, + "total_submitted": 10651, "total_column_articles": 124, "frontend_question_id": "1433", "is_new_question": false @@ -24204,8 +24435,8 @@ "question__title": "Max Difference You Can Get From Changing an Integer", "question__title_slug": "max-difference-you-can-get-from-changing-an-integer", "question__hide": false, - "total_acs": 5124, - "total_submitted": 12921, + "total_acs": 5153, + "total_submitted": 13008, "total_column_articles": 114, "frontend_question_id": "1432", "is_new_question": false @@ -24225,9 +24456,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": 82398, - "total_submitted": 97451, - "total_column_articles": 1079, + "total_acs": 82549, + "total_submitted": 97629, + "total_column_articles": 1082, "frontend_question_id": "1431", "is_new_question": false }, @@ -24246,8 +24477,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": 8632, - "total_submitted": 15515, + "total_acs": 8671, + "total_submitted": 15575, "total_column_articles": 150, "frontend_question_id": "1411", "is_new_question": false @@ -24267,8 +24498,8 @@ "question__title": "HTML Entity Parser", "question__title_slug": "html-entity-parser", "question__hide": false, - "total_acs": 8096, - "total_submitted": 17010, + "total_acs": 8146, + "total_submitted": 17095, "total_column_articles": 127, "frontend_question_id": "1410", "is_new_question": false @@ -24288,9 +24519,9 @@ "question__title": "Queries on a Permutation With Key", "question__title_slug": "queries-on-a-permutation-with-key", "question__hide": false, - "total_acs": 9187, - "total_submitted": 11351, - "total_column_articles": 156, + "total_acs": 9234, + "total_submitted": 11406, + "total_column_articles": 157, "frontend_question_id": "1409", "is_new_question": false }, @@ -24309,8 +24540,8 @@ "question__title": "String Matching in an Array", "question__title_slug": "string-matching-in-an-array", "question__hide": false, - "total_acs": 15746, - "total_submitted": 25471, + "total_acs": 15833, + "total_submitted": 25613, "total_column_articles": 234, "frontend_question_id": "1408", "is_new_question": false @@ -24330,9 +24561,9 @@ "question__title": "Capital Gain/Loss", "question__title_slug": "capital-gainloss", "question__hide": false, - "total_acs": 7326, - "total_submitted": 8614, - "total_column_articles": 83, + "total_acs": 7976, + "total_submitted": 9380, + "total_column_articles": 86, "frontend_question_id": "1393", "is_new_question": false }, @@ -24351,9 +24582,9 @@ "question__title": "Stone Game III", "question__title_slug": "stone-game-iii", "question__hide": false, - "total_acs": 6000, - "total_submitted": 10304, - "total_column_articles": 93, + "total_acs": 6056, + "total_submitted": 10401, + "total_column_articles": 94, "frontend_question_id": "1406", "is_new_question": false }, @@ -24372,8 +24603,8 @@ "question__title": "Number of Steps to Reduce a Number in Binary Representation to One", "question__title_slug": "number-of-steps-to-reduce-a-number-in-binary-representation-to-one", "question__hide": false, - "total_acs": 8161, - "total_submitted": 16364, + "total_acs": 8192, + "total_submitted": 16421, "total_column_articles": 170, "frontend_question_id": "1404", "is_new_question": false @@ -24393,9 +24624,9 @@ "question__title": "Minimum Subsequence in Non-Increasing Order", "question__title_slug": "minimum-subsequence-in-non-increasing-order", "question__hide": false, - "total_acs": 23880, - "total_submitted": 34670, - "total_column_articles": 410, + "total_acs": 23980, + "total_submitted": 34808, + "total_column_articles": 412, "frontend_question_id": "1403", "is_new_question": false }, @@ -24414,9 +24645,9 @@ "question__title": "Total Sales Amount by Year", "question__title_slug": "total-sales-amount-by-year", "question__hide": false, - "total_acs": 2639, - "total_submitted": 4705, - "total_column_articles": 57, + "total_acs": 2706, + "total_submitted": 4816, + "total_column_articles": 61, "frontend_question_id": "1384", "is_new_question": false }, @@ -24435,8 +24666,8 @@ "question__title": "Restore The Array", "question__title_slug": "restore-the-array", "question__hide": false, - "total_acs": 3141, - "total_submitted": 7599, + "total_acs": 3161, + "total_submitted": 7635, "total_column_articles": 61, "frontend_question_id": "1416", "is_new_question": false @@ -24456,9 +24687,9 @@ "question__title": "The k-th Lexicographical String of All Happy Strings of Length n", "question__title_slug": "the-k-th-lexicographical-string-of-all-happy-strings-of-length-n", "question__hide": false, - "total_acs": 7407, - "total_submitted": 10840, - "total_column_articles": 199, + "total_acs": 7439, + "total_submitted": 10879, + "total_column_articles": 198, "frontend_question_id": "1415", "is_new_question": false }, @@ -24477,8 +24708,8 @@ "question__title": "Find the Minimum Number of Fibonacci Numbers Whose Sum Is K", "question__title_slug": "find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k", "question__hide": false, - "total_acs": 28238, - "total_submitted": 40005, + "total_acs": 28285, + "total_submitted": 40064, "total_column_articles": 428, "frontend_question_id": "1414", "is_new_question": false @@ -24498,8 +24729,8 @@ "question__title": "Minimum Value to Get Positive Step by Step Sum", "question__title_slug": "minimum-value-to-get-positive-step-by-step-sum", "question__hide": false, - "total_acs": 13599, - "total_submitted": 19548, + "total_acs": 13692, + "total_submitted": 19673, "total_column_articles": 283, "frontend_question_id": "1413", "is_new_question": false @@ -24519,8 +24750,8 @@ "question__title": "Find All Good Strings", "question__title_slug": "find-all-good-strings", "question__hide": false, - "total_acs": 1235, - "total_submitted": 3078, + "total_acs": 1251, + "total_submitted": 3107, "total_column_articles": 41, "frontend_question_id": "1397", "is_new_question": false @@ -24540,9 +24771,9 @@ "question__title": "Design Underground System", "question__title_slug": "design-underground-system", "question__hide": false, - "total_acs": 14911, - "total_submitted": 36510, - "total_column_articles": 203, + "total_acs": 15111, + "total_submitted": 37022, + "total_column_articles": 210, "frontend_question_id": "1396", "is_new_question": false }, @@ -24561,9 +24792,9 @@ "question__title": "Count Number of Teams", "question__title_slug": "count-number-of-teams", "question__hide": false, - "total_acs": 16059, - "total_submitted": 22061, - "total_column_articles": 232, + "total_acs": 16137, + "total_submitted": 22191, + "total_column_articles": 234, "frontend_question_id": "1395", "is_new_question": false }, @@ -24582,9 +24813,9 @@ "question__title": "Find Lucky Integer in an Array", "question__title_slug": "find-lucky-integer-in-an-array", "question__hide": false, - "total_acs": 19982, - "total_submitted": 30146, - "total_column_articles": 331, + "total_acs": 20158, + "total_submitted": 30401, + "total_column_articles": 335, "frontend_question_id": "1394", "is_new_question": false }, @@ -24603,8 +24834,8 @@ "question__title": "Replace Employee ID With The Unique Identifier", "question__title_slug": "replace-employee-id-with-the-unique-identifier", "question__hide": false, - "total_acs": 8888, - "total_submitted": 10243, + "total_acs": 8948, + "total_submitted": 10307, "total_column_articles": 71, "frontend_question_id": "1378", "is_new_question": false @@ -24624,9 +24855,9 @@ "question__title": "Longest Happy Prefix", "question__title_slug": "longest-happy-prefix", "question__hide": false, - "total_acs": 10339, - "total_submitted": 24319, - "total_column_articles": 181, + "total_acs": 10443, + "total_submitted": 24521, + "total_column_articles": 182, "frontend_question_id": "1392", "is_new_question": false }, @@ -24645,9 +24876,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": 7371, - "total_submitted": 18146, - "total_column_articles": 221, + "total_acs": 7406, + "total_submitted": 18217, + "total_column_articles": 223, "frontend_question_id": "1391", "is_new_question": false }, @@ -24666,9 +24897,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": 30974, - "total_submitted": 37277, - "total_column_articles": 513, + "total_acs": 31074, + "total_submitted": 37401, + "total_column_articles": 514, "frontend_question_id": "1389", "is_new_question": false }, @@ -24687,9 +24918,9 @@ "question__title": "Get the Second Most Recent Activity", "question__title_slug": "get-the-second-most-recent-activity", "question__hide": false, - "total_acs": 3719, - "total_submitted": 6180, - "total_column_articles": 55, + "total_acs": 3787, + "total_submitted": 6276, + "total_column_articles": 56, "frontend_question_id": "1369", "is_new_question": false }, @@ -24708,9 +24939,9 @@ "question__title": "Reducing Dishes", "question__title_slug": "reducing-dishes", "question__hide": false, - "total_acs": 11576, - "total_submitted": 15264, - "total_column_articles": 206, + "total_acs": 11657, + "total_submitted": 15372, + "total_column_articles": 209, "frontend_question_id": "1402", "is_new_question": false }, @@ -24729,9 +24960,9 @@ "question__title": "Construct K Palindrome Strings", "question__title_slug": "construct-k-palindrome-strings", "question__hide": false, - "total_acs": 7122, - "total_submitted": 11628, - "total_column_articles": 114, + "total_acs": 7189, + "total_submitted": 11741, + "total_column_articles": 115, "frontend_question_id": "1400", "is_new_question": false }, @@ -24750,8 +24981,8 @@ "question__title": "Circle and Rectangle Overlapping", "question__title_slug": "circle-and-rectangle-overlapping", "question__hide": false, - "total_acs": 4560, - "total_submitted": 10805, + "total_acs": 4584, + "total_submitted": 10865, "total_column_articles": 105, "frontend_question_id": "1401", "is_new_question": false @@ -24771,9 +25002,9 @@ "question__title": "Count Largest Group", "question__title_slug": "count-largest-group", "question__hide": false, - "total_acs": 10962, - "total_submitted": 16339, - "total_column_articles": 176, + "total_acs": 11053, + "total_submitted": 16487, + "total_column_articles": 177, "frontend_question_id": "1399", "is_new_question": false }, @@ -24792,9 +25023,9 @@ "question__title": "Maximum Performance of a Team", "question__title_slug": "maximum-performance-of-a-team", "question__hide": false, - "total_acs": 5185, - "total_submitted": 15689, - "total_column_articles": 95, + "total_acs": 5204, + "total_submitted": 15729, + "total_column_articles": 96, "frontend_question_id": "1383", "is_new_question": false }, @@ -24813,8 +25044,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": 11994, - "total_submitted": 14270, + "total_acs": 12064, + "total_submitted": 14376, "total_column_articles": 187, "frontend_question_id": "1379", "is_new_question": false @@ -24834,8 +25065,8 @@ "question__title": "Design a Stack With Increment Operation", "question__title_slug": "design-a-stack-with-increment-operation", "question__hide": false, - "total_acs": 14369, - "total_submitted": 19710, + "total_acs": 14406, + "total_submitted": 19759, "total_column_articles": 186, "frontend_question_id": "1381", "is_new_question": false @@ -24855,9 +25086,9 @@ "question__title": "Lucky Numbers in a Matrix", "question__title_slug": "lucky-numbers-in-a-matrix", "question__hide": false, - "total_acs": 52030, - "total_submitted": 67615, - "total_column_articles": 695, + "total_acs": 52132, + "total_submitted": 67745, + "total_column_articles": 698, "frontend_question_id": "1380", "is_new_question": false }, @@ -24876,9 +25107,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": 4543, - "total_submitted": 6623, - "total_column_articles": 77, + "total_acs": 4607, + "total_submitted": 6714, + "total_column_articles": 78, "frontend_question_id": "1364", "is_new_question": false }, @@ -24897,9 +25128,9 @@ "question__title": "Activity Participants", "question__title_slug": "activity-participants", "question__hide": false, - "total_acs": 5259, - "total_submitted": 7889, - "total_column_articles": 69, + "total_acs": 5321, + "total_submitted": 7983, + "total_column_articles": 71, "frontend_question_id": "1355", "is_new_question": false }, @@ -24918,9 +25149,9 @@ "question__title": "Frog Position After T Seconds", "question__title_slug": "frog-position-after-t-seconds", "question__hide": false, - "total_acs": 4798, - "total_submitted": 14540, - "total_column_articles": 142, + "total_acs": 4843, + "total_submitted": 14675, + "total_column_articles": 144, "frontend_question_id": "1377", "is_new_question": false }, @@ -24939,9 +25170,9 @@ "question__title": "Time Needed to Inform All Employees", "question__title_slug": "time-needed-to-inform-all-employees", "question__hide": false, - "total_acs": 10068, - "total_submitted": 19118, - "total_column_articles": 208, + "total_acs": 10268, + "total_submitted": 19455, + "total_column_articles": 210, "frontend_question_id": "1376", "is_new_question": false }, @@ -24960,9 +25191,9 @@ "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": 9444, - "total_submitted": 16174, - "total_column_articles": 189, + "total_acs": 9459, + "total_submitted": 16194, + "total_column_articles": 190, "frontend_question_id": "1375", "is_new_question": false }, @@ -24981,9 +25212,9 @@ "question__title": "Generate a String With Characters That Have Odd Counts", "question__title_slug": "generate-a-string-with-characters-that-have-odd-counts", "question__hide": false, - "total_acs": 18635, - "total_submitted": 25066, - "total_column_articles": 245, + "total_acs": 18710, + "total_submitted": 25153, + "total_column_articles": 246, "frontend_question_id": "1374", "is_new_question": false }, @@ -25002,8 +25233,8 @@ "question__title": "Pizza With 3n Slices", "question__title_slug": "pizza-with-3n-slices", "question__hide": false, - "total_acs": 5308, - "total_submitted": 9613, + "total_acs": 5349, + "total_submitted": 9679, "total_column_articles": 64, "frontend_question_id": "1388", "is_new_question": false @@ -25023,9 +25254,9 @@ "question__title": "Sort Integers by The Power Value", "question__title_slug": "sort-integers-by-the-power-value", "question__hide": false, - "total_acs": 11204, - "total_submitted": 16123, - "total_column_articles": 204, + "total_acs": 11250, + "total_submitted": 16185, + "total_column_articles": 205, "frontend_question_id": "1387", "is_new_question": false }, @@ -25044,8 +25275,8 @@ "question__title": "Cinema Seat Allocation", "question__title_slug": "cinema-seat-allocation", "question__hide": false, - "total_acs": 7108, - "total_submitted": 22072, + "total_acs": 7165, + "total_submitted": 22202, "total_column_articles": 144, "frontend_question_id": "1386", "is_new_question": false @@ -25065,9 +25296,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": 20128, - "total_submitted": 29818, - "total_column_articles": 294, + "total_acs": 20870, + "total_submitted": 31004, + "total_column_articles": 306, "frontend_question_id": "1385", "is_new_question": false }, @@ -25086,9 +25317,9 @@ "question__title": "Minimum Cost to Make at Least One Valid Path in a Grid", "question__title_slug": "minimum-cost-to-make-at-least-one-valid-path-in-a-grid", "question__hide": false, - "total_acs": 4751, - "total_submitted": 8570, - "total_column_articles": 110, + "total_acs": 4841, + "total_submitted": 8718, + "total_column_articles": 112, "frontend_question_id": "1368", "is_new_question": false }, @@ -25107,9 +25338,9 @@ "question__title": "Linked List in Binary Tree", "question__title_slug": "linked-list-in-binary-tree", "question__hide": false, - "total_acs": 18161, - "total_submitted": 42581, - "total_column_articles": 278, + "total_acs": 18362, + "total_submitted": 42982, + "total_column_articles": 283, "frontend_question_id": "1367", "is_new_question": false }, @@ -25128,8 +25359,8 @@ "question__title": "Rank Teams by Votes", "question__title_slug": "rank-teams-by-votes", "question__hide": false, - "total_acs": 8050, - "total_submitted": 14776, + "total_acs": 8130, + "total_submitted": 14899, "total_column_articles": 153, "frontend_question_id": "1366", "is_new_question": false @@ -25149,9 +25380,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": 92460, - "total_submitted": 112197, - "total_column_articles": 1158, + "total_acs": 92792, + "total_submitted": 112618, + "total_column_articles": 1164, "frontend_question_id": "1365", "is_new_question": false }, @@ -25170,8 +25401,8 @@ "question__title": "Students With Invalid Departments", "question__title_slug": "students-with-invalid-departments", "question__hide": false, - "total_acs": 10312, - "total_submitted": 12136, + "total_acs": 10383, + "total_submitted": 12216, "total_column_articles": 95, "frontend_question_id": "1350", "is_new_question": false @@ -25191,9 +25422,9 @@ "question__title": "Movie Rating", "question__title_slug": "movie-rating", "question__hide": false, - "total_acs": 4338, - "total_submitted": 11318, - "total_column_articles": 56, + "total_acs": 4432, + "total_submitted": 11492, + "total_column_articles": 57, "frontend_question_id": "1341", "is_new_question": false }, @@ -25212,9 +25443,9 @@ "question__title": "Construct Target Array With Multiple Sums", "question__title_slug": "construct-target-array-with-multiple-sums", "question__hide": false, - "total_acs": 3237, - "total_submitted": 11546, - "total_column_articles": 76, + "total_acs": 3267, + "total_submitted": 11601, + "total_column_articles": 77, "frontend_question_id": "1354", "is_new_question": false }, @@ -25233,9 +25464,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": 13933, - "total_submitted": 48117, - "total_column_articles": 175, + "total_acs": 14027, + "total_submitted": 48450, + "total_column_articles": 178, "frontend_question_id": "1353", "is_new_question": false }, @@ -25254,9 +25485,9 @@ "question__title": "Product of the Last K Numbers", "question__title_slug": "product-of-the-last-k-numbers", "question__hide": false, - "total_acs": 8066, - "total_submitted": 17628, - "total_column_articles": 91, + "total_acs": 8136, + "total_submitted": 17822, + "total_column_articles": 94, "frontend_question_id": "1352", "is_new_question": false }, @@ -25275,9 +25506,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": 36130, - "total_submitted": 47893, - "total_column_articles": 624, + "total_acs": 36690, + "total_submitted": 48686, + "total_column_articles": 629, "frontend_question_id": "1351", "is_new_question": false }, @@ -25296,9 +25527,9 @@ "question__title": "Maximum Sum BST in Binary Tree", "question__title_slug": "maximum-sum-bst-in-binary-tree", "question__hide": false, - "total_acs": 13360, - "total_submitted": 32161, - "total_column_articles": 251, + "total_acs": 13609, + "total_submitted": 32674, + "total_column_articles": 255, "frontend_question_id": "1373", "is_new_question": false }, @@ -25317,8 +25548,8 @@ "question__title": "Longest ZigZag Path in a Binary Tree", "question__title_slug": "longest-zigzag-path-in-a-binary-tree", "question__hide": false, - "total_acs": 9964, - "total_submitted": 19014, + "total_acs": 10032, + "total_submitted": 19128, "total_column_articles": 194, "frontend_question_id": "1372", "is_new_question": false @@ -25338,9 +25569,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": 22656, - "total_submitted": 38983, - "total_column_articles": 285, + "total_acs": 22719, + "total_submitted": 39091, + "total_column_articles": 286, "frontend_question_id": "1371", "is_new_question": false }, @@ -25359,9 +25590,9 @@ "question__title": "Increasing Decreasing String", "question__title_slug": "increasing-decreasing-string", "question__hide": false, - "total_acs": 49951, - "total_submitted": 63224, - "total_column_articles": 604, + "total_acs": 50030, + "total_submitted": 63349, + "total_column_articles": 605, "frontend_question_id": "1370", "is_new_question": false }, @@ -25380,9 +25611,9 @@ "question__title": "Maximum Students Taking Exam", "question__title_slug": "maximum-students-taking-exam", "question__hide": false, - "total_acs": 3890, - "total_submitted": 7485, - "total_column_articles": 106, + "total_acs": 3928, + "total_submitted": 7542, + "total_column_articles": 109, "frontend_question_id": "1349", "is_new_question": false }, @@ -25401,8 +25632,8 @@ "question__title": "Tweet Counts Per Frequency", "question__title_slug": "tweet-counts-per-frequency", "question__hide": false, - "total_acs": 4024, - "total_submitted": 12506, + "total_acs": 4045, + "total_submitted": 12560, "total_column_articles": 63, "frontend_question_id": "1348", "is_new_question": false @@ -25422,9 +25653,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": 9051, - "total_submitted": 12109, - "total_column_articles": 139, + "total_acs": 9095, + "total_submitted": 12161, + "total_column_articles": 140, "frontend_question_id": "1347", "is_new_question": false }, @@ -25443,9 +25674,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": 20537, - "total_submitted": 47673, - "total_column_articles": 355, + "total_acs": 21024, + "total_submitted": 48940, + "total_column_articles": 360, "frontend_question_id": "1346", "is_new_question": false }, @@ -25464,9 +25695,9 @@ "question__title": "Number of Transactions per Visit", "question__title_slug": "number-of-transactions-per-visit", "question__hide": false, - "total_acs": 2396, - "total_submitted": 5399, - "total_column_articles": 61, + "total_acs": 2432, + "total_submitted": 5464, + "total_column_articles": 62, "frontend_question_id": "1336", "is_new_question": false }, @@ -25485,9 +25716,9 @@ "question__title": "Jump Game V", "question__title_slug": "jump-game-v", "question__hide": false, - "total_acs": 5278, - "total_submitted": 9076, - "total_column_articles": 108, + "total_acs": 5318, + "total_submitted": 9136, + "total_column_articles": 111, "frontend_question_id": "1340", "is_new_question": false }, @@ -25506,9 +25737,9 @@ "question__title": "Maximum Product of Splitted Binary Tree", "question__title_slug": "maximum-product-of-splitted-binary-tree", "question__hide": false, - "total_acs": 9887, - "total_submitted": 24377, - "total_column_articles": 148, + "total_acs": 9964, + "total_submitted": 24572, + "total_column_articles": 151, "frontend_question_id": "1339", "is_new_question": false }, @@ -25527,9 +25758,9 @@ "question__title": "Reduce Array Size to The Half", "question__title_slug": "reduce-array-size-to-the-half", "question__hide": false, - "total_acs": 10434, - "total_submitted": 16277, - "total_column_articles": 155, + "total_acs": 10497, + "total_submitted": 16360, + "total_column_articles": 156, "frontend_question_id": "1338", "is_new_question": false }, @@ -25548,9 +25779,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": 45725, - "total_submitted": 65885, - "total_column_articles": 729, + "total_acs": 46436, + "total_submitted": 67001, + "total_column_articles": 742, "frontend_question_id": "1337", "is_new_question": false }, @@ -25569,8 +25800,8 @@ "question__title": "List the Products Ordered in a Period", "question__title_slug": "list-the-products-ordered-in-a-period", "question__hide": false, - "total_acs": 7199, - "total_submitted": 10458, + "total_acs": 7249, + "total_submitted": 10532, "total_column_articles": 68, "frontend_question_id": "1327", "is_new_question": false @@ -25590,8 +25821,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": 3421, - "total_submitted": 6137, + "total_acs": 3438, + "total_submitted": 6168, "total_column_articles": 80, "frontend_question_id": "1359", "is_new_question": false @@ -25611,9 +25842,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": 7432, - "total_submitted": 14615, - "total_column_articles": 134, + "total_acs": 7542, + "total_submitted": 14825, + "total_column_articles": 135, "frontend_question_id": "1358", "is_new_question": false }, @@ -25632,8 +25863,8 @@ "question__title": "Apply Discount Every n Orders", "question__title_slug": "apply-discount-every-n-orders", "question__hide": false, - "total_acs": 5129, - "total_submitted": 9585, + "total_acs": 5163, + "total_submitted": 9654, "total_column_articles": 52, "frontend_question_id": "1357", "is_new_question": false @@ -25653,9 +25884,9 @@ "question__title": "Sort Integers by The Number of 1 Bits", "question__title_slug": "sort-integers-by-the-number-of-1-bits", "question__hide": false, - "total_acs": 50564, - "total_submitted": 69221, - "total_column_articles": 575, + "total_acs": 50821, + "total_submitted": 69584, + "total_column_articles": 581, "frontend_question_id": "1356", "is_new_question": false }, @@ -25674,8 +25905,8 @@ "question__title": "Minimum Difficulty of a Job Schedule", "question__title_slug": "minimum-difficulty-of-a-job-schedule", "question__hide": false, - "total_acs": 4242, - "total_submitted": 7128, + "total_acs": 4280, + "total_submitted": 7213, "total_column_articles": 68, "frontend_question_id": "1335", "is_new_question": false @@ -25695,9 +25926,9 @@ "question__title": "Find the City With the Smallest Number of Neighbors at a Threshold Distance", "question__title_slug": "find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance", "question__hide": false, - "total_acs": 7552, - "total_submitted": 14846, - "total_column_articles": 113, + "total_acs": 7642, + "total_submitted": 14999, + "total_column_articles": 116, "frontend_question_id": "1334", "is_new_question": false }, @@ -25716,8 +25947,8 @@ "question__title": "Filter Restaurants by Vegan-Friendly, Price and Distance", "question__title_slug": "filter-restaurants-by-vegan-friendly-price-and-distance", "question__hide": false, - "total_acs": 6521, - "total_submitted": 11790, + "total_acs": 6542, + "total_submitted": 11819, "total_column_articles": 133, "frontend_question_id": "1333", "is_new_question": false @@ -25737,9 +25968,9 @@ "question__title": "Remove Palindromic Subsequences", "question__title_slug": "remove-palindromic-subsequences", "question__hide": false, - "total_acs": 31501, - "total_submitted": 40392, - "total_column_articles": 330, + "total_acs": 31590, + "total_submitted": 40509, + "total_column_articles": 331, "frontend_question_id": "1332", "is_new_question": false }, @@ -25758,8 +25989,8 @@ "question__title": "Ads Performance", "question__title_slug": "ads-performance", "question__hide": false, - "total_acs": 7073, - "total_submitted": 11895, + "total_acs": 7128, + "total_submitted": 12008, "total_column_articles": 73, "frontend_question_id": "1322", "is_new_question": false @@ -25779,9 +26010,9 @@ "question__title": "Restaurant Growth", "question__title_slug": "restaurant-growth", "question__hide": false, - "total_acs": 6209, - "total_submitted": 10044, - "total_column_articles": 103, + "total_acs": 6313, + "total_submitted": 10185, + "total_column_articles": 104, "frontend_question_id": "1321", "is_new_question": false }, @@ -25800,9 +26031,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": 6664, - "total_submitted": 14022, - "total_column_articles": 100, + "total_acs": 6690, + "total_submitted": 14088, + "total_column_articles": 101, "frontend_question_id": "1326", "is_new_question": false }, @@ -25821,9 +26052,9 @@ "question__title": "Delete Leaves With a Given Value", "question__title_slug": "delete-leaves-with-a-given-value", "question__hide": false, - "total_acs": 12555, - "total_submitted": 17192, - "total_column_articles": 212, + "total_acs": 12684, + "total_submitted": 17342, + "total_column_articles": 215, "frontend_question_id": "1325", "is_new_question": false }, @@ -25842,8 +26073,8 @@ "question__title": "Print Words Vertically", "question__title_slug": "print-words-vertically", "question__hide": false, - "total_acs": 6900, - "total_submitted": 11717, + "total_acs": 6940, + "total_submitted": 11793, "total_column_articles": 140, "frontend_question_id": "1324", "is_new_question": false @@ -25863,9 +26094,9 @@ "question__title": "Maximum 69 Number", "question__title_slug": "maximum-69-number", "question__hide": false, - "total_acs": 28449, - "total_submitted": 37787, - "total_column_articles": 538, + "total_acs": 28629, + "total_submitted": 38043, + "total_column_articles": 543, "frontend_question_id": "1323", "is_new_question": false }, @@ -25884,8 +26115,8 @@ "question__title": "Jump Game IV", "question__title_slug": "jump-game-iv", "question__hide": false, - "total_acs": 24985, - "total_submitted": 53398, + "total_acs": 25101, + "total_submitted": 53692, "total_column_articles": 276, "frontend_question_id": "1345", "is_new_question": false @@ -25905,9 +26136,9 @@ "question__title": "Angle Between Hands of a Clock", "question__title_slug": "angle-between-hands-of-a-clock", "question__hide": false, - "total_acs": 7528, - "total_submitted": 12534, - "total_column_articles": 139, + "total_acs": 7582, + "total_submitted": 12615, + "total_column_articles": 140, "frontend_question_id": "1344", "is_new_question": false }, @@ -25926,9 +26157,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": 14377, - "total_submitted": 25919, - "total_column_articles": 245, + "total_acs": 14470, + "total_submitted": 26100, + "total_column_articles": 246, "frontend_question_id": "1343", "is_new_question": false }, @@ -25947,9 +26178,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": 66375, - "total_submitted": 80323, - "total_column_articles": 930, + "total_acs": 66915, + "total_submitted": 81044, + "total_column_articles": 937, "frontend_question_id": "1342", "is_new_question": false }, @@ -25968,9 +26199,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": 2788, - "total_submitted": 4718, - "total_column_articles": 65, + "total_acs": 2804, + "total_submitted": 4741, + "total_column_articles": 66, "frontend_question_id": "1320", "is_new_question": false }, @@ -25989,9 +26220,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": 36014, - "total_submitted": 58224, - "total_column_articles": 575, + "total_acs": 36297, + "total_submitted": 58662, + "total_column_articles": 577, "frontend_question_id": "1319", "is_new_question": false }, @@ -26010,8 +26241,8 @@ "question__title": "Minimum Flips to Make a OR b Equal to c", "question__title_slug": "minimum-flips-to-make-a-or-b-equal-to-c", "question__hide": false, - "total_acs": 7246, - "total_submitted": 10984, + "total_acs": 7281, + "total_submitted": 11032, "total_column_articles": 131, "frontend_question_id": "1318", "is_new_question": false @@ -26031,8 +26262,8 @@ "question__title": "Convert Integer to the Sum of Two No-Zero Integers", "question__title_slug": "convert-integer-to-the-sum-of-two-no-zero-integers", "question__hide": false, - "total_acs": 11663, - "total_submitted": 18863, + "total_acs": 11727, + "total_submitted": 18965, "total_column_articles": 218, "frontend_question_id": "1317", "is_new_question": false @@ -26052,9 +26283,9 @@ "question__title": "Running Total for Different Genders", "question__title_slug": "running-total-for-different-genders", "question__hide": false, - "total_acs": 7083, - "total_submitted": 9421, - "total_column_articles": 71, + "total_acs": 7240, + "total_submitted": 9636, + "total_column_articles": 73, "frontend_question_id": "1308", "is_new_question": false }, @@ -26073,9 +26304,9 @@ "question__title": "Find the Team Size", "question__title_slug": "find-the-team-size", "question__hide": false, - "total_acs": 11858, - "total_submitted": 14425, - "total_column_articles": 105, + "total_acs": 12116, + "total_submitted": 14724, + "total_column_articles": 113, "frontend_question_id": "1303", "is_new_question": false }, @@ -26094,9 +26325,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": 14515, - "total_submitted": 21484, - "total_column_articles": 181, + "total_acs": 14742, + "total_submitted": 21815, + "total_column_articles": 183, "frontend_question_id": "1312", "is_new_question": false }, @@ -26115,8 +26346,8 @@ "question__title": "Get Watched Videos by Your Friends", "question__title_slug": "get-watched-videos-by-your-friends", "question__hide": false, - "total_acs": 6288, - "total_submitted": 16257, + "total_acs": 6328, + "total_submitted": 16333, "total_column_articles": 95, "frontend_question_id": "1311", "is_new_question": false @@ -26136,8 +26367,8 @@ "question__title": "XOR Queries of a Subarray", "question__title_slug": "xor-queries-of-a-subarray", "question__hide": false, - "total_acs": 38832, - "total_submitted": 54254, + "total_acs": 38915, + "total_submitted": 54371, "total_column_articles": 513, "frontend_question_id": "1310", "is_new_question": false @@ -26157,9 +26388,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": 20584, - "total_submitted": 26948, - "total_column_articles": 370, + "total_acs": 20767, + "total_submitted": 27180, + "total_column_articles": 373, "frontend_question_id": "1309", "is_new_question": false }, @@ -26178,8 +26409,8 @@ "question__title": "Encrypt and Decrypt Strings", "question__title_slug": "encrypt-and-decrypt-strings", "question__hide": false, - "total_acs": 4411, - "total_submitted": 11443, + "total_acs": 4468, + "total_submitted": 11589, "total_column_articles": 77, "frontend_question_id": "2227", "is_new_question": false @@ -26199,8 +26430,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": 942, - "total_submitted": 1686, + "total_acs": 952, + "total_submitted": 1702, "total_column_articles": 38, "frontend_question_id": "1430", "is_new_question": false @@ -26220,9 +26451,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": 4118, - "total_submitted": 9957, - "total_column_articles": 88, + "total_acs": 4173, + "total_submitted": 10067, + "total_column_articles": 89, "frontend_question_id": "2192", "is_new_question": false }, @@ -26241,8 +26472,8 @@ "question__title": "Verbal Arithmetic Puzzle", "question__title_slug": "verbal-arithmetic-puzzle", "question__hide": false, - "total_acs": 1995, - "total_submitted": 6017, + "total_acs": 2006, + "total_submitted": 6052, "total_column_articles": 62, "frontend_question_id": "1307", "is_new_question": false @@ -26262,9 +26493,9 @@ "question__title": "Jump Game III", "question__title_slug": "jump-game-iii", "question__hide": false, - "total_acs": 22546, - "total_submitted": 38832, - "total_column_articles": 350, + "total_acs": 22850, + "total_submitted": 39347, + "total_column_articles": 351, "frontend_question_id": "1306", "is_new_question": false }, @@ -26283,9 +26514,9 @@ "question__title": "All Elements in Two Binary Search Trees", "question__title_slug": "all-elements-in-two-binary-search-trees", "question__hide": false, - "total_acs": 17466, - "total_submitted": 23335, - "total_column_articles": 262, + "total_acs": 43399, + "total_submitted": 55363, + "total_column_articles": 604, "frontend_question_id": "1305", "is_new_question": false }, @@ -26304,9 +26535,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": 23836, - "total_submitted": 33216, - "total_column_articles": 418, + "total_acs": 23954, + "total_submitted": 33393, + "total_column_articles": 421, "frontend_question_id": "1304", "is_new_question": false }, @@ -26325,9 +26556,9 @@ "question__title": "Weather Type in Each Country", "question__title_slug": "weather-type-in-each-country", "question__hide": false, - "total_acs": 9252, - "total_submitted": 14187, - "total_column_articles": 90, + "total_acs": 9385, + "total_submitted": 14367, + "total_column_articles": 92, "frontend_question_id": "1294", "is_new_question": false }, @@ -26346,8 +26577,8 @@ "question__title": "Maximum Candies You Can Get from Boxes", "question__title_slug": "maximum-candies-you-can-get-from-boxes", "question__hide": false, - "total_acs": 2943, - "total_submitted": 4970, + "total_acs": 2954, + "total_submitted": 4987, "total_column_articles": 99, "frontend_question_id": "1298", "is_new_question": false @@ -26367,9 +26598,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": 7750, - "total_submitted": 16676, - "total_column_articles": 104, + "total_acs": 7817, + "total_submitted": 16831, + "total_column_articles": 105, "frontend_question_id": "1297", "is_new_question": false }, @@ -26388,9 +26619,9 @@ "question__title": "Divide Array in Sets of K Consecutive Numbers", "question__title_slug": "divide-array-in-sets-of-k-consecutive-numbers", "question__hide": false, - "total_acs": 10171, - "total_submitted": 21055, - "total_column_articles": 152, + "total_acs": 10207, + "total_submitted": 21137, + "total_column_articles": 151, "frontend_question_id": "1296", "is_new_question": false }, @@ -26409,9 +26640,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": 51739, - "total_submitted": 64171, - "total_column_articles": 685, + "total_acs": 51891, + "total_submitted": 64365, + "total_column_articles": 687, "frontend_question_id": "1295", "is_new_question": false }, @@ -26430,8 +26661,8 @@ "question__title": "Find the Start and End Number of Continuous Ranges", "question__title_slug": "find-the-start-and-end-number-of-continuous-ranges", "question__hide": false, - "total_acs": 5990, - "total_submitted": 7373, + "total_acs": 6120, + "total_submitted": 7525, "total_column_articles": 75, "frontend_question_id": "1285", "is_new_question": false @@ -26451,9 +26682,9 @@ "question__title": "Check if an Array Is Consecutive", "question__title_slug": "check-if-an-array-is-consecutive", "question__hide": false, - "total_acs": 150, - "total_submitted": 211, - "total_column_articles": 12, + "total_acs": 184, + "total_submitted": 263, + "total_column_articles": 13, "frontend_question_id": "2229", "is_new_question": false }, @@ -26472,9 +26703,9 @@ "question__title": "Students and Examinations", "question__title_slug": "students-and-examinations", "question__hide": false, - "total_acs": 9034, - "total_submitted": 18136, - "total_column_articles": 83, + "total_acs": 9192, + "total_submitted": 18471, + "total_column_articles": 85, "frontend_question_id": "1280", "is_new_question": false }, @@ -26493,8 +26724,8 @@ "question__title": "Shortest Path in a Grid with Obstacles Elimination", "question__title_slug": "shortest-path-in-a-grid-with-obstacles-elimination", "question__hide": false, - "total_acs": 16230, - "total_submitted": 43719, + "total_acs": 16322, + "total_submitted": 43938, "total_column_articles": 147, "frontend_question_id": "1293", "is_new_question": false @@ -26514,9 +26745,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": 7595, - "total_submitted": 15749, - "total_column_articles": 115, + "total_acs": 7765, + "total_submitted": 16024, + "total_column_articles": 121, "frontend_question_id": "1292", "is_new_question": false }, @@ -26535,9 +26766,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": 63352, - "total_submitted": 78369, - "total_column_articles": 823, + "total_acs": 63818, + "total_submitted": 78978, + "total_column_articles": 832, "frontend_question_id": "1290", "is_new_question": false }, @@ -26556,8 +26787,8 @@ "question__title": "Traffic Light Controlled Intersection", "question__title_slug": "traffic-light-controlled-intersection", "question__hide": false, - "total_acs": 1930, - "total_submitted": 3063, + "total_acs": 1943, + "total_submitted": 3079, "total_column_articles": 21, "frontend_question_id": "1279", "is_new_question": false @@ -26577,8 +26808,8 @@ "question__title": "Minimum Number of Flips to Convert Binary Matrix to Zero Matrix", "question__title_slug": "minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix", "question__hide": false, - "total_acs": 3065, - "total_submitted": 4550, + "total_acs": 3081, + "total_submitted": 4583, "total_column_articles": 72, "frontend_question_id": "1284", "is_new_question": false @@ -26598,9 +26829,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": 8882, - "total_submitted": 20278, - "total_column_articles": 122, + "total_acs": 9092, + "total_submitted": 20604, + "total_column_articles": 128, "frontend_question_id": "1283", "is_new_question": false }, @@ -26619,9 +26850,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": 13990, - "total_submitted": 17229, - "total_column_articles": 262, + "total_acs": 14069, + "total_submitted": 17320, + "total_column_articles": 264, "frontend_question_id": "1282", "is_new_question": false }, @@ -26640,9 +26871,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": 54687, - "total_submitted": 65702, - "total_column_articles": 728, + "total_acs": 55135, + "total_submitted": 66230, + "total_column_articles": 735, "frontend_question_id": "1281", "is_new_question": false }, @@ -26661,8 +26892,8 @@ "question__title": "All People Report to the Given Manager", "question__title_slug": "all-people-report-to-the-given-manager", "question__hide": false, - "total_acs": 7659, - "total_submitted": 9504, + "total_acs": 7771, + "total_submitted": 9644, "total_column_articles": 95, "frontend_question_id": "1270", "is_new_question": false @@ -26682,8 +26913,8 @@ "question__title": "Print Immutable Linked List in Reverse", "question__title_slug": "print-immutable-linked-list-in-reverse", "question__hide": false, - "total_acs": 3728, - "total_submitted": 4070, + "total_acs": 3758, + "total_submitted": 4108, "total_column_articles": 82, "frontend_question_id": "1265", "is_new_question": false @@ -26703,9 +26934,9 @@ "question__title": "Palindrome Partitioning III", "question__title_slug": "palindrome-partitioning-iii", "question__hide": false, - "total_acs": 4498, - "total_submitted": 7382, - "total_column_articles": 70, + "total_acs": 4541, + "total_submitted": 7447, + "total_column_articles": 71, "frontend_question_id": "1278", "is_new_question": false }, @@ -26724,9 +26955,9 @@ "question__title": "Count Square Submatrices with All Ones", "question__title_slug": "count-square-submatrices-with-all-ones", "question__hide": false, - "total_acs": 23239, - "total_submitted": 31741, - "total_column_articles": 272, + "total_acs": 23452, + "total_submitted": 32024, + "total_column_articles": 274, "frontend_question_id": "1277", "is_new_question": false }, @@ -26745,8 +26976,8 @@ "question__title": "Number of Burgers with No Waste of Ingredients", "question__title_slug": "number-of-burgers-with-no-waste-of-ingredients", "question__hide": false, - "total_acs": 7304, - "total_submitted": 14470, + "total_acs": 7344, + "total_submitted": 14543, "total_column_articles": 110, "frontend_question_id": "1276", "is_new_question": false @@ -26766,8 +26997,8 @@ "question__title": "Find Winner on a Tic Tac Toe Game", "question__title_slug": "find-winner-on-a-tic-tac-toe-game", "question__hide": false, - "total_acs": 9510, - "total_submitted": 17421, + "total_acs": 9591, + "total_submitted": 17563, "total_column_articles": 187, "frontend_question_id": "1275", "is_new_question": false @@ -26787,9 +27018,9 @@ "question__title": "Page Recommendations", "question__title_slug": "page-recommendations", "question__hide": false, - "total_acs": 6685, - "total_submitted": 11785, - "total_column_articles": 97, + "total_acs": 6841, + "total_submitted": 12072, + "total_column_articles": 100, "frontend_question_id": "1264", "is_new_question": false }, @@ -26808,9 +27039,9 @@ "question__title": "Number of Ways to Stay in the Same Place After Some Steps", "question__title_slug": "number-of-ways-to-stay-in-the-same-place-after-some-steps", "question__hide": false, - "total_acs": 30980, - "total_submitted": 63102, - "total_column_articles": 326, + "total_acs": 30999, + "total_submitted": 63138, + "total_column_articles": 327, "frontend_question_id": "1269", "is_new_question": false }, @@ -26829,9 +27060,9 @@ "question__title": "Search Suggestions System", "question__title_slug": "search-suggestions-system", "question__hide": false, - "total_acs": 10236, - "total_submitted": 17411, - "total_column_articles": 174, + "total_acs": 10325, + "total_submitted": 17563, + "total_column_articles": 176, "frontend_question_id": "1268", "is_new_question": false }, @@ -26850,8 +27081,8 @@ "question__title": "Count Servers that Communicate", "question__title_slug": "count-servers-that-communicate", "question__hide": false, - "total_acs": 10701, - "total_submitted": 17545, + "total_acs": 10748, + "total_submitted": 17611, "total_column_articles": 166, "frontend_question_id": "1267", "is_new_question": false @@ -26871,9 +27102,9 @@ "question__title": "Minimum Time Visiting All Points", "question__title_slug": "minimum-time-visiting-all-points", "question__hide": false, - "total_acs": 31858, - "total_submitted": 38600, - "total_column_articles": 480, + "total_acs": 31936, + "total_submitted": 38685, + "total_column_articles": 481, "frontend_question_id": "1266", "is_new_question": false }, @@ -26892,9 +27123,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": 4438, - "total_submitted": 8399, - "total_column_articles": 71, + "total_acs": 4504, + "total_submitted": 8504, + "total_column_articles": 73, "frontend_question_id": "2218", "is_new_question": false }, @@ -26913,9 +27144,9 @@ "question__title": "Find the Difference of Two Arrays", "question__title_slug": "find-the-difference-of-two-arrays", "question__hide": false, - "total_acs": 9480, - "total_submitted": 14188, - "total_column_articles": 91, + "total_acs": 9686, + "total_submitted": 14484, + "total_column_articles": 97, "frontend_question_id": "2215", "is_new_question": false }, @@ -26934,8 +27165,8 @@ "question__title": "Counting Elements", "question__title_slug": "counting-elements", "question__hide": false, - "total_acs": 1873, - "total_submitted": 2652, + "total_acs": 1896, + "total_submitted": 2684, "total_column_articles": 63, "frontend_question_id": "1426", "is_new_question": false @@ -26955,9 +27186,9 @@ "question__title": "Average Selling Price", "question__title_slug": "average-selling-price", "question__hide": false, - "total_acs": 10606, - "total_submitted": 13767, - "total_column_articles": 116, + "total_acs": 10850, + "total_submitted": 14071, + "total_column_articles": 117, "frontend_question_id": "1251", "is_new_question": false }, @@ -26976,9 +27207,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": 3905, - "total_submitted": 9201, - "total_column_articles": 72, + "total_acs": 3916, + "total_submitted": 9232, + "total_column_articles": 73, "frontend_question_id": "1263", "is_new_question": false }, @@ -26997,9 +27228,9 @@ "question__title": "Greatest Sum Divisible by Three", "question__title_slug": "greatest-sum-divisible-by-three", "question__hide": false, - "total_acs": 16429, - "total_submitted": 31084, - "total_column_articles": 230, + "total_acs": 16546, + "total_submitted": 31285, + "total_column_articles": 231, "frontend_question_id": "1262", "is_new_question": false }, @@ -27018,9 +27249,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": 9183, - "total_submitted": 12551, - "total_column_articles": 129, + "total_acs": 9239, + "total_submitted": 12630, + "total_column_articles": 131, "frontend_question_id": "1261", "is_new_question": false }, @@ -27039,9 +27270,9 @@ "question__title": "Shift 2D Grid", "question__title_slug": "shift-2d-grid", "question__hide": false, - "total_acs": 15024, - "total_submitted": 24768, - "total_column_articles": 289, + "total_acs": 15110, + "total_submitted": 24887, + "total_column_articles": 290, "frontend_question_id": "1260", "is_new_question": false }, @@ -27060,8 +27291,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": 97, - "total_submitted": 175, + "total_acs": 105, + "total_submitted": 190, "total_column_articles": 10, "frontend_question_id": "2189", "is_new_question": false @@ -27081,9 +27312,9 @@ "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": 470, - "total_submitted": 794, - "total_column_articles": 20, + "total_acs": 488, + "total_submitted": 813, + "total_column_articles": 21, "frontend_question_id": "1618", "is_new_question": false }, @@ -27102,8 +27333,8 @@ "question__title": "Number of Single Divisor Triplets", "question__title_slug": "number-of-single-divisor-triplets", "question__hide": false, - "total_acs": 70, - "total_submitted": 107, + "total_acs": 71, + "total_submitted": 110, "total_column_articles": 6, "frontend_question_id": "2198", "is_new_question": false @@ -27123,9 +27354,9 @@ "question__title": "Maximum Score Words Formed by Letters", "question__title_slug": "maximum-score-words-formed-by-letters", "question__hide": false, - "total_acs": 3665, - "total_submitted": 5248, - "total_column_articles": 80, + "total_acs": 3700, + "total_submitted": 5288, + "total_column_articles": 81, "frontend_question_id": "1255", "is_new_question": false }, @@ -27144,9 +27375,9 @@ "question__title": "Number of Closed Islands", "question__title_slug": "number-of-closed-islands", "question__hide": false, - "total_acs": 24654, - "total_submitted": 40019, - "total_column_articles": 396, + "total_acs": 25257, + "total_submitted": 40968, + "total_column_articles": 411, "frontend_question_id": "1254", "is_new_question": false }, @@ -27165,8 +27396,8 @@ "question__title": "Reconstruct a 2-Row Binary Matrix", "question__title_slug": "reconstruct-a-2-row-binary-matrix", "question__hide": false, - "total_acs": 5890, - "total_submitted": 14828, + "total_acs": 5911, + "total_submitted": 14872, "total_column_articles": 91, "frontend_question_id": "1253", "is_new_question": false @@ -27186,9 +27417,9 @@ "question__title": "Cells with Odd Values in a Matrix", "question__title_slug": "cells-with-odd-values-in-a-matrix", "question__hide": false, - "total_acs": 19793, - "total_submitted": 26473, - "total_column_articles": 351, + "total_acs": 19869, + "total_submitted": 26580, + "total_column_articles": 352, "frontend_question_id": "1252", "is_new_question": false }, @@ -27207,9 +27438,9 @@ "question__title": "Number of Comments per Post", "question__title_slug": "number-of-comments-per-post", "question__hide": false, - "total_acs": 8525, - "total_submitted": 14367, - "total_column_articles": 74, + "total_acs": 8604, + "total_submitted": 14507, + "total_column_articles": 75, "frontend_question_id": "1241", "is_new_question": false }, @@ -27228,8 +27459,8 @@ "question__title": "Find Palindrome With Fixed Length", "question__title_slug": "find-palindrome-with-fixed-length", "question__hide": false, - "total_acs": 5922, - "total_submitted": 18524, + "total_acs": 5978, + "total_submitted": 18671, "total_column_articles": 143, "frontend_question_id": "2217", "is_new_question": false @@ -27249,9 +27480,9 @@ "question__title": "Leftmost Column with at Least a One", "question__title_slug": "leftmost-column-with-at-least-a-one", "question__hide": false, - "total_acs": 1567, - "total_submitted": 2605, - "total_column_articles": 25, + "total_acs": 1590, + "total_submitted": 2637, + "total_column_articles": 26, "frontend_question_id": "1428", "is_new_question": false }, @@ -27270,8 +27501,8 @@ "question__title": "Check If It Is a Good Array", "question__title_slug": "check-if-it-is-a-good-array", "question__hide": false, - "total_acs": 3378, - "total_submitted": 5830, + "total_acs": 3408, + "total_submitted": 5870, "total_column_articles": 46, "frontend_question_id": "1250", "is_new_question": false @@ -27291,9 +27522,9 @@ "question__title": "Minimum Remove to Make Valid Parentheses", "question__title_slug": "minimum-remove-to-make-valid-parentheses", "question__hide": false, - "total_acs": 31291, - "total_submitted": 53506, - "total_column_articles": 419, + "total_acs": 31702, + "total_submitted": 54156, + "total_column_articles": 425, "frontend_question_id": "1249", "is_new_question": false }, @@ -27312,9 +27543,9 @@ "question__title": "Count Number of Nice Subarrays", "question__title_slug": "count-number-of-nice-subarrays", "question__hide": false, - "total_acs": 40783, - "total_submitted": 71871, - "total_column_articles": 540, + "total_acs": 41038, + "total_submitted": 72286, + "total_column_articles": 542, "frontend_question_id": "1248", "is_new_question": false }, @@ -27333,8 +27564,8 @@ "question__title": "Minimum Swaps to Make Strings Equal", "question__title_slug": "minimum-swaps-to-make-strings-equal", "question__hide": false, - "total_acs": 10657, - "total_submitted": 17044, + "total_acs": 10763, + "total_submitted": 17231, "total_column_articles": 183, "frontend_question_id": "1247", "is_new_question": false @@ -27354,8 +27585,8 @@ "question__title": "Web Crawler Multithreaded", "question__title_slug": "web-crawler-multithreaded", "question__hide": false, - "total_acs": 1592, - "total_submitted": 3315, + "total_acs": 1602, + "total_submitted": 3338, "total_column_articles": 23, "frontend_question_id": "1242", "is_new_question": false @@ -27375,8 +27606,8 @@ "question__title": "Maximum Height by Stacking Cuboids ", "question__title_slug": "maximum-height-by-stacking-cuboids", "question__hide": false, - "total_acs": 2812, - "total_submitted": 5683, + "total_acs": 2834, + "total_submitted": 5726, "total_column_articles": 68, "frontend_question_id": "1691", "is_new_question": false @@ -27396,9 +27627,9 @@ "question__title": "First Unique Number", "question__title_slug": "first-unique-number", "question__hide": false, - "total_acs": 1673, - "total_submitted": 3275, - "total_column_articles": 54, + "total_acs": 1708, + "total_submitted": 3338, + "total_column_articles": 55, "frontend_question_id": "1429", "is_new_question": false }, @@ -27417,8 +27648,8 @@ "question__title": "Tuple with Same Product", "question__title_slug": "tuple-with-same-product", "question__hide": false, - "total_acs": 6523, - "total_submitted": 13056, + "total_acs": 6556, + "total_submitted": 13111, "total_column_articles": 125, "frontend_question_id": "1726", "is_new_question": false @@ -27438,8 +27669,8 @@ "question__title": "Airplane Seat Assignment Probability", "question__title_slug": "airplane-seat-assignment-probability", "question__hide": false, - "total_acs": 11608, - "total_submitted": 17439, + "total_acs": 11663, + "total_submitted": 17516, "total_column_articles": 173, "frontend_question_id": "1227", "is_new_question": false @@ -27459,8 +27690,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": 2967, - "total_submitted": 5941, + "total_acs": 2995, + "total_submitted": 5987, "total_column_articles": 44, "frontend_question_id": "1240", "is_new_question": false @@ -27480,9 +27711,9 @@ "question__title": "Maximum Length of a Concatenated String with Unique Characters", "question__title_slug": "maximum-length-of-a-concatenated-string-with-unique-characters", "question__hide": false, - "total_acs": 36996, - "total_submitted": 75472, - "total_column_articles": 404, + "total_acs": 37087, + "total_submitted": 75690, + "total_column_articles": 405, "frontend_question_id": "1239", "is_new_question": false }, @@ -27501,8 +27732,8 @@ "question__title": "Circular Permutation in Binary Representation", "question__title_slug": "circular-permutation-in-binary-representation", "question__hide": false, - "total_acs": 3635, - "total_submitted": 5473, + "total_acs": 3663, + "total_submitted": 5516, "total_column_articles": 86, "frontend_question_id": "1238", "is_new_question": false @@ -27522,9 +27753,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": 11092, - "total_submitted": 15531, - "total_column_articles": 154, + "total_acs": 11136, + "total_submitted": 15611, + "total_column_articles": 155, "frontend_question_id": "1237", "is_new_question": false }, @@ -27543,9 +27774,9 @@ "question__title": "Report Contiguous Dates", "question__title_slug": "report-contiguous-dates", "question__hide": false, - "total_acs": 4480, - "total_submitted": 8305, - "total_column_articles": 95, + "total_acs": 4563, + "total_submitted": 8469, + "total_column_articles": 96, "frontend_question_id": "1225", "is_new_question": false }, @@ -27564,8 +27795,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": 2284, - "total_submitted": 4848, + "total_acs": 2311, + "total_submitted": 4891, "total_column_articles": 48, "frontend_question_id": "2193", "is_new_question": false @@ -27585,8 +27816,8 @@ "question__title": "Minimum Deletions to Make Array Beautiful", "question__title_slug": "minimum-deletions-to-make-array-beautiful", "question__hide": false, - "total_acs": 7683, - "total_submitted": 16420, + "total_acs": 7760, + "total_submitted": 16561, "total_column_articles": 147, "frontend_question_id": "2216", "is_new_question": false @@ -27606,8 +27837,8 @@ "question__title": "Find Players With Zero or One Losses", "question__title_slug": "find-players-with-zero-or-one-losses", "question__hide": false, - "total_acs": 8064, - "total_submitted": 12897, + "total_acs": 8191, + "total_submitted": 13080, "total_column_articles": 89, "frontend_question_id": "2225", "is_new_question": false @@ -27627,9 +27858,9 @@ "question__title": "Maximum Profit in Job Scheduling", "question__title_slug": "maximum-profit-in-job-scheduling", "question__hide": false, - "total_acs": 8321, - "total_submitted": 17493, - "total_column_articles": 145, + "total_acs": 8397, + "total_submitted": 17644, + "total_column_articles": 147, "frontend_question_id": "1235", "is_new_question": false }, @@ -27648,9 +27879,9 @@ "question__title": "Replace the Substring for Balanced String", "question__title_slug": "replace-the-substring-for-balanced-string", "question__hide": false, - "total_acs": 6943, - "total_submitted": 19880, - "total_column_articles": 106, + "total_acs": 7065, + "total_submitted": 20180, + "total_column_articles": 108, "frontend_question_id": "1234", "is_new_question": false }, @@ -27669,9 +27900,9 @@ "question__title": "Remove Sub-Folders from the Filesystem", "question__title_slug": "remove-sub-folders-from-the-filesystem", "question__hide": false, - "total_acs": 9860, - "total_submitted": 19826, - "total_column_articles": 143, + "total_acs": 9973, + "total_submitted": 20014, + "total_column_articles": 146, "frontend_question_id": "1233", "is_new_question": false }, @@ -27690,9 +27921,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": 38673, - "total_submitted": 83244, - "total_column_articles": 476, + "total_acs": 38908, + "total_submitted": 83810, + "total_column_articles": 480, "frontend_question_id": "1232", "is_new_question": false }, @@ -27711,8 +27942,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": 70, - "total_submitted": 85, + "total_acs": 77, + "total_submitted": 95, "total_column_articles": 8, "frontend_question_id": "2204", "is_new_question": false @@ -27732,9 +27963,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": 7338, - "total_submitted": 36079, - "total_column_articles": 130, + "total_acs": 7401, + "total_submitted": 36402, + "total_column_articles": 133, "frontend_question_id": "2202", "is_new_question": false }, @@ -27753,9 +27984,9 @@ "question__title": "Perform String Shifts", "question__title_slug": "perform-string-shifts", "question__hide": false, - "total_acs": 1819, - "total_submitted": 2869, - "total_column_articles": 67, + "total_acs": 1846, + "total_submitted": 2913, + "total_column_articles": 68, "frontend_question_id": "1427", "is_new_question": false }, @@ -27774,9 +28005,9 @@ "question__title": "Maximum Equal Frequency", "question__title_slug": "maximum-equal-frequency", "question__hide": false, - "total_acs": 5239, - "total_submitted": 15890, - "total_column_articles": 73, + "total_acs": 5269, + "total_submitted": 15960, + "total_column_articles": 76, "frontend_question_id": "1224", "is_new_question": false }, @@ -27795,8 +28026,8 @@ "question__title": "Dice Roll Simulation", "question__title_slug": "dice-roll-simulation", "question__hide": false, - "total_acs": 3720, - "total_submitted": 7766, + "total_acs": 3743, + "total_submitted": 7795, "total_column_articles": 64, "frontend_question_id": "1223", "is_new_question": false @@ -27816,8 +28047,8 @@ "question__title": "Queens That Can Attack the King", "question__title_slug": "queens-that-can-attack-the-king", "question__hide": false, - "total_acs": 6880, - "total_submitted": 10112, + "total_acs": 6943, + "total_submitted": 10200, "total_column_articles": 156, "frontend_question_id": "1222", "is_new_question": false @@ -27837,9 +28068,9 @@ "question__title": "Split a String in Balanced Strings", "question__title_slug": "split-a-string-in-balanced-strings", "question__hide": false, - "total_acs": 82254, - "total_submitted": 97428, - "total_column_articles": 1191, + "total_acs": 82566, + "total_submitted": 97811, + "total_column_articles": 1197, "frontend_question_id": "1221", "is_new_question": false }, @@ -27858,8 +28089,8 @@ "question__title": "The Dining Philosophers", "question__title_slug": "the-dining-philosophers", "question__hide": false, - "total_acs": 14262, - "total_submitted": 24095, + "total_acs": 14388, + "total_submitted": 24293, "total_column_articles": 152, "frontend_question_id": "1226", "is_new_question": false @@ -27879,9 +28110,9 @@ "question__title": "Team Scores in Football Tournament", "question__title_slug": "team-scores-in-football-tournament", "question__hide": false, - "total_acs": 6769, - "total_submitted": 13157, - "total_column_articles": 113, + "total_acs": 6899, + "total_submitted": 13410, + "total_column_articles": 114, "frontend_question_id": "1212", "is_new_question": false }, @@ -27900,9 +28131,9 @@ "question__title": "Queries Quality and Percentage", "question__title_slug": "queries-quality-and-percentage", "question__hide": false, - "total_acs": 9965, - "total_submitted": 15047, - "total_column_articles": 71, + "total_acs": 10155, + "total_submitted": 15313, + "total_column_articles": 74, "frontend_question_id": "1211", "is_new_question": false }, @@ -27921,9 +28152,9 @@ "question__title": "Design Skiplist", "question__title_slug": "design-skiplist", "question__hide": false, - "total_acs": 10187, - "total_submitted": 16459, - "total_column_articles": 117, + "total_acs": 10291, + "total_submitted": 16614, + "total_column_articles": 118, "frontend_question_id": "1206", "is_new_question": false }, @@ -27942,9 +28173,9 @@ "question__title": "Maximum Product of the Length of Two Palindromic Substrings", "question__title_slug": "maximum-product-of-the-length-of-two-palindromic-substrings", "question__hide": false, - "total_acs": 835, - "total_submitted": 2771, - "total_column_articles": 24, + "total_acs": 846, + "total_submitted": 2796, + "total_column_articles": 25, "frontend_question_id": "1960", "is_new_question": false }, @@ -27963,9 +28194,9 @@ "question__title": "Maximum Candies Allocated to K Children", "question__title_slug": "maximum-candies-allocated-to-k-children", "question__hide": false, - "total_acs": 7697, - "total_submitted": 24126, - "total_column_articles": 143, + "total_acs": 7872, + "total_submitted": 24557, + "total_column_articles": 144, "frontend_question_id": "2226", "is_new_question": false }, @@ -27984,8 +28215,8 @@ "question__title": "Sort the Jumbled Numbers", "question__title_slug": "sort-the-jumbled-numbers", "question__hide": false, - "total_acs": 5438, - "total_submitted": 13064, + "total_acs": 5475, + "total_submitted": 13145, "total_column_articles": 99, "frontend_question_id": "2191", "is_new_question": false @@ -28005,9 +28236,9 @@ "question__title": "Count Vowels Permutation", "question__title_slug": "count-vowels-permutation", "question__hide": false, - "total_acs": 24993, - "total_submitted": 41179, - "total_column_articles": 342, + "total_acs": 25111, + "total_submitted": 41355, + "total_column_articles": 343, "frontend_question_id": "1220", "is_new_question": false }, @@ -28026,9 +28257,9 @@ "question__title": "Path with Maximum Gold", "question__title_slug": "path-with-maximum-gold", "question__hide": false, - "total_acs": 35404, - "total_submitted": 50767, - "total_column_articles": 454, + "total_acs": 35562, + "total_submitted": 51019, + "total_column_articles": 455, "frontend_question_id": "1219", "is_new_question": false }, @@ -28047,9 +28278,9 @@ "question__title": "Longest Arithmetic Subsequence of Given Difference", "question__title_slug": "longest-arithmetic-subsequence-of-given-difference", "question__hide": false, - "total_acs": 39006, - "total_submitted": 75732, - "total_column_articles": 371, + "total_acs": 39129, + "total_submitted": 75962, + "total_column_articles": 373, "frontend_question_id": "1218", "is_new_question": false }, @@ -28068,9 +28299,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": 25528, - "total_submitted": 36512, - "total_column_articles": 408, + "total_acs": 25700, + "total_submitted": 36720, + "total_column_articles": 411, "frontend_question_id": "1217", "is_new_question": false }, @@ -28089,8 +28320,8 @@ "question__title": "Monthly Transactions II", "question__title_slug": "monthly-transactions-ii", "question__hide": false, - "total_acs": 6888, - "total_submitted": 14818, + "total_acs": 6949, + "total_submitted": 14971, "total_column_articles": 93, "frontend_question_id": "1205", "is_new_question": false @@ -28110,9 +28341,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": 7354, - "total_submitted": 10046, - "total_column_articles": 93, + "total_acs": 7441, + "total_submitted": 10167, + "total_column_articles": 94, "frontend_question_id": "1204", "is_new_question": false }, @@ -28131,8 +28362,8 @@ "question__title": "Sum of Floored Pairs", "question__title_slug": "sum-of-floored-pairs", "question__hide": false, - "total_acs": 2627, - "total_submitted": 8251, + "total_acs": 2648, + "total_submitted": 8305, "total_column_articles": 50, "frontend_question_id": "1862", "is_new_question": false @@ -28152,9 +28383,9 @@ "question__title": "Path with Maximum Probability", "question__title_slug": "path-with-maximum-probability", "question__hide": false, - "total_acs": 11820, - "total_submitted": 32605, - "total_column_articles": 182, + "total_acs": 11997, + "total_submitted": 32948, + "total_column_articles": 185, "frontend_question_id": "1514", "is_new_question": false }, @@ -28173,8 +28404,8 @@ "question__title": "Where Will the Ball Fall", "question__title_slug": "where-will-the-ball-fall", "question__hide": false, - "total_acs": 31813, - "total_submitted": 45913, + "total_acs": 31852, + "total_submitted": 45971, "total_column_articles": 601, "frontend_question_id": "1706", "is_new_question": false @@ -28194,8 +28425,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": 2946, - "total_submitted": 6455, + "total_acs": 2959, + "total_submitted": 6489, "total_column_articles": 61, "frontend_question_id": "1210", "is_new_question": false @@ -28215,9 +28446,9 @@ "question__title": "Get Equal Substrings Within Budget", "question__title_slug": "get-equal-substrings-within-budget", "question__hide": false, - "total_acs": 55370, - "total_submitted": 111105, - "total_column_articles": 670, + "total_acs": 55741, + "total_submitted": 111739, + "total_column_articles": 671, "frontend_question_id": "1208", "is_new_question": false }, @@ -28236,9 +28467,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": 14527, - "total_submitted": 28190, - "total_column_articles": 180, + "total_acs": 14609, + "total_submitted": 28397, + "total_column_articles": 181, "frontend_question_id": "1209", "is_new_question": false }, @@ -28257,9 +28488,9 @@ "question__title": "Unique Number of Occurrences", "question__title_slug": "unique-number-of-occurrences", "question__hide": false, - "total_acs": 63940, - "total_submitted": 87694, - "total_column_articles": 890, + "total_acs": 64115, + "total_submitted": 87948, + "total_column_articles": 891, "frontend_question_id": "1207", "is_new_question": false }, @@ -28278,9 +28509,9 @@ "question__title": "Tournament Winners", "question__title_slug": "tournament-winners", "question__hide": false, - "total_acs": 4839, - "total_submitted": 9418, - "total_column_articles": 80, + "total_acs": 4895, + "total_submitted": 9541, + "total_column_articles": 83, "frontend_question_id": "1194", "is_new_question": false }, @@ -28299,9 +28530,9 @@ "question__title": "Monthly Transactions I", "question__title_slug": "monthly-transactions-i", "question__hide": false, - "total_acs": 7853, - "total_submitted": 12960, - "total_column_articles": 86, + "total_acs": 8053, + "total_submitted": 13300, + "total_column_articles": 87, "frontend_question_id": "1193", "is_new_question": false }, @@ -28320,9 +28551,9 @@ "question__title": "Fizz Buzz Multithreaded", "question__title_slug": "fizz-buzz-multithreaded", "question__hide": false, - "total_acs": 16709, - "total_submitted": 26047, - "total_column_articles": 310, + "total_acs": 16810, + "total_submitted": 26184, + "total_column_articles": 313, "frontend_question_id": "1195", "is_new_question": false }, @@ -28341,9 +28572,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": 1402, - "total_submitted": 2499, - "total_column_articles": 18, + "total_acs": 1413, + "total_submitted": 2520, + "total_column_articles": 19, "frontend_question_id": "1916", "is_new_question": false }, @@ -28362,9 +28593,9 @@ "question__title": "Count Artifacts That Can Be Extracted", "question__title_slug": "count-artifacts-that-can-be-extracted", "question__hide": false, - "total_acs": 7350, - "total_submitted": 15316, - "total_column_articles": 112, + "total_acs": 7397, + "total_submitted": 15398, + "total_column_articles": 113, "frontend_question_id": "2201", "is_new_question": false }, @@ -28383,9 +28614,9 @@ "question__title": "Largest Magic Square", "question__title_slug": "largest-magic-square", "question__hide": false, - "total_acs": 2415, - "total_submitted": 4458, - "total_column_articles": 44, + "total_acs": 2437, + "total_submitted": 4487, + "total_column_articles": 45, "frontend_question_id": "1895", "is_new_question": false }, @@ -28404,8 +28635,8 @@ "question__title": "Watering Plants", "question__title_slug": "watering-plants", "question__hide": false, - "total_acs": 6461, - "total_submitted": 8305, + "total_acs": 6508, + "total_submitted": 8358, "total_column_articles": 122, "frontend_question_id": "2079", "is_new_question": false @@ -28425,8 +28656,8 @@ "question__title": "Sort Items by Groups Respecting Dependencies", "question__title_slug": "sort-items-by-groups-respecting-dependencies", "question__hide": false, - "total_acs": 12683, - "total_submitted": 20534, + "total_acs": 12790, + "total_submitted": 20729, "total_column_articles": 155, "frontend_question_id": "1203", "is_new_question": false @@ -28446,9 +28677,9 @@ "question__title": "Smallest String With Swaps", "question__title_slug": "smallest-string-with-swaps", "question__hide": false, - "total_acs": 28670, - "total_submitted": 56749, - "total_column_articles": 317, + "total_acs": 28860, + "total_submitted": 57070, + "total_column_articles": 318, "frontend_question_id": "1202", "is_new_question": false }, @@ -28467,9 +28698,9 @@ "question__title": "Ugly Number III", "question__title_slug": "ugly-number-iii", "question__hide": false, - "total_acs": 7338, - "total_submitted": 28744, - "total_column_articles": 102, + "total_acs": 7498, + "total_submitted": 29130, + "total_column_articles": 107, "frontend_question_id": "1201", "is_new_question": false }, @@ -28488,9 +28719,9 @@ "question__title": "Minimum Absolute Difference", "question__title_slug": "minimum-absolute-difference", "question__hide": false, - "total_acs": 21153, - "total_submitted": 31023, - "total_column_articles": 296, + "total_acs": 21294, + "total_submitted": 31241, + "total_column_articles": 298, "frontend_question_id": "1200", "is_new_question": false }, @@ -28509,8 +28740,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": 3098, - "total_submitted": 5140, + "total_acs": 3181, + "total_submitted": 5316, "total_column_articles": 82, "frontend_question_id": "1944", "is_new_question": false @@ -28530,9 +28761,9 @@ "question__title": "Longest Happy String", "question__title_slug": "longest-happy-string", "question__hide": false, - "total_acs": 27016, - "total_submitted": 42198, - "total_column_articles": 476, + "total_acs": 27123, + "total_submitted": 42369, + "total_column_articles": 477, "frontend_question_id": "1405", "is_new_question": false }, @@ -28551,9 +28782,9 @@ "question__title": "Minimum Moves to Reach Target Score", "question__title_slug": "minimum-moves-to-reach-target-score", "question__hide": false, - "total_acs": 7047, - "total_submitted": 13951, - "total_column_articles": 133, + "total_acs": 7115, + "total_submitted": 14078, + "total_column_articles": 135, "frontend_question_id": "2139", "is_new_question": false }, @@ -28572,9 +28803,9 @@ "question__title": "Delete Characters to Make Fancy String", "question__title_slug": "delete-characters-to-make-fancy-string", "question__hide": false, - "total_acs": 6789, - "total_submitted": 11187, - "total_column_articles": 78, + "total_acs": 6863, + "total_submitted": 11311, + "total_column_articles": 79, "frontend_question_id": "1957", "is_new_question": false }, @@ -28593,9 +28824,9 @@ "question__title": "Reformat Department Table", "question__title_slug": "reformat-department-table", "question__hide": false, - "total_acs": 37567, - "total_submitted": 58649, - "total_column_articles": 221, + "total_acs": 37817, + "total_submitted": 58993, + "total_column_articles": 223, "frontend_question_id": "1179", "is_new_question": false }, @@ -28614,9 +28845,9 @@ "question__title": "Critical Connections in a Network", "question__title_slug": "critical-connections-in-a-network", "question__hide": false, - "total_acs": 5644, - "total_submitted": 10935, - "total_column_articles": 70, + "total_acs": 5725, + "total_submitted": 11064, + "total_column_articles": 71, "frontend_question_id": "1192", "is_new_question": false }, @@ -28635,8 +28866,8 @@ "question__title": "K-Concatenation Maximum Sum", "question__title_slug": "k-concatenation-maximum-sum", "question__hide": false, - "total_acs": 6734, - "total_submitted": 25199, + "total_acs": 6762, + "total_submitted": 25335, "total_column_articles": 104, "frontend_question_id": "1191", "is_new_question": false @@ -28656,9 +28887,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": 50082, - "total_submitted": 77206, - "total_column_articles": 651, + "total_acs": 50295, + "total_submitted": 77552, + "total_column_articles": 655, "frontend_question_id": "1190", "is_new_question": false }, @@ -28677,9 +28908,9 @@ "question__title": "Maximum Number of Balloons", "question__title_slug": "maximum-number-of-balloons", "question__hide": false, - "total_acs": 52628, - "total_submitted": 76596, - "total_column_articles": 720, + "total_acs": 52777, + "total_submitted": 76820, + "total_column_articles": 725, "frontend_question_id": "1189", "is_new_question": false }, @@ -28698,9 +28929,9 @@ "question__title": "Kth Ancestor of a Tree Node", "question__title_slug": "kth-ancestor-of-a-tree-node", "question__hide": false, - "total_acs": 4038, - "total_submitted": 12794, - "total_column_articles": 86, + "total_acs": 4078, + "total_submitted": 12902, + "total_column_articles": 87, "frontend_question_id": "1483", "is_new_question": false }, @@ -28719,8 +28950,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": 4898, - "total_submitted": 10057, + "total_acs": 4924, + "total_submitted": 10127, "total_column_articles": 75, "frontend_question_id": "1954", "is_new_question": false @@ -28740,9 +28971,9 @@ "question__title": "Range Frequency Queries", "question__title_slug": "range-frequency-queries", "question__hide": false, - "total_acs": 6296, - "total_submitted": 21758, - "total_column_articles": 149, + "total_acs": 6426, + "total_submitted": 22017, + "total_column_articles": 153, "frontend_question_id": "2080", "is_new_question": false }, @@ -28761,9 +28992,9 @@ "question__title": "Three Consecutive Odds", "question__title_slug": "three-consecutive-odds", "question__hide": false, - "total_acs": 23966, - "total_submitted": 36523, - "total_column_articles": 326, + "total_acs": 24095, + "total_submitted": 36719, + "total_column_articles": 327, "frontend_question_id": "1550", "is_new_question": false }, @@ -28782,9 +29013,9 @@ "question__title": "Immediate Food Delivery II", "question__title_slug": "immediate-food-delivery-ii", "question__hide": false, - "total_acs": 6731, - "total_submitted": 10748, - "total_column_articles": 73, + "total_acs": 6805, + "total_submitted": 10838, + "total_column_articles": 75, "frontend_question_id": "1174", "is_new_question": false }, @@ -28803,9 +29034,9 @@ "question__title": "Immediate Food Delivery I", "question__title_slug": "immediate-food-delivery-i", "question__hide": false, - "total_acs": 11251, - "total_submitted": 14956, - "total_column_articles": 91, + "total_acs": 11440, + "total_submitted": 15213, + "total_column_articles": 94, "frontend_question_id": "1173", "is_new_question": false }, @@ -28824,8 +29055,8 @@ "question__title": "Make Array Strictly Increasing", "question__title_slug": "make-array-strictly-increasing", "question__hide": false, - "total_acs": 2169, - "total_submitted": 4841, + "total_acs": 2195, + "total_submitted": 4877, "total_column_articles": 39, "frontend_question_id": "1187", "is_new_question": false @@ -28845,8 +29076,8 @@ "question__title": "Day of the Week", "question__title_slug": "day-of-the-week", "question__hide": false, - "total_acs": 35697, - "total_submitted": 56985, + "total_acs": 35794, + "total_submitted": 57162, "total_column_articles": 483, "frontend_question_id": "1185", "is_new_question": false @@ -28866,9 +29097,9 @@ "question__title": "Maximum Subarray Sum with One Deletion", "question__title_slug": "maximum-subarray-sum-with-one-deletion", "question__hide": false, - "total_acs": 8971, - "total_submitted": 22106, - "total_column_articles": 138, + "total_acs": 9050, + "total_submitted": 22281, + "total_column_articles": 142, "frontend_question_id": "1186", "is_new_question": false }, @@ -28887,8 +29118,8 @@ "question__title": "Distance Between Bus Stops", "question__title_slug": "distance-between-bus-stops", "question__hide": false, - "total_acs": 15624, - "total_submitted": 26753, + "total_acs": 15740, + "total_submitted": 26946, "total_column_articles": 304, "frontend_question_id": "1184", "is_new_question": false @@ -28908,8 +29139,8 @@ "question__title": "Constrained Subsequence Sum", "question__title_slug": "constrained-subsequence-sum", "question__hide": false, - "total_acs": 4079, - "total_submitted": 9002, + "total_acs": 4123, + "total_submitted": 9068, "total_column_articles": 85, "frontend_question_id": "1425", "is_new_question": false @@ -28929,8 +29160,8 @@ "question__title": "Balance a Binary Search Tree", "question__title_slug": "balance-a-binary-search-tree", "question__hide": false, - "total_acs": 14306, - "total_submitted": 20258, + "total_acs": 14487, + "total_submitted": 20486, "total_column_articles": 224, "frontend_question_id": "1382", "is_new_question": false @@ -28950,8 +29181,8 @@ "question__title": "Four Divisors", "question__title_slug": "four-divisors", "question__hide": false, - "total_acs": 7471, - "total_submitted": 20195, + "total_acs": 7507, + "total_submitted": 20259, "total_column_articles": 127, "frontend_question_id": "1390", "is_new_question": false @@ -28971,9 +29202,9 @@ "question__title": "Reformat Date", "question__title_slug": "reformat-date", "question__hide": false, - "total_acs": 11759, - "total_submitted": 19950, - "total_column_articles": 152, + "total_acs": 11833, + "total_submitted": 20073, + "total_column_articles": 153, "frontend_question_id": "1507", "is_new_question": false }, @@ -28992,8 +29223,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": 19212, - "total_submitted": 41425, + "total_acs": 19227, + "total_submitted": 41452, "total_column_articles": 188, "frontend_question_id": "1178", "is_new_question": false @@ -29013,8 +29244,8 @@ "question__title": "Can Make Palindrome from Substring", "question__title_slug": "can-make-palindrome-from-substring", "question__hide": false, - "total_acs": 6889, - "total_submitted": 24885, + "total_acs": 6909, + "total_submitted": 24943, "total_column_articles": 107, "frontend_question_id": "1177", "is_new_question": false @@ -29034,9 +29265,9 @@ "question__title": "Diet Plan Performance", "question__title_slug": "diet-plan-performance", "question__hide": false, - "total_acs": 5043, - "total_submitted": 10784, - "total_column_articles": 76, + "total_acs": 5083, + "total_submitted": 10843, + "total_column_articles": 77, "frontend_question_id": "1176", "is_new_question": false }, @@ -29055,9 +29286,9 @@ "question__title": "Prime Arrangements", "question__title_slug": "prime-arrangements", "question__hide": false, - "total_acs": 9029, - "total_submitted": 18359, - "total_column_articles": 147, + "total_acs": 9127, + "total_submitted": 18580, + "total_column_articles": 149, "frontend_question_id": "1175", "is_new_question": false }, @@ -29076,9 +29307,9 @@ "question__title": "Product Price at a Given Date", "question__title_slug": "product-price-at-a-given-date", "question__hide": false, - "total_acs": 7971, - "total_submitted": 13269, - "total_column_articles": 102, + "total_acs": 8123, + "total_submitted": 13551, + "total_column_articles": 103, "frontend_question_id": "1164", "is_new_question": false }, @@ -29097,9 +29328,9 @@ "question__title": "Largest Multiple of Three", "question__title_slug": "largest-multiple-of-three", "question__hide": false, - "total_acs": 6098, - "total_submitted": 16620, - "total_column_articles": 114, + "total_acs": 6137, + "total_submitted": 16732, + "total_column_articles": 115, "frontend_question_id": "1363", "is_new_question": false }, @@ -29118,8 +29349,8 @@ "question__title": "Closest Divisors", "question__title_slug": "closest-divisors", "question__hide": false, - "total_acs": 6246, - "total_submitted": 11728, + "total_acs": 6272, + "total_submitted": 11769, "total_column_articles": 79, "frontend_question_id": "1362", "is_new_question": false @@ -29139,9 +29370,9 @@ "question__title": "Validate Binary Tree Nodes", "question__title_slug": "validate-binary-tree-nodes", "question__hide": false, - "total_acs": 9026, - "total_submitted": 22716, - "total_column_articles": 235, + "total_acs": 9068, + "total_submitted": 22837, + "total_column_articles": 236, "frontend_question_id": "1361", "is_new_question": false }, @@ -29160,9 +29391,9 @@ "question__title": "Number of Days Between Two Dates", "question__title_slug": "number-of-days-between-two-dates", "question__hide": false, - "total_acs": 10731, - "total_submitted": 21333, - "total_column_articles": 169, + "total_acs": 10862, + "total_submitted": 21642, + "total_column_articles": 171, "frontend_question_id": "1360", "is_new_question": false }, @@ -29181,9 +29412,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": 14764, - "total_submitted": 23891, - "total_column_articles": 239, + "total_acs": 14835, + "total_submitted": 24001, + "total_column_articles": 242, "frontend_question_id": "1170", "is_new_question": false }, @@ -29202,8 +29433,8 @@ "question__title": "Invalid Transactions", "question__title_slug": "invalid-transactions", "question__hide": false, - "total_acs": 7408, - "total_submitted": 22875, + "total_acs": 7442, + "total_submitted": 22959, "total_column_articles": 85, "frontend_question_id": "1169", "is_new_question": false @@ -29223,8 +29454,8 @@ "question__title": "Web Crawler", "question__title_slug": "web-crawler", "question__hide": false, - "total_acs": 1387, - "total_submitted": 2452, + "total_acs": 1392, + "total_submitted": 2462, "total_column_articles": 38, "frontend_question_id": "1236", "is_new_question": false @@ -29244,8 +29475,8 @@ "question__title": "Dinner Plate Stacks", "question__title_slug": "dinner-plate-stacks", "question__hide": false, - "total_acs": 2903, - "total_submitted": 10879, + "total_acs": 2914, + "total_submitted": 10914, "total_column_articles": 68, "frontend_question_id": "1172", "is_new_question": false @@ -29265,9 +29496,9 @@ "question__title": "Market Analysis II", "question__title_slug": "market-analysis-ii", "question__hide": false, - "total_acs": 5286, - "total_submitted": 10587, - "total_column_articles": 98, + "total_acs": 5344, + "total_submitted": 10708, + "total_column_articles": 100, "frontend_question_id": "1159", "is_new_question": false }, @@ -29286,9 +29517,9 @@ "question__title": "Market Analysis I", "question__title_slug": "market-analysis-i", "question__hide": false, - "total_acs": 9609, - "total_submitted": 17307, - "total_column_articles": 86, + "total_acs": 10340, + "total_submitted": 18593, + "total_column_articles": 94, "frontend_question_id": "1158", "is_new_question": false }, @@ -29307,9 +29538,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": 15570, - "total_submitted": 32509, - "total_column_articles": 177, + "total_acs": 15728, + "total_submitted": 32824, + "total_column_articles": 180, "frontend_question_id": "1171", "is_new_question": false }, @@ -29328,9 +29559,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": 9098, - "total_submitted": 12580, - "total_column_articles": 147, + "total_acs": 9320, + "total_submitted": 12910, + "total_column_articles": 153, "frontend_question_id": "1935", "is_new_question": false }, @@ -29349,9 +29580,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": 13534, - "total_submitted": 27706, - "total_column_articles": 162, + "total_acs": 13711, + "total_submitted": 28037, + "total_column_articles": 164, "frontend_question_id": "1155", "is_new_question": false }, @@ -29370,8 +29601,8 @@ "question__title": "Online Majority Element In Subarray", "question__title_slug": "online-majority-element-in-subarray", "question__hide": false, - "total_acs": 3499, - "total_submitted": 10527, + "total_acs": 3524, + "total_submitted": 10576, "total_column_articles": 52, "frontend_question_id": "1157", "is_new_question": false @@ -29391,9 +29622,9 @@ "question__title": "Swap For Longest Repeated Character Substring", "question__title_slug": "swap-for-longest-repeated-character-substring", "question__hide": false, - "total_acs": 6398, - "total_submitted": 14907, - "total_column_articles": 130, + "total_acs": 6458, + "total_submitted": 15055, + "total_column_articles": 132, "frontend_question_id": "1156", "is_new_question": false }, @@ -29412,9 +29643,9 @@ "question__title": "Day of the Year", "question__title_slug": "day-of-the-year", "question__hide": false, - "total_acs": 47419, - "total_submitted": 73780, - "total_column_articles": 546, + "total_acs": 47606, + "total_submitted": 74137, + "total_column_articles": 548, "frontend_question_id": "1154", "is_new_question": false }, @@ -29433,8 +29664,8 @@ "question__title": "Article Views II", "question__title_slug": "article-views-ii", "question__hide": false, - "total_acs": 7570, - "total_submitted": 17074, + "total_acs": 7648, + "total_submitted": 17239, "total_column_articles": 55, "frontend_question_id": "1149", "is_new_question": false @@ -29454,9 +29685,9 @@ "question__title": "Article Views I", "question__title_slug": "article-views-i", "question__hide": false, - "total_acs": 13594, - "total_submitted": 19040, - "total_column_articles": 61, + "total_acs": 14474, + "total_submitted": 20207, + "total_column_articles": 66, "frontend_question_id": "1148", "is_new_question": false }, @@ -29475,8 +29706,8 @@ "question__title": "Rank Transform of a Matrix", "question__title_slug": "rank-transform-of-a-matrix", "question__hide": false, - "total_acs": 1740, - "total_submitted": 5260, + "total_acs": 1746, + "total_submitted": 5272, "total_column_articles": 35, "frontend_question_id": "1632", "is_new_question": false @@ -29496,9 +29727,9 @@ "question__title": "Rank Transform of an Array", "question__title_slug": "rank-transform-of-an-array", "question__hide": false, - "total_acs": 14560, - "total_submitted": 27412, - "total_column_articles": 252, + "total_acs": 14722, + "total_submitted": 27748, + "total_column_articles": 255, "frontend_question_id": "1331", "is_new_question": false }, @@ -29517,8 +29748,8 @@ "question__title": "Reverse Subarray To Maximize Array Value", "question__title_slug": "reverse-subarray-to-maximize-array-value", "question__hide": false, - "total_acs": 1425, - "total_submitted": 3584, + "total_acs": 1442, + "total_submitted": 3616, "total_column_articles": 35, "frontend_question_id": "1330", "is_new_question": false @@ -29538,9 +29769,9 @@ "question__title": "Deepest Leaves Sum", "question__title_slug": "deepest-leaves-sum", "question__hide": false, - "total_acs": 23600, - "total_submitted": 28646, - "total_column_articles": 342, + "total_acs": 23792, + "total_submitted": 28866, + "total_column_articles": 346, "frontend_question_id": "1302", "is_new_question": false }, @@ -29559,9 +29790,9 @@ "question__title": "Sort the Matrix Diagonally", "question__title_slug": "sort-the-matrix-diagonally", "question__hide": false, - "total_acs": 8035, - "total_submitted": 10441, - "total_column_articles": 187, + "total_acs": 8074, + "total_submitted": 10485, + "total_column_articles": 188, "frontend_question_id": "1329", "is_new_question": false }, @@ -29580,9 +29811,9 @@ "question__title": "Break a Palindrome", "question__title_slug": "break-a-palindrome", "question__hide": false, - "total_acs": 6729, - "total_submitted": 14369, - "total_column_articles": 134, + "total_acs": 6777, + "total_submitted": 14466, + "total_column_articles": 135, "frontend_question_id": "1328", "is_new_question": false }, @@ -29601,9 +29832,9 @@ "question__title": "Longest Chunked Palindrome Decomposition", "question__title_slug": "longest-chunked-palindrome-decomposition", "question__hide": false, - "total_acs": 5132, - "total_submitted": 9050, - "total_column_articles": 99, + "total_acs": 5187, + "total_submitted": 9139, + "total_column_articles": 100, "frontend_question_id": "1147", "is_new_question": false }, @@ -29622,9 +29853,9 @@ "question__title": "Longest Common Subsequence", "question__title_slug": "longest-common-subsequence", "question__hide": false, - "total_acs": 226414, - "total_submitted": 352559, - "total_column_articles": 1397, + "total_acs": 229457, + "total_submitted": 357233, + "total_column_articles": 1419, "frontend_question_id": "1143", "is_new_question": false }, @@ -29643,9 +29874,9 @@ "question__title": "Snapshot Array", "question__title_slug": "snapshot-array", "question__hide": false, - "total_acs": 5528, - "total_submitted": 18313, - "total_column_articles": 76, + "total_acs": 5664, + "total_submitted": 18651, + "total_column_articles": 78, "frontend_question_id": "1146", "is_new_question": false }, @@ -29664,9 +29895,9 @@ "question__title": "Binary Tree Coloring Game", "question__title_slug": "binary-tree-coloring-game", "question__hide": false, - "total_acs": 7458, - "total_submitted": 15788, - "total_column_articles": 119, + "total_acs": 7520, + "total_submitted": 15896, + "total_column_articles": 120, "frontend_question_id": "1145", "is_new_question": false }, @@ -29685,8 +29916,8 @@ "question__title": "Decrease Elements To Make Array Zigzag", "question__title_slug": "decrease-elements-to-make-array-zigzag", "question__hide": false, - "total_acs": 11126, - "total_submitted": 25013, + "total_acs": 11155, + "total_submitted": 25073, "total_column_articles": 155, "frontend_question_id": "1144", "is_new_question": false @@ -29706,8 +29937,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": 9264, - "total_submitted": 24849, + "total_acs": 9339, + "total_submitted": 25051, "total_column_articles": 58, "frontend_question_id": "1142", "is_new_question": false @@ -29727,9 +29958,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": 16413, - "total_submitted": 31890, - "total_column_articles": 100, + "total_acs": 17284, + "total_submitted": 34280, + "total_column_articles": 108, "frontend_question_id": "1141", "is_new_question": false }, @@ -29748,8 +29979,8 @@ "question__title": "Distinct Echo Substrings", "question__title_slug": "distinct-echo-substrings", "question__hide": false, - "total_acs": 3388, - "total_submitted": 7471, + "total_acs": 3406, + "total_submitted": 7517, "total_column_articles": 71, "frontend_question_id": "1316", "is_new_question": false @@ -29769,9 +30000,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": 14594, - "total_submitted": 17949, - "total_column_articles": 306, + "total_acs": 14673, + "total_submitted": 18051, + "total_column_articles": 309, "frontend_question_id": "1315", "is_new_question": false }, @@ -29790,9 +30021,9 @@ "question__title": "Matrix Block Sum", "question__title_slug": "matrix-block-sum", "question__hide": false, - "total_acs": 17762, - "total_submitted": 23532, - "total_column_articles": 280, + "total_acs": 17936, + "total_submitted": 23735, + "total_column_articles": 285, "frontend_question_id": "1314", "is_new_question": false }, @@ -29811,9 +30042,9 @@ "question__title": "Decompress Run-Length Encoded List", "question__title_slug": "decompress-run-length-encoded-list", "question__hide": false, - "total_acs": 37817, - "total_submitted": 45437, - "total_column_articles": 580, + "total_acs": 37956, + "total_submitted": 45610, + "total_column_articles": 581, "frontend_question_id": "1313", "is_new_question": false }, @@ -29832,9 +30063,9 @@ "question__title": "Stone Game II", "question__title_slug": "stone-game-ii", "question__hide": false, - "total_acs": 8076, - "total_submitted": 12285, - "total_column_articles": 108, + "total_acs": 8159, + "total_submitted": 12403, + "total_column_articles": 109, "frontend_question_id": "1140", "is_new_question": false }, @@ -29853,8 +30084,8 @@ "question__title": "Largest 1-Bordered Square", "question__title_slug": "largest-1-bordered-square", "question__hide": false, - "total_acs": 10791, - "total_submitted": 22214, + "total_acs": 10850, + "total_submitted": 22330, "total_column_articles": 170, "frontend_question_id": "1139", "is_new_question": false @@ -29874,9 +30105,9 @@ "question__title": "Alphabet Board Path", "question__title_slug": "alphabet-board-path", "question__hide": false, - "total_acs": 6882, - "total_submitted": 15722, - "total_column_articles": 157, + "total_acs": 6909, + "total_submitted": 15781, + "total_column_articles": 158, "frontend_question_id": "1138", "is_new_question": false }, @@ -29895,9 +30126,9 @@ "question__title": "Reported Posts II", "question__title_slug": "reported-posts-ii", "question__hide": false, - "total_acs": 6509, - "total_submitted": 16763, - "total_column_articles": 60, + "total_acs": 6569, + "total_submitted": 16928, + "total_column_articles": 62, "frontend_question_id": "1132", "is_new_question": false }, @@ -29916,9 +30147,9 @@ "question__title": "N-th Tribonacci Number", "question__title_slug": "n-th-tribonacci-number", "question__hide": false, - "total_acs": 122359, - "total_submitted": 201301, - "total_column_articles": 1174, + "total_acs": 123203, + "total_submitted": 202680, + "total_column_articles": 1177, "frontend_question_id": "1137", "is_new_question": false }, @@ -29937,8 +30168,8 @@ "question__title": "Number of Paths with Max Score", "question__title_slug": "number-of-paths-with-max-score", "question__hide": false, - "total_acs": 4579, - "total_submitted": 12295, + "total_acs": 4652, + "total_submitted": 12471, "total_column_articles": 100, "frontend_question_id": "1301", "is_new_question": false @@ -29958,8 +30189,8 @@ "question__title": "Number of Ships in a Rectangle", "question__title_slug": "number-of-ships-in-a-rectangle", "question__hide": false, - "total_acs": 1145, - "total_submitted": 1857, + "total_acs": 1151, + "total_submitted": 1866, "total_column_articles": 28, "frontend_question_id": "1274", "is_new_question": false @@ -29979,9 +30210,9 @@ "question__title": "Sum of Mutated Array Closest to Target", "question__title_slug": "sum-of-mutated-array-closest-to-target", "question__hide": false, - "total_acs": 26162, - "total_submitted": 56436, - "total_column_articles": 394, + "total_acs": 26358, + "total_submitted": 56830, + "total_column_articles": 398, "frontend_question_id": "1300", "is_new_question": false }, @@ -30000,8 +30231,8 @@ "question__title": "Replace Elements with Greatest Element on Right Side", "question__title_slug": "replace-elements-with-greatest-element-on-right-side", "question__hide": false, - "total_acs": 33893, - "total_submitted": 43050, + "total_acs": 34050, + "total_submitted": 43251, "total_column_articles": 479, "frontend_question_id": "1299", "is_new_question": false @@ -30021,8 +30252,8 @@ "question__title": "Maximum of Absolute Value Expression", "question__title_slug": "maximum-of-absolute-value-expression", "question__hide": false, - "total_acs": 3551, - "total_submitted": 7695, + "total_acs": 3573, + "total_submitted": 7733, "total_column_articles": 54, "frontend_question_id": "1131", "is_new_question": false @@ -30042,9 +30273,9 @@ "question__title": "Shortest Path with Alternating Colors", "question__title_slug": "shortest-path-with-alternating-colors", "question__hide": false, - "total_acs": 7864, - "total_submitted": 20067, - "total_column_articles": 163, + "total_acs": 7952, + "total_submitted": 20263, + "total_column_articles": 165, "frontend_question_id": "1129", "is_new_question": false }, @@ -30063,9 +30294,9 @@ "question__title": "Minimum Cost Tree From Leaf Values", "question__title_slug": "minimum-cost-tree-from-leaf-values", "question__hide": false, - "total_acs": 7096, - "total_submitted": 11123, - "total_column_articles": 123, + "total_acs": 7125, + "total_submitted": 11173, + "total_column_articles": 124, "frontend_question_id": "1130", "is_new_question": false }, @@ -30084,8 +30315,8 @@ "question__title": "Number of Equivalent Domino Pairs", "question__title_slug": "number-of-equivalent-domino-pairs", "question__hide": false, - "total_acs": 39244, - "total_submitted": 72274, + "total_acs": 39361, + "total_submitted": 72493, "total_column_articles": 497, "frontend_question_id": "1128", "is_new_question": false @@ -30105,9 +30336,9 @@ "question__title": "User Purchase Platform", "question__title_slug": "user-purchase-platform", "question__hide": false, - "total_acs": 5643, - "total_submitted": 13189, - "total_column_articles": 90, + "total_acs": 5693, + "total_submitted": 13324, + "total_column_articles": 91, "frontend_question_id": "1127", "is_new_question": false }, @@ -30126,9 +30357,9 @@ "question__title": "Active Businesses", "question__title_slug": "active-businesses", "question__hide": false, - "total_acs": 8485, - "total_submitted": 12382, - "total_column_articles": 104, + "total_acs": 8604, + "total_submitted": 12562, + "total_column_articles": 106, "frontend_question_id": "1126", "is_new_question": false }, @@ -30147,8 +30378,8 @@ "question__title": "Minimum Falling Path Sum II", "question__title_slug": "minimum-falling-path-sum-ii", "question__hide": false, - "total_acs": 9532, - "total_submitted": 15717, + "total_acs": 9687, + "total_submitted": 15995, "total_column_articles": 129, "frontend_question_id": "1289", "is_new_question": false @@ -30168,8 +30399,8 @@ "question__title": "Graph Connectivity With Threshold", "question__title_slug": "graph-connectivity-with-threshold", "question__hide": false, - "total_acs": 2962, - "total_submitted": 7482, + "total_acs": 2991, + "total_submitted": 7546, "total_column_articles": 49, "frontend_question_id": "1627", "is_new_question": false @@ -30189,9 +30420,9 @@ "question__title": "Remove Covered Intervals", "question__title_slug": "remove-covered-intervals", "question__hide": false, - "total_acs": 18332, - "total_submitted": 32577, - "total_column_articles": 216, + "total_acs": 18630, + "total_submitted": 33105, + "total_column_articles": 220, "frontend_question_id": "1288", "is_new_question": false }, @@ -30210,9 +30441,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": 18237, - "total_submitted": 30383, - "total_column_articles": 254, + "total_acs": 18401, + "total_submitted": 30641, + "total_column_articles": 257, "frontend_question_id": "1287", "is_new_question": false }, @@ -30231,8 +30462,8 @@ "question__title": "Smallest Sufficient Team", "question__title_slug": "smallest-sufficient-team", "question__hide": false, - "total_acs": 3623, - "total_submitted": 7299, + "total_acs": 3652, + "total_submitted": 7348, "total_column_articles": 57, "frontend_question_id": "1125", "is_new_question": false @@ -30252,9 +30483,9 @@ "question__title": "Longest Well-Performing Interval", "question__title_slug": "longest-well-performing-interval", "question__hide": false, - "total_acs": 15456, - "total_submitted": 46877, - "total_column_articles": 163, + "total_acs": 15554, + "total_submitted": 47113, + "total_column_articles": 166, "frontend_question_id": "1124", "is_new_question": false }, @@ -30273,9 +30504,9 @@ "question__title": "Lowest Common Ancestor of Deepest Leaves", "question__title_slug": "lowest-common-ancestor-of-deepest-leaves", "question__hide": false, - "total_acs": 9838, - "total_submitted": 13904, - "total_column_articles": 127, + "total_acs": 9903, + "total_submitted": 13990, + "total_column_articles": 130, "frontend_question_id": "1123", "is_new_question": false }, @@ -30294,9 +30525,9 @@ "question__title": "Relative Sort Array", "question__title_slug": "relative-sort-array", "question__hide": false, - "total_acs": 72560, - "total_submitted": 102523, - "total_column_articles": 957, + "total_acs": 72938, + "total_submitted": 103010, + "total_column_articles": 962, "frontend_question_id": "1122", "is_new_question": false }, @@ -30315,9 +30546,9 @@ "question__title": "Print Zero Even Odd", "question__title_slug": "print-zero-even-odd", "question__hide": false, - "total_acs": 26912, - "total_submitted": 50920, - "total_column_articles": 406, + "total_acs": 27088, + "total_submitted": 51210, + "total_column_articles": 408, "frontend_question_id": "1116", "is_new_question": false }, @@ -30336,9 +30567,9 @@ "question__title": "Reported Posts", "question__title_slug": "reported-posts", "question__hide": false, - "total_acs": 9460, - "total_submitted": 17705, - "total_column_articles": 59, + "total_acs": 9538, + "total_submitted": 17856, + "total_column_articles": 61, "frontend_question_id": "1113", "is_new_question": false }, @@ -30357,9 +30588,9 @@ "question__title": "Highest Grade For Each Student", "question__title_slug": "highest-grade-for-each-student", "question__hide": false, - "total_acs": 10380, - "total_submitted": 15933, - "total_column_articles": 108, + "total_acs": 10556, + "total_submitted": 16186, + "total_column_articles": 111, "frontend_question_id": "1112", "is_new_question": false }, @@ -30378,8 +30609,8 @@ "question__title": "Handshakes That Don't Cross", "question__title_slug": "handshakes-that-dont-cross", "question__hide": false, - "total_acs": 2515, - "total_submitted": 4902, + "total_acs": 2531, + "total_submitted": 4936, "total_column_articles": 53, "frontend_question_id": "1259", "is_new_question": false @@ -30399,9 +30630,9 @@ "question__title": "Sequential Digits", "question__title_slug": "sequential-digits", "question__hide": false, - "total_acs": 8464, - "total_submitted": 16043, - "total_column_articles": 191, + "total_acs": 8512, + "total_submitted": 16128, + "total_column_articles": 192, "frontend_question_id": "1291", "is_new_question": false }, @@ -30420,9 +30651,9 @@ "question__title": "Iterator for Combination", "question__title_slug": "iterator-for-combination", "question__hide": false, - "total_acs": 5588, - "total_submitted": 8570, - "total_column_articles": 110, + "total_acs": 5618, + "total_submitted": 8611, + "total_column_articles": 112, "frontend_question_id": "1286", "is_new_question": false }, @@ -30441,9 +30672,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": 9356, - "total_submitted": 13995, - "total_column_articles": 152, + "total_acs": 9468, + "total_submitted": 14160, + "total_column_articles": 155, "frontend_question_id": "1619", "is_new_question": false }, @@ -30462,8 +30693,8 @@ "question__title": "Design Bounded Blocking Queue", "question__title_slug": "design-bounded-blocking-queue", "question__hide": false, - "total_acs": 4141, - "total_submitted": 5890, + "total_acs": 4157, + "total_submitted": 5917, "total_column_articles": 76, "frontend_question_id": "1188", "is_new_question": false @@ -30483,9 +30714,9 @@ "question__title": "Maximum Nesting Depth of Two Valid Parentheses Strings", "question__title_slug": "maximum-nesting-depth-of-two-valid-parentheses-strings", "question__hide": false, - "total_acs": 25259, - "total_submitted": 32812, - "total_column_articles": 416, + "total_acs": 25294, + "total_submitted": 32862, + "total_column_articles": 417, "frontend_question_id": "1111", "is_new_question": false }, @@ -30504,9 +30735,9 @@ "question__title": "Delete Nodes And Return Forest", "question__title_slug": "delete-nodes-and-return-forest", "question__hide": false, - "total_acs": 14300, - "total_submitted": 22468, - "total_column_articles": 250, + "total_acs": 14436, + "total_submitted": 22665, + "total_column_articles": 253, "frontend_question_id": "1110", "is_new_question": false }, @@ -30525,9 +30756,9 @@ "question__title": "Corporate Flight Bookings", "question__title_slug": "corporate-flight-bookings", "question__hide": false, - "total_acs": 77291, - "total_submitted": 127719, - "total_column_articles": 1054, + "total_acs": 78253, + "total_submitted": 129038, + "total_column_articles": 1062, "frontend_question_id": "1109", "is_new_question": false }, @@ -30546,9 +30777,9 @@ "question__title": "Defanging an IP Address", "question__title_slug": "defanging-an-ip-address", "question__hide": false, - "total_acs": 73185, - "total_submitted": 87347, - "total_column_articles": 742, + "total_acs": 73477, + "total_submitted": 87711, + "total_column_articles": 744, "frontend_question_id": "1108", "is_new_question": false }, @@ -30567,9 +30798,9 @@ "question__title": "New Users Daily Count", "question__title_slug": "new-users-daily-count", "question__hide": false, - "total_acs": 9502, - "total_submitted": 23041, - "total_column_articles": 116, + "total_acs": 9598, + "total_submitted": 23279, + "total_column_articles": 118, "frontend_question_id": "1107", "is_new_question": false }, @@ -30588,9 +30819,9 @@ "question__title": "Print in Order", "question__title_slug": "print-in-order", "question__hide": false, - "total_acs": 90404, - "total_submitted": 138562, - "total_column_articles": 645, + "total_acs": 90917, + "total_submitted": 139337, + "total_column_articles": 652, "frontend_question_id": "1114", "is_new_question": false }, @@ -30609,8 +30840,8 @@ "question__title": "Palindrome Removal", "question__title_slug": "palindrome-removal", "question__hide": false, - "total_acs": 3316, - "total_submitted": 6790, + "total_acs": 3332, + "total_submitted": 6813, "total_column_articles": 47, "frontend_question_id": "1246", "is_new_question": false @@ -30630,9 +30861,9 @@ "question__title": "Delete Tree Nodes", "question__title_slug": "delete-tree-nodes", "question__hide": false, - "total_acs": 1877, - "total_submitted": 3429, - "total_column_articles": 57, + "total_acs": 1908, + "total_submitted": 3469, + "total_column_articles": 58, "frontend_question_id": "1273", "is_new_question": false }, @@ -30651,8 +30882,8 @@ "question__title": "Remove Interval", "question__title_slug": "remove-interval", "question__hide": false, - "total_acs": 1978, - "total_submitted": 3647, + "total_acs": 1996, + "total_submitted": 3679, "total_column_articles": 38, "frontend_question_id": "1272", "is_new_question": false @@ -30672,9 +30903,9 @@ "question__title": "Hexspeak", "question__title_slug": "hexspeak", "question__hide": false, - "total_acs": 2720, - "total_submitted": 5329, - "total_column_articles": 47, + "total_acs": 2738, + "total_submitted": 5360, + "total_column_articles": 48, "frontend_question_id": "1271", "is_new_question": false }, @@ -30693,8 +30924,8 @@ "question__title": "Unpopular Books", "question__title_slug": "unpopular-books", "question__hide": false, - "total_acs": 10050, - "total_submitted": 21120, + "total_acs": 10144, + "total_submitted": 21318, "total_column_articles": 115, "frontend_question_id": "1098", "is_new_question": false @@ -30714,8 +30945,8 @@ "question__title": "Parsing A Boolean Expression", "question__title_slug": "parsing-a-boolean-expression", "question__hide": false, - "total_acs": 4885, - "total_submitted": 8323, + "total_acs": 4905, + "total_submitted": 8357, "total_column_articles": 145, "frontend_question_id": "1106", "is_new_question": false @@ -30735,8 +30966,8 @@ "question__title": "Filling Bookcase Shelves", "question__title_slug": "filling-bookcase-shelves", "question__hide": false, - "total_acs": 6020, - "total_submitted": 10604, + "total_acs": 6052, + "total_submitted": 10650, "total_column_articles": 78, "frontend_question_id": "1105", "is_new_question": false @@ -30756,9 +30987,9 @@ "question__title": "Distribute Candies to People", "question__title_slug": "distribute-candies-to-people", "question__hide": false, - "total_acs": 38463, - "total_submitted": 60281, - "total_column_articles": 1148, + "total_acs": 38677, + "total_submitted": 60638, + "total_column_articles": 1150, "frontend_question_id": "1103", "is_new_question": false }, @@ -30777,9 +31008,9 @@ "question__title": "Path In Zigzag Labelled Binary Tree", "question__title_slug": "path-in-zigzag-labelled-binary-tree", "question__hide": false, - "total_acs": 30184, - "total_submitted": 39708, - "total_column_articles": 712, + "total_acs": 30230, + "total_submitted": 39770, + "total_column_articles": 714, "frontend_question_id": "1104", "is_new_question": false }, @@ -30798,9 +31029,9 @@ "question__title": "Game Play Analysis V", "question__title_slug": "game-play-analysis-v", "question__hide": false, - "total_acs": 8646, - "total_submitted": 16567, - "total_column_articles": 140, + "total_acs": 8735, + "total_submitted": 16732, + "total_column_articles": 143, "frontend_question_id": "1097", "is_new_question": false }, @@ -30819,9 +31050,9 @@ "question__title": "Divide Chocolate", "question__title_slug": "divide-chocolate", "question__hide": false, - "total_acs": 4874, - "total_submitted": 8523, - "total_column_articles": 75, + "total_acs": 4980, + "total_submitted": 8682, + "total_column_articles": 77, "frontend_question_id": "1231", "is_new_question": false }, @@ -30840,8 +31071,8 @@ "question__title": "Synonymous Sentences", "question__title_slug": "synonymous-sentences", "question__hide": false, - "total_acs": 1532, - "total_submitted": 2723, + "total_acs": 1549, + "total_submitted": 2745, "total_column_articles": 60, "frontend_question_id": "1258", "is_new_question": false @@ -30861,9 +31092,9 @@ "question__title": "Smallest Common Region", "question__title_slug": "smallest-common-region", "question__hide": false, - "total_acs": 2114, - "total_submitted": 3709, - "total_column_articles": 50, + "total_acs": 2136, + "total_submitted": 3735, + "total_column_articles": 51, "frontend_question_id": "1257", "is_new_question": false }, @@ -30882,8 +31113,8 @@ "question__title": "Encode Number", "question__title_slug": "encode-number", "question__hide": false, - "total_acs": 1739, - "total_submitted": 2580, + "total_acs": 1754, + "total_submitted": 2608, "total_column_articles": 43, "frontend_question_id": "1256", "is_new_question": false @@ -30903,9 +31134,9 @@ "question__title": "Brace Expansion II", "question__title_slug": "brace-expansion-ii", "question__hide": false, - "total_acs": 2070, - "total_submitted": 3711, - "total_column_articles": 57, + "total_acs": 2088, + "total_submitted": 3747, + "total_column_articles": 58, "frontend_question_id": "1096", "is_new_question": false }, @@ -30924,9 +31155,9 @@ "question__title": "Print FooBar Alternately", "question__title_slug": "print-foobar-alternately", "question__hide": false, - "total_acs": 51202, - "total_submitted": 91025, - "total_column_articles": 538, + "total_acs": 51529, + "total_submitted": 91595, + "total_column_articles": 543, "frontend_question_id": "1115", "is_new_question": false }, @@ -30945,9 +31176,9 @@ "question__title": "Building H2O", "question__title_slug": "building-h2o", "question__hide": false, - "total_acs": 20491, - "total_submitted": 38862, - "total_column_articles": 281, + "total_acs": 20621, + "total_submitted": 39078, + "total_column_articles": 283, "frontend_question_id": "1117", "is_new_question": false }, @@ -30966,9 +31197,9 @@ "question__title": "Find in Mountain Array", "question__title_slug": "find-in-mountain-array", "question__hide": false, - "total_acs": 22672, - "total_submitted": 60621, - "total_column_articles": 427, + "total_acs": 22798, + "total_submitted": 60966, + "total_column_articles": 428, "frontend_question_id": "1095", "is_new_question": false }, @@ -30987,9 +31218,9 @@ "question__title": "Car Pooling", "question__title_slug": "car-pooling", "question__hide": false, - "total_acs": 43318, - "total_submitted": 77799, - "total_column_articles": 729, + "total_acs": 44152, + "total_submitted": 79586, + "total_column_articles": 732, "frontend_question_id": "1094", "is_new_question": false }, @@ -31008,9 +31239,9 @@ "question__title": "Statistics from a Large Sample", "question__title_slug": "statistics-from-a-large-sample", "question__hide": false, - "total_acs": 4333, - "total_submitted": 11726, - "total_column_articles": 70, + "total_acs": 4355, + "total_submitted": 11808, + "total_column_articles": 73, "frontend_question_id": "1093", "is_new_question": false }, @@ -31029,9 +31260,9 @@ "question__title": "Game Play Analysis IV", "question__title_slug": "game-play-analysis-iv", "question__hide": false, - "total_acs": 17549, - "total_submitted": 40286, - "total_column_articles": 224, + "total_acs": 17800, + "total_submitted": 40816, + "total_column_articles": 226, "frontend_question_id": "550", "is_new_question": false }, @@ -31050,9 +31281,9 @@ "question__title": "Game Play Analysis III", "question__title_slug": "game-play-analysis-iii", "question__hide": false, - "total_acs": 20164, - "total_submitted": 29669, - "total_column_articles": 165, + "total_acs": 20450, + "total_submitted": 30069, + "total_column_articles": 166, "frontend_question_id": "534", "is_new_question": false }, @@ -31071,9 +31302,9 @@ "question__title": "Game Play Analysis II", "question__title_slug": "game-play-analysis-ii", "question__hide": false, - "total_acs": 25416, - "total_submitted": 47052, - "total_column_articles": 179, + "total_acs": 25711, + "total_submitted": 47619, + "total_column_articles": 180, "frontend_question_id": "512", "is_new_question": false }, @@ -31092,9 +31323,9 @@ "question__title": "Game Play Analysis I", "question__title_slug": "game-play-analysis-i", "question__hide": false, - "total_acs": 32127, - "total_submitted": 44192, - "total_column_articles": 168, + "total_acs": 33508, + "total_submitted": 46092, + "total_column_articles": 173, "frontend_question_id": "511", "is_new_question": false }, @@ -31113,8 +31344,8 @@ "question__title": "Valid Palindrome III", "question__title_slug": "valid-palindrome-iii", "question__hide": false, - "total_acs": 2104, - "total_submitted": 3760, + "total_acs": 2129, + "total_submitted": 3799, "total_column_articles": 45, "frontend_question_id": "1216", "is_new_question": false @@ -31134,9 +31365,9 @@ "question__title": "Tree Diameter", "question__title_slug": "tree-diameter", "question__hide": false, - "total_acs": 4399, - "total_submitted": 8526, - "total_column_articles": 82, + "total_acs": 4443, + "total_submitted": 8603, + "total_column_articles": 85, "frontend_question_id": "1245", "is_new_question": false }, @@ -31155,8 +31386,8 @@ "question__title": "Design A Leaderboard", "question__title_slug": "design-a-leaderboard", "question__hide": false, - "total_acs": 3117, - "total_submitted": 4977, + "total_acs": 3143, + "total_submitted": 5013, "total_column_articles": 52, "frontend_question_id": "1244", "is_new_question": false @@ -31176,8 +31407,8 @@ "question__title": "Array Transformation", "question__title_slug": "array-transformation", "question__hide": false, - "total_acs": 2974, - "total_submitted": 5560, + "total_acs": 2985, + "total_submitted": 5588, "total_column_articles": 67, "frontend_question_id": "1243", "is_new_question": false @@ -31197,9 +31428,9 @@ "question__title": "Sales Analysis III", "question__title_slug": "sales-analysis-iii", "question__hide": false, - "total_acs": 16284, - "total_submitted": 29738, - "total_column_articles": 134, + "total_acs": 17070, + "total_submitted": 31089, + "total_column_articles": 146, "frontend_question_id": "1084", "is_new_question": false }, @@ -31218,9 +31449,9 @@ "question__title": "Sales Analysis II", "question__title_slug": "sales-analysis-ii", "question__hide": false, - "total_acs": 14220, - "total_submitted": 26915, - "total_column_articles": 123, + "total_acs": 14324, + "total_submitted": 27106, + "total_column_articles": 125, "frontend_question_id": "1083", "is_new_question": false }, @@ -31239,9 +31470,9 @@ "question__title": "Sales Analysis I", "question__title_slug": "sales-analysis-i", "question__hide": false, - "total_acs": 15309, - "total_submitted": 20092, - "total_column_articles": 117, + "total_acs": 15432, + "total_submitted": 20240, + "total_column_articles": 118, "frontend_question_id": "1082", "is_new_question": false }, @@ -31260,9 +31491,9 @@ "question__title": "Shortest Path in Binary Matrix", "question__title_slug": "shortest-path-in-binary-matrix", "question__hide": false, - "total_acs": 42177, - "total_submitted": 109878, - "total_column_articles": 430, + "total_acs": 42883, + "total_submitted": 111672, + "total_column_articles": 438, "frontend_question_id": "1091", "is_new_question": false }, @@ -31281,8 +31512,8 @@ "question__title": "Shortest Common Supersequence ", "question__title_slug": "shortest-common-supersequence", "question__hide": false, - "total_acs": 3354, - "total_submitted": 6565, + "total_acs": 3384, + "total_submitted": 6631, "total_column_articles": 63, "frontend_question_id": "1092", "is_new_question": false @@ -31302,9 +31533,9 @@ "question__title": "Largest Values From Labels", "question__title_slug": "largest-values-from-labels", "question__hide": false, - "total_acs": 4622, - "total_submitted": 8306, - "total_column_articles": 100, + "total_acs": 4653, + "total_submitted": 8358, + "total_column_articles": 102, "frontend_question_id": "1090", "is_new_question": false }, @@ -31323,9 +31554,9 @@ "question__title": "Duplicate Zeros", "question__title_slug": "duplicate-zeros", "question__hide": false, - "total_acs": 22638, - "total_submitted": 38919, - "total_column_articles": 340, + "total_acs": 22825, + "total_submitted": 39216, + "total_column_articles": 342, "frontend_question_id": "1089", "is_new_question": false }, @@ -31344,9 +31575,9 @@ "question__title": "Minimum Time to Build Blocks", "question__title_slug": "minimum-time-to-build-blocks", "question__hide": false, - "total_acs": 854, - "total_submitted": 1886, - "total_column_articles": 20, + "total_acs": 861, + "total_submitted": 1897, + "total_column_articles": 21, "frontend_question_id": "1199", "is_new_question": false }, @@ -31365,9 +31596,9 @@ "question__title": "Toss Strange Coins", "question__title_slug": "toss-strange-coins", "question__hide": false, - "total_acs": 4492, - "total_submitted": 8615, - "total_column_articles": 87, + "total_acs": 4543, + "total_submitted": 8695, + "total_column_articles": 90, "frontend_question_id": "1230", "is_new_question": false }, @@ -31386,9 +31617,9 @@ "question__title": "Meeting Scheduler", "question__title_slug": "meeting-scheduler", "question__hide": false, - "total_acs": 3987, - "total_submitted": 8952, - "total_column_articles": 82, + "total_acs": 4035, + "total_submitted": 9044, + "total_column_articles": 83, "frontend_question_id": "1229", "is_new_question": false }, @@ -31407,9 +31638,9 @@ "question__title": "Missing Number In Arithmetic Progression", "question__title_slug": "missing-number-in-arithmetic-progression", "question__hide": false, - "total_acs": 3498, - "total_submitted": 6508, - "total_column_articles": 62, + "total_acs": 3517, + "total_submitted": 6541, + "total_column_articles": 63, "frontend_question_id": "1228", "is_new_question": false }, @@ -31428,9 +31659,9 @@ "question__title": "Project Employees III", "question__title_slug": "project-employees-iii", "question__hide": false, - "total_acs": 10343, - "total_submitted": 14311, - "total_column_articles": 102, + "total_acs": 10492, + "total_submitted": 14521, + "total_column_articles": 104, "frontend_question_id": "1077", "is_new_question": false }, @@ -31449,9 +31680,9 @@ "question__title": "Project Employees II", "question__title_slug": "project-employees-ii", "question__hide": false, - "total_acs": 13821, - "total_submitted": 28096, - "total_column_articles": 104, + "total_acs": 13927, + "total_submitted": 28328, + "total_column_articles": 105, "frontend_question_id": "1076", "is_new_question": false }, @@ -31470,9 +31701,9 @@ "question__title": "Project Employees I", "question__title_slug": "project-employees-i", "question__hide": false, - "total_acs": 12858, - "total_submitted": 18473, - "total_column_articles": 90, + "total_acs": 12965, + "total_submitted": 18638, + "total_column_articles": 91, "frontend_question_id": "1075", "is_new_question": false }, @@ -31491,9 +31722,9 @@ "question__title": "Letter Tile Possibilities", "question__title_slug": "letter-tile-possibilities", "question__hide": false, - "total_acs": 13453, - "total_submitted": 18397, - "total_column_articles": 222, + "total_acs": 13581, + "total_submitted": 18552, + "total_column_articles": 223, "frontend_question_id": "1079", "is_new_question": false }, @@ -31512,9 +31743,9 @@ "question__title": "Smallest Subsequence of Distinct Characters", "question__title_slug": "smallest-subsequence-of-distinct-characters", "question__hide": false, - "total_acs": 18988, - "total_submitted": 32704, - "total_column_articles": 200, + "total_acs": 19212, + "total_submitted": 33065, + "total_column_articles": 202, "frontend_question_id": "1081", "is_new_question": false }, @@ -31533,9 +31764,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": 5399, - "total_submitted": 10721, - "total_column_articles": 113, + "total_acs": 5453, + "total_submitted": 10837, + "total_column_articles": 114, "frontend_question_id": "1080", "is_new_question": false }, @@ -31554,9 +31785,9 @@ "question__title": "Occurrences After Bigram", "question__title_slug": "occurrences-after-bigram", "question__hide": false, - "total_acs": 33415, - "total_submitted": 50882, - "total_column_articles": 455, + "total_acs": 33498, + "total_submitted": 51007, + "total_column_articles": 456, "frontend_question_id": "1078", "is_new_question": false }, @@ -31575,9 +31806,9 @@ "question__title": "Product Sales Analysis III", "question__title_slug": "product-sales-analysis-iii", "question__hide": false, - "total_acs": 10549, - "total_submitted": 22151, - "total_column_articles": 80, + "total_acs": 10627, + "total_submitted": 22329, + "total_column_articles": 81, "frontend_question_id": "1070", "is_new_question": false }, @@ -31596,8 +31827,8 @@ "question__title": "Product Sales Analysis II", "question__title_slug": "product-sales-analysis-ii", "question__hide": false, - "total_acs": 14339, - "total_submitted": 17556, + "total_acs": 14465, + "total_submitted": 17717, "total_column_articles": 69, "frontend_question_id": "1069", "is_new_question": false @@ -31617,9 +31848,9 @@ "question__title": "Product Sales Analysis I", "question__title_slug": "product-sales-analysis-i", "question__hide": false, - "total_acs": 16697, - "total_submitted": 19272, - "total_column_articles": 78, + "total_acs": 16841, + "total_submitted": 19451, + "total_column_articles": 79, "frontend_question_id": "1068", "is_new_question": false }, @@ -31638,8 +31869,8 @@ "question__title": "Maximum Number of Ones", "question__title_slug": "maximum-number-of-ones", "question__hide": false, - "total_acs": 740, - "total_submitted": 1240, + "total_acs": 744, + "total_submitted": 1244, "total_column_articles": 19, "frontend_question_id": "1183", "is_new_question": false @@ -31659,8 +31890,8 @@ "question__title": "Stepping Numbers", "question__title_slug": "stepping-numbers", "question__hide": false, - "total_acs": 2198, - "total_submitted": 5221, + "total_acs": 2203, + "total_submitted": 5233, "total_column_articles": 46, "frontend_question_id": "1215", "is_new_question": false @@ -31680,8 +31911,8 @@ "question__title": "Two Sum BSTs", "question__title_slug": "two-sum-bsts", "question__hide": false, - "total_acs": 4182, - "total_submitted": 6437, + "total_acs": 4197, + "total_submitted": 6460, "total_column_articles": 84, "frontend_question_id": "1214", "is_new_question": false @@ -31701,9 +31932,9 @@ "question__title": "Intersection of Three Sorted Arrays", "question__title_slug": "intersection-of-three-sorted-arrays", "question__hide": false, - "total_acs": 7086, - "total_submitted": 9085, - "total_column_articles": 153, + "total_acs": 7160, + "total_submitted": 9179, + "total_column_articles": 155, "frontend_question_id": "1213", "is_new_question": false }, @@ -31722,8 +31953,8 @@ "question__title": "Adding Two Negabinary Numbers", "question__title_slug": "adding-two-negabinary-numbers", "question__hide": false, - "total_acs": 2890, - "total_submitted": 8319, + "total_acs": 2908, + "total_submitted": 8388, "total_column_articles": 60, "frontend_question_id": "1073", "is_new_question": false @@ -31743,8 +31974,8 @@ "question__title": "Flip Columns For Maximum Number of Equal Rows", "question__title_slug": "flip-columns-for-maximum-number-of-equal-rows", "question__hide": false, - "total_acs": 3993, - "total_submitted": 6709, + "total_acs": 4042, + "total_submitted": 6773, "total_column_articles": 65, "frontend_question_id": "1072", "is_new_question": false @@ -31764,9 +31995,9 @@ "question__title": "Greatest Common Divisor of Strings", "question__title_slug": "greatest-common-divisor-of-strings", "question__hide": false, - "total_acs": 37119, - "total_submitted": 63227, - "total_column_articles": 697, + "total_acs": 37246, + "total_submitted": 63430, + "total_column_articles": 698, "frontend_question_id": "1071", "is_new_question": false }, @@ -31785,8 +32016,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": 19777, - "total_submitted": 29516, + "total_acs": 19846, + "total_submitted": 29632, "total_column_articles": 206, "frontend_question_id": "1074", "is_new_question": false @@ -31806,8 +32037,8 @@ "question__title": "Optimize Water Distribution in a Village", "question__title_slug": "optimize-water-distribution-in-a-village", "question__hide": false, - "total_acs": 2072, - "total_submitted": 3490, + "total_acs": 2088, + "total_submitted": 3511, "total_column_articles": 41, "frontend_question_id": "1168", "is_new_question": false @@ -31827,9 +32058,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": 4464, - "total_submitted": 6031, - "total_column_articles": 69, + "total_acs": 4510, + "total_submitted": 6092, + "total_column_articles": 70, "frontend_question_id": "1198", "is_new_question": false }, @@ -31848,8 +32079,8 @@ "question__title": "Minimum Knight Moves", "question__title_slug": "minimum-knight-moves", "question__hide": false, - "total_acs": 5815, - "total_submitted": 15275, + "total_acs": 5869, + "total_submitted": 15396, "total_column_articles": 69, "frontend_question_id": "1197", "is_new_question": false @@ -31869,9 +32100,9 @@ "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": 4140, - "total_submitted": 6071, - "total_column_articles": 66, + "total_acs": 4164, + "total_submitted": 6107, + "total_column_articles": 67, "frontend_question_id": "1196", "is_new_question": false }, @@ -31890,9 +32121,9 @@ "question__title": "Distant Barcodes", "question__title_slug": "distant-barcodes", "question__hide": false, - "total_acs": 9275, - "total_submitted": 23896, - "total_column_articles": 128, + "total_acs": 9325, + "total_submitted": 24016, + "total_column_articles": 131, "frontend_question_id": "1054", "is_new_question": false }, @@ -31911,9 +32142,9 @@ "question__title": "Previous Permutation With One Swap", "question__title_slug": "previous-permutation-with-one-swap", "question__hide": false, - "total_acs": 6672, - "total_submitted": 14426, - "total_column_articles": 104, + "total_acs": 6700, + "total_submitted": 14492, + "total_column_articles": 105, "frontend_question_id": "1053", "is_new_question": false }, @@ -31932,9 +32163,9 @@ "question__title": "Grumpy Bookstore Owner", "question__title_slug": "grumpy-bookstore-owner", "question__hide": false, - "total_acs": 53326, - "total_submitted": 91738, - "total_column_articles": 821, + "total_acs": 53569, + "total_submitted": 92138, + "total_column_articles": 826, "frontend_question_id": "1052", "is_new_question": false }, @@ -31953,9 +32184,9 @@ "question__title": "Height Checker", "question__title_slug": "height-checker", "question__hide": false, - "total_acs": 35045, - "total_submitted": 46209, - "total_column_articles": 414, + "total_acs": 35231, + "total_submitted": 46450, + "total_column_articles": 416, "frontend_question_id": "1051", "is_new_question": false }, @@ -31974,9 +32205,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": 18416, - "total_submitted": 23965, - "total_column_articles": 83, + "total_acs": 19226, + "total_submitted": 24979, + "total_column_articles": 88, "frontend_question_id": "1050", "is_new_question": false }, @@ -31995,9 +32226,9 @@ "question__title": "Customers Who Bought All Products", "question__title_slug": "customers-who-bought-all-products", "question__hide": false, - "total_acs": 11661, - "total_submitted": 18261, - "total_column_articles": 134, + "total_acs": 11794, + "total_submitted": 18467, + "total_column_articles": 136, "frontend_question_id": "1045", "is_new_question": false }, @@ -32016,9 +32247,9 @@ "question__title": "Shortest Distance to Target Color", "question__title_slug": "shortest-distance-to-target-color", "question__hide": false, - "total_acs": 3630, - "total_submitted": 8148, - "total_column_articles": 71, + "total_acs": 3705, + "total_submitted": 8323, + "total_column_articles": 73, "frontend_question_id": "1182", "is_new_question": false }, @@ -32037,8 +32268,8 @@ "question__title": "Last Substring in Lexicographical Order", "question__title_slug": "last-substring-in-lexicographical-order", "question__hide": false, - "total_acs": 6569, - "total_submitted": 24453, + "total_acs": 6592, + "total_submitted": 24542, "total_column_articles": 114, "frontend_question_id": "1163", "is_new_question": false @@ -32058,8 +32289,8 @@ "question__title": "Before and After Puzzle", "question__title_slug": "before-and-after-puzzle", "question__hide": false, - "total_acs": 1646, - "total_submitted": 4349, + "total_acs": 1651, + "total_submitted": 4365, "total_column_articles": 33, "frontend_question_id": "1181", "is_new_question": false @@ -32079,8 +32310,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": 3604, - "total_submitted": 4640, + "total_acs": 3624, + "total_submitted": 4667, "total_column_articles": 83, "frontend_question_id": "1180", "is_new_question": false @@ -32100,9 +32331,9 @@ "question__title": "Last Stone Weight II", "question__title_slug": "last-stone-weight-ii", "question__hide": false, - "total_acs": 64727, - "total_submitted": 96924, - "total_column_articles": 546, + "total_acs": 66354, + "total_submitted": 99183, + "total_column_articles": 554, "frontend_question_id": "1049", "is_new_question": false }, @@ -32121,9 +32352,9 @@ "question__title": "Longest String Chain", "question__title_slug": "longest-string-chain", "question__hide": false, - "total_acs": 12991, - "total_submitted": 27612, - "total_column_articles": 192, + "total_acs": 13122, + "total_submitted": 27857, + "total_column_articles": 196, "frontend_question_id": "1048", "is_new_question": false }, @@ -32142,9 +32373,9 @@ "question__title": "Remove All Adjacent Duplicates In String", "question__title_slug": "remove-all-adjacent-duplicates-in-string", "question__hide": false, - "total_acs": 145084, - "total_submitted": 199905, - "total_column_articles": 1194, + "total_acs": 147397, + "total_submitted": 203052, + "total_column_articles": 1207, "frontend_question_id": "1047", "is_new_question": false }, @@ -32163,9 +32394,9 @@ "question__title": "Last Stone Weight", "question__title_slug": "last-stone-weight", "question__hide": false, - "total_acs": 73881, - "total_submitted": 112299, - "total_column_articles": 1009, + "total_acs": 74216, + "total_submitted": 112829, + "total_column_articles": 1019, "frontend_question_id": "1046", "is_new_question": false }, @@ -32184,8 +32415,8 @@ "question__title": "Minimum Cost to Connect Sticks", "question__title_slug": "minimum-cost-to-connect-sticks", "question__hide": false, - "total_acs": 2981, - "total_submitted": 6337, + "total_acs": 3004, + "total_submitted": 6364, "total_column_articles": 41, "frontend_question_id": "1167", "is_new_question": false @@ -32205,9 +32436,9 @@ "question__title": "Design File System", "question__title_slug": "design-file-system", "question__hide": false, - "total_acs": 3661, - "total_submitted": 7484, - "total_column_articles": 63, + "total_acs": 3697, + "total_submitted": 7531, + "total_column_articles": 64, "frontend_question_id": "1166", "is_new_question": false }, @@ -32226,8 +32457,8 @@ "question__title": "String Transforms Into Another String", "question__title_slug": "string-transforms-into-another-string", "question__hide": false, - "total_acs": 1893, - "total_submitted": 5069, + "total_acs": 1903, + "total_submitted": 5096, "total_column_articles": 26, "frontend_question_id": "1153", "is_new_question": false @@ -32247,9 +32478,9 @@ "question__title": "Single-Row Keyboard", "question__title_slug": "single-row-keyboard", "question__hide": false, - "total_acs": 8362, - "total_submitted": 10009, - "total_column_articles": 131, + "total_acs": 8392, + "total_submitted": 10042, + "total_column_articles": 132, "frontend_question_id": "1165", "is_new_question": false }, @@ -32268,8 +32499,8 @@ "question__title": "Longest Duplicate Substring", "question__title_slug": "longest-duplicate-substring", "question__hide": false, - "total_acs": 22962, - "total_submitted": 65671, + "total_acs": 23118, + "total_submitted": 66082, "total_column_articles": 206, "frontend_question_id": "1044", "is_new_question": false @@ -32289,8 +32520,8 @@ "question__title": "Partition Array for Maximum Sum", "question__title_slug": "partition-array-for-maximum-sum", "question__hide": false, - "total_acs": 9313, - "total_submitted": 13307, + "total_acs": 9353, + "total_submitted": 13361, "total_column_articles": 124, "frontend_question_id": "1043", "is_new_question": false @@ -32310,9 +32541,9 @@ "question__title": "Flower Planting With No Adjacent", "question__title_slug": "flower-planting-with-no-adjacent", "question__hide": false, - "total_acs": 13539, - "total_submitted": 24959, - "total_column_articles": 180, + "total_acs": 13627, + "total_submitted": 25099, + "total_column_articles": 183, "frontend_question_id": "1042", "is_new_question": false }, @@ -32331,8 +32562,8 @@ "question__title": "Robot Bounded In Circle", "question__title_slug": "robot-bounded-in-circle", "question__hide": false, - "total_acs": 8676, - "total_submitted": 17538, + "total_acs": 8748, + "total_submitted": 17650, "total_column_articles": 139, "frontend_question_id": "1041", "is_new_question": false @@ -32352,8 +32583,8 @@ "question__title": "Divide Array Into Increasing Sequences", "question__title_slug": "divide-array-into-increasing-sequences", "question__hide": false, - "total_acs": 1235, - "total_submitted": 2134, + "total_acs": 1238, + "total_submitted": 2137, "total_column_articles": 20, "frontend_question_id": "1121", "is_new_question": false @@ -32373,9 +32604,9 @@ "question__title": "As Far from Land as Possible", "question__title_slug": "as-far-from-land-as-possible", "question__hide": false, - "total_acs": 43758, - "total_submitted": 92929, - "total_column_articles": 567, + "total_acs": 44011, + "total_submitted": 93457, + "total_column_articles": 569, "frontend_question_id": "1162", "is_new_question": false }, @@ -32394,9 +32625,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": 12253, - "total_submitted": 19408, - "total_column_articles": 205, + "total_acs": 12346, + "total_submitted": 19564, + "total_column_articles": 206, "frontend_question_id": "1161", "is_new_question": false }, @@ -32415,8 +32646,8 @@ "question__title": "Valid Boomerang", "question__title_slug": "valid-boomerang", "question__hide": false, - "total_acs": 11644, - "total_submitted": 26580, + "total_acs": 11727, + "total_submitted": 26765, "total_column_articles": 156, "frontend_question_id": "1037", "is_new_question": false @@ -32436,9 +32667,9 @@ "question__title": "Binary Search Tree to Greater Sum Tree", "question__title_slug": "binary-search-tree-to-greater-sum-tree", "question__hide": false, - "total_acs": 32672, - "total_submitted": 40745, - "total_column_articles": 394, + "total_acs": 33014, + "total_submitted": 41168, + "total_column_articles": 401, "frontend_question_id": "1038", "is_new_question": false }, @@ -32457,8 +32688,8 @@ "question__title": "Moving Stones Until Consecutive II", "question__title_slug": "moving-stones-until-consecutive-ii", "question__hide": false, - "total_acs": 3015, - "total_submitted": 5773, + "total_acs": 3030, + "total_submitted": 5795, "total_column_articles": 33, "frontend_question_id": "1040", "is_new_question": false @@ -32478,9 +32709,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": 64495, - "total_submitted": 94136, - "total_column_articles": 953, + "total_acs": 64770, + "total_submitted": 94561, + "total_column_articles": 954, "frontend_question_id": "1160", "is_new_question": false }, @@ -32499,8 +32730,8 @@ "question__title": "Minimum Score Triangulation of Polygon", "question__title_slug": "minimum-score-triangulation-of-polygon", "question__hide": false, - "total_acs": 5558, - "total_submitted": 9806, + "total_acs": 5592, + "total_submitted": 9875, "total_column_articles": 70, "frontend_question_id": "1039", "is_new_question": false @@ -32520,8 +32751,8 @@ "question__title": "Analyze User Website Visit Pattern", "question__title_slug": "analyze-user-website-visit-pattern", "question__hide": false, - "total_acs": 1831, - "total_submitted": 4605, + "total_acs": 1848, + "total_submitted": 4650, "total_column_articles": 43, "frontend_question_id": "1152", "is_new_question": false @@ -32541,9 +32772,9 @@ "question__title": "Minimum Swaps to Group All 1's Together", "question__title_slug": "minimum-swaps-to-group-all-1s-together", "question__hide": false, - "total_acs": 6349, - "total_submitted": 12377, - "total_column_articles": 99, + "total_acs": 6455, + "total_submitted": 12558, + "total_column_articles": 100, "frontend_question_id": "1151", "is_new_question": false }, @@ -32562,9 +32793,9 @@ "question__title": "Escape a Large Maze", "question__title_slug": "escape-a-large-maze", "question__hide": false, - "total_acs": 19045, - "total_submitted": 40546, - "total_column_articles": 206, + "total_acs": 19079, + "total_submitted": 40666, + "total_column_articles": 207, "frontend_question_id": "1036", "is_new_question": false }, @@ -32583,9 +32814,9 @@ "question__title": "Uncrossed Lines", "question__title_slug": "uncrossed-lines", "question__hide": false, - "total_acs": 46886, - "total_submitted": 71096, - "total_column_articles": 458, + "total_acs": 47608, + "total_submitted": 72035, + "total_column_articles": 464, "frontend_question_id": "1035", "is_new_question": false }, @@ -32604,9 +32835,9 @@ "question__title": "Coloring A Border", "question__title_slug": "coloring-a-border", "question__hide": false, - "total_acs": 29879, - "total_submitted": 53773, - "total_column_articles": 483, + "total_acs": 29986, + "total_submitted": 54003, + "total_column_articles": 485, "frontend_question_id": "1034", "is_new_question": false }, @@ -32625,9 +32856,9 @@ "question__title": "Moving Stones Until Consecutive", "question__title_slug": "moving-stones-until-consecutive", "question__hide": false, - "total_acs": 11996, - "total_submitted": 30190, - "total_column_articles": 179, + "total_acs": 12026, + "total_submitted": 30253, + "total_column_articles": 180, "frontend_question_id": "1033", "is_new_question": false }, @@ -32646,9 +32877,9 @@ "question__title": "Check If a Number Is Majority Element in a Sorted Array", "question__title_slug": "check-if-a-number-is-majority-element-in-a-sorted-array", "question__hide": false, - "total_acs": 5691, - "total_submitted": 9501, - "total_column_articles": 97, + "total_acs": 5752, + "total_submitted": 9626, + "total_column_articles": 99, "frontend_question_id": "1150", "is_new_question": false }, @@ -32667,9 +32898,9 @@ "question__title": "Parallel Courses", "question__title_slug": "parallel-courses", "question__hide": false, - "total_acs": 4147, - "total_submitted": 7034, - "total_column_articles": 73, + "total_acs": 4210, + "total_submitted": 7117, + "total_column_articles": 74, "frontend_question_id": "1136", "is_new_question": false }, @@ -32688,9 +32919,9 @@ "question__title": "Connecting Cities With Minimum Cost", "question__title_slug": "connecting-cities-with-minimum-cost", "question__hide": false, - "total_acs": 8728, - "total_submitted": 15702, - "total_column_articles": 109, + "total_acs": 8921, + "total_submitted": 15968, + "total_column_articles": 114, "frontend_question_id": "1135", "is_new_question": false }, @@ -32709,9 +32940,9 @@ "question__title": "Path With Maximum Minimum Value", "question__title_slug": "path-with-maximum-minimum-value", "question__hide": false, - "total_acs": 6722, - "total_submitted": 17520, - "total_column_articles": 78, + "total_acs": 6755, + "total_submitted": 17586, + "total_column_articles": 79, "frontend_question_id": "1102", "is_new_question": false }, @@ -32730,8 +32961,8 @@ "question__title": "Largest Unique Number", "question__title_slug": "largest-unique-number", "question__hide": false, - "total_acs": 3599, - "total_submitted": 5562, + "total_acs": 3627, + "total_submitted": 5597, "total_column_articles": 76, "frontend_question_id": "1133", "is_new_question": false @@ -32751,8 +32982,8 @@ "question__title": "Stream of Characters", "question__title_slug": "stream-of-characters", "question__hide": false, - "total_acs": 3373, - "total_submitted": 7908, + "total_acs": 3395, + "total_submitted": 7944, "total_column_articles": 58, "frontend_question_id": "1032", "is_new_question": false @@ -32772,9 +33003,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": 6500, - "total_submitted": 11132, - "total_column_articles": 100, + "total_acs": 6580, + "total_submitted": 11259, + "total_column_articles": 101, "frontend_question_id": "1031", "is_new_question": false }, @@ -32793,9 +33024,9 @@ "question__title": "Two City Scheduling", "question__title_slug": "two-city-scheduling", "question__hide": false, - "total_acs": 19379, - "total_submitted": 29004, - "total_column_articles": 219, + "total_acs": 19534, + "total_submitted": 29220, + "total_column_articles": 220, "frontend_question_id": "1029", "is_new_question": false }, @@ -32814,9 +33045,9 @@ "question__title": "Matrix Cells in Distance Order", "question__title_slug": "matrix-cells-in-distance-order", "question__hide": false, - "total_acs": 43045, - "total_submitted": 60705, - "total_column_articles": 469, + "total_acs": 43125, + "total_submitted": 60815, + "total_column_articles": 470, "frontend_question_id": "1030", "is_new_question": false }, @@ -32835,9 +33066,9 @@ "question__title": "Recover a Tree From Preorder Traversal", "question__title_slug": "recover-a-tree-from-preorder-traversal", "question__hide": false, - "total_acs": 22301, - "total_submitted": 30521, - "total_column_articles": 469, + "total_acs": 22396, + "total_submitted": 30668, + "total_column_articles": 470, "frontend_question_id": "1028", "is_new_question": false }, @@ -32856,9 +33087,9 @@ "question__title": "Maximum Difference Between Node and Ancestor", "question__title_slug": "maximum-difference-between-node-and-ancestor", "question__hide": false, - "total_acs": 11846, - "total_submitted": 17382, - "total_column_articles": 207, + "total_acs": 11930, + "total_submitted": 17489, + "total_column_articles": 210, "frontend_question_id": "1026", "is_new_question": false }, @@ -32877,8 +33108,8 @@ "question__title": "Maximum Average Subtree", "question__title_slug": "maximum-average-subtree", "question__hide": false, - "total_acs": 3119, - "total_submitted": 5047, + "total_acs": 3145, + "total_submitted": 5079, "total_column_articles": 58, "frontend_question_id": "1120", "is_new_question": false @@ -32898,8 +33129,8 @@ "question__title": "Armstrong Number", "question__title_slug": "armstrong-number", "question__hide": false, - "total_acs": 3682, - "total_submitted": 4768, + "total_acs": 3693, + "total_submitted": 4779, "total_column_articles": 61, "frontend_question_id": "1134", "is_new_question": false @@ -32919,8 +33150,8 @@ "question__title": "Remove Vowels from a String", "question__title_slug": "remove-vowels-from-a-string", "question__hide": false, - "total_acs": 9167, - "total_submitted": 10573, + "total_acs": 9201, + "total_submitted": 10609, "total_column_articles": 163, "frontend_question_id": "1119", "is_new_question": false @@ -32940,9 +33171,9 @@ "question__title": "Number of Days in a Month", "question__title_slug": "number-of-days-in-a-month", "question__hide": false, - "total_acs": 2966, - "total_submitted": 4648, - "total_column_articles": 53, + "total_acs": 2980, + "total_submitted": 4671, + "total_column_articles": 54, "frontend_question_id": "1118", "is_new_question": false }, @@ -32961,9 +33192,9 @@ "question__title": "Longest Arithmetic Subsequence", "question__title_slug": "longest-arithmetic-subsequence", "question__hide": false, - "total_acs": 16612, - "total_submitted": 38317, - "total_column_articles": 148, + "total_acs": 16778, + "total_submitted": 38607, + "total_column_articles": 150, "frontend_question_id": "1027", "is_new_question": false }, @@ -32982,9 +33213,9 @@ "question__title": "Divisor Game", "question__title_slug": "divisor-game", "question__hide": false, - "total_acs": 83742, - "total_submitted": 118267, - "total_column_articles": 707, + "total_acs": 83983, + "total_submitted": 118664, + "total_column_articles": 710, "frontend_question_id": "1025", "is_new_question": false }, @@ -33003,8 +33234,8 @@ "question__title": "The Earliest Moment When Everyone Become Friends", "question__title_slug": "the-earliest-moment-when-everyone-become-friends", "question__hide": false, - "total_acs": 3031, - "total_submitted": 4461, + "total_acs": 3067, + "total_submitted": 4502, "total_column_articles": 79, "frontend_question_id": "1101", "is_new_question": false @@ -33024,9 +33255,9 @@ "question__title": "Find K-Length Substrings With No Repeated Characters", "question__title_slug": "find-k-length-substrings-with-no-repeated-characters", "question__hide": false, - "total_acs": 6748, - "total_submitted": 9573, - "total_column_articles": 128, + "total_acs": 6805, + "total_submitted": 9642, + "total_column_articles": 130, "frontend_question_id": "1100", "is_new_question": false }, @@ -33045,9 +33276,9 @@ "question__title": "Two Sum Less Than K", "question__title_slug": "two-sum-less-than-k", "question__hide": false, - "total_acs": 6346, - "total_submitted": 10695, - "total_column_articles": 109, + "total_acs": 6454, + "total_submitted": 10858, + "total_column_articles": 114, "frontend_question_id": "1099", "is_new_question": false }, @@ -33066,9 +33297,9 @@ "question__title": "Sum of Digits in the Minimum Number", "question__title_slug": "sum-of-digits-in-the-minimum-number", "question__hide": false, - "total_acs": 4128, - "total_submitted": 5333, - "total_column_articles": 87, + "total_acs": 4141, + "total_submitted": 5350, + "total_column_articles": 88, "frontend_question_id": "1085", "is_new_question": false }, @@ -33087,8 +33318,8 @@ "question__title": "Video Stitching", "question__title_slug": "video-stitching", "question__hide": false, - "total_acs": 37321, - "total_submitted": 68067, + "total_acs": 37489, + "total_submitted": 68408, "total_column_articles": 420, "frontend_question_id": "1024", "is_new_question": false @@ -33108,8 +33339,8 @@ "question__title": "Camelcase Matching", "question__title_slug": "camelcase-matching", "question__hide": false, - "total_acs": 8399, - "total_submitted": 14755, + "total_acs": 8431, + "total_submitted": 14818, "total_column_articles": 195, "frontend_question_id": "1023", "is_new_question": false @@ -33129,9 +33360,9 @@ "question__title": "Sum of Root To Leaf Binary Numbers", "question__title_slug": "sum-of-root-to-leaf-binary-numbers", "question__hide": false, - "total_acs": 23513, - "total_submitted": 33001, - "total_column_articles": 329, + "total_acs": 23709, + "total_submitted": 33251, + "total_column_articles": 331, "frontend_question_id": "1022", "is_new_question": false }, @@ -33150,9 +33381,9 @@ "question__title": "Remove Outermost Parentheses", "question__title_slug": "remove-outermost-parentheses", "question__hide": false, - "total_acs": 62690, - "total_submitted": 79894, - "total_column_articles": 723, + "total_acs": 63022, + "total_submitted": 80331, + "total_column_articles": 726, "frontend_question_id": "1021", "is_new_question": false }, @@ -33171,8 +33402,8 @@ "question__title": "Confusing Number II", "question__title_slug": "confusing-number-ii", "question__hide": false, - "total_acs": 1259, - "total_submitted": 2713, + "total_acs": 1267, + "total_submitted": 2726, "total_column_articles": 41, "frontend_question_id": "1088", "is_new_question": false @@ -33192,9 +33423,9 @@ "question__title": "Brace Expansion", "question__title_slug": "brace-expansion", "question__hide": false, - "total_acs": 2397, - "total_submitted": 4367, - "total_column_articles": 68, + "total_acs": 2434, + "total_submitted": 4443, + "total_column_articles": 69, "frontend_question_id": "1087", "is_new_question": false }, @@ -33213,9 +33444,9 @@ "question__title": "Index Pairs of a String", "question__title_slug": "index-pairs-of-a-string", "question__hide": false, - "total_acs": 2907, - "total_submitted": 5242, - "total_column_articles": 83, + "total_acs": 2925, + "total_submitted": 5274, + "total_column_articles": 85, "frontend_question_id": "1065", "is_new_question": false }, @@ -33234,8 +33465,8 @@ "question__title": "High Five", "question__title_slug": "high-five", "question__hide": false, - "total_acs": 5778, - "total_submitted": 8477, + "total_acs": 5809, + "total_submitted": 8523, "total_column_articles": 95, "frontend_question_id": "1086", "is_new_question": false @@ -33255,9 +33486,9 @@ "question__title": "Number of Enclaves", "question__title_slug": "number-of-enclaves", "question__hide": false, - "total_acs": 41747, - "total_submitted": 68474, - "total_column_articles": 591, + "total_acs": 42263, + "total_submitted": 69252, + "total_column_articles": 602, "frontend_question_id": "1020", "is_new_question": false }, @@ -33276,9 +33507,9 @@ "question__title": "Next Greater Node In Linked List", "question__title_slug": "next-greater-node-in-linked-list", "question__hide": false, - "total_acs": 23960, - "total_submitted": 39684, - "total_column_articles": 333, + "total_acs": 24337, + "total_submitted": 40265, + "total_column_articles": 339, "frontend_question_id": "1019", "is_new_question": false }, @@ -33297,8 +33528,8 @@ "question__title": "Binary Prefix Divisible By 5", "question__title_slug": "binary-prefix-divisible-by-5", "question__hide": false, - "total_acs": 46100, - "total_submitted": 89664, + "total_acs": 46219, + "total_submitted": 89910, "total_column_articles": 403, "frontend_question_id": "1018", "is_new_question": false @@ -33318,8 +33549,8 @@ "question__title": "Convert to Base -2", "question__title_slug": "convert-to-base-2", "question__hide": false, - "total_acs": 4130, - "total_submitted": 7315, + "total_acs": 4141, + "total_submitted": 7334, "total_column_articles": 61, "frontend_question_id": "1017", "is_new_question": false @@ -33339,9 +33570,9 @@ "question__title": "Confusing Number", "question__title_slug": "confusing-number", "question__hide": false, - "total_acs": 4024, - "total_submitted": 9475, - "total_column_articles": 77, + "total_acs": 4050, + "total_submitted": 9528, + "total_column_articles": 78, "frontend_question_id": "1056", "is_new_question": false }, @@ -33360,8 +33591,8 @@ "question__title": "Digit Count in Range", "question__title_slug": "digit-count-in-range", "question__hide": false, - "total_acs": 1049, - "total_submitted": 2381, + "total_acs": 1080, + "total_submitted": 2428, "total_column_articles": 29, "frontend_question_id": "1067", "is_new_question": false @@ -33381,8 +33612,8 @@ "question__title": "Campus Bikes II", "question__title_slug": "campus-bikes-ii", "question__hide": false, - "total_acs": 2536, - "total_submitted": 5175, + "total_acs": 2542, + "total_submitted": 5184, "total_column_articles": 52, "frontend_question_id": "1066", "is_new_question": false @@ -33402,9 +33633,9 @@ "question__title": "Fixed Point", "question__title_slug": "fixed-point", "question__hide": false, - "total_acs": 5503, - "total_submitted": 8492, - "total_column_articles": 80, + "total_acs": 5535, + "total_submitted": 8539, + "total_column_articles": 84, "frontend_question_id": "1064", "is_new_question": false }, @@ -33423,8 +33654,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": 6259, - "total_submitted": 10776, + "total_acs": 6292, + "total_submitted": 10852, "total_column_articles": 100, "frontend_question_id": "1016", "is_new_question": false @@ -33444,8 +33675,8 @@ "question__title": "Smallest Integer Divisible by K", "question__title_slug": "smallest-integer-divisible-by-k", "question__hide": false, - "total_acs": 5715, - "total_submitted": 15708, + "total_acs": 5745, + "total_submitted": 15832, "total_column_articles": 47, "frontend_question_id": "1015", "is_new_question": false @@ -33465,9 +33696,9 @@ "question__title": "Best Sightseeing Pair", "question__title_slug": "best-sightseeing-pair", "question__hide": false, - "total_acs": 52454, - "total_submitted": 93003, - "total_column_articles": 596, + "total_acs": 52708, + "total_submitted": 93500, + "total_column_articles": 598, "frontend_question_id": "1014", "is_new_question": false }, @@ -33486,9 +33717,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": 51625, - "total_submitted": 131731, - "total_column_articles": 966, + "total_acs": 51838, + "total_submitted": 132327, + "total_column_articles": 969, "frontend_question_id": "1013", "is_new_question": false }, @@ -33507,8 +33738,8 @@ "question__title": "Number of Valid Subarrays", "question__title_slug": "number-of-valid-subarrays", "question__hide": false, - "total_acs": 2317, - "total_submitted": 3215, + "total_acs": 2350, + "total_submitted": 3251, "total_column_articles": 49, "frontend_question_id": "1063", "is_new_question": false @@ -33528,9 +33759,9 @@ "question__title": "Longest Repeating Substring", "question__title_slug": "longest-repeating-substring", "question__hide": false, - "total_acs": 4525, - "total_submitted": 8105, - "total_column_articles": 63, + "total_acs": 4590, + "total_submitted": 8222, + "total_column_articles": 64, "frontend_question_id": "1062", "is_new_question": false }, @@ -33549,9 +33780,9 @@ "question__title": "Missing Element in Sorted Array", "question__title_slug": "missing-element-in-sorted-array", "question__hide": false, - "total_acs": 7539, - "total_submitted": 14130, - "total_column_articles": 116, + "total_acs": 7702, + "total_submitted": 14462, + "total_column_articles": 120, "frontend_question_id": "1060", "is_new_question": false }, @@ -33570,8 +33801,8 @@ "question__title": "Lexicographically Smallest Equivalent String", "question__title_slug": "lexicographically-smallest-equivalent-string", "question__hide": false, - "total_acs": 3283, - "total_submitted": 5321, + "total_acs": 3310, + "total_submitted": 5355, "total_column_articles": 73, "frontend_question_id": "1061", "is_new_question": false @@ -33591,9 +33822,9 @@ "question__title": "Numbers With Repeated Digits", "question__title_slug": "numbers-with-repeated-digits", "question__hide": false, - "total_acs": 3617, - "total_submitted": 10287, - "total_column_articles": 74, + "total_acs": 3665, + "total_submitted": 10383, + "total_column_articles": 77, "frontend_question_id": "1012", "is_new_question": false }, @@ -33612,9 +33843,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": 73756, - "total_submitted": 118802, - "total_column_articles": 698, + "total_acs": 74464, + "total_submitted": 119966, + "total_column_articles": 704, "frontend_question_id": "1011", "is_new_question": false }, @@ -33633,8 +33864,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": 20275, - "total_submitted": 44245, + "total_acs": 20343, + "total_submitted": 44407, "total_column_articles": 270, "frontend_question_id": "1010", "is_new_question": false @@ -33654,9 +33885,9 @@ "question__title": "Complement of Base 10 Integer", "question__title_slug": "complement-of-base-10-integer", "question__hide": false, - "total_acs": 18501, - "total_submitted": 31390, - "total_column_articles": 268, + "total_acs": 18620, + "total_submitted": 31575, + "total_column_articles": 270, "frontend_question_id": "1009", "is_new_question": false }, @@ -33675,8 +33906,8 @@ "question__title": "Minimize Rounding Error to Meet Target", "question__title_slug": "minimize-rounding-error-to-meet-target", "question__hide": false, - "total_acs": 1539, - "total_submitted": 4389, + "total_acs": 1549, + "total_submitted": 4414, "total_column_articles": 42, "frontend_question_id": "1058", "is_new_question": false @@ -33696,9 +33927,9 @@ "question__title": "Campus Bikes", "question__title_slug": "campus-bikes", "question__hide": false, - "total_acs": 3536, - "total_submitted": 7255, - "total_column_articles": 47, + "total_acs": 3561, + "total_submitted": 7301, + "total_column_articles": 48, "frontend_question_id": "1057", "is_new_question": false }, @@ -33717,9 +33948,9 @@ "question__title": "Shortest Way to Form String", "question__title_slug": "shortest-way-to-form-string", "question__hide": false, - "total_acs": 6561, - "total_submitted": 10890, - "total_column_articles": 118, + "total_acs": 6647, + "total_submitted": 11029, + "total_column_articles": 119, "frontend_question_id": "1055", "is_new_question": false }, @@ -33738,9 +33969,9 @@ "question__title": "Construct Binary Search Tree from Preorder Traversal", "question__title_slug": "construct-binary-search-tree-from-preorder-traversal", "question__hide": false, - "total_acs": 21710, - "total_submitted": 30070, - "total_column_articles": 279, + "total_acs": 21927, + "total_submitted": 30410, + "total_column_articles": 283, "frontend_question_id": "1008", "is_new_question": false }, @@ -33759,8 +33990,8 @@ "question__title": "Minimum Domino Rotations For Equal Row", "question__title_slug": "minimum-domino-rotations-for-equal-row", "question__hide": false, - "total_acs": 7382, - "total_submitted": 15669, + "total_acs": 7416, + "total_submitted": 15750, "total_column_articles": 102, "frontend_question_id": "1007", "is_new_question": false @@ -33780,9 +34011,9 @@ "question__title": "Clumsy Factorial", "question__title_slug": "clumsy-factorial", "question__hide": false, - "total_acs": 45684, - "total_submitted": 72866, - "total_column_articles": 624, + "total_acs": 45736, + "total_submitted": 72951, + "total_column_articles": 625, "frontend_question_id": "1006", "is_new_question": false }, @@ -33801,9 +34032,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": 79423, - "total_submitted": 153832, - "total_column_articles": 1135, + "total_acs": 80745, + "total_submitted": 156392, + "total_column_articles": 1149, "frontend_question_id": "1005", "is_new_question": false }, @@ -33822,9 +34053,9 @@ "question__title": "Max Consecutive Ones III", "question__title_slug": "max-consecutive-ones-iii", "question__hide": false, - "total_acs": 86552, - "total_submitted": 144310, - "total_column_articles": 862, + "total_acs": 87586, + "total_submitted": 145958, + "total_column_articles": 869, "frontend_question_id": "1004", "is_new_question": false }, @@ -33843,9 +34074,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": 13643, - "total_submitted": 23497, - "total_column_articles": 211, + "total_acs": 13711, + "total_submitted": 23609, + "total_column_articles": 212, "frontend_question_id": "1003", "is_new_question": false }, @@ -33864,9 +34095,9 @@ "question__title": "Find Common Characters", "question__title_slug": "find-common-characters", "question__hide": false, - "total_acs": 65578, - "total_submitted": 90745, - "total_column_articles": 678, + "total_acs": 65942, + "total_submitted": 91324, + "total_column_articles": 681, "frontend_question_id": "1002", "is_new_question": false }, @@ -33885,9 +34116,9 @@ "question__title": "Grid Illumination", "question__title_slug": "grid-illumination", "question__hide": false, - "total_acs": 18393, - "total_submitted": 40839, - "total_column_articles": 267, + "total_acs": 18412, + "total_submitted": 40876, + "total_column_articles": 268, "frontend_question_id": "1001", "is_new_question": false }, @@ -33906,8 +34137,8 @@ "question__title": "Minimum Cost to Merge Stones", "question__title_slug": "minimum-cost-to-merge-stones", "question__hide": false, - "total_acs": 4614, - "total_submitted": 10728, + "total_acs": 4659, + "total_submitted": 10817, "total_column_articles": 51, "frontend_question_id": "1000", "is_new_question": false @@ -33927,9 +34158,9 @@ "question__title": "Available Captures for Rook", "question__title_slug": "available-captures-for-rook", "question__hide": false, - "total_acs": 32072, - "total_submitted": 46368, - "total_column_articles": 591, + "total_acs": 32136, + "total_submitted": 46461, + "total_column_articles": 590, "frontend_question_id": "999", "is_new_question": false }, @@ -33948,9 +34179,9 @@ "question__title": "Maximum Binary Tree II", "question__title_slug": "maximum-binary-tree-ii", "question__hide": false, - "total_acs": 8749, - "total_submitted": 14072, - "total_column_articles": 134, + "total_acs": 8796, + "total_submitted": 14155, + "total_column_articles": 135, "frontend_question_id": "998", "is_new_question": false }, @@ -33969,9 +34200,9 @@ "question__title": "Find the Town Judge", "question__title_slug": "find-the-town-judge", "question__hide": false, - "total_acs": 70797, - "total_submitted": 133391, - "total_column_articles": 738, + "total_acs": 71331, + "total_submitted": 134405, + "total_column_articles": 746, "frontend_question_id": "997", "is_new_question": false }, @@ -33990,9 +34221,9 @@ "question__title": "Number of Squareful Arrays", "question__title_slug": "number-of-squareful-arrays", "question__hide": false, - "total_acs": 5204, - "total_submitted": 10638, - "total_column_articles": 102, + "total_acs": 5241, + "total_submitted": 10706, + "total_column_articles": 104, "frontend_question_id": "996", "is_new_question": false }, @@ -34011,9 +34242,9 @@ "question__title": "Minimum Number of K Consecutive Bit Flips", "question__title_slug": "minimum-number-of-k-consecutive-bit-flips", "question__hide": false, - "total_acs": 22854, - "total_submitted": 42831, - "total_column_articles": 261, + "total_acs": 22938, + "total_submitted": 42957, + "total_column_articles": 262, "frontend_question_id": "995", "is_new_question": false }, @@ -34032,9 +34263,9 @@ "question__title": "Rotting Oranges", "question__title_slug": "rotting-oranges", "question__hide": false, - "total_acs": 78646, - "total_submitted": 154172, - "total_column_articles": 1719, + "total_acs": 79705, + "total_submitted": 156089, + "total_column_articles": 1732, "frontend_question_id": "994", "is_new_question": false }, @@ -34053,9 +34284,9 @@ "question__title": "Cousins in Binary Tree", "question__title_slug": "cousins-in-binary-tree", "question__hide": false, - "total_acs": 56309, - "total_submitted": 101245, - "total_column_articles": 884, + "total_acs": 56643, + "total_submitted": 101841, + "total_column_articles": 892, "frontend_question_id": "993", "is_new_question": false }, @@ -34074,9 +34305,9 @@ "question__title": "Subarrays with K Different Integers", "question__title_slug": "subarrays-with-k-different-integers", "question__hide": false, - "total_acs": 26293, - "total_submitted": 56962, - "total_column_articles": 299, + "total_acs": 26404, + "total_submitted": 57167, + "total_column_articles": 301, "frontend_question_id": "992", "is_new_question": false }, @@ -34095,9 +34326,9 @@ "question__title": "Broken Calculator", "question__title_slug": "broken-calculator", "question__hide": false, - "total_acs": 10020, - "total_submitted": 19179, - "total_column_articles": 122, + "total_acs": 10067, + "total_submitted": 19267, + "total_column_articles": 123, "frontend_question_id": "991", "is_new_question": false }, @@ -34116,9 +34347,9 @@ "question__title": "Satisfiability of Equality Equations", "question__title_slug": "satisfiability-of-equality-equations", "question__hide": false, - "total_acs": 40231, - "total_submitted": 77840, - "total_column_articles": 591, + "total_acs": 40554, + "total_submitted": 78366, + "total_column_articles": 600, "frontend_question_id": "990", "is_new_question": false }, @@ -34137,9 +34368,9 @@ "question__title": "Add to Array-Form of Integer", "question__title_slug": "add-to-array-form-of-integer", "question__hide": false, - "total_acs": 59918, - "total_submitted": 127661, - "total_column_articles": 671, + "total_acs": 60262, + "total_submitted": 128431, + "total_column_articles": 675, "frontend_question_id": "989", "is_new_question": false }, @@ -34158,9 +34389,9 @@ "question__title": "Smallest String Starting From Leaf", "question__title_slug": "smallest-string-starting-from-leaf", "question__hide": false, - "total_acs": 11396, - "total_submitted": 22645, - "total_column_articles": 136, + "total_acs": 11483, + "total_submitted": 22798, + "total_column_articles": 139, "frontend_question_id": "988", "is_new_question": false }, @@ -34179,9 +34410,9 @@ "question__title": "Vertical Order Traversal of a Binary Tree", "question__title_slug": "vertical-order-traversal-of-a-binary-tree", "question__hide": false, - "total_acs": 26412, - "total_submitted": 49452, - "total_column_articles": 447, + "total_acs": 26610, + "total_submitted": 49763, + "total_column_articles": 449, "frontend_question_id": "987", "is_new_question": false }, @@ -34200,9 +34431,9 @@ "question__title": "Interval List Intersections", "question__title_slug": "interval-list-intersections", "question__hide": false, - "total_acs": 41874, - "total_submitted": 61259, - "total_column_articles": 400, + "total_acs": 42642, + "total_submitted": 62428, + "total_column_articles": 409, "frontend_question_id": "986", "is_new_question": false }, @@ -34221,8 +34452,8 @@ "question__title": "Sum of Even Numbers After Queries", "question__title_slug": "sum-of-even-numbers-after-queries", "question__hide": false, - "total_acs": 17330, - "total_submitted": 28741, + "total_acs": 17388, + "total_submitted": 28828, "total_column_articles": 200, "frontend_question_id": "985", "is_new_question": false @@ -34242,9 +34473,9 @@ "question__title": "String Without AAA or BBB", "question__title_slug": "string-without-aaa-or-bbb", "question__hide": false, - "total_acs": 10418, - "total_submitted": 24617, - "total_column_articles": 170, + "total_acs": 10461, + "total_submitted": 24698, + "total_column_articles": 171, "frontend_question_id": "984", "is_new_question": false }, @@ -34263,9 +34494,9 @@ "question__title": "Minimum Cost For Tickets", "question__title_slug": "minimum-cost-for-tickets", "question__hide": false, - "total_acs": 36059, - "total_submitted": 56912, - "total_column_articles": 489, + "total_acs": 36198, + "total_submitted": 57106, + "total_column_articles": 490, "frontend_question_id": "983", "is_new_question": false }, @@ -34284,8 +34515,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": 3067, - "total_submitted": 5497, + "total_acs": 3086, + "total_submitted": 5530, "total_column_articles": 40, "frontend_question_id": "982", "is_new_question": false @@ -34305,9 +34536,9 @@ "question__title": "Time Based Key-Value Store", "question__title_slug": "time-based-key-value-store", "question__hide": false, - "total_acs": 23478, - "total_submitted": 44249, - "total_column_articles": 340, + "total_acs": 23638, + "total_submitted": 44506, + "total_column_articles": 345, "frontend_question_id": "981", "is_new_question": false }, @@ -34326,9 +34557,9 @@ "question__title": "Unique Paths III", "question__title_slug": "unique-paths-iii", "question__hide": false, - "total_acs": 16643, - "total_submitted": 22655, - "total_column_articles": 247, + "total_acs": 16727, + "total_submitted": 22760, + "total_column_articles": 248, "frontend_question_id": "980", "is_new_question": false }, @@ -34347,9 +34578,9 @@ "question__title": "Distribute Coins in Binary Tree", "question__title_slug": "distribute-coins-in-binary-tree", "question__hide": false, - "total_acs": 10154, - "total_submitted": 14154, - "total_column_articles": 157, + "total_acs": 10248, + "total_submitted": 14270, + "total_column_articles": 158, "frontend_question_id": "979", "is_new_question": false }, @@ -34368,9 +34599,9 @@ "question__title": "Longest Turbulent Subarray", "question__title_slug": "longest-turbulent-subarray", "question__hide": false, - "total_acs": 46072, - "total_submitted": 97406, - "total_column_articles": 626, + "total_acs": 46484, + "total_submitted": 98090, + "total_column_articles": 634, "frontend_question_id": "978", "is_new_question": false }, @@ -34389,9 +34620,9 @@ "question__title": "Squares of a Sorted Array", "question__title_slug": "squares-of-a-sorted-array", "question__hide": false, - "total_acs": 314379, - "total_submitted": 455600, - "total_column_articles": 2200, + "total_acs": 320070, + "total_submitted": 463983, + "total_column_articles": 2221, "frontend_question_id": "977", "is_new_question": false }, @@ -34410,9 +34641,9 @@ "question__title": "Largest Perimeter Triangle", "question__title_slug": "largest-perimeter-triangle", "question__hide": false, - "total_acs": 65390, - "total_submitted": 111109, - "total_column_articles": 645, + "total_acs": 65921, + "total_submitted": 112087, + "total_column_articles": 651, "frontend_question_id": "976", "is_new_question": false }, @@ -34431,9 +34662,9 @@ "question__title": "Odd Even Jump", "question__title_slug": "odd-even-jump", "question__hide": false, - "total_acs": 3851, - "total_submitted": 8444, - "total_column_articles": 61, + "total_acs": 3886, + "total_submitted": 8543, + "total_column_articles": 63, "frontend_question_id": "975", "is_new_question": false }, @@ -34452,9 +34683,9 @@ "question__title": "Subarray Sums Divisible by K", "question__title_slug": "subarray-sums-divisible-by-k", "question__hide": false, - "total_acs": 44897, - "total_submitted": 95302, - "total_column_articles": 436, + "total_acs": 45260, + "total_submitted": 96075, + "total_column_articles": 439, "frontend_question_id": "974", "is_new_question": false }, @@ -34473,9 +34704,9 @@ "question__title": "K Closest Points to Origin", "question__title_slug": "k-closest-points-to-origin", "question__hide": false, - "total_acs": 78369, - "total_submitted": 121094, - "total_column_articles": 704, + "total_acs": 78917, + "total_submitted": 121938, + "total_column_articles": 708, "frontend_question_id": "973", "is_new_question": false }, @@ -34494,9 +34725,9 @@ "question__title": "Fibonacci Number", "question__title_slug": "fibonacci-number", "question__hide": false, - "total_acs": 375193, - "total_submitted": 563071, - "total_column_articles": 2322, + "total_acs": 379825, + "total_submitted": 570088, + "total_column_articles": 2355, "frontend_question_id": "509", "is_new_question": false }, @@ -34515,8 +34746,8 @@ "question__title": "Equal Rational Numbers", "question__title_slug": "equal-rational-numbers", "question__hide": false, - "total_acs": 1580, - "total_submitted": 3896, + "total_acs": 1593, + "total_submitted": 3926, "total_column_articles": 39, "frontend_question_id": "972", "is_new_question": false @@ -34536,9 +34767,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": 8151, - "total_submitted": 18200, - "total_column_articles": 128, + "total_acs": 8193, + "total_submitted": 18323, + "total_column_articles": 130, "frontend_question_id": "971", "is_new_question": false }, @@ -34557,9 +34788,9 @@ "question__title": "Powerful Integers", "question__title_slug": "powerful-integers", "question__hide": false, - "total_acs": 12078, - "total_submitted": 29306, - "total_column_articles": 137, + "total_acs": 12115, + "total_submitted": 29394, + "total_column_articles": 138, "frontend_question_id": "970", "is_new_question": false }, @@ -34578,9 +34809,9 @@ "question__title": "Pancake Sorting", "question__title_slug": "pancake-sorting", "question__hide": false, - "total_acs": 41036, - "total_submitted": 60461, - "total_column_articles": 598, + "total_acs": 41235, + "total_submitted": 60747, + "total_column_articles": 600, "frontend_question_id": "969", "is_new_question": false }, @@ -34599,9 +34830,9 @@ "question__title": "Binary Tree Cameras", "question__title_slug": "binary-tree-cameras", "question__hide": false, - "total_acs": 34926, - "total_submitted": 68453, - "total_column_articles": 423, + "total_acs": 35577, + "total_submitted": 69694, + "total_column_articles": 428, "frontend_question_id": "968", "is_new_question": false }, @@ -34620,9 +34851,9 @@ "question__title": "Numbers With Same Consecutive Differences", "question__title_slug": "numbers-with-same-consecutive-differences", "question__hide": false, - "total_acs": 9220, - "total_submitted": 19133, - "total_column_articles": 182, + "total_acs": 9328, + "total_submitted": 19350, + "total_column_articles": 183, "frontend_question_id": "967", "is_new_question": false }, @@ -34641,9 +34872,9 @@ "question__title": "Vowel Spellchecker", "question__title_slug": "vowel-spellchecker", "question__hide": false, - "total_acs": 3553, - "total_submitted": 8576, - "total_column_articles": 55, + "total_acs": 3566, + "total_submitted": 8623, + "total_column_articles": 56, "frontend_question_id": "966", "is_new_question": false }, @@ -34662,9 +34893,9 @@ "question__title": "Univalued Binary Tree", "question__title_slug": "univalued-binary-tree", "question__hide": false, - "total_acs": 39848, - "total_submitted": 58016, - "total_column_articles": 476, + "total_acs": 40242, + "total_submitted": 58555, + "total_column_articles": 481, "frontend_question_id": "965", "is_new_question": false }, @@ -34683,8 +34914,8 @@ "question__title": "Least Operators to Express Number", "question__title_slug": "least-operators-to-express-number", "question__hide": false, - "total_acs": 1714, - "total_submitted": 3859, + "total_acs": 1729, + "total_submitted": 3891, "total_column_articles": 32, "frontend_question_id": "964", "is_new_question": false @@ -34704,8 +34935,8 @@ "question__title": "Minimum Area Rectangle II", "question__title_slug": "minimum-area-rectangle-ii", "question__hide": false, - "total_acs": 2936, - "total_submitted": 5762, + "total_acs": 2955, + "total_submitted": 5799, "total_column_articles": 37, "frontend_question_id": "963", "is_new_question": false @@ -34725,9 +34956,9 @@ "question__title": "Maximum Width Ramp", "question__title_slug": "maximum-width-ramp", "question__hide": false, - "total_acs": 16534, - "total_submitted": 36669, - "total_column_articles": 162, + "total_acs": 16659, + "total_submitted": 36935, + "total_column_articles": 163, "frontend_question_id": "962", "is_new_question": false }, @@ -34746,9 +34977,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": 40563, - "total_submitted": 59980, - "total_column_articles": 351, + "total_acs": 40713, + "total_submitted": 60184, + "total_column_articles": 355, "frontend_question_id": "961", "is_new_question": false }, @@ -34767,8 +34998,8 @@ "question__title": "Delete Columns to Make Sorted III", "question__title_slug": "delete-columns-to-make-sorted-iii", "question__hide": false, - "total_acs": 2493, - "total_submitted": 4344, + "total_acs": 2512, + "total_submitted": 4368, "total_column_articles": 41, "frontend_question_id": "960", "is_new_question": false @@ -34788,9 +35019,9 @@ "question__title": "Regions Cut By Slashes", "question__title_slug": "regions-cut-by-slashes", "question__hide": false, - "total_acs": 20845, - "total_submitted": 28096, - "total_column_articles": 321, + "total_acs": 20927, + "total_submitted": 28197, + "total_column_articles": 322, "frontend_question_id": "959", "is_new_question": false }, @@ -34809,9 +35040,9 @@ "question__title": "Check Completeness of a Binary Tree", "question__title_slug": "check-completeness-of-a-binary-tree", "question__hide": false, - "total_acs": 34594, - "total_submitted": 63761, - "total_column_articles": 326, + "total_acs": 35089, + "total_submitted": 64622, + "total_column_articles": 332, "frontend_question_id": "958", "is_new_question": false }, @@ -34830,9 +35061,9 @@ "question__title": "Prison Cells After N Days", "question__title_slug": "prison-cells-after-n-days", "question__hide": false, - "total_acs": 15989, - "total_submitted": 44032, - "total_column_articles": 153, + "total_acs": 16077, + "total_submitted": 44191, + "total_column_articles": 154, "frontend_question_id": "957", "is_new_question": false }, @@ -34851,8 +35082,8 @@ "question__title": "Tallest Billboard", "question__title_slug": "tallest-billboard", "question__hide": false, - "total_acs": 4829, - "total_submitted": 10847, + "total_acs": 4865, + "total_submitted": 10898, "total_column_articles": 60, "frontend_question_id": "956", "is_new_question": false @@ -34872,9 +35103,9 @@ "question__title": "Delete Columns to Make Sorted II", "question__title_slug": "delete-columns-to-make-sorted-ii", "question__hide": false, - "total_acs": 4011, - "total_submitted": 11744, - "total_column_articles": 69, + "total_acs": 4048, + "total_submitted": 11829, + "total_column_articles": 70, "frontend_question_id": "955", "is_new_question": false }, @@ -34893,9 +35124,9 @@ "question__title": "Array of Doubled Pairs", "question__title_slug": "array-of-doubled-pairs", "question__hide": false, - "total_acs": 39578, - "total_submitted": 101729, - "total_column_articles": 449, + "total_acs": 39847, + "total_submitted": 102515, + "total_column_articles": 452, "frontend_question_id": "954", "is_new_question": false }, @@ -34914,9 +35145,9 @@ "question__title": "Verifying an Alien Dictionary", "question__title_slug": "verifying-an-alien-dictionary", "question__hide": false, - "total_acs": 20043, - "total_submitted": 36222, - "total_column_articles": 249, + "total_acs": 20305, + "total_submitted": 36669, + "total_column_articles": 254, "frontend_question_id": "953", "is_new_question": false }, @@ -34935,8 +35166,8 @@ "question__title": "Largest Component Size by Common Factor", "question__title_slug": "largest-component-size-by-common-factor", "question__hide": false, - "total_acs": 3807, - "total_submitted": 10321, + "total_acs": 3823, + "total_submitted": 10353, "total_column_articles": 70, "frontend_question_id": "952", "is_new_question": false @@ -34956,9 +35187,9 @@ "question__title": "Flip Equivalent Binary Trees", "question__title_slug": "flip-equivalent-binary-trees", "question__hide": false, - "total_acs": 13337, - "total_submitted": 20105, - "total_column_articles": 195, + "total_acs": 13448, + "total_submitted": 20266, + "total_column_articles": 197, "frontend_question_id": "951", "is_new_question": false }, @@ -34977,9 +35208,9 @@ "question__title": "Reveal Cards In Increasing Order", "question__title_slug": "reveal-cards-in-increasing-order", "question__hide": false, - "total_acs": 11284, - "total_submitted": 14458, - "total_column_articles": 179, + "total_acs": 11335, + "total_submitted": 14517, + "total_column_articles": 181, "frontend_question_id": "950", "is_new_question": false }, @@ -34998,9 +35229,9 @@ "question__title": "Largest Time for Given Digits", "question__title_slug": "largest-time-for-given-digits", "question__hide": false, - "total_acs": 9515, - "total_submitted": 25427, - "total_column_articles": 144, + "total_acs": 9572, + "total_submitted": 25566, + "total_column_articles": 145, "frontend_question_id": "949", "is_new_question": false }, @@ -35019,9 +35250,9 @@ "question__title": "Bag of Tokens", "question__title_slug": "bag-of-tokens", "question__hide": false, - "total_acs": 7784, - "total_submitted": 19653, - "total_column_articles": 113, + "total_acs": 7825, + "total_submitted": 19724, + "total_column_articles": 114, "frontend_question_id": "948", "is_new_question": false }, @@ -35040,9 +35271,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": 28145, - "total_submitted": 45989, - "total_column_articles": 359, + "total_acs": 28240, + "total_submitted": 46188, + "total_column_articles": 360, "frontend_question_id": "947", "is_new_question": false }, @@ -35061,9 +35292,9 @@ "question__title": "Validate Stack Sequences", "question__title_slug": "validate-stack-sequences", "question__hide": false, - "total_acs": 35007, - "total_submitted": 55175, - "total_column_articles": 378, + "total_acs": 35491, + "total_submitted": 55884, + "total_column_articles": 380, "frontend_question_id": "946", "is_new_question": false }, @@ -35082,9 +35313,9 @@ "question__title": "Minimum Increment to Make Array Unique", "question__title_slug": "minimum-increment-to-make-array-unique", "question__hide": false, - "total_acs": 38060, - "total_submitted": 78820, - "total_column_articles": 565, + "total_acs": 38155, + "total_submitted": 78999, + "total_column_articles": 566, "frontend_question_id": "945", "is_new_question": false }, @@ -35103,9 +35334,9 @@ "question__title": "Delete Columns to Make Sorted", "question__title_slug": "delete-columns-to-make-sorted", "question__hide": false, - "total_acs": 23507, - "total_submitted": 34359, - "total_column_articles": 206, + "total_acs": 23629, + "total_submitted": 34536, + "total_column_articles": 209, "frontend_question_id": "944", "is_new_question": false }, @@ -35124,9 +35355,9 @@ "question__title": "Find the Shortest Superstring", "question__title_slug": "find-the-shortest-superstring", "question__hide": false, - "total_acs": 2377, - "total_submitted": 5142, - "total_column_articles": 52, + "total_acs": 2409, + "total_submitted": 5216, + "total_column_articles": 53, "frontend_question_id": "943", "is_new_question": false }, @@ -35145,9 +35376,9 @@ "question__title": "DI String Match", "question__title_slug": "di-string-match", "question__hide": false, - "total_acs": 26231, - "total_submitted": 35745, - "total_column_articles": 260, + "total_acs": 26422, + "total_submitted": 35991, + "total_column_articles": 263, "frontend_question_id": "942", "is_new_question": false }, @@ -35166,9 +35397,9 @@ "question__title": "Valid Mountain Array", "question__title_slug": "valid-mountain-array", "question__hide": false, - "total_acs": 66613, - "total_submitted": 169409, - "total_column_articles": 670, + "total_acs": 66835, + "total_submitted": 169980, + "total_column_articles": 672, "frontend_question_id": "941", "is_new_question": false }, @@ -35187,8 +35418,8 @@ "question__title": "Distinct Subsequences II", "question__title_slug": "distinct-subsequences-ii", "question__hide": false, - "total_acs": 6014, - "total_submitted": 14039, + "total_acs": 6065, + "total_submitted": 14142, "total_column_articles": 72, "frontend_question_id": "940", "is_new_question": false @@ -35208,9 +35439,9 @@ "question__title": "Minimum Area Rectangle", "question__title_slug": "minimum-area-rectangle", "question__hide": false, - "total_acs": 6762, - "total_submitted": 14456, - "total_column_articles": 74, + "total_acs": 6822, + "total_submitted": 14572, + "total_column_articles": 76, "frontend_question_id": "939", "is_new_question": false }, @@ -35229,9 +35460,9 @@ "question__title": "Range Sum of BST", "question__title_slug": "range-sum-of-bst", "question__hide": false, - "total_acs": 107018, - "total_submitted": 130427, - "total_column_articles": 884, + "total_acs": 107438, + "total_submitted": 130931, + "total_column_articles": 888, "frontend_question_id": "938", "is_new_question": false }, @@ -35250,9 +35481,9 @@ "question__title": "Reorder Data in Log Files", "question__title_slug": "reorder-data-in-log-files", "question__hide": false, - "total_acs": 15067, - "total_submitted": 25544, - "total_column_articles": 160, + "total_acs": 15236, + "total_submitted": 25804, + "total_column_articles": 162, "frontend_question_id": "937", "is_new_question": false }, @@ -35271,9 +35502,9 @@ "question__title": "Stamping The Sequence", "question__title_slug": "stamping-the-sequence", "question__hide": false, - "total_acs": 1887, - "total_submitted": 4775, - "total_column_articles": 32, + "total_acs": 1952, + "total_submitted": 4865, + "total_column_articles": 33, "frontend_question_id": "936", "is_new_question": false }, @@ -35292,9 +35523,9 @@ "question__title": "Knight Dialer", "question__title_slug": "knight-dialer", "question__hide": false, - "total_acs": 7449, - "total_submitted": 15249, - "total_column_articles": 106, + "total_acs": 7492, + "total_submitted": 15317, + "total_column_articles": 107, "frontend_question_id": "935", "is_new_question": false }, @@ -35313,9 +35544,9 @@ "question__title": "Shortest Bridge", "question__title_slug": "shortest-bridge", "question__hide": false, - "total_acs": 31613, - "total_submitted": 66360, - "total_column_articles": 373, + "total_acs": 31963, + "total_submitted": 67024, + "total_column_articles": 381, "frontend_question_id": "934", "is_new_question": false }, @@ -35334,9 +35565,9 @@ "question__title": "Number of Recent Calls", "question__title_slug": "number-of-recent-calls", "question__hide": false, - "total_acs": 45537, - "total_submitted": 62399, - "total_column_articles": 395, + "total_acs": 45934, + "total_submitted": 62910, + "total_column_articles": 401, "frontend_question_id": "933", "is_new_question": false }, @@ -35355,8 +35586,8 @@ "question__title": "Beautiful Array", "question__title_slug": "beautiful-array", "question__hide": false, - "total_acs": 10283, - "total_submitted": 16018, + "total_acs": 10344, + "total_submitted": 16110, "total_column_articles": 100, "frontend_question_id": "932", "is_new_question": false @@ -35376,9 +35607,9 @@ "question__title": "Minimum Falling Path Sum", "question__title_slug": "minimum-falling-path-sum", "question__hide": false, - "total_acs": 36921, - "total_submitted": 55013, - "total_column_articles": 453, + "total_acs": 37513, + "total_submitted": 55864, + "total_column_articles": 462, "frontend_question_id": "931", "is_new_question": false }, @@ -35397,8 +35628,8 @@ "question__title": "Binary Subarrays With Sum", "question__title_slug": "binary-subarrays-with-sum", "question__hide": false, - "total_acs": 37412, - "total_submitted": 68445, + "total_acs": 37532, + "total_submitted": 68659, "total_column_articles": 372, "frontend_question_id": "930", "is_new_question": false @@ -35418,9 +35649,9 @@ "question__title": "Unique Email Addresses", "question__title_slug": "unique-email-addresses", "question__hide": false, - "total_acs": 28699, - "total_submitted": 44481, - "total_column_articles": 257, + "total_acs": 28810, + "total_submitted": 44642, + "total_column_articles": 258, "frontend_question_id": "929", "is_new_question": false }, @@ -35439,9 +35670,9 @@ "question__title": "Minimize Malware Spread II", "question__title_slug": "minimize-malware-spread-ii", "question__hide": false, - "total_acs": 2690, - "total_submitted": 6253, - "total_column_articles": 55, + "total_acs": 2719, + "total_submitted": 6307, + "total_column_articles": 57, "frontend_question_id": "928", "is_new_question": false }, @@ -35460,8 +35691,8 @@ "question__title": "Three Equal Parts", "question__title_slug": "three-equal-parts", "question__hide": false, - "total_acs": 3970, - "total_submitted": 11490, + "total_acs": 3989, + "total_submitted": 11532, "total_column_articles": 81, "frontend_question_id": "927", "is_new_question": false @@ -35481,9 +35712,9 @@ "question__title": "Flip String to Monotone Increasing", "question__title_slug": "flip-string-to-monotone-increasing", "question__hide": false, - "total_acs": 9788, - "total_submitted": 17644, - "total_column_articles": 177, + "total_acs": 9940, + "total_submitted": 17863, + "total_column_articles": 179, "frontend_question_id": "926", "is_new_question": false }, @@ -35502,9 +35733,9 @@ "question__title": "Long Pressed Name", "question__title_slug": "long-pressed-name", "question__hide": false, - "total_acs": 54066, - "total_submitted": 140923, - "total_column_articles": 723, + "total_acs": 54251, + "total_submitted": 141424, + "total_column_articles": 725, "frontend_question_id": "925", "is_new_question": false }, @@ -35523,9 +35754,9 @@ "question__title": "Minimize Malware Spread", "question__title_slug": "minimize-malware-spread", "question__hide": false, - "total_acs": 7736, - "total_submitted": 21518, - "total_column_articles": 115, + "total_acs": 7827, + "total_submitted": 21801, + "total_column_articles": 117, "frontend_question_id": "924", "is_new_question": false }, @@ -35544,9 +35775,9 @@ "question__title": "3Sum With Multiplicity", "question__title_slug": "3sum-with-multiplicity", "question__hide": false, - "total_acs": 7535, - "total_submitted": 21393, - "total_column_articles": 92, + "total_acs": 7587, + "total_submitted": 21511, + "total_column_articles": 93, "frontend_question_id": "923", "is_new_question": false }, @@ -35565,9 +35796,9 @@ "question__title": "Sort Array By Parity II", "question__title_slug": "sort-array-by-parity-ii", "question__hide": false, - "total_acs": 96362, - "total_submitted": 135120, - "total_column_articles": 908, + "total_acs": 96742, + "total_submitted": 135661, + "total_column_articles": 913, "frontend_question_id": "922", "is_new_question": false }, @@ -35586,9 +35817,9 @@ "question__title": "Minimum Add to Make Parentheses Valid", "question__title_slug": "minimum-add-to-make-parentheses-valid", "question__hide": false, - "total_acs": 28614, - "total_submitted": 38223, - "total_column_articles": 400, + "total_acs": 29114, + "total_submitted": 38913, + "total_column_articles": 406, "frontend_question_id": "921", "is_new_question": false }, @@ -35607,8 +35838,8 @@ "question__title": "Number of Music Playlists", "question__title_slug": "number-of-music-playlists", "question__hide": false, - "total_acs": 2261, - "total_submitted": 4541, + "total_acs": 2276, + "total_submitted": 4567, "total_column_articles": 27, "frontend_question_id": "920", "is_new_question": false @@ -35628,9 +35859,9 @@ "question__title": "Complete Binary Tree Inserter", "question__title_slug": "complete-binary-tree-inserter", "question__hide": false, - "total_acs": 7574, - "total_submitted": 11493, - "total_column_articles": 132, + "total_acs": 7671, + "total_submitted": 11643, + "total_column_articles": 134, "frontend_question_id": "919", "is_new_question": false }, @@ -35649,9 +35880,9 @@ "question__title": "Maximum Sum Circular Subarray", "question__title_slug": "maximum-sum-circular-subarray", "question__hide": false, - "total_acs": 39244, - "total_submitted": 106495, - "total_column_articles": 376, + "total_acs": 39681, + "total_submitted": 107629, + "total_column_articles": 379, "frontend_question_id": "918", "is_new_question": false }, @@ -35670,9 +35901,9 @@ "question__title": "Reverse Only Letters", "question__title_slug": "reverse-only-letters", "question__hide": false, - "total_acs": 67085, - "total_submitted": 111319, - "total_column_articles": 937, + "total_acs": 67331, + "total_submitted": 111721, + "total_column_articles": 938, "frontend_question_id": "917", "is_new_question": false }, @@ -35691,9 +35922,9 @@ "question__title": "Word Subsets", "question__title_slug": "word-subsets", "question__hide": false, - "total_acs": 7304, - "total_submitted": 16251, - "total_column_articles": 92, + "total_acs": 7355, + "total_submitted": 16332, + "total_column_articles": 94, "frontend_question_id": "916", "is_new_question": false }, @@ -35712,8 +35943,8 @@ "question__title": "Partition Array into Disjoint Intervals", "question__title_slug": "partition-array-into-disjoint-intervals", "question__hide": false, - "total_acs": 11232, - "total_submitted": 24000, + "total_acs": 11376, + "total_submitted": 24272, "total_column_articles": 137, "frontend_question_id": "915", "is_new_question": false @@ -35733,8 +35964,8 @@ "question__title": "X of a Kind in a Deck of Cards", "question__title_slug": "x-of-a-kind-in-a-deck-of-cards", "question__hide": false, - "total_acs": 52642, - "total_submitted": 136406, + "total_acs": 52820, + "total_submitted": 136964, "total_column_articles": 664, "frontend_question_id": "914", "is_new_question": false @@ -35754,8 +35985,8 @@ "question__title": "Cat and Mouse", "question__title_slug": "cat-and-mouse", "question__hide": false, - "total_acs": 16052, - "total_submitted": 26453, + "total_acs": 16082, + "total_submitted": 26533, "total_column_articles": 124, "frontend_question_id": "913", "is_new_question": false @@ -35775,9 +36006,9 @@ "question__title": "Sort an Array", "question__title_slug": "sort-an-array", "question__hide": false, - "total_acs": 351152, - "total_submitted": 631698, - "total_column_articles": 1481, + "total_acs": 356874, + "total_submitted": 642245, + "total_column_articles": 1498, "frontend_question_id": "912", "is_new_question": false }, @@ -35796,8 +36027,8 @@ "question__title": "Online Election", "question__title_slug": "online-election", "question__hide": false, - "total_acs": 27330, - "total_submitted": 50769, + "total_acs": 27564, + "total_submitted": 51163, "total_column_articles": 331, "frontend_question_id": "911", "is_new_question": false @@ -35817,9 +36048,9 @@ "question__title": "Smallest Range II", "question__title_slug": "smallest-range-ii", "question__hide": false, - "total_acs": 8026, - "total_submitted": 24137, - "total_column_articles": 84, + "total_acs": 8367, + "total_submitted": 25059, + "total_column_articles": 87, "frontend_question_id": "910", "is_new_question": false }, @@ -35838,8 +36069,8 @@ "question__title": "Snakes and Ladders", "question__title_slug": "snakes-and-ladders", "question__hide": false, - "total_acs": 17200, - "total_submitted": 37657, + "total_acs": 17247, + "total_submitted": 37770, "total_column_articles": 207, "frontend_question_id": "909", "is_new_question": false @@ -35859,9 +36090,9 @@ "question__title": "Smallest Range I", "question__title_slug": "smallest-range-i", "question__hide": false, - "total_acs": 24300, - "total_submitted": 34692, - "total_column_articles": 234, + "total_acs": 49008, + "total_submitted": 66017, + "total_column_articles": 503, "frontend_question_id": "908", "is_new_question": false }, @@ -35880,9 +36111,9 @@ "question__title": "Sum of Subarray Minimums", "question__title_slug": "sum-of-subarray-minimums", "question__hide": false, - "total_acs": 15250, - "total_submitted": 46173, - "total_column_articles": 159, + "total_acs": 15550, + "total_submitted": 47008, + "total_column_articles": 163, "frontend_question_id": "907", "is_new_question": false }, @@ -35901,9 +36132,9 @@ "question__title": "Super Palindromes", "question__title_slug": "super-palindromes", "question__hide": false, - "total_acs": 2779, - "total_submitted": 9306, - "total_column_articles": 51, + "total_acs": 2814, + "total_submitted": 9498, + "total_column_articles": 53, "frontend_question_id": "906", "is_new_question": false }, @@ -35922,9 +36153,9 @@ "question__title": "Sort Array By Parity", "question__title_slug": "sort-array-by-parity", "question__hide": false, - "total_acs": 66451, - "total_submitted": 94939, - "total_column_articles": 712, + "total_acs": 105164, + "total_submitted": 147466, + "total_column_articles": 1264, "frontend_question_id": "905", "is_new_question": false }, @@ -35943,9 +36174,9 @@ "question__title": "Fruit Into Baskets", "question__title_slug": "fruit-into-baskets", "question__hide": false, - "total_acs": 43683, - "total_submitted": 99623, - "total_column_articles": 561, + "total_acs": 45092, + "total_submitted": 102734, + "total_column_articles": 572, "frontend_question_id": "904", "is_new_question": false }, @@ -35964,8 +36195,8 @@ "question__title": "Valid Permutations for DI Sequence", "question__title_slug": "valid-permutations-for-di-sequence", "question__hide": false, - "total_acs": 3280, - "total_submitted": 5998, + "total_acs": 3293, + "total_submitted": 6014, "total_column_articles": 49, "frontend_question_id": "903", "is_new_question": false @@ -35985,9 +36216,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": 4407, - "total_submitted": 12331, - "total_column_articles": 97, + "total_acs": 4461, + "total_submitted": 12448, + "total_column_articles": 98, "frontend_question_id": "902", "is_new_question": false }, @@ -36006,9 +36237,9 @@ "question__title": "Online Stock Span", "question__title_slug": "online-stock-span", "question__hide": false, - "total_acs": 23985, - "total_submitted": 43082, - "total_column_articles": 281, + "total_acs": 24217, + "total_submitted": 43456, + "total_column_articles": 285, "frontend_question_id": "901", "is_new_question": false }, @@ -36027,9 +36258,9 @@ "question__title": "RLE Iterator", "question__title_slug": "rle-iterator", "question__hide": false, - "total_acs": 4134, - "total_submitted": 8191, - "total_column_articles": 65, + "total_acs": 4172, + "total_submitted": 8258, + "total_column_articles": 66, "frontend_question_id": "900", "is_new_question": false }, @@ -36048,8 +36279,8 @@ "question__title": "Orderly Queue", "question__title_slug": "orderly-queue", "question__hide": false, - "total_acs": 5088, - "total_submitted": 9369, + "total_acs": 5153, + "total_submitted": 9478, "total_column_articles": 56, "frontend_question_id": "899", "is_new_question": false @@ -36069,8 +36300,8 @@ "question__title": "Bitwise ORs of Subarrays", "question__title_slug": "bitwise-ors-of-subarrays", "question__hide": false, - "total_acs": 6298, - "total_submitted": 17889, + "total_acs": 6327, + "total_submitted": 17959, "total_column_articles": 45, "frontend_question_id": "898", "is_new_question": false @@ -36090,9 +36321,9 @@ "question__title": "Increasing Order Search Tree", "question__title_slug": "increasing-order-search-tree", "question__hide": false, - "total_acs": 68537, - "total_submitted": 92402, - "total_column_articles": 791, + "total_acs": 68828, + "total_submitted": 92780, + "total_column_articles": 796, "frontend_question_id": "897", "is_new_question": false }, @@ -36111,9 +36342,9 @@ "question__title": "Monotonic Array", "question__title_slug": "monotonic-array", "question__hide": false, - "total_acs": 67674, - "total_submitted": 116739, - "total_column_articles": 802, + "total_acs": 68117, + "total_submitted": 117501, + "total_column_articles": 805, "frontend_question_id": "896", "is_new_question": false }, @@ -36132,9 +36363,9 @@ "question__title": "Maximum Frequency Stack", "question__title_slug": "maximum-frequency-stack", "question__hide": false, - "total_acs": 10922, - "total_submitted": 18812, - "total_column_articles": 128, + "total_acs": 11101, + "total_submitted": 19080, + "total_column_articles": 130, "frontend_question_id": "895", "is_new_question": false }, @@ -36153,9 +36384,9 @@ "question__title": "All Possible Full Binary Trees", "question__title_slug": "all-possible-full-binary-trees", "question__hide": false, - "total_acs": 15388, - "total_submitted": 19786, - "total_column_articles": 146, + "total_acs": 15479, + "total_submitted": 19936, + "total_column_articles": 151, "frontend_question_id": "894", "is_new_question": false }, @@ -36174,8 +36405,8 @@ "question__title": "Groups of Special-Equivalent Strings", "question__title_slug": "groups-of-special-equivalent-strings", "question__hide": false, - "total_acs": 11511, - "total_submitted": 15849, + "total_acs": 11539, + "total_submitted": 15880, "total_column_articles": 120, "frontend_question_id": "893", "is_new_question": false @@ -36195,9 +36426,9 @@ "question__title": "Surface Area of 3D Shapes", "question__title_slug": "surface-area-of-3d-shapes", "question__hide": false, - "total_acs": 34961, - "total_submitted": 54660, - "total_column_articles": 708, + "total_acs": 35074, + "total_submitted": 54911, + "total_column_articles": 710, "frontend_question_id": "892", "is_new_question": false }, @@ -36216,9 +36447,9 @@ "question__title": "Sum of Subsequence Widths", "question__title_slug": "sum-of-subsequence-widths", "question__hide": false, - "total_acs": 3284, - "total_submitted": 9667, - "total_column_articles": 47, + "total_acs": 3307, + "total_submitted": 9726, + "total_column_articles": 48, "frontend_question_id": "891", "is_new_question": false }, @@ -36237,9 +36468,9 @@ "question__title": "Find and Replace Pattern", "question__title_slug": "find-and-replace-pattern", "question__hide": false, - "total_acs": 9951, - "total_submitted": 13619, - "total_column_articles": 138, + "total_acs": 9996, + "total_submitted": 13674, + "total_column_articles": 139, "frontend_question_id": "890", "is_new_question": false }, @@ -36258,9 +36489,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": 23205, - "total_submitted": 34378, - "total_column_articles": 245, + "total_acs": 23690, + "total_submitted": 35069, + "total_column_articles": 250, "frontend_question_id": "889", "is_new_question": false }, @@ -36279,9 +36510,9 @@ "question__title": "Fair Candy Swap", "question__title_slug": "fair-candy-swap", "question__hide": false, - "total_acs": 59462, - "total_submitted": 92871, - "total_column_articles": 505, + "total_acs": 59698, + "total_submitted": 93251, + "total_column_articles": 507, "frontend_question_id": "888", "is_new_question": false }, @@ -36300,9 +36531,9 @@ "question__title": "Super Egg Drop", "question__title_slug": "super-egg-drop", "question__hide": false, - "total_acs": 61899, - "total_submitted": 209263, - "total_column_articles": 400, + "total_acs": 62477, + "total_submitted": 210963, + "total_column_articles": 406, "frontend_question_id": "887", "is_new_question": false }, @@ -36321,9 +36552,9 @@ "question__title": "Possible Bipartition", "question__title_slug": "possible-bipartition", "question__hide": false, - "total_acs": 14963, - "total_submitted": 31485, - "total_column_articles": 253, + "total_acs": 15378, + "total_submitted": 32193, + "total_column_articles": 256, "frontend_question_id": "886", "is_new_question": false }, @@ -36342,9 +36573,9 @@ "question__title": "Spiral Matrix III", "question__title_slug": "spiral-matrix-iii", "question__hide": false, - "total_acs": 5789, - "total_submitted": 8241, - "total_column_articles": 88, + "total_acs": 5871, + "total_submitted": 8386, + "total_column_articles": 89, "frontend_question_id": "885", "is_new_question": false }, @@ -36363,9 +36594,9 @@ "question__title": "Uncommon Words from Two Sentences", "question__title_slug": "uncommon-words-from-two-sentences", "question__hide": false, - "total_acs": 42487, - "total_submitted": 58977, - "total_column_articles": 530, + "total_acs": 42720, + "total_submitted": 59363, + "total_column_articles": 534, "frontend_question_id": "884", "is_new_question": false }, @@ -36384,9 +36615,9 @@ "question__title": "Projection Area of 3D Shapes", "question__title_slug": "projection-area-of-3d-shapes", "question__hide": false, - "total_acs": 12707, - "total_submitted": 18170, - "total_column_articles": 144, + "total_acs": 41793, + "total_submitted": 54523, + "total_column_articles": 515, "frontend_question_id": "883", "is_new_question": false }, @@ -36405,8 +36636,8 @@ "question__title": "Reachable Nodes In Subdivided Graph", "question__title_slug": "reachable-nodes-in-subdivided-graph", "question__hide": false, - "total_acs": 2552, - "total_submitted": 5135, + "total_acs": 2578, + "total_submitted": 5198, "total_column_articles": 44, "frontend_question_id": "882", "is_new_question": false @@ -36426,9 +36657,9 @@ "question__title": "Boats to Save People", "question__title_slug": "boats-to-save-people", "question__hide": false, - "total_acs": 55918, - "total_submitted": 103889, - "total_column_articles": 651, + "total_acs": 56259, + "total_submitted": 104535, + "total_column_articles": 652, "frontend_question_id": "881", "is_new_question": false }, @@ -36447,8 +36678,8 @@ "question__title": "Decoded String at Index", "question__title_slug": "decoded-string-at-index", "question__hide": false, - "total_acs": 6927, - "total_submitted": 26723, + "total_acs": 6972, + "total_submitted": 26835, "total_column_articles": 88, "frontend_question_id": "880", "is_new_question": false @@ -36468,8 +36699,8 @@ "question__title": "Generate Random Point in a Circle", "question__title_slug": "generate-random-point-in-a-circle", "question__hide": false, - "total_acs": 8704, - "total_submitted": 19445, + "total_acs": 8834, + "total_submitted": 19735, "total_column_articles": 64, "frontend_question_id": "478", "is_new_question": false @@ -36489,9 +36720,9 @@ "question__title": "Random Point in Non-overlapping Rectangles", "question__title_slug": "random-point-in-non-overlapping-rectangles", "question__hide": false, - "total_acs": 3874, - "total_submitted": 9613, - "total_column_articles": 49, + "total_acs": 3971, + "total_submitted": 9843, + "total_column_articles": 50, "frontend_question_id": "497", "is_new_question": false }, @@ -36510,9 +36741,9 @@ "question__title": "Random Flip Matrix", "question__title_slug": "random-flip-matrix", "question__hide": false, - "total_acs": 20056, - "total_submitted": 42864, - "total_column_articles": 196, + "total_acs": 20142, + "total_submitted": 43104, + "total_column_articles": 197, "frontend_question_id": "519", "is_new_question": false }, @@ -36531,9 +36762,9 @@ "question__title": "Random Pick with Weight", "question__title_slug": "random-pick-with-weight", "question__hide": false, - "total_acs": 39329, - "total_submitted": 81837, - "total_column_articles": 314, + "total_acs": 40010, + "total_submitted": 83336, + "total_column_articles": 318, "frontend_question_id": "528", "is_new_question": false }, @@ -36552,9 +36783,9 @@ "question__title": "Profitable Schemes", "question__title_slug": "profitable-schemes", "question__hide": false, - "total_acs": 23579, - "total_submitted": 42751, - "total_column_articles": 196, + "total_acs": 23690, + "total_submitted": 42966, + "total_column_articles": 197, "frontend_question_id": "879", "is_new_question": false }, @@ -36573,8 +36804,8 @@ "question__title": "Nth Magical Number", "question__title_slug": "nth-magical-number", "question__hide": false, - "total_acs": 5244, - "total_submitted": 17917, + "total_acs": 5276, + "total_submitted": 18028, "total_column_articles": 73, "frontend_question_id": "878", "is_new_question": false @@ -36594,9 +36825,9 @@ "question__title": "Stone Game", "question__title_slug": "stone-game", "question__hide": false, - "total_acs": 77882, - "total_submitted": 102416, - "total_column_articles": 534, + "total_acs": 78402, + "total_submitted": 103091, + "total_column_articles": 538, "frontend_question_id": "877", "is_new_question": false }, @@ -36615,9 +36846,9 @@ "question__title": "Middle of the Linked List", "question__title_slug": "middle-of-the-linked-list", "question__hide": false, - "total_acs": 237882, - "total_submitted": 336698, - "total_column_articles": 2406, + "total_acs": 241788, + "total_submitted": 342224, + "total_column_articles": 2430, "frontend_question_id": "876", "is_new_question": false }, @@ -36636,9 +36867,9 @@ "question__title": "Koko Eating Bananas", "question__title_slug": "koko-eating-bananas", "question__hide": false, - "total_acs": 66691, - "total_submitted": 136483, - "total_column_articles": 511, + "total_acs": 67750, + "total_submitted": 138432, + "total_column_articles": 517, "frontend_question_id": "875", "is_new_question": false }, @@ -36657,8 +36888,8 @@ "question__title": "Walking Robot Simulation", "question__title_slug": "walking-robot-simulation", "question__hide": false, - "total_acs": 23118, - "total_submitted": 54739, + "total_acs": 23232, + "total_submitted": 55042, "total_column_articles": 270, "frontend_question_id": "874", "is_new_question": false @@ -36678,9 +36909,9 @@ "question__title": "Length of Longest Fibonacci Subsequence", "question__title_slug": "length-of-longest-fibonacci-subsequence", "question__hide": false, - "total_acs": 19660, - "total_submitted": 37315, - "total_column_articles": 150, + "total_acs": 19862, + "total_submitted": 37699, + "total_column_articles": 151, "frontend_question_id": "873", "is_new_question": false }, @@ -36699,9 +36930,9 @@ "question__title": "Leaf-Similar Trees", "question__title_slug": "leaf-similar-trees", "question__hide": false, - "total_acs": 64751, - "total_submitted": 99370, - "total_column_articles": 781, + "total_acs": 64937, + "total_submitted": 99645, + "total_column_articles": 783, "frontend_question_id": "872", "is_new_question": false }, @@ -36720,9 +36951,9 @@ "question__title": "Implement Rand10() Using Rand7()", "question__title_slug": "implement-rand10-using-rand7", "question__hide": false, - "total_acs": 79663, - "total_submitted": 144698, - "total_column_articles": 391, + "total_acs": 80458, + "total_submitted": 146038, + "total_column_articles": 393, "frontend_question_id": "470", "is_new_question": false }, @@ -36741,9 +36972,9 @@ "question__title": "Minimum Number of Refueling Stops", "question__title_slug": "minimum-number-of-refueling-stops", "question__hide": false, - "total_acs": 11895, - "total_submitted": 33591, - "total_column_articles": 155, + "total_acs": 12002, + "total_submitted": 33863, + "total_column_articles": 159, "frontend_question_id": "871", "is_new_question": false }, @@ -36762,9 +36993,9 @@ "question__title": "Advantage Shuffle", "question__title_slug": "advantage-shuffle", "question__hide": false, - "total_acs": 21913, - "total_submitted": 48106, - "total_column_articles": 264, + "total_acs": 22355, + "total_submitted": 48964, + "total_column_articles": 268, "frontend_question_id": "870", "is_new_question": false }, @@ -36783,9 +37014,9 @@ "question__title": "Reordered Power of 2", "question__title_slug": "reordered-power-of-2", "question__hide": false, - "total_acs": 33863, - "total_submitted": 52847, - "total_column_articles": 482, + "total_acs": 33941, + "total_submitted": 52995, + "total_column_articles": 483, "frontend_question_id": "869", "is_new_question": false }, @@ -36804,9 +37035,9 @@ "question__title": "Binary Gap", "question__title_slug": "binary-gap", "question__hide": false, - "total_acs": 37236, - "total_submitted": 54064, - "total_column_articles": 519, + "total_acs": 47305, + "total_submitted": 68003, + "total_column_articles": 635, "frontend_question_id": "868", "is_new_question": false }, @@ -36825,9 +37056,9 @@ "question__title": "Transpose Matrix", "question__title_slug": "transpose-matrix", "question__hide": false, - "total_acs": 89343, - "total_submitted": 133860, - "total_column_articles": 798, + "total_acs": 89563, + "total_submitted": 134191, + "total_column_articles": 801, "frontend_question_id": "867", "is_new_question": false }, @@ -36846,9 +37077,9 @@ "question__title": "Prime Palindrome", "question__title_slug": "prime-palindrome", "question__hide": false, - "total_acs": 8818, - "total_submitted": 38289, - "total_column_articles": 106, + "total_acs": 8888, + "total_submitted": 38558, + "total_column_articles": 107, "frontend_question_id": "866", "is_new_question": false }, @@ -36867,9 +37098,9 @@ "question__title": "Smallest Subtree with all the Deepest Nodes", "question__title_slug": "smallest-subtree-with-all-the-deepest-nodes", "question__hide": false, - "total_acs": 11224, - "total_submitted": 16719, - "total_column_articles": 165, + "total_acs": 11324, + "total_submitted": 16862, + "total_column_articles": 167, "frontend_question_id": "865", "is_new_question": false }, @@ -36888,9 +37119,9 @@ "question__title": "Shortest Path to Get All Keys", "question__title_slug": "shortest-path-to-get-all-keys", "question__hide": false, - "total_acs": 3757, - "total_submitted": 7998, - "total_column_articles": 58, + "total_acs": 3808, + "total_submitted": 8071, + "total_column_articles": 59, "frontend_question_id": "864", "is_new_question": false }, @@ -36909,9 +37140,9 @@ "question__title": "Random Pick with Blacklist", "question__title_slug": "random-pick-with-blacklist", "question__hide": false, - "total_acs": 8686, - "total_submitted": 23084, - "total_column_articles": 182, + "total_acs": 8960, + "total_submitted": 23695, + "total_column_articles": 184, "frontend_question_id": "710", "is_new_question": false }, @@ -36930,9 +37161,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": 41733, - "total_submitted": 68486, - "total_column_articles": 622, + "total_acs": 41972, + "total_submitted": 68882, + "total_column_articles": 627, "frontend_question_id": "863", "is_new_question": false }, @@ -36951,9 +37182,9 @@ "question__title": "Shortest Subarray with Sum at Least K", "question__title_slug": "shortest-subarray-with-sum-at-least-k", "question__hide": false, - "total_acs": 21145, - "total_submitted": 101598, - "total_column_articles": 174, + "total_acs": 21375, + "total_submitted": 102439, + "total_column_articles": 178, "frontend_question_id": "862", "is_new_question": false }, @@ -36972,8 +37203,8 @@ "question__title": "Score After Flipping Matrix", "question__title_slug": "score-after-flipping-matrix", "question__hide": false, - "total_acs": 33078, - "total_submitted": 40922, + "total_acs": 33147, + "total_submitted": 41015, "total_column_articles": 465, "frontend_question_id": "861", "is_new_question": false @@ -36993,9 +37224,9 @@ "question__title": "Lemonade Change", "question__title_slug": "lemonade-change", "question__hide": false, - "total_acs": 115534, - "total_submitted": 197633, - "total_column_articles": 953, + "total_acs": 117060, + "total_submitted": 200147, + "total_column_articles": 966, "frontend_question_id": "860", "is_new_question": false }, @@ -37014,9 +37245,9 @@ "question__title": "Buddy Strings", "question__title_slug": "buddy-strings", "question__hide": false, - "total_acs": 61758, - "total_submitted": 178742, - "total_column_articles": 785, + "total_acs": 61921, + "total_submitted": 179247, + "total_column_articles": 787, "frontend_question_id": "859", "is_new_question": false }, @@ -37035,9 +37266,9 @@ "question__title": "Mirror Reflection", "question__title_slug": "mirror-reflection", "question__hide": false, - "total_acs": 3456, - "total_submitted": 6128, - "total_column_articles": 56, + "total_acs": 3488, + "total_submitted": 6191, + "total_column_articles": 57, "frontend_question_id": "858", "is_new_question": false }, @@ -37056,8 +37287,8 @@ "question__title": "Minimum Cost to Hire K Workers", "question__title_slug": "minimum-cost-to-hire-k-workers", "question__hide": false, - "total_acs": 3656, - "total_submitted": 7642, + "total_acs": 3674, + "total_submitted": 7671, "total_column_articles": 59, "frontend_question_id": "857", "is_new_question": false @@ -37077,9 +37308,9 @@ "question__title": "Score of Parentheses", "question__title_slug": "score-of-parentheses", "question__hide": false, - "total_acs": 18863, - "total_submitted": 29946, - "total_column_articles": 260, + "total_acs": 18995, + "total_submitted": 30129, + "total_column_articles": 261, "frontend_question_id": "856", "is_new_question": false }, @@ -37098,9 +37329,9 @@ "question__title": "Exam Room", "question__title_slug": "exam-room", "question__hide": false, - "total_acs": 6850, - "total_submitted": 16686, - "total_column_articles": 71, + "total_acs": 6951, + "total_submitted": 16905, + "total_column_articles": 72, "frontend_question_id": "855", "is_new_question": false }, @@ -37119,8 +37350,8 @@ "question__title": "K-Similar Strings", "question__title_slug": "k-similar-strings", "question__hide": false, - "total_acs": 4877, - "total_submitted": 13365, + "total_acs": 4897, + "total_submitted": 13410, "total_column_articles": 83, "frontend_question_id": "854", "is_new_question": false @@ -37140,9 +37371,9 @@ "question__title": "Car Fleet", "question__title_slug": "car-fleet", "question__hide": false, - "total_acs": 12639, - "total_submitted": 31997, - "total_column_articles": 152, + "total_acs": 12747, + "total_submitted": 32206, + "total_column_articles": 153, "frontend_question_id": "853", "is_new_question": false }, @@ -37161,9 +37392,9 @@ "question__title": "Peak Index in a Mountain Array", "question__title_slug": "peak-index-in-a-mountain-array", "question__hide": false, - "total_acs": 101759, - "total_submitted": 144264, - "total_column_articles": 874, + "total_acs": 103094, + "total_submitted": 146394, + "total_column_articles": 883, "frontend_question_id": "852", "is_new_question": false }, @@ -37182,8 +37413,8 @@ "question__title": "Loud and Rich", "question__title_slug": "loud-and-rich", "question__hide": false, - "total_acs": 26510, - "total_submitted": 42180, + "total_acs": 26600, + "total_submitted": 42329, "total_column_articles": 293, "frontend_question_id": "851", "is_new_question": false @@ -37203,9 +37434,9 @@ "question__title": "Rectangle Area II", "question__title_slug": "rectangle-area-ii", "question__hide": false, - "total_acs": 3053, - "total_submitted": 6667, - "total_column_articles": 52, + "total_acs": 3086, + "total_submitted": 6761, + "total_column_articles": 53, "frontend_question_id": "850", "is_new_question": false }, @@ -37224,8 +37455,8 @@ "question__title": "Maximize Distance to Closest Person", "question__title_slug": "maximize-distance-to-closest-person", "question__hide": false, - "total_acs": 17742, - "total_submitted": 41112, + "total_acs": 17827, + "total_submitted": 41301, "total_column_articles": 222, "frontend_question_id": "849", "is_new_question": false @@ -37245,9 +37476,9 @@ "question__title": "Shifting Letters", "question__title_slug": "shifting-letters", "question__hide": false, - "total_acs": 10999, - "total_submitted": 24236, - "total_column_articles": 121, + "total_acs": 11103, + "total_submitted": 24440, + "total_column_articles": 123, "frontend_question_id": "848", "is_new_question": false }, @@ -37266,9 +37497,9 @@ "question__title": "Shortest Path Visiting All Nodes", "question__title_slug": "shortest-path-visiting-all-nodes", "question__hide": false, - "total_acs": 21096, - "total_submitted": 31146, - "total_column_articles": 181, + "total_acs": 21250, + "total_submitted": 31343, + "total_column_articles": 183, "frontend_question_id": "847", "is_new_question": false }, @@ -37287,8 +37518,8 @@ "question__title": "Hand of Straights", "question__title_slug": "hand-of-straights", "question__hide": false, - "total_acs": 35537, - "total_submitted": 62134, + "total_acs": 35686, + "total_submitted": 62388, "total_column_articles": 485, "frontend_question_id": "846", "is_new_question": false @@ -37308,9 +37539,9 @@ "question__title": "Longest Mountain in Array", "question__title_slug": "longest-mountain-in-array", "question__hide": false, - "total_acs": 41797, - "total_submitted": 99167, - "total_column_articles": 613, + "total_acs": 41999, + "total_submitted": 99652, + "total_column_articles": 615, "frontend_question_id": "845", "is_new_question": false }, @@ -37329,9 +37560,9 @@ "question__title": "Backspace String Compare", "question__title_slug": "backspace-string-compare", "question__hide": false, - "total_acs": 128931, - "total_submitted": 260234, - "total_column_articles": 1330, + "total_acs": 130892, + "total_submitted": 264712, + "total_column_articles": 1342, "frontend_question_id": "844", "is_new_question": false }, @@ -37350,8 +37581,8 @@ "question__title": "Guess the Word", "question__title_slug": "guess-the-word", "question__hide": false, - "total_acs": 3483, - "total_submitted": 8994, + "total_acs": 3513, + "total_submitted": 9065, "total_column_articles": 46, "frontend_question_id": "843", "is_new_question": false @@ -37371,8 +37602,8 @@ "question__title": "Split Array into Fibonacci Sequence", "question__title_slug": "split-array-into-fibonacci-sequence", "question__hide": false, - "total_acs": 30696, - "total_submitted": 63187, + "total_acs": 30770, + "total_submitted": 63363, "total_column_articles": 339, "frontend_question_id": "842", "is_new_question": false @@ -37392,9 +37623,9 @@ "question__title": "Keys and Rooms", "question__title_slug": "keys-and-rooms", "question__hide": false, - "total_acs": 64657, - "total_submitted": 97482, - "total_column_articles": 645, + "total_acs": 65137, + "total_submitted": 98109, + "total_column_articles": 649, "frontend_question_id": "841", "is_new_question": false }, @@ -37413,8 +37644,8 @@ "question__title": "Magic Squares In Grid", "question__title_slug": "magic-squares-in-grid", "question__hide": false, - "total_acs": 9714, - "total_submitted": 26779, + "total_acs": 9758, + "total_submitted": 26857, "total_column_articles": 128, "frontend_question_id": "840", "is_new_question": false @@ -37434,9 +37665,9 @@ "question__title": "Similar String Groups", "question__title_slug": "similar-string-groups", "question__hide": false, - "total_acs": 20712, - "total_submitted": 35767, - "total_column_articles": 289, + "total_acs": 20794, + "total_submitted": 35897, + "total_column_articles": 290, "frontend_question_id": "839", "is_new_question": false }, @@ -37455,8 +37686,8 @@ "question__title": "Push Dominoes", "question__title_slug": "push-dominoes", "question__hide": false, - "total_acs": 35771, - "total_submitted": 64560, + "total_acs": 35878, + "total_submitted": 64751, "total_column_articles": 511, "frontend_question_id": "838", "is_new_question": false @@ -37476,9 +37707,9 @@ "question__title": "New 21 Game", "question__title_slug": "new-21-game", "question__hide": false, - "total_acs": 20321, - "total_submitted": 51494, - "total_column_articles": 253, + "total_acs": 20351, + "total_submitted": 51575, + "total_column_articles": 254, "frontend_question_id": "837", "is_new_question": false }, @@ -37497,9 +37728,9 @@ "question__title": "Rectangle Overlap", "question__title_slug": "rectangle-overlap", "question__hide": false, - "total_acs": 42250, - "total_submitted": 87278, - "total_column_articles": 704, + "total_acs": 42456, + "total_submitted": 87693, + "total_column_articles": 705, "frontend_question_id": "836", "is_new_question": false }, @@ -37518,8 +37749,8 @@ "question__title": "Robot Room Cleaner", "question__title_slug": "robot-room-cleaner", "question__hide": false, - "total_acs": 2404, - "total_submitted": 3258, + "total_acs": 2445, + "total_submitted": 3314, "total_column_articles": 30, "frontend_question_id": "489", "is_new_question": false @@ -37539,8 +37770,8 @@ "question__title": "Image Overlap", "question__title_slug": "image-overlap", "question__hide": false, - "total_acs": 4923, - "total_submitted": 8550, + "total_acs": 4950, + "total_submitted": 8599, "total_column_articles": 55, "frontend_question_id": "835", "is_new_question": false @@ -37560,9 +37791,9 @@ "question__title": "Sum of Distances in Tree", "question__title_slug": "sum-of-distances-in-tree", "question__hide": false, - "total_acs": 14416, - "total_submitted": 27262, - "total_column_articles": 144, + "total_acs": 14517, + "total_submitted": 27403, + "total_column_articles": 146, "frontend_question_id": "834", "is_new_question": false }, @@ -37581,9 +37812,9 @@ "question__title": "Find And Replace in String", "question__title_slug": "find-and-replace-in-string", "question__hide": false, - "total_acs": 6266, - "total_submitted": 14172, - "total_column_articles": 93, + "total_acs": 6321, + "total_submitted": 14272, + "total_column_articles": 94, "frontend_question_id": "833", "is_new_question": false }, @@ -37602,9 +37833,9 @@ "question__title": "Flipping an Image", "question__title_slug": "flipping-an-image", "question__hide": false, - "total_acs": 91465, - "total_submitted": 115085, - "total_column_articles": 1006, + "total_acs": 91751, + "total_submitted": 115459, + "total_column_articles": 1009, "frontend_question_id": "832", "is_new_question": false }, @@ -37623,9 +37854,9 @@ "question__title": "Design Circular Queue", "question__title_slug": "design-circular-queue", "question__hide": false, - "total_acs": 80255, - "total_submitted": 180901, - "total_column_articles": 542, + "total_acs": 80776, + "total_submitted": 182027, + "total_column_articles": 545, "frontend_question_id": "622", "is_new_question": false }, @@ -37644,9 +37875,9 @@ "question__title": "Design Circular Deque", "question__title_slug": "design-circular-deque", "question__hide": false, - "total_acs": 26631, - "total_submitted": 50360, - "total_column_articles": 301, + "total_acs": 26866, + "total_submitted": 50801, + "total_column_articles": 304, "frontend_question_id": "641", "is_new_question": false }, @@ -37665,8 +37896,8 @@ "question__title": "Masking Personal Information", "question__title_slug": "masking-personal-information", "question__hide": false, - "total_acs": 8529, - "total_submitted": 20618, + "total_acs": 8563, + "total_submitted": 20696, "total_column_articles": 89, "frontend_question_id": "831", "is_new_question": false @@ -37686,9 +37917,9 @@ "question__title": "Positions of Large Groups", "question__title_slug": "positions-of-large-groups", "question__hide": false, - "total_acs": 54468, - "total_submitted": 100315, - "total_column_articles": 615, + "total_acs": 54583, + "total_submitted": 100538, + "total_column_articles": 619, "frontend_question_id": "830", "is_new_question": false }, @@ -37707,9 +37938,9 @@ "question__title": "Consecutive Numbers Sum", "question__title_slug": "consecutive-numbers-sum", "question__hide": false, - "total_acs": 10632, - "total_submitted": 28823, - "total_column_articles": 130, + "total_acs": 10741, + "total_submitted": 29070, + "total_column_articles": 131, "frontend_question_id": "829", "is_new_question": false }, @@ -37728,9 +37959,9 @@ "question__title": "Count Unique Characters of All Substrings of a Given String", "question__title_slug": "count-unique-characters-of-all-substrings-of-a-given-string", "question__hide": false, - "total_acs": 4252, - "total_submitted": 8071, - "total_column_articles": 68, + "total_acs": 4397, + "total_submitted": 8256, + "total_column_articles": 69, "frontend_question_id": "828", "is_new_question": false }, @@ -37749,9 +37980,9 @@ "question__title": "Making A Large Island", "question__title_slug": "making-a-large-island", "question__hide": false, - "total_acs": 12774, - "total_submitted": 32387, - "total_column_articles": 227, + "total_acs": 12914, + "total_submitted": 32776, + "total_column_articles": 228, "frontend_question_id": "827", "is_new_question": false }, @@ -37770,9 +38001,9 @@ "question__title": "Most Profit Assigning Work", "question__title_slug": "most-profit-assigning-work", "question__hide": false, - "total_acs": 10024, - "total_submitted": 25618, - "total_column_articles": 152, + "total_acs": 10239, + "total_submitted": 26045, + "total_column_articles": 155, "frontend_question_id": "826", "is_new_question": false }, @@ -37791,8 +38022,8 @@ "question__title": "Friends Of Appropriate Ages", "question__title_slug": "friends-of-appropriate-ages", "question__hide": false, - "total_acs": 33141, - "total_submitted": 72813, + "total_acs": 33241, + "total_submitted": 73007, "total_column_articles": 319, "frontend_question_id": "825", "is_new_question": false @@ -37812,9 +38043,9 @@ "question__title": "Goat Latin", "question__title_slug": "goat-latin", "question__hide": false, - "total_acs": 49816, - "total_submitted": 76197, - "total_column_articles": 668, + "total_acs": 50274, + "total_submitted": 76935, + "total_column_articles": 674, "frontend_question_id": "824", "is_new_question": false }, @@ -37833,8 +38064,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": 3457, - "total_submitted": 9441, + "total_acs": 3502, + "total_submitted": 9552, "total_column_articles": 70, "frontend_question_id": "708", "is_new_question": false @@ -37854,9 +38085,9 @@ "question__title": "Binary Trees With Factors", "question__title_slug": "binary-trees-with-factors", "question__hide": false, - "total_acs": 3690, - "total_submitted": 8595, - "total_column_articles": 59, + "total_acs": 3717, + "total_submitted": 8682, + "total_column_articles": 60, "frontend_question_id": "823", "is_new_question": false }, @@ -37875,8 +38106,8 @@ "question__title": "Card Flipping Game", "question__title_slug": "card-flipping-game", "question__hide": false, - "total_acs": 3576, - "total_submitted": 7045, + "total_acs": 3593, + "total_submitted": 7092, "total_column_articles": 49, "frontend_question_id": "822", "is_new_question": false @@ -37896,9 +38127,9 @@ "question__title": "Shortest Distance to a Character", "question__title_slug": "shortest-distance-to-a-character", "question__hide": false, - "total_acs": 64629, - "total_submitted": 88088, - "total_column_articles": 889, + "total_acs": 65153, + "total_submitted": 88882, + "total_column_articles": 894, "frontend_question_id": "821", "is_new_question": false }, @@ -37917,9 +38148,9 @@ "question__title": "Short Encoding of Words", "question__title_slug": "short-encoding-of-words", "question__hide": false, - "total_acs": 60489, - "total_submitted": 117968, - "total_column_articles": 657, + "total_acs": 60745, + "total_submitted": 118397, + "total_column_articles": 661, "frontend_question_id": "820", "is_new_question": false }, @@ -37938,9 +38169,9 @@ "question__title": "Design Linked List", "question__title_slug": "design-linked-list", "question__hide": false, - "total_acs": 109444, - "total_submitted": 327615, - "total_column_articles": 720, + "total_acs": 111901, + "total_submitted": 334455, + "total_column_articles": 732, "frontend_question_id": "707", "is_new_question": false }, @@ -37959,8 +38190,8 @@ "question__title": "Most Common Word", "question__title_slug": "most-common-word", "question__hide": false, - "total_acs": 51591, - "total_submitted": 111176, + "total_acs": 51981, + "total_submitted": 111987, "total_column_articles": 614, "frontend_question_id": "819", "is_new_question": false @@ -37980,8 +38211,8 @@ "question__title": "Race Car", "question__title_slug": "race-car", "question__hide": false, - "total_acs": 4328, - "total_submitted": 9878, + "total_acs": 4388, + "total_submitted": 9994, "total_column_articles": 49, "frontend_question_id": "818", "is_new_question": false @@ -38001,9 +38232,9 @@ "question__title": "Linked List Components", "question__title_slug": "linked-list-components", "question__hide": false, - "total_acs": 15218, - "total_submitted": 25622, - "total_column_articles": 190, + "total_acs": 15310, + "total_submitted": 25790, + "total_column_articles": 193, "frontend_question_id": "817", "is_new_question": false }, @@ -38022,9 +38253,9 @@ "question__title": "Ambiguous Coordinates", "question__title_slug": "ambiguous-coordinates", "question__hide": false, - "total_acs": 4312, - "total_submitted": 8376, - "total_column_articles": 75, + "total_acs": 4356, + "total_submitted": 8470, + "total_column_articles": 76, "frontend_question_id": "816", "is_new_question": false }, @@ -38043,9 +38274,9 @@ "question__title": "Bus Routes", "question__title_slug": "bus-routes", "question__hide": false, - "total_acs": 29850, - "total_submitted": 68763, - "total_column_articles": 337, + "total_acs": 29947, + "total_submitted": 69109, + "total_column_articles": 339, "frontend_question_id": "815", "is_new_question": false }, @@ -38064,9 +38295,9 @@ "question__title": "Binary Tree Pruning", "question__title_slug": "binary-tree-pruning", "question__hide": false, - "total_acs": 27732, - "total_submitted": 39519, - "total_column_articles": 414, + "total_acs": 27985, + "total_submitted": 39874, + "total_column_articles": 419, "frontend_question_id": "814", "is_new_question": false }, @@ -38085,9 +38316,9 @@ "question__title": "Largest Sum of Averages", "question__title_slug": "largest-sum-of-averages", "question__hide": false, - "total_acs": 8772, - "total_submitted": 15631, - "total_column_articles": 101, + "total_acs": 8852, + "total_submitted": 15784, + "total_column_articles": 104, "frontend_question_id": "813", "is_new_question": false }, @@ -38106,9 +38337,9 @@ "question__title": "Largest Triangle Area", "question__title_slug": "largest-triangle-area", "question__hide": false, - "total_acs": 13057, - "total_submitted": 20640, - "total_column_articles": 123, + "total_acs": 13179, + "total_submitted": 20822, + "total_column_articles": 124, "frontend_question_id": "812", "is_new_question": false }, @@ -38127,9 +38358,9 @@ "question__title": "Subdomain Visit Count", "question__title_slug": "subdomain-visit-count", "question__hide": false, - "total_acs": 17549, - "total_submitted": 24687, - "total_column_articles": 227, + "total_acs": 17616, + "total_submitted": 24770, + "total_column_articles": 228, "frontend_question_id": "811", "is_new_question": false }, @@ -38148,8 +38379,8 @@ "question__title": "Chalkboard XOR Game", "question__title_slug": "chalkboard-xor-game", "question__hide": false, - "total_acs": 17575, - "total_submitted": 24106, + "total_acs": 17598, + "total_submitted": 24145, "total_column_articles": 142, "frontend_question_id": "810", "is_new_question": false @@ -38169,8 +38400,8 @@ "question__title": "Expressive Words", "question__title_slug": "expressive-words", "question__hide": false, - "total_acs": 5726, - "total_submitted": 13665, + "total_acs": 5757, + "total_submitted": 13741, "total_column_articles": 103, "frontend_question_id": "809", "is_new_question": false @@ -38190,8 +38421,8 @@ "question__title": "Soup Servings", "question__title_slug": "soup-servings", "question__hide": false, - "total_acs": 5119, - "total_submitted": 10579, + "total_acs": 5151, + "total_submitted": 10645, "total_column_articles": 46, "frontend_question_id": "808", "is_new_question": false @@ -38211,9 +38442,9 @@ "question__title": "Max Increase to Keep City Skyline", "question__title_slug": "max-increase-to-keep-city-skyline", "question__hide": false, - "total_acs": 47207, - "total_submitted": 53283, - "total_column_articles": 656, + "total_acs": 47434, + "total_submitted": 53541, + "total_column_articles": 660, "frontend_question_id": "807", "is_new_question": false }, @@ -38232,9 +38463,9 @@ "question__title": "Number of Lines To Write String", "question__title_slug": "number-of-lines-to-write-string", "question__hide": false, - "total_acs": 46972, - "total_submitted": 67935, - "total_column_articles": 577, + "total_acs": 47170, + "total_submitted": 68214, + "total_column_articles": 579, "frontend_question_id": "806", "is_new_question": false }, @@ -38253,8 +38484,8 @@ "question__title": "Split Array With Same Average", "question__title_slug": "split-array-with-same-average", "question__hide": false, - "total_acs": 3504, - "total_submitted": 11806, + "total_acs": 3535, + "total_submitted": 11888, "total_column_articles": 58, "frontend_question_id": "805", "is_new_question": false @@ -38274,9 +38505,9 @@ "question__title": "Unique Morse Code Words", "question__title_slug": "unique-morse-code-words", "question__hide": false, - "total_acs": 71188, - "total_submitted": 86620, - "total_column_articles": 745, + "total_acs": 71441, + "total_submitted": 86914, + "total_column_articles": 749, "frontend_question_id": "804", "is_new_question": false }, @@ -38295,9 +38526,9 @@ "question__title": "Bricks Falling When Hit", "question__title_slug": "bricks-falling-when-hit", "question__hide": false, - "total_acs": 12972, - "total_submitted": 27176, - "total_column_articles": 136, + "total_acs": 13012, + "total_submitted": 27291, + "total_column_articles": 137, "frontend_question_id": "803", "is_new_question": false }, @@ -38316,9 +38547,9 @@ "question__title": "Find Eventual Safe States", "question__title_slug": "find-eventual-safe-states", "question__hide": false, - "total_acs": 35580, - "total_submitted": 61110, - "total_column_articles": 377, + "total_acs": 35820, + "total_submitted": 61494, + "total_column_articles": 378, "frontend_question_id": "802", "is_new_question": false }, @@ -38337,9 +38568,9 @@ "question__title": "Minimum Swaps To Make Sequences Increasing", "question__title_slug": "minimum-swaps-to-make-sequences-increasing", "question__hide": false, - "total_acs": 8516, - "total_submitted": 19927, - "total_column_articles": 107, + "total_acs": 8601, + "total_submitted": 20106, + "total_column_articles": 109, "frontend_question_id": "801", "is_new_question": false }, @@ -38358,8 +38589,8 @@ "question__title": "Similar RGB Color", "question__title_slug": "similar-rgb-color", "question__hide": false, - "total_acs": 1800, - "total_submitted": 2548, + "total_acs": 1816, + "total_submitted": 2567, "total_column_articles": 45, "frontend_question_id": "800", "is_new_question": false @@ -38379,9 +38610,9 @@ "question__title": "Design HashMap", "question__title_slug": "design-hashmap", "question__hide": false, - "total_acs": 74514, - "total_submitted": 116614, - "total_column_articles": 484, + "total_acs": 75277, + "total_submitted": 117766, + "total_column_articles": 487, "frontend_question_id": "706", "is_new_question": false }, @@ -38400,9 +38631,9 @@ "question__title": "Design HashSet", "question__title_slug": "design-hashset", "question__hide": false, - "total_acs": 82203, - "total_submitted": 128725, - "total_column_articles": 504, + "total_acs": 82851, + "total_submitted": 129735, + "total_column_articles": 510, "frontend_question_id": "705", "is_new_question": false }, @@ -38421,8 +38652,8 @@ "question__title": "Champagne Tower", "question__title_slug": "champagne-tower", "question__hide": false, - "total_acs": 7321, - "total_submitted": 17312, + "total_acs": 7395, + "total_submitted": 17476, "total_column_articles": 85, "frontend_question_id": "799", "is_new_question": false @@ -38442,9 +38673,9 @@ "question__title": "Smallest Rotation with Highest Score", "question__title_slug": "smallest-rotation-with-highest-score", "question__hide": false, - "total_acs": 19506, - "total_submitted": 31746, - "total_column_articles": 201, + "total_acs": 19543, + "total_submitted": 31799, + "total_column_articles": 203, "frontend_question_id": "798", "is_new_question": false }, @@ -38463,9 +38694,9 @@ "question__title": "All Paths From Source to Target", "question__title_slug": "all-paths-from-source-to-target", "question__hide": false, - "total_acs": 64628, - "total_submitted": 81967, - "total_column_articles": 1182, + "total_acs": 65750, + "total_submitted": 83339, + "total_column_articles": 1214, "frontend_question_id": "797", "is_new_question": false }, @@ -38484,9 +38715,9 @@ "question__title": "Rotate String", "question__title_slug": "rotate-string", "question__hide": false, - "total_acs": 66873, - "total_submitted": 106157, - "total_column_articles": 744, + "total_acs": 67327, + "total_submitted": 106821, + "total_column_articles": 749, "frontend_question_id": "796", "is_new_question": false }, @@ -38505,9 +38736,9 @@ "question__title": "Number of Subarrays with Bounded Maximum", "question__title_slug": "number-of-subarrays-with-bounded-maximum", "question__hide": false, - "total_acs": 10140, - "total_submitted": 19187, - "total_column_articles": 110, + "total_acs": 10263, + "total_submitted": 19421, + "total_column_articles": 111, "frontend_question_id": "795", "is_new_question": false }, @@ -38526,8 +38757,8 @@ "question__title": "Valid Tic-Tac-Toe State", "question__title_slug": "valid-tic-tac-toe-state", "question__hide": false, - "total_acs": 29256, - "total_submitted": 75187, + "total_acs": 29298, + "total_submitted": 75304, "total_column_articles": 470, "frontend_question_id": "794", "is_new_question": false @@ -38547,9 +38778,9 @@ "question__title": "Preimage Size of Factorial Zeroes Function", "question__title_slug": "preimage-size-of-factorial-zeroes-function", "question__hide": false, - "total_acs": 7310, - "total_submitted": 18235, - "total_column_articles": 89, + "total_acs": 7476, + "total_submitted": 18594, + "total_column_articles": 92, "frontend_question_id": "793", "is_new_question": false }, @@ -38568,8 +38799,8 @@ "question__title": "Number of Matching Subsequences", "question__title_slug": "number-of-matching-subsequences", "question__hide": false, - "total_acs": 10998, - "total_submitted": 23435, + "total_acs": 11093, + "total_submitted": 23602, "total_column_articles": 120, "frontend_question_id": "792", "is_new_question": false @@ -38589,9 +38820,9 @@ "question__title": "Custom Sort String", "question__title_slug": "custom-sort-string", "question__hide": false, - "total_acs": 13720, - "total_submitted": 19741, - "total_column_articles": 237, + "total_acs": 13813, + "total_submitted": 19857, + "total_column_articles": 239, "frontend_question_id": "791", "is_new_question": false }, @@ -38610,8 +38841,8 @@ "question__title": "Domino and Tromino Tiling", "question__title_slug": "domino-and-tromino-tiling", "question__hide": false, - "total_acs": 4969, - "total_submitted": 10830, + "total_acs": 5016, + "total_submitted": 10910, "total_column_articles": 83, "frontend_question_id": "790", "is_new_question": false @@ -38631,8 +38862,8 @@ "question__title": "Escape The Ghosts", "question__title_slug": "escape-the-ghosts", "question__hide": false, - "total_acs": 21779, - "total_submitted": 31625, + "total_acs": 21807, + "total_submitted": 31667, "total_column_articles": 311, "frontend_question_id": "789", "is_new_question": false @@ -38652,8 +38883,8 @@ "question__title": "Rotated Digits", "question__title_slug": "rotated-digits", "question__hide": false, - "total_acs": 19759, - "total_submitted": 32309, + "total_acs": 19807, + "total_submitted": 32381, "total_column_articles": 209, "frontend_question_id": "788", "is_new_question": false @@ -38673,9 +38904,9 @@ "question__title": "Cheapest Flights Within K Stops", "question__title_slug": "cheapest-flights-within-k-stops", "question__hide": false, - "total_acs": 50931, - "total_submitted": 130858, - "total_column_articles": 479, + "total_acs": 51327, + "total_submitted": 131866, + "total_column_articles": 483, "frontend_question_id": "787", "is_new_question": false }, @@ -38694,9 +38925,9 @@ "question__title": "K-th Smallest Prime Fraction", "question__title_slug": "k-th-smallest-prime-fraction", "question__hide": false, - "total_acs": 26795, - "total_submitted": 39535, - "total_column_articles": 271, + "total_acs": 26893, + "total_submitted": 39676, + "total_column_articles": 272, "frontend_question_id": "786", "is_new_question": false }, @@ -38715,9 +38946,9 @@ "question__title": "Is Graph Bipartite?", "question__title_slug": "is-graph-bipartite", "question__hide": false, - "total_acs": 53845, - "total_submitted": 102107, - "total_column_articles": 916, + "total_acs": 54641, + "total_submitted": 103431, + "total_column_articles": 943, "frontend_question_id": "785", "is_new_question": false }, @@ -38736,9 +38967,9 @@ "question__title": "Letter Case Permutation", "question__title_slug": "letter-case-permutation", "question__hide": false, - "total_acs": 61807, - "total_submitted": 88536, - "total_column_articles": 727, + "total_acs": 62617, + "total_submitted": 89585, + "total_column_articles": 735, "frontend_question_id": "784", "is_new_question": false }, @@ -38757,9 +38988,9 @@ "question__title": "Minimum Distance Between BST Nodes", "question__title_slug": "minimum-distance-between-bst-nodes", "question__hide": false, - "total_acs": 75863, - "total_submitted": 126832, - "total_column_articles": 734, + "total_acs": 76141, + "total_submitted": 127254, + "total_column_articles": 739, "frontend_question_id": "783", "is_new_question": false }, @@ -38778,8 +39009,8 @@ "question__title": "Transform to Chessboard", "question__title_slug": "transform-to-chessboard", "question__hide": false, - "total_acs": 1801, - "total_submitted": 4252, + "total_acs": 1817, + "total_submitted": 4274, "total_column_articles": 37, "frontend_question_id": "782", "is_new_question": false @@ -38799,9 +39030,9 @@ "question__title": "Rabbits in Forest", "question__title_slug": "rabbits-in-forest", "question__hide": false, - "total_acs": 47518, - "total_submitted": 78450, - "total_column_articles": 711, + "total_acs": 47726, + "total_submitted": 78863, + "total_column_articles": 714, "frontend_question_id": "781", "is_new_question": false }, @@ -38820,9 +39051,9 @@ "question__title": "Reaching Points", "question__title_slug": "reaching-points", "question__hide": false, - "total_acs": 24297, - "total_submitted": 64038, - "total_column_articles": 249, + "total_acs": 24461, + "total_submitted": 64428, + "total_column_articles": 251, "frontend_question_id": "780", "is_new_question": false }, @@ -38841,8 +39072,8 @@ "question__title": "K-th Symbol in Grammar", "question__title_slug": "k-th-symbol-in-grammar", "question__hide": false, - "total_acs": 20556, - "total_submitted": 47078, + "total_acs": 20612, + "total_submitted": 47192, "total_column_articles": 257, "frontend_question_id": "779", "is_new_question": false @@ -38862,9 +39093,9 @@ "question__title": "Swim in Rising Water", "question__title_slug": "swim-in-rising-water", "question__hide": false, - "total_acs": 26737, - "total_submitted": 45420, - "total_column_articles": 377, + "total_acs": 26954, + "total_submitted": 45778, + "total_column_articles": 379, "frontend_question_id": "778", "is_new_question": false }, @@ -38883,8 +39114,8 @@ "question__title": "Swap Adjacent in LR String", "question__title_slug": "swap-adjacent-in-lr-string", "question__hide": false, - "total_acs": 6456, - "total_submitted": 19878, + "total_acs": 6494, + "total_submitted": 19988, "total_column_articles": 72, "frontend_question_id": "777", "is_new_question": false @@ -38904,9 +39135,9 @@ "question__title": "Binary Search", "question__title_slug": "binary-search", "question__hide": false, - "total_acs": 561361, - "total_submitted": 1032963, - "total_column_articles": 2906, + "total_acs": 572253, + "total_submitted": 1052853, + "total_column_articles": 2949, "frontend_question_id": "704", "is_new_question": false }, @@ -38925,8 +39156,8 @@ "question__title": "Split BST", "question__title_slug": "split-bst", "question__hide": false, - "total_acs": 2075, - "total_submitted": 3606, + "total_acs": 2085, + "total_submitted": 3618, "total_column_articles": 41, "frontend_question_id": "776", "is_new_question": false @@ -38946,9 +39177,9 @@ "question__title": "Global and Local Inversions", "question__title_slug": "global-and-local-inversions", "question__hide": false, - "total_acs": 5961, - "total_submitted": 12994, - "total_column_articles": 95, + "total_acs": 5989, + "total_submitted": 13052, + "total_column_articles": 96, "frontend_question_id": "775", "is_new_question": false }, @@ -38967,9 +39198,9 @@ "question__title": "Kth Largest Element in a Stream", "question__title_slug": "kth-largest-element-in-a-stream", "question__hide": false, - "total_acs": 71463, - "total_submitted": 137619, - "total_column_articles": 655, + "total_acs": 71951, + "total_submitted": 138513, + "total_column_articles": 664, "frontend_question_id": "703", "is_new_question": false }, @@ -38988,9 +39219,9 @@ "question__title": "Minimize Max Distance to Gas Station", "question__title_slug": "minimize-max-distance-to-gas-station", "question__hide": false, - "total_acs": 1522, - "total_submitted": 2479, - "total_column_articles": 26, + "total_acs": 1535, + "total_submitted": 2506, + "total_column_articles": 27, "frontend_question_id": "774", "is_new_question": false }, @@ -39009,9 +39240,9 @@ "question__title": "Sliding Puzzle", "question__title_slug": "sliding-puzzle", "question__hide": false, - "total_acs": 27094, - "total_submitted": 38343, - "total_column_articles": 378, + "total_acs": 27315, + "total_submitted": 38666, + "total_column_articles": 380, "frontend_question_id": "773", "is_new_question": false }, @@ -39030,9 +39261,9 @@ "question__title": "Search in a Sorted Array of Unknown Size", "question__title_slug": "search-in-a-sorted-array-of-unknown-size", "question__hide": false, - "total_acs": 5804, - "total_submitted": 7806, - "total_column_articles": 98, + "total_acs": 5897, + "total_submitted": 7936, + "total_column_articles": 100, "frontend_question_id": "702", "is_new_question": false }, @@ -39051,9 +39282,9 @@ "question__title": "Basic Calculator III", "question__title_slug": "basic-calculator-iii", "question__hide": false, - "total_acs": 8485, - "total_submitted": 16658, - "total_column_articles": 152, + "total_acs": 8634, + "total_submitted": 16921, + "total_column_articles": 153, "frontend_question_id": "772", "is_new_question": false }, @@ -39072,9 +39303,9 @@ "question__title": "Insert into a Binary Search Tree", "question__title_slug": "insert-into-a-binary-search-tree", "question__hide": false, - "total_acs": 116958, - "total_submitted": 162573, - "total_column_articles": 902, + "total_acs": 119146, + "total_submitted": 165547, + "total_column_articles": 922, "frontend_question_id": "701", "is_new_question": false }, @@ -39093,9 +39324,9 @@ "question__title": "Search in a Binary Search Tree", "question__title_slug": "search-in-a-binary-search-tree", "question__hide": false, - "total_acs": 160861, - "total_submitted": 207718, - "total_column_articles": 1161, + "total_acs": 163502, + "total_submitted": 211172, + "total_column_articles": 1183, "frontend_question_id": "700", "is_new_question": false }, @@ -39114,9 +39345,9 @@ "question__title": "Jewels and Stones", "question__title_slug": "jewels-and-stones", "question__hide": false, - "total_acs": 164172, - "total_submitted": 192741, - "total_column_articles": 1234, + "total_acs": 164625, + "total_submitted": 193245, + "total_column_articles": 1243, "frontend_question_id": "771", "is_new_question": false }, @@ -39135,8 +39366,8 @@ "question__title": "Basic Calculator IV", "question__title_slug": "basic-calculator-iv", "question__hide": false, - "total_acs": 1421, - "total_submitted": 2487, + "total_acs": 1440, + "total_submitted": 2520, "total_column_articles": 31, "frontend_question_id": "770", "is_new_question": false @@ -39156,8 +39387,8 @@ "question__title": "Max Chunks To Make Sorted", "question__title_slug": "max-chunks-to-make-sorted", "question__hide": false, - "total_acs": 16595, - "total_submitted": 28413, + "total_acs": 16756, + "total_submitted": 28699, "total_column_articles": 213, "frontend_question_id": "769", "is_new_question": false @@ -39177,8 +39408,8 @@ "question__title": "Max Chunks To Make Sorted II", "question__title_slug": "max-chunks-to-make-sorted-ii", "question__hide": false, - "total_acs": 7290, - "total_submitted": 14067, + "total_acs": 7351, + "total_submitted": 14165, "total_column_articles": 106, "frontend_question_id": "768", "is_new_question": false @@ -39198,9 +39429,9 @@ "question__title": "Reorganize String", "question__title_slug": "reorganize-string", "question__hide": false, - "total_acs": 44322, - "total_submitted": 92494, - "total_column_articles": 529, + "total_acs": 44511, + "total_submitted": 92834, + "total_column_articles": 531, "frontend_question_id": "767", "is_new_question": false }, @@ -39219,9 +39450,9 @@ "question__title": "Toeplitz Matrix", "question__title_slug": "toeplitz-matrix", "question__hide": false, - "total_acs": 60188, - "total_submitted": 85327, - "total_column_articles": 690, + "total_acs": 60382, + "total_submitted": 85598, + "total_column_articles": 691, "frontend_question_id": "766", "is_new_question": false }, @@ -39240,9 +39471,9 @@ "question__title": "N-ary Tree Postorder Traversal", "question__title_slug": "n-ary-tree-postorder-traversal", "question__hide": false, - "total_acs": 104720, - "total_submitted": 134576, - "total_column_articles": 798, + "total_acs": 105507, + "total_submitted": 135514, + "total_column_articles": 801, "frontend_question_id": "590", "is_new_question": false }, @@ -39261,9 +39492,9 @@ "question__title": "N-ary Tree Preorder Traversal", "question__title_slug": "n-ary-tree-preorder-traversal", "question__hide": false, - "total_acs": 143067, - "total_submitted": 188060, - "total_column_articles": 927, + "total_acs": 144242, + "total_submitted": 189544, + "total_column_articles": 935, "frontend_question_id": "589", "is_new_question": false }, @@ -39282,9 +39513,9 @@ "question__title": "Maximum Depth of N-ary Tree", "question__title_slug": "maximum-depth-of-n-ary-tree", "question__hide": false, - "total_acs": 105683, - "total_submitted": 142177, - "total_column_articles": 881, + "total_acs": 106890, + "total_submitted": 143777, + "total_column_articles": 886, "frontend_question_id": "559", "is_new_question": false }, @@ -39303,9 +39534,9 @@ "question__title": "Logical OR of Two Binary Grids Represented as Quad-Trees", "question__title_slug": "logical-or-of-two-binary-grids-represented-as-quad-trees", "question__hide": false, - "total_acs": 3363, - "total_submitted": 6604, - "total_column_articles": 46, + "total_acs": 3427, + "total_submitted": 6731, + "total_column_articles": 49, "frontend_question_id": "558", "is_new_question": false }, @@ -39324,9 +39555,9 @@ "question__title": "Construct Quad Tree", "question__title_slug": "construct-quad-tree", "question__hide": false, - "total_acs": 5032, - "total_submitted": 8122, - "total_column_articles": 85, + "total_acs": 22710, + "total_submitted": 31777, + "total_column_articles": 305, "frontend_question_id": "427", "is_new_question": false }, @@ -39345,8 +39576,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": 1219, - "total_submitted": 1649, + "total_acs": 1237, + "total_submitted": 1671, "total_column_articles": 36, "frontend_question_id": "431", "is_new_question": false @@ -39366,9 +39597,9 @@ "question__title": "Couples Holding Hands", "question__title_slug": "couples-holding-hands", "question__hide": false, - "total_acs": 31923, - "total_submitted": 48109, - "total_column_articles": 484, + "total_acs": 32054, + "total_submitted": 48290, + "total_column_articles": 486, "frontend_question_id": "765", "is_new_question": false }, @@ -39387,8 +39618,8 @@ "question__title": "Largest Plus Sign", "question__title_slug": "largest-plus-sign", "question__hide": false, - "total_acs": 4940, - "total_submitted": 9929, + "total_acs": 4967, + "total_submitted": 9987, "total_column_articles": 68, "frontend_question_id": "764", "is_new_question": false @@ -39408,9 +39639,9 @@ "question__title": "Partition Labels", "question__title_slug": "partition-labels", "question__hide": false, - "total_acs": 109906, - "total_submitted": 143581, - "total_column_articles": 1203, + "total_acs": 111466, + "total_submitted": 145552, + "total_column_articles": 1212, "frontend_question_id": "763", "is_new_question": false }, @@ -39429,9 +39660,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": 51037, - "total_submitted": 67430, - "total_column_articles": 445, + "total_acs": 51268, + "total_submitted": 67721, + "total_column_articles": 447, "frontend_question_id": "762", "is_new_question": false }, @@ -39450,9 +39681,9 @@ "question__title": "Flatten a Multilevel Doubly Linked List", "question__title_slug": "flatten-a-multilevel-doubly-linked-list", "question__hide": false, - "total_acs": 50380, - "total_submitted": 85223, - "total_column_articles": 746, + "total_acs": 50673, + "total_submitted": 85710, + "total_column_articles": 751, "frontend_question_id": "430", "is_new_question": false }, @@ -39471,8 +39702,8 @@ "question__title": "Serialize and Deserialize N-ary Tree", "question__title_slug": "serialize-and-deserialize-n-ary-tree", "question__hide": false, - "total_acs": 3708, - "total_submitted": 5579, + "total_acs": 3743, + "total_submitted": 5620, "total_column_articles": 69, "frontend_question_id": "428", "is_new_question": false @@ -39492,9 +39723,9 @@ "question__title": "N-ary Tree Level Order Traversal", "question__title_slug": "n-ary-tree-level-order-traversal", "question__hide": false, - "total_acs": 110816, - "total_submitted": 154320, - "total_column_articles": 917, + "total_acs": 112326, + "total_submitted": 156394, + "total_column_articles": 924, "frontend_question_id": "429", "is_new_question": false }, @@ -39513,8 +39744,8 @@ "question__title": "Special Binary String", "question__title_slug": "special-binary-string", "question__hide": false, - "total_acs": 2417, - "total_submitted": 4065, + "total_acs": 2427, + "total_submitted": 4086, "total_column_articles": 39, "frontend_question_id": "761", "is_new_question": false @@ -39534,9 +39765,9 @@ "question__title": "Find Anagram Mappings", "question__title_slug": "find-anagram-mappings", "question__hide": false, - "total_acs": 4662, - "total_submitted": 5578, - "total_column_articles": 104, + "total_acs": 4679, + "total_submitted": 5598, + "total_column_articles": 105, "frontend_question_id": "760", "is_new_question": false }, @@ -39555,8 +39786,8 @@ "question__title": "Employee Free Time", "question__title_slug": "employee-free-time", "question__hide": false, - "total_acs": 2746, - "total_submitted": 4021, + "total_acs": 2793, + "total_submitted": 4097, "total_column_articles": 56, "frontend_question_id": "759", "is_new_question": false @@ -39576,9 +39807,9 @@ "question__title": "Bold Words in String", "question__title_slug": "bold-words-in-string", "question__hide": false, - "total_acs": 3833, - "total_submitted": 8080, - "total_column_articles": 75, + "total_acs": 3844, + "total_submitted": 8092, + "total_column_articles": 76, "frontend_question_id": "758", "is_new_question": false }, @@ -39597,8 +39828,8 @@ "question__title": "Set Intersection Size At Least Two", "question__title_slug": "set-intersection-size-at-least-two", "question__hide": false, - "total_acs": 2879, - "total_submitted": 6701, + "total_acs": 2896, + "total_submitted": 6741, "total_column_articles": 43, "frontend_question_id": "757", "is_new_question": false @@ -39618,9 +39849,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": 10062, - "total_submitted": 14830, - "total_column_articles": 155, + "total_acs": 10194, + "total_submitted": 15018, + "total_column_articles": 156, "frontend_question_id": "426", "is_new_question": false }, @@ -39639,9 +39870,9 @@ "question__title": "Pyramid Transition Matrix", "question__title_slug": "pyramid-transition-matrix", "question__hide": false, - "total_acs": 5329, - "total_submitted": 9711, - "total_column_articles": 84, + "total_acs": 5349, + "total_submitted": 9755, + "total_column_articles": 85, "frontend_question_id": "756", "is_new_question": false }, @@ -39660,8 +39891,8 @@ "question__title": "Pour Water", "question__title_slug": "pour-water", "question__hide": false, - "total_acs": 1549, - "total_submitted": 3133, + "total_acs": 1557, + "total_submitted": 3150, "total_column_articles": 36, "frontend_question_id": "755", "is_new_question": false @@ -39681,9 +39912,9 @@ "question__title": "Reach a Number", "question__title_slug": "reach-a-number", "question__hide": false, - "total_acs": 9764, - "total_submitted": 22244, - "total_column_articles": 110, + "total_acs": 9871, + "total_submitted": 22483, + "total_column_articles": 112, "frontend_question_id": "754", "is_new_question": false }, @@ -39702,8 +39933,8 @@ "question__title": "Cracking the Safe", "question__title_slug": "cracking-the-safe", "question__hide": false, - "total_acs": 4112, - "total_submitted": 6760, + "total_acs": 4153, + "total_submitted": 6818, "total_column_articles": 58, "frontend_question_id": "753", "is_new_question": false @@ -39723,9 +39954,9 @@ "question__title": "Open the Lock", "question__title_slug": "open-the-lock", "question__hide": false, - "total_acs": 88435, - "total_submitted": 166879, - "total_column_articles": 868, + "total_acs": 89346, + "total_submitted": 168539, + "total_column_articles": 880, "frontend_question_id": "752", "is_new_question": false }, @@ -39744,8 +39975,8 @@ "question__title": "IP to CIDR", "question__title_slug": "ip-to-cidr", "question__hide": false, - "total_acs": 1544, - "total_submitted": 3197, + "total_acs": 1550, + "total_submitted": 3222, "total_column_articles": 30, "frontend_question_id": "751", "is_new_question": false @@ -39765,8 +39996,8 @@ "question__title": "Number Of Corner Rectangles", "question__title_slug": "number-of-corner-rectangles", "question__hide": false, - "total_acs": 2498, - "total_submitted": 3438, + "total_acs": 2534, + "total_submitted": 3489, "total_column_articles": 48, "frontend_question_id": "750", "is_new_question": false @@ -39786,9 +40017,9 @@ "question__title": "Contain Virus", "question__title_slug": "contain-virus", "question__hide": false, - "total_acs": 1928, - "total_submitted": 3849, - "total_column_articles": 44, + "total_acs": 1941, + "total_submitted": 3870, + "total_column_articles": 45, "frontend_question_id": "749", "is_new_question": false }, @@ -39807,9 +40038,9 @@ "question__title": "Shortest Completing Word", "question__title_slug": "shortest-completing-word", "question__hide": false, - "total_acs": 41125, - "total_submitted": 60622, - "total_column_articles": 505, + "total_acs": 41263, + "total_submitted": 60833, + "total_column_articles": 508, "frontend_question_id": "748", "is_new_question": false }, @@ -39828,9 +40059,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": 82290, - "total_submitted": 179642, - "total_column_articles": 831, + "total_acs": 82577, + "total_submitted": 180197, + "total_column_articles": 833, "frontend_question_id": "747", "is_new_question": false }, @@ -39849,9 +40080,9 @@ "question__title": "Min Cost Climbing Stairs", "question__title_slug": "min-cost-climbing-stairs", "question__hide": false, - "total_acs": 203801, - "total_submitted": 331024, - "total_column_articles": 1782, + "total_acs": 206389, + "total_submitted": 334636, + "total_column_articles": 1790, "frontend_question_id": "746", "is_new_question": false }, @@ -39870,9 +40101,9 @@ "question__title": "Prefix and Suffix Search", "question__title_slug": "prefix-and-suffix-search", "question__hide": false, - "total_acs": 3811, - "total_submitted": 9320, - "total_column_articles": 69, + "total_acs": 3846, + "total_submitted": 9389, + "total_column_articles": 71, "frontend_question_id": "745", "is_new_question": false }, @@ -39891,9 +40122,9 @@ "question__title": "Find Smallest Letter Greater Than Target", "question__title_slug": "find-smallest-letter-greater-than-target", "question__hide": false, - "total_acs": 84782, - "total_submitted": 170672, - "total_column_articles": 738, + "total_acs": 85917, + "total_submitted": 173126, + "total_column_articles": 749, "frontend_question_id": "744", "is_new_question": false }, @@ -39912,9 +40143,9 @@ "question__title": "Network Delay Time", "question__title_slug": "network-delay-time", "question__hide": false, - "total_acs": 75287, - "total_submitted": 139674, - "total_column_articles": 649, + "total_acs": 76266, + "total_submitted": 141340, + "total_column_articles": 656, "frontend_question_id": "743", "is_new_question": false }, @@ -39933,9 +40164,9 @@ "question__title": "Closest Leaf in a Binary Tree", "question__title_slug": "closest-leaf-in-a-binary-tree", "question__hide": false, - "total_acs": 1970, - "total_submitted": 4017, - "total_column_articles": 65, + "total_acs": 1984, + "total_submitted": 4042, + "total_column_articles": 66, "frontend_question_id": "742", "is_new_question": false }, @@ -39954,9 +40185,9 @@ "question__title": "To Lower Case", "question__title_slug": "to-lower-case", "question__hide": false, - "total_acs": 105919, - "total_submitted": 137002, - "total_column_articles": 773, + "total_acs": 106358, + "total_submitted": 137583, + "total_column_articles": 780, "frontend_question_id": "709", "is_new_question": false }, @@ -39975,9 +40206,9 @@ "question__title": "Cherry Pickup", "question__title_slug": "cherry-pickup", "question__hide": false, - "total_acs": 4993, - "total_submitted": 13054, - "total_column_articles": 59, + "total_acs": 5048, + "total_submitted": 13162, + "total_column_articles": 60, "frontend_question_id": "741", "is_new_question": false }, @@ -39996,9 +40227,9 @@ "question__title": "Delete and Earn", "question__title_slug": "delete-and-earn", "question__hide": false, - "total_acs": 76799, - "total_submitted": 122609, - "total_column_articles": 795, + "total_acs": 77658, + "total_submitted": 123941, + "total_column_articles": 800, "frontend_question_id": "740", "is_new_question": false }, @@ -40017,9 +40248,9 @@ "question__title": "Daily Temperatures", "question__title_slug": "daily-temperatures", "question__hide": false, - "total_acs": 286264, - "total_submitted": 415057, - "total_column_articles": 1955, + "total_acs": 290431, + "total_submitted": 420821, + "total_column_articles": 1976, "frontend_question_id": "739", "is_new_question": false }, @@ -40038,9 +40269,9 @@ "question__title": "Monotone Increasing Digits", "question__title_slug": "monotone-increasing-digits", "question__hide": false, - "total_acs": 55718, - "total_submitted": 111533, - "total_column_articles": 701, + "total_acs": 56595, + "total_submitted": 113325, + "total_column_articles": 714, "frontend_question_id": "738", "is_new_question": false }, @@ -40059,9 +40290,9 @@ "question__title": "Sentence Similarity II", "question__title_slug": "sentence-similarity-ii", "question__hide": false, - "total_acs": 4752, - "total_submitted": 10090, - "total_column_articles": 86, + "total_acs": 4808, + "total_submitted": 10174, + "total_column_articles": 88, "frontend_question_id": "737", "is_new_question": false }, @@ -40080,9 +40311,9 @@ "question__title": "Parse Lisp Expression", "question__title_slug": "parse-lisp-expression", "question__hide": false, - "total_acs": 1811, - "total_submitted": 3824, - "total_column_articles": 55, + "total_acs": 1824, + "total_submitted": 3850, + "total_column_articles": 56, "frontend_question_id": "736", "is_new_question": false }, @@ -40101,9 +40332,9 @@ "question__title": "Asteroid Collision", "question__title_slug": "asteroid-collision", "question__hide": false, - "total_acs": 28610, - "total_submitted": 69352, - "total_column_articles": 350, + "total_acs": 28894, + "total_submitted": 70028, + "total_column_articles": 352, "frontend_question_id": "735", "is_new_question": false }, @@ -40122,8 +40353,8 @@ "question__title": "Sentence Similarity", "question__title_slug": "sentence-similarity", "question__hide": false, - "total_acs": 2604, - "total_submitted": 5465, + "total_acs": 2635, + "total_submitted": 5529, "total_column_articles": 47, "frontend_question_id": "734", "is_new_question": false @@ -40143,9 +40374,9 @@ "question__title": "Flood Fill", "question__title_slug": "flood-fill", "question__hide": false, - "total_acs": 106226, - "total_submitted": 182838, - "total_column_articles": 904, + "total_acs": 107730, + "total_submitted": 185393, + "total_column_articles": 914, "frontend_question_id": "733", "is_new_question": false }, @@ -40164,9 +40395,9 @@ "question__title": "My Calendar III", "question__title_slug": "my-calendar-iii", "question__hide": false, - "total_acs": 4642, - "total_submitted": 7418, - "total_column_articles": 68, + "total_acs": 4733, + "total_submitted": 7543, + "total_column_articles": 71, "frontend_question_id": "732", "is_new_question": false }, @@ -40185,9 +40416,9 @@ "question__title": "My Calendar II", "question__title_slug": "my-calendar-ii", "question__hide": false, - "total_acs": 5401, - "total_submitted": 10623, - "total_column_articles": 61, + "total_acs": 5497, + "total_submitted": 10820, + "total_column_articles": 63, "frontend_question_id": "731", "is_new_question": false }, @@ -40206,9 +40437,9 @@ "question__title": "Count Different Palindromic Subsequences", "question__title_slug": "count-different-palindromic-subsequences", "question__hide": false, - "total_acs": 4550, - "total_submitted": 9096, - "total_column_articles": 58, + "total_acs": 4583, + "total_submitted": 9152, + "total_column_articles": 59, "frontend_question_id": "730", "is_new_question": false }, @@ -40227,9 +40458,9 @@ "question__title": "My Calendar I", "question__title_slug": "my-calendar-i", "question__hide": false, - "total_acs": 12890, - "total_submitted": 24089, - "total_column_articles": 154, + "total_acs": 13193, + "total_submitted": 24632, + "total_column_articles": 157, "frontend_question_id": "729", "is_new_question": false }, @@ -40248,9 +40479,9 @@ "question__title": "Self Dividing Numbers", "question__title_slug": "self-dividing-numbers", "question__hide": false, - "total_acs": 70381, - "total_submitted": 89190, - "total_column_articles": 649, + "total_acs": 70583, + "total_submitted": 89506, + "total_column_articles": 655, "frontend_question_id": "728", "is_new_question": false }, @@ -40269,9 +40500,9 @@ "question__title": "Minimum Window Subsequence", "question__title_slug": "minimum-window-subsequence", "question__hide": false, - "total_acs": 4195, - "total_submitted": 10248, - "total_column_articles": 61, + "total_acs": 4254, + "total_submitted": 10390, + "total_column_articles": 64, "frontend_question_id": "727", "is_new_question": false }, @@ -40290,9 +40521,9 @@ "question__title": "Number of Atoms", "question__title_slug": "number-of-atoms", "question__hide": false, - "total_acs": 23818, - "total_submitted": 43128, - "total_column_articles": 432, + "total_acs": 23905, + "total_submitted": 43304, + "total_column_articles": 435, "frontend_question_id": "726", "is_new_question": false }, @@ -40311,9 +40542,9 @@ "question__title": "Split Linked List in Parts", "question__title_slug": "split-linked-list-in-parts", "question__hide": false, - "total_acs": 53461, - "total_submitted": 88146, - "total_column_articles": 674, + "total_acs": 53658, + "total_submitted": 88487, + "total_column_articles": 677, "frontend_question_id": "725", "is_new_question": false }, @@ -40332,9 +40563,9 @@ "question__title": "Find Pivot Index", "question__title_slug": "find-pivot-index", "question__hide": false, - "total_acs": 176521, - "total_submitted": 364406, - "total_column_articles": 1037, + "total_acs": 178267, + "total_submitted": 367388, + "total_column_articles": 1042, "frontend_question_id": "724", "is_new_question": false }, @@ -40353,8 +40584,8 @@ "question__title": "Candy Crush", "question__title_slug": "candy-crush", "question__hide": false, - "total_acs": 1711, - "total_submitted": 2340, + "total_acs": 1720, + "total_submitted": 2351, "total_column_articles": 46, "frontend_question_id": "723", "is_new_question": false @@ -40374,8 +40605,8 @@ "question__title": "Remove Comments", "question__title_slug": "remove-comments", "question__hide": false, - "total_acs": 6072, - "total_submitted": 18566, + "total_acs": 6116, + "total_submitted": 18687, "total_column_articles": 86, "frontend_question_id": "722", "is_new_question": false @@ -40395,9 +40626,9 @@ "question__title": "Accounts Merge", "question__title_slug": "accounts-merge", "question__hide": false, - "total_acs": 32630, - "total_submitted": 68824, - "total_column_articles": 367, + "total_acs": 32836, + "total_submitted": 69173, + "total_column_articles": 370, "frontend_question_id": "721", "is_new_question": false }, @@ -40416,9 +40647,9 @@ "question__title": "Longest Word in Dictionary", "question__title_slug": "longest-word-in-dictionary", "question__hide": false, - "total_acs": 57271, - "total_submitted": 110316, - "total_column_articles": 623, + "total_acs": 57742, + "total_submitted": 111252, + "total_column_articles": 625, "frontend_question_id": "720", "is_new_question": false }, @@ -40437,9 +40668,9 @@ "question__title": "Find K-th Smallest Pair Distance", "question__title_slug": "find-k-th-smallest-pair-distance", "question__hide": false, - "total_acs": 11472, - "total_submitted": 29740, - "total_column_articles": 115, + "total_acs": 11581, + "total_submitted": 29955, + "total_column_articles": 118, "frontend_question_id": "719", "is_new_question": false }, @@ -40458,9 +40689,9 @@ "question__title": "Maximum Length of Repeated Subarray", "question__title_slug": "maximum-length-of-repeated-subarray", "question__hide": false, - "total_acs": 117680, - "total_submitted": 207659, - "total_column_articles": 738, + "total_acs": 119850, + "total_submitted": 211409, + "total_column_articles": 750, "frontend_question_id": "718", "is_new_question": false }, @@ -40479,9 +40710,9 @@ "question__title": "1-bit and 2-bit Characters", "question__title_slug": "1-bit-and-2-bit-characters", "question__hide": false, - "total_acs": 61920, - "total_submitted": 111684, - "total_column_articles": 744, + "total_acs": 62062, + "total_submitted": 111912, + "total_column_articles": 746, "frontend_question_id": "717", "is_new_question": false }, @@ -40500,8 +40731,8 @@ "question__title": "Max Stack", "question__title_slug": "max-stack", "question__hide": false, - "total_acs": 5632, - "total_submitted": 11915, + "total_acs": 5695, + "total_submitted": 12041, "total_column_articles": 94, "frontend_question_id": "716", "is_new_question": false @@ -40521,9 +40752,9 @@ "question__title": "Range Module", "question__title_slug": "range-module", "question__hide": false, - "total_acs": 3622, - "total_submitted": 8517, - "total_column_articles": 63, + "total_acs": 3678, + "total_submitted": 8680, + "total_column_articles": 66, "frontend_question_id": "715", "is_new_question": false }, @@ -40542,9 +40773,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": 140807, - "total_submitted": 190988, - "total_column_articles": 921, + "total_acs": 143103, + "total_submitted": 194012, + "total_column_articles": 937, "frontend_question_id": "714", "is_new_question": false }, @@ -40563,9 +40794,9 @@ "question__title": "Subarray Product Less Than K", "question__title_slug": "subarray-product-less-than-k", "question__hide": false, - "total_acs": 41449, - "total_submitted": 94069, - "total_column_articles": 354, + "total_acs": 42316, + "total_submitted": 95815, + "total_column_articles": 360, "frontend_question_id": "713", "is_new_question": false }, @@ -40584,9 +40815,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": 20799, - "total_submitted": 30768, - "total_column_articles": 233, + "total_acs": 21092, + "total_submitted": 31213, + "total_column_articles": 237, "frontend_question_id": "712", "is_new_question": false }, @@ -40605,8 +40836,8 @@ "question__title": "Number of Distinct Islands II", "question__title_slug": "number-of-distinct-islands-ii", "question__hide": false, - "total_acs": 963, - "total_submitted": 1702, + "total_acs": 970, + "total_submitted": 1714, "total_column_articles": 31, "frontend_question_id": "711", "is_new_question": false @@ -40626,9 +40857,9 @@ "question__title": "Falling Squares", "question__title_slug": "falling-squares", "question__hide": false, - "total_acs": 3684, - "total_submitted": 7488, - "total_column_articles": 52, + "total_acs": 3744, + "total_submitted": 7589, + "total_column_articles": 56, "frontend_question_id": "699", "is_new_question": false }, @@ -40647,9 +40878,9 @@ "question__title": "Partition to K Equal Sum Subsets", "question__title_slug": "partition-to-k-equal-sum-subsets", "question__hide": false, - "total_acs": 44107, - "total_submitted": 105176, - "total_column_articles": 715, + "total_acs": 45032, + "total_submitted": 107446, + "total_column_articles": 749, "frontend_question_id": "698", "is_new_question": false }, @@ -40668,9 +40899,9 @@ "question__title": "Degree of an Array", "question__title_slug": "degree-of-an-array", "question__hide": false, - "total_acs": 74646, - "total_submitted": 124107, - "total_column_articles": 929, + "total_acs": 74981, + "total_submitted": 124721, + "total_column_articles": 936, "frontend_question_id": "697", "is_new_question": false }, @@ -40689,9 +40920,9 @@ "question__title": "Count Binary Substrings", "question__title_slug": "count-binary-substrings", "question__hide": false, - "total_acs": 59025, - "total_submitted": 92761, - "total_column_articles": 531, + "total_acs": 59331, + "total_submitted": 93217, + "total_column_articles": 535, "frontend_question_id": "696", "is_new_question": false }, @@ -40710,9 +40941,9 @@ "question__title": "Max Area of Island", "question__title_slug": "max-area-of-island", "question__hide": false, - "total_acs": 195169, - "total_submitted": 289359, - "total_column_articles": 1911, + "total_acs": 197992, + "total_submitted": 293462, + "total_column_articles": 1936, "frontend_question_id": "695", "is_new_question": false }, @@ -40731,9 +40962,9 @@ "question__title": "Number of Distinct Islands", "question__title_slug": "number-of-distinct-islands", "question__hide": false, - "total_acs": 6563, - "total_submitted": 11862, - "total_column_articles": 112, + "total_acs": 6730, + "total_submitted": 12183, + "total_column_articles": 118, "frontend_question_id": "694", "is_new_question": false }, @@ -40752,9 +40983,9 @@ "question__title": "Binary Number with Alternating Bits", "question__title_slug": "binary-number-with-alternating-bits", "question__hide": false, - "total_acs": 68132, - "total_submitted": 104159, - "total_column_articles": 739, + "total_acs": 68364, + "total_submitted": 104545, + "total_column_articles": 740, "frontend_question_id": "693", "is_new_question": false }, @@ -40773,9 +41004,9 @@ "question__title": "Top K Frequent Words", "question__title_slug": "top-k-frequent-words", "question__hide": false, - "total_acs": 79872, - "total_submitted": 140206, - "total_column_articles": 859, + "total_acs": 80307, + "total_submitted": 140988, + "total_column_articles": 862, "frontend_question_id": "692", "is_new_question": false }, @@ -40794,9 +41025,9 @@ "question__title": "Stickers to Spell Word", "question__title_slug": "stickers-to-spell-word", "question__hide": false, - "total_acs": 5279, - "total_submitted": 11189, - "total_column_articles": 63, + "total_acs": 5337, + "total_submitted": 11372, + "total_column_articles": 64, "frontend_question_id": "691", "is_new_question": false }, @@ -40815,9 +41046,9 @@ "question__title": "Employee Importance", "question__title_slug": "employee-importance", "question__hide": false, - "total_acs": 59776, - "total_submitted": 91782, - "total_column_articles": 613, + "total_acs": 59908, + "total_submitted": 91986, + "total_column_articles": 614, "frontend_question_id": "690", "is_new_question": false }, @@ -40836,8 +41067,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": 20847, - "total_submitted": 37030, + "total_acs": 20938, + "total_submitted": 37199, "total_column_articles": 274, "frontend_question_id": "689", "is_new_question": false @@ -40857,9 +41088,9 @@ "question__title": "Knight Probability in Chessboard", "question__title_slug": "knight-probability-in-chessboard", "question__hide": false, - "total_acs": 31834, - "total_submitted": 54561, - "total_column_articles": 356, + "total_acs": 31945, + "total_submitted": 54754, + "total_column_articles": 357, "frontend_question_id": "688", "is_new_question": false }, @@ -40878,9 +41109,9 @@ "question__title": "Longest Univalue Path", "question__title_slug": "longest-univalue-path", "question__hide": false, - "total_acs": 44468, - "total_submitted": 99203, - "total_column_articles": 318, + "total_acs": 44746, + "total_submitted": 99748, + "total_column_articles": 321, "frontend_question_id": "687", "is_new_question": false }, @@ -40899,9 +41130,9 @@ "question__title": "Repeated String Match", "question__title_slug": "repeated-string-match", "question__hide": false, - "total_acs": 44611, - "total_submitted": 111260, - "total_column_articles": 584, + "total_acs": 44723, + "total_submitted": 111569, + "total_column_articles": 585, "frontend_question_id": "686", "is_new_question": false }, @@ -40920,9 +41151,9 @@ "question__title": "Redundant Connection II", "question__title_slug": "redundant-connection-ii", "question__hide": false, - "total_acs": 22324, - "total_submitted": 52711, - "total_column_articles": 286, + "total_acs": 22478, + "total_submitted": 53128, + "total_column_articles": 289, "frontend_question_id": "685", "is_new_question": false }, @@ -40941,9 +41172,9 @@ "question__title": "Redundant Connection", "question__title_slug": "redundant-connection", "question__hide": false, - "total_acs": 72180, - "total_submitted": 107831, - "total_column_articles": 741, + "total_acs": 72872, + "total_submitted": 108779, + "total_column_articles": 746, "frontend_question_id": "684", "is_new_question": false }, @@ -40962,8 +41193,8 @@ "question__title": "K Empty Slots", "question__title_slug": "k-empty-slots", "question__hide": false, - "total_acs": 2987, - "total_submitted": 6677, + "total_acs": 3014, + "total_submitted": 6733, "total_column_articles": 65, "frontend_question_id": "683", "is_new_question": false @@ -40983,9 +41214,9 @@ "question__title": "Baseball Game", "question__title_slug": "baseball-game", "question__hide": false, - "total_acs": 80046, - "total_submitted": 110781, - "total_column_articles": 868, + "total_acs": 80448, + "total_submitted": 111398, + "total_column_articles": 869, "frontend_question_id": "682", "is_new_question": false }, @@ -41004,8 +41235,8 @@ "question__title": "Next Closest Time", "question__title_slug": "next-closest-time", "question__hide": false, - "total_acs": 3271, - "total_submitted": 6580, + "total_acs": 3293, + "total_submitted": 6620, "total_column_articles": 80, "frontend_question_id": "681", "is_new_question": false @@ -41025,9 +41256,9 @@ "question__title": "Valid Palindrome II", "question__title_slug": "valid-palindrome-ii", "question__hide": false, - "total_acs": 106714, - "total_submitted": 266274, - "total_column_articles": 983, + "total_acs": 107585, + "total_submitted": 268528, + "total_column_articles": 990, "frontend_question_id": "680", "is_new_question": false }, @@ -41046,9 +41277,9 @@ "question__title": "24 Game", "question__title_slug": "24-game", "question__hide": false, - "total_acs": 31314, - "total_submitted": 57926, - "total_column_articles": 305, + "total_acs": 32046, + "total_submitted": 59466, + "total_column_articles": 315, "frontend_question_id": "679", "is_new_question": false }, @@ -41067,9 +41298,9 @@ "question__title": "Valid Parenthesis String", "question__title_slug": "valid-parenthesis-string", "question__hide": false, - "total_acs": 53259, - "total_submitted": 136802, - "total_column_articles": 549, + "total_acs": 53604, + "total_submitted": 137700, + "total_column_articles": 551, "frontend_question_id": "678", "is_new_question": false }, @@ -41088,9 +41319,9 @@ "question__title": "Map Sum Pairs", "question__title_slug": "map-sum-pairs", "question__hide": false, - "total_acs": 40167, - "total_submitted": 60442, - "total_column_articles": 589, + "total_acs": 40351, + "total_submitted": 60729, + "total_column_articles": 593, "frontend_question_id": "677", "is_new_question": false }, @@ -41109,9 +41340,9 @@ "question__title": "Implement Magic Dictionary", "question__title_slug": "implement-magic-dictionary", "question__hide": false, - "total_acs": 10277, - "total_submitted": 17199, - "total_column_articles": 174, + "total_acs": 10402, + "total_submitted": 17408, + "total_column_articles": 179, "frontend_question_id": "676", "is_new_question": false }, @@ -41130,9 +41361,9 @@ "question__title": "Cut Off Trees for Golf Event", "question__title_slug": "cut-off-trees-for-golf-event", "question__hide": false, - "total_acs": 3743, - "total_submitted": 9030, - "total_column_articles": 59, + "total_acs": 3768, + "total_submitted": 9113, + "total_column_articles": 61, "frontend_question_id": "675", "is_new_question": false }, @@ -41151,9 +41382,9 @@ "question__title": "Longest Continuous Increasing Subsequence", "question__title_slug": "longest-continuous-increasing-subsequence", "question__hide": false, - "total_acs": 121853, - "total_submitted": 233227, - "total_column_articles": 970, + "total_acs": 123709, + "total_submitted": 236266, + "total_column_articles": 985, "frontend_question_id": "674", "is_new_question": false }, @@ -41172,9 +41403,9 @@ "question__title": "Number of Longest Increasing Subsequence", "question__title_slug": "number-of-longest-increasing-subsequence", "question__hide": false, - "total_acs": 61515, - "total_submitted": 139895, - "total_column_articles": 509, + "total_acs": 62168, + "total_submitted": 141328, + "total_column_articles": 514, "frontend_question_id": "673", "is_new_question": false }, @@ -41193,9 +41424,9 @@ "question__title": "Bulb Switcher II", "question__title_slug": "bulb-switcher-ii", "question__hide": false, - "total_acs": 4570, - "total_submitted": 8414, - "total_column_articles": 52, + "total_acs": 4603, + "total_submitted": 8483, + "total_column_articles": 53, "frontend_question_id": "672", "is_new_question": false }, @@ -41214,9 +41445,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": 59846, - "total_submitted": 123879, - "total_column_articles": 752, + "total_acs": 60163, + "total_submitted": 124590, + "total_column_articles": 757, "frontend_question_id": "671", "is_new_question": false }, @@ -41235,9 +41466,9 @@ "question__title": "Maximum Swap", "question__title_slug": "maximum-swap", "question__hide": false, - "total_acs": 25158, - "total_submitted": 54640, - "total_column_articles": 362, + "total_acs": 25444, + "total_submitted": 55269, + "total_column_articles": 364, "frontend_question_id": "670", "is_new_question": false }, @@ -41256,9 +41487,9 @@ "question__title": "Trim a Binary Search Tree", "question__title_slug": "trim-a-binary-search-tree", "question__hide": false, - "total_acs": 56448, - "total_submitted": 84711, - "total_column_articles": 450, + "total_acs": 57699, + "total_submitted": 86623, + "total_column_articles": 458, "frontend_question_id": "669", "is_new_question": false }, @@ -41277,9 +41508,9 @@ "question__title": "Kth Smallest Number in Multiplication Table", "question__title_slug": "kth-smallest-number-in-multiplication-table", "question__hide": false, - "total_acs": 8419, - "total_submitted": 16219, - "total_column_articles": 95, + "total_acs": 8473, + "total_submitted": 16298, + "total_column_articles": 99, "frontend_question_id": "668", "is_new_question": false }, @@ -41298,9 +41529,9 @@ "question__title": "Beautiful Arrangement II", "question__title_slug": "beautiful-arrangement-ii", "question__hide": false, - "total_acs": 9311, - "total_submitted": 14970, - "total_column_articles": 139, + "total_acs": 9381, + "total_submitted": 15067, + "total_column_articles": 140, "frontend_question_id": "667", "is_new_question": false }, @@ -41319,8 +41550,8 @@ "question__title": "Path Sum IV", "question__title_slug": "path-sum-iv", "question__hide": false, - "total_acs": 2651, - "total_submitted": 4297, + "total_acs": 2671, + "total_submitted": 4328, "total_column_articles": 94, "frontend_question_id": "666", "is_new_question": false @@ -41340,9 +41571,9 @@ "question__title": "Non-decreasing Array", "question__title_slug": "non-decreasing-array", "question__hide": false, - "total_acs": 83663, - "total_submitted": 305870, - "total_column_articles": 1019, + "total_acs": 84069, + "total_submitted": 307173, + "total_column_articles": 1021, "frontend_question_id": "665", "is_new_question": false }, @@ -41361,8 +41592,8 @@ "question__title": "Strange Printer", "question__title_slug": "strange-printer", "question__hide": false, - "total_acs": 23629, - "total_submitted": 36134, + "total_acs": 23700, + "total_submitted": 36223, "total_column_articles": 201, "frontend_question_id": "664", "is_new_question": false @@ -41382,8 +41613,8 @@ "question__title": "Equal Tree Partition", "question__title_slug": "equal-tree-partition", "question__hide": false, - "total_acs": 2177, - "total_submitted": 4750, + "total_acs": 2195, + "total_submitted": 4795, "total_column_articles": 47, "frontend_question_id": "663", "is_new_question": false @@ -41403,9 +41634,9 @@ "question__title": "Maximum Width of Binary Tree", "question__title_slug": "maximum-width-of-binary-tree", "question__hide": false, - "total_acs": 41828, - "total_submitted": 102240, - "total_column_articles": 389, + "total_acs": 42678, + "total_submitted": 104197, + "total_column_articles": 394, "frontend_question_id": "662", "is_new_question": false }, @@ -41424,8 +41655,8 @@ "question__title": "Image Smoother", "question__title_slug": "image-smoother", "question__hide": false, - "total_acs": 45565, - "total_submitted": 70602, + "total_acs": 45760, + "total_submitted": 70902, "total_column_articles": 492, "frontend_question_id": "661", "is_new_question": false @@ -41445,8 +41676,8 @@ "question__title": "Remove 9", "question__title_slug": "remove-9", "question__hide": false, - "total_acs": 944, - "total_submitted": 1443, + "total_acs": 952, + "total_submitted": 1461, "total_column_articles": 29, "frontend_question_id": "660", "is_new_question": false @@ -41466,8 +41697,8 @@ "question__title": "Split Array into Consecutive Subsequences", "question__title_slug": "split-array-into-consecutive-subsequences", "question__hide": false, - "total_acs": 30938, - "total_submitted": 57007, + "total_acs": 31103, + "total_submitted": 57302, "total_column_articles": 290, "frontend_question_id": "659", "is_new_question": false @@ -41487,9 +41718,9 @@ "question__title": "Find K Closest Elements", "question__title_slug": "find-k-closest-elements", "question__hide": false, - "total_acs": 36454, - "total_submitted": 79857, - "total_column_articles": 317, + "total_acs": 37137, + "total_submitted": 81283, + "total_column_articles": 321, "frontend_question_id": "658", "is_new_question": false }, @@ -41508,9 +41739,9 @@ "question__title": "Robot Return to Origin", "question__title_slug": "robot-return-to-origin", "question__hide": false, - "total_acs": 88515, - "total_submitted": 112868, - "total_column_articles": 687, + "total_acs": 88868, + "total_submitted": 113315, + "total_column_articles": 692, "frontend_question_id": "657", "is_new_question": false }, @@ -41529,8 +41760,8 @@ "question__title": "Coin Path", "question__title_slug": "coin-path", "question__hide": false, - "total_acs": 1069, - "total_submitted": 3313, + "total_acs": 1074, + "total_submitted": 3338, "total_column_articles": 29, "frontend_question_id": "656", "is_new_question": false @@ -41550,9 +41781,9 @@ "question__title": "Print Binary Tree", "question__title_slug": "print-binary-tree", "question__hide": false, - "total_acs": 11300, - "total_submitted": 18757, - "total_column_articles": 184, + "total_acs": 11362, + "total_submitted": 18857, + "total_column_articles": 187, "frontend_question_id": "655", "is_new_question": false }, @@ -41571,9 +41802,9 @@ "question__title": "Maximum Binary Tree", "question__title_slug": "maximum-binary-tree", "question__hide": false, - "total_acs": 95774, - "total_submitted": 118068, - "total_column_articles": 901, + "total_acs": 97583, + "total_submitted": 120264, + "total_column_articles": 908, "frontend_question_id": "654", "is_new_question": false }, @@ -41592,9 +41823,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": 88705, - "total_submitted": 140841, - "total_column_articles": 801, + "total_acs": 89486, + "total_submitted": 141975, + "total_column_articles": 805, "frontend_question_id": "653", "is_new_question": false }, @@ -41613,9 +41844,9 @@ "question__title": "Find Duplicate Subtrees", "question__title_slug": "find-duplicate-subtrees", "question__hide": false, - "total_acs": 48439, - "total_submitted": 83614, - "total_column_articles": 334, + "total_acs": 49201, + "total_submitted": 84847, + "total_column_articles": 342, "frontend_question_id": "652", "is_new_question": false }, @@ -41634,9 +41865,9 @@ "question__title": "4 Keys Keyboard", "question__title_slug": "4-keys-keyboard", "question__hide": false, - "total_acs": 4737, - "total_submitted": 8032, - "total_column_articles": 78, + "total_acs": 4774, + "total_submitted": 8079, + "total_column_articles": 80, "frontend_question_id": "651", "is_new_question": false }, @@ -41655,9 +41886,9 @@ "question__title": "2 Keys Keyboard", "question__title_slug": "2-keys-keyboard", "question__hide": false, - "total_acs": 55888, - "total_submitted": 98023, - "total_column_articles": 704, + "total_acs": 56174, + "total_submitted": 98521, + "total_column_articles": 706, "frontend_question_id": "650", "is_new_question": false }, @@ -41676,8 +41907,8 @@ "question__title": "Dota2 Senate", "question__title_slug": "dota2-senate", "question__hide": false, - "total_acs": 31395, - "total_submitted": 65552, + "total_acs": 31501, + "total_submitted": 65835, "total_column_articles": 332, "frontend_question_id": "649", "is_new_question": false @@ -41697,9 +41928,9 @@ "question__title": "Replace Words", "question__title_slug": "replace-words", "question__hide": false, - "total_acs": 27310, - "total_submitted": 45728, - "total_column_articles": 363, + "total_acs": 27530, + "total_submitted": 46062, + "total_column_articles": 369, "frontend_question_id": "648", "is_new_question": false }, @@ -41718,9 +41949,9 @@ "question__title": "Palindromic Substrings", "question__title_slug": "palindromic-substrings", "question__hide": false, - "total_acs": 173395, - "total_submitted": 261764, - "total_column_articles": 1209, + "total_acs": 176327, + "total_submitted": 266117, + "total_column_articles": 1224, "frontend_question_id": "647", "is_new_question": false }, @@ -41739,9 +41970,9 @@ "question__title": "Maximum Length of Pair Chain", "question__title_slug": "maximum-length-of-pair-chain", "question__hide": false, - "total_acs": 27870, - "total_submitted": 47936, - "total_column_articles": 254, + "total_acs": 28145, + "total_submitted": 48357, + "total_column_articles": 257, "frontend_question_id": "646", "is_new_question": false }, @@ -41760,9 +41991,9 @@ "question__title": "Set Mismatch", "question__title_slug": "set-mismatch", "question__hide": false, - "total_acs": 80567, - "total_submitted": 192122, - "total_column_articles": 803, + "total_acs": 81136, + "total_submitted": 193756, + "total_column_articles": 808, "frontend_question_id": "645", "is_new_question": false }, @@ -41781,8 +42012,8 @@ "question__title": "Maximum Average Subarray II", "question__title_slug": "maximum-average-subarray-ii", "question__hide": false, - "total_acs": 1511, - "total_submitted": 3634, + "total_acs": 1527, + "total_submitted": 3666, "total_column_articles": 30, "frontend_question_id": "644", "is_new_question": false @@ -41802,9 +42033,9 @@ "question__title": "Maximum Average Subarray I", "question__title_slug": "maximum-average-subarray-i", "question__hide": false, - "total_acs": 77114, - "total_submitted": 173415, - "total_column_articles": 690, + "total_acs": 77706, + "total_submitted": 174833, + "total_column_articles": 698, "frontend_question_id": "643", "is_new_question": false }, @@ -41823,8 +42054,8 @@ "question__title": "Design Search Autocomplete System", "question__title_slug": "design-search-autocomplete-system", "question__hide": false, - "total_acs": 4054, - "total_submitted": 7269, + "total_acs": 4094, + "total_submitted": 7348, "total_column_articles": 69, "frontend_question_id": "642", "is_new_question": false @@ -41844,9 +42075,9 @@ "question__title": "Solve the Equation", "question__title_slug": "solve-the-equation", "question__hide": false, - "total_acs": 12264, - "total_submitted": 28848, - "total_column_articles": 247, + "total_acs": 12326, + "total_submitted": 29025, + "total_column_articles": 249, "frontend_question_id": "640", "is_new_question": false }, @@ -41865,9 +42096,9 @@ "question__title": "Decode Ways II", "question__title_slug": "decode-ways-ii", "question__hide": false, - "total_acs": 21178, - "total_submitted": 56372, - "total_column_articles": 284, + "total_acs": 21283, + "total_submitted": 56614, + "total_column_articles": 286, "frontend_question_id": "639", "is_new_question": false }, @@ -41886,9 +42117,9 @@ "question__title": "Shopping Offers", "question__title_slug": "shopping-offers", "question__hide": false, - "total_acs": 30557, - "total_submitted": 47455, - "total_column_articles": 293, + "total_acs": 30657, + "total_submitted": 47618, + "total_column_articles": 295, "frontend_question_id": "638", "is_new_question": false }, @@ -41907,9 +42138,9 @@ "question__title": "Average of Levels in Binary Tree", "question__title_slug": "average-of-levels-in-binary-tree", "question__hide": false, - "total_acs": 98340, - "total_submitted": 141688, - "total_column_articles": 822, + "total_acs": 99590, + "total_submitted": 143448, + "total_column_articles": 830, "frontend_question_id": "637", "is_new_question": false }, @@ -41928,9 +42159,9 @@ "question__title": "Exclusive Time of Functions", "question__title_slug": "exclusive-time-of-functions", "question__hide": false, - "total_acs": 12438, - "total_submitted": 21836, - "total_column_articles": 141, + "total_acs": 12508, + "total_submitted": 21947, + "total_column_articles": 142, "frontend_question_id": "636", "is_new_question": false }, @@ -41949,8 +42180,8 @@ "question__title": "Design Log Storage System", "question__title_slug": "design-log-storage-system", "question__hide": false, - "total_acs": 5166, - "total_submitted": 9188, + "total_acs": 5192, + "total_submitted": 9227, "total_column_articles": 82, "frontend_question_id": "635", "is_new_question": false @@ -41970,8 +42201,8 @@ "question__title": "Find the Derangement of An Array", "question__title_slug": "find-the-derangement-of-an-array", "question__hide": false, - "total_acs": 1725, - "total_submitted": 3796, + "total_acs": 1743, + "total_submitted": 3828, "total_column_articles": 23, "frontend_question_id": "634", "is_new_question": false @@ -41991,9 +42222,9 @@ "question__title": "Sum of Square Numbers", "question__title_slug": "sum-of-square-numbers", "question__hide": false, - "total_acs": 108274, - "total_submitted": 277743, - "total_column_articles": 877, + "total_acs": 109094, + "total_submitted": 279929, + "total_column_articles": 885, "frontend_question_id": "633", "is_new_question": false }, @@ -42012,9 +42243,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": 20948, - "total_submitted": 34886, - "total_column_articles": 268, + "total_acs": 21034, + "total_submitted": 35023, + "total_column_articles": 270, "frontend_question_id": "632", "is_new_question": false }, @@ -42033,8 +42264,8 @@ "question__title": "Design Excel Sum Formula", "question__title_slug": "design-excel-sum-formula", "question__hide": false, - "total_acs": 1359, - "total_submitted": 4369, + "total_acs": 1371, + "total_submitted": 4398, "total_column_articles": 38, "frontend_question_id": "631", "is_new_question": false @@ -42054,9 +42285,9 @@ "question__title": "Course Schedule III", "question__title_slug": "course-schedule-iii", "question__hide": false, - "total_acs": 25414, - "total_submitted": 54951, - "total_column_articles": 238, + "total_acs": 25524, + "total_submitted": 55189, + "total_column_articles": 240, "frontend_question_id": "630", "is_new_question": false }, @@ -42075,9 +42306,9 @@ "question__title": "K Inverse Pairs Array", "question__title_slug": "k-inverse-pairs-array", "question__hide": false, - "total_acs": 19631, - "total_submitted": 37793, - "total_column_articles": 180, + "total_acs": 19694, + "total_submitted": 37935, + "total_column_articles": 181, "frontend_question_id": "629", "is_new_question": false }, @@ -42096,9 +42327,9 @@ "question__title": "Maximum Product of Three Numbers", "question__title_slug": "maximum-product-of-three-numbers", "question__hide": false, - "total_acs": 92498, - "total_submitted": 176403, - "total_column_articles": 872, + "total_acs": 93010, + "total_submitted": 177419, + "total_column_articles": 877, "frontend_question_id": "628", "is_new_question": false }, @@ -42117,9 +42348,9 @@ "question__title": "Swap Salary", "question__title_slug": "swap-salary", "question__hide": false, - "total_acs": 104744, - "total_submitted": 128630, - "total_column_articles": 427, + "total_acs": 106649, + "total_submitted": 130868, + "total_column_articles": 440, "frontend_question_id": "627", "is_new_question": false }, @@ -42138,9 +42369,9 @@ "question__title": "Exchange Seats", "question__title_slug": "exchange-seats", "question__hide": false, - "total_acs": 54201, - "total_submitted": 79086, - "total_column_articles": 437, + "total_acs": 54618, + "total_submitted": 80224, + "total_column_articles": 444, "frontend_question_id": "626", "is_new_question": false }, @@ -42159,8 +42390,8 @@ "question__title": "Minimum Factorization", "question__title_slug": "minimum-factorization", "question__hide": false, - "total_acs": 2834, - "total_submitted": 8198, + "total_acs": 2850, + "total_submitted": 8236, "total_column_articles": 57, "frontend_question_id": "625", "is_new_question": false @@ -42180,8 +42411,8 @@ "question__title": "Maximum Distance in Arrays", "question__title_slug": "maximum-distance-in-arrays", "question__hide": false, - "total_acs": 2646, - "total_submitted": 6089, + "total_acs": 2663, + "total_submitted": 6138, "total_column_articles": 59, "frontend_question_id": "624", "is_new_question": false @@ -42201,9 +42432,9 @@ "question__title": "Add One Row to Tree", "question__title_slug": "add-one-row-to-tree", "question__hide": false, - "total_acs": 13519, - "total_submitted": 24658, - "total_column_articles": 232, + "total_acs": 13634, + "total_submitted": 24884, + "total_column_articles": 239, "frontend_question_id": "623", "is_new_question": false }, @@ -42222,9 +42453,9 @@ "question__title": "Task Scheduler", "question__title_slug": "task-scheduler", "question__hide": false, - "total_acs": 96580, - "total_submitted": 166228, - "total_column_articles": 619, + "total_acs": 97595, + "total_submitted": 167834, + "total_column_articles": 626, "frontend_question_id": "621", "is_new_question": false }, @@ -42243,9 +42474,9 @@ "question__title": "Not Boring Movies", "question__title_slug": "not-boring-movies", "question__hide": false, - "total_acs": 108971, - "total_submitted": 141128, - "total_column_articles": 374, + "total_acs": 109474, + "total_submitted": 141750, + "total_column_articles": 378, "frontend_question_id": "620", "is_new_question": false }, @@ -42264,9 +42495,9 @@ "question__title": "Biggest Single Number", "question__title_slug": "biggest-single-number", "question__hide": false, - "total_acs": 15659, - "total_submitted": 33876, - "total_column_articles": 103, + "total_acs": 15899, + "total_submitted": 34556, + "total_column_articles": 104, "frontend_question_id": "619", "is_new_question": false }, @@ -42285,9 +42516,9 @@ "question__title": "Students Report By Geography", "question__title_slug": "students-report-by-geography", "question__hide": false, - "total_acs": 6308, - "total_submitted": 10196, - "total_column_articles": 59, + "total_acs": 6384, + "total_submitted": 10303, + "total_column_articles": 61, "frontend_question_id": "618", "is_new_question": false }, @@ -42306,9 +42537,9 @@ "question__title": "Merge Two Binary Trees", "question__title_slug": "merge-two-binary-trees", "question__hide": false, - "total_acs": 269739, - "total_submitted": 341927, - "total_column_articles": 1743, + "total_acs": 273666, + "total_submitted": 346876, + "total_column_articles": 1768, "frontend_question_id": "617", "is_new_question": false }, @@ -42327,9 +42558,9 @@ "question__title": "Add Bold Tag in String", "question__title_slug": "add-bold-tag-in-string", "question__hide": false, - "total_acs": 4564, - "total_submitted": 9378, - "total_column_articles": 74, + "total_acs": 4603, + "total_submitted": 9448, + "total_column_articles": 75, "frontend_question_id": "616", "is_new_question": false }, @@ -42348,9 +42579,9 @@ "question__title": "Average Salary: Departments VS Company", "question__title_slug": "average-salary-departments-vs-company", "question__hide": false, - "total_acs": 7353, - "total_submitted": 17368, - "total_column_articles": 116, + "total_acs": 7417, + "total_submitted": 17656, + "total_column_articles": 118, "frontend_question_id": "615", "is_new_question": false }, @@ -42369,9 +42600,9 @@ "question__title": "Second Degree Follower", "question__title_slug": "second-degree-follower", "question__hide": false, - "total_acs": 11538, - "total_submitted": 31928, - "total_column_articles": 89, + "total_acs": 11646, + "total_submitted": 32261, + "total_column_articles": 91, "frontend_question_id": "614", "is_new_question": false }, @@ -42390,9 +42621,9 @@ "question__title": "Shortest Distance in a Line", "question__title_slug": "shortest-distance-in-a-line", "question__hide": false, - "total_acs": 15245, - "total_submitted": 18805, - "total_column_articles": 101, + "total_acs": 15346, + "total_submitted": 18973, + "total_column_articles": 102, "frontend_question_id": "613", "is_new_question": false }, @@ -42411,9 +42642,9 @@ "question__title": "Shortest Distance in a Plane", "question__title_slug": "shortest-distance-in-a-plane", "question__hide": false, - "total_acs": 10232, - "total_submitted": 15497, - "total_column_articles": 83, + "total_acs": 10319, + "total_submitted": 15662, + "total_column_articles": 84, "frontend_question_id": "612", "is_new_question": false }, @@ -42432,9 +42663,9 @@ "question__title": "Valid Triangle Number", "question__title_slug": "valid-triangle-number", "question__hide": false, - "total_acs": 63435, - "total_submitted": 118875, - "total_column_articles": 486, + "total_acs": 64378, + "total_submitted": 120549, + "total_column_articles": 493, "frontend_question_id": "611", "is_new_question": false }, @@ -42453,9 +42684,9 @@ "question__title": "Triangle Judgement", "question__title_slug": "triangle-judgement", "question__hide": false, - "total_acs": 14068, - "total_submitted": 21504, - "total_column_articles": 93, + "total_acs": 14189, + "total_submitted": 21762, + "total_column_articles": 94, "frontend_question_id": "610", "is_new_question": false }, @@ -42474,9 +42705,9 @@ "question__title": "Find Duplicate File in System", "question__title_slug": "find-duplicate-file-in-system", "question__hide": false, - "total_acs": 7884, - "total_submitted": 15784, - "total_column_articles": 123, + "total_acs": 7930, + "total_submitted": 15847, + "total_column_articles": 126, "frontend_question_id": "609", "is_new_question": false }, @@ -42495,9 +42726,9 @@ "question__title": "Tree Node", "question__title_slug": "tree-node", "question__hide": false, - "total_acs": 14271, - "total_submitted": 22547, - "total_column_articles": 146, + "total_acs": 15415, + "total_submitted": 24263, + "total_column_articles": 159, "frontend_question_id": "608", "is_new_question": false }, @@ -42516,9 +42747,9 @@ "question__title": "Sales Person", "question__title_slug": "sales-person", "question__hide": false, - "total_acs": 21178, - "total_submitted": 31379, - "total_column_articles": 140, + "total_acs": 22381, + "total_submitted": 33088, + "total_column_articles": 146, "frontend_question_id": "607", "is_new_question": false }, @@ -42537,9 +42768,9 @@ "question__title": "Construct String from Binary Tree", "question__title_slug": "construct-string-from-binary-tree", "question__hide": false, - "total_acs": 60688, - "total_submitted": 96190, - "total_column_articles": 649, + "total_acs": 61055, + "total_submitted": 96787, + "total_column_articles": 658, "frontend_question_id": "606", "is_new_question": false }, @@ -42558,9 +42789,9 @@ "question__title": "Can Place Flowers", "question__title_slug": "can-place-flowers", "question__hide": false, - "total_acs": 130557, - "total_submitted": 395986, - "total_column_articles": 1477, + "total_acs": 131504, + "total_submitted": 399021, + "total_column_articles": 1486, "frontend_question_id": "605", "is_new_question": false }, @@ -42579,9 +42810,9 @@ "question__title": "Design Compressed String Iterator", "question__title_slug": "design-compressed-string-iterator", "question__hide": false, - "total_acs": 2997, - "total_submitted": 7887, - "total_column_articles": 71, + "total_acs": 3015, + "total_submitted": 7925, + "total_column_articles": 72, "frontend_question_id": "604", "is_new_question": false }, @@ -42600,9 +42831,9 @@ "question__title": "Consecutive Available Seats", "question__title_slug": "consecutive-available-seats", "question__hide": false, - "total_acs": 17616, - "total_submitted": 26840, - "total_column_articles": 158, + "total_acs": 17827, + "total_submitted": 27323, + "total_column_articles": 160, "frontend_question_id": "603", "is_new_question": false }, @@ -42621,9 +42852,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": 11191, - "total_submitted": 18243, - "total_column_articles": 112, + "total_acs": 11361, + "total_submitted": 18848, + "total_column_articles": 113, "frontend_question_id": "602", "is_new_question": false }, @@ -42642,9 +42873,9 @@ "question__title": "Human Traffic of Stadium", "question__title_slug": "human-traffic-of-stadium", "question__hide": false, - "total_acs": 38483, - "total_submitted": 77022, - "total_column_articles": 459, + "total_acs": 38677, + "total_submitted": 77721, + "total_column_articles": 463, "frontend_question_id": "601", "is_new_question": false }, @@ -42663,8 +42894,8 @@ "question__title": "Non-negative Integers without Consecutive Ones", "question__title_slug": "non-negative-integers-without-consecutive-ones", "question__hide": false, - "total_acs": 20432, - "total_submitted": 42399, + "total_acs": 20492, + "total_submitted": 42524, "total_column_articles": 252, "frontend_question_id": "600", "is_new_question": false @@ -42684,9 +42915,9 @@ "question__title": "Minimum Index Sum of Two Lists", "question__title_slug": "minimum-index-sum-of-two-lists", "question__hide": false, - "total_acs": 73156, - "total_submitted": 127700, - "total_column_articles": 638, + "total_acs": 73506, + "total_submitted": 128356, + "total_column_articles": 640, "frontend_question_id": "599", "is_new_question": false }, @@ -42705,9 +42936,9 @@ "question__title": "Range Addition II", "question__title_slug": "range-addition-ii", "question__hide": false, - "total_acs": 44822, - "total_submitted": 78323, - "total_column_articles": 524, + "total_acs": 45038, + "total_submitted": 78709, + "total_column_articles": 527, "frontend_question_id": "598", "is_new_question": false }, @@ -42726,9 +42957,9 @@ "question__title": "Friend Requests I: Overall Acceptance Rate", "question__title_slug": "friend-requests-i-overall-acceptance-rate", "question__hide": false, - "total_acs": 14035, - "total_submitted": 31674, - "total_column_articles": 101, + "total_acs": 14160, + "total_submitted": 32041, + "total_column_articles": 102, "frontend_question_id": "597", "is_new_question": false }, @@ -42747,9 +42978,9 @@ "question__title": "Classes More Than 5 Students", "question__title_slug": "classes-more-than-5-students", "question__hide": false, - "total_acs": 101249, - "total_submitted": 222205, - "total_column_articles": 358, + "total_acs": 102307, + "total_submitted": 223943, + "total_column_articles": 363, "frontend_question_id": "596", "is_new_question": false }, @@ -42768,9 +42999,9 @@ "question__title": "Big Countries", "question__title_slug": "big-countries", "question__hide": false, - "total_acs": 132268, - "total_submitted": 176735, - "total_column_articles": 313, + "total_acs": 135768, + "total_submitted": 182712, + "total_column_articles": 324, "frontend_question_id": "595", "is_new_question": false }, @@ -42789,9 +43020,9 @@ "question__title": "Longest Harmonious Subsequence", "question__title_slug": "longest-harmonious-subsequence", "question__hide": false, - "total_acs": 66042, - "total_submitted": 116834, - "total_column_articles": 589, + "total_acs": 66494, + "total_submitted": 117599, + "total_column_articles": 592, "frontend_question_id": "594", "is_new_question": false }, @@ -42810,9 +43041,9 @@ "question__title": "Valid Square", "question__title_slug": "valid-square", "question__hide": false, - "total_acs": 10188, - "total_submitted": 23105, - "total_column_articles": 164, + "total_acs": 10350, + "total_submitted": 23430, + "total_column_articles": 166, "frontend_question_id": "593", "is_new_question": false }, @@ -42831,9 +43062,9 @@ "question__title": "Fraction Addition and Subtraction", "question__title_slug": "fraction-addition-and-subtraction", "question__hide": false, - "total_acs": 5646, - "total_submitted": 10727, - "total_column_articles": 139, + "total_acs": 5740, + "total_submitted": 10870, + "total_column_articles": 140, "frontend_question_id": "592", "is_new_question": false }, @@ -42852,9 +43083,9 @@ "question__title": "Tag Validator", "question__title_slug": "tag-validator", "question__hide": false, - "total_acs": 2184, - "total_submitted": 6398, - "total_column_articles": 50, + "total_acs": 14026, + "total_submitted": 26896, + "total_column_articles": 166, "frontend_question_id": "591", "is_new_question": false }, @@ -42873,8 +43104,8 @@ "question__title": "Design In-Memory File System", "question__title_slug": "design-in-memory-file-system", "question__hide": false, - "total_acs": 2245, - "total_submitted": 5252, + "total_acs": 2264, + "total_submitted": 5311, "total_column_articles": 40, "frontend_question_id": "588", "is_new_question": false @@ -42894,9 +43125,9 @@ "question__title": "Erect the Fence", "question__title_slug": "erect-the-fence", "question__hide": false, - "total_acs": 14774, - "total_submitted": 23686, - "total_column_articles": 112, + "total_acs": 15859, + "total_submitted": 25533, + "total_column_articles": 125, "frontend_question_id": "587", "is_new_question": false }, @@ -42915,9 +43146,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": 24872, - "total_submitted": 33895, - "total_column_articles": 134, + "total_acs": 26121, + "total_submitted": 35633, + "total_column_articles": 139, "frontend_question_id": "586", "is_new_question": false }, @@ -42936,9 +43167,9 @@ "question__title": "Investments in 2016", "question__title_slug": "investments-in-2016", "question__hide": false, - "total_acs": 11558, - "total_submitted": 21573, - "total_column_articles": 133, + "total_acs": 11677, + "total_submitted": 21979, + "total_column_articles": 137, "frontend_question_id": "585", "is_new_question": false }, @@ -42957,9 +43188,9 @@ "question__title": "Find Customer Referee", "question__title_slug": "find-customer-referee", "question__hide": false, - "total_acs": 30948, - "total_submitted": 42161, - "total_column_articles": 130, + "total_acs": 33785, + "total_submitted": 46566, + "total_column_articles": 142, "frontend_question_id": "584", "is_new_question": false }, @@ -42978,9 +43209,9 @@ "question__title": "Delete Operation for Two Strings", "question__title_slug": "delete-operation-for-two-strings", "question__hide": false, - "total_acs": 73564, - "total_submitted": 114483, - "total_column_articles": 649, + "total_acs": 74967, + "total_submitted": 116470, + "total_column_articles": 660, "frontend_question_id": "583", "is_new_question": false }, @@ -42999,9 +43230,9 @@ "question__title": "Kill Process", "question__title_slug": "kill-process", "question__hide": false, - "total_acs": 10212, - "total_submitted": 23740, - "total_column_articles": 156, + "total_acs": 10279, + "total_submitted": 23832, + "total_column_articles": 157, "frontend_question_id": "582", "is_new_question": false }, @@ -43020,9 +43251,9 @@ "question__title": "Shortest Unsorted Continuous Subarray", "question__title_slug": "shortest-unsorted-continuous-subarray", "question__hide": false, - "total_acs": 125064, - "total_submitted": 304728, - "total_column_articles": 1044, + "total_acs": 126569, + "total_submitted": 308353, + "total_column_articles": 1053, "frontend_question_id": "581", "is_new_question": false }, @@ -43041,9 +43272,9 @@ "question__title": "Count Student Number in Departments", "question__title_slug": "count-student-number-in-departments", "question__hide": false, - "total_acs": 14832, - "total_submitted": 28268, - "total_column_articles": 100, + "total_acs": 15068, + "total_submitted": 28862, + "total_column_articles": 105, "frontend_question_id": "580", "is_new_question": false }, @@ -43062,9 +43293,9 @@ "question__title": "Find Cumulative Salary of an Employee", "question__title_slug": "find-cumulative-salary-of-an-employee", "question__hide": false, - "total_acs": 10410, - "total_submitted": 24836, - "total_column_articles": 159, + "total_acs": 10552, + "total_submitted": 25084, + "total_column_articles": 162, "frontend_question_id": "579", "is_new_question": false }, @@ -43083,9 +43314,9 @@ "question__title": "Get Highest Answer Rate Question", "question__title_slug": "get-highest-answer-rate-question", "question__hide": false, - "total_acs": 14130, - "total_submitted": 29424, - "total_column_articles": 148, + "total_acs": 14281, + "total_submitted": 29803, + "total_column_articles": 151, "frontend_question_id": "578", "is_new_question": false }, @@ -43104,9 +43335,9 @@ "question__title": "Employee Bonus", "question__title_slug": "employee-bonus", "question__hide": false, - "total_acs": 21717, - "total_submitted": 31275, - "total_column_articles": 113, + "total_acs": 21934, + "total_submitted": 31604, + "total_column_articles": 114, "frontend_question_id": "577", "is_new_question": false }, @@ -43125,9 +43356,9 @@ "question__title": "Out of Boundary Paths", "question__title_slug": "out-of-boundary-paths", "question__hide": false, - "total_acs": 29563, - "total_submitted": 63045, - "total_column_articles": 323, + "total_acs": 29812, + "total_submitted": 63558, + "total_column_articles": 324, "frontend_question_id": "576", "is_new_question": false }, @@ -43146,9 +43377,9 @@ "question__title": "Distribute Candies", "question__title_slug": "distribute-candies", "question__hide": false, - "total_acs": 94209, - "total_submitted": 132712, - "total_column_articles": 885, + "total_acs": 94615, + "total_submitted": 133289, + "total_column_articles": 890, "frontend_question_id": "575", "is_new_question": false }, @@ -43167,9 +43398,9 @@ "question__title": "Winning Candidate", "question__title_slug": "winning-candidate", "question__hide": false, - "total_acs": 17335, - "total_submitted": 26359, - "total_column_articles": 134, + "total_acs": 17558, + "total_submitted": 26688, + "total_column_articles": 136, "frontend_question_id": "574", "is_new_question": false }, @@ -43188,8 +43419,8 @@ "question__title": "Squirrel Simulation", "question__title_slug": "squirrel-simulation", "question__hide": false, - "total_acs": 1288, - "total_submitted": 1969, + "total_acs": 1300, + "total_submitted": 1987, "total_column_articles": 37, "frontend_question_id": "573", "is_new_question": false @@ -43209,9 +43440,9 @@ "question__title": "Subtree of Another Tree", "question__title_slug": "subtree-of-another-tree", "question__hide": false, - "total_acs": 118338, - "total_submitted": 249096, - "total_column_articles": 986, + "total_acs": 119953, + "total_submitted": 252503, + "total_column_articles": 998, "frontend_question_id": "572", "is_new_question": false }, @@ -43230,9 +43461,9 @@ "question__title": "Find Median Given Frequency of Numbers", "question__title_slug": "find-median-given-frequency-of-numbers", "question__hide": false, - "total_acs": 9166, - "total_submitted": 19324, - "total_column_articles": 116, + "total_acs": 9286, + "total_submitted": 19744, + "total_column_articles": 117, "frontend_question_id": "571", "is_new_question": false }, @@ -43251,9 +43482,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": 18431, - "total_submitted": 28186, - "total_column_articles": 138, + "total_acs": 18744, + "total_submitted": 28624, + "total_column_articles": 142, "frontend_question_id": "570", "is_new_question": false }, @@ -43272,9 +43503,9 @@ "question__title": "Median Employee Salary", "question__title_slug": "median-employee-salary", "question__hide": false, - "total_acs": 13645, - "total_submitted": 24178, - "total_column_articles": 195, + "total_acs": 13801, + "total_submitted": 24433, + "total_column_articles": 197, "frontend_question_id": "569", "is_new_question": false }, @@ -43293,8 +43524,8 @@ "question__title": "Maximum Vacation Days", "question__title_slug": "maximum-vacation-days", "question__hide": false, - "total_acs": 1509, - "total_submitted": 2963, + "total_acs": 1519, + "total_submitted": 2974, "total_column_articles": 29, "frontend_question_id": "568", "is_new_question": false @@ -43314,9 +43545,9 @@ "question__title": "Permutation in String", "question__title_slug": "permutation-in-string", "question__hide": false, - "total_acs": 181191, - "total_submitted": 414198, - "total_column_articles": 1695, + "total_acs": 183697, + "total_submitted": 419568, + "total_column_articles": 1710, "frontend_question_id": "567", "is_new_question": false }, @@ -43335,9 +43566,9 @@ "question__title": "Reshape the Matrix", "question__title_slug": "reshape-the-matrix", "question__hide": false, - "total_acs": 101905, - "total_submitted": 152921, - "total_column_articles": 950, + "total_acs": 103097, + "total_submitted": 154885, + "total_column_articles": 957, "frontend_question_id": "566", "is_new_question": false }, @@ -43356,9 +43587,9 @@ "question__title": "Array Nesting", "question__title_slug": "array-nesting", "question__hide": false, - "total_acs": 17134, - "total_submitted": 28696, - "total_column_articles": 180, + "total_acs": 17260, + "total_submitted": 28928, + "total_column_articles": 182, "frontend_question_id": "565", "is_new_question": false }, @@ -43377,9 +43608,9 @@ "question__title": "Find the Closest Palindrome", "question__title_slug": "find-the-closest-palindrome", "question__hide": false, - "total_acs": 23022, - "total_submitted": 75752, - "total_column_articles": 247, + "total_acs": 23108, + "total_submitted": 76038, + "total_column_articles": 248, "frontend_question_id": "564", "is_new_question": false }, @@ -43398,9 +43629,9 @@ "question__title": "Binary Tree Tilt", "question__title_slug": "binary-tree-tilt", "question__hide": false, - "total_acs": 64537, - "total_submitted": 98413, - "total_column_articles": 652, + "total_acs": 64870, + "total_submitted": 98854, + "total_column_articles": 658, "frontend_question_id": "563", "is_new_question": false }, @@ -43419,9 +43650,9 @@ "question__title": "Longest Line of Consecutive One in Matrix", "question__title_slug": "longest-line-of-consecutive-one-in-matrix", "question__hide": false, - "total_acs": 4800, - "total_submitted": 9996, - "total_column_articles": 79, + "total_acs": 4838, + "total_submitted": 10062, + "total_column_articles": 80, "frontend_question_id": "562", "is_new_question": false }, @@ -43440,9 +43671,9 @@ "question__title": "Array Partition I", "question__title_slug": "array-partition-i", "question__hide": false, - "total_acs": 106226, - "total_submitted": 136179, - "total_column_articles": 874, + "total_acs": 106969, + "total_submitted": 137103, + "total_column_articles": 882, "frontend_question_id": "561", "is_new_question": false }, @@ -43461,9 +43692,9 @@ "question__title": "Subarray Sum Equals K", "question__title_slug": "subarray-sum-equals-k", "question__hide": false, - "total_acs": 216342, - "total_submitted": 480542, - "total_column_articles": 1407, + "total_acs": 219693, + "total_submitted": 487529, + "total_column_articles": 1422, "frontend_question_id": "560", "is_new_question": false }, @@ -43482,9 +43713,9 @@ "question__title": "Reverse Words in a String III", "question__title_slug": "reverse-words-in-a-string-iii", "question__hide": false, - "total_acs": 231884, - "total_submitted": 312637, - "total_column_articles": 1937, + "total_acs": 234179, + "total_submitted": 315777, + "total_column_articles": 1955, "frontend_question_id": "557", "is_new_question": false }, @@ -43503,9 +43734,9 @@ "question__title": "Next Greater Element III", "question__title_slug": "next-greater-element-iii", "question__hide": false, - "total_acs": 19136, - "total_submitted": 57611, - "total_column_articles": 291, + "total_acs": 19422, + "total_submitted": 58416, + "total_column_articles": 297, "frontend_question_id": "556", "is_new_question": false }, @@ -43524,8 +43755,8 @@ "question__title": "Split Concatenated Strings", "question__title_slug": "split-concatenated-strings", "question__hide": false, - "total_acs": 1331, - "total_submitted": 3724, + "total_acs": 1362, + "total_submitted": 3775, "total_column_articles": 25, "frontend_question_id": "555", "is_new_question": false @@ -43545,9 +43776,9 @@ "question__title": "Brick Wall", "question__title_slug": "brick-wall", "question__hide": false, - "total_acs": 50455, - "total_submitted": 99606, - "total_column_articles": 518, + "total_acs": 50714, + "total_submitted": 100049, + "total_column_articles": 521, "frontend_question_id": "554", "is_new_question": false }, @@ -43566,9 +43797,9 @@ "question__title": "Optimal Division", "question__title_slug": "optimal-division", "question__hide": false, - "total_acs": 28315, - "total_submitted": 43557, - "total_column_articles": 343, + "total_acs": 28389, + "total_submitted": 43675, + "total_column_articles": 344, "frontend_question_id": "553", "is_new_question": false }, @@ -43587,9 +43818,9 @@ "question__title": "Student Attendance Record II", "question__title_slug": "student-attendance-record-ii", "question__hide": false, - "total_acs": 25537, - "total_submitted": 44265, - "total_column_articles": 303, + "total_acs": 25611, + "total_submitted": 44401, + "total_column_articles": 306, "frontend_question_id": "552", "is_new_question": false }, @@ -43608,9 +43839,9 @@ "question__title": "Student Attendance Record I", "question__title_slug": "student-attendance-record-i", "question__hide": false, - "total_acs": 65321, - "total_submitted": 115031, - "total_column_articles": 830, + "total_acs": 65606, + "total_submitted": 115540, + "total_column_articles": 835, "frontend_question_id": "551", "is_new_question": false }, @@ -43629,9 +43860,9 @@ "question__title": "Shortest Path to Get Food", "question__title_slug": "shortest-path-to-get-food", "question__hide": false, - "total_acs": 1042, - "total_submitted": 2058, - "total_column_articles": 29, + "total_acs": 1055, + "total_submitted": 2097, + "total_column_articles": 30, "frontend_question_id": "1730", "is_new_question": false }, @@ -43650,8 +43881,8 @@ "question__title": "Binary Tree Longest Consecutive Sequence II", "question__title_slug": "binary-tree-longest-consecutive-sequence-ii", "question__hide": false, - "total_acs": 2909, - "total_submitted": 5776, + "total_acs": 2934, + "total_submitted": 5806, "total_column_articles": 61, "frontend_question_id": "549", "is_new_question": false @@ -43671,8 +43902,8 @@ "question__title": "Split Array with Equal Sum", "question__title_slug": "split-array-with-equal-sum", "question__hide": false, - "total_acs": 1939, - "total_submitted": 5293, + "total_acs": 1952, + "total_submitted": 5316, "total_column_articles": 45, "frontend_question_id": "548", "is_new_question": false @@ -43692,9 +43923,9 @@ "question__title": "Number of Provinces", "question__title_slug": "number-of-provinces", "question__hide": false, - "total_acs": 205233, - "total_submitted": 330909, - "total_column_articles": 1468, + "total_acs": 207029, + "total_submitted": 333799, + "total_column_articles": 1478, "frontend_question_id": "547", "is_new_question": false }, @@ -43713,9 +43944,9 @@ "question__title": "Remove Boxes", "question__title_slug": "remove-boxes", "question__hide": false, - "total_acs": 16036, - "total_submitted": 25748, - "total_column_articles": 129, + "total_acs": 16089, + "total_submitted": 25818, + "total_column_articles": 130, "frontend_question_id": "546", "is_new_question": false }, @@ -43734,8 +43965,8 @@ "question__title": "Boundary of Binary Tree", "question__title_slug": "boundary-of-binary-tree", "question__hide": false, - "total_acs": 4253, - "total_submitted": 9869, + "total_acs": 4375, + "total_submitted": 10058, "total_column_articles": 88, "frontend_question_id": "545", "is_new_question": false @@ -43755,8 +43986,8 @@ "question__title": "Output Contest Matches", "question__title_slug": "output-contest-matches", "question__hide": false, - "total_acs": 2703, - "total_submitted": 3793, + "total_acs": 2740, + "total_submitted": 3841, "total_column_articles": 59, "frontend_question_id": "544", "is_new_question": false @@ -43776,9 +44007,9 @@ "question__title": "Diameter of Binary Tree", "question__title_slug": "diameter-of-binary-tree", "question__hide": false, - "total_acs": 209261, - "total_submitted": 368748, - "total_column_articles": 1553, + "total_acs": 212407, + "total_submitted": 373775, + "total_column_articles": 1572, "frontend_question_id": "543", "is_new_question": false }, @@ -43797,9 +44028,9 @@ "question__title": "01 Matrix", "question__title_slug": "01-matrix", "question__hide": false, - "total_acs": 98881, - "total_submitted": 214328, - "total_column_articles": 877, + "total_acs": 99977, + "total_submitted": 216520, + "total_column_articles": 884, "frontend_question_id": "542", "is_new_question": false }, @@ -43818,9 +44049,9 @@ "question__title": "Reverse String II", "question__title_slug": "reverse-string-ii", "question__hide": false, - "total_acs": 108856, - "total_submitted": 182917, - "total_column_articles": 1052, + "total_acs": 110763, + "total_submitted": 186156, + "total_column_articles": 1060, "frontend_question_id": "541", "is_new_question": false }, @@ -43839,9 +44070,9 @@ "question__title": "Single Element in a Sorted Array", "question__title_slug": "single-element-in-a-sorted-array", "question__hide": false, - "total_acs": 93880, - "total_submitted": 154281, - "total_column_articles": 930, + "total_acs": 94642, + "total_submitted": 155506, + "total_column_articles": 932, "frontend_question_id": "540", "is_new_question": false }, @@ -43860,8 +44091,8 @@ "question__title": "Minimum Time Difference", "question__title_slug": "minimum-time-difference", "question__hide": false, - "total_acs": 52574, - "total_submitted": 79116, + "total_acs": 52808, + "total_submitted": 79444, "total_column_articles": 602, "frontend_question_id": "539", "is_new_question": false @@ -43881,9 +44112,9 @@ "question__title": "Convert BST to Greater Tree", "question__title_slug": "convert-bst-to-greater-tree", "question__hide": false, - "total_acs": 151128, - "total_submitted": 206329, - "total_column_articles": 1110, + "total_acs": 153395, + "total_submitted": 209050, + "total_column_articles": 1120, "frontend_question_id": "538", "is_new_question": false }, @@ -43902,8 +44133,8 @@ "question__title": "Complex Number Multiplication", "question__title_slug": "complex-number-multiplication", "question__hide": false, - "total_acs": 40099, - "total_submitted": 53533, + "total_acs": 40174, + "total_submitted": 53657, "total_column_articles": 621, "frontend_question_id": "537", "is_new_question": false @@ -43923,9 +44154,9 @@ "question__title": "Construct Binary Tree from String", "question__title_slug": "construct-binary-tree-from-string", "question__hide": false, - "total_acs": 4262, - "total_submitted": 7878, - "total_column_articles": 73, + "total_acs": 4323, + "total_submitted": 7980, + "total_column_articles": 75, "frontend_question_id": "536", "is_new_question": false }, @@ -43944,9 +44175,9 @@ "question__title": "Encode and Decode TinyURL", "question__title_slug": "encode-and-decode-tinyurl", "question__hide": false, - "total_acs": 18246, - "total_submitted": 21563, - "total_column_articles": 122, + "total_acs": 18336, + "total_submitted": 21666, + "total_column_articles": 123, "frontend_question_id": "535", "is_new_question": false }, @@ -43965,8 +44196,8 @@ "question__title": "Lonely Pixel II", "question__title_slug": "lonely-pixel-ii", "question__hide": false, - "total_acs": 2025, - "total_submitted": 3838, + "total_acs": 2030, + "total_submitted": 3847, "total_column_articles": 38, "frontend_question_id": "533", "is_new_question": false @@ -43986,9 +44217,9 @@ "question__title": "K-diff Pairs in an Array", "question__title_slug": "k-diff-pairs-in-an-array", "question__hide": false, - "total_acs": 28565, - "total_submitted": 74353, - "total_column_articles": 327, + "total_acs": 28730, + "total_submitted": 74672, + "total_column_articles": 331, "frontend_question_id": "532", "is_new_question": false }, @@ -44007,9 +44238,9 @@ "question__title": "Lonely Pixel I", "question__title_slug": "lonely-pixel-i", "question__hide": false, - "total_acs": 4633, - "total_submitted": 7005, - "total_column_articles": 88, + "total_acs": 4675, + "total_submitted": 7064, + "total_column_articles": 89, "frontend_question_id": "531", "is_new_question": false }, @@ -44028,9 +44259,9 @@ "question__title": "Minimum Absolute Difference in BST", "question__title_slug": "minimum-absolute-difference-in-bst", "question__hide": false, - "total_acs": 109267, - "total_submitted": 174413, - "total_column_articles": 820, + "total_acs": 111064, + "total_submitted": 177123, + "total_column_articles": 829, "frontend_question_id": "530", "is_new_question": false }, @@ -44049,9 +44280,9 @@ "question__title": "Minesweeper", "question__title_slug": "minesweeper", "question__hide": false, - "total_acs": 44234, - "total_submitted": 68718, - "total_column_articles": 511, + "total_acs": 44394, + "total_submitted": 68982, + "total_column_articles": 513, "frontend_question_id": "529", "is_new_question": false }, @@ -44070,9 +44301,9 @@ "question__title": "Swapping Nodes in a Linked List", "question__title_slug": "swapping-nodes-in-a-linked-list", "question__hide": false, - "total_acs": 14473, - "total_submitted": 22656, - "total_column_articles": 216, + "total_acs": 14606, + "total_submitted": 22871, + "total_column_articles": 219, "frontend_question_id": "1721", "is_new_question": false }, @@ -44091,8 +44322,8 @@ "question__title": "Word Abbreviation", "question__title_slug": "word-abbreviation", "question__hide": false, - "total_acs": 2322, - "total_submitted": 3939, + "total_acs": 2323, + "total_submitted": 3943, "total_column_articles": 33, "frontend_question_id": "527", "is_new_question": false @@ -44112,9 +44343,9 @@ "question__title": "Beautiful Arrangement", "question__title_slug": "beautiful-arrangement", "question__hide": false, - "total_acs": 37927, - "total_submitted": 51801, - "total_column_articles": 429, + "total_acs": 38151, + "total_submitted": 52095, + "total_column_articles": 432, "frontend_question_id": "526", "is_new_question": false }, @@ -44133,9 +44364,9 @@ "question__title": "Contiguous Array", "question__title_slug": "contiguous-array", "question__hide": false, - "total_acs": 53867, - "total_submitted": 99590, - "total_column_articles": 590, + "total_acs": 54281, + "total_submitted": 100316, + "total_column_articles": 593, "frontend_question_id": "525", "is_new_question": false }, @@ -44154,9 +44385,9 @@ "question__title": "Longest Word in Dictionary through Deleting", "question__title_slug": "longest-word-in-dictionary-through-deleting", "question__hide": false, - "total_acs": 84514, - "total_submitted": 169760, - "total_column_articles": 850, + "total_acs": 85054, + "total_submitted": 170834, + "total_column_articles": 853, "frontend_question_id": "524", "is_new_question": false }, @@ -44175,9 +44406,9 @@ "question__title": "Continuous Subarray Sum", "question__title_slug": "continuous-subarray-sum", "question__hide": false, - "total_acs": 78643, - "total_submitted": 282130, - "total_column_articles": 667, + "total_acs": 79096, + "total_submitted": 283520, + "total_column_articles": 671, "frontend_question_id": "523", "is_new_question": false }, @@ -44196,9 +44427,9 @@ "question__title": "Longest Uncommon Subsequence II", "question__title_slug": "longest-uncommon-subsequence-ii", "question__hide": false, - "total_acs": 9152, - "total_submitted": 24594, - "total_column_articles": 138, + "total_acs": 9288, + "total_submitted": 24972, + "total_column_articles": 140, "frontend_question_id": "522", "is_new_question": false }, @@ -44217,9 +44448,9 @@ "question__title": "Longest Uncommon Subsequence I", "question__title_slug": "longest-uncommon-subsequence-i", "question__hide": false, - "total_acs": 55370, - "total_submitted": 74999, - "total_column_articles": 502, + "total_acs": 55540, + "total_submitted": 75236, + "total_column_articles": 505, "frontend_question_id": "521", "is_new_question": false }, @@ -44238,9 +44469,9 @@ "question__title": "Detect Capital", "question__title_slug": "detect-capital", "question__hide": false, - "total_acs": 73232, - "total_submitted": 127501, - "total_column_articles": 1113, + "total_acs": 73523, + "total_submitted": 128044, + "total_column_articles": 1118, "frontend_question_id": "520", "is_new_question": false }, @@ -44259,8 +44490,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": 124, - "total_submitted": 238, + "total_acs": 125, + "total_submitted": 239, "total_column_articles": 5, "frontend_question_id": "1983", "is_new_question": false @@ -44280,9 +44511,9 @@ "question__title": "Coin Change 2", "question__title_slug": "coin-change-2", "question__hide": false, - "total_acs": 152985, - "total_submitted": 224925, - "total_column_articles": 898, + "total_acs": 155397, + "total_submitted": 228133, + "total_column_articles": 911, "frontend_question_id": "518", "is_new_question": false }, @@ -44301,8 +44532,8 @@ "question__title": "Super Washing Machines", "question__title_slug": "super-washing-machines", "question__hide": false, - "total_acs": 20997, - "total_submitted": 41162, + "total_acs": 21072, + "total_submitted": 41303, "total_column_articles": 183, "frontend_question_id": "517", "is_new_question": false @@ -44322,9 +44553,9 @@ "question__title": "Longest Palindromic Subsequence", "question__title_slug": "longest-palindromic-subsequence", "question__hide": false, - "total_acs": 117468, - "total_submitted": 177121, - "total_column_articles": 801, + "total_acs": 119414, + "total_submitted": 179948, + "total_column_articles": 812, "frontend_question_id": "516", "is_new_question": false }, @@ -44343,9 +44574,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": 59401, - "total_submitted": 90648, - "total_column_articles": 621, + "total_acs": 60457, + "total_submitted": 92195, + "total_column_articles": 626, "frontend_question_id": "515", "is_new_question": false }, @@ -44364,8 +44595,8 @@ "question__title": "Freedom Trail", "question__title_slug": "freedom-trail", "question__hide": false, - "total_acs": 22103, - "total_submitted": 44032, + "total_acs": 22241, + "total_submitted": 44273, "total_column_articles": 272, "frontend_question_id": "514", "is_new_question": false @@ -44385,9 +44616,9 @@ "question__title": "Find Bottom Left Tree Value", "question__title_slug": "find-bottom-left-tree-value", "question__hide": false, - "total_acs": 83821, - "total_submitted": 114623, - "total_column_articles": 895, + "total_acs": 85664, + "total_submitted": 117168, + "total_column_articles": 910, "frontend_question_id": "513", "is_new_question": false }, @@ -44406,8 +44637,8 @@ "question__title": "Maximum Alternating Subarray Sum", "question__title_slug": "maximum-alternating-subarray-sum", "question__hide": false, - "total_acs": 210, - "total_submitted": 497, + "total_acs": 213, + "total_submitted": 505, "total_column_articles": 15, "frontend_question_id": "2036", "is_new_question": false @@ -44427,8 +44658,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": 2834, - "total_submitted": 7565, + "total_acs": 2856, + "total_submitted": 7620, "total_column_articles": 42, "frontend_question_id": "1059", "is_new_question": false @@ -44448,8 +44679,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": 360, - "total_submitted": 647, + "total_acs": 380, + "total_submitted": 686, "total_column_articles": 14, "frontend_question_id": "2031", "is_new_question": false @@ -44469,8 +44700,8 @@ "question__title": "Inorder Successor in BST II", "question__title_slug": "inorder-successor-in-bst-ii", "question__hide": false, - "total_acs": 4336, - "total_submitted": 7178, + "total_acs": 4371, + "total_submitted": 7245, "total_column_articles": 66, "frontend_question_id": "510", "is_new_question": false @@ -44490,9 +44721,9 @@ "question__title": "Most Frequent Subtree Sum", "question__title_slug": "most-frequent-subtree-sum", "question__hide": false, - "total_acs": 17880, - "total_submitted": 26148, - "total_column_articles": 281, + "total_acs": 18034, + "total_submitted": 26373, + "total_column_articles": 282, "frontend_question_id": "508", "is_new_question": false }, @@ -44511,8 +44742,8 @@ "question__title": "Perfect Number", "question__title_slug": "perfect-number", "question__hide": false, - "total_acs": 64547, - "total_submitted": 131714, + "total_acs": 64817, + "total_submitted": 132236, "total_column_articles": 471, "frontend_question_id": "507", "is_new_question": false @@ -44532,9 +44763,9 @@ "question__title": "Relative Ranks", "question__title_slug": "relative-ranks", "question__hide": false, - "total_acs": 62733, - "total_submitted": 96195, - "total_column_articles": 799, + "total_acs": 63126, + "total_submitted": 96756, + "total_column_articles": 805, "frontend_question_id": "506", "is_new_question": false }, @@ -44553,9 +44784,9 @@ "question__title": "The Maze II", "question__title_slug": "the-maze-ii", "question__hide": false, - "total_acs": 7115, - "total_submitted": 14255, - "total_column_articles": 87, + "total_acs": 7180, + "total_submitted": 14374, + "total_column_articles": 88, "frontend_question_id": "505", "is_new_question": false }, @@ -44574,8 +44805,8 @@ "question__title": "Base 7", "question__title_slug": "base-7", "question__hide": false, - "total_acs": 73124, - "total_submitted": 140183, + "total_acs": 73400, + "total_submitted": 140802, "total_column_articles": 740, "frontend_question_id": "504", "is_new_question": false @@ -44595,9 +44826,9 @@ "question__title": "Next Greater Element II", "question__title_slug": "next-greater-element-ii", "question__hide": false, - "total_acs": 134564, - "total_submitted": 207085, - "total_column_articles": 1213, + "total_acs": 136257, + "total_submitted": 209446, + "total_column_articles": 1222, "frontend_question_id": "503", "is_new_question": false }, @@ -44616,9 +44847,9 @@ "question__title": "IPO", "question__title_slug": "ipo", "question__hide": false, - "total_acs": 31443, - "total_submitted": 70931, - "total_column_articles": 378, + "total_acs": 31539, + "total_submitted": 71132, + "total_column_articles": 379, "frontend_question_id": "502", "is_new_question": false }, @@ -44637,9 +44868,9 @@ "question__title": "Find Mode in Binary Search Tree", "question__title_slug": "find-mode-in-binary-search-tree", "question__hide": false, - "total_acs": 94588, - "total_submitted": 178536, - "total_column_articles": 733, + "total_acs": 96276, + "total_submitted": 181558, + "total_column_articles": 745, "frontend_question_id": "501", "is_new_question": false }, @@ -44658,9 +44889,9 @@ "question__title": "Keyboard Row", "question__title_slug": "keyboard-row", "question__hide": false, - "total_acs": 57298, - "total_submitted": 76978, - "total_column_articles": 835, + "total_acs": 57689, + "total_submitted": 77487, + "total_column_articles": 844, "frontend_question_id": "500", "is_new_question": false }, @@ -44679,8 +44910,8 @@ "question__title": "The Maze III", "question__title_slug": "the-maze-iii", "question__hide": false, - "total_acs": 3193, - "total_submitted": 8160, + "total_acs": 3230, + "total_submitted": 8235, "total_column_articles": 61, "frontend_question_id": "499", "is_new_question": false @@ -44700,9 +44931,9 @@ "question__title": "Diagonal Traverse", "question__title_slug": "diagonal-traverse", "question__hide": false, - "total_acs": 57751, - "total_submitted": 116334, - "total_column_articles": 591, + "total_acs": 58434, + "total_submitted": 117503, + "total_column_articles": 598, "frontend_question_id": "498", "is_new_question": false }, @@ -44721,9 +44952,9 @@ "question__title": "Next Greater Element I", "question__title_slug": "next-greater-element-i", "question__hide": false, - "total_acs": 176444, - "total_submitted": 248366, - "total_column_articles": 1731, + "total_acs": 178673, + "total_submitted": 251310, + "total_column_articles": 1748, "frontend_question_id": "496", "is_new_question": false }, @@ -44742,9 +44973,9 @@ "question__title": "Teemo Attacking", "question__title_slug": "teemo-attacking", "question__hide": false, - "total_acs": 72456, - "total_submitted": 120067, - "total_column_articles": 1018, + "total_acs": 72909, + "total_submitted": 120853, + "total_column_articles": 1027, "frontend_question_id": "495", "is_new_question": false }, @@ -44763,9 +44994,9 @@ "question__title": "Target Sum", "question__title_slug": "target-sum", "question__hide": false, - "total_acs": 214802, - "total_submitted": 438429, - "total_column_articles": 1351, + "total_acs": 218590, + "total_submitted": 445933, + "total_column_articles": 1369, "frontend_question_id": "494", "is_new_question": false }, @@ -44784,9 +45015,9 @@ "question__title": "Reverse Pairs", "question__title_slug": "reverse-pairs", "question__hide": false, - "total_acs": 30227, - "total_submitted": 85769, - "total_column_articles": 307, + "total_acs": 30440, + "total_submitted": 86286, + "total_column_articles": 310, "frontend_question_id": "493", "is_new_question": false }, @@ -44805,8 +45036,8 @@ "question__title": "Construct the Rectangle", "question__title_slug": "construct-the-rectangle", "question__hide": false, - "total_acs": 48539, - "total_submitted": 80006, + "total_acs": 48735, + "total_submitted": 80353, "total_column_articles": 465, "frontend_question_id": "492", "is_new_question": false @@ -44826,9 +45057,9 @@ "question__title": "Increasing Subsequences", "question__title_slug": "increasing-subsequences", "question__hide": false, - "total_acs": 72960, - "total_submitted": 137555, - "total_column_articles": 579, + "total_acs": 74736, + "total_submitted": 141023, + "total_column_articles": 597, "frontend_question_id": "491", "is_new_question": false }, @@ -44847,9 +45078,9 @@ "question__title": "The Maze", "question__title_slug": "the-maze", "question__hide": false, - "total_acs": 8511, - "total_submitted": 17379, - "total_column_articles": 98, + "total_acs": 8584, + "total_submitted": 17501, + "total_column_articles": 99, "frontend_question_id": "490", "is_new_question": false }, @@ -44868,8 +45099,8 @@ "question__title": "Kth Smallest Instructions", "question__title_slug": "kth-smallest-instructions", "question__hide": false, - "total_acs": 2554, - "total_submitted": 5514, + "total_acs": 2576, + "total_submitted": 5547, "total_column_articles": 52, "frontend_question_id": "1643", "is_new_question": false @@ -44889,8 +45120,8 @@ "question__title": "Zuma Game", "question__title_slug": "zuma-game", "question__hide": false, - "total_acs": 18593, - "total_submitted": 36276, + "total_acs": 18623, + "total_submitted": 36399, "total_column_articles": 177, "frontend_question_id": "488", "is_new_question": false @@ -44910,9 +45141,9 @@ "question__title": "Max Consecutive Ones II", "question__title_slug": "max-consecutive-ones-ii", "question__hide": false, - "total_acs": 9278, - "total_submitted": 15958, - "total_column_articles": 174, + "total_acs": 9416, + "total_submitted": 16212, + "total_column_articles": 176, "frontend_question_id": "487", "is_new_question": false }, @@ -44931,9 +45162,9 @@ "question__title": "Predict the Winner", "question__title_slug": "predict-the-winner", "question__hide": false, - "total_acs": 53786, - "total_submitted": 91138, - "total_column_articles": 445, + "total_acs": 54105, + "total_submitted": 91665, + "total_column_articles": 448, "frontend_question_id": "486", "is_new_question": false }, @@ -44952,9 +45183,9 @@ "question__title": "Max Consecutive Ones", "question__title_slug": "max-consecutive-ones", "question__hide": false, - "total_acs": 150179, - "total_submitted": 246185, - "total_column_articles": 1199, + "total_acs": 151523, + "total_submitted": 248305, + "total_column_articles": 1207, "frontend_question_id": "485", "is_new_question": false }, @@ -44973,9 +45204,9 @@ "question__title": "Find Permutation", "question__title_slug": "find-permutation", "question__hide": false, - "total_acs": 1849, - "total_submitted": 3007, - "total_column_articles": 38, + "total_acs": 1873, + "total_submitted": 3040, + "total_column_articles": 39, "frontend_question_id": "484", "is_new_question": false }, @@ -44994,9 +45225,9 @@ "question__title": "Smallest Good Base", "question__title_slug": "smallest-good-base", "question__hide": false, - "total_acs": 17217, - "total_submitted": 29116, - "total_column_articles": 132, + "total_acs": 17283, + "total_submitted": 29253, + "total_column_articles": 133, "frontend_question_id": "483", "is_new_question": false }, @@ -45015,9 +45246,9 @@ "question__title": "License Key Formatting", "question__title_slug": "license-key-formatting", "question__hide": false, - "total_acs": 46134, - "total_submitted": 98001, - "total_column_articles": 484, + "total_acs": 46383, + "total_submitted": 98610, + "total_column_articles": 486, "frontend_question_id": "482", "is_new_question": false }, @@ -45036,9 +45267,9 @@ "question__title": "Magical String", "question__title_slug": "magical-string", "question__hide": false, - "total_acs": 7314, - "total_submitted": 12984, - "total_column_articles": 131, + "total_acs": 7398, + "total_submitted": 13114, + "total_column_articles": 132, "frontend_question_id": "481", "is_new_question": false }, @@ -45057,9 +45288,9 @@ "question__title": "Sliding Window Median", "question__title_slug": "sliding-window-median", "question__hide": false, - "total_acs": 33268, - "total_submitted": 74481, - "total_column_articles": 448, + "total_acs": 33446, + "total_submitted": 74907, + "total_column_articles": 451, "frontend_question_id": "480", "is_new_question": false }, @@ -45078,8 +45309,8 @@ "question__title": "Largest Palindrome Product", "question__title_slug": "largest-palindrome-product", "question__hide": false, - "total_acs": 21175, - "total_submitted": 33784, + "total_acs": 21395, + "total_submitted": 34156, "total_column_articles": 162, "frontend_question_id": "479", "is_new_question": false @@ -45099,9 +45330,9 @@ "question__title": "Total Hamming Distance", "question__title_slug": "total-hamming-distance", "question__hide": false, - "total_acs": 41452, - "total_submitted": 68586, - "total_column_articles": 352, + "total_acs": 41576, + "total_submitted": 68771, + "total_column_articles": 354, "frontend_question_id": "477", "is_new_question": false }, @@ -45120,9 +45351,9 @@ "question__title": "Number Complement", "question__title_slug": "number-complement", "question__hide": false, - "total_acs": 69712, - "total_submitted": 98096, - "total_column_articles": 935, + "total_acs": 69976, + "total_submitted": 98509, + "total_column_articles": 938, "frontend_question_id": "476", "is_new_question": false }, @@ -45141,9 +45372,9 @@ "question__title": "Heaters", "question__title_slug": "heaters", "question__hide": false, - "total_acs": 56600, - "total_submitted": 139632, - "total_column_articles": 610, + "total_acs": 56982, + "total_submitted": 140459, + "total_column_articles": 613, "frontend_question_id": "475", "is_new_question": false }, @@ -45162,9 +45393,9 @@ "question__title": "Ones and Zeroes", "question__title_slug": "ones-and-zeroes", "question__hide": false, - "total_acs": 100775, - "total_submitted": 160557, - "total_column_articles": 775, + "total_acs": 102352, + "total_submitted": 162905, + "total_column_articles": 789, "frontend_question_id": "474", "is_new_question": false }, @@ -45183,9 +45414,9 @@ "question__title": "Matchsticks to Square", "question__title_slug": "matchsticks-to-square", "question__hide": false, - "total_acs": 27746, - "total_submitted": 65835, - "total_column_articles": 232, + "total_acs": 28082, + "total_submitted": 66646, + "total_column_articles": 238, "frontend_question_id": "473", "is_new_question": false }, @@ -45204,9 +45435,9 @@ "question__title": "Concatenated Words", "question__title_slug": "concatenated-words", "question__hide": false, - "total_acs": 22709, - "total_submitted": 45531, - "total_column_articles": 228, + "total_acs": 22787, + "total_submitted": 45661, + "total_column_articles": 229, "frontend_question_id": "472", "is_new_question": false }, @@ -45225,8 +45456,8 @@ "question__title": "Encode String with Shortest Length", "question__title_slug": "encode-string-with-shortest-length", "question__hide": false, - "total_acs": 1864, - "total_submitted": 3080, + "total_acs": 1880, + "total_submitted": 3104, "total_column_articles": 31, "frontend_question_id": "471", "is_new_question": false @@ -45246,8 +45477,8 @@ "question__title": "Convex Polygon", "question__title_slug": "convex-polygon", "question__hide": false, - "total_acs": 1849, - "total_submitted": 4267, + "total_acs": 1869, + "total_submitted": 4299, "total_column_articles": 24, "frontend_question_id": "469", "is_new_question": false @@ -45267,9 +45498,9 @@ "question__title": "Validate IP Address", "question__title_slug": "validate-ip-address", "question__hide": false, - "total_acs": 32605, - "total_submitted": 126457, - "total_column_articles": 366, + "total_acs": 32971, + "total_submitted": 127658, + "total_column_articles": 369, "frontend_question_id": "468", "is_new_question": false }, @@ -45288,8 +45519,8 @@ "question__title": "Unique Substrings in Wraparound String", "question__title_slug": "unique-substrings-in-wraparound-string", "question__hide": false, - "total_acs": 10888, - "total_submitted": 24348, + "total_acs": 11017, + "total_submitted": 24596, "total_column_articles": 135, "frontend_question_id": "467", "is_new_question": false @@ -45309,8 +45540,8 @@ "question__title": "Count The Repetitions", "question__title_slug": "count-the-repetitions", "question__hide": false, - "total_acs": 12337, - "total_submitted": 32967, + "total_acs": 12361, + "total_submitted": 33026, "total_column_articles": 190, "frontend_question_id": "466", "is_new_question": false @@ -45330,8 +45561,8 @@ "question__title": "Optimal Account Balancing", "question__title_slug": "optimal-account-balancing", "question__hide": false, - "total_acs": 2012, - "total_submitted": 3757, + "total_acs": 2024, + "total_submitted": 3776, "total_column_articles": 27, "frontend_question_id": "465", "is_new_question": false @@ -45351,9 +45582,9 @@ "question__title": "Can I Win", "question__title_slug": "can-i-win", "question__hide": false, - "total_acs": 14259, - "total_submitted": 40204, - "total_column_articles": 127, + "total_acs": 14380, + "total_submitted": 40512, + "total_column_articles": 130, "frontend_question_id": "464", "is_new_question": false }, @@ -45372,9 +45603,9 @@ "question__title": "Island Perimeter", "question__title_slug": "island-perimeter", "question__hide": false, - "total_acs": 95523, - "total_submitted": 135941, - "total_column_articles": 1117, + "total_acs": 96393, + "total_submitted": 137167, + "total_column_articles": 1122, "frontend_question_id": "463", "is_new_question": false }, @@ -45393,9 +45624,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": 17683, - "total_submitted": 28773, - "total_column_articles": 164, + "total_acs": 17820, + "total_submitted": 28997, + "total_column_articles": 165, "frontend_question_id": "462", "is_new_question": false }, @@ -45414,9 +45645,9 @@ "question__title": "Hamming Distance", "question__title_slug": "hamming-distance", "question__hide": false, - "total_acs": 207833, - "total_submitted": 254838, - "total_column_articles": 1627, + "total_acs": 209789, + "total_submitted": 257151, + "total_column_articles": 1647, "frontend_question_id": "461", "is_new_question": false }, @@ -45435,9 +45666,9 @@ "question__title": "LFU Cache", "question__title_slug": "lfu-cache", "question__hide": false, - "total_acs": 46223, - "total_submitted": 105187, - "total_column_articles": 504, + "total_acs": 46816, + "total_submitted": 106437, + "total_column_articles": 507, "frontend_question_id": "460", "is_new_question": false }, @@ -45456,9 +45687,9 @@ "question__title": "Repeated Substring Pattern", "question__title_slug": "repeated-substring-pattern", "question__hide": false, - "total_acs": 110026, - "total_submitted": 216414, - "total_column_articles": 853, + "total_acs": 111909, + "total_submitted": 220340, + "total_column_articles": 864, "frontend_question_id": "459", "is_new_question": false }, @@ -45477,8 +45708,8 @@ "question__title": "Poor Pigs", "question__title_slug": "poor-pigs", "question__hide": false, - "total_acs": 24340, - "total_submitted": 34847, + "total_acs": 24417, + "total_submitted": 34968, "total_column_articles": 219, "frontend_question_id": "458", "is_new_question": false @@ -45498,8 +45729,8 @@ "question__title": "Circular Array Loop", "question__title_slug": "circular-array-loop", "question__hide": false, - "total_acs": 31399, - "total_submitted": 72219, + "total_acs": 31504, + "total_submitted": 72482, "total_column_articles": 344, "frontend_question_id": "457", "is_new_question": false @@ -45519,9 +45750,9 @@ "question__title": "132 Pattern", "question__title_slug": "132-pattern", "question__hide": false, - "total_acs": 64321, - "total_submitted": 177457, - "total_column_articles": 524, + "total_acs": 64704, + "total_submitted": 178320, + "total_column_articles": 528, "frontend_question_id": "456", "is_new_question": false }, @@ -45540,9 +45771,9 @@ "question__title": "Assign Cookies", "question__title_slug": "assign-cookies", "question__hide": false, - "total_acs": 209597, - "total_submitted": 366040, - "total_column_articles": 1648, + "total_acs": 212421, + "total_submitted": 371054, + "total_column_articles": 1665, "frontend_question_id": "455", "is_new_question": false }, @@ -45561,9 +45792,9 @@ "question__title": "4Sum II", "question__title_slug": "4sum-ii", "question__hide": false, - "total_acs": 115397, - "total_submitted": 184713, - "total_column_articles": 732, + "total_acs": 117325, + "total_submitted": 187548, + "total_column_articles": 740, "frontend_question_id": "454", "is_new_question": false }, @@ -45582,9 +45813,9 @@ "question__title": "Minimum Moves to Equal Array Elements", "question__title_slug": "minimum-moves-to-equal-array-elements", "question__hide": false, - "total_acs": 62699, - "total_submitted": 102307, - "total_column_articles": 736, + "total_acs": 63015, + "total_submitted": 102832, + "total_column_articles": 741, "frontend_question_id": "453", "is_new_question": false }, @@ -45603,9 +45834,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": 132234, - "total_submitted": 261092, - "total_column_articles": 1084, + "total_acs": 134161, + "total_submitted": 264994, + "total_column_articles": 1100, "frontend_question_id": "452", "is_new_question": false }, @@ -45624,9 +45855,9 @@ "question__title": "Sort Characters By Frequency", "question__title_slug": "sort-characters-by-frequency", "question__hide": false, - "total_acs": 98248, - "total_submitted": 137261, - "total_column_articles": 1104, + "total_acs": 98951, + "total_submitted": 138200, + "total_column_articles": 1111, "frontend_question_id": "451", "is_new_question": false }, @@ -45645,9 +45876,9 @@ "question__title": "Delete Node in a BST", "question__title_slug": "delete-node-in-a-bst", "question__hide": false, - "total_acs": 103967, - "total_submitted": 205906, - "total_column_articles": 1135, + "total_acs": 106380, + "total_submitted": 210407, + "total_column_articles": 1160, "frontend_question_id": "450", "is_new_question": false }, @@ -45666,9 +45897,9 @@ "question__title": "Serialize and Deserialize BST", "question__title_slug": "serialize-and-deserialize-bst", "question__hide": false, - "total_acs": 19935, - "total_submitted": 35266, - "total_column_articles": 173, + "total_acs": 20180, + "total_submitted": 35669, + "total_column_articles": 178, "frontend_question_id": "449", "is_new_question": false }, @@ -45687,9 +45918,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": 186982, - "total_submitted": 285789, - "total_column_articles": 1372, + "total_acs": 190533, + "total_submitted": 290973, + "total_column_articles": 1406, "frontend_question_id": "448", "is_new_question": false }, @@ -45708,8 +45939,8 @@ "question__title": "Number of Boomerangs", "question__title_slug": "number-of-boomerangs", "question__hide": false, - "total_acs": 51432, - "total_submitted": 77320, + "total_acs": 51568, + "total_submitted": 77509, "total_column_articles": 406, "frontend_question_id": "447", "is_new_question": false @@ -45729,8 +45960,8 @@ "question__title": "Arithmetic Slices II - Subsequence", "question__title_slug": "arithmetic-slices-ii-subsequence", "question__hide": false, - "total_acs": 20713, - "total_submitted": 37657, + "total_acs": 20796, + "total_submitted": 37850, "total_column_articles": 180, "frontend_question_id": "446", "is_new_question": false @@ -45750,9 +45981,9 @@ "question__title": "Add Two Numbers II", "question__title_slug": "add-two-numbers-ii", "question__hide": false, - "total_acs": 99037, - "total_submitted": 166317, - "total_column_articles": 1109, + "total_acs": 99850, + "total_submitted": 167604, + "total_column_articles": 1118, "frontend_question_id": "445", "is_new_question": false }, @@ -45771,9 +46002,9 @@ "question__title": "Sequence Reconstruction", "question__title_slug": "sequence-reconstruction", "question__hide": false, - "total_acs": 4300, - "total_submitted": 15814, - "total_column_articles": 65, + "total_acs": 4346, + "total_submitted": 15883, + "total_column_articles": 67, "frontend_question_id": "444", "is_new_question": false }, @@ -45792,9 +46023,9 @@ "question__title": "String Compression", "question__title_slug": "string-compression", "question__hide": false, - "total_acs": 63821, - "total_submitted": 133661, - "total_column_articles": 767, + "total_acs": 64286, + "total_submitted": 134623, + "total_column_articles": 773, "frontend_question_id": "443", "is_new_question": false }, @@ -45813,9 +46044,9 @@ "question__title": "Find All Duplicates in an Array", "question__title_slug": "find-all-duplicates-in-an-array", "question__hide": false, - "total_acs": 54043, - "total_submitted": 76785, - "total_column_articles": 554, + "total_acs": 54599, + "total_submitted": 77525, + "total_column_articles": 562, "frontend_question_id": "442", "is_new_question": false }, @@ -45834,9 +46065,9 @@ "question__title": "Arranging Coins", "question__title_slug": "arranging-coins", "question__hide": false, - "total_acs": 90474, - "total_submitted": 197537, - "total_column_articles": 865, + "total_acs": 91575, + "total_submitted": 199971, + "total_column_articles": 871, "frontend_question_id": "441", "is_new_question": false }, @@ -45855,9 +46086,9 @@ "question__title": "K-th Smallest in Lexicographical Order", "question__title_slug": "k-th-smallest-in-lexicographical-order", "question__hide": false, - "total_acs": 39472, - "total_submitted": 92470, - "total_column_articles": 275, + "total_acs": 39811, + "total_submitted": 93355, + "total_column_articles": 277, "frontend_question_id": "440", "is_new_question": false }, @@ -45876,8 +46107,8 @@ "question__title": "Ternary Expression Parser", "question__title_slug": "ternary-expression-parser", "question__hide": false, - "total_acs": 3337, - "total_submitted": 5577, + "total_acs": 3360, + "total_submitted": 5609, "total_column_articles": 78, "frontend_question_id": "439", "is_new_question": false @@ -45897,9 +46128,9 @@ "question__title": "Find All Anagrams in a String", "question__title_slug": "find-all-anagrams-in-a-string", "question__hide": false, - "total_acs": 174035, - "total_submitted": 319936, - "total_column_articles": 1449, + "total_acs": 177132, + "total_submitted": 325519, + "total_column_articles": 1477, "frontend_question_id": "438", "is_new_question": false }, @@ -45918,9 +46149,9 @@ "question__title": "Path Sum III", "question__title_slug": "path-sum-iii", "question__hide": false, - "total_acs": 159958, - "total_submitted": 280095, - "total_column_articles": 1210, + "total_acs": 161720, + "total_submitted": 283843, + "total_column_articles": 1224, "frontend_question_id": "437", "is_new_question": false }, @@ -45939,9 +46170,9 @@ "question__title": "Find Right Interval", "question__title_slug": "find-right-interval", "question__hide": false, - "total_acs": 11826, - "total_submitted": 24032, - "total_column_articles": 201, + "total_acs": 12068, + "total_submitted": 24429, + "total_column_articles": 207, "frontend_question_id": "436", "is_new_question": false }, @@ -45960,9 +46191,9 @@ "question__title": "Non-overlapping Intervals", "question__title_slug": "non-overlapping-intervals", "question__hide": false, - "total_acs": 139174, - "total_submitted": 274592, - "total_column_articles": 1147, + "total_acs": 141500, + "total_submitted": 278980, + "total_column_articles": 1163, "frontend_question_id": "435", "is_new_question": false }, @@ -45981,9 +46212,9 @@ "question__title": "Number of Segments in a String", "question__title_slug": "number-of-segments-in-a-string", "question__hide": false, - "total_acs": 72570, - "total_submitted": 182691, - "total_column_articles": 987, + "total_acs": 72952, + "total_submitted": 183789, + "total_column_articles": 988, "frontend_question_id": "434", "is_new_question": false }, @@ -46002,9 +46233,9 @@ "question__title": "Minimum Genetic Mutation", "question__title_slug": "minimum-genetic-mutation", "question__hide": false, - "total_acs": 19743, - "total_submitted": 36918, - "total_column_articles": 278, + "total_acs": 19939, + "total_submitted": 37276, + "total_column_articles": 280, "frontend_question_id": "433", "is_new_question": false }, @@ -46023,9 +46254,9 @@ "question__title": "All O`one Data Structure", "question__title_slug": "all-oone-data-structure", "question__hide": false, - "total_acs": 25668, - "total_submitted": 54380, - "total_column_articles": 272, + "total_acs": 25845, + "total_submitted": 54750, + "total_column_articles": 276, "frontend_question_id": "432", "is_new_question": false }, @@ -46044,8 +46275,8 @@ "question__title": "Word Squares", "question__title_slug": "word-squares", "question__hide": false, - "total_acs": 1907, - "total_submitted": 3091, + "total_acs": 1916, + "total_submitted": 3105, "total_column_articles": 40, "frontend_question_id": "425", "is_new_question": false @@ -46065,9 +46296,9 @@ "question__title": "Longest Repeating Character Replacement", "question__title_slug": "longest-repeating-character-replacement", "question__hide": false, - "total_acs": 62409, - "total_submitted": 116221, - "total_column_articles": 547, + "total_acs": 63392, + "total_submitted": 117955, + "total_column_articles": 560, "frontend_question_id": "424", "is_new_question": false }, @@ -46086,9 +46317,9 @@ "question__title": "Reconstruct Original Digits from English", "question__title_slug": "reconstruct-original-digits-from-english", "question__hide": false, - "total_acs": 35241, - "total_submitted": 57649, - "total_column_articles": 408, + "total_acs": 35351, + "total_submitted": 57835, + "total_column_articles": 411, "frontend_question_id": "423", "is_new_question": false }, @@ -46107,8 +46338,8 @@ "question__title": "Valid Word Square", "question__title_slug": "valid-word-square", "question__hide": false, - "total_acs": 2655, - "total_submitted": 6115, + "total_acs": 2681, + "total_submitted": 6170, "total_column_articles": 68, "frontend_question_id": "422", "is_new_question": false @@ -46128,9 +46359,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": 37199, - "total_submitted": 60002, - "total_column_articles": 350, + "total_acs": 37417, + "total_submitted": 60359, + "total_column_articles": 351, "frontend_question_id": "421", "is_new_question": false }, @@ -46149,8 +46380,8 @@ "question__title": "Strong Password Checker", "question__title_slug": "strong-password-checker", "question__hide": false, - "total_acs": 17076, - "total_submitted": 43344, + "total_acs": 17304, + "total_submitted": 43717, "total_column_articles": 155, "frontend_question_id": "420", "is_new_question": false @@ -46170,9 +46401,9 @@ "question__title": "Battleships in a Board", "question__title_slug": "battleships-in-a-board", "question__hide": false, - "total_acs": 36170, - "total_submitted": 45860, - "total_column_articles": 470, + "total_acs": 36408, + "total_submitted": 46187, + "total_column_articles": 472, "frontend_question_id": "419", "is_new_question": false }, @@ -46191,9 +46422,9 @@ "question__title": "Sentence Screen Fitting", "question__title_slug": "sentence-screen-fitting", "question__hide": false, - "total_acs": 2877, - "total_submitted": 7662, - "total_column_articles": 42, + "total_acs": 2903, + "total_submitted": 7732, + "total_column_articles": 43, "frontend_question_id": "418", "is_new_question": false }, @@ -46212,9 +46443,9 @@ "question__title": "Pacific Atlantic Water Flow", "question__title_slug": "pacific-atlantic-water-flow", "question__hide": false, - "total_acs": 38073, - "total_submitted": 75622, - "total_column_articles": 448, + "total_acs": 61339, + "total_submitted": 111857, + "total_column_articles": 685, "frontend_question_id": "417", "is_new_question": false }, @@ -46233,9 +46464,9 @@ "question__title": "Partition Equal Subset Sum", "question__title_slug": "partition-equal-subset-sum", "question__hide": false, - "total_acs": 252436, - "total_submitted": 489882, - "total_column_articles": 1375, + "total_acs": 257244, + "total_submitted": 498690, + "total_column_articles": 1393, "frontend_question_id": "416", "is_new_question": false }, @@ -46254,9 +46485,9 @@ "question__title": "Add Strings", "question__title_slug": "add-strings", "question__hide": false, - "total_acs": 197863, - "total_submitted": 361478, - "total_column_articles": 1361, + "total_acs": 199851, + "total_submitted": 364972, + "total_column_articles": 1365, "frontend_question_id": "415", "is_new_question": false }, @@ -46275,9 +46506,9 @@ "question__title": "Third Maximum Number", "question__title_slug": "third-maximum-number", "question__hide": false, - "total_acs": 106096, - "total_submitted": 269142, - "total_column_articles": 1332, + "total_acs": 106868, + "total_submitted": 271070, + "total_column_articles": 1341, "frontend_question_id": "414", "is_new_question": false }, @@ -46296,9 +46527,9 @@ "question__title": "Arithmetic Slices", "question__title_slug": "arithmetic-slices", "question__hide": false, - "total_acs": 94376, - "total_submitted": 136101, - "total_column_articles": 1206, + "total_acs": 95225, + "total_submitted": 137253, + "total_column_articles": 1215, "frontend_question_id": "413", "is_new_question": false }, @@ -46317,9 +46548,9 @@ "question__title": "Fizz Buzz", "question__title_slug": "fizz-buzz", "question__hide": false, - "total_acs": 119990, - "total_submitted": 168264, - "total_column_articles": 683, + "total_acs": 121044, + "total_submitted": 169765, + "total_column_articles": 689, "frontend_question_id": "412", "is_new_question": false }, @@ -46338,8 +46569,8 @@ "question__title": "Minimum Unique Word Abbreviation", "question__title_slug": "minimum-unique-word-abbreviation", "question__hide": false, - "total_acs": 1161, - "total_submitted": 2356, + "total_acs": 1166, + "total_submitted": 2365, "total_column_articles": 29, "frontend_question_id": "411", "is_new_question": false @@ -46359,9 +46590,9 @@ "question__title": "Split Array Largest Sum", "question__title_slug": "split-array-largest-sum", "question__hide": false, - "total_acs": 48631, - "total_submitted": 84244, - "total_column_articles": 407, + "total_acs": 49095, + "total_submitted": 84948, + "total_column_articles": 413, "frontend_question_id": "410", "is_new_question": false }, @@ -46380,9 +46611,9 @@ "question__title": "Longest Palindrome", "question__title_slug": "longest-palindrome", "question__hide": false, - "total_acs": 120526, - "total_submitted": 216897, - "total_column_articles": 1608, + "total_acs": 121820, + "total_submitted": 219218, + "total_column_articles": 1621, "frontend_question_id": "409", "is_new_question": false }, @@ -46401,8 +46632,8 @@ "question__title": "Valid Word Abbreviation", "question__title_slug": "valid-word-abbreviation", "question__hide": false, - "total_acs": 4910, - "total_submitted": 14237, + "total_acs": 4949, + "total_submitted": 14361, "total_column_articles": 96, "frontend_question_id": "408", "is_new_question": false @@ -46422,8 +46653,8 @@ "question__title": "Trapping Rain Water II", "question__title_slug": "trapping-rain-water-ii", "question__hide": false, - "total_acs": 27505, - "total_submitted": 47590, + "total_acs": 27743, + "total_submitted": 48006, "total_column_articles": 266, "frontend_question_id": "407", "is_new_question": false @@ -46443,9 +46674,9 @@ "question__title": "Queue Reconstruction by Height", "question__title_slug": "queue-reconstruction-by-height", "question__hide": false, - "total_acs": 159351, - "total_submitted": 213067, - "total_column_articles": 1008, + "total_acs": 161902, + "total_submitted": 216258, + "total_column_articles": 1023, "frontend_question_id": "406", "is_new_question": false }, @@ -46464,9 +46695,9 @@ "question__title": "Convert a Number to Hexadecimal", "question__title_slug": "convert-a-number-to-hexadecimal", "question__hide": false, - "total_acs": 52616, - "total_submitted": 94438, - "total_column_articles": 521, + "total_acs": 52943, + "total_submitted": 95076, + "total_column_articles": 524, "frontend_question_id": "405", "is_new_question": false }, @@ -46485,9 +46716,9 @@ "question__title": "Sum of Left Leaves", "question__title_slug": "sum-of-left-leaves", "question__hide": false, - "total_acs": 145473, - "total_submitted": 241047, - "total_column_articles": 1501, + "total_acs": 147855, + "total_submitted": 244672, + "total_column_articles": 1519, "frontend_question_id": "404", "is_new_question": false }, @@ -46506,9 +46737,9 @@ "question__title": "Frog Jump", "question__title_slug": "frog-jump", "question__hide": false, - "total_acs": 51155, - "total_submitted": 111952, - "total_column_articles": 503, + "total_acs": 51473, + "total_submitted": 112629, + "total_column_articles": 505, "frontend_question_id": "403", "is_new_question": false }, @@ -46527,9 +46758,9 @@ "question__title": "Remove K Digits", "question__title_slug": "remove-k-digits", "question__hide": false, - "total_acs": 101905, - "total_submitted": 314058, - "total_column_articles": 742, + "total_acs": 103012, + "total_submitted": 317673, + "total_column_articles": 745, "frontend_question_id": "402", "is_new_question": false }, @@ -46548,9 +46779,9 @@ "question__title": "Binary Watch", "question__title_slug": "binary-watch", "question__hide": false, - "total_acs": 60117, - "total_submitted": 97330, - "total_column_articles": 734, + "total_acs": 60390, + "total_submitted": 97737, + "total_column_articles": 736, "frontend_question_id": "401", "is_new_question": false }, @@ -46569,9 +46800,9 @@ "question__title": "Nth Digit", "question__title_slug": "nth-digit", "question__hide": false, - "total_acs": 46968, - "total_submitted": 103130, - "total_column_articles": 519, + "total_acs": 47313, + "total_submitted": 103946, + "total_column_articles": 524, "frontend_question_id": "400", "is_new_question": false }, @@ -46590,9 +46821,9 @@ "question__title": "Evaluate Division", "question__title_slug": "evaluate-division", "question__hide": false, - "total_acs": 53191, - "total_submitted": 89821, - "total_column_articles": 636, + "total_acs": 53934, + "total_submitted": 91089, + "total_column_articles": 646, "frontend_question_id": "399", "is_new_question": false }, @@ -46611,9 +46842,9 @@ "question__title": "Random Pick Index", "question__title_slug": "random-pick-index", "question__hide": false, - "total_acs": 19034, - "total_submitted": 28262, - "total_column_articles": 176, + "total_acs": 51019, + "total_submitted": 69057, + "total_column_articles": 416, "frontend_question_id": "398", "is_new_question": false }, @@ -46632,9 +46863,9 @@ "question__title": "Integer Replacement", "question__title_slug": "integer-replacement", "question__hide": false, - "total_acs": 54026, - "total_submitted": 125753, - "total_column_articles": 607, + "total_acs": 54387, + "total_submitted": 126633, + "total_column_articles": 611, "frontend_question_id": "397", "is_new_question": false }, @@ -46653,9 +46884,9 @@ "question__title": "Rotate Function", "question__title_slug": "rotate-function", "question__hide": false, - "total_acs": 39988, - "total_submitted": 74829, - "total_column_articles": 518, + "total_acs": 40897, + "total_submitted": 76448, + "total_column_articles": 528, "frontend_question_id": "396", "is_new_question": false }, @@ -46674,9 +46905,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": 63483, - "total_submitted": 121314, - "total_column_articles": 513, + "total_acs": 64061, + "total_submitted": 122394, + "total_column_articles": 516, "frontend_question_id": "395", "is_new_question": false }, @@ -46695,9 +46926,9 @@ "question__title": "Decode String", "question__title_slug": "decode-string", "question__hide": false, - "total_acs": 162005, - "total_submitted": 289220, - "total_column_articles": 1658, + "total_acs": 164087, + "total_submitted": 292792, + "total_column_articles": 1677, "frontend_question_id": "394", "is_new_question": false }, @@ -46716,8 +46947,8 @@ "question__title": "UTF-8 Validation", "question__title_slug": "utf-8-validation", "question__hide": false, - "total_acs": 34240, - "total_submitted": 77997, + "total_acs": 34390, + "total_submitted": 78322, "total_column_articles": 432, "frontend_question_id": "393", "is_new_question": false @@ -46737,9 +46968,9 @@ "question__title": "Is Subsequence", "question__title_slug": "is-subsequence", "question__hide": false, - "total_acs": 191197, - "total_submitted": 367326, - "total_column_articles": 1951, + "total_acs": 193607, + "total_submitted": 371591, + "total_column_articles": 1962, "frontend_question_id": "392", "is_new_question": false }, @@ -46758,9 +46989,9 @@ "question__title": "Perfect Rectangle", "question__title_slug": "perfect-rectangle", "question__hide": false, - "total_acs": 22748, - "total_submitted": 49117, - "total_column_articles": 206, + "total_acs": 22875, + "total_submitted": 49372, + "total_column_articles": 207, "frontend_question_id": "391", "is_new_question": false }, @@ -46779,9 +47010,9 @@ "question__title": "Elimination Game", "question__title_slug": "elimination-game", "question__hide": false, - "total_acs": 31320, - "total_submitted": 51394, - "total_column_articles": 407, + "total_acs": 31408, + "total_submitted": 51544, + "total_column_articles": 409, "frontend_question_id": "390", "is_new_question": false }, @@ -46800,9 +47031,9 @@ "question__title": "Find the Difference", "question__title_slug": "find-the-difference", "question__hide": false, - "total_acs": 123745, - "total_submitted": 180618, - "total_column_articles": 1251, + "total_acs": 124759, + "total_submitted": 182223, + "total_column_articles": 1261, "frontend_question_id": "389", "is_new_question": false }, @@ -46821,9 +47052,9 @@ "question__title": "Longest Absolute File Path", "question__title_slug": "longest-absolute-file-path", "question__hide": false, - "total_acs": 29317, - "total_submitted": 45732, - "total_column_articles": 462, + "total_acs": 29659, + "total_submitted": 46358, + "total_column_articles": 464, "frontend_question_id": "388", "is_new_question": false }, @@ -46842,9 +47073,9 @@ "question__title": "First Unique Character in a String", "question__title_slug": "first-unique-character-in-a-string", "question__hide": false, - "total_acs": 290075, - "total_submitted": 529958, - "total_column_articles": 1596, + "total_acs": 292794, + "total_submitted": 534624, + "total_column_articles": 1608, "frontend_question_id": "387", "is_new_question": false }, @@ -46863,9 +47094,9 @@ "question__title": "Lexicographical Numbers", "question__title_slug": "lexicographical-numbers", "question__hide": false, - "total_acs": 60111, - "total_submitted": 80029, - "total_column_articles": 593, + "total_acs": 60678, + "total_submitted": 80764, + "total_column_articles": 596, "frontend_question_id": "386", "is_new_question": false }, @@ -46884,8 +47115,8 @@ "question__title": "Mini Parser", "question__title_slug": "mini-parser", "question__hide": false, - "total_acs": 27927, - "total_submitted": 50741, + "total_acs": 28105, + "total_submitted": 51056, "total_column_articles": 268, "frontend_question_id": "385", "is_new_question": false @@ -46905,9 +47136,9 @@ "question__title": "Shuffle an Array", "question__title_slug": "shuffle-an-array", "question__hide": false, - "total_acs": 97315, - "total_submitted": 159337, - "total_column_articles": 461, + "total_acs": 98139, + "total_submitted": 160622, + "total_column_articles": 465, "frontend_question_id": "384", "is_new_question": false }, @@ -46926,9 +47157,9 @@ "question__title": "Ransom Note", "question__title_slug": "ransom-note", "question__hide": false, - "total_acs": 161748, - "total_submitted": 251228, - "total_column_articles": 1598, + "total_acs": 165168, + "total_submitted": 256600, + "total_column_articles": 1616, "frontend_question_id": "383", "is_new_question": false }, @@ -46947,9 +47178,9 @@ "question__title": "Linked List Random Node", "question__title_slug": "linked-list-random-node", "question__hide": false, - "total_acs": 44017, - "total_submitted": 61214, - "total_column_articles": 346, + "total_acs": 45415, + "total_submitted": 63062, + "total_column_articles": 360, "frontend_question_id": "382", "is_new_question": false }, @@ -46968,8 +47199,8 @@ "question__title": "Insert Delete GetRandom O(1) - Duplicates allowed", "question__title_slug": "insert-delete-getrandom-o1-duplicates-allowed", "question__hide": false, - "total_acs": 23211, - "total_submitted": 53535, + "total_acs": 23306, + "total_submitted": 53861, "total_column_articles": 208, "frontend_question_id": "381", "is_new_question": false @@ -46989,9 +47220,9 @@ "question__title": "Insert Delete GetRandom O(1)", "question__title_slug": "insert-delete-getrandom-o1", "question__hide": false, - "total_acs": 77476, - "total_submitted": 146542, - "total_column_articles": 903, + "total_acs": 78375, + "total_submitted": 148190, + "total_column_articles": 914, "frontend_question_id": "380", "is_new_question": false }, @@ -47010,9 +47241,9 @@ "question__title": "Design Phone Directory", "question__title_slug": "design-phone-directory", "question__hide": false, - "total_acs": 4289, - "total_submitted": 6879, - "total_column_articles": 85, + "total_acs": 4342, + "total_submitted": 6980, + "total_column_articles": 87, "frontend_question_id": "379", "is_new_question": false }, @@ -47031,9 +47262,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": 97097, - "total_submitted": 153583, - "total_column_articles": 691, + "total_acs": 97837, + "total_submitted": 154653, + "total_column_articles": 693, "frontend_question_id": "378", "is_new_question": false }, @@ -47052,9 +47283,9 @@ "question__title": "Combination Sum IV", "question__title_slug": "combination-sum-iv", "question__hide": false, - "total_acs": 89620, - "total_submitted": 172096, - "total_column_articles": 699, + "total_acs": 91030, + "total_submitted": 174699, + "total_column_articles": 707, "frontend_question_id": "377", "is_new_question": false }, @@ -47073,9 +47304,9 @@ "question__title": "Wiggle Subsequence", "question__title_slug": "wiggle-subsequence", "question__hide": false, - "total_acs": 110982, - "total_submitted": 236111, - "total_column_articles": 1123, + "total_acs": 112958, + "total_submitted": 240289, + "total_column_articles": 1135, "frontend_question_id": "376", "is_new_question": false }, @@ -47094,8 +47325,8 @@ "question__title": "Guess Number Higher or Lower II", "question__title_slug": "guess-number-higher-or-lower-ii", "question__hide": false, - "total_acs": 37223, - "total_submitted": 61363, + "total_acs": 37425, + "total_submitted": 61650, "total_column_articles": 286, "frontend_question_id": "375", "is_new_question": false @@ -47115,9 +47346,9 @@ "question__title": "Guess Number Higher or Lower", "question__title_slug": "guess-number-higher-or-lower", "question__hide": false, - "total_acs": 107625, - "total_submitted": 206787, - "total_column_articles": 730, + "total_acs": 109389, + "total_submitted": 210183, + "total_column_articles": 735, "frontend_question_id": "374", "is_new_question": false }, @@ -47136,9 +47367,9 @@ "question__title": "Find K Pairs with Smallest Sums", "question__title_slug": "find-k-pairs-with-smallest-sums", "question__hide": false, - "total_acs": 47616, - "total_submitted": 114141, - "total_column_articles": 465, + "total_acs": 47857, + "total_submitted": 114815, + "total_column_articles": 466, "frontend_question_id": "373", "is_new_question": false }, @@ -47157,8 +47388,8 @@ "question__title": "Super Pow", "question__title_slug": "super-pow", "question__hide": false, - "total_acs": 38654, - "total_submitted": 67360, + "total_acs": 38826, + "total_submitted": 67679, "total_column_articles": 390, "frontend_question_id": "372", "is_new_question": false @@ -47178,9 +47409,9 @@ "question__title": "Sum of Two Integers", "question__title_slug": "sum-of-two-integers", "question__hide": false, - "total_acs": 91661, - "total_submitted": 149190, - "total_column_articles": 577, + "total_acs": 92175, + "total_submitted": 150001, + "total_column_articles": 581, "frontend_question_id": "371", "is_new_question": false }, @@ -47199,9 +47430,9 @@ "question__title": "Range Addition", "question__title_slug": "range-addition", "question__hide": false, - "total_acs": 6572, - "total_submitted": 8777, - "total_column_articles": 163, + "total_acs": 6754, + "total_submitted": 9023, + "total_column_articles": 167, "frontend_question_id": "370", "is_new_question": false }, @@ -47220,9 +47451,9 @@ "question__title": "Plus One Linked List", "question__title_slug": "plus-one-linked-list", "question__hide": false, - "total_acs": 5925, - "total_submitted": 9454, - "total_column_articles": 163, + "total_acs": 5992, + "total_submitted": 9556, + "total_column_articles": 165, "frontend_question_id": "369", "is_new_question": false }, @@ -47241,9 +47472,9 @@ "question__title": "Largest Divisible Subset", "question__title_slug": "largest-divisible-subset", "question__hide": false, - "total_acs": 47380, - "total_submitted": 103054, - "total_column_articles": 501, + "total_acs": 47628, + "total_submitted": 103631, + "total_column_articles": 504, "frontend_question_id": "368", "is_new_question": false }, @@ -47262,9 +47493,9 @@ "question__title": "Valid Perfect Square", "question__title_slug": "valid-perfect-square", "question__hide": false, - "total_acs": 148783, - "total_submitted": 331985, - "total_column_articles": 1168, + "total_acs": 151026, + "total_submitted": 336837, + "total_column_articles": 1183, "frontend_question_id": "367", "is_new_question": false }, @@ -47283,9 +47514,9 @@ "question__title": "Find Leaves of Binary Tree", "question__title_slug": "find-leaves-of-binary-tree", "question__hide": false, - "total_acs": 6180, - "total_submitted": 7937, - "total_column_articles": 161, + "total_acs": 6262, + "total_submitted": 8038, + "total_column_articles": 165, "frontend_question_id": "366", "is_new_question": false }, @@ -47304,9 +47535,9 @@ "question__title": "Water and Jug Problem", "question__title_slug": "water-and-jug-problem", "question__hide": false, - "total_acs": 38845, - "total_submitted": 102676, - "total_column_articles": 527, + "total_acs": 39116, + "total_submitted": 103178, + "total_column_articles": 531, "frontend_question_id": "365", "is_new_question": false }, @@ -47325,8 +47556,8 @@ "question__title": "Nested List Weight Sum II", "question__title_slug": "nested-list-weight-sum-ii", "question__hide": false, - "total_acs": 2397, - "total_submitted": 3243, + "total_acs": 2420, + "total_submitted": 3279, "total_column_articles": 61, "frontend_question_id": "364", "is_new_question": false @@ -47346,9 +47577,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": 36057, - "total_submitted": 74173, - "total_column_articles": 239, + "total_acs": 36261, + "total_submitted": 74588, + "total_column_articles": 241, "frontend_question_id": "363", "is_new_question": false }, @@ -47367,9 +47598,9 @@ "question__title": "Design Hit Counter", "question__title_slug": "design-hit-counter", "question__hide": false, - "total_acs": 4758, - "total_submitted": 6930, - "total_column_articles": 86, + "total_acs": 4814, + "total_submitted": 7006, + "total_column_articles": 88, "frontend_question_id": "362", "is_new_question": false }, @@ -47388,8 +47619,8 @@ "question__title": "Bomb Enemy", "question__title_slug": "bomb-enemy", "question__hide": false, - "total_acs": 4410, - "total_submitted": 7647, + "total_acs": 4444, + "total_submitted": 7706, "total_column_articles": 84, "frontend_question_id": "361", "is_new_question": false @@ -47409,8 +47640,8 @@ "question__title": "Sort Transformed Array", "question__title_slug": "sort-transformed-array", "question__hide": false, - "total_acs": 3697, - "total_submitted": 6033, + "total_acs": 3739, + "total_submitted": 6097, "total_column_articles": 74, "frontend_question_id": "360", "is_new_question": false @@ -47430,9 +47661,9 @@ "question__title": "Logger Rate Limiter", "question__title_slug": "logger-rate-limiter", "question__hide": false, - "total_acs": 6458, - "total_submitted": 8740, - "total_column_articles": 78, + "total_acs": 6523, + "total_submitted": 8817, + "total_column_articles": 79, "frontend_question_id": "359", "is_new_question": false }, @@ -47451,8 +47682,8 @@ "question__title": "Rearrange String k Distance Apart", "question__title_slug": "rearrange-string-k-distance-apart", "question__hide": false, - "total_acs": 5241, - "total_submitted": 14762, + "total_acs": 5259, + "total_submitted": 14800, "total_column_articles": 66, "frontend_question_id": "358", "is_new_question": false @@ -47472,9 +47703,9 @@ "question__title": "Count Numbers with Unique Digits", "question__title_slug": "count-numbers-with-unique-digits", "question__hide": false, - "total_acs": 59086, - "total_submitted": 98861, - "total_column_articles": 841, + "total_acs": 59432, + "total_submitted": 99388, + "total_column_articles": 844, "frontend_question_id": "357", "is_new_question": false }, @@ -47493,8 +47724,8 @@ "question__title": "Line Reflection", "question__title_slug": "line-reflection", "question__hide": false, - "total_acs": 1976, - "total_submitted": 5510, + "total_acs": 1990, + "total_submitted": 5550, "total_column_articles": 50, "frontend_question_id": "356", "is_new_question": false @@ -47514,9 +47745,9 @@ "question__title": "Design Twitter", "question__title_slug": "design-twitter", "question__hide": false, - "total_acs": 33028, - "total_submitted": 80678, - "total_column_articles": 547, + "total_acs": 33284, + "total_submitted": 81269, + "total_column_articles": 551, "frontend_question_id": "355", "is_new_question": false }, @@ -47535,9 +47766,9 @@ "question__title": "Russian Doll Envelopes", "question__title_slug": "russian-doll-envelopes", "question__hide": false, - "total_acs": 82766, - "total_submitted": 193281, - "total_column_articles": 659, + "total_acs": 83320, + "total_submitted": 195424, + "total_column_articles": 665, "frontend_question_id": "354", "is_new_question": false }, @@ -47556,8 +47787,8 @@ "question__title": "Design Snake Game", "question__title_slug": "design-snake-game", "question__hide": false, - "total_acs": 3103, - "total_submitted": 7132, + "total_acs": 3132, + "total_submitted": 7186, "total_column_articles": 63, "frontend_question_id": "353", "is_new_question": false @@ -47577,8 +47808,8 @@ "question__title": "Data Stream as Disjoint Intervals", "question__title_slug": "data-stream-as-disjoint-intervals", "question__hide": false, - "total_acs": 22384, - "total_submitted": 33102, + "total_acs": 22467, + "total_submitted": 33239, "total_column_articles": 361, "frontend_question_id": "352", "is_new_question": false @@ -47598,9 +47829,9 @@ "question__title": "Android Unlock Patterns", "question__title_slug": "android-unlock-patterns", "question__hide": false, - "total_acs": 6096, - "total_submitted": 10173, - "total_column_articles": 116, + "total_acs": 6133, + "total_submitted": 10230, + "total_column_articles": 117, "frontend_question_id": "351", "is_new_question": false }, @@ -47619,9 +47850,9 @@ "question__title": "Intersection of Two Arrays II", "question__title_slug": "intersection-of-two-arrays-ii", "question__hide": false, - "total_acs": 341777, - "total_submitted": 609951, - "total_column_articles": 1988, + "total_acs": 345895, + "total_submitted": 616894, + "total_column_articles": 2008, "frontend_question_id": "350", "is_new_question": false }, @@ -47640,9 +47871,9 @@ "question__title": "Intersection of Two Arrays", "question__title_slug": "intersection-of-two-arrays", "question__hide": false, - "total_acs": 288916, - "total_submitted": 390251, - "total_column_articles": 2008, + "total_acs": 292380, + "total_submitted": 394783, + "total_column_articles": 2035, "frontend_question_id": "349", "is_new_question": false }, @@ -47661,9 +47892,9 @@ "question__title": "Design Tic-Tac-Toe", "question__title_slug": "design-tic-tac-toe", "question__hide": false, - "total_acs": 6842, - "total_submitted": 11304, - "total_column_articles": 107, + "total_acs": 6926, + "total_submitted": 11442, + "total_column_articles": 109, "frontend_question_id": "348", "is_new_question": false }, @@ -47682,9 +47913,9 @@ "question__title": "Top K Frequent Elements", "question__title_slug": "top-k-frequent-elements", "question__hide": false, - "total_acs": 280509, - "total_submitted": 446150, - "total_column_articles": 2042, + "total_acs": 284563, + "total_submitted": 452308, + "total_column_articles": 2067, "frontend_question_id": "347", "is_new_question": false }, @@ -47703,9 +47934,9 @@ "question__title": "Moving Average from Data Stream", "question__title_slug": "moving-average-from-data-stream", "question__hide": false, - "total_acs": 15770, - "total_submitted": 22006, - "total_column_articles": 168, + "total_acs": 15881, + "total_submitted": 22166, + "total_column_articles": 169, "frontend_question_id": "346", "is_new_question": false }, @@ -47724,9 +47955,9 @@ "question__title": "Reverse Vowels of a String", "question__title_slug": "reverse-vowels-of-a-string", "question__hide": false, - "total_acs": 125475, - "total_submitted": 231605, - "total_column_articles": 1178, + "total_acs": 126211, + "total_submitted": 233047, + "total_column_articles": 1183, "frontend_question_id": "345", "is_new_question": false }, @@ -47745,9 +47976,9 @@ "question__title": "Reverse String", "question__title_slug": "reverse-string", "question__hide": false, - "total_acs": 517838, - "total_submitted": 660377, - "total_column_articles": 2692, + "total_acs": 524096, + "total_submitted": 667960, + "total_column_articles": 2713, "frontend_question_id": "344", "is_new_question": false }, @@ -47766,9 +47997,9 @@ "question__title": "Integer Break", "question__title_slug": "integer-break", "question__hide": false, - "total_acs": 159151, - "total_submitted": 258271, - "total_column_articles": 1398, + "total_acs": 161759, + "total_submitted": 262383, + "total_column_articles": 1416, "frontend_question_id": "343", "is_new_question": false }, @@ -47787,9 +48018,9 @@ "question__title": "Power of Four", "question__title_slug": "power-of-four", "question__hide": false, - "total_acs": 102965, - "total_submitted": 197561, - "total_column_articles": 896, + "total_acs": 103643, + "total_submitted": 198866, + "total_column_articles": 898, "frontend_question_id": "342", "is_new_question": false }, @@ -47808,9 +48039,9 @@ "question__title": "Flatten Nested List Iterator", "question__title_slug": "flatten-nested-list-iterator", "question__hide": false, - "total_acs": 60026, - "total_submitted": 82684, - "total_column_articles": 558, + "total_acs": 60504, + "total_submitted": 83338, + "total_column_articles": 564, "frontend_question_id": "341", "is_new_question": false }, @@ -47829,9 +48060,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": 17586, - "total_submitted": 34866, - "total_column_articles": 235, + "total_acs": 17819, + "total_submitted": 35268, + "total_column_articles": 239, "frontend_question_id": "340", "is_new_question": false }, @@ -47850,9 +48081,9 @@ "question__title": "Nested List Weight Sum", "question__title_slug": "nested-list-weight-sum", "question__hide": false, - "total_acs": 4882, - "total_submitted": 5912, - "total_column_articles": 72, + "total_acs": 4922, + "total_submitted": 5971, + "total_column_articles": 73, "frontend_question_id": "339", "is_new_question": false }, @@ -47871,9 +48102,9 @@ "question__title": "Counting Bits", "question__title_slug": "counting-bits", "question__hide": false, - "total_acs": 207815, - "total_submitted": 264286, - "total_column_articles": 1698, + "total_acs": 210260, + "total_submitted": 267392, + "total_column_articles": 1718, "frontend_question_id": "338", "is_new_question": false }, @@ -47892,9 +48123,9 @@ "question__title": "House Robber III", "question__title_slug": "house-robber-iii", "question__hide": false, - "total_acs": 177143, - "total_submitted": 291989, - "total_column_articles": 1195, + "total_acs": 179853, + "total_submitted": 296546, + "total_column_articles": 1213, "frontend_question_id": "337", "is_new_question": false }, @@ -47913,9 +48144,9 @@ "question__title": "Palindrome Pairs", "question__title_slug": "palindrome-pairs", "question__hide": false, - "total_acs": 24048, - "total_submitted": 60949, - "total_column_articles": 203, + "total_acs": 24099, + "total_submitted": 61102, + "total_column_articles": 204, "frontend_question_id": "336", "is_new_question": false }, @@ -47934,8 +48165,8 @@ "question__title": "Self Crossing", "question__title_slug": "self-crossing", "question__hide": false, - "total_acs": 17032, - "total_submitted": 39735, + "total_acs": 17074, + "total_submitted": 39811, "total_column_articles": 153, "frontend_question_id": "335", "is_new_question": false @@ -47955,9 +48186,9 @@ "question__title": "Increasing Triplet Subsequence", "question__title_slug": "increasing-triplet-subsequence", "question__hide": false, - "total_acs": 92416, - "total_submitted": 213318, - "total_column_articles": 643, + "total_acs": 93244, + "total_submitted": 215393, + "total_column_articles": 649, "frontend_question_id": "334", "is_new_question": false }, @@ -47976,9 +48207,9 @@ "question__title": "Largest BST Subtree", "question__title_slug": "largest-bst-subtree", "question__hide": false, - "total_acs": 6167, - "total_submitted": 12981, - "total_column_articles": 110, + "total_acs": 6248, + "total_submitted": 13138, + "total_column_articles": 114, "frontend_question_id": "333", "is_new_question": false }, @@ -47997,9 +48228,9 @@ "question__title": "Reconstruct Itinerary", "question__title_slug": "reconstruct-itinerary", "question__hide": false, - "total_acs": 53350, - "total_submitted": 115918, - "total_column_articles": 417, + "total_acs": 54319, + "total_submitted": 117702, + "total_column_articles": 424, "frontend_question_id": "332", "is_new_question": false }, @@ -48018,9 +48249,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": 50939, - "total_submitted": 106279, - "total_column_articles": 558, + "total_acs": 51206, + "total_submitted": 106831, + "total_column_articles": 559, "frontend_question_id": "331", "is_new_question": false }, @@ -48039,9 +48270,9 @@ "question__title": "Patching Array", "question__title_slug": "patching-array", "question__hide": false, - "total_acs": 20314, - "total_submitted": 38318, - "total_column_articles": 162, + "total_acs": 20378, + "total_submitted": 38461, + "total_column_articles": 163, "frontend_question_id": "330", "is_new_question": false }, @@ -48060,9 +48291,9 @@ "question__title": "Longest Increasing Path in a Matrix", "question__title_slug": "longest-increasing-path-in-a-matrix", "question__hide": false, - "total_acs": 71215, - "total_submitted": 142404, - "total_column_articles": 643, + "total_acs": 71951, + "total_submitted": 143737, + "total_column_articles": 650, "frontend_question_id": "329", "is_new_question": false }, @@ -48081,9 +48312,9 @@ "question__title": "Odd Even Linked List", "question__title_slug": "odd-even-linked-list", "question__hide": false, - "total_acs": 156427, - "total_submitted": 239265, - "total_column_articles": 1266, + "total_acs": 157848, + "total_submitted": 241506, + "total_column_articles": 1274, "frontend_question_id": "328", "is_new_question": false }, @@ -48102,9 +48333,9 @@ "question__title": "Count of Range Sum", "question__title_slug": "count-of-range-sum", "question__hide": false, - "total_acs": 28996, - "total_submitted": 69786, - "total_column_articles": 246, + "total_acs": 29267, + "total_submitted": 70543, + "total_column_articles": 251, "frontend_question_id": "327", "is_new_question": false }, @@ -48123,9 +48354,9 @@ "question__title": "Power of Three", "question__title_slug": "power-of-three", "question__hide": false, - "total_acs": 162357, - "total_submitted": 320625, - "total_column_articles": 703, + "total_acs": 163527, + "total_submitted": 322928, + "total_column_articles": 706, "frontend_question_id": "326", "is_new_question": false }, @@ -48144,9 +48375,9 @@ "question__title": "Maximum Size Subarray Sum Equals k", "question__title_slug": "maximum-size-subarray-sum-equals-k", "question__hide": false, - "total_acs": 12182, - "total_submitted": 22807, - "total_column_articles": 143, + "total_acs": 12308, + "total_submitted": 23061, + "total_column_articles": 144, "frontend_question_id": "325", "is_new_question": false }, @@ -48165,8 +48396,8 @@ "question__title": "Wiggle Sort II", "question__title_slug": "wiggle-sort-ii", "question__hide": false, - "total_acs": 32545, - "total_submitted": 84570, + "total_acs": 32848, + "total_submitted": 85303, "total_column_articles": 214, "frontend_question_id": "324", "is_new_question": false @@ -48186,9 +48417,9 @@ "question__title": "Number of Connected Components in an Undirected Graph", "question__title_slug": "number-of-connected-components-in-an-undirected-graph", "question__hide": false, - "total_acs": 15260, - "total_submitted": 23669, - "total_column_articles": 209, + "total_acs": 15526, + "total_submitted": 24039, + "total_column_articles": 212, "frontend_question_id": "323", "is_new_question": false }, @@ -48207,9 +48438,9 @@ "question__title": "Coin Change", "question__title_slug": "coin-change", "question__hide": false, - "total_acs": 423365, - "total_submitted": 931248, - "total_column_articles": 2583, + "total_acs": 429468, + "total_submitted": 943760, + "total_column_articles": 2615, "frontend_question_id": "322", "is_new_question": false }, @@ -48228,9 +48459,9 @@ "question__title": "Create Maximum Number", "question__title_slug": "create-maximum-number", "question__hide": false, - "total_acs": 29918, - "total_submitted": 70937, - "total_column_articles": 252, + "total_acs": 30099, + "total_submitted": 71381, + "total_column_articles": 254, "frontend_question_id": "321", "is_new_question": false }, @@ -48249,8 +48480,8 @@ "question__title": "Generalized Abbreviation", "question__title_slug": "generalized-abbreviation", "question__hide": false, - "total_acs": 3628, - "total_submitted": 5262, + "total_acs": 3661, + "total_submitted": 5299, "total_column_articles": 64, "frontend_question_id": "320", "is_new_question": false @@ -48270,8 +48501,8 @@ "question__title": "Bulb Switcher", "question__title_slug": "bulb-switcher", "question__hide": false, - "total_acs": 51724, - "total_submitted": 90254, + "total_acs": 51960, + "total_submitted": 90659, "total_column_articles": 463, "frontend_question_id": "319", "is_new_question": false @@ -48291,9 +48522,9 @@ "question__title": "Maximum Product of Word Lengths", "question__title_slug": "maximum-product-of-word-lengths", "question__hide": false, - "total_acs": 55501, - "total_submitted": 75183, - "total_column_articles": 532, + "total_acs": 55818, + "total_submitted": 75609, + "total_column_articles": 533, "frontend_question_id": "318", "is_new_question": false }, @@ -48312,8 +48543,8 @@ "question__title": "Shortest Distance from All Buildings", "question__title_slug": "shortest-distance-from-all-buildings", "question__hide": false, - "total_acs": 5735, - "total_submitted": 12033, + "total_acs": 5786, + "total_submitted": 12144, "total_column_articles": 76, "frontend_question_id": "317", "is_new_question": false @@ -48333,9 +48564,9 @@ "question__title": "Remove Duplicate Letters", "question__title_slug": "remove-duplicate-letters", "question__hide": false, - "total_acs": 85249, - "total_submitted": 178204, - "total_column_articles": 688, + "total_acs": 86244, + "total_submitted": 180234, + "total_column_articles": 692, "frontend_question_id": "316", "is_new_question": false }, @@ -48354,9 +48585,9 @@ "question__title": "Count of Smaller Numbers After Self", "question__title_slug": "count-of-smaller-numbers-after-self", "question__hide": false, - "total_acs": 59450, - "total_submitted": 141016, - "total_column_articles": 571, + "total_acs": 60062, + "total_submitted": 142173, + "total_column_articles": 581, "frontend_question_id": "315", "is_new_question": false }, @@ -48375,8 +48606,8 @@ "question__title": "Binary Tree Vertical Order Traversal", "question__title_slug": "binary-tree-vertical-order-traversal", "question__hide": false, - "total_acs": 6829, - "total_submitted": 12282, + "total_acs": 6917, + "total_submitted": 12457, "total_column_articles": 121, "frontend_question_id": "314", "is_new_question": false @@ -48396,9 +48627,9 @@ "question__title": "Super Ugly Number", "question__title_slug": "super-ugly-number", "question__hide": false, - "total_acs": 47512, - "total_submitted": 80033, - "total_column_articles": 404, + "total_acs": 47790, + "total_submitted": 80699, + "total_column_articles": 407, "frontend_question_id": "313", "is_new_question": false }, @@ -48417,9 +48648,9 @@ "question__title": "Burst Balloons", "question__title_slug": "burst-balloons", "question__hide": false, - "total_acs": 72039, - "total_submitted": 104222, - "total_column_articles": 482, + "total_acs": 72869, + "total_submitted": 105331, + "total_column_articles": 484, "frontend_question_id": "312", "is_new_question": false }, @@ -48438,9 +48669,9 @@ "question__title": "Sparse Matrix Multiplication", "question__title_slug": "sparse-matrix-multiplication", "question__hide": false, - "total_acs": 4857, - "total_submitted": 6361, - "total_column_articles": 63, + "total_acs": 4916, + "total_submitted": 6435, + "total_column_articles": 65, "frontend_question_id": "311", "is_new_question": false }, @@ -48459,9 +48690,9 @@ "question__title": "Minimum Height Trees", "question__title_slug": "minimum-height-trees", "question__hide": false, - "total_acs": 47282, - "total_submitted": 109523, - "total_column_articles": 400, + "total_acs": 47728, + "total_submitted": 110554, + "total_column_articles": 403, "frontend_question_id": "310", "is_new_question": false }, @@ -48480,9 +48711,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": 167208, - "total_submitted": 266540, - "total_column_articles": 1331, + "total_acs": 169794, + "total_submitted": 270308, + "total_column_articles": 1358, "frontend_question_id": "309", "is_new_question": false }, @@ -48501,9 +48732,9 @@ "question__title": "Range Sum Query 2D - Mutable", "question__title_slug": "range-sum-query-2d-mutable", "question__hide": false, - "total_acs": 2955, - "total_submitted": 4709, - "total_column_articles": 62, + "total_acs": 3019, + "total_submitted": 4795, + "total_column_articles": 63, "frontend_question_id": "308", "is_new_question": false }, @@ -48522,9 +48753,9 @@ "question__title": "Range Sum Query - Mutable", "question__title_slug": "range-sum-query-mutable", "question__hide": false, - "total_acs": 50669, - "total_submitted": 100143, - "total_column_articles": 455, + "total_acs": 51174, + "total_submitted": 101055, + "total_column_articles": 461, "frontend_question_id": "307", "is_new_question": false }, @@ -48543,9 +48774,9 @@ "question__title": "Additive Number", "question__title_slug": "additive-number", "question__hide": false, - "total_acs": 41357, - "total_submitted": 108193, - "total_column_articles": 594, + "total_acs": 41610, + "total_submitted": 108823, + "total_column_articles": 595, "frontend_question_id": "306", "is_new_question": false }, @@ -48564,9 +48795,9 @@ "question__title": "Number of Islands II", "question__title_slug": "number-of-islands-ii", "question__hide": false, - "total_acs": 6064, - "total_submitted": 14958, - "total_column_articles": 94, + "total_acs": 6231, + "total_submitted": 15264, + "total_column_articles": 97, "frontend_question_id": "305", "is_new_question": false }, @@ -48585,9 +48816,9 @@ "question__title": "Range Sum Query 2D - Immutable", "question__title_slug": "range-sum-query-2d-immutable", "question__hide": false, - "total_acs": 87375, - "total_submitted": 149834, - "total_column_articles": 871, + "total_acs": 89041, + "total_submitted": 152176, + "total_column_articles": 881, "frontend_question_id": "304", "is_new_question": false }, @@ -48606,9 +48837,9 @@ "question__title": "Range Sum Query - Immutable", "question__title_slug": "range-sum-query-immutable", "question__hide": false, - "total_acs": 161343, - "total_submitted": 216339, - "total_column_articles": 1319, + "total_acs": 163173, + "total_submitted": 218513, + "total_column_articles": 1325, "frontend_question_id": "303", "is_new_question": false }, @@ -48627,8 +48858,8 @@ "question__title": "Smallest Rectangle Enclosing Black Pixels", "question__title_slug": "smallest-rectangle-enclosing-black-pixels", "question__hide": false, - "total_acs": 2703, - "total_submitted": 4077, + "total_acs": 2738, + "total_submitted": 4130, "total_column_articles": 50, "frontend_question_id": "302", "is_new_question": false @@ -48648,9 +48879,9 @@ "question__title": "Remove Invalid Parentheses", "question__title_slug": "remove-invalid-parentheses", "question__hide": false, - "total_acs": 66346, - "total_submitted": 120573, - "total_column_articles": 452, + "total_acs": 67207, + "total_submitted": 122104, + "total_column_articles": 454, "frontend_question_id": "301", "is_new_question": false }, @@ -48669,9 +48900,9 @@ "question__title": "Longest Increasing Subsequence", "question__title_slug": "longest-increasing-subsequence", "question__hide": false, - "total_acs": 500207, - "total_submitted": 939147, - "total_column_articles": 3013, + "total_acs": 507306, + "total_submitted": 951427, + "total_column_articles": 3118, "frontend_question_id": "300", "is_new_question": false }, @@ -48690,9 +48921,9 @@ "question__title": "Bulls and Cows", "question__title_slug": "bulls-and-cows", "question__hide": false, - "total_acs": 67335, - "total_submitted": 118937, - "total_column_articles": 757, + "total_acs": 67620, + "total_submitted": 119378, + "total_column_articles": 763, "frontend_question_id": "299", "is_new_question": false }, @@ -48711,9 +48942,9 @@ "question__title": "Binary Tree Longest Consecutive Sequence", "question__title_slug": "binary-tree-longest-consecutive-sequence", "question__hide": false, - "total_acs": 6705, - "total_submitted": 11360, - "total_column_articles": 104, + "total_acs": 6759, + "total_submitted": 11453, + "total_column_articles": 105, "frontend_question_id": "298", "is_new_question": false }, @@ -48732,9 +48963,9 @@ "question__title": "Serialize and Deserialize Binary Tree", "question__title_slug": "serialize-and-deserialize-binary-tree", "question__hide": false, - "total_acs": 147117, - "total_submitted": 256680, - "total_column_articles": 989, + "total_acs": 149348, + "total_submitted": 260349, + "total_column_articles": 1003, "frontend_question_id": "297", "is_new_question": false }, @@ -48753,9 +48984,9 @@ "question__title": "Best Meeting Point", "question__title_slug": "best-meeting-point", "question__hide": false, - "total_acs": 3190, - "total_submitted": 5123, - "total_column_articles": 54, + "total_acs": 3225, + "total_submitted": 5187, + "total_column_articles": 55, "frontend_question_id": "296", "is_new_question": false }, @@ -48774,9 +49005,9 @@ "question__title": "Find Median from Data Stream", "question__title_slug": "find-median-from-data-stream", "question__hide": false, - "total_acs": 81017, - "total_submitted": 153961, - "total_column_articles": 616, + "total_acs": 81702, + "total_submitted": 155166, + "total_column_articles": 621, "frontend_question_id": "295", "is_new_question": false }, @@ -48795,9 +49026,9 @@ "question__title": "Flip Game II", "question__title_slug": "flip-game-ii", "question__hide": false, - "total_acs": 4688, - "total_submitted": 7954, - "total_column_articles": 70, + "total_acs": 4740, + "total_submitted": 8030, + "total_column_articles": 71, "frontend_question_id": "294", "is_new_question": false }, @@ -48816,8 +49047,8 @@ "question__title": "Flip Game", "question__title_slug": "flip-game", "question__hide": false, - "total_acs": 6206, - "total_submitted": 8626, + "total_acs": 6247, + "total_submitted": 8685, "total_column_articles": 102, "frontend_question_id": "293", "is_new_question": false @@ -48837,9 +49068,9 @@ "question__title": "Nim Game", "question__title_slug": "nim-game", "question__hide": false, - "total_acs": 131125, - "total_submitted": 185304, - "total_column_articles": 873, + "total_acs": 131790, + "total_submitted": 186320, + "total_column_articles": 877, "frontend_question_id": "292", "is_new_question": false }, @@ -48858,9 +49089,9 @@ "question__title": "Word Pattern II", "question__title_slug": "word-pattern-ii", "question__hide": false, - "total_acs": 3298, - "total_submitted": 6259, - "total_column_articles": 73, + "total_acs": 3336, + "total_submitted": 6338, + "total_column_articles": 74, "frontend_question_id": "291", "is_new_question": false }, @@ -48879,9 +49110,9 @@ "question__title": "Word Pattern", "question__title_slug": "word-pattern", "question__hide": false, - "total_acs": 100827, - "total_submitted": 222623, - "total_column_articles": 1336, + "total_acs": 101617, + "total_submitted": 224401, + "total_column_articles": 1345, "frontend_question_id": "290", "is_new_question": false }, @@ -48900,9 +49131,9 @@ "question__title": "Game of Life", "question__title_slug": "game-of-life", "question__hide": false, - "total_acs": 61086, - "total_submitted": 80940, - "total_column_articles": 932, + "total_acs": 61454, + "total_submitted": 81431, + "total_column_articles": 939, "frontend_question_id": "289", "is_new_question": false }, @@ -48921,9 +49152,9 @@ "question__title": "Unique Word Abbreviation", "question__title_slug": "unique-word-abbreviation", "question__hide": false, - "total_acs": 4749, - "total_submitted": 10133, - "total_column_articles": 72, + "total_acs": 4813, + "total_submitted": 10241, + "total_column_articles": 74, "frontend_question_id": "288", "is_new_question": false }, @@ -48942,9 +49173,9 @@ "question__title": "Find the Duplicate Number", "question__title_slug": "find-the-duplicate-number", "question__hide": false, - "total_acs": 229969, - "total_submitted": 354105, - "total_column_articles": 1532, + "total_acs": 232660, + "total_submitted": 358338, + "total_column_articles": 1548, "frontend_question_id": "287", "is_new_question": false }, @@ -48963,9 +49194,9 @@ "question__title": "Walls and Gates", "question__title_slug": "walls-and-gates", "question__hide": false, - "total_acs": 15008, - "total_submitted": 28344, - "total_column_articles": 194, + "total_acs": 15137, + "total_submitted": 28516, + "total_column_articles": 195, "frontend_question_id": "286", "is_new_question": false }, @@ -48984,8 +49215,8 @@ "question__title": "Inorder Successor in BST", "question__title_slug": "inorder-successor-in-bst", "question__hide": false, - "total_acs": 11216, - "total_submitted": 17592, + "total_acs": 11361, + "total_submitted": 17802, "total_column_articles": 150, "frontend_question_id": "285", "is_new_question": false @@ -49005,8 +49236,8 @@ "question__title": "Peeking Iterator", "question__title_slug": "peeking-iterator", "question__hide": false, - "total_acs": 27570, - "total_submitted": 35907, + "total_acs": 27745, + "total_submitted": 36146, "total_column_articles": 229, "frontend_question_id": "284", "is_new_question": false @@ -49026,9 +49257,9 @@ "question__title": "Move Zeroes", "question__title_slug": "move-zeroes", "question__hide": false, - "total_acs": 720256, - "total_submitted": 1126650, - "total_column_articles": 4524, + "total_acs": 729634, + "total_submitted": 1141250, + "total_column_articles": 4580, "frontend_question_id": "283", "is_new_question": false }, @@ -49047,8 +49278,8 @@ "question__title": "Expression Add Operators", "question__title_slug": "expression-add-operators", "question__hide": false, - "total_acs": 21959, - "total_submitted": 45693, + "total_acs": 22100, + "total_submitted": 46079, "total_column_articles": 182, "frontend_question_id": "282", "is_new_question": false @@ -49068,9 +49299,9 @@ "question__title": "Zigzag Iterator", "question__title_slug": "zigzag-iterator", "question__hide": false, - "total_acs": 3688, - "total_submitted": 4840, - "total_column_articles": 88, + "total_acs": 3749, + "total_submitted": 4922, + "total_column_articles": 90, "frontend_question_id": "281", "is_new_question": false }, @@ -49089,9 +49320,9 @@ "question__title": "Wiggle Sort", "question__title_slug": "wiggle-sort", "question__hide": false, - "total_acs": 7147, - "total_submitted": 10379, - "total_column_articles": 87, + "total_acs": 7227, + "total_submitted": 10507, + "total_column_articles": 89, "frontend_question_id": "280", "is_new_question": false }, @@ -49110,9 +49341,9 @@ "question__title": "Perfect Squares", "question__title_slug": "perfect-squares", "question__hide": false, - "total_acs": 273058, - "total_submitted": 422470, - "total_column_articles": 1533, + "total_acs": 276781, + "total_submitted": 427720, + "total_column_articles": 1553, "frontend_question_id": "279", "is_new_question": false }, @@ -49131,9 +49362,9 @@ "question__title": "First Bad Version", "question__title_slug": "first-bad-version", "question__hide": false, - "total_acs": 316451, - "total_submitted": 700786, - "total_column_articles": 1756, + "total_acs": 320815, + "total_submitted": 709745, + "total_column_articles": 1778, "frontend_question_id": "278", "is_new_question": false }, @@ -49152,9 +49383,9 @@ "question__title": "Find the Celebrity", "question__title_slug": "find-the-celebrity", "question__hide": false, - "total_acs": 10381, - "total_submitted": 17983, - "total_column_articles": 117, + "total_acs": 10547, + "total_submitted": 18250, + "total_column_articles": 119, "frontend_question_id": "277", "is_new_question": false }, @@ -49173,9 +49404,9 @@ "question__title": "Paint Fence", "question__title_slug": "paint-fence", "question__hide": false, - "total_acs": 8559, - "total_submitted": 16711, - "total_column_articles": 161, + "total_acs": 8616, + "total_submitted": 16794, + "total_column_articles": 163, "frontend_question_id": "276", "is_new_question": false }, @@ -49194,9 +49425,9 @@ "question__title": "H-Index II", "question__title_slug": "h-index-ii", "question__hide": false, - "total_acs": 56862, - "total_submitted": 124191, - "total_column_articles": 468, + "total_acs": 57253, + "total_submitted": 125123, + "total_column_articles": 473, "frontend_question_id": "275", "is_new_question": false }, @@ -49215,9 +49446,9 @@ "question__title": "H-Index", "question__title_slug": "h-index", "question__hide": false, - "total_acs": 61355, - "total_submitted": 138886, - "total_column_articles": 635, + "total_acs": 61682, + "total_submitted": 139613, + "total_column_articles": 640, "frontend_question_id": "274", "is_new_question": false }, @@ -49236,9 +49467,9 @@ "question__title": "Integer to English Words", "question__title_slug": "integer-to-english-words", "question__hide": false, - "total_acs": 32175, - "total_submitted": 88022, - "total_column_articles": 385, + "total_acs": 32318, + "total_submitted": 88466, + "total_column_articles": 386, "frontend_question_id": "273", "is_new_question": false }, @@ -49257,8 +49488,8 @@ "question__title": "Closest Binary Search Tree Value II", "question__title_slug": "closest-binary-search-tree-value-ii", "question__hide": false, - "total_acs": 4534, - "total_submitted": 6910, + "total_acs": 4607, + "total_submitted": 7016, "total_column_articles": 99, "frontend_question_id": "272", "is_new_question": false @@ -49278,8 +49509,8 @@ "question__title": "Encode and Decode Strings", "question__title_slug": "encode-and-decode-strings", "question__hide": false, - "total_acs": 3428, - "total_submitted": 6030, + "total_acs": 3463, + "total_submitted": 6096, "total_column_articles": 59, "frontend_question_id": "271", "is_new_question": false @@ -49299,9 +49530,9 @@ "question__title": "Closest Binary Search Tree Value", "question__title_slug": "closest-binary-search-tree-value", "question__hide": false, - "total_acs": 13299, - "total_submitted": 23220, - "total_column_articles": 163, + "total_acs": 13431, + "total_submitted": 23433, + "total_column_articles": 164, "frontend_question_id": "270", "is_new_question": false }, @@ -49320,9 +49551,9 @@ "question__title": "Alien Dictionary", "question__title_slug": "alien-dictionary", "question__hide": false, - "total_acs": 8674, - "total_submitted": 24737, - "total_column_articles": 140, + "total_acs": 8805, + "total_submitted": 25009, + "total_column_articles": 143, "frontend_question_id": "269", "is_new_question": false }, @@ -49341,9 +49572,9 @@ "question__title": "Missing Number", "question__title_slug": "missing-number", "question__hide": false, - "total_acs": 226835, - "total_submitted": 345591, - "total_column_articles": 1729, + "total_acs": 228861, + "total_submitted": 348514, + "total_column_articles": 1741, "frontend_question_id": "268", "is_new_question": false }, @@ -49362,9 +49593,9 @@ "question__title": "Palindrome Permutation II", "question__title_slug": "palindrome-permutation-ii", "question__hide": false, - "total_acs": 4487, - "total_submitted": 9854, - "total_column_articles": 96, + "total_acs": 4555, + "total_submitted": 9958, + "total_column_articles": 97, "frontend_question_id": "267", "is_new_question": false }, @@ -49383,9 +49614,9 @@ "question__title": "Palindrome Permutation", "question__title_slug": "palindrome-permutation", "question__hide": false, - "total_acs": 8822, - "total_submitted": 12756, - "total_column_articles": 132, + "total_acs": 8898, + "total_submitted": 12872, + "total_column_articles": 133, "frontend_question_id": "266", "is_new_question": false }, @@ -49404,9 +49635,9 @@ "question__title": "Paint House II", "question__title_slug": "paint-house-ii", "question__hide": false, - "total_acs": 9703, - "total_submitted": 15732, - "total_column_articles": 210, + "total_acs": 9816, + "total_submitted": 15881, + "total_column_articles": 215, "frontend_question_id": "265", "is_new_question": false }, @@ -49425,9 +49656,9 @@ "question__title": "Ugly Number II", "question__title_slug": "ugly-number-ii", "question__hide": false, - "total_acs": 123315, - "total_submitted": 211268, - "total_column_articles": 773, + "total_acs": 124158, + "total_submitted": 212664, + "total_column_articles": 778, "frontend_question_id": "264", "is_new_question": false }, @@ -49446,9 +49677,9 @@ "question__title": "Ugly Number", "question__title_slug": "ugly-number", "question__hide": false, - "total_acs": 123978, - "total_submitted": 241890, - "total_column_articles": 954, + "total_acs": 124595, + "total_submitted": 243186, + "total_column_articles": 958, "frontend_question_id": "263", "is_new_question": false }, @@ -49467,9 +49698,9 @@ "question__title": "Trips and Users", "question__title_slug": "trips-and-users", "question__hide": false, - "total_acs": 47411, - "total_submitted": 111700, - "total_column_articles": 454, + "total_acs": 47785, + "total_submitted": 112551, + "total_column_articles": 457, "frontend_question_id": "262", "is_new_question": false }, @@ -49488,9 +49719,9 @@ "question__title": "Graph Valid Tree", "question__title_slug": "graph-valid-tree", "question__hide": false, - "total_acs": 11992, - "total_submitted": 23783, - "total_column_articles": 169, + "total_acs": 12192, + "total_submitted": 24179, + "total_column_articles": 173, "frontend_question_id": "261", "is_new_question": false }, @@ -49509,9 +49740,9 @@ "question__title": "Single Number III", "question__title_slug": "single-number-iii", "question__hide": false, - "total_acs": 88860, - "total_submitted": 120820, - "total_column_articles": 786, + "total_acs": 89474, + "total_submitted": 121705, + "total_column_articles": 791, "frontend_question_id": "260", "is_new_question": false }, @@ -49530,8 +49761,8 @@ "question__title": "3Sum Smaller", "question__title_slug": "3sum-smaller", "question__hide": false, - "total_acs": 9382, - "total_submitted": 16777, + "total_acs": 9460, + "total_submitted": 16936, "total_column_articles": 114, "frontend_question_id": "259", "is_new_question": false @@ -49551,9 +49782,9 @@ "question__title": "Add Digits", "question__title_slug": "add-digits", "question__hide": false, - "total_acs": 134811, - "total_submitted": 189765, - "total_column_articles": 1142, + "total_acs": 135514, + "total_submitted": 190799, + "total_column_articles": 1147, "frontend_question_id": "258", "is_new_question": false }, @@ -49572,9 +49803,9 @@ "question__title": "Binary Tree Paths", "question__title_slug": "binary-tree-paths", "question__hide": false, - "total_acs": 199788, - "total_submitted": 287482, - "total_column_articles": 1409, + "total_acs": 202842, + "total_submitted": 291658, + "total_column_articles": 1424, "frontend_question_id": "257", "is_new_question": false }, @@ -49593,9 +49824,9 @@ "question__title": "Paint House", "question__title_slug": "paint-house", "question__hide": false, - "total_acs": 15706, - "total_submitted": 23557, - "total_column_articles": 242, + "total_acs": 15897, + "total_submitted": 23793, + "total_column_articles": 248, "frontend_question_id": "256", "is_new_question": false }, @@ -49614,9 +49845,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": 6845, - "total_submitted": 14116, - "total_column_articles": 84, + "total_acs": 6949, + "total_submitted": 14319, + "total_column_articles": 85, "frontend_question_id": "255", "is_new_question": false }, @@ -49635,8 +49866,8 @@ "question__title": "Factor Combinations", "question__title_slug": "factor-combinations", "question__hide": false, - "total_acs": 7282, - "total_submitted": 12725, + "total_acs": 7351, + "total_submitted": 12843, "total_column_articles": 110, "frontend_question_id": "254", "is_new_question": false @@ -49656,9 +49887,9 @@ "question__title": "Meeting Rooms II", "question__title_slug": "meeting-rooms-ii", "question__hide": false, - "total_acs": 45867, - "total_submitted": 89431, - "total_column_articles": 461, + "total_acs": 46510, + "total_submitted": 90583, + "total_column_articles": 466, "frontend_question_id": "253", "is_new_question": false }, @@ -49677,9 +49908,9 @@ "question__title": "Meeting Rooms", "question__title_slug": "meeting-rooms", "question__hide": false, - "total_acs": 16840, - "total_submitted": 29470, - "total_column_articles": 191, + "total_acs": 17041, + "total_submitted": 29855, + "total_column_articles": 194, "frontend_question_id": "252", "is_new_question": false }, @@ -49698,9 +49929,9 @@ "question__title": "Flatten 2D Vector", "question__title_slug": "flatten-2d-vector", "question__hide": false, - "total_acs": 5076, - "total_submitted": 9153, - "total_column_articles": 87, + "total_acs": 5169, + "total_submitted": 9316, + "total_column_articles": 91, "frontend_question_id": "251", "is_new_question": false }, @@ -49719,9 +49950,9 @@ "question__title": "Count Univalue Subtrees", "question__title_slug": "count-univalue-subtrees", "question__hide": false, - "total_acs": 5780, - "total_submitted": 9140, - "total_column_articles": 108, + "total_acs": 5828, + "total_submitted": 9208, + "total_column_articles": 110, "frontend_question_id": "250", "is_new_question": false }, @@ -49740,9 +49971,9 @@ "question__title": "Group Shifted Strings", "question__title_slug": "group-shifted-strings", "question__hide": false, - "total_acs": 7847, - "total_submitted": 12132, - "total_column_articles": 139, + "total_acs": 7925, + "total_submitted": 12235, + "total_column_articles": 140, "frontend_question_id": "249", "is_new_question": false }, @@ -49761,9 +49992,9 @@ "question__title": "Strobogrammatic Number III", "question__title_slug": "strobogrammatic-number-iii", "question__hide": false, - "total_acs": 3316, - "total_submitted": 6916, - "total_column_articles": 63, + "total_acs": 3350, + "total_submitted": 6986, + "total_column_articles": 64, "frontend_question_id": "248", "is_new_question": false }, @@ -49782,8 +50013,8 @@ "question__title": "Strobogrammatic Number II", "question__title_slug": "strobogrammatic-number-ii", "question__hide": false, - "total_acs": 6637, - "total_submitted": 12430, + "total_acs": 6685, + "total_submitted": 12541, "total_column_articles": 115, "frontend_question_id": "247", "is_new_question": false @@ -49803,8 +50034,8 @@ "question__title": "Strobogrammatic Number", "question__title_slug": "strobogrammatic-number", "question__hide": false, - "total_acs": 7793, - "total_submitted": 16337, + "total_acs": 7888, + "total_submitted": 16532, "total_column_articles": 141, "frontend_question_id": "246", "is_new_question": false @@ -49824,8 +50055,8 @@ "question__title": "Shortest Word Distance III", "question__title_slug": "shortest-word-distance-iii", "question__hide": false, - "total_acs": 5674, - "total_submitted": 9750, + "total_acs": 5736, + "total_submitted": 9898, "total_column_articles": 78, "frontend_question_id": "245", "is_new_question": false @@ -49845,9 +50076,9 @@ "question__title": "Shortest Word Distance II", "question__title_slug": "shortest-word-distance-ii", "question__hide": false, - "total_acs": 6993, - "total_submitted": 12173, - "total_column_articles": 84, + "total_acs": 7101, + "total_submitted": 12353, + "total_column_articles": 86, "frontend_question_id": "244", "is_new_question": false }, @@ -49866,8 +50097,8 @@ "question__title": "Shortest Word Distance", "question__title_slug": "shortest-word-distance", "question__hide": false, - "total_acs": 11685, - "total_submitted": 17678, + "total_acs": 11804, + "total_submitted": 17856, "total_column_articles": 144, "frontend_question_id": "243", "is_new_question": false @@ -49887,9 +50118,9 @@ "question__title": "Valid Anagram", "question__title_slug": "valid-anagram", "question__hide": false, - "total_acs": 405034, - "total_submitted": 620865, - "total_column_articles": 2337, + "total_acs": 410466, + "total_submitted": 628952, + "total_column_articles": 2364, "frontend_question_id": "242", "is_new_question": false }, @@ -49908,9 +50139,9 @@ "question__title": "Different Ways to Add Parentheses", "question__title_slug": "different-ways-to-add-parentheses", "question__hide": false, - "total_acs": 41939, - "total_submitted": 57054, - "total_column_articles": 393, + "total_acs": 42449, + "total_submitted": 57733, + "total_column_articles": 401, "frontend_question_id": "241", "is_new_question": false }, @@ -49929,9 +50160,9 @@ "question__title": "Search a 2D Matrix II", "question__title_slug": "search-a-2d-matrix-ii", "question__hide": false, - "total_acs": 263420, - "total_submitted": 517400, - "total_column_articles": 1318, + "total_acs": 266516, + "total_submitted": 522586, + "total_column_articles": 1330, "frontend_question_id": "240", "is_new_question": false }, @@ -49950,9 +50181,9 @@ "question__title": "Sliding Window Maximum", "question__title_slug": "sliding-window-maximum", "question__hide": false, - "total_acs": 279694, - "total_submitted": 561325, - "total_column_articles": 1819, + "total_acs": 284259, + "total_submitted": 570115, + "total_column_articles": 1853, "frontend_question_id": "239", "is_new_question": false }, @@ -49971,9 +50202,9 @@ "question__title": "Product of Array Except Self", "question__title_slug": "product-of-array-except-self", "question__hide": false, - "total_acs": 184644, - "total_submitted": 251949, - "total_column_articles": 1177, + "total_acs": 186901, + "total_submitted": 254756, + "total_column_articles": 1191, "frontend_question_id": "238", "is_new_question": false }, @@ -49992,9 +50223,9 @@ "question__title": "Delete Node in a Linked List", "question__title_slug": "delete-node-in-a-linked-list", "question__hide": false, - "total_acs": 285322, - "total_submitted": 332322, - "total_column_articles": 1480, + "total_acs": 287089, + "total_submitted": 334419, + "total_column_articles": 1493, "frontend_question_id": "237", "is_new_question": false }, @@ -50013,9 +50244,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": 364768, - "total_submitted": 529214, - "total_column_articles": 1924, + "total_acs": 370012, + "total_submitted": 536613, + "total_column_articles": 1952, "frontend_question_id": "236", "is_new_question": false }, @@ -50034,9 +50265,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": 230934, - "total_submitted": 343722, - "total_column_articles": 1308, + "total_acs": 234050, + "total_submitted": 348072, + "total_column_articles": 1332, "frontend_question_id": "235", "is_new_question": false }, @@ -50055,9 +50286,9 @@ "question__title": "Palindrome Linked List", "question__title_slug": "palindrome-linked-list", "question__hide": false, - "total_acs": 418202, - "total_submitted": 814347, - "total_column_articles": 2615, + "total_acs": 423886, + "total_submitted": 824448, + "total_column_articles": 2647, "frontend_question_id": "234", "is_new_question": false }, @@ -50076,9 +50307,9 @@ "question__title": "Number of Digit One", "question__title_slug": "number-of-digit-one", "question__hide": false, - "total_acs": 41019, - "total_submitted": 85187, - "total_column_articles": 495, + "total_acs": 41283, + "total_submitted": 85711, + "total_column_articles": 498, "frontend_question_id": "233", "is_new_question": false }, @@ -50097,9 +50328,9 @@ "question__title": "Implement Queue using Stacks", "question__title_slug": "implement-queue-using-stacks", "question__hide": false, - "total_acs": 228771, - "total_submitted": 332347, - "total_column_articles": 1694, + "total_acs": 232160, + "total_submitted": 337165, + "total_column_articles": 1720, "frontend_question_id": "232", "is_new_question": false }, @@ -50118,9 +50349,9 @@ "question__title": "Power of Two", "question__title_slug": "power-of-two", "question__hide": false, - "total_acs": 220453, - "total_submitted": 437240, - "total_column_articles": 1601, + "total_acs": 222546, + "total_submitted": 441324, + "total_column_articles": 1615, "frontend_question_id": "231", "is_new_question": false }, @@ -50139,9 +50370,9 @@ "question__title": "Kth Smallest Element in a BST", "question__title_slug": "kth-smallest-element-in-a-bst", "question__hide": false, - "total_acs": 203355, - "total_submitted": 269884, - "total_column_articles": 1409, + "total_acs": 205302, + "total_submitted": 272425, + "total_column_articles": 1419, "frontend_question_id": "230", "is_new_question": false }, @@ -50160,9 +50391,9 @@ "question__title": "Majority Element II", "question__title_slug": "majority-element-ii", "question__hide": false, - "total_acs": 78653, - "total_submitted": 146923, - "total_column_articles": 737, + "total_acs": 79182, + "total_submitted": 147842, + "total_column_articles": 741, "frontend_question_id": "229", "is_new_question": false }, @@ -50181,9 +50412,9 @@ "question__title": "Summary Ranges", "question__title_slug": "summary-ranges", "question__hide": false, - "total_acs": 70101, - "total_submitted": 123339, - "total_column_articles": 791, + "total_acs": 70688, + "total_submitted": 124505, + "total_column_articles": 798, "frontend_question_id": "228", "is_new_question": false }, @@ -50202,9 +50433,9 @@ "question__title": "Basic Calculator II", "question__title_slug": "basic-calculator-ii", "question__hide": false, - "total_acs": 109224, - "total_submitted": 248810, - "total_column_articles": 857, + "total_acs": 110512, + "total_submitted": 251620, + "total_column_articles": 868, "frontend_question_id": "227", "is_new_question": false }, @@ -50223,9 +50454,9 @@ "question__title": "Invert Binary Tree", "question__title_slug": "invert-binary-tree", "question__hide": false, - "total_acs": 438292, - "total_submitted": 554236, - "total_column_articles": 2844, + "total_acs": 444418, + "total_submitted": 561822, + "total_column_articles": 2889, "frontend_question_id": "226", "is_new_question": false }, @@ -50244,9 +50475,9 @@ "question__title": "Implement Stack using Queues", "question__title_slug": "implement-stack-using-queues", "question__hide": false, - "total_acs": 186304, - "total_submitted": 275596, - "total_column_articles": 5046, + "total_acs": 188744, + "total_submitted": 279138, + "total_column_articles": 5062, "frontend_question_id": "225", "is_new_question": false }, @@ -50265,9 +50496,9 @@ "question__title": "Basic Calculator", "question__title_slug": "basic-calculator", "question__hide": false, - "total_acs": 86497, - "total_submitted": 206610, - "total_column_articles": 771, + "total_acs": 87368, + "total_submitted": 208614, + "total_column_articles": 778, "frontend_question_id": "224", "is_new_question": false }, @@ -50286,9 +50517,9 @@ "question__title": "Rectangle Area", "question__title_slug": "rectangle-area", "question__hide": false, - "total_acs": 46933, - "total_submitted": 88740, - "total_column_articles": 565, + "total_acs": 47216, + "total_submitted": 89233, + "total_column_articles": 567, "frontend_question_id": "223", "is_new_question": false }, @@ -50307,9 +50538,9 @@ "question__title": "Count Complete Tree Nodes", "question__title_slug": "count-complete-tree-nodes", "question__hide": false, - "total_acs": 173262, - "total_submitted": 217917, - "total_column_articles": 1202, + "total_acs": 176430, + "total_submitted": 221721, + "total_column_articles": 1222, "frontend_question_id": "222", "is_new_question": false }, @@ -50328,9 +50559,9 @@ "question__title": "Maximal Square", "question__title_slug": "maximal-square", "question__hide": false, - "total_acs": 188922, - "total_submitted": 387398, - "total_column_articles": 1268, + "total_acs": 191301, + "total_submitted": 391983, + "total_column_articles": 1278, "frontend_question_id": "221", "is_new_question": false }, @@ -50349,9 +50580,9 @@ "question__title": "Contains Duplicate III", "question__title_slug": "contains-duplicate-iii", "question__hide": false, - "total_acs": 76657, - "total_submitted": 265267, - "total_column_articles": 509, + "total_acs": 77317, + "total_submitted": 267653, + "total_column_articles": 513, "frontend_question_id": "220", "is_new_question": false }, @@ -50370,9 +50601,9 @@ "question__title": "Contains Duplicate II", "question__title_slug": "contains-duplicate-ii", "question__hide": false, - "total_acs": 176235, - "total_submitted": 397030, - "total_column_articles": 1456, + "total_acs": 177812, + "total_submitted": 400482, + "total_column_articles": 1472, "frontend_question_id": "219", "is_new_question": false }, @@ -50391,9 +50622,9 @@ "question__title": "The Skyline Problem", "question__title_slug": "the-skyline-problem", "question__hide": false, - "total_acs": 37985, - "total_submitted": 69688, - "total_column_articles": 339, + "total_acs": 38277, + "total_submitted": 70194, + "total_column_articles": 340, "frontend_question_id": "218", "is_new_question": false }, @@ -50412,9 +50643,9 @@ "question__title": "Contains Duplicate", "question__title_slug": "contains-duplicate", "question__hide": false, - "total_acs": 549921, - "total_submitted": 989218, - "total_column_articles": 2539, + "total_acs": 556765, + "total_submitted": 1001436, + "total_column_articles": 2580, "frontend_question_id": "217", "is_new_question": false }, @@ -50433,9 +50664,9 @@ "question__title": "Combination Sum III", "question__title_slug": "combination-sum-iii", "question__hide": false, - "total_acs": 150086, - "total_submitted": 206227, - "total_column_articles": 1376, + "total_acs": 152975, + "total_submitted": 210315, + "total_column_articles": 1392, "frontend_question_id": "216", "is_new_question": false }, @@ -50454,9 +50685,9 @@ "question__title": "Kth Largest Element in an Array", "question__title_slug": "kth-largest-element-in-an-array", "question__hide": false, - "total_acs": 605759, - "total_submitted": 936430, - "total_column_articles": 3052, + "total_acs": 613113, + "total_submitted": 947898, + "total_column_articles": 3091, "frontend_question_id": "215", "is_new_question": false }, @@ -50475,8 +50706,8 @@ "question__title": "Shortest Palindrome", "question__title_slug": "shortest-palindrome", "question__hide": false, - "total_acs": 36060, - "total_submitted": 94922, + "total_acs": 36300, + "total_submitted": 95398, "total_column_articles": 363, "frontend_question_id": "214", "is_new_question": false @@ -50496,9 +50727,9 @@ "question__title": "House Robber II", "question__title_slug": "house-robber-ii", "question__hide": false, - "total_acs": 236281, - "total_submitted": 541632, - "total_column_articles": 2089, + "total_acs": 239123, + "total_submitted": 547827, + "total_column_articles": 2112, "frontend_question_id": "213", "is_new_question": false }, @@ -50517,9 +50748,9 @@ "question__title": "Word Search II", "question__title_slug": "word-search-ii", "question__hide": false, - "total_acs": 73597, - "total_submitted": 160664, - "total_column_articles": 644, + "total_acs": 74040, + "total_submitted": 161986, + "total_column_articles": 645, "frontend_question_id": "212", "is_new_question": false }, @@ -50538,9 +50769,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": 57571, - "total_submitted": 112969, - "total_column_articles": 611, + "total_acs": 57960, + "total_submitted": 113825, + "total_column_articles": 612, "frontend_question_id": "211", "is_new_question": false }, @@ -50559,9 +50790,9 @@ "question__title": "Course Schedule II", "question__title_slug": "course-schedule-ii", "question__hide": false, - "total_acs": 122323, - "total_submitted": 220760, - "total_column_articles": 903, + "total_acs": 123900, + "total_submitted": 223448, + "total_column_articles": 914, "frontend_question_id": "210", "is_new_question": false }, @@ -50580,9 +50811,9 @@ "question__title": "Minimum Size Subarray Sum", "question__title_slug": "minimum-size-subarray-sum", "question__hide": false, - "total_acs": 312150, - "total_submitted": 643460, - "total_column_articles": 2147, + "total_acs": 318499, + "total_submitted": 655677, + "total_column_articles": 2182, "frontend_question_id": "209", "is_new_question": false }, @@ -50601,9 +50832,9 @@ "question__title": "Implement Trie (Prefix Tree)", "question__title_slug": "implement-trie-prefix-tree", "question__hide": false, - "total_acs": 190791, - "total_submitted": 265512, - "total_column_articles": 1240, + "total_acs": 192798, + "total_submitted": 268310, + "total_column_articles": 1255, "frontend_question_id": "208", "is_new_question": false }, @@ -50622,9 +50853,9 @@ "question__title": "Course Schedule", "question__title_slug": "course-schedule", "question__hide": false, - "total_acs": 198875, - "total_submitted": 369119, - "total_column_articles": 1290, + "total_acs": 201805, + "total_submitted": 374743, + "total_column_articles": 1310, "frontend_question_id": "207", "is_new_question": false }, @@ -50643,9 +50874,9 @@ "question__title": "Reverse Linked List", "question__title_slug": "reverse-linked-list", "question__hide": false, - "total_acs": 1004798, - "total_submitted": 1378481, - "total_column_articles": 9019, + "total_acs": 1017846, + "total_submitted": 1396092, + "total_column_articles": 9074, "frontend_question_id": "206", "is_new_question": false }, @@ -50664,9 +50895,9 @@ "question__title": "Isomorphic Strings", "question__title_slug": "isomorphic-strings", "question__hide": false, - "total_acs": 137906, - "total_submitted": 276685, - "total_column_articles": 1050, + "total_acs": 139003, + "total_submitted": 278880, + "total_column_articles": 1061, "frontend_question_id": "205", "is_new_question": false }, @@ -50685,9 +50916,9 @@ "question__title": "Count Primes", "question__title_slug": "count-primes", "question__hide": false, - "total_acs": 198682, - "total_submitted": 529660, - "total_column_articles": 849, + "total_acs": 200216, + "total_submitted": 533855, + "total_column_articles": 851, "frontend_question_id": "204", "is_new_question": false }, @@ -50706,9 +50937,9 @@ "question__title": "Remove Linked List Elements", "question__title_slug": "remove-linked-list-elements", "question__hide": false, - "total_acs": 341918, - "total_submitted": 640897, - "total_column_articles": 2282, + "total_acs": 347513, + "total_submitted": 650627, + "total_column_articles": 2308, "frontend_question_id": "203", "is_new_question": false }, @@ -50727,9 +50958,9 @@ "question__title": "Happy Number", "question__title_slug": "happy-number", "question__hide": false, - "total_acs": 238416, - "total_submitted": 380191, - "total_column_articles": 1880, + "total_acs": 241794, + "total_submitted": 385504, + "total_column_articles": 1905, "frontend_question_id": "202", "is_new_question": false }, @@ -50748,9 +50979,9 @@ "question__title": "Bitwise AND of Numbers Range", "question__title_slug": "bitwise-and-of-numbers-range", "question__hide": false, - "total_acs": 59680, - "total_submitted": 112011, - "total_column_articles": 409, + "total_acs": 60150, + "total_submitted": 112843, + "total_column_articles": 413, "frontend_question_id": "201", "is_new_question": false }, @@ -50769,9 +51000,9 @@ "question__title": "Number of Islands", "question__title_slug": "number-of-islands", "question__hide": false, - "total_acs": 455795, - "total_submitted": 792170, - "total_column_articles": 2797, + "total_acs": 461788, + "total_submitted": 801566, + "total_column_articles": 2841, "frontend_question_id": "200", "is_new_question": false }, @@ -50790,9 +51021,9 @@ "question__title": "Binary Tree Right Side View", "question__title_slug": "binary-tree-right-side-view", "question__hide": false, - "total_acs": 198341, - "total_submitted": 303070, - "total_column_articles": 2092, + "total_acs": 200979, + "total_submitted": 307116, + "total_column_articles": 2109, "frontend_question_id": "199", "is_new_question": false }, @@ -50811,9 +51042,9 @@ "question__title": "House Robber", "question__title_slug": "house-robber", "question__hide": false, - "total_acs": 533618, - "total_submitted": 1006860, - "total_column_articles": 3585, + "total_acs": 539602, + "total_submitted": 1017123, + "total_column_articles": 3622, "frontend_question_id": "198", "is_new_question": false }, @@ -50832,9 +51063,9 @@ "question__title": "Rising Temperature", "question__title_slug": "rising-temperature", "question__hide": false, - "total_acs": 119061, - "total_submitted": 223293, - "total_column_articles": 664, + "total_acs": 120428, + "total_submitted": 225683, + "total_column_articles": 670, "frontend_question_id": "197", "is_new_question": false }, @@ -50853,9 +51084,9 @@ "question__title": "Delete Duplicate Emails", "question__title_slug": "delete-duplicate-emails", "question__hide": false, - "total_acs": 129909, - "total_submitted": 194191, - "total_column_articles": 517, + "total_acs": 132029, + "total_submitted": 197050, + "total_column_articles": 523, "frontend_question_id": "196", "is_new_question": false }, @@ -50874,9 +51105,9 @@ "question__title": "Tenth Line", "question__title_slug": "tenth-line", "question__hide": false, - "total_acs": 41943, - "total_submitted": 95527, - "total_column_articles": 162, + "total_acs": 42218, + "total_submitted": 96116, + "total_column_articles": 166, "frontend_question_id": "195", "is_new_question": false }, @@ -50895,9 +51126,9 @@ "question__title": "Transpose File", "question__title_slug": "transpose-file", "question__hide": false, - "total_acs": 12116, - "total_submitted": 34988, - "total_column_articles": 82, + "total_acs": 12226, + "total_submitted": 35278, + "total_column_articles": 85, "frontend_question_id": "194", "is_new_question": false }, @@ -50916,9 +51147,9 @@ "question__title": "Valid Phone Numbers", "question__title_slug": "valid-phone-numbers", "question__hide": false, - "total_acs": 30827, - "total_submitted": 93048, - "total_column_articles": 158, + "total_acs": 31085, + "total_submitted": 93752, + "total_column_articles": 162, "frontend_question_id": "193", "is_new_question": false }, @@ -50937,9 +51168,9 @@ "question__title": "Word Frequency", "question__title_slug": "word-frequency", "question__hide": false, - "total_acs": 25255, - "total_submitted": 70509, - "total_column_articles": 198, + "total_acs": 25427, + "total_submitted": 70910, + "total_column_articles": 201, "frontend_question_id": "192", "is_new_question": false }, @@ -50958,9 +51189,9 @@ "question__title": "Number of 1 Bits", "question__title_slug": "number-of-1-bits", "question__hide": false, - "total_acs": 246901, - "total_submitted": 326079, - "total_column_articles": 1571, + "total_acs": 249172, + "total_submitted": 328952, + "total_column_articles": 1581, "frontend_question_id": "191", "is_new_question": false }, @@ -50979,9 +51210,9 @@ "question__title": "Reverse Bits", "question__title_slug": "reverse-bits", "question__hide": false, - "total_acs": 165513, - "total_submitted": 233434, - "total_column_articles": 1046, + "total_acs": 166894, + "total_submitted": 235256, + "total_column_articles": 1054, "frontend_question_id": "190", "is_new_question": false }, @@ -51000,9 +51231,9 @@ "question__title": "Rotate Array", "question__title_slug": "rotate-array", "question__hide": false, - "total_acs": 484458, - "total_submitted": 1092605, - "total_column_articles": 2448, + "total_acs": 489590, + "total_submitted": 1104589, + "total_column_articles": 2470, "frontend_question_id": "189", "is_new_question": false }, @@ -51021,9 +51252,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": 120582, - "total_submitted": 293003, - "total_column_articles": 935, + "total_acs": 122563, + "total_submitted": 297113, + "total_column_articles": 951, "frontend_question_id": "188", "is_new_question": false }, @@ -51042,9 +51273,9 @@ "question__title": "Repeated DNA Sequences", "question__title_slug": "repeated-dna-sequences", "question__hide": false, - "total_acs": 97009, - "total_submitted": 184188, - "total_column_articles": 695, + "total_acs": 97985, + "total_submitted": 185927, + "total_column_articles": 705, "frontend_question_id": "187", "is_new_question": false }, @@ -51063,8 +51294,8 @@ "question__title": "Reverse Words in a String II", "question__title_slug": "reverse-words-in-a-string-ii", "question__hide": false, - "total_acs": 9840, - "total_submitted": 12911, + "total_acs": 9916, + "total_submitted": 13022, "total_column_articles": 151, "frontend_question_id": "186", "is_new_question": false @@ -51084,9 +51315,9 @@ "question__title": "Department Top Three Salaries", "question__title_slug": "department-top-three-salaries", "question__hide": false, - "total_acs": 88785, - "total_submitted": 173719, - "total_column_articles": 772, + "total_acs": 89432, + "total_submitted": 174753, + "total_column_articles": 779, "frontend_question_id": "185", "is_new_question": false }, @@ -51105,9 +51336,9 @@ "question__title": "Department Highest Salary", "question__title_slug": "department-highest-salary", "question__hide": false, - "total_acs": 127298, - "total_submitted": 258795, - "total_column_articles": 826, + "total_acs": 128289, + "total_submitted": 260477, + "total_column_articles": 831, "frontend_question_id": "184", "is_new_question": false }, @@ -51126,9 +51357,9 @@ "question__title": "Customers Who Never Order", "question__title_slug": "customers-who-never-order", "question__hide": false, - "total_acs": 195285, - "total_submitted": 290855, - "total_column_articles": 728, + "total_acs": 198688, + "total_submitted": 296136, + "total_column_articles": 743, "frontend_question_id": "183", "is_new_question": false }, @@ -51147,9 +51378,9 @@ "question__title": "Duplicate Emails", "question__title_slug": "duplicate-emails", "question__hide": false, - "total_acs": 222178, - "total_submitted": 280153, - "total_column_articles": 750, + "total_acs": 223912, + "total_submitted": 282305, + "total_column_articles": 760, "frontend_question_id": "182", "is_new_question": false }, @@ -51168,9 +51399,9 @@ "question__title": "Employees Earning More Than Their Managers", "question__title_slug": "employees-earning-more-than-their-managers", "question__hide": false, - "total_acs": 205152, - "total_submitted": 296266, - "total_column_articles": 843, + "total_acs": 206637, + "total_submitted": 298414, + "total_column_articles": 851, "frontend_question_id": "181", "is_new_question": false }, @@ -51189,9 +51420,9 @@ "question__title": "Consecutive Numbers", "question__title_slug": "consecutive-numbers", "question__hide": false, - "total_acs": 109130, - "total_submitted": 225847, - "total_column_articles": 650, + "total_acs": 109978, + "total_submitted": 227533, + "total_column_articles": 654, "frontend_question_id": "180", "is_new_question": false }, @@ -51210,9 +51441,9 @@ "question__title": "Largest Number", "question__title_slug": "largest-number", "question__hide": false, - "total_acs": 149809, - "total_submitted": 364531, - "total_column_articles": 1167, + "total_acs": 151899, + "total_submitted": 369364, + "total_column_articles": 1181, "frontend_question_id": "179", "is_new_question": false }, @@ -51231,9 +51462,9 @@ "question__title": "Rank Scores", "question__title_slug": "rank-scores", "question__hide": false, - "total_acs": 148150, - "total_submitted": 245145, - "total_column_articles": 800, + "total_acs": 149236, + "total_submitted": 246874, + "total_column_articles": 807, "frontend_question_id": "178", "is_new_question": false }, @@ -51252,9 +51483,9 @@ "question__title": "Nth Highest Salary", "question__title_slug": "nth-highest-salary", "question__hide": false, - "total_acs": 157547, - "total_submitted": 339252, - "total_column_articles": 626, + "total_acs": 158606, + "total_submitted": 341391, + "total_column_articles": 636, "frontend_question_id": "177", "is_new_question": false }, @@ -51273,9 +51504,9 @@ "question__title": "Second Highest Salary", "question__title_slug": "second-highest-salary", "question__hide": false, - "total_acs": 304869, - "total_submitted": 856180, - "total_column_articles": 1257, + "total_acs": 307397, + "total_submitted": 862480, + "total_column_articles": 1266, "frontend_question_id": "176", "is_new_question": false }, @@ -51294,9 +51525,9 @@ "question__title": "Combine Two Tables", "question__title_slug": "combine-two-tables", "question__hide": false, - "total_acs": 373824, - "total_submitted": 508508, - "total_column_articles": 1748, + "total_acs": 376575, + "total_submitted": 512040, + "total_column_articles": 1761, "frontend_question_id": "175", "is_new_question": false }, @@ -51315,9 +51546,9 @@ "question__title": "Dungeon Game", "question__title_slug": "dungeon-game", "question__hide": false, - "total_acs": 46666, - "total_submitted": 96663, - "total_column_articles": 792, + "total_acs": 47259, + "total_submitted": 97742, + "total_column_articles": 923, "frontend_question_id": "174", "is_new_question": false }, @@ -51336,9 +51567,9 @@ "question__title": "Binary Search Tree Iterator", "question__title_slug": "binary-search-tree-iterator", "question__hide": false, - "total_acs": 90622, - "total_submitted": 112020, - "total_column_articles": 752, + "total_acs": 91413, + "total_submitted": 112949, + "total_column_articles": 760, "frontend_question_id": "173", "is_new_question": false }, @@ -51357,9 +51588,9 @@ "question__title": "Factorial Trailing Zeroes", "question__title_slug": "factorial-trailing-zeroes", "question__hide": false, - "total_acs": 138870, - "total_submitted": 288173, - "total_column_articles": 941, + "total_acs": 139733, + "total_submitted": 289701, + "total_column_articles": 946, "frontend_question_id": "172", "is_new_question": false }, @@ -51378,9 +51609,9 @@ "question__title": "Excel Sheet Column Number", "question__title_slug": "excel-sheet-column-number", "question__hide": false, - "total_acs": 128361, - "total_submitted": 179176, - "total_column_articles": 1088, + "total_acs": 129342, + "total_submitted": 180596, + "total_column_articles": 1100, "frontend_question_id": "171", "is_new_question": false }, @@ -51399,8 +51630,8 @@ "question__title": "Two Sum III - Data structure design", "question__title_slug": "two-sum-iii-data-structure-design", "question__hide": false, - "total_acs": 12258, - "total_submitted": 28586, + "total_acs": 12383, + "total_submitted": 28914, "total_column_articles": 122, "frontend_question_id": "170", "is_new_question": false @@ -51420,9 +51651,9 @@ "question__title": "Majority Element", "question__title_slug": "majority-element", "question__hide": false, - "total_acs": 506999, - "total_submitted": 760247, - "total_column_articles": 2793, + "total_acs": 512215, + "total_submitted": 767815, + "total_column_articles": 2816, "frontend_question_id": "169", "is_new_question": false }, @@ -51441,9 +51672,9 @@ "question__title": "Excel Sheet Column Title", "question__title_slug": "excel-sheet-column-title", "question__hide": false, - "total_acs": 104348, - "total_submitted": 239581, - "total_column_articles": 907, + "total_acs": 105233, + "total_submitted": 241657, + "total_column_articles": 913, "frontend_question_id": "168", "is_new_question": false }, @@ -51462,9 +51693,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": 415293, - "total_submitted": 710043, - "total_column_articles": 2653, + "total_acs": 419848, + "total_submitted": 717589, + "total_column_articles": 2668, "frontend_question_id": "167", "is_new_question": false }, @@ -51483,9 +51714,9 @@ "question__title": "Fraction to Recurring Decimal", "question__title_slug": "fraction-to-recurring-decimal", "question__hide": false, - "total_acs": 49784, - "total_submitted": 149574, - "total_column_articles": 436, + "total_acs": 50219, + "total_submitted": 150878, + "total_column_articles": 438, "frontend_question_id": "166", "is_new_question": false }, @@ -51504,9 +51735,9 @@ "question__title": "Compare Version Numbers", "question__title_slug": "compare-version-numbers", "question__hide": false, - "total_acs": 108373, - "total_submitted": 208195, - "total_column_articles": 1067, + "total_acs": 109470, + "total_submitted": 210336, + "total_column_articles": 1074, "frontend_question_id": "165", "is_new_question": false }, @@ -51525,9 +51756,9 @@ "question__title": "Maximum Gap", "question__title_slug": "maximum-gap", "question__hide": false, - "total_acs": 69203, - "total_submitted": 113843, - "total_column_articles": 567, + "total_acs": 69624, + "total_submitted": 114599, + "total_column_articles": 568, "frontend_question_id": "164", "is_new_question": false }, @@ -51546,9 +51777,9 @@ "question__title": "Missing Ranges", "question__title_slug": "missing-ranges", "question__hide": false, - "total_acs": 13082, - "total_submitted": 37993, - "total_column_articles": 199, + "total_acs": 13232, + "total_submitted": 38371, + "total_column_articles": 200, "frontend_question_id": "163", "is_new_question": false }, @@ -51567,9 +51798,9 @@ "question__title": "Find Peak Element", "question__title_slug": "find-peak-element", "question__hide": false, - "total_acs": 217563, - "total_submitted": 439884, - "total_column_articles": 1444, + "total_acs": 220499, + "total_submitted": 445742, + "total_column_articles": 1461, "frontend_question_id": "162", "is_new_question": false }, @@ -51588,8 +51819,8 @@ "question__title": "One Edit Distance", "question__title_slug": "one-edit-distance", "question__hide": false, - "total_acs": 9900, - "total_submitted": 29214, + "total_acs": 9973, + "total_submitted": 29418, "total_column_articles": 130, "frontend_question_id": "161", "is_new_question": false @@ -51609,9 +51840,9 @@ "question__title": "Intersection of Two Linked Lists", "question__title_slug": "intersection-of-two-linked-lists", "question__hide": false, - "total_acs": 459988, - "total_submitted": 734219, - "total_column_articles": 2716, + "total_acs": 465981, + "total_submitted": 743225, + "total_column_articles": 2745, "frontend_question_id": "160", "is_new_question": false }, @@ -51630,9 +51861,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": 22123, - "total_submitted": 39922, - "total_column_articles": 257, + "total_acs": 22411, + "total_submitted": 40448, + "total_column_articles": 261, "frontend_question_id": "159", "is_new_question": false }, @@ -51651,8 +51882,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": 3772, - "total_submitted": 6316, + "total_acs": 3794, + "total_submitted": 6345, "total_column_articles": 83, "frontend_question_id": "158", "is_new_question": false @@ -51672,8 +51903,8 @@ "question__title": "Read N Characters Given Read4", "question__title_slug": "read-n-characters-given-read4", "question__hide": false, - "total_acs": 7452, - "total_submitted": 13765, + "total_acs": 7521, + "total_submitted": 13893, "total_column_articles": 106, "frontend_question_id": "157", "is_new_question": false @@ -51693,8 +51924,8 @@ "question__title": "Binary Tree Upside Down", "question__title_slug": "binary-tree-upside-down", "question__hide": false, - "total_acs": 9323, - "total_submitted": 12916, + "total_acs": 9446, + "total_submitted": 13068, "total_column_articles": 173, "frontend_question_id": "156", "is_new_question": false @@ -51714,9 +51945,9 @@ "question__title": "Min Stack", "question__title_slug": "min-stack", "question__hide": false, - "total_acs": 369300, - "total_submitted": 636375, - "total_column_articles": 2025, + "total_acs": 372897, + "total_submitted": 642080, + "total_column_articles": 2047, "frontend_question_id": "155", "is_new_question": false }, @@ -51735,9 +51966,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": 137554, - "total_submitted": 259590, - "total_column_articles": 1059, + "total_acs": 138679, + "total_submitted": 261639, + "total_column_articles": 1071, "frontend_question_id": "154", "is_new_question": false }, @@ -51756,9 +51987,9 @@ "question__title": "Find Minimum in Rotated Sorted Array", "question__title_slug": "find-minimum-in-rotated-sorted-array", "question__hide": false, - "total_acs": 277396, - "total_submitted": 487638, - "total_column_articles": 1896, + "total_acs": 280323, + "total_submitted": 492748, + "total_column_articles": 1916, "frontend_question_id": "153", "is_new_question": false }, @@ -51777,9 +52008,9 @@ "question__title": "Maximum Product Subarray", "question__title_slug": "maximum-product-subarray", "question__hide": false, - "total_acs": 255657, - "total_submitted": 601613, - "total_column_articles": 1634, + "total_acs": 258886, + "total_submitted": 608805, + "total_column_articles": 1649, "frontend_question_id": "152", "is_new_question": false }, @@ -51798,9 +52029,9 @@ "question__title": "Reverse Words in a String", "question__title_slug": "reverse-words-in-a-string", "question__hide": false, - "total_acs": 241681, - "total_submitted": 481883, - "total_column_articles": 1930, + "total_acs": 245365, + "total_submitted": 488705, + "total_column_articles": 1965, "frontend_question_id": "151", "is_new_question": false }, @@ -51819,9 +52050,9 @@ "question__title": "Evaluate Reverse Polish Notation", "question__title_slug": "evaluate-reverse-polish-notation", "question__hide": false, - "total_acs": 179293, - "total_submitted": 334262, - "total_column_articles": 1395, + "total_acs": 181728, + "total_submitted": 338752, + "total_column_articles": 1415, "frontend_question_id": "150", "is_new_question": false }, @@ -51840,9 +52071,9 @@ "question__title": "Max Points on a Line", "question__title_slug": "max-points-on-a-line", "question__hide": false, - "total_acs": 59214, - "total_submitted": 161968, - "total_column_articles": 627, + "total_acs": 59995, + "total_submitted": 163408, + "total_column_articles": 630, "frontend_question_id": "149", "is_new_question": false }, @@ -51861,9 +52092,9 @@ "question__title": "Sort List", "question__title_slug": "sort-list", "question__hide": false, - "total_acs": 282957, - "total_submitted": 425591, - "total_column_articles": 1646, + "total_acs": 286954, + "total_submitted": 431774, + "total_column_articles": 1666, "frontend_question_id": "148", "is_new_question": false }, @@ -51882,9 +52113,9 @@ "question__title": "Insertion Sort List", "question__title_slug": "insertion-sort-list", "question__hide": false, - "total_acs": 119263, - "total_submitted": 173529, - "total_column_articles": 910, + "total_acs": 120154, + "total_submitted": 174756, + "total_column_articles": 919, "frontend_question_id": "147", "is_new_question": false }, @@ -51903,9 +52134,9 @@ "question__title": "LRU Cache", "question__title_slug": "lru-cache", "question__hide": false, - "total_acs": 335461, - "total_submitted": 636285, - "total_column_articles": 2312, + "total_acs": 339762, + "total_submitted": 644598, + "total_column_articles": 2348, "frontend_question_id": "146", "is_new_question": false }, @@ -51924,9 +52155,9 @@ "question__title": "Binary Tree Postorder Traversal", "question__title_slug": "binary-tree-postorder-traversal", "question__hide": false, - "total_acs": 423555, - "total_submitted": 559535, - "total_column_articles": 2035, + "total_acs": 429306, + "total_submitted": 566858, + "total_column_articles": 2057, "frontend_question_id": "145", "is_new_question": false }, @@ -51945,9 +52176,9 @@ "question__title": "Binary Tree Preorder Traversal", "question__title_slug": "binary-tree-preorder-traversal", "question__hide": false, - "total_acs": 579785, - "total_submitted": 816848, - "total_column_articles": 2497, + "total_acs": 587622, + "total_submitted": 827681, + "total_column_articles": 2530, "frontend_question_id": "144", "is_new_question": false }, @@ -51966,9 +52197,9 @@ "question__title": "Reorder List", "question__title_slug": "reorder-list", "question__hide": false, - "total_acs": 173315, - "total_submitted": 272672, - "total_column_articles": 1386, + "total_acs": 175506, + "total_submitted": 275825, + "total_column_articles": 1406, "frontend_question_id": "143", "is_new_question": false }, @@ -51987,9 +52218,9 @@ "question__title": "Linked List Cycle II", "question__title_slug": "linked-list-cycle-ii", "question__hide": false, - "total_acs": 429187, - "total_submitted": 766621, - "total_column_articles": 2521, + "total_acs": 435773, + "total_submitted": 778086, + "total_column_articles": 2566, "frontend_question_id": "142", "is_new_question": false }, @@ -52008,9 +52239,9 @@ "question__title": "Linked List Cycle", "question__title_slug": "linked-list-cycle", "question__hide": false, - "total_acs": 715478, - "total_submitted": 1392242, - "total_column_articles": 3674, + "total_acs": 723618, + "total_submitted": 1407986, + "total_column_articles": 3716, "frontend_question_id": "141", "is_new_question": false }, @@ -52029,9 +52260,9 @@ "question__title": "Word Break II", "question__title_slug": "word-break-ii", "question__hide": false, - "total_acs": 65763, - "total_submitted": 125378, - "total_column_articles": 723, + "total_acs": 66292, + "total_submitted": 126088, + "total_column_articles": 731, "frontend_question_id": "140", "is_new_question": false }, @@ -52050,9 +52281,9 @@ "question__title": "Word Break", "question__title_slug": "word-break", "question__hide": false, - "total_acs": 284228, - "total_submitted": 537248, - "total_column_articles": 1710, + "total_acs": 288660, + "total_submitted": 544956, + "total_column_articles": 1734, "frontend_question_id": "139", "is_new_question": false }, @@ -52071,9 +52302,9 @@ "question__title": "Copy List with Random Pointer", "question__title_slug": "copy-list-with-random-pointer", "question__hide": false, - "total_acs": 145092, - "total_submitted": 216808, - "total_column_articles": 1063, + "total_acs": 146628, + "total_submitted": 219070, + "total_column_articles": 1078, "frontend_question_id": "138", "is_new_question": false }, @@ -52092,9 +52323,9 @@ "question__title": "Single Number II", "question__title_slug": "single-number-ii", "question__hide": false, - "total_acs": 120590, - "total_submitted": 167374, - "total_column_articles": 897, + "total_acs": 121472, + "total_submitted": 168597, + "total_column_articles": 905, "frontend_question_id": "137", "is_new_question": false }, @@ -52113,9 +52344,9 @@ "question__title": "Single Number", "question__title_slug": "single-number", "question__hide": false, - "total_acs": 667123, - "total_submitted": 924893, - "total_column_articles": 3029, + "total_acs": 673995, + "total_submitted": 934250, + "total_column_articles": 3069, "frontend_question_id": "136", "is_new_question": false }, @@ -52134,9 +52365,9 @@ "question__title": "Candy", "question__title_slug": "candy", "question__hide": false, - "total_acs": 138135, - "total_submitted": 282331, - "total_column_articles": 1063, + "total_acs": 140254, + "total_submitted": 286443, + "total_column_articles": 1082, "frontend_question_id": "135", "is_new_question": false }, @@ -52155,9 +52386,9 @@ "question__title": "Gas Station", "question__title_slug": "gas-station", "question__hide": false, - "total_acs": 168490, - "total_submitted": 309685, - "total_column_articles": 1228, + "total_acs": 170709, + "total_submitted": 314624, + "total_column_articles": 1238, "frontend_question_id": "134", "is_new_question": false }, @@ -52176,9 +52407,9 @@ "question__title": "Clone Graph", "question__title_slug": "clone-graph", "question__hide": false, - "total_acs": 89173, - "total_submitted": 130787, - "total_column_articles": 629, + "total_acs": 89929, + "total_submitted": 131805, + "total_column_articles": 638, "frontend_question_id": "133", "is_new_question": false }, @@ -52197,9 +52428,9 @@ "question__title": "Palindrome Partitioning II", "question__title_slug": "palindrome-partitioning-ii", "question__hide": false, - "total_acs": 58166, - "total_submitted": 117638, - "total_column_articles": 509, + "total_acs": 58569, + "total_submitted": 118504, + "total_column_articles": 512, "frontend_question_id": "132", "is_new_question": false }, @@ -52218,9 +52449,9 @@ "question__title": "Palindrome Partitioning", "question__title_slug": "palindrome-partitioning", "question__hide": false, - "total_acs": 185868, - "total_submitted": 255426, - "total_column_articles": 1203, + "total_acs": 188798, + "total_submitted": 259245, + "total_column_articles": 1218, "frontend_question_id": "131", "is_new_question": false }, @@ -52239,9 +52470,9 @@ "question__title": "Surrounded Regions", "question__title_slug": "surrounded-regions", "question__hide": false, - "total_acs": 169613, - "total_submitted": 373086, - "total_column_articles": 1515, + "total_acs": 171462, + "total_submitted": 376913, + "total_column_articles": 1535, "frontend_question_id": "130", "is_new_question": false }, @@ -52260,9 +52491,9 @@ "question__title": "Sum Root to Leaf Numbers", "question__title_slug": "sum-root-to-leaf-numbers", "question__hide": false, - "total_acs": 156351, - "total_submitted": 225926, - "total_column_articles": 1411, + "total_acs": 158049, + "total_submitted": 228220, + "total_column_articles": 1425, "frontend_question_id": "129", "is_new_question": false }, @@ -52281,9 +52512,9 @@ "question__title": "Longest Consecutive Sequence", "question__title_slug": "longest-consecutive-sequence", "question__hide": false, - "total_acs": 252338, - "total_submitted": 460077, - "total_column_articles": 1632, + "total_acs": 256211, + "total_submitted": 467124, + "total_column_articles": 1661, "frontend_question_id": "128", "is_new_question": false }, @@ -52302,9 +52533,9 @@ "question__title": "Word Ladder", "question__title_slug": "word-ladder", "question__hide": false, - "total_acs": 145749, - "total_submitted": 307179, - "total_column_articles": 783, + "total_acs": 146814, + "total_submitted": 309213, + "total_column_articles": 794, "frontend_question_id": "127", "is_new_question": false }, @@ -52323,9 +52554,9 @@ "question__title": "Word Ladder II", "question__title_slug": "word-ladder-ii", "question__hide": false, - "total_acs": 44530, - "total_submitted": 110039, - "total_column_articles": 408, + "total_acs": 44840, + "total_submitted": 110726, + "total_column_articles": 411, "frontend_question_id": "126", "is_new_question": false }, @@ -52344,9 +52575,9 @@ "question__title": "Valid Palindrome", "question__title_slug": "valid-palindrome", "question__hide": false, - "total_acs": 351312, - "total_submitted": 748680, - "total_column_articles": 2253, + "total_acs": 354357, + "total_submitted": 755421, + "total_column_articles": 2270, "frontend_question_id": "125", "is_new_question": false }, @@ -52365,9 +52596,9 @@ "question__title": "Binary Tree Maximum Path Sum", "question__title_slug": "binary-tree-maximum-path-sum", "question__hide": false, - "total_acs": 222839, - "total_submitted": 495680, - "total_column_articles": 1459, + "total_acs": 225628, + "total_submitted": 501862, + "total_column_articles": 1475, "frontend_question_id": "124", "is_new_question": false }, @@ -52386,9 +52617,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": 172843, - "total_submitted": 310414, - "total_column_articles": 1072, + "total_acs": 175475, + "total_submitted": 314402, + "total_column_articles": 1089, "frontend_question_id": "123", "is_new_question": false }, @@ -52407,9 +52638,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": 618198, - "total_submitted": 880881, - "total_column_articles": 3438, + "total_acs": 625986, + "total_submitted": 891299, + "total_column_articles": 3478, "frontend_question_id": "122", "is_new_question": false }, @@ -52428,9 +52659,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": 765795, - "total_submitted": 1326994, - "total_column_articles": 4541, + "total_acs": 775142, + "total_submitted": 1342347, + "total_column_articles": 4593, "frontend_question_id": "121", "is_new_question": false }, @@ -52449,9 +52680,9 @@ "question__title": "Triangle", "question__title_slug": "triangle", "question__hide": false, - "total_acs": 227743, - "total_submitted": 332231, - "total_column_articles": 1977, + "total_acs": 229934, + "total_submitted": 335417, + "total_column_articles": 1988, "frontend_question_id": "120", "is_new_question": false }, @@ -52470,9 +52701,9 @@ "question__title": "Pascal's Triangle II", "question__title_slug": "pascals-triangle-ii", "question__hide": false, - "total_acs": 195862, - "total_submitted": 287216, - "total_column_articles": 1580, + "total_acs": 197927, + "total_submitted": 290065, + "total_column_articles": 1595, "frontend_question_id": "119", "is_new_question": false }, @@ -52491,9 +52722,9 @@ "question__title": "Pascal's Triangle", "question__title_slug": "pascals-triangle", "question__hide": false, - "total_acs": 295235, - "total_submitted": 395500, - "total_column_articles": 2345, + "total_acs": 298471, + "total_submitted": 399483, + "total_column_articles": 2383, "frontend_question_id": "118", "is_new_question": false }, @@ -52512,9 +52743,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": 128674, - "total_submitted": 202013, - "total_column_articles": 1049, + "total_acs": 130634, + "total_submitted": 204780, + "total_column_articles": 1058, "frontend_question_id": "117", "is_new_question": false }, @@ -52533,9 +52764,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": 239562, - "total_submitted": 335262, - "total_column_articles": 1925, + "total_acs": 243058, + "total_submitted": 339893, + "total_column_articles": 1942, "frontend_question_id": "116", "is_new_question": false }, @@ -52554,9 +52785,9 @@ "question__title": "Distinct Subsequences", "question__title_slug": "distinct-subsequences", "question__hide": false, - "total_acs": 83898, - "total_submitted": 161840, - "total_column_articles": 868, + "total_acs": 85265, + "total_submitted": 164633, + "total_column_articles": 878, "frontend_question_id": "115", "is_new_question": false }, @@ -52575,9 +52806,9 @@ "question__title": "Flatten Binary Tree to Linked List", "question__title_slug": "flatten-binary-tree-to-linked-list", "question__hide": false, - "total_acs": 248025, - "total_submitted": 340736, - "total_column_articles": 1984, + "total_acs": 251359, + "total_submitted": 345328, + "total_column_articles": 2006, "frontend_question_id": "114", "is_new_question": false }, @@ -52596,9 +52827,9 @@ "question__title": "Path Sum II", "question__title_slug": "path-sum-ii", "question__hide": false, - "total_acs": 244277, - "total_submitted": 387051, - "total_column_articles": 1682, + "total_acs": 247720, + "total_submitted": 392461, + "total_column_articles": 1713, "frontend_question_id": "113", "is_new_question": false }, @@ -52617,9 +52848,9 @@ "question__title": "Path Sum", "question__title_slug": "path-sum", "question__hide": false, - "total_acs": 373939, - "total_submitted": 703450, - "total_column_articles": 2286, + "total_acs": 378804, + "total_submitted": 712239, + "total_column_articles": 2317, "frontend_question_id": "112", "is_new_question": false }, @@ -52638,9 +52869,9 @@ "question__title": "Minimum Depth of Binary Tree", "question__title_slug": "minimum-depth-of-binary-tree", "question__hide": false, - "total_acs": 376611, - "total_submitted": 751017, - "total_column_articles": 2741, + "total_acs": 382002, + "total_submitted": 760793, + "total_column_articles": 2777, "frontend_question_id": "111", "is_new_question": false }, @@ -52659,9 +52890,9 @@ "question__title": "Balanced Binary Tree", "question__title_slug": "balanced-binary-tree", "question__hide": false, - "total_acs": 346374, - "total_submitted": 608775, - "total_column_articles": 1912, + "total_acs": 350796, + "total_submitted": 616193, + "total_column_articles": 1938, "frontend_question_id": "110", "is_new_question": false }, @@ -52680,9 +52911,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": 114849, - "total_submitted": 150644, - "total_column_articles": 898, + "total_acs": 115877, + "total_submitted": 152000, + "total_column_articles": 909, "frontend_question_id": "109", "is_new_question": false }, @@ -52701,9 +52932,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": 251847, - "total_submitted": 328502, - "total_column_articles": 1546, + "total_acs": 254873, + "total_submitted": 332300, + "total_column_articles": 1560, "frontend_question_id": "108", "is_new_question": false }, @@ -52722,9 +52953,9 @@ "question__title": "Binary Tree Level Order Traversal II", "question__title_slug": "binary-tree-level-order-traversal-ii", "question__hide": false, - "total_acs": 204517, - "total_submitted": 287605, - "total_column_articles": 1606, + "total_acs": 206703, + "total_submitted": 290448, + "total_column_articles": 1612, "frontend_question_id": "107", "is_new_question": false }, @@ -52743,9 +52974,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": 187031, - "total_submitted": 258482, - "total_column_articles": 1219, + "total_acs": 189727, + "total_submitted": 262159, + "total_column_articles": 1231, "frontend_question_id": "106", "is_new_question": false }, @@ -52764,9 +52995,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": 344536, - "total_submitted": 485011, - "total_column_articles": 1954, + "total_acs": 348968, + "total_submitted": 491314, + "total_column_articles": 1974, "frontend_question_id": "105", "is_new_question": false }, @@ -52785,9 +53016,9 @@ "question__title": "Maximum Depth of Binary Tree", "question__title_slug": "maximum-depth-of-binary-tree", "question__hide": false, - "total_acs": 703066, - "total_submitted": 913913, - "total_column_articles": 3411, + "total_acs": 711843, + "total_submitted": 925174, + "total_column_articles": 3442, "frontend_question_id": "104", "is_new_question": false }, @@ -52806,9 +53037,9 @@ "question__title": "Binary Tree Zigzag Level Order Traversal", "question__title_slug": "binary-tree-zigzag-level-order-traversal", "question__hide": false, - "total_acs": 228553, - "total_submitted": 398925, - "total_column_articles": 1991, + "total_acs": 231144, + "total_submitted": 403394, + "total_column_articles": 2006, "frontend_question_id": "103", "is_new_question": false }, @@ -52827,9 +53058,9 @@ "question__title": "Binary Tree Level Order Traversal", "question__title_slug": "binary-tree-level-order-traversal", "question__hide": false, - "total_acs": 551988, - "total_submitted": 853611, - "total_column_articles": 3352, + "total_acs": 559423, + "total_submitted": 864632, + "total_column_articles": 3377, "frontend_question_id": "102", "is_new_question": false }, @@ -52848,9 +53079,9 @@ "question__title": "Symmetric Tree", "question__title_slug": "symmetric-tree", "question__hide": false, - "total_acs": 571025, - "total_submitted": 992543, - "total_column_articles": 3082, + "total_acs": 578929, + "total_submitted": 1005260, + "total_column_articles": 3117, "frontend_question_id": "101", "is_new_question": false }, @@ -52869,9 +53100,9 @@ "question__title": "Same Tree", "question__title_slug": "same-tree", "question__hide": false, - "total_acs": 329424, - "total_submitted": 551542, - "total_column_articles": 2412, + "total_acs": 333018, + "total_submitted": 557534, + "total_column_articles": 2428, "frontend_question_id": "100", "is_new_question": false }, @@ -52890,9 +53121,9 @@ "question__title": "Recover Binary Search Tree", "question__title_slug": "recover-binary-search-tree", "question__hide": false, - "total_acs": 98040, - "total_submitted": 162120, - "total_column_articles": 796, + "total_acs": 99286, + "total_submitted": 164321, + "total_column_articles": 804, "frontend_question_id": "99", "is_new_question": false }, @@ -52911,9 +53142,9 @@ "question__title": "Validate Binary Search Tree", "question__title_slug": "validate-binary-search-tree", "question__hide": false, - "total_acs": 489054, - "total_submitted": 1361145, - "total_column_articles": 2748, + "total_acs": 495982, + "total_submitted": 1378912, + "total_column_articles": 2786, "frontend_question_id": "98", "is_new_question": false }, @@ -52932,9 +53163,9 @@ "question__title": "Interleaving String", "question__title_slug": "interleaving-string", "question__hide": false, - "total_acs": 81651, - "total_submitted": 180764, - "total_column_articles": 675, + "total_acs": 82648, + "total_submitted": 183172, + "total_column_articles": 684, "frontend_question_id": "97", "is_new_question": false }, @@ -52953,9 +53184,9 @@ "question__title": "Unique Binary Search Trees", "question__title_slug": "unique-binary-search-trees", "question__hide": false, - "total_acs": 236381, - "total_submitted": 336876, - "total_column_articles": 1781, + "total_acs": 240103, + "total_submitted": 342085, + "total_column_articles": 1809, "frontend_question_id": "96", "is_new_question": false }, @@ -52974,9 +53205,9 @@ "question__title": "Unique Binary Search Trees II", "question__title_slug": "unique-binary-search-trees-ii", "question__hide": false, - "total_acs": 128071, - "total_submitted": 178393, - "total_column_articles": 795, + "total_acs": 129353, + "total_submitted": 179985, + "total_column_articles": 805, "frontend_question_id": "95", "is_new_question": false }, @@ -52995,9 +53226,9 @@ "question__title": "Binary Tree Inorder Traversal", "question__title_slug": "binary-tree-inorder-traversal", "question__hide": false, - "total_acs": 793093, - "total_submitted": 1046555, - "total_column_articles": 3133, + "total_acs": 803843, + "total_submitted": 1060301, + "total_column_articles": 3171, "frontend_question_id": "94", "is_new_question": false }, @@ -53016,9 +53247,9 @@ "question__title": "Restore IP Addresses", "question__title_slug": "restore-ip-addresses", "question__hide": false, - "total_acs": 215705, - "total_submitted": 385133, - "total_column_articles": 1777, + "total_acs": 219337, + "total_submitted": 390753, + "total_column_articles": 1802, "frontend_question_id": "93", "is_new_question": false }, @@ -53037,9 +53268,9 @@ "question__title": "Reverse Linked List II", "question__title_slug": "reverse-linked-list-ii", "question__hide": false, - "total_acs": 285346, - "total_submitted": 515993, - "total_column_articles": 2738, + "total_acs": 288737, + "total_submitted": 521899, + "total_column_articles": 2764, "frontend_question_id": "92", "is_new_question": false }, @@ -53058,9 +53289,9 @@ "question__title": "Decode Ways", "question__title_slug": "decode-ways", "question__hide": false, - "total_acs": 208400, - "total_submitted": 650546, - "total_column_articles": 1850, + "total_acs": 210322, + "total_submitted": 655710, + "total_column_articles": 1862, "frontend_question_id": "91", "is_new_question": false }, @@ -53079,9 +53310,9 @@ "question__title": "Subsets II", "question__title_slug": "subsets-ii", "question__hide": false, - "total_acs": 193616, - "total_submitted": 305114, - "total_column_articles": 1646, + "total_acs": 196677, + "total_submitted": 309901, + "total_column_articles": 1669, "frontend_question_id": "90", "is_new_question": false }, @@ -53100,9 +53331,9 @@ "question__title": "Gray Code", "question__title_slug": "gray-code", "question__hide": false, - "total_acs": 93364, - "total_submitted": 125188, - "total_column_articles": 773, + "total_acs": 94072, + "total_submitted": 126134, + "total_column_articles": 777, "frontend_question_id": "89", "is_new_question": false }, @@ -53121,9 +53352,9 @@ "question__title": "Merge Sorted Array", "question__title_slug": "merge-sorted-array", "question__hide": false, - "total_acs": 640232, - "total_submitted": 1225649, - "total_column_articles": 4356, + "total_acs": 647468, + "total_submitted": 1239113, + "total_column_articles": 4410, "frontend_question_id": "88", "is_new_question": false }, @@ -53142,9 +53373,9 @@ "question__title": "Scramble String", "question__title_slug": "scramble-string", "question__hide": false, - "total_acs": 47345, - "total_submitted": 98271, - "total_column_articles": 364, + "total_acs": 47579, + "total_submitted": 98842, + "total_column_articles": 368, "frontend_question_id": "87", "is_new_question": false }, @@ -53163,9 +53394,9 @@ "question__title": "Partition List", "question__title_slug": "partition-list", "question__hide": false, - "total_acs": 147237, - "total_submitted": 232890, - "total_column_articles": 1361, + "total_acs": 148556, + "total_submitted": 234996, + "total_column_articles": 1372, "frontend_question_id": "86", "is_new_question": false }, @@ -53184,9 +53415,9 @@ "question__title": "Maximal Rectangle", "question__title_slug": "maximal-rectangle", "question__hide": false, - "total_acs": 125530, - "total_submitted": 237871, - "total_column_articles": 901, + "total_acs": 126848, + "total_submitted": 240083, + "total_column_articles": 914, "frontend_question_id": "85", "is_new_question": false }, @@ -53205,9 +53436,9 @@ "question__title": "Largest Rectangle in Histogram", "question__title_slug": "largest-rectangle-in-histogram", "question__hide": false, - "total_acs": 240266, - "total_submitted": 545258, - "total_column_articles": 1475, + "total_acs": 243201, + "total_submitted": 551313, + "total_column_articles": 1496, "frontend_question_id": "84", "is_new_question": false }, @@ -53226,9 +53457,9 @@ "question__title": "Remove Duplicates from Sorted List", "question__title_slug": "remove-duplicates-from-sorted-list", "question__hide": false, - "total_acs": 417006, - "total_submitted": 778427, - "total_column_articles": 2573, + "total_acs": 421491, + "total_submitted": 786926, + "total_column_articles": 2603, "frontend_question_id": "83", "is_new_question": false }, @@ -53247,9 +53478,9 @@ "question__title": "Remove Duplicates from Sorted List II", "question__title_slug": "remove-duplicates-from-sorted-list-ii", "question__hide": false, - "total_acs": 247618, - "total_submitted": 464884, - "total_column_articles": 2176, + "total_acs": 250739, + "total_submitted": 470625, + "total_column_articles": 2194, "frontend_question_id": "82", "is_new_question": false }, @@ -53268,9 +53499,9 @@ "question__title": "Search in Rotated Sorted Array II", "question__title_slug": "search-in-rotated-sorted-array-ii", "question__hide": false, - "total_acs": 153302, - "total_submitted": 370461, - "total_column_articles": 1191, + "total_acs": 154716, + "total_submitted": 374096, + "total_column_articles": 1203, "frontend_question_id": "81", "is_new_question": false }, @@ -53289,9 +53520,9 @@ "question__title": "Remove Duplicates from Sorted Array II", "question__title_slug": "remove-duplicates-from-sorted-array-ii", "question__hide": false, - "total_acs": 177110, - "total_submitted": 285667, - "total_column_articles": 1550, + "total_acs": 178493, + "total_submitted": 287946, + "total_column_articles": 1562, "frontend_question_id": "80", "is_new_question": false }, @@ -53310,9 +53541,9 @@ "question__title": "Word Search", "question__title_slug": "word-search", "question__hide": false, - "total_acs": 303885, - "total_submitted": 657477, - "total_column_articles": 1890, + "total_acs": 307786, + "total_submitted": 665611, + "total_column_articles": 1918, "frontend_question_id": "79", "is_new_question": false }, @@ -53331,9 +53562,9 @@ "question__title": "Subsets", "question__title_slug": "subsets", "question__hide": false, - "total_acs": 429054, - "total_submitted": 533238, - "total_column_articles": 3138, + "total_acs": 434989, + "total_submitted": 540435, + "total_column_articles": 3188, "frontend_question_id": "78", "is_new_question": false }, @@ -53352,9 +53583,9 @@ "question__title": "Combinations", "question__title_slug": "combinations", "question__hide": false, - "total_acs": 334436, - "total_submitted": 434223, - "total_column_articles": 2002, + "total_acs": 340308, + "total_submitted": 441748, + "total_column_articles": 2029, "frontend_question_id": "77", "is_new_question": false }, @@ -53373,9 +53604,9 @@ "question__title": "Minimum Window Substring", "question__title_slug": "minimum-window-substring", "question__hide": false, - "total_acs": 272876, - "total_submitted": 620647, - "total_column_articles": 2150, + "total_acs": 276953, + "total_submitted": 629625, + "total_column_articles": 2181, "frontend_question_id": "76", "is_new_question": false }, @@ -53394,9 +53625,9 @@ "question__title": "Sort Colors", "question__title_slug": "sort-colors", "question__hide": false, - "total_acs": 369222, - "total_submitted": 614592, - "total_column_articles": 2535, + "total_acs": 373929, + "total_submitted": 622344, + "total_column_articles": 2578, "frontend_question_id": "75", "is_new_question": false }, @@ -53415,9 +53646,9 @@ "question__title": "Search a 2D Matrix", "question__title_slug": "search-a-2d-matrix", "question__hide": false, - "total_acs": 225736, - "total_submitted": 477332, - "total_column_articles": 2261, + "total_acs": 228544, + "total_submitted": 482746, + "total_column_articles": 2282, "frontend_question_id": "74", "is_new_question": false }, @@ -53436,9 +53667,9 @@ "question__title": "Set Matrix Zeroes", "question__title_slug": "set-matrix-zeroes", "question__hide": false, - "total_acs": 180117, - "total_submitted": 291956, - "total_column_articles": 1334, + "total_acs": 182116, + "total_submitted": 295005, + "total_column_articles": 1350, "frontend_question_id": "73", "is_new_question": false }, @@ -53457,9 +53688,9 @@ "question__title": "Edit Distance", "question__title_slug": "edit-distance", "question__hide": false, - "total_acs": 245527, - "total_submitted": 395111, - "total_column_articles": 1994, + "total_acs": 249023, + "total_submitted": 400511, + "total_column_articles": 2116, "frontend_question_id": "72", "is_new_question": false }, @@ -53478,9 +53709,9 @@ "question__title": "Simplify Path", "question__title_slug": "simplify-path", "question__hide": false, - "total_acs": 143163, - "total_submitted": 323879, - "total_column_articles": 1375, + "total_acs": 144249, + "total_submitted": 326309, + "total_column_articles": 1383, "frontend_question_id": "71", "is_new_question": false }, @@ -53499,9 +53730,9 @@ "question__title": "Climbing Stairs", "question__title_slug": "climbing-stairs", "question__hide": false, - "total_acs": 802542, - "total_submitted": 1497041, - "total_column_articles": 4721, + "total_acs": 811776, + "total_submitted": 1513633, + "total_column_articles": 4767, "frontend_question_id": "70", "is_new_question": false }, @@ -53520,9 +53751,9 @@ "question__title": "Sqrt(x)", "question__title_slug": "sqrtx", "question__hide": false, - "total_acs": 519750, - "total_submitted": 1337745, - "total_column_articles": 2598, + "total_acs": 526120, + "total_submitted": 1354236, + "total_column_articles": 2635, "frontend_question_id": "69", "is_new_question": false }, @@ -53541,9 +53772,9 @@ "question__title": "Text Justification", "question__title_slug": "text-justification", "question__hide": false, - "total_acs": 43675, - "total_submitted": 83776, - "total_column_articles": 661, + "total_acs": 43920, + "total_submitted": 84245, + "total_column_articles": 664, "frontend_question_id": "68", "is_new_question": false }, @@ -53562,9 +53793,9 @@ "question__title": "Add Binary", "question__title_slug": "add-binary", "question__hide": false, - "total_acs": 242377, - "total_submitted": 449772, - "total_column_articles": 2199, + "total_acs": 244350, + "total_submitted": 453673, + "total_column_articles": 2217, "frontend_question_id": "67", "is_new_question": false }, @@ -53583,9 +53814,9 @@ "question__title": "Plus One", "question__title_slug": "plus-one", "question__hide": false, - "total_acs": 478037, - "total_submitted": 1040648, - "total_column_articles": 4284, + "total_acs": 482172, + "total_submitted": 1050225, + "total_column_articles": 4324, "frontend_question_id": "66", "is_new_question": false }, @@ -53604,9 +53835,9 @@ "question__title": "Valid Number", "question__title_slug": "valid-number", "question__hide": false, - "total_acs": 53656, - "total_submitted": 196242, - "total_column_articles": 749, + "total_acs": 53970, + "total_submitted": 197322, + "total_column_articles": 753, "frontend_question_id": "65", "is_new_question": false }, @@ -53625,9 +53856,9 @@ "question__title": "Minimum Path Sum", "question__title_slug": "minimum-path-sum", "question__hide": false, - "total_acs": 353979, - "total_submitted": 511775, - "total_column_articles": 2616, + "total_acs": 357757, + "total_submitted": 517116, + "total_column_articles": 2638, "frontend_question_id": "64", "is_new_question": false }, @@ -53646,9 +53877,9 @@ "question__title": "Unique Paths II", "question__title_slug": "unique-paths-ii", "question__hide": false, - "total_acs": 248353, - "total_submitted": 619852, - "total_column_articles": 2226, + "total_acs": 251543, + "total_submitted": 627190, + "total_column_articles": 2245, "frontend_question_id": "63", "is_new_question": false }, @@ -53667,9 +53898,9 @@ "question__title": "Unique Paths", "question__title_slug": "unique-paths", "question__hide": false, - "total_acs": 423919, - "total_submitted": 633058, - "total_column_articles": 3126, + "total_acs": 429107, + "total_submitted": 640710, + "total_column_articles": 3155, "frontend_question_id": "62", "is_new_question": false }, @@ -53688,9 +53919,9 @@ "question__title": "Rotate List", "question__title_slug": "rotate-list", "question__hide": false, - "total_acs": 243481, - "total_submitted": 583870, - "total_column_articles": 2438, + "total_acs": 245588, + "total_submitted": 589210, + "total_column_articles": 2462, "frontend_question_id": "61", "is_new_question": false }, @@ -53709,9 +53940,9 @@ "question__title": "Permutation Sequence", "question__title_slug": "permutation-sequence", "question__hide": false, - "total_acs": 104901, - "total_submitted": 198094, - "total_column_articles": 1155, + "total_acs": 105598, + "total_submitted": 199268, + "total_column_articles": 1166, "frontend_question_id": "60", "is_new_question": false }, @@ -53730,9 +53961,9 @@ "question__title": "Spiral Matrix II", "question__title_slug": "spiral-matrix-ii", "question__hide": false, - "total_acs": 188823, - "total_submitted": 246863, - "total_column_articles": 2290, + "total_acs": 191903, + "total_submitted": 250993, + "total_column_articles": 2323, "frontend_question_id": "59", "is_new_question": false }, @@ -53751,9 +53982,9 @@ "question__title": "Length of Last Word", "question__title_slug": "length-of-last-word", "question__hide": false, - "total_acs": 313470, - "total_submitted": 784835, - "total_column_articles": 3337, + "total_acs": 316498, + "total_submitted": 790538, + "total_column_articles": 3360, "frontend_question_id": "58", "is_new_question": false }, @@ -53772,9 +54003,9 @@ "question__title": "Insert Interval", "question__title_slug": "insert-interval", "question__hide": false, - "total_acs": 106911, - "total_submitted": 257910, - "total_column_articles": 1103, + "total_acs": 107866, + "total_submitted": 260132, + "total_column_articles": 1114, "frontend_question_id": "57", "is_new_question": false }, @@ -53793,9 +54024,9 @@ "question__title": "Merge Intervals", "question__title_slug": "merge-intervals", "question__hide": false, - "total_acs": 428552, - "total_submitted": 884972, - "total_column_articles": 3058, + "total_acs": 434697, + "total_submitted": 896821, + "total_column_articles": 3093, "frontend_question_id": "56", "is_new_question": false }, @@ -53814,9 +54045,9 @@ "question__title": "Jump Game", "question__title_slug": "jump-game", "question__hide": false, - "total_acs": 477815, - "total_submitted": 1099356, - "total_column_articles": 3508, + "total_acs": 484764, + "total_submitted": 1114960, + "total_column_articles": 3559, "frontend_question_id": "55", "is_new_question": false }, @@ -53835,9 +54066,9 @@ "question__title": "Spiral Matrix", "question__title_slug": "spiral-matrix", "question__hide": false, - "total_acs": 253680, - "total_submitted": 521216, - "total_column_articles": 2719, + "total_acs": 256823, + "total_submitted": 527352, + "total_column_articles": 2760, "frontend_question_id": "54", "is_new_question": false }, @@ -53856,9 +54087,9 @@ "question__title": "Maximum Subarray", "question__title_slug": "maximum-subarray", "question__hide": false, - "total_acs": 993701, - "total_submitted": 1809163, - "total_column_articles": 5133, + "total_acs": 1006517, + "total_submitted": 1833318, + "total_column_articles": 5183, "frontend_question_id": "53", "is_new_question": false }, @@ -53877,9 +54108,9 @@ "question__title": "N-Queens II", "question__title_slug": "n-queens-ii", "question__hide": false, - "total_acs": 89949, - "total_submitted": 109273, - "total_column_articles": 726, + "total_acs": 90891, + "total_submitted": 110403, + "total_column_articles": 731, "frontend_question_id": "52", "is_new_question": false }, @@ -53898,9 +54129,9 @@ "question__title": "N-Queens", "question__title_slug": "n-queens", "question__hide": false, - "total_acs": 207377, - "total_submitted": 280244, - "total_column_articles": 2126, + "total_acs": 210358, + "total_submitted": 284173, + "total_column_articles": 2152, "frontend_question_id": "51", "is_new_question": false }, @@ -53919,9 +54150,9 @@ "question__title": "Pow(x, n)", "question__title_slug": "powx-n", "question__hide": false, - "total_acs": 281222, - "total_submitted": 743348, - "total_column_articles": 1660, + "total_acs": 283885, + "total_submitted": 750333, + "total_column_articles": 1677, "frontend_question_id": "50", "is_new_question": false }, @@ -53940,9 +54171,9 @@ "question__title": "Group Anagrams", "question__title_slug": "group-anagrams", "question__hide": false, - "total_acs": 314752, - "total_submitted": 468397, - "total_column_articles": 1792, + "total_acs": 319060, + "total_submitted": 474589, + "total_column_articles": 1819, "frontend_question_id": "49", "is_new_question": false }, @@ -53961,9 +54192,9 @@ "question__title": "Rotate Image", "question__title_slug": "rotate-image", "question__hide": false, - "total_acs": 310222, - "total_submitted": 418945, - "total_column_articles": 2954, + "total_acs": 314704, + "total_submitted": 424878, + "total_column_articles": 2995, "frontend_question_id": "48", "is_new_question": false }, @@ -53982,9 +54213,9 @@ "question__title": "Permutations II", "question__title_slug": "permutations-ii", "question__hide": false, - "total_acs": 304884, - "total_submitted": 472196, - "total_column_articles": 2051, + "total_acs": 309765, + "total_submitted": 479461, + "total_column_articles": 2076, "frontend_question_id": "47", "is_new_question": false }, @@ -54003,9 +54234,9 @@ "question__title": "Permutations", "question__title_slug": "permutations", "question__hide": false, - "total_acs": 594006, - "total_submitted": 756506, - "total_column_articles": 4154, + "total_acs": 602325, + "total_submitted": 767099, + "total_column_articles": 4208, "frontend_question_id": "46", "is_new_question": false }, @@ -54024,9 +54255,9 @@ "question__title": "Jump Game II", "question__title_slug": "jump-game-ii", "question__hide": false, - "total_acs": 317542, - "total_submitted": 714483, - "total_column_articles": 2371, + "total_acs": 322779, + "total_submitted": 725408, + "total_column_articles": 2387, "frontend_question_id": "45", "is_new_question": false }, @@ -54045,9 +54276,9 @@ "question__title": "Wildcard Matching", "question__title_slug": "wildcard-matching", "question__hide": false, - "total_acs": 103817, - "total_submitted": 312890, - "total_column_articles": 695, + "total_acs": 104735, + "total_submitted": 315570, + "total_column_articles": 700, "frontend_question_id": "44", "is_new_question": false }, @@ -54066,9 +54297,9 @@ "question__title": "Multiply Strings", "question__title_slug": "multiply-strings", "question__hide": false, - "total_acs": 219127, - "total_submitted": 488654, - "total_column_articles": 1466, + "total_acs": 221402, + "total_submitted": 493959, + "total_column_articles": 1479, "frontend_question_id": "43", "is_new_question": false }, @@ -54087,9 +54318,9 @@ "question__title": "Trapping Rain Water", "question__title_slug": "trapping-rain-water", "question__hide": false, - "total_acs": 462596, - "total_submitted": 763296, - "total_column_articles": 3163, + "total_acs": 469166, + "total_submitted": 773046, + "total_column_articles": 3197, "frontend_question_id": "42", "is_new_question": false }, @@ -54108,9 +54339,9 @@ "question__title": "First Missing Positive", "question__title_slug": "first-missing-positive", "question__hide": false, - "total_acs": 216539, - "total_submitted": 509411, - "total_column_articles": 1727, + "total_acs": 218913, + "total_submitted": 514662, + "total_column_articles": 1746, "frontend_question_id": "41", "is_new_question": false }, @@ -54129,9 +54360,9 @@ "question__title": "Combination Sum II", "question__title_slug": "combination-sum-ii", "question__hide": false, - "total_acs": 281032, - "total_submitted": 462260, - "total_column_articles": 1915, + "total_acs": 285331, + "total_submitted": 469475, + "total_column_articles": 1946, "frontend_question_id": "40", "is_new_question": false }, @@ -54150,9 +54381,9 @@ "question__title": "Combination Sum", "question__title_slug": "combination-sum", "question__hide": false, - "total_acs": 482855, - "total_submitted": 663630, - "total_column_articles": 2755, + "total_acs": 490511, + "total_submitted": 674083, + "total_column_articles": 2797, "frontend_question_id": "39", "is_new_question": false }, @@ -54171,9 +54402,9 @@ "question__title": "Count and Say", "question__title_slug": "count-and-say", "question__hide": false, - "total_acs": 278633, - "total_submitted": 464945, - "total_column_articles": 2827, + "total_acs": 280370, + "total_submitted": 467730, + "total_column_articles": 2842, "frontend_question_id": "38", "is_new_question": false }, @@ -54192,9 +54423,9 @@ "question__title": "Sudoku Solver", "question__title_slug": "sudoku-solver", "question__hide": false, - "total_acs": 138169, - "total_submitted": 205094, - "total_column_articles": 1137, + "total_acs": 140472, + "total_submitted": 208255, + "total_column_articles": 1153, "frontend_question_id": "37", "is_new_question": false }, @@ -54213,9 +54444,9 @@ "question__title": "Valid Sudoku", "question__title_slug": "valid-sudoku", "question__hide": false, - "total_acs": 272325, - "total_submitted": 428926, - "total_column_articles": 1916, + "total_acs": 275358, + "total_submitted": 433817, + "total_column_articles": 1937, "frontend_question_id": "36", "is_new_question": false }, @@ -54234,9 +54465,9 @@ "question__title": "Search Insert Position", "question__title_slug": "search-insert-position", "question__hide": false, - "total_acs": 768850, - "total_submitted": 1695604, - "total_column_articles": 5419, + "total_acs": 779446, + "total_submitted": 1719722, + "total_column_articles": 5482, "frontend_question_id": "35", "is_new_question": false }, @@ -54255,9 +54486,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": 514200, - "total_submitted": 1218121, - "total_column_articles": 4921, + "total_acs": 522358, + "total_submitted": 1237207, + "total_column_articles": 4993, "frontend_question_id": "34", "is_new_question": false }, @@ -54276,9 +54507,9 @@ "question__title": "Search in Rotated Sorted Array", "question__title_slug": "search-in-rotated-sorted-array", "question__hide": false, - "total_acs": 515720, - "total_submitted": 1186027, - "total_column_articles": 3383, + "total_acs": 522350, + "total_submitted": 1200371, + "total_column_articles": 3433, "frontend_question_id": "33", "is_new_question": false }, @@ -54297,9 +54528,9 @@ "question__title": "Longest Valid Parentheses", "question__title_slug": "longest-valid-parentheses", "question__hide": false, - "total_acs": 259254, - "total_submitted": 713494, - "total_column_articles": 1697, + "total_acs": 262679, + "total_submitted": 721974, + "total_column_articles": 1712, "frontend_question_id": "32", "is_new_question": false }, @@ -54318,9 +54549,9 @@ "question__title": "Next Permutation", "question__title_slug": "next-permutation", "question__hide": false, - "total_acs": 296464, - "total_submitted": 789944, - "total_column_articles": 2349, + "total_acs": 300207, + "total_submitted": 799546, + "total_column_articles": 2371, "frontend_question_id": "31", "is_new_question": false }, @@ -54339,9 +54570,9 @@ "question__title": "Substring with Concatenation of All Words", "question__title_slug": "substring-with-concatenation-of-all-words", "question__hide": false, - "total_acs": 104045, - "total_submitted": 281549, - "total_column_articles": 816, + "total_acs": 105355, + "total_submitted": 284627, + "total_column_articles": 827, "frontend_question_id": "30", "is_new_question": false }, @@ -54360,9 +54591,9 @@ "question__title": "Divide Two Integers", "question__title_slug": "divide-two-integers", "question__hide": false, - "total_acs": 160527, - "total_submitted": 725974, - "total_column_articles": 1251, + "total_acs": 162097, + "total_submitted": 732469, + "total_column_articles": 1262, "frontend_question_id": "29", "is_new_question": false }, @@ -54381,9 +54612,9 @@ "question__title": "Implement strStr()", "question__title_slug": "implement-strstr", "question__hide": false, - "total_acs": 626685, - "total_submitted": 1552964, - "total_column_articles": 4235, + "total_acs": 633326, + "total_submitted": 1566656, + "total_column_articles": 4298, "frontend_question_id": "28", "is_new_question": false }, @@ -54402,9 +54633,9 @@ "question__title": "Remove Element", "question__title_slug": "remove-element", "question__hide": false, - "total_acs": 676490, - "total_submitted": 1138136, - "total_column_articles": 5410, + "total_acs": 685605, + "total_submitted": 1153694, + "total_column_articles": 5458, "frontend_question_id": "27", "is_new_question": false }, @@ -54423,9 +54654,9 @@ "question__title": "Remove Duplicates from Sorted Array", "question__title_slug": "remove-duplicates-from-sorted-array", "question__hide": false, - "total_acs": 1076678, - "total_submitted": 1996520, - "total_column_articles": 5854, + "total_acs": 1088491, + "total_submitted": 2017507, + "total_column_articles": 5920, "frontend_question_id": "26", "is_new_question": false }, @@ -54444,9 +54675,9 @@ "question__title": "Reverse Nodes in k-Group", "question__title_slug": "reverse-nodes-in-k-group", "question__hide": false, - "total_acs": 326279, - "total_submitted": 486421, - "total_column_articles": 2890, + "total_acs": 332546, + "total_submitted": 494683, + "total_column_articles": 2927, "frontend_question_id": "25", "is_new_question": false }, @@ -54465,9 +54696,9 @@ "question__title": "Swap Nodes in Pairs", "question__title_slug": "swap-nodes-in-pairs", "question__hide": false, - "total_acs": 428441, - "total_submitted": 605394, - "total_column_articles": 3296, + "total_acs": 433742, + "total_submitted": 612714, + "total_column_articles": 3326, "frontend_question_id": "24", "is_new_question": false }, @@ -54486,9 +54717,9 @@ "question__title": "Merge k Sorted Lists", "question__title_slug": "merge-k-sorted-lists", "question__hide": false, - "total_acs": 450743, - "total_submitted": 792969, - "total_column_articles": 3041, + "total_acs": 456666, + "total_submitted": 803077, + "total_column_articles": 3078, "frontend_question_id": "23", "is_new_question": false }, @@ -54507,9 +54738,9 @@ "question__title": "Generate Parentheses", "question__title_slug": "generate-parentheses", "question__hide": false, - "total_acs": 489366, - "total_submitted": 631953, - "total_column_articles": 3531, + "total_acs": 495575, + "total_submitted": 640020, + "total_column_articles": 3570, "frontend_question_id": "22", "is_new_question": false }, @@ -54528,9 +54759,9 @@ "question__title": "Merge Two Sorted Lists", "question__title_slug": "merge-two-sorted-lists", "question__hide": false, - "total_acs": 979852, - "total_submitted": 1469888, - "total_column_articles": 5035, + "total_acs": 991050, + "total_submitted": 1486915, + "total_column_articles": 5081, "frontend_question_id": "21", "is_new_question": false }, @@ -54549,9 +54780,9 @@ "question__title": "Valid Parentheses", "question__title_slug": "valid-parentheses", "question__hide": false, - "total_acs": 1053885, - "total_submitted": 2365726, - "total_column_articles": 7231, + "total_acs": 1065395, + "total_submitted": 2390688, + "total_column_articles": 7299, "frontend_question_id": "20", "is_new_question": false }, @@ -54570,9 +54801,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": 757719, - "total_submitted": 1726560, - "total_column_articles": 5589, + "total_acs": 767857, + "total_submitted": 1747646, + "total_column_articles": 5660, "frontend_question_id": "19", "is_new_question": false }, @@ -54591,9 +54822,9 @@ "question__title": "4Sum", "question__title_slug": "4sum", "question__hide": false, - "total_acs": 305793, - "total_submitted": 777936, - "total_column_articles": 2053, + "total_acs": 309873, + "total_submitted": 788354, + "total_column_articles": 2076, "frontend_question_id": "18", "is_new_question": false }, @@ -54612,9 +54843,9 @@ "question__title": "Letter Combinations of a Phone Number", "question__title_slug": "letter-combinations-of-a-phone-number", "question__hide": false, - "total_acs": 469153, - "total_submitted": 812360, - "total_column_articles": 4098, + "total_acs": 475040, + "total_submitted": 822636, + "total_column_articles": 4145, "frontend_question_id": "17", "is_new_question": false }, @@ -54633,9 +54864,9 @@ "question__title": "3Sum Closest", "question__title_slug": "3sum-closest", "question__hide": false, - "total_acs": 341612, - "total_submitted": 747638, - "total_column_articles": 1871, + "total_acs": 345182, + "total_submitted": 755918, + "total_column_articles": 1886, "frontend_question_id": "16", "is_new_question": false }, @@ -54654,9 +54885,9 @@ "question__title": "3Sum", "question__title_slug": "3sum", "question__hide": false, - "total_acs": 933618, - "total_submitted": 2647739, - "total_column_articles": 4267, + "total_acs": 946357, + "total_submitted": 2679172, + "total_column_articles": 4316, "frontend_question_id": "15", "is_new_question": false }, @@ -54675,9 +54906,9 @@ "question__title": "Longest Common Prefix", "question__title_slug": "longest-common-prefix", "question__hide": false, - "total_acs": 810974, - "total_submitted": 1919266, - "total_column_articles": 5030, + "total_acs": 818679, + "total_submitted": 1935651, + "total_column_articles": 5081, "frontend_question_id": "14", "is_new_question": false }, @@ -54696,9 +54927,9 @@ "question__title": "Roman to Integer", "question__title_slug": "roman-to-integer", "question__hide": false, - "total_acs": 614472, - "total_submitted": 982063, - "total_column_articles": 5015, + "total_acs": 621089, + "total_submitted": 993146, + "total_column_articles": 5068, "frontend_question_id": "13", "is_new_question": false }, @@ -54717,9 +54948,9 @@ "question__title": "Integer to Roman", "question__title_slug": "integer-to-roman", "question__hide": false, - "total_acs": 287805, - "total_submitted": 434293, - "total_column_articles": 2247, + "total_acs": 290357, + "total_submitted": 438233, + "total_column_articles": 2267, "frontend_question_id": "12", "is_new_question": false }, @@ -54738,9 +54969,9 @@ "question__title": "Container With Most Water", "question__title_slug": "container-with-most-water", "question__hide": false, - "total_acs": 707999, - "total_submitted": 1151643, - "total_column_articles": 4005, + "total_acs": 715406, + "total_submitted": 1164545, + "total_column_articles": 4051, "frontend_question_id": "11", "is_new_question": false }, @@ -54759,9 +54990,9 @@ "question__title": "Regular Expression Matching", "question__title_slug": "regular-expression-matching", "question__hide": false, - "total_acs": 267590, - "total_submitted": 846768, - "total_column_articles": 1606, + "total_acs": 270571, + "total_submitted": 856322, + "total_column_articles": 1616, "frontend_question_id": "10", "is_new_question": false }, @@ -54780,9 +55011,9 @@ "question__title": "Palindrome Number", "question__title_slug": "palindrome-number", "question__hide": false, - "total_acs": 1007587, - "total_submitted": 1756828, - "total_column_articles": 6321, + "total_acs": 1017042, + "total_submitted": 1774874, + "total_column_articles": 6377, "frontend_question_id": "9", "is_new_question": false }, @@ -54801,9 +55032,9 @@ "question__title": "String to Integer (atoi)", "question__title_slug": "string-to-integer-atoi", "question__hide": false, - "total_acs": 441295, - "total_submitted": 2038499, - "total_column_articles": 3331, + "total_acs": 445160, + "total_submitted": 2057879, + "total_column_articles": 3362, "frontend_question_id": "8", "is_new_question": false }, @@ -54822,9 +55053,9 @@ "question__title": "Reverse Integer", "question__title_slug": "reverse-integer", "question__hide": false, - "total_acs": 1000274, - "total_submitted": 2838623, - "total_column_articles": 6185, + "total_acs": 1005726, + "total_submitted": 2853306, + "total_column_articles": 6220, "frontend_question_id": "7", "is_new_question": false }, @@ -54843,9 +55074,9 @@ "question__title": "ZigZag Conversion", "question__title_slug": "zigzag-conversion", "question__hide": false, - "total_acs": 424041, - "total_submitted": 816556, - "total_column_articles": 3534, + "total_acs": 427818, + "total_submitted": 824021, + "total_column_articles": 3576, "frontend_question_id": "6", "is_new_question": false }, @@ -54864,9 +55095,9 @@ "question__title": "Longest Palindromic Substring", "question__title_slug": "longest-palindromic-substring", "question__hide": false, - "total_acs": 1000730, - "total_submitted": 2739022, - "total_column_articles": 5413, + "total_acs": 1012794, + "total_submitted": 2768943, + "total_column_articles": 5485, "frontend_question_id": "5", "is_new_question": false }, @@ -54885,9 +55116,9 @@ "question__title": "Median of Two Sorted Arrays", "question__title_slug": "median-of-two-sorted-arrays", "question__hide": false, - "total_acs": 691244, - "total_submitted": 1671991, - "total_column_articles": 5097, + "total_acs": 698309, + "total_submitted": 1689158, + "total_column_articles": 5145, "frontend_question_id": "4", "is_new_question": false }, @@ -54906,9 +55137,9 @@ "question__title": "Longest Substring Without Repeating Characters", "question__title_slug": "longest-substring-without-repeating-characters", "question__hide": false, - "total_acs": 1685304, - "total_submitted": 4355180, - "total_column_articles": 10112, + "total_acs": 1703819, + "total_submitted": 4400821, + "total_column_articles": 10218, "frontend_question_id": "3", "is_new_question": false }, @@ -54927,9 +55158,9 @@ "question__title": "Add Two Numbers", "question__title_slug": "add-two-numbers", "question__hide": false, - "total_acs": 1303519, - "total_submitted": 3131543, - "total_column_articles": 9299, + "total_acs": 1315757, + "total_submitted": 3159100, + "total_column_articles": 9378, "frontend_question_id": "2", "is_new_question": false }, @@ -54948,9 +55179,9 @@ "question__title": "Two Sum", "question__title_slug": "two-sum", "question__hide": false, - "total_acs": 3308748, - "total_submitted": 6307590, - "total_column_articles": 17388, + "total_acs": 3339023, + "total_submitted": 6364377, + "total_column_articles": 17525, "frontend_question_id": "1", "is_new_question": false }, diff --git a/leetcode-cn/problem (Chinese)/0 和 1 个数相同的子数组 [A1NYOS].html b/leetcode-cn/problem (Chinese)/0 和 1 个数相同的子数组 [A1NYOS].html index c18066aa..0a981c39 100644 --- a/leetcode-cn/problem (Chinese)/0 和 1 个数相同的子数组 [A1NYOS].html +++ b/leetcode-cn/problem (Chinese)/0 和 1 个数相同的子数组 [A1NYOS].html @@ -2,14 +2,14 @@
-
示例 1:
+示例 1:
输入: nums = [0,1] 输出: 2 说明: [0, 1] 是具有相同数量 0 和 1 的最长连续子数组。-
示例 2:
+示例 2:
输入: nums = [0,1,0] diff --git a/leetcode-cn/problem (Chinese)/K 个一组翻转链表 [reverse-nodes-in-k-group].html b/leetcode-cn/problem (Chinese)/K 个一组翻转链表 [reverse-nodes-in-k-group].html index 6ea8cd85..77b80b4b 100644 --- a/leetcode-cn/problem (Chinese)/K 个一组翻转链表 [reverse-nodes-in-k-group].html +++ b/leetcode-cn/problem (Chinese)/K 个一组翻转链表 [reverse-nodes-in-k-group].html @@ -1,17 +1,10 @@ -给你一个链表,每 k 个节点一组进行翻转,请你返回翻转后的链表。
+给你链表的头节点
-head,每k个节点一组进行翻转,请你返回修改后的链表。k 是一个正整数,它的值小于或等于链表的长度。
+-
k是一个正整数,它的值小于或等于链表的长度。如果节点总数不是k的整数倍,那么请将最后剩余的节点保持原有顺序。如果节点总数不是 k 的整数倍,那么请将最后剩余的节点保持原有顺序。
+你不能只是单纯的改变节点内部的值,而是需要实际进行节点交换。
-进阶:
- -
+
示例 1:
@@ -21,34 +14,26 @@
示例 2:
-
+
+
输入:head = [1,2,3,4,5], k = 3 输出:[3,2,1,4,5]-
示例 3:
++提示: -
-输入:head = [1,2,3,4,5], k = 1 -输出:[1,2,3,4,5] -+
n1 <= k <= n <= 50000 <= Node.val <= 1000示例 4:
+-
-输入:head = [1], k = 1 -输出:[1] -+
进阶:你可以设计一个只用 O(1) 额外内存空间的算法解决此问题吗?
提示:
- -sz 内1 <= sz <= 50000 <= Node.val <= 10001 <= k <= sz给定一个数组 prices ,其中 prices[i] 表示股票第 i 天的价格。
给你一个整数数组 prices ,其中 prices[i] 表示某支股票第 i 天的价格。
在每一天,你可能会决定购买和/或出售股票。你在任何时候 最多 只能持有 一股 股票。你也可以购买它,然后在 同一天 出售。
-返回 你能获得的 最大 利润 。
在每一天,你可以决定是否购买和/或出售股票。你在任何时候 最多 只能持有 一股 股票。你也可以先购买,然后在 同一天 出售。
+ +返回 你能获得的 最大 利润 。
-
示例 1:
+示例 1:
-输入: prices = [7,1,5,3,6,4] -输出: 7 -解释: 在第 2 天(股票价格 = 1)的时候买入,在第 3 天(股票价格 = 5)的时候卖出, 这笔交易所能获得利润 = 5-1 = 4 。 - 随后,在第 4 天(股票价格 = 3)的时候买入,在第 5 天(股票价格 = 6)的时候卖出, 这笔交易所能获得利润 = 6-3 = 3 。 -+输入:prices = [7,1,5,3,6,4] +输出:7 +解释:在第 2 天(股票价格 = 1)的时候买入,在第 3 天(股票价格 = 5)的时候卖出, 这笔交易所能获得利润 = 5 - 1 = 4 。 + 随后,在第 4 天(股票价格 = 3)的时候买入,在第 5 天(股票价格 = 6)的时候卖出, 这笔交易所能获得利润 = 6 - 3 = 3 。 + 总利润为 4 + 3 = 7 。 -
示例 2:
+示例 2:
-输入: prices = [1,2,3,4,5] -输出: 4 -解释: 在第 1 天(股票价格 = 1)的时候买入,在第 5 天 (股票价格 = 5)的时候卖出, 这笔交易所能获得利润 = 5-1 = 4 。 - 注意你不能在第 1 天和第 2 天接连购买股票,之后再将它们卖出。因为这样属于同时参与了多笔交易,你必须在再次购买前出售掉之前的股票。 -+输入:prices = [1,2,3,4,5] +输出:4 +解释:在第 1 天(股票价格 = 1)的时候买入,在第 5 天 (股票价格 = 5)的时候卖出, 这笔交易所能获得利润 = 5 - 1 = 4 。 + 总利润为 4 。 -
示例 3:
+示例 3:
-输入: prices = [7,6,4,3,1] -输出: 0 -解释: 在这种情况下, 没有交易完成, 所以最大利润为 0。+输入:prices = [7,6,4,3,1] +输出:0 +解释:在这种情况下, 交易无法获得正利润,所以不参与交易可以获得最大利润,最大利润为 0 。
diff --git a/leetcode-cn/problem (Chinese)/优势洗牌 [advantage-shuffle].html b/leetcode-cn/problem (Chinese)/优势洗牌 [advantage-shuffle].html index 2cd26e56..2bf2b926 100644 --- a/leetcode-cn/problem (Chinese)/优势洗牌 [advantage-shuffle].html +++ b/leetcode-cn/problem (Chinese)/优势洗牌 [advantage-shuffle].html @@ -1,18 +1,20 @@ -
给定两个大小相等的数组 A 和 B,A 相对于 B 的优势可以用满足 A[i] > B[i] 的索引 i 的数目来描述。
给定两个大小相等的数组 nums1 和 nums2,nums1 相对于 nums 的优势可以用满足 nums1[i] > nums2[i] 的索引 i 的数目来描述。
返回 A 的任意排列,使其相对于 B 的优势最大化。
返回 nums1 的任意排列,使其相对于 nums2 的优势最大化。
示例 1:
-输入:A = [2,7,11,15], B = [1,10,4,11] ++输入:nums1 = [2,7,11,15], nums2 = [1,10,4,11] 输出:[2,11,7,15]示例 2:
-输入:A = [12,24,8,32], B = [13,25,32,11] ++输入:nums1 = [12,24,8,32], nums2 = [13,25,32,11] 输出:[24,32,8,12]@@ -20,8 +22,8 @@提示:
--
+- -
1 <= A.length = B.length <= 10000- -
0 <= A[i] <= 10^9- -
0 <= B[i] <= 10^9
1 <= nums1.length <= 105nums2.length == nums1.length0 <= nums1[i], nums2[i] <= 109-
编写一个SQL查询来 删除 所有重复的电子邮件,只保留一个id最小的唯一电子邮件。
+编写一个 SQL 删除语句来 删除 所有重复的电子邮件,只保留一个id最小的唯一电子邮件。
-以 任意顺序 返回结果表。
+以 任意顺序 返回结果表。 (注意: 仅需要写删除语句,将自动对剩余结果进行查询)
查询结果格式如下所示。
+
+
示例 1:
diff --git a/leetcode-cn/problem (Chinese)/区域和检索 - 数组可修改 [range-sum-query-mutable].html b/leetcode-cn/problem (Chinese)/区域和检索 - 数组可修改 [range-sum-query-mutable].html index 64737fa5..eab7c98c 100644 --- a/leetcode-cn/problem (Chinese)/区域和检索 - 数组可修改 [range-sum-query-mutable].html +++ b/leetcode-cn/problem (Chinese)/区域和检索 - 数组可修改 [range-sum-query-mutable].html @@ -41,5 +41,5 @@ numArray.sumRange(0, 2); // 返回 1 + 2 + 5 = 8
0 <= index < nums.length-100 <= val <= 1000 <= left <= right < nums.lengthpdate 和 sumRange 方法次数不大于 3 * 104 update 和 sumRange 方法次数不大于 3 * 104 有个内含单词的超大文本文件,给定任意两个单词,找出在这个文件中这两个单词的最短距离(相隔单词数)。如果寻找过程在这个文件中会重复多次,而每次寻找的单词不同,你能对此优化吗?
+有个内含单词的超大文本文件,给定任意两个不同的单词,找出在这个文件中这两个单词的最短距离(相隔单词数)。如果寻找过程在这个文件中会重复多次,而每次寻找的单词不同,你能对此优化吗?
示例:
-输入:words = ["I","am","a","student","from","a","university","in","a","city"], word1 = "a", word2 = "student" ++输入:words = ["I","am","a","student","from","a","university","in","a","city"], word1 = "a", word2 = "student" 输出:1提示:
diff --git a/leetcode-cn/problem (Chinese)/和为 k 的子数组 [QTMn0o].html b/leetcode-cn/problem (Chinese)/和为 k 的子数组 [QTMn0o].html index c269c486..78ac56b2 100644 --- a/leetcode-cn/problem (Chinese)/和为 k 的子数组 [QTMn0o].html +++ b/leetcode-cn/problem (Chinese)/和为 k 的子数组 [QTMn0o].html @@ -2,7 +2,7 @@-
示例 1 :
+示例 1:
输入:nums = [1,1,1], k = 2 @@ -10,7 +10,7 @@ 解释: 此题 [1,1] 与 [1,1] 为两种不同的情况-示例 2 :
+示例 2:
输入:nums = [1,2,3], k = 3 diff --git a/leetcode-cn/problem (Chinese)/字符串中的所有变位词 [VabMRr].html b/leetcode-cn/problem (Chinese)/字符串中的所有变位词 [VabMRr].html index 56715d47..0e727b65 100644 --- a/leetcode-cn/problem (Chinese)/字符串中的所有变位词 [VabMRr].html +++ b/leetcode-cn/problem (Chinese)/字符串中的所有变位词 [VabMRr].html @@ -4,7 +4,7 @@-
示例 1:
+示例 1:
输入: s = "cbaebabacd", p = "abc" @@ -14,7 +14,7 @@ 起始索引等于 6 的子串是 "bac", 它是 "abc" 的变位词。-示例 2:
+示例 2:
输入: s = "abab", p = "ab" diff --git a/leetcode-cn/problem (Chinese)/完成一半题目 [WqXACV].md b/leetcode-cn/problem (Chinese)/完成一半题目 [WqXACV].md index 3b30b706..b50d4043 100644 --- a/leetcode-cn/problem (Chinese)/完成一半题目 [WqXACV].md +++ b/leetcode-cn/problem (Chinese)/完成一半题目 [WqXACV].md @@ -1,27 +1,27 @@ -有 `N` 位扣友参加了微软与力扣举办了「以扣会友」线下活动。主办方提供了 `2*N` 道题目,整型数组 `questions` 中每个数字对应了每道题目所涉及的知识点类型。 -若每位扣友选择不同的一题,请返回被选的 `N` 道题目至少包含多少种知识点类型。 - - -**示例 1:** ->输入:`questions = [2,1,6,2]` -> ->输出:`1` -> ->解释:有 2 位扣友在 4 道题目中选择 2 题。 -> 可选择完成知识点类型为 2 的题目时,此时仅一种知识点类型 -> 因此至少包含 1 种知识点类型。 - -**示例 2:** ->输入:`questions = [1,5,1,3,4,5,2,5,3,3,8,6]` -> ->输出:`2` -> ->解释:有 6 位扣友在 12 道题目中选择题目,需要选择 6 题。 -> 选择完成知识点类型为 3、5 的题目,因此至少包含 2 种知识点类型。 - - - -**提示:** -- `questions.length == 2*n` -- `2 <= questions.length <= 10^5` +有 `N` 位扣友参加了微软与力扣举办了「以扣会友」线下活动。主办方提供了 `2*N` 道题目,整型数组 `questions` 中每个数字对应了每道题目所涉及的知识点类型。 +若每位扣友选择不同的一题,请返回被选的 `N` 道题目至少包含多少种知识点类型。 + + +**示例 1:** +>输入:`questions = [2,1,6,2]` +> +>输出:`1` +> +>解释:有 2 位扣友在 4 道题目中选择 2 题。 +> 可选择完成知识点类型为 2 的题目时,此时仅一种知识点类型 +> 因此至少包含 1 种知识点类型。 + +**示例 2:** +>输入:`questions = [1,5,1,3,4,5,2,5,3,3,8,6]` +> +>输出:`2` +> +>解释:有 6 位扣友在 12 道题目中选择题目,需要选择 6 题。 +> 选择完成知识点类型为 3、5 的题目,因此至少包含 2 种知识点类型。 + + + +**提示:** +- `questions.length == 2*n` +- `2 <= questions.length <= 10^5` - `1 <= questions[i] <= 1000` \ No newline at end of file diff --git a/leetcode-cn/problem (Chinese)/实现 strStr() [implement-strstr].html b/leetcode-cn/problem (Chinese)/实现 strStr() [implement-strstr].html index 8c1aade3..e9d7cb61 100644 --- a/leetcode-cn/problem (Chinese)/实现 strStr() [implement-strstr].html +++ b/leetcode-cn/problem (Chinese)/实现 strStr() [implement-strstr].html @@ -1,16 +1,16 @@ --实现 strStr() 函数。
+实现 strStr() 函数。
-给你两个字符串
+haystack和needle,请你在haystack字符串中找出needle字符串出现的第一个位置(下标从 0 开始)。如果不存在,则返回-1。给你两个字符串
-haystack和needle,请你在haystack字符串中找出needle字符串出现的第一个位置(下标从 0 开始)。如果不存在,则返回-1。+
说明:
-当
+needle是空字符串时,我们应当返回什么值呢?这是一个在面试中很好的问题。当
-needle是空字符串时,我们应当返回什么值呢?这是一个在面试中很好的问题。对于本题而言,当
+needle是空字符串时我们应当返回 0 。这与 C 语言的 strstr() 以及 Java 的 indexOf() 定义相符。对于本题而言,当
-needle是空字符串时我们应当返回 0 。这与 C 语言的 strstr() 以及 Java 的 indexOf() 定义相符。+
示例 1:
@@ -33,11 +33,11 @@ 输出:0+
提示:
0 <= haystack.length, needle.length <= 5 * 1041 <= haystack.length, needle.length <= 104haystack 和 needle 仅由小写英文字符组成如果一个由 '0' 和 '1' 组成的字符串,是以一些 '0'(可能没有 '0')后面跟着一些 '1'(也可能没有 '1')的形式组成的,那么该字符串是单调递增的。
如果一个二进制字符串,是以一些 0(可能没有 0)后面跟着一些 1(也可能没有 1)的形式组成的,那么该字符串是 单调递增 的。
我们给出一个由字符 '0' 和 '1' 组成的字符串 S,我们可以将任何 '0' 翻转为 '1' 或者将 '1' 翻转为 '0'。
给你一个二进制字符串 s,你可以将任何 0 翻转为 1 或者将 1 翻转为 0 。
返回使 S 单调递增的最小翻转次数。
返回使 s 单调递增的最小翻转次数。
@@ -11,7 +11,7 @@
输入:s = "00110" 输出:1 -解释:我们翻转最后一位得到 00111. +解释:翻转最后一位得到 00111.
示例 2:
@@ -19,7 +19,7 @@输入:s = "010110" 输出:2 -解释:我们翻转得到 011111,或者是 000111。 +解释:翻转得到 011111,或者是 000111。
示例 3:
@@ -27,7 +27,7 @@输入:s = "00011000" 输出:2 -解释:我们翻转得到 00000000。 +解释:翻转得到 00000000。
@@ -36,5 +36,5 @@
1 <= s.length <= 105S 中只包含字符 '0' 和 '1's[i] 为 '0' 或 '1'给定一个由空格分割单词的句子 S。每个单词只包含大写或小写字母。
给你一个由若干单词组成的句子 sentence ,单词间由空格分隔。每个单词仅由大写和小写英文字母组成。
我们要将句子转换为 “Goat Latin”(一种类似于 猪拉丁文 - Pig Latin 的虚构语言)。
- -山羊拉丁文的规则如下:
+请你将句子转换为 “山羊拉丁文(Goat Latin)”(一种类似于 猪拉丁文 - Pig Latin 的虚构语言)。山羊拉丁文的规则如下:
"ma"。"apple"变为"applema"。"ma"。"goat"变为"oatgma"。'a',索引从1开始。"a",在第二个单词后添加"aa",以此类推。'a', 'e', 'i', 'o', 'u'),在单词后添加"ma"。
+
+ "apple" 变为 "applema" 。"ma"。
+ "goat" 变为 "oatgma" 。'a',索引从 1 开始。
+ "a" ,在第二个单词后添加 "aa" ,以此类推。返回将 S 转换为山羊拉丁文后的句子。
返回将 sentence 转换为山羊拉丁文后的句子。
示例 1:
++ +
示例 1:
-输入: "I speak Goat Latin" -输出: "Imaa peaksmaaa oatGmaaaa atinLmaaaaa" +输入:sentence = "I speak Goat Latin" +输出:"Imaa peaksmaaa oatGmaaaa atinLmaaaaa"-
示例 2:
+示例 2:
-输入: "The quick brown fox jumped over the lazy dog" -输出: "heTmaa uickqmaaa rownbmaaaa oxfmaaaaa umpedjmaaaaaa overmaaaaaaa hetmaaaaaaaa azylmaaaaaaaaa ogdmaaaaaaaaaa" +输入:sentence = "The quick brown fox jumped over the lazy dog" +输出:"heTmaa uickqmaaa rownbmaaaa oxfmaaaaa umpedjmaaaaaa overmaaaaaaa hetmaaaaaaaa azylmaaaaaaaaa ogdmaaaaaaaaaa"-
说明:
++ +
提示:
S 中仅包含大小写字母和空格。单词间有且仅有一个空格。1 <= S.length <= 150。1 <= sentence.length <= 150sentence 由英文字母和空格组成sentence 不含前导或尾随空格sentence 中的所有单词由单个空格分隔有 n 个气球,编号为0 到 n - 1,每个气球上都标有一个数字,这些数字存在数组 nums 中。
有 n 个气球,编号为0 到 n - 1,每个气球上都标有一个数字,这些数字存在数组 nums 中。
现在要求你戳破所有的气球。戳破第 i 个气球,你可以获得 nums[i - 1] * nums[i] * nums[i + 1] 枚硬币。 这里的 i - 1 和 i + 1 代表和 i 相邻的两个气球的序号。如果 i - 1或 i + 1 超出了数组的边界,那么就当它是一个数字为 1 的气球。
现在要求你戳破所有的气球。戳破第 i 个气球,你可以获得 nums[i - 1] * nums[i] * nums[i + 1] 枚硬币。 这里的 i - 1 和 i + 1 代表和 i 相邻的两个气球的序号。如果 i - 1或 i + 1 超出了数组的边界,那么就当它是一个数字为 1 的气球。
求所能获得硬币的最大数量。
-+
示例 1:
输入:nums = [3,1,5,8] 输出:167 解释: -nums = [3,1,5,8] --> [3,5,8] --> [3,8] --> [8] --> [] +nums = [3,1,5,8] --> [3,5,8] --> [3,8] --> [8] --> [] coins = 3*1*5 + 3*5*8 + 1*3*8 + 1*8*1 = 167
示例 2:
@@ -21,12 +21,12 @@ coins = 3*1*5 + 3*5*8 + 1*3*8 + 1*8*1 = 167 输出:10 -+
提示:
n == nums.length1 <= n <= 5000 <= nums[i] <= 1001 <= n <= 3000 <= nums[i] <= 100提示:
1 <= nums.length <= 2001 <= nums.length <= 50-106 <= nums[i] <= 106nums 中的所有元素都是 唯一的5 * 104 次 reset 和 shuffle104 次 reset 和 shuffle你有 k 个服务器,编号为 0 到 k-1 ,它们可以同时处理多个请求组。每个服务器有无穷的计算能力但是 不能同时处理超过一个请求 。请求分配到服务器的规则如下:
你有 k 个服务器,编号为 0 到 k-1 ,它们可以同时处理多个请求组。每个服务器有无穷的计算能力但是 不能同时处理超过一个请求 。请求分配到服务器的规则如下:
i (序号从 0 开始)个请求到达。i (序号从 0 开始)个请求到达。(i % k) 个服务器空闲,那么对应服务器会处理该请求。i 个服务器在忙,那么会查看第 (i+1) 个服务器,第 (i+2) 个服务器等等。(i % k) 个服务器空闲,那么对应服务器会处理该请求。i 个服务器在忙,那么会查看第 (i+1) 个服务器,第 (i+2) 个服务器等等。给你一个 严格递增 的正整数数组 arrival ,表示第 i 个任务的到达时间,和另一个数组 load ,其中 load[i] 表示第 i 个请求的工作量(也就是服务器完成它所需要的时间)。你的任务是找到 最繁忙的服务器 。最繁忙定义为一个服务器处理的请求数是所有服务器里最多的。
给你一个 严格递增 的正整数数组 arrival ,表示第 i 个任务的到达时间,和另一个数组 load ,其中 load[i] 表示第 i 个请求的工作量(也就是服务器完成它所需要的时间)。你的任务是找到 最繁忙的服务器 。最繁忙定义为一个服务器处理的请求数是所有服务器里最多的。
请你返回包含所有 最繁忙服务器 序号的列表,你可以以任意顺序返回这个列表。
+请你返回包含所有 最繁忙服务器 序号的列表,你可以以任意顺序返回这个列表。
-+
示例 1:
@@ -23,7 +23,7 @@ 解释: 所有服务器一开始都是空闲的。 前 3 个请求分别由前 3 台服务器依次处理。 -请求 3 进来的时候,服务器 0 被占据,所以它呗安排到下一台空闲的服务器,也就是服务器 1 。 +请求 3 进来的时候,服务器 0 被占据,所以它被安排到下一台空闲的服务器,也就是服务器 1 。 请求 4 进来的时候,由于所有服务器都被占据,该请求被舍弃。 服务器 0 和 2 分别都处理了一个请求,服务器 1 处理了两个请求。所以服务器 1 是最忙的服务器。 @@ -61,14 +61,14 @@ 输出:[0] -+
提示:
1 <= k <= 1051 <= arrival.length, load.length <= 1051 <= k <= 1051 <= arrival.length, load.length <= 105arrival.length == load.length1 <= arrival[i], load[i] <= 109arrival 保证 严格递增 。1 <= arrival[i], load[i] <= 109arrival 保证 严格递增 。有一个有 n 个节点的有向图,节点按 0 到 n - 1 编号。图由一个 索引从 0 开始 的 2D 整数数组 graph表示, graph[i]是与节点 i 相邻的节点的整数数组,这意味着从节点 i 到 graph[i]中的每个节点都有一条边。
如果一个节点没有连出的有向边,则它是 终端节点 。如果没有出边,则节点为终端节点。如果从该节点开始的所有可能路径都通向一个 终端节点 ,则该节点为 安全节点 。
+如果一个节点没有连出的有向边,则它是 终端节点 。如果没有出边,则节点为终端节点。如果从该节点开始的所有可能路径都通向 终端节点 ,则该节点为 安全节点 。
返回一个由图中所有 安全节点 组成的数组作为答案。答案数组中的元素应当按 升序 排列。
@@ -14,8 +14,8 @@ 输入:graph = [[1,2],[2,3],[5],[0],[5],[],[]] 输出:[2,4,5,6] 解释:示意图如上。 -节点5和节点6是终端节点,因为它们都没有出边。 -从节点2、4、5和6开始的所有路径都指向节点5或6。 +节点 5 和节点 6 是终端节点,因为它们都没有出边。 +从节点 2、4、5 和 6 开始的所有路径都指向节点 5 或 6 。示例 2:
@@ -24,7 +24,7 @@ 输入:graph = [[1,2,3,4],[1,2],[3,4],[0,4],[]] 输出:[4] 解释: -只有节点4是终端节点,从节点4开始的所有路径都通向节点4。 +只有节点 4 是终端节点,从节点 4 开始的所有路径都通向节点 4 。@@ -35,6 +35,7 @@
n == graph.length1 <= n <= 1040 <= graph[i].length <= n0 <= graph[i][j] <= n - 1graph[i] 按严格递增顺序排列。[1, 4 * 104] 内。给定一个非负整数数组 A,返回一个数组,在该数组中, A 的所有偶数元素之后跟着所有奇数元素。
给你一个整数数组 nums,将 nums 中的的所有偶数元素移动到数组的前面,后跟所有奇数元素。
你可以返回满足此条件的任何数组作为答案。
+返回满足此条件的 任一数组 作为答案。
-
示例:
+示例 1:
-输入:[3,1,2,4] ++输入:nums = [3,1,2,4] 输出:[2,4,3,1] -输出 [4,2,3,1],[2,4,1,3] 和 [4,2,1,3] 也会被接受。 +解释:[4,2,3,1]、[2,4,1,3] 和 [4,2,1,3] 也会被视作正确答案。 ++ +示例 2:
+ ++输入:nums = [0] +输出:[0]
提示:
--
+- -
1 <= A.length <= 5000- -
0 <= A[i] <= 5000
1 <= nums.length <= 50000 <= nums[i] <= 5000给你一个整数数组 nums,和一个整数 k 。
在一个操作中,您可以选择 0 <= i < nums 的任何索引 i 。将 nums[i] 改为 nums[i] + x ,其中 x 是一个范围为 [-k, k] 的整数。对于每个索引 i ,最多 只能 应用 一次 此操作。
在一个操作中,您可以选择 0 <= i < nums.length 的任何索引 i 。将 nums[i] 改为 nums[i] + x ,其中 x 是一个范围为 [-k, k] 的整数。对于每个索引 i ,最多 只能 应用 一次 此操作。
nums 的 分数 是 nums 中最大和最小元素的差值。
在对nums中的每个索引最多应用一次上述操作后,返回 nums 的最低 分数 。
在对 nums 中的每个索引最多应用一次上述操作后,返回 nums 的最低 分数 。
diff --git a/leetcode-cn/problem (Chinese)/根据二叉树创建字符串 [construct-string-from-binary-tree].html b/leetcode-cn/problem (Chinese)/根据二叉树创建字符串 [construct-string-from-binary-tree].html index 37fa8210..165e36e4 100644 --- a/leetcode-cn/problem (Chinese)/根据二叉树创建字符串 [construct-string-from-binary-tree].html +++ b/leetcode-cn/problem (Chinese)/根据二叉树创建字符串 [construct-string-from-binary-tree].html @@ -1,36 +1,33 @@ -
你需要采用前序遍历的方式,将一个二叉树转换成一个由括号和整数组成的字符串。
+给你二叉树的根节点 root ,请你采用前序遍历的方式,将二叉树转化为一个由括号和整数组成的字符串,返回构造出的字符串。
空节点则用一对空括号 "()" 表示。而且你需要省略所有不影响字符串与原始二叉树之间的一对一映射关系的空括号对。
+空节点使用一对空括号对 "()" 表示,转化后需要省略所有不影响字符串与原始二叉树之间的一对一映射关系的空括号对。
示例 1:
++
示例 1:
+
-输入: 二叉树: [1,2,3,4] - 1 - / \ - 2 3 - / - 4 - -输出: "1(2(4))(3)" - -解释: 原本将是“1(2(4)())(3())”, -在你省略所有不必要的空括号对之后, -它将是“1(2(4))(3)”。 +输入:root = [1,2,3,4] +输出:"1(2(4))(3)" +解释:初步转化后得到 "1(2(4)())(3()())" ,但省略所有不必要的空括号对后,字符串应该是"1(2(4))(3)" 。-
示例 2:
- +示例 2:
+
-输入: 二叉树: [1,2,3,null,4] - 1 - / \ - 2 3 - \ - 4 +输入:root = [1,2,3,null,4] +输出:"1(2()(4))(3)" +解释:和第一个示例类似,但是无法省略第一个空括号对,否则会破坏输入与输出一一映射的关系。-输出: "1(2()(4))(3)" +
-解释: 和第一个示例相似, -除了我们不能省略第一个对括号来中断输入和输出之间的一对一映射关系。 - +
提示:
+ +[1, 104]-1000 <= Node.val <= 1000珂珂喜欢吃香蕉。这里有 N 堆香蕉,第 i 堆中有 piles[i] 根香蕉。警卫已经离开了,将在 H 小时后回来。
珂珂喜欢吃香蕉。这里有 n 堆香蕉,第 i 堆中有 piles[i] 根香蕉。警卫已经离开了,将在 h 小时后回来。
珂珂可以决定她吃香蕉的速度 K (单位:根/小时)。每个小时,她将会选择一堆香蕉,从中吃掉 K 根。如果这堆香蕉少于 K 根,她将吃掉这堆的所有香蕉,然后这一小时内不会再吃更多的香蕉。
珂珂可以决定她吃香蕉的速度 k (单位:根/小时)。每个小时,她将会选择一堆香蕉,从中吃掉 k 根。如果这堆香蕉少于 k 根,她将吃掉这堆的所有香蕉,然后这一小时内不会再吃更多的香蕉。
珂珂喜欢慢慢吃,但仍然想在警卫回来前吃掉所有的香蕉。
-返回她可以在 H 小时内吃掉所有香蕉的最小速度 K(K 为整数)。
返回她可以在 h 小时内吃掉所有香蕉的最小速度 k(k 为整数)。
@@ -13,20 +13,23 @@
示例 1:
-输入: piles = [3,6,7,11], H = 8 -输出: 4 ++输入:piles = [3,6,7,11], h = 8 +输出:4-示例 2:
+示例 2:
-输入: piles = [30,11,23,4,20], H = 5 -输出: 30 ++输入:piles = [30,11,23,4,20], h = 5 +输出:30-示例 3:
+示例 3:
-输入: piles = [30,11,23,4,20], H = 6 -输出: 23 ++输入:piles = [30,11,23,4,20], h = 6 +输出:23@@ -34,7 +37,7 @@
提示:
1 <= piles.length <= 10^4piles.length <= H <= 10^91 <= piles[i] <= 10^91 <= piles.length <= 104piles.length <= h <= 1091 <= piles[i] <= 109狒狒喜欢吃香蕉。这里有 N 堆香蕉,第 i 堆中有 piles[i] 根香蕉。警卫已经离开了,将在 H 小时后回来。
狒狒喜欢吃香蕉。这里有 n 堆香蕉,第 i 堆中有 piles[i] 根香蕉。警卫已经离开了,将在 h 小时后回来。
狒狒可以决定她吃香蕉的速度 K (单位:根/小时)。每个小时,她将会选择一堆香蕉,从中吃掉 K 根。如果这堆香蕉少于 K 根,她将吃掉这堆的所有香蕉,然后这一小时内不会再吃更多的香蕉,下一个小时才会开始吃另一堆的香蕉。
狒狒可以决定她吃香蕉的速度 k (单位:根/小时)。每个小时,她将会选择一堆香蕉,从中吃掉 k 根。如果这堆香蕉少于 k 根,她将吃掉这堆的所有香蕉,然后这一小时内不会再吃更多的香蕉,下一个小时才会开始吃另一堆的香蕉。
狒狒喜欢慢慢吃,但仍然想在警卫回来前吃掉所有的香蕉。
-返回她可以在 H 小时内吃掉所有香蕉的最小速度 K(K 为整数)。
返回她可以在 h 小时内吃掉所有香蕉的最小速度 k(k 为整数)。
@@ -14,22 +14,22 @@
示例 1:
-输入: piles = [3,6,7,11], H = 8 -输出: 4 +输入:piles = [3,6,7,11], h = 8 +输出:4-
示例 2:
+示例 2:
-输入: piles = [30,11,23,4,20], H = 5 -输出: 30 +输入:piles = [30,11,23,4,20], h = 5 +输出:30-
示例 3:
+示例 3:
-输入: piles = [30,11,23,4,20], H = 6 -输出: 23 +输入:piles = [30,11,23,4,20], h = 6 +输出:23
@@ -37,11 +37,11 @@
提示:
1 <= piles.length <= 10^4piles.length <= H <= 10^91 <= piles[i] <= 10^91 <= piles.length <= 104piles.length <= h <= 1091 <= piles[i] <= 109-
注意:本题与主站 875 题相同: https://leetcode-cn.com/problems/koko-eating-bananas/
+注意:本题与主站 875 题相同: https://leetcode-cn.com/problems/koko-eating-bananas/
diff --git a/leetcode-cn/problem (Chinese)/秋叶收藏集 [UlBDOe].md b/leetcode-cn/problem (Chinese)/秋叶收藏集 [UlBDOe].md index 852528b1..43deae0b 100644 --- a/leetcode-cn/problem (Chinese)/秋叶收藏集 [UlBDOe].md +++ b/leetcode-cn/problem (Chinese)/秋叶收藏集 [UlBDOe].md @@ -1,20 +1,20 @@ -小扣出去秋游,途中收集了一些红叶和黄叶,他利用这些叶子初步整理了一份秋叶收藏集 `leaves`, 字符串 `leaves` 仅包含小写字符 `r` 和 `y`, 其中字符 `r` 表示一片红叶,字符 `y` 表示一片黄叶。 -出于美观整齐的考虑,小扣想要将收藏集中树叶的排列调整成「红、黄、红」三部分。每部分树叶数量可以不相等,但均需大于等于 1。每次调整操作,小扣可以将一片红叶替换成黄叶或者将一片黄叶替换成红叶。请问小扣最少需要多少次调整操作才能将秋叶收藏集调整完毕。 - -**示例 1:** ->输入:`leaves = "rrryyyrryyyrr"` -> ->输出:`2` -> ->解释:调整两次,将中间的两片红叶替换成黄叶,得到 "rrryyyyyyyyrr" - -**示例 2:** ->输入:`leaves = "ryr"` -> ->输出:`0` -> ->解释:已符合要求,不需要额外操作 - -**提示:** -- `3 <= leaves.length <= 10^5` +小扣出去秋游,途中收集了一些红叶和黄叶,他利用这些叶子初步整理了一份秋叶收藏集 `leaves`, 字符串 `leaves` 仅包含小写字符 `r` 和 `y`, 其中字符 `r` 表示一片红叶,字符 `y` 表示一片黄叶。 +出于美观整齐的考虑,小扣想要将收藏集中树叶的排列调整成「红、黄、红」三部分。每部分树叶数量可以不相等,但均需大于等于 1。每次调整操作,小扣可以将一片红叶替换成黄叶或者将一片黄叶替换成红叶。请问小扣最少需要多少次调整操作才能将秋叶收藏集调整完毕。 + +**示例 1:** +>输入:`leaves = "rrryyyrryyyrr"` +> +>输出:`2` +> +>解释:调整两次,将中间的两片红叶替换成黄叶,得到 "rrryyyyyyyyrr" + +**示例 2:** +>输入:`leaves = "ryr"` +> +>输出:`0` +> +>解释:已符合要求,不需要额外操作 + +**提示:** +- `3 <= leaves.length <= 10^5` - `leaves` 中只包含字符 `'r'` 和字符 `'y'` \ No newline at end of file diff --git a/leetcode-cn/problem (Chinese)/追逐游戏 [Za25hA].md b/leetcode-cn/problem (Chinese)/追逐游戏 [Za25hA].md index 5f01c820..b90d87ef 100644 --- a/leetcode-cn/problem (Chinese)/追逐游戏 [Za25hA].md +++ b/leetcode-cn/problem (Chinese)/追逐游戏 [Za25hA].md @@ -1,39 +1,39 @@ -秋游中的小力和小扣设计了一个追逐游戏。他们选了秋日市集景区中的 N 个景点,景点编号为 1~N。此外,他们还选择了 N 条小路,满足任意两个景点之间都可以通过小路互相到达,且不存在两条连接景点相同的小路。整个游戏场景可视作一个无向连通图,记作二维数组 `edges`,数组中以 `[a,b]` 形式表示景点 a 与景点 b 之间有一条小路连通。 - -小力和小扣只能沿景点间的小路移动。小力的目标是在最快时间内追到小扣,小扣的目标是尽可能延后被小力追到的时间。游戏开始前,两人分别站在两个不同的景点 `startA` 和 `startB`。每一回合,小力先行动,小扣观察到小力的行动后再行动。小力和小扣在每回合可选择以下行动之一: -- 移动至相邻景点 -- 留在原地 - -如果小力追到小扣(即两人于某一时刻出现在同一位置),则游戏结束。若小力可以追到小扣,请返回最少需要多少回合;若小力无法追到小扣,请返回 -1。 - -注意:小力和小扣一定会采取最优移动策略。 - -**示例 1:** ->输入:`edges = [[1,2],[2,3],[3,4],[4,1],[2,5],[5,6]], startA = 3, startB = 5` -> ->输出:`3` -> ->解释: ->{:height="250px"} -> ->第一回合,小力移动至 2 号点,小扣观察到小力的行动后移动至 6 号点; ->第二回合,小力移动至 5 号点,小扣无法移动,留在原地; ->第三回合,小力移动至 6 号点,小力追到小扣。返回 3。 - - -**示例 2:** ->输入:`edges = [[1,2],[2,3],[3,4],[4,1]], startA = 1, startB = 3` -> ->输出:`-1` -> ->解释: ->{:height="250px"} -> ->小力如果不动,则小扣也不动;否则小扣移动到小力的对角线位置。这样小力无法追到小扣。 - -**提示:** -- `edges` 的长度等于图中节点个数 -- `3 <= edges.length <= 10^5` -- `1 <= edges[i][0], edges[i][1] <= edges.length 且 edges[i][0] != edges[i][1]` -- `1 <= startA, startB <= edges.length 且 startA != startB` - +秋游中的小力和小扣设计了一个追逐游戏。他们选了秋日市集景区中的 N 个景点,景点编号为 1~N。此外,他们还选择了 N 条小路,满足任意两个景点之间都可以通过小路互相到达,且不存在两条连接景点相同的小路。整个游戏场景可视作一个无向连通图,记作二维数组 `edges`,数组中以 `[a,b]` 形式表示景点 a 与景点 b 之间有一条小路连通。 + +小力和小扣只能沿景点间的小路移动。小力的目标是在最快时间内追到小扣,小扣的目标是尽可能延后被小力追到的时间。游戏开始前,两人分别站在两个不同的景点 `startA` 和 `startB`。每一回合,小力先行动,小扣观察到小力的行动后再行动。小力和小扣在每回合可选择以下行动之一: +- 移动至相邻景点 +- 留在原地 + +如果小力追到小扣(即两人于某一时刻出现在同一位置),则游戏结束。若小力可以追到小扣,请返回最少需要多少回合;若小力无法追到小扣,请返回 -1。 + +注意:小力和小扣一定会采取最优移动策略。 + +**示例 1:** +>输入:`edges = [[1,2],[2,3],[3,4],[4,1],[2,5],[5,6]], startA = 3, startB = 5` +> +>输出:`3` +> +>解释: +>{:height="250px"} +> +>第一回合,小力移动至 2 号点,小扣观察到小力的行动后移动至 6 号点; +>第二回合,小力移动至 5 号点,小扣无法移动,留在原地; +>第三回合,小力移动至 6 号点,小力追到小扣。返回 3。 + + +**示例 2:** +>输入:`edges = [[1,2],[2,3],[3,4],[4,1]], startA = 1, startB = 3` +> +>输出:`-1` +> +>解释: +>{:height="250px"} +> +>小力如果不动,则小扣也不动;否则小扣移动到小力的对角线位置。这样小力无法追到小扣。 + +**提示:** +- `edges` 的长度等于图中节点个数 +- `3 <= edges.length <= 10^5` +- `1 <= edges[i][0], edges[i][1] <= edges.length 且 edges[i][0] != edges[i][1]` +- `1 <= startA, startB <= edges.length 且 startA != startB` + diff --git a/leetcode-cn/problem (Chinese)/速算机器人 [nGK0Fy].md b/leetcode-cn/problem (Chinese)/速算机器人 [nGK0Fy].md index 96e1cdf2..b795e186 100644 --- a/leetcode-cn/problem (Chinese)/速算机器人 [nGK0Fy].md +++ b/leetcode-cn/problem (Chinese)/速算机器人 [nGK0Fy].md @@ -1,21 +1,21 @@ -小扣在秋日市集发现了一款速算机器人。店家对机器人说出两个数字(记作 `x` 和 `y`),请小扣说出计算指令: -- `"A"` 运算:使 `x = 2 * x + y`; -- `"B"` 运算:使 `y = 2 * y + x`。 - -在本次游戏中,店家说出的数字为 `x = 1` 和 `y = 0`,小扣说出的计算指令记作仅由大写字母 `A`、`B` 组成的字符串 `s`,字符串中字符的顺序表示计算顺序,请返回最终 `x` 与 `y` 的和为多少。 - -**示例 1:** ->输入:`s = "AB"` -> ->输出:`4` -> ->解释: ->经过一次 A 运算后,x = 2, y = 0。 ->再经过一次 B 运算,x = 2, y = 2。 ->最终 x 与 y 之和为 4。 - -**提示:** -- `0 <= s.length <= 10` -- `s` 由 `'A'` 和 `'B'` 组成 - - +小扣在秋日市集发现了一款速算机器人。店家对机器人说出两个数字(记作 `x` 和 `y`),请小扣说出计算指令: +- `"A"` 运算:使 `x = 2 * x + y`; +- `"B"` 运算:使 `y = 2 * y + x`。 + +在本次游戏中,店家说出的数字为 `x = 1` 和 `y = 0`,小扣说出的计算指令记作仅由大写字母 `A`、`B` 组成的字符串 `s`,字符串中字符的顺序表示计算顺序,请返回最终 `x` 与 `y` 的和为多少。 + +**示例 1:** +>输入:`s = "AB"` +> +>输出:`4` +> +>解释: +>经过一次 A 运算后,x = 2, y = 0。 +>再经过一次 B 运算,x = 2, y = 2。 +>最终 x 与 y 之和为 4。 + +**提示:** +- `0 <= s.length <= 10` +- `s` 由 `'A'` 和 `'B'` 组成 + + diff --git a/leetcode-cn/problem (Chinese)/销售员 [sales-person].html b/leetcode-cn/problem (Chinese)/销售员 [sales-person].html index 4a05fa9a..a40382c5 100644 --- a/leetcode-cn/problem (Chinese)/销售员 [sales-person].html +++ b/leetcode-cn/problem (Chinese)/销售员 [sales-person].html @@ -10,8 +10,8 @@ | commission_rate | int | | hire_date | date | +-----------------+---------+ -Sales_id是该表的主键列。 -该表的每一行都显示了销售人员的姓名和ID,以及他们的工资、佣金率和雇佣日期。 +sales_id 是该表的主键列。 +该表的每一行都显示了销售人员的姓名和 ID ,以及他们的工资、佣金率和雇佣日期。@@ -26,8 +26,8 @@ Sales_id是该表的主键列。 | name | varchar | | city | varchar | +-------------+---------+ -Com_id是该表的主键列。 -该表的每一行都表示公司的名称和ID,以及公司所在的城市。 +com_id 是该表的主键列。 +该表的每一行都表示公司的名称和 ID ,以及公司所在的城市。
@@ -44,10 +44,10 @@ Com_id是该表的主键列。 | sales_id | int | | amount | int | +-------------+------+ -Order_id是该表的主键列。 -com_id是Company表中com_id的外键。 -sales_id是来自销售员表com_id的外键。 -该表的每一行包含一个订单的信息。这包括公司的ID、销售人员的ID、订单日期和支付的金额。 +order_id 是该表的主键列。 +com_id 是 Company 表中 com_id 的外键。 +sales_id 是来自销售员表 sales_id 的外键。 +该表的每一行包含一个订单的信息。这包括公司的 ID 、销售人员的 ID 、订单日期和支付的金额。
@@ -60,10 +60,10 @@ sales_id是来自销售员表com_id的外键。
-
示例 1:
+示例:
-输入: +输入: SalesPerson 表: +----------+------+--------+-----------------+------------+ | sales_id | name | salary | commission_rate | hire_date | @@ -92,7 +92,7 @@ Orders 表: | 3 | 3/1/2014 | 1 | 1 | 50000 | | 4 | 4/1/2014 | 1 | 4 | 25000 | +----------+------------+--------+----------+--------+ -输出: +输出: +------+ | name | +------+ @@ -100,6 +100,6 @@ Orders 表: | Mark | | Alex | +------+ -解释: +解释: 根据表diff --git a/leetcode-cn/problem (English)/ 字母与数字(English) [find-longest-subarray-lcci].html b/leetcode-cn/problem (English)/ 字母与数字(English) [find-longest-subarray-lcci].html index 2f1775da..47f467b9 100644 --- a/leetcode-cn/problem (English)/ 字母与数字(English) [find-longest-subarray-lcci].html +++ b/leetcode-cn/problem (English)/ 字母与数字(English) [find-longest-subarray-lcci].html @@ -1,25 +1,25 @@ -orders中的订单 '3' 和 '4' ,容易看出只有 'John' 和 'Pam' 两个销售员曾经向公司 'RED' 销售过。 所以我们需要输出表salesperson中所有其他人的名字。
Given an array filled with letters and numbers, find the longest subarray with an equal number of letters and numbers.
- -Return the subarray. If there are more than one answer, return the one which has the smallest index of its left endpoint. If there is no answer, return an empty arrary.
- -Example 1:
- --Input: ["A","1","B","C","D","2","3","4","E","5","F","G","6","7","H","I","J","K","L","M"] - -Output: ["A","1","B","C","D","2","3","4","E","5","F","G","6","7"] -- -
Example 2:
- --Input: ["A","A"] - -Output: [] -- -
Note:
- -array.length <= 100000Given an array filled with letters and numbers, find the longest subarray with an equal number of letters and numbers.
+ +Return the subarray. If there are more than one answer, return the one which has the smallest index of its left endpoint. If there is no answer, return an empty arrary.
+ +Example 1:
+ ++Input: ["A","1","B","C","D","2","3","4","E","5","F","G","6","7","H","I","J","K","L","M"] + +Output: ["A","1","B","C","D","2","3","4","E","5","F","G","6","7"] ++ +
Example 2:
+ ++Input: ["A","A"] + +Output: [] ++ +
Note:
+ +array.length <= 100000Write a method to count the number of 2s that appear in all the numbers between 0 and n (inclusive).
- -Example:
- --Input: 25 -Output: 9 -Explanation: (2, 12, 20, 21, 22, 23, 24, 25)(Note that 22 counts for two 2s.)- -
Note:
- -n <= 10^9Write a method to count the number of 2s that appear in all the numbers between 0 and n (inclusive).
+ +Example:
+ ++Input: 25 +Output: 9 +Explanation: (2, 12, 20, 21, 22, 23, 24, 25)(Note that 22 counts for two 2s.)+ +
Note:
+ +n <= 10^9The data structure TreeNode is used for binary tree, but it can also used to represent a single linked list (where left is null, and right is the next node in the list). Implement a method to convert a binary search tree (implemented with TreeNode) into a single linked list. The values should be kept in order and the operation should be performed in place (that is, on the original data structure).
Return the head node of the linked list after converting.
- -Note: This problem is slightly different from the original one in the book.
- -- -
Example:
- --Input: [4,2,5,1,3,null,6,0] -Output: [0,null,1,null,2,null,3,null,4,null,5,null,6] -- -
Note:
- -The data structure TreeNode is used for binary tree, but it can also used to represent a single linked list (where left is null, and right is the next node in the list). Implement a method to convert a binary search tree (implemented with TreeNode) into a single linked list. The values should be kept in order and the operation should be performed in place (that is, on the original data structure).
Return the head node of the linked list after converting.
+ +Note: This problem is slightly different from the original one in the book.
+ ++ +
Example:
+ ++Input: [4,2,5,1,3,null,6,0] +Output: [0,null,1,null,2,null,3,null,4,null,5,null,6] ++ +
Note:
+ +Design and build a "least recently used" cache, which evicts the least recently used item. The cache should map from keys to values (allowing you to insert and retrieve a value associated with a particular key) and be initialized with a max size. When it is full, it should evict the least recently used item.
- -You should implement following operations: get and put.
Get a value by key: get(key) - If key is in the cache, return the value, otherwise return -1.
-Write a key-value pair to the cache: put(key, value) - If the key is not in the cache, then write its value to the cache. Evict the least recently used item before writing if necessary.
Example:
- --LRUCache cache = new LRUCache( 2 /* capacity */ ); - -cache.put(1, 1); -cache.put(2, 2); -cache.get(1); // returns 1 -cache.put(3, 3); // evicts key 2 -cache.get(2); // returns -1 (not found) -cache.put(4, 4); // evicts key 1 -cache.get(1); // returns -1 (not found) -cache.get(3); // returns 3 -cache.get(4); // returns 4 -+
Design and build a "least recently used" cache, which evicts the least recently used item. The cache should map from keys to values (allowing you to insert and retrieve a value associated with a particular key) and be initialized with a max size. When it is full, it should evict the least recently used item.
+ +You should implement following operations: get and put.
Get a value by key: get(key) - If key is in the cache, return the value, otherwise return -1.
+Write a key-value pair to the cache: put(key, value) - If the key is not in the cache, then write its value to the cache. Evict the least recently used item before writing if necessary.
Example:
+ ++LRUCache cache = new LRUCache( 2 /* capacity */ ); + +cache.put(1, 1); +cache.put(2, 2); +cache.get(1); // returns 1 +cache.put(3, 3); // evicts key 2 +cache.get(2); // returns -1 (not found) +cache.put(4, 4); // evicts key 1 +cache.get(1); // returns -1 (not found) +cache.get(3); // returns 3 +cache.get(4); // returns 4 +diff --git a/leetcode-cn/problem (English)/T9键盘(English) [t9-lcci].html b/leetcode-cn/problem (English)/T9键盘(English) [t9-lcci].html index 48fca76b..32447b16 100644 --- a/leetcode-cn/problem (English)/T9键盘(English) [t9-lcci].html +++ b/leetcode-cn/problem (English)/T9键盘(English) [t9-lcci].html @@ -1,25 +1,25 @@ -
On old cell phones, users typed on a numeric keypad and the phone would provide a list of words that matched these numbers. Each digit mapped to a set of 0 - 4 letters. Implement an algorithm to return a list of matching words, given a sequence of digits. You are provided a list of valid words. The mapping is shown in the diagram below:
- -
Example 1:
- --Input: num = "8733", words = ["tree", "used"] -Output: ["tree", "used"] -- -
Example 2:
- --Input: num = "2", words = ["a", "b", "c", "d"] -Output: ["a", "b", "c"]- -
Note:
- -num.length <= 1000words.length <= 500words[i].length == num.lengthThere are no number 0 and 1 in num.On old cell phones, users typed on a numeric keypad and the phone would provide a list of words that matched these numbers. Each digit mapped to a set of 0 - 4 letters. Implement an algorithm to return a list of matching words, given a sequence of digits. You are provided a list of valid words. The mapping is shown in the diagram below:
+ +
Example 1:
+ ++Input: num = "8733", words = ["tree", "used"] +Output: ["tree", "used"] ++ +
Example 2:
+ ++Input: num = "2", words = ["a", "b", "c", "d"] +Output: ["a", "b", "c"]+ +
Note:
+ +num.length <= 1000words.length <= 500words[i].length == num.lengthThere are no number 0 and 1 in num.Write a method to replace all spaces in a string with '%20'. You may assume that the string has sufficient space at the end to hold the additional characters,and that you are given the "true" length of the string. (Note: If implementing in Java,please use a character array so that you can perform this operation in place.)
- -Example 1:
- --Input: "Mr John Smith ", 13 -Output: "Mr%20John%20Smith" -- -
Example 2:
- --Input: " ", 5 -Output: "%20%20%20%20%20" -- -
- -
Note:
- -0 <= S.length <= 500000Write a method to replace all spaces in a string with '%20'. You may assume that the string has sufficient space at the end to hold the additional characters,and that you are given the "true" length of the string. (Note: If implementing in Java,please use a character array so that you can perform this operation in place.)
+ +Example 1:
+ ++Input: "Mr John Smith ", 13 +Output: "Mr%20John%20Smith" ++ +
Example 2:
+ ++Input: " ", 5 +Output: "%20%20%20%20%20" ++ +
+ +
Note:
+ +0 <= S.length <= 500000Given an integer array data representing the data, return whether it is a valid UTF-8 encoding.
Given an integer array data representing the data, return whether it is a valid UTF-8 encoding (i.e. it translates to a sequence of valid UTF-8 encoded characters).
A character in UTF8 can be from 1 to 4 bytes long, subjected to the following rules:
+A character in UTF8 can be from 1 to 4 bytes long, subjected to the following rules:
0, followed by its Unicode code.This is how the UTF-8 encoding would work:
- Char. number range | UTF-8 octet sequence
- (hexadecimal) | (binary)
- --------------------+---------------------------------------------
- 0000 0000-0000 007F | 0xxxxxxx
- 0000 0080-0000 07FF | 110xxxxx 10xxxxxx
- 0000 0800-0000 FFFF | 1110xxxx 10xxxxxx 10xxxxxx
- 0001 0000-0010 FFFF | 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx
+ Number of Bytes | UTF-8 Octet Sequence
+ | (binary)
+ --------------------+-----------------------------------------
+ 1 | 0xxxxxxx
+ 2 | 110xxxxx 10xxxxxx
+ 3 | 1110xxxx 10xxxxxx 10xxxxxx
+ 4 | 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx
-Note: The input is an array of integers. Only the least significant 8 bits of each integer is used to store the data. This means each integer represents only 1 byte of data.
+x denotes a bit in the binary form of a byte that may be either 0 or 1.
Note: The input is an array of integers. Only the least significant 8 bits of each integer is used to store the data. This means each integer represents only 1 byte of data.
Example 1:
diff --git a/leetcode-cn/problem (English)/一次编辑(English) [one-away-lcci].html b/leetcode-cn/problem (English)/一次编辑(English) [one-away-lcci].html index 922e1d1b..3bb1457f 100644 --- a/leetcode-cn/problem (English)/一次编辑(English) [one-away-lcci].html +++ b/leetcode-cn/problem (English)/一次编辑(English) [one-away-lcci].html @@ -1,21 +1,21 @@ -There are three types of edits that can be performed on strings: insert a character, remove a character, or replace a character. Given two strings, write a function to check if they are one edit (or zero edits) away.
- -- -
Example 1:
- --Input: -first = "pale" -second = "ple" -Output: True -- -
Example 2:
- --Input: -first = "pales" -second = "pal" -Output: False -+
There are three types of edits that can be performed on strings: insert a character, remove a character, or replace a character. Given two strings, write a function to check if they are one edit (or zero edits) away.
+ ++ +
Example 1:
+ ++Input: +first = "pale" +second = "ple" +Output: True ++ +
Example 2:
+ ++Input: +first = "pales" +second = "pal" +Output: False +diff --git a/leetcode-cn/problem (English)/三合一(English) [three-in-one-lcci].html b/leetcode-cn/problem (English)/三合一(English) [three-in-one-lcci].html index 52a2a4d4..377e82e1 100644 --- a/leetcode-cn/problem (English)/三合一(English) [three-in-one-lcci].html +++ b/leetcode-cn/problem (English)/三合一(English) [three-in-one-lcci].html @@ -1,26 +1,26 @@ -
Describe how you could use a single array to implement three stacks.
- -You should implement push(stackNum, value)、pop(stackNum)、isEmpty(stackNum)、peek(stackNum) methods. stackNum is the index of the stack. value is the value that pushed to the stack.
The constructor requires a stackSize parameter, which represents the size of each stack.
Example1:
- -- Input: -["TripleInOne", "push", "push", "pop", "pop", "pop", "isEmpty"] -[[1], [0, 1], [0, 2], [0], [0], [0], [0]] - Output: -[null, null, null, 1, -1, -1, true] -Explanation: When the stack is empty, `pop, peek` return -1. When the stack is full, `push` does nothing. -- -
Example2:
- -- Input: -["TripleInOne", "push", "push", "push", "pop", "pop", "pop", "peek"] -[[2], [0, 1], [0, 2], [0, 3], [0], [0], [0], [0]] - Output: -[null, null, null, null, 2, 1, -1, -1] -+
Describe how you could use a single array to implement three stacks.
+ +You should implement push(stackNum, value)、pop(stackNum)、isEmpty(stackNum)、peek(stackNum) methods. stackNum is the index of the stack. value is the value that pushed to the stack.
The constructor requires a stackSize parameter, which represents the size of each stack.
Example1:
+ ++ Input: +["TripleInOne", "push", "push", "pop", "pop", "pop", "isEmpty"] +[[1], [0, 1], [0, 2], [0], [0], [0], [0]] + Output: +[null, null, null, 1, -1, -1, true] +Explanation: When the stack is empty, `pop, peek` return -1. When the stack is full, `push` does nothing. ++ +
Example2:
+ ++ Input: +["TripleInOne", "push", "push", "push", "pop", "pop", "pop", "peek"] +[[2], [0, 1], [0, 2], [0, 3], [0], [0], [0], [0]] + Output: +[null, null, null, null, 2, 1, -1, -1] +diff --git a/leetcode-cn/problem (English)/三数之和的多种可能(English) [3sum-with-multiplicity].html b/leetcode-cn/problem (English)/三数之和的多种可能(English) [3sum-with-multiplicity].html index 3677500c..12d05a55 100644 --- a/leetcode-cn/problem (English)/三数之和的多种可能(English) [3sum-with-multiplicity].html +++ b/leetcode-cn/problem (English)/三数之和的多种可能(English) [3sum-with-multiplicity].html @@ -27,6 +27,14 @@ We choose one 1 from [1,1] in 2 ways, and two 2s from [2,2,2,2] in 6 ways. +
Example 3:
+ ++Input: arr = [2,1,3], target = 6 +Output: 1 +Explanation: (1, 2, 3) occured one time in the array so we return 1. ++
Constraints:
diff --git a/leetcode-cn/problem (English)/三步问题(English) [three-steps-problem-lcci].html b/leetcode-cn/problem (English)/三步问题(English) [three-steps-problem-lcci].html index b260149d..62d8e025 100644 --- a/leetcode-cn/problem (English)/三步问题(English) [three-steps-problem-lcci].html +++ b/leetcode-cn/problem (English)/三步问题(English) [three-steps-problem-lcci].html @@ -1,21 +1,21 @@ -A child is running up a staircase with n steps and can hop either 1 step, 2 steps, or 3 steps at a time. Implement a method to count how many possible ways the child can run up the stairs. The result may be large, so return it modulo 1000000007.
- -Example1:
- -- Input: n = 3 - Output: 4 -- -
Example2:
- -- Input: n = 5 - Output: 13 -- -
Note:
- -1 <= n <= 1000000A child is running up a staircase with n steps and can hop either 1 step, 2 steps, or 3 steps at a time. Implement a method to count how many possible ways the child can run up the stairs. The result may be large, so return it modulo 1000000007.
+ +Example1:
+ ++ Input: n = 3 + Output: 4 ++ +
Example2:
+ ++ Input: n = 5 + Output: 13 ++ +
Note:
+ +1 <= n <= 1000000Given a positive integer, print the next smallest and the next largest number that have the same number of 1 bits in their binary representation.
- -Example1:
- -- Input: num = 2 (0b10) - Output: [4, 1] ([0b100, 0b1]) -- -
Example2:
- -- Input: num = 1 - Output: [2, -1] -- -
Note:
- -1 <= num <= 2147483647Given a positive integer, print the next smallest and the next largest number that have the same number of 1 bits in their binary representation.
+ +Example1:
+ ++ Input: num = 2 (0b10) + Output: [4, 1] ([0b100, 0b1]) ++ +
Example2:
+ ++ Input: num = 1 + Output: [2, -1] ++ +
Note:
+ +1 <= num <= 2147483647A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).
You are given an m x n integer array grid. There is a robot initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner (i.e., grid[m-1][n-1]). The robot can only move either down or right at any point in time.
The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below).
+An obstacle and space are marked as 1 or 0 respectively in grid. A path that the robot takes cannot include any square that is an obstacle.
Now consider if some obstacles are added to the grids. How many unique paths would there be?
+Return the number of possible unique paths that the robot can take to reach the bottom-right corner.
-An obstacle and space is marked as 1 and 0 respectively in the grid.
The testcases are generated so that the answer will be less than or equal to 2 * 109.
Example 1:
@@ -29,8 +29,8 @@ There are two ways to reach the bottom-right corner:Constraints:
m == obstacleGrid.lengthn == obstacleGrid[i].lengthm == obstacleGrid.lengthn == obstacleGrid[i].length1 <= m, n <= 100obstacleGrid[i][j] is 0 or 1.Write a function that adds two numbers. You should not use + or any arithmetic operators.
- -Example:
- --Input: a = 1, b = 1 -Output: 2- -
- -
Note:
- -a and b may be 0 or negative.Write a function that adds two numbers. You should not use + or any arithmetic operators.
+ +Example:
+ ++Input: a = 1, b = 1 +Output: 2+ +
+ +
Note:
+ +a and b may be 0 or negative.The product difference between two pairs (a, b) and (c, d) is defined as (a * b) - (c * d).
(5, 6) and (2, 7) is (5 * 6) - (2 * 7) = 16.Given an integer array nums, choose four distinct indices w, x, y, and z such that the product difference between pairs (nums[w], nums[x]) and (nums[y], nums[z]) is maximized.
Return the maximum such product difference.
- --
Example 1:
- --Input: nums = [5,6,2,7,4] -Output: 34 -Explanation: We can choose indices 1 and 3 for the first pair (6, 7) and indices 2 and 4 for the second pair (2, 4). -The product difference is (6 * 7) - (2 * 4) = 34. -- -
Example 2:
- --Input: nums = [4,2,5,9,7,4,8] -Output: 64 -Explanation: We can choose indices 3 and 6 for the first pair (9, 8) and indices 1 and 5 for the second pair (2, 4). -The product difference is (9 * 8) - (2 * 4) = 64. -- -
-
Constraints:
- -4 <= nums.length <= 1041 <= nums[i] <= 104The product difference between two pairs (a, b) and (c, d) is defined as (a * b) - (c * d).
(5, 6) and (2, 7) is (5 * 6) - (2 * 7) = 16.Given an integer array nums, choose four distinct indices w, x, y, and z such that the product difference between pairs (nums[w], nums[x]) and (nums[y], nums[z]) is maximized.
Return the maximum such product difference.
+ ++
Example 1:
+ ++Input: nums = [5,6,2,7,4] +Output: 34 +Explanation: We can choose indices 1 and 3 for the first pair (6, 7) and indices 2 and 4 for the second pair (2, 4). +The product difference is (6 * 7) - (2 * 4) = 34. ++ +
Example 2:
+ ++Input: nums = [4,2,5,9,7,4,8] +Output: 64 +Explanation: We can choose indices 3 and 6 for the first pair (9, 8) and indices 1 and 5 for the second pair (2, 4). +The product difference is (9 * 8) - (2 * 4) = 64. ++ +
+
Constraints:
+ +4 <= nums.length <= 1041 <= nums[i] <= 104A majority element is an element that makes up more than half of the items in an array. Given a integers array, find the majority element. If there is no majority element, return -1. Do this in O(N) time and O(1) space.
- -Example 1:
- --Input: [1,2,5,9,5,9,5,5,5] -Output: 5- -
- -
Example 2:
- --Input: [3,2] -Output: -1- -
- -
Example 3:
- --Input: [2,2,1,1,1,2,2] -Output: 2 -+
A majority element is an element that makes up more than half of the items in an array. Given a integers array, find the majority element. If there is no majority element, return -1. Do this in O(N) time and O(1) space.
+ +Example 1:
+ ++Input: [1,2,5,9,5,9,5,5,5] +Output: 5+ +
+ +
Example 2:
+ ++Input: [3,2] +Output: -1+ +
+ +
Example 3:
+ ++Input: [2,2,1,1,1,2,2] +Output: 2 +diff --git a/leetcode-cn/problem (English)/二叉搜索树序列(English) [bst-sequences-lcci].html b/leetcode-cn/problem (English)/二叉搜索树序列(English) [bst-sequences-lcci].html index c44eb16c..06ae1b8e 100644 --- a/leetcode-cn/problem (English)/二叉搜索树序列(English) [bst-sequences-lcci].html +++ b/leetcode-cn/problem (English)/二叉搜索树序列(English) [bst-sequences-lcci].html @@ -1,19 +1,19 @@ -
A binary search tree was created by traversing through an array from left to right and inserting each element. Given a binary search tree with distinct elements, print all possible arrays that could have led to this tree.
- -Example:
-Given the following tree:
- 2 - / \ - 1 3 -- -
Output:
- --[ - [2,1,3], - [2,3,1] -] -+
A binary search tree was created by traversing through an array from left to right and inserting each element. Given a binary search tree with distinct elements, print all possible arrays that could have led to this tree.
+ +Example:
+Given the following tree:
+ 2 + / \ + 1 3 ++ +
Output:
+ ++[ + [2,1,3], + [2,3,1] +] +diff --git a/leetcode-cn/problem (English)/二叉搜索树的最近公共祖先(English) [er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof].html b/leetcode-cn/problem (English)/二叉搜索树的最近公共祖先(English) [er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof].html index 579f7fd7..5c5502aa 100644 --- a/leetcode-cn/problem (English)/二叉搜索树的最近公共祖先(English) [er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof].html +++ b/leetcode-cn/problem (English)/二叉搜索树的最近公共祖先(English) [er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof].html @@ -1 +1 @@ -
English description is not available for the problem. Please switch to Chinese.
+English description is not available for the problem. Please switch to Chinese.
diff --git a/leetcode-cn/problem (English)/二叉树的最近公共祖先(English) [er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof].html b/leetcode-cn/problem (English)/二叉树的最近公共祖先(English) [er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof].html index 579f7fd7..5c5502aa 100644 --- a/leetcode-cn/problem (English)/二叉树的最近公共祖先(English) [er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof].html +++ b/leetcode-cn/problem (English)/二叉树的最近公共祖先(English) [er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof].html @@ -1 +1 @@ -English description is not available for the problem. Please switch to Chinese.
+English description is not available for the problem. Please switch to Chinese.
diff --git a/leetcode-cn/problem (English)/二叉树的深度(English) [er-cha-shu-de-shen-du-lcof].html b/leetcode-cn/problem (English)/二叉树的深度(English) [er-cha-shu-de-shen-du-lcof].html index 579f7fd7..5c5502aa 100644 --- a/leetcode-cn/problem (English)/二叉树的深度(English) [er-cha-shu-de-shen-du-lcof].html +++ b/leetcode-cn/problem (English)/二叉树的深度(English) [er-cha-shu-de-shen-du-lcof].html @@ -1 +1 @@ -English description is not available for the problem. Please switch to Chinese.
+English description is not available for the problem. Please switch to Chinese.
diff --git a/leetcode-cn/problem (English)/二维数组中的查找(English) [er-wei-shu-zu-zhong-de-cha-zhao-lcof].html b/leetcode-cn/problem (English)/二维数组中的查找(English) [er-wei-shu-zu-zhong-de-cha-zhao-lcof].html index 579f7fd7..5c5502aa 100644 --- a/leetcode-cn/problem (English)/二维数组中的查找(English) [er-wei-shu-zu-zhong-de-cha-zhao-lcof].html +++ b/leetcode-cn/problem (English)/二维数组中的查找(English) [er-wei-shu-zu-zhong-de-cha-zhao-lcof].html @@ -1 +1 @@ -English description is not available for the problem. Please switch to Chinese.
+English description is not available for the problem. Please switch to Chinese.
diff --git a/leetcode-cn/problem (English)/二进制数转字符串(English) [bianry-number-to-string-lcci].html b/leetcode-cn/problem (English)/二进制数转字符串(English) [bianry-number-to-string-lcci].html index 69c236f3..975363d4 100644 --- a/leetcode-cn/problem (English)/二进制数转字符串(English) [bianry-number-to-string-lcci].html +++ b/leetcode-cn/problem (English)/二进制数转字符串(English) [bianry-number-to-string-lcci].html @@ -1,22 +1,23 @@ -Given a real number between 0 and 1 (e.g., 0.72) that is passed in as a double, print the binary representation. If the number cannot be represented accurately in binary with at most 32 characters, print "ERROR".
- -Example1:
- -- Input: 0.625 - Output: "0.101" -- -
Example2:
- -- Input: 0.1 - Output: "ERROR" - Note: 0.1 cannot be represented accurately in binary. -- -
Note:
- -Given a real number between 0 and 1 (e.g., 0.72) that is passed in as a double, print the binary representation. If the number cannot be represented accurately in binary with at most 32 characters, print "ERROR".
+ +Example1:
+ ++ Input: 0.625 + Output: "0.101" ++ +
Example2:
+ ++ Input: 0.1 + Output: "ERROR" + Note: 0.1 cannot be represented accurately in binary. ++ +
Note:
+ +num is at most 6 digitsDesign an algorithm to figure out if someone has won a game of tic-tac-toe. Input is a string array of size N x N, including characters " ", "X" and "O", where " " represents a empty grid.
- -The rules of tic-tac-toe are as follows:
- -If there is any winner, return the character that the winner used. If there's a draw, return "Draw". If the game doesn't end and there is no winner, return "Pending".
- -Example 1:
- --Input: board = ["O X"," XO","X O"] -Output: "X" -- -
Example 2:
- --Input: board = ["OOX","XXO","OXO"] -Output: "Draw" -Explanation: no player wins and no empty grid left -- -
Example 3:
- --Input: board = ["OOX","XXO","OX "] -Output: "Pending" -Explanation: no player wins but there is still a empty grid -- -
Note:
- -1 <= board.length == board[i].length <= 100Design an algorithm to figure out if someone has won a game of tic-tac-toe. Input is a string array of size N x N, including characters " ", "X" and "O", where " " represents a empty grid.
+ +The rules of tic-tac-toe are as follows:
+ +If there is any winner, return the character that the winner used. If there's a draw, return "Draw". If the game doesn't end and there is no winner, return "Pending".
+ +Example 1:
+ ++Input: board = ["O X"," XO","X O"] +Output: "X" ++ +
Example 2:
+ ++Input: board = ["OOX","XXO","OXO"] +Output: "Draw" +Explanation: no player wins and no empty grid left ++ +
Example 3:
+ ++Input: board = ["OOX","XXO","OX "] +Output: "Pending" +Explanation: no player wins but there is still a empty grid ++ +
Note:
+ +1 <= board.length == board[i].length <= 100Given two arrays of integers, find a pair of values (one value from each array) that you can swap to give the two arrays the same sum.
- -Return an array, where the first element is the element in the first array that will be swapped, and the second element is another one in the second array. If there are more than one answers, return any one of them. If there is no answer, return an empty array.
- -Example:
- --Input: array1 = [4, 1, 2, 1, 1, 2], array2 = [3, 6, 3, 3] -Output: [1, 3] -- -
Example:
- -
-Input: array1 = [1, 2, 3], array2 = [4, 5, 6]
-Output: []
-
-Note:
- -1 <= array1.length, array2.length <= 100000Given two arrays of integers, find a pair of values (one value from each array) that you can swap to give the two arrays the same sum.
+ +Return an array, where the first element is the element in the first array that will be swapped, and the second element is another one in the second array. If there are more than one answers, return any one of them. If there is no answer, return an empty array.
+ +Example:
+ ++Input: array1 = [4, 1, 2, 1, 1, 2], array2 = [3, 6, 3, 3] +Output: [1, 3] ++ +
Example:
+ +
+Input: array1 = [1, 2, 3], array2 = [4, 5, 6]
+Output: []
+
+Note:
+ +1 <= array1.length, array2.length <= 100000Write a function to swap a number in place (that is, without temporary variables).
- -Example:
- --Input: numbers = [1,2] -Output: [2,1] -- -
Note:
- -numbers.length == 2-2147483647 <= numbers[i] <= 2147483647Write a function to swap a number in place (that is, without temporary variables).
+ +Example:
+ ++Input: numbers = [1,2] +Output: [2,1] ++ +
Note:
+ +numbers.length == 2-2147483647 <= numbers[i] <= 2147483647You are given two strings word1 and word2. Merge the strings by adding letters in alternating order, starting with word1. If a string is longer than the other, append the additional letters onto the end of the merged string.
Return the merged string.
- --
Example 1:
- --Input: word1 = "abc", word2 = "pqr" -Output: "apbqcr" -Explanation: The merged string will be merged as so: -word1: a b c -word2: p q r -merged: a p b q c r -- -
Example 2:
- --Input: word1 = "ab", word2 = "pqrs" -Output: "apbqrs" -Explanation: Notice that as word2 is longer, "rs" is appended to the end. -word1: a b -word2: p q r s -merged: a p b q r s -- -
Example 3:
- --Input: word1 = "abcd", word2 = "pq" -Output: "apbqcd" -Explanation: Notice that as word1 is longer, "cd" is appended to the end. -word1: a b c d -word2: p q -merged: a p b q c d -- -
-
Constraints:
- -1 <= word1.length, word2.length <= 100word1 and word2 consist of lowercase English letters.You are given two strings word1 and word2. Merge the strings by adding letters in alternating order, starting with word1. If a string is longer than the other, append the additional letters onto the end of the merged string.
Return the merged string.
+ ++
Example 1:
+ ++Input: word1 = "abc", word2 = "pqr" +Output: "apbqcr" +Explanation: The merged string will be merged as so: +word1: a b c +word2: p q r +merged: a p b q c r ++ +
Example 2:
+ ++Input: word1 = "ab", word2 = "pqrs" +Output: "apbqrs" +Explanation: Notice that as word2 is longer, "rs" is appended to the end. +word1: a b +word2: p q r s +merged: a p b q r s ++ +
Example 3:
+ ++Input: word1 = "abcd", word2 = "pq" +Output: "apbqcd" +Explanation: Notice that as word1 is longer, "cd" is appended to the end. +word1: a b c d +word2: p q +merged: a p b q c d ++ +
+
Constraints:
+ +1 <= word1.length, word2.length <= 100word1 and word2 consist of lowercase English letters.Given two straight line segments (represented as a start point and an end point), compute the point of intersection, if any. If there's no intersection, return an empty array.
-The absolute error should not exceed 10^-6. If there are more than one intersections, return the one with smallest X axis value. If there are more than one intersections that have same X axis value, return the one with smallest Y axis value. - -Example 1:
- -
-Input:
-line1 = {0, 0}, {1, 0}
-line2 = {1, 1}, {0, -1}
-Output: {0.5, 0}
-
-
-Example 2:
- -
-Input:
-line1 = {0, 0}, {3, 3}
-line2 = {1, 1}, {2, 2}
-Output: {1, 1}
-
-
-Example 3:
- -
-Input:
-line1 = {0, 0}, {1, 1}
-line2 = {1, 0}, {2, 1}
-Output: {} (no intersection)
-
-
-Note:
- -Given two straight line segments (represented as a start point and an end point), compute the point of intersection, if any. If there's no intersection, return an empty array.
+The absolute error should not exceed 10^-6. If there are more than one intersections, return the one with smallest X axis value. If there are more than one intersections that have same X axis value, return the one with smallest Y axis value. + +Example 1:
+ +
+Input:
+line1 = {0, 0}, {1, 0}
+line2 = {1, 1}, {0, -1}
+Output: {0.5, 0}
+
+
+Example 2:
+ +
+Input:
+line1 = {0, 0}, {3, 3}
+line2 = {1, 1}, {2, 2}
+Output: {1, 1}
+
+
+Example 3:
+ +
+Input:
+line1 = {0, 0}, {1, 1}
+line2 = {1, 0}, {2, 1}
+Output: {} (no intersection)
+
+
+Note:
+ +Write an algorithm to print all ways of arranging n queens on an n x n chess board so that none of them share the same row, column, or diagonal. In this case, "diagonal" means all diagonals, not just the two that bisect the board.
- -Notes: This problem is a generalization of the original one in the book.
- -Example:
- -- Input: 4 - Output: [[".Q..","...Q","Q...","..Q."],["..Q.","Q...","...Q",".Q.."]] - Explanation: 4 queens has following two solutions -[ - [".Q..", // solution 1 - "...Q", - "Q...", - "..Q."], - - ["..Q.", // solution 2 - "Q...", - "...Q", - ".Q.."] -] -+
Write an algorithm to print all ways of arranging n queens on an n x n chess board so that none of them share the same row, column, or diagonal. In this case, "diagonal" means all diagonals, not just the two that bisect the board.
+ +Notes: This problem is a generalization of the original one in the book.
+ +Example:
+ ++ Input: 4 + Output: [[".Q..","...Q","Q...","..Q."],["..Q.","Q...","...Q",".Q.."]] + Explanation: 4 queens has following two solutions +[ + [".Q..", // solution 1 + "...Q", + "Q...", + "..Q."], + + ["..Q.", // solution 2 + "Q...", + "...Q", + ".Q.."] +] +diff --git a/leetcode-cn/problem (English)/兰顿蚂蚁(English) [langtons-ant-lcci].html b/leetcode-cn/problem (English)/兰顿蚂蚁(English) [langtons-ant-lcci].html index 833e38ce..57e3c52a 100644 --- a/leetcode-cn/problem (English)/兰顿蚂蚁(English) [langtons-ant-lcci].html +++ b/leetcode-cn/problem (English)/兰顿蚂蚁(English) [langtons-ant-lcci].html @@ -1,47 +1,47 @@ -
An ant is sitting on an infinite grid of white and black squares. It initially faces right. All squares are white initially.
- -At each step, it does the following:
- -(1) At a white square, flip the color of the square, turn 90 degrees right (clockwise), and move forward one unit.
- -(2) At a black square, flip the color of the square, turn 90 degrees left (counter-clockwise), and move forward one unit.
- -Write a program to simulate the first K moves that the ant makes and print the final board as a grid.
- -The grid should be represented as an array of strings, where each element represents one row in the grid. The black square is represented as 'X', and the white square is represented as '_', the square which is occupied by the ant is represented as 'L', 'U', 'R', 'D', which means the left, up, right and down orientations respectively. You only need to return the minimum matrix that is able to contain all squares that are passed through by the ant.
Example 1:
- --Input: 0 -Output: ["R"] -- -
Example 2:
- --Input: 2 -Output: -[ - "_X", - "LX" -] -- -
Example 3:
- --Input: 5 -Output: -[ - "_U", - "X_", - "XX" -] -- -
Note:
- -K <= 100000An ant is sitting on an infinite grid of white and black squares. It initially faces right. All squares are white initially.
+ +At each step, it does the following:
+ +(1) At a white square, flip the color of the square, turn 90 degrees right (clockwise), and move forward one unit.
+ +(2) At a black square, flip the color of the square, turn 90 degrees left (counter-clockwise), and move forward one unit.
+ +Write a program to simulate the first K moves that the ant makes and print the final board as a grid.
+ +The grid should be represented as an array of strings, where each element represents one row in the grid. The black square is represented as 'X', and the white square is represented as '_', the square which is occupied by the ant is represented as 'L', 'U', 'R', 'D', which means the left, up, right and down orientations respectively. You only need to return the minimum matrix that is able to contain all squares that are passed through by the ant.
Example 1:
+ ++Input: 0 +Output: ["R"] ++ +
Example 2:
+ ++Input: 2 +Output: +[ + "_X", + "LX" +] ++ +
Example 3:
+ ++Input: 5 +Output: +[ + "_U", + "X_", + "XX" +] ++ +
Note:
+ +K <= 100000Write code to partition a linked list around a value x, such that all nodes less than x come before all nodes greater than or equal to x. If x is contained within the list, the values of x only need to be after the elements less than x (see below). The partition element x can appear anywhere in the "right partition"; it does not need to appear between the left and right partitions.
- -Example:
- --Input: head = 3->5->8->5->10->2->1, x = 5 -Output: 3->1->2->10->5->5->8 -+
Write code to partition a linked list around a value x, such that all nodes less than x come before all nodes greater than or equal to x. If x is contained within the list, the values of x only need to be after the elements less than x (see below). The partition element x can appear anywhere in the "right partition"; it does not need to appear between the left and right partitions.
+ +Example:
+ ++Input: head = 3->5->8->5->10->2->1, x = 5 +Output: 3->1->2->10->5->5->8 +diff --git a/leetcode-cn/problem (English)/分式化简(English) [deep-dark-fraction].html b/leetcode-cn/problem (English)/分式化简(English) [deep-dark-fraction].html index 1866e7ae..b9fce7cd 100644 --- a/leetcode-cn/problem (English)/分式化简(English) [deep-dark-fraction].html +++ b/leetcode-cn/problem (English)/分式化简(English) [deep-dark-fraction].html @@ -1,2 +1,2 @@ -
English description is not available for the problem. Please switch to Chinese.
-
English description is not available for the problem. Please switch to Chinese.
+
Implement an algorithm to delete a node in the middle (i.e., any node but the first and last node, not necessarily the exact middle) of a singly linked list, given only access to that node.
- -- -
Example:
- --Input: the node c from the linked list a->b->c->d->e->f -Output: nothing is returned, but the new linked list looks like a->b->d->e->f -+
Implement an algorithm to delete a node in the middle (i.e., any node but the first and last node, not necessarily the exact middle) of a singly linked list, given only access to that node.
+ ++ +
Example:
+ ++Input: the node c from the linked list a->b->c->d->e->f +Output: nothing is returned, but the new linked list looks like a->b->d->e->f +diff --git a/leetcode-cn/problem (English)/判定字符是否唯一(English) [is-unique-lcci].html b/leetcode-cn/problem (English)/判定字符是否唯一(English) [is-unique-lcci].html index 38766d27..0490a856 100644 --- a/leetcode-cn/problem (English)/判定字符是否唯一(English) [is-unique-lcci].html +++ b/leetcode-cn/problem (English)/判定字符是否唯一(English) [is-unique-lcci].html @@ -1,23 +1,23 @@ -
Implement an algorithm to determine if a string has all unique characters. What if you cannot use additional data structures?
- -Example 1:
- -
-Input: s = "leetcode"
-Output: false
-
-
-Example 2:
- -
-Input: s = "abc"
-Output: true
-
-
-- -
Note:
- -0 <= len(s) <= 100 Implement an algorithm to determine if a string has all unique characters. What if you cannot use additional data structures?
+ +Example 1:
+ +
+Input: s = "leetcode"
+Output: false
+
+
+Example 2:
+ +
+Input: s = "abc"
+Output: true
+
+
++ +
Note:
+ +0 <= len(s) <= 100 Given two strings,write a method to decide if one is a permutation of the other.
- -Example 1:
- --Input:- -s1= "abc",s2= "bca" -Output: true -
Example 2:
- --Input:- -s1= "abc",s2= "bad" -Output: false -
Note:
- -0 <= len(s1) <= 100 0 <= len(s2) <= 100Given two strings,write a method to decide if one is a permutation of the other.
+ +Example 1:
+ ++Input:+ +s1= "abc",s2= "bca" +Output: true +
Example 2:
+ ++Input:+ +s1= "abc",s2= "bad" +Output: false +
Note:
+ +0 <= len(s1) <= 100 0 <= len(s2) <= 100c with values[i] in the string.Note that in case a character of the string is not present in keys, the encryption process cannot be carried out, and an empty string "" is returned.
A string is decrypted with the following process:
An animal shelter, which holds only dogs and cats, operates on a strictly"first in, first out" basis. People must adopt either the"oldest" (based on arrival time) of all animals at the shelter, or they can select whether they would prefer a dog or a cat (and will receive the oldest animal of that type). They cannot select which specific animal they would like. Create the data structures to maintain this system and implement operations such as enqueue, dequeueAny, dequeueDog, and dequeueCat. You may use the built-in Linked list data structure.
enqueue method has a animal parameter, animal[0] represents the number of the animal, animal[1] represents the type of the animal, 0 for cat and 1 for dog.
dequeue* method returns [animal number, animal type], if there's no animal that can be adopted, return [-1, -1].
Example1:
- -- Input: -["AnimalShelf", "enqueue", "enqueue", "dequeueCat", "dequeueDog", "dequeueAny"] -[[], [[0, 0]], [[1, 0]], [], [], []] - Output: -[null,null,null,[0,0],[-1,-1],[1,0]] -- -
Example2:
- -- Input: -["AnimalShelf", "enqueue", "enqueue", "enqueue", "dequeueDog", "dequeueCat", "dequeueAny"] -[[], [[0, 0]], [[1, 0]], [[2, 1]], [], [], []] - Output: -[null,null,null,null,[2,1],[0,0],[1,0]] -- -
Note:
- -An animal shelter, which holds only dogs and cats, operates on a strictly"first in, first out" basis. People must adopt either the"oldest" (based on arrival time) of all animals at the shelter, or they can select whether they would prefer a dog or a cat (and will receive the oldest animal of that type). They cannot select which specific animal they would like. Create the data structures to maintain this system and implement operations such as enqueue, dequeueAny, dequeueDog, and dequeueCat. You may use the built-in Linked list data structure.
enqueue method has a animal parameter, animal[0] represents the number of the animal, animal[1] represents the type of the animal, 0 for cat and 1 for dog.
dequeue* method returns [animal number, animal type], if there's no animal that can be adopted, return [-1, -1].
Example1:
+ ++ Input: +["AnimalShelf", "enqueue", "enqueue", "dequeueCat", "dequeueDog", "dequeueAny"] +[[], [[0, 0]], [[1, 0]], [], [], []] + Output: +[null,null,null,[0,0],[-1,-1],[1,0]] ++ +
Example2:
+ ++ Input: +["AnimalShelf", "enqueue", "enqueue", "enqueue", "dequeueDog", "dequeueCat", "dequeueAny"] +[[], [[0, 0]], [[1, 0]], [[2, 1]], [], [], []] + Output: +[null,null,null,null,[2,1],[0,0],[1,0]] ++ +
Note:
+ +Implement a MyQueue class which implements a queue using two stacks.
- - -Example:
- --MyQueue queue = new MyQueue(); - -queue.push(1); -queue.push(2); -queue.peek(); // return 1 -queue.pop(); // return 1 -queue.empty(); // return false- -
- -
Notes:
- -push to top, peek/pop from top, size, and is empty operations are valid.+
Implement a MyQueue class which implements a queue using two stacks.
+ + +Example:
+ ++MyQueue queue = new MyQueue(); + +queue.push(1); +queue.push(2); +queue.peek(); // return 1 +queue.pop(); // return 1 +queue.empty(); // return false+ +
+ +
Notes:
+ +push to top, peek/pop from top, size, and is empty operations are valid.diff --git a/leetcode-cn/problem (English)/单词矩阵(English) [word-rectangle-lcci].html b/leetcode-cn/problem (English)/单词矩阵(English) [word-rectangle-lcci].html index 549a15d4..a41d7d42 100644 --- a/leetcode-cn/problem (English)/单词矩阵(English) [word-rectangle-lcci].html +++ b/leetcode-cn/problem (English)/单词矩阵(English) [word-rectangle-lcci].html @@ -1,28 +1,28 @@ -
Given a list of millions of words, design an algorithm to create the largest possible rectangle of letters such that every row forms a word (reading left to right) and every column forms a word (reading top to bottom). The words need not be chosen consecutively from the list but all rows must be the same length and all columns must be the same height.
- -If there are more than one answer, return any one of them. A word can be used more than once.
- -Example 1:
- --Input:- -["this", "real", "hard", "trh", "hea", "iar", "sld"]-Output: -[ - "this", - "real", - "hard"-]
Example 2:
- -
-Input: ["aa"]
-Output: ["aa","aa"]
-
-Notes:
- -words.length <= 1000words[i].length <= 100Given a list of millions of words, design an algorithm to create the largest possible rectangle of letters such that every row forms a word (reading left to right) and every column forms a word (reading top to bottom). The words need not be chosen consecutively from the list but all rows must be the same length and all columns must be the same height.
+ +If there are more than one answer, return any one of them. A word can be used more than once.
+ +Example 1:
+ ++Input:+ +["this", "real", "hard", "trh", "hea", "iar", "sld"]+Output: +[ + "this", + "real", + "hard"+]
Example 2:
+ +
+Input: ["aa"]
+Output: ["aa","aa"]
+
+Notes:
+ +words.length <= 1000words[i].length <= 100You have a large text file containing words. Given any two words, find the shortest distance (in terms of number of words) between them in the file. If the operation will be repeated many times for the same file (but different pairs of words), can you optimize your solution?
- -Example:
- --Input: words = ["I","am","a","student","from","a","university","in","a","city"], word1 = "a", word2 = "student" -Output: 1- -
Note:
- -words.length <= 100000You have a large text file containing words. Given any two different words, find the shortest distance (in terms of number of words) between them in the file. If the operation will be repeated many times for the same file (but different pairs of words), can you optimize your solution?
+ +Example:
+ ++Input: words = ["I","am","a","student","from","a","university","in","a","city"], word1 = "a", word2 = "student" +Output: 1+ +
Note:
+ +words.length <= 100000Given two words of equal length that are in a dictionary, write a method to transform one word into another word by changing only one letter at a time. The new word you get in each step must be in the dictionary.
- -Write code to return a possible transforming sequence. If there is more than one sequence, return any of them.
- -Example 1:
- --Input: -beginWord = "hit", -endWord = "cog", -wordList = ["hot","dot","dog","lot","log","cog"] - -Output: -["hit","hot","dot","lot","log","cog"] -- -
Example 2:
- --Input: -beginWord = "hit" -endWord = "cog" -wordList = ["hot","dot","dog","lot","log"] - -Output: [] - -Explanation: endWord "cog" is not in the dictionary, so there's no possible transforming sequence.+
Given two words of equal length that are in a dictionary, write a method to transform one word into another word by changing only one letter at a time. The new word you get in each step must be in the dictionary.
+ +Write code to return a possible transforming sequence. If there is more than one sequence, return any of them.
+ +Example 1:
+ ++Input: +beginWord = "hit", +endWord = "cog", +wordList = ["hot","dot","dog","lot","log","cog"] + +Output: +["hit","hot","dot","lot","log","cog"] ++ +
Example 2:
+ ++Input: +beginWord = "hit" +endWord = "cog" +wordList = ["hot","dot","dog","lot","log"] + +Output: [] + +Explanation: endWord "cog" is not in the dictionary, so there's no possible transforming sequence.diff --git a/leetcode-cn/problem (English)/单词频率(English) [words-frequency-lcci].html b/leetcode-cn/problem (English)/单词频率(English) [words-frequency-lcci].html index 5cb19a7e..cda9484e 100644 --- a/leetcode-cn/problem (English)/单词频率(English) [words-frequency-lcci].html +++ b/leetcode-cn/problem (English)/单词频率(English) [words-frequency-lcci].html @@ -1,28 +1,28 @@ -
Design a method to find the frequency of occurrences of any given word in a book. What if we were running this algorithm multiple times?
- -You should implement following methods:
- -WordsFrequency(book) constructor, parameter is a array of strings, representing the book.get(word) get the frequency of word in the book. Example:
- -
-WordsFrequency wordsFrequency = new WordsFrequency({"i", "have", "an", "apple", "he", "have", "a", "pen"});
-wordsFrequency.get("you"); //returns 0,"you" is not in the book
-wordsFrequency.get("have"); //returns 2,"have" occurs twice in the book
-wordsFrequency.get("an"); //returns 1
-wordsFrequency.get("apple"); //returns 1
-wordsFrequency.get("pen"); //returns 1
-
-
-Note:
- -There are only lowercase letters in book[i].1 <= book.length <= 1000001 <= book[i].length <= 10get function will not be called more than 100000 times.Design a method to find the frequency of occurrences of any given word in a book. What if we were running this algorithm multiple times?
+ +You should implement following methods:
+ +WordsFrequency(book) constructor, parameter is a array of strings, representing the book.get(word) get the frequency of word in the book. Example:
+ +
+WordsFrequency wordsFrequency = new WordsFrequency({"i", "have", "an", "apple", "he", "have", "a", "pen"});
+wordsFrequency.get("you"); //returns 0,"you" is not in the book
+wordsFrequency.get("have"); //returns 2,"have" occurs twice in the book
+wordsFrequency.get("an"); //returns 1
+wordsFrequency.get("apple"); //returns 1
+wordsFrequency.get("pen"); //returns 1
+
+
+Note:
+ +There are only lowercase letters in book[i].1 <= book.length <= 1000001 <= book[i].length <= 10get function will not be called more than 100000 times.English description is not available for the problem. Please switch to Chinese.
+English description is not available for the problem. Please switch to Chinese.
diff --git a/leetcode-cn/problem (English)/变位词组(English) [group-anagrams-lcci].html b/leetcode-cn/problem (English)/变位词组(English) [group-anagrams-lcci].html index 386dbfb9..5a2f7bd8 100644 --- a/leetcode-cn/problem (English)/变位词组(English) [group-anagrams-lcci].html +++ b/leetcode-cn/problem (English)/变位词组(English) [group-anagrams-lcci].html @@ -1,21 +1,21 @@ -Write a method to sort an array of strings so that all the anagrams are in the same group.
- -Note: This problem is slightly different from the original one the book.
- -Example:
- -
-Input: ["eat", "tea", "tan", "ate", "nat", "bat"],
-Output:
-[
- ["ate","eat","tea"],
- ["nat","tan"],
- ["bat"]
-]
-
-Notes:
- -Write a method to sort an array of strings so that all the anagrams are in the same group.
+ +Note: This problem is slightly different from the original one the book.
+ +Example:
+ +
+Input: ["eat", "tea", "tan", "ate", "nat", "bat"],
+Output:
+[
+ ["ate","eat","tea"],
+ ["nat","tan"],
+ ["bat"]
+]
+
+Notes:
+ +There is only one character 'A' on the screen of a notepad. You can perform two operations on this notepad for each step:
There is only one character 'A' on the screen of a notepad. You can perform one of two operations on this notepad for each step:
Input: n = 3 Output: 3 -Explanation: Intitally, we have one character 'A'. +Explanation: Initially, we have one character 'A'. In step 1, we use Copy All operation. In step 2, we use Paste operation to get 'AA'. In step 3, we use Paste operation to get 'AAA'. diff --git a/leetcode-cn/problem (English)/可以到达所有点的最少点数目(English) [minimum-number-of-vertices-to-reach-all-nodes].html b/leetcode-cn/problem (English)/可以到达所有点的最少点数目(English) [minimum-number-of-vertices-to-reach-all-nodes].html index 1c8474a5..baf6ad96 100644 --- a/leetcode-cn/problem (English)/可以到达所有点的最少点数目(English) [minimum-number-of-vertices-to-reach-all-nodes].html +++ b/leetcode-cn/problem (English)/可以到达所有点的最少点数目(English) [minimum-number-of-vertices-to-reach-all-nodes].html @@ -1,36 +1,36 @@ -Given a directed acyclic graph, with
- -nvertices numbered from0ton-1, and an arrayedgeswhereedges[i] = [fromi, toi]represents a directed edge from nodefromito nodetoi.Find the smallest set of vertices from which all nodes in the graph are reachable. It's guaranteed that a unique solution exists.
- -Notice that you can return the vertices in any order.
- --
Example 1:
- -- -
-Input: n = 6, edges = [[0,1],[0,2],[2,5],[3,4],[4,2]] -Output: [0,3] -Explanation: It's not possible to reach all the nodes from a single vertex. From 0 we can reach [0,1,2,5]. From 3 we can reach [3,4,2,5]. So we output [0,3].- -Example 2:
- -- -
-Input: n = 5, edges = [[0,1],[2,1],[3,1],[1,4],[2,4]] -Output: [0,2,3] -Explanation: Notice that vertices 0, 3 and 2 are not reachable from any other node, so we must include them. Also any of these vertices can reach nodes 1 and 4. -- --
Constraints:
- -
2 <= n <= 10^51 <= edges.length <= min(10^5, n * (n - 1) / 2)edges[i].length == 20 <= fromi, toi < n(fromi, toi) are distinct.Given a directed acyclic graph, with n vertices numbered from 0 to n-1, and an array edges where edges[i] = [fromi, toi] represents a directed edge from node fromi to node toi.
Find the smallest set of vertices from which all nodes in the graph are reachable. It's guaranteed that a unique solution exists.
+ +Notice that you can return the vertices in any order.
+ ++
Example 1:
+ +
+Input: n = 6, edges = [[0,1],[0,2],[2,5],[3,4],[4,2]] +Output: [0,3] +Explanation: It's not possible to reach all the nodes from a single vertex. From 0 we can reach [0,1,2,5]. From 3 we can reach [3,4,2,5]. So we output [0,3].+ +
Example 2:
+ +
+Input: n = 5, edges = [[0,1],[2,1],[3,1],[1,4],[2,4]] +Output: [0,2,3] +Explanation: Notice that vertices 0, 3 and 2 are not reachable from any other node, so we must include them. Also any of these vertices can reach nodes 1 and 4. ++ +
+
Constraints:
+ +2 <= n <= 10^51 <= edges.length <= min(10^5, n * (n - 1) / 2)edges[i].length == 20 <= fromi, toi < n(fromi, toi) are distinct.You are given an array rectangles where rectangles[i] = [li, wi] represents the ith rectangle of length li and width wi.
You can cut the ith rectangle to form a square with a side length of k if both k <= li and k <= wi. For example, if you have a rectangle [4,6], you can cut it to get a square with a side length of at most 4.
Let maxLen be the side length of the largest square you can obtain from any of the given rectangles.
Return the number of rectangles that can make a square with a side length of maxLen.
-
Example 1:
- --Input: rectangles = [[5,8],[3,9],[5,12],[16,5]] -Output: 3 -Explanation: The largest squares you can get from each rectangle are of lengths [5,3,5,5]. -The largest possible square is of length 5, and you can get it out of 3 rectangles. -- -
Example 2:
- --Input: rectangles = [[2,3],[3,7],[4,3],[3,7]] -Output: 3 -- -
-
Constraints:
- -1 <= rectangles.length <= 1000rectangles[i].length == 21 <= li, wi <= 109li != wiYou are given an array rectangles where rectangles[i] = [li, wi] represents the ith rectangle of length li and width wi.
You can cut the ith rectangle to form a square with a side length of k if both k <= li and k <= wi. For example, if you have a rectangle [4,6], you can cut it to get a square with a side length of at most 4.
Let maxLen be the side length of the largest square you can obtain from any of the given rectangles.
Return the number of rectangles that can make a square with a side length of maxLen.
+
Example 1:
+ ++Input: rectangles = [[5,8],[3,9],[5,12],[16,5]] +Output: 3 +Explanation: The largest squares you can get from each rectangle are of lengths [5,3,5,5]. +The largest possible square is of length 5, and you can get it out of 3 rectangles. ++ +
Example 2:
+ ++Input: rectangles = [[2,3],[3,7],[4,3],[3,7]] +Output: 3 ++ +
+
Constraints:
+ +1 <= rectangles.length <= 1000rectangles[i].length == 21 <= li, wi <= 109li != wiYou are given two sorted arrays, A and B, where A has a large enough buffer at the end to hold B. Write a method to merge B into A in sorted order.
- -Initially the number of elements in A and B are m and n respectively.
- -Example:
- --Input: -A = [1,2,3,0,0,0], m = 3 -B = [2,5,6], n = 3 - -Output: [1,2,2,3,5,6]- -
Note:
- -A.length == n + mYou are given two sorted arrays, A and B, where A has a large enough buffer at the end to hold B. Write a method to merge B into A in sorted order.
+ +Initially the number of elements in A and B are m and n respectively.
+ +Example:
+ ++Input: +A = [1,2,3,0,0,0], m = 3 +B = [2,5,6], n = 3 + +Output: [1,2,2,3,5,6]+ +
Note:
+ +A.length == n + mImplement a function to check if a binary tree is a binary search tree.
- -Example 1:
- --Input: - 2 - / \ - 1 3 -Output: true -- -
Example 2:
- --Input: - 5 - / \ - 1 4 - / \ - 3 6 -Output: false -Explanation: Input: [5,1,4,null,null,3,6]. - the value of root node is 5, but its right child has value 4.+
Implement a function to check if a binary tree is a binary search tree.
+ +Example 1:
+ ++Input: + 2 + / \ + 1 3 +Output: true ++ +
Example 2:
+ ++Input: + 5 + / \ + 1 4 + / \ + 3 6 +Output: false +Explanation: Input: [5,1,4,null,null,3,6]. + the value of root node is 5, but its right child has value 4.diff --git a/leetcode-cn/problem (English)/后继者(English) [successor-lcci].html b/leetcode-cn/problem (English)/后继者(English) [successor-lcci].html index 3d35405b..fbadfc53 100644 --- a/leetcode-cn/problem (English)/后继者(English) [successor-lcci].html +++ b/leetcode-cn/problem (English)/后继者(English) [successor-lcci].html @@ -1,29 +1,29 @@ -
Write an algorithm to find the "next" node (i.e., in-order successor) of a given node in a binary search tree.
- -Return null if there's no "next" node for the given node.
Example 1:
- -
-Input: root = [2,1,3], p = 1
-
- 2
- / \
-1 3
-
-Output: 2
-
-Example 2:
- -
-Input: root = [5,3,6,2,4,null,null,1], p = 6
-
- 5
- / \
- 3 6
- / \
- 2 4
- /
-1
-
-Output: null
+Write an algorithm to find the "next" node (i.e., in-order successor) of a given node in a binary search tree.
+ +Return null if there's no "next" node for the given node.
Example 1:
+ +
+Input: root = [2,1,3], p = 1
+
+ 2
+ / \
+1 3
+
+Output: 2
+
+Example 2:
+ +
+Input: root = [5,3,6,2,4,null,null,1], p = 6
+
+ 5
+ / \
+ 3 6
+ / \
+ 2 4
+ /
+1
+
+Output: null
diff --git a/leetcode-cn/problem (English)/和为s的两个数字(English) [he-wei-sde-liang-ge-shu-zi-lcof].html b/leetcode-cn/problem (English)/和为s的两个数字(English) [he-wei-sde-liang-ge-shu-zi-lcof].html
index 579f7fd7..5c5502aa 100644
--- a/leetcode-cn/problem (English)/和为s的两个数字(English) [he-wei-sde-liang-ge-shu-zi-lcof].html
+++ b/leetcode-cn/problem (English)/和为s的两个数字(English) [he-wei-sde-liang-ge-shu-zi-lcof].html
@@ -1 +1 @@
-English description is not available for the problem. Please switch to Chinese.
+English description is not available for the problem. Please switch to Chinese.
diff --git a/leetcode-cn/problem (English)/和为s的连续正数序列(English) [he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof].html b/leetcode-cn/problem (English)/和为s的连续正数序列(English) [he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof].html index 579f7fd7..5c5502aa 100644 --- a/leetcode-cn/problem (English)/和为s的连续正数序列(English) [he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof].html +++ b/leetcode-cn/problem (English)/和为s的连续正数序列(English) [he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof].html @@ -1 +1 @@ -English description is not available for the problem. Please switch to Chinese.
+English description is not available for the problem. Please switch to Chinese.
diff --git a/leetcode-cn/problem (English)/回文排列(English) [palindrome-permutation-lcci].html b/leetcode-cn/problem (English)/回文排列(English) [palindrome-permutation-lcci].html index 9a0108e5..7b07e133 100644 --- a/leetcode-cn/problem (English)/回文排列(English) [palindrome-permutation-lcci].html +++ b/leetcode-cn/problem (English)/回文排列(English) [palindrome-permutation-lcci].html @@ -1,12 +1,12 @@ -Given a string, write a function to check if it is a permutation of a palindrome. A palindrome is a word or phrase that is the same forwards and backwards. A permutation is a rearrangement of letters. The palindrome does not need to be limited to just dictionary words.
- -- -
Example1:
- --Input: "tactcoa" -Output: true(permutations: "tacocat"、"atcocta", etc.) -- -
+
Given a string, write a function to check if it is a permutation of a palindrome. A palindrome is a word or phrase that is the same forwards and backwards. A permutation is a rearrangement of letters. The palindrome does not need to be limited to just dictionary words.
+ ++ +
Example1:
+ ++Input: "tactcoa" +Output: true(permutations: "tacocat"、"atcocta", etc.) ++ +
diff --git a/leetcode-cn/problem (English)/回文链表(English) [palindrome-linked-list-lcci].html b/leetcode-cn/problem (English)/回文链表(English) [palindrome-linked-list-lcci].html index 1ff871c6..109c15ef 100644 --- a/leetcode-cn/problem (English)/回文链表(English) [palindrome-linked-list-lcci].html +++ b/leetcode-cn/problem (English)/回文链表(English) [palindrome-linked-list-lcci].html @@ -1,22 +1,22 @@ -
Implement a function to check if a linked list is a palindrome.
- -- -
Example 1:
- --Input: 1->2 -Output: false -- -
Example 2:
- --Input: 1->2->2->1 -Output: true -- -
- -
Follow up:
-Could you do it in O(n) time and O(1) space?
Implement a function to check if a linked list is a palindrome.
+ ++ +
Example 1:
+ ++Input: 1->2 +Output: false ++ +
Example 2:
+ ++Input: 1->2->2->1 +Output: true ++ +
+ +
Follow up:
+Could you do it in O(n) time and O(1) space?
English description is not available for the problem. Please switch to Chinese.
+English description is not available for the problem. Please switch to Chinese.
diff --git a/leetcode-cn/problem (English)/坏了的计算器(English) [broken-calculator].html b/leetcode-cn/problem (English)/坏了的计算器(English) [broken-calculator].html index 6ce7ca24..a82b51b5 100644 --- a/leetcode-cn/problem (English)/坏了的计算器(English) [broken-calculator].html +++ b/leetcode-cn/problem (English)/坏了的计算器(English) [broken-calculator].html @@ -36,5 +36,5 @@Constraints:
1 <= x, y <= 1091 <= startValue, target <= 109Imagine a (literal) stack of plates. If the stack gets too high, it might topple. Therefore, in real life, we would likely start a new stack when the previous stack exceeds some threshold. Implement a data structure SetOfStacks that mimics this. SetOfStacks should be composed of several stacks and should create a new stack once the previous one exceeds capacity. SetOfStacks.push() and SetOfStacks.pop() should behave identically to a single stack (that is, pop() should return the same values as it would if there were just a single stack). Follow Up: Implement a function popAt(int index) which performs a pop operation on a specific sub-stack.
You should delete the sub-stack when it becomes empty. pop, popAt should return -1 when there's no element to pop.
Example1:
- -- Input: -["StackOfPlates", "push", "push", "popAt", "pop", "pop"] -[[1], [1], [2], [1], [], []] - Output: -[null, null, null, 2, 1, -1] - Explanation: -- -
Example2:
- -- Input: -["StackOfPlates", "push", "push", "push", "popAt", "popAt", "popAt"] -[[2], [1], [2], [3], [0], [0], [0]] - Output: -[null, null, null, null, 2, 1, 3] -+
Imagine a (literal) stack of plates. If the stack gets too high, it might topple. Therefore, in real life, we would likely start a new stack when the previous stack exceeds some threshold. Implement a data structure SetOfStacks that mimics this. SetOfStacks should be composed of several stacks and should create a new stack once the previous one exceeds capacity. SetOfStacks.push() and SetOfStacks.pop() should behave identically to a single stack (that is, pop() should return the same values as it would if there were just a single stack). Follow Up: Implement a function popAt(int index) which performs a pop operation on a specific sub-stack.
You should delete the sub-stack when it becomes empty. pop, popAt should return -1 when there's no element to pop.
Example1:
+ ++ Input: +["StackOfPlates", "push", "push", "popAt", "pop", "pop"] +[[1], [1], [2], [1], [], []] + Output: +[null, null, null, 2, 1, -1] + Explanation: ++ +
Example2:
+ ++ Input: +["StackOfPlates", "push", "push", "push", "popAt", "popAt", "popAt"] +[[2], [1], [2], [3], [0], [0], [0]] + Output: +[null, null, null, null, 2, 1, 3] +diff --git a/leetcode-cn/problem (English)/堆箱子(English) [pile-box-lcci].html b/leetcode-cn/problem (English)/堆箱子(English) [pile-box-lcci].html index 151851b8..99dd0f9f 100644 --- a/leetcode-cn/problem (English)/堆箱子(English) [pile-box-lcci].html +++ b/leetcode-cn/problem (English)/堆箱子(English) [pile-box-lcci].html @@ -1,23 +1,23 @@ -
You have a stack of n boxes, with widths wi, depths di, and heights hi. The boxes cannot be rotated and can only be stacked on top of one another if each box in the stack is strictly larger than the box above it in width, height, and depth. Implement a method to compute the height of the tallest possible stack. The height of a stack is the sum of the heights of each box.
- -The input use [wi, di, hi] to represents each box.
Example1:
- -- Input: box = [[1, 1, 1], [2, 2, 2], [3, 3, 3]] - Output: 6 -- -
Example2:
- -- Input: box = [[1, 1, 1], [2, 3, 4], [2, 6, 7], [3, 4, 5]] - Output: 10 -- -
Note:
- -box.length <= 3000You have a stack of n boxes, with widths wi, depths di, and heights hi. The boxes cannot be rotated and can only be stacked on top of one another if each box in the stack is strictly larger than the box above it in width, height, and depth. Implement a method to compute the height of the tallest possible stack. The height of a stack is the sum of the heights of each box.
+ +The input use [wi, di, hi] to represents each box.
Example1:
+ ++ Input: box = [[1, 1, 1], [2, 2, 2], [3, 3, 3]] + Output: 6 ++ +
Example2:
+ ++ Input: box = [[1, 1, 1], [2, 3, 4], [2, 6, 7], [3, 4, 5]] + Output: 10 ++ +
Note:
+ +box.length <= 3000Given a string band an array of smaller strings T, design a method to search b for each small string in T. Output positions of all strings in smalls that appear in big, where positions[i] is all positions of smalls[i].
Example:
- --Input: -big = "mississippi" -smalls = ["is","ppi","hi","sis","i","ssippi"] -Output: [[1,4],[8],[],[3],[1,4,7,10],[5]] -- -
Note:
- -0 <= len(big) <= 10000 <= len(smalls[i]) <= 1000smalls will not exceed 100000.smalls.Given a string band an array of smaller strings T, design a method to search b for each small string in T. Output positions of all strings in smalls that appear in big, where positions[i] is all positions of smalls[i].
Example:
+ ++Input: +big = "mississippi" +smalls = ["is","ppi","hi","sis","i","ssippi"] +Output: [[1,4],[8],[],[3],[1,4,7,10],[5]] ++ +
Note:
+ +0 <= len(big) <= 10000 <= len(smalls[i]) <= 1000smalls will not exceed 100000.smalls.You are given a positive integer primeFactors. You are asked to construct a positive integer n that satisfies the following conditions:
n (not necessarily distinct) is at most primeFactors.n is maximized. Note that a divisor of n is nice if it is divisible by every prime factor of n. For example, if n = 12, then its prime factors are [2,2,3], then 6 and 12 are nice divisors, while 3 and 4 are not.Return the number of nice divisors of n. Since that number can be too large, return it modulo 109 + 7.
Note that a prime number is a natural number greater than 1 that is not a product of two smaller natural numbers. The prime factors of a number n is a list of prime numbers such that their product equals n.
-
Example 1:
- --Input: primeFactors = 5 -Output: 6 -Explanation: 200 is a valid value of n. -It has 5 prime factors: [2,2,2,5,5], and it has 6 nice divisors: [10,20,40,50,100,200]. -There is not other value of n that has at most 5 prime factors and more nice divisors. -- -
Example 2:
- --Input: primeFactors = 8 -Output: 18 -- -
-
Constraints:
- -1 <= primeFactors <= 109You are given a positive integer primeFactors. You are asked to construct a positive integer n that satisfies the following conditions:
n (not necessarily distinct) is at most primeFactors.n is maximized. Note that a divisor of n is nice if it is divisible by every prime factor of n. For example, if n = 12, then its prime factors are [2,2,3], then 6 and 12 are nice divisors, while 3 and 4 are not.Return the number of nice divisors of n. Since that number can be too large, return it modulo 109 + 7.
Note that a prime number is a natural number greater than 1 that is not a product of two smaller natural numbers. The prime factors of a number n is a list of prime numbers such that their product equals n.
+
Example 1:
+ ++Input: primeFactors = 5 +Output: 6 +Explanation: 200 is a valid value of n. +It has 5 prime factors: [2,2,2,5,5], and it has 6 nice divisors: [10,20,40,50,100,200]. +There is not other value of n that has at most 5 prime factors and more nice divisors. ++ +
Example 2:
+ ++Input: primeFactors = 8 +Output: 18 ++ +
+
Constraints:
+ +1 <= primeFactors <= 109Each year, the government releases a list of the 10000 most common baby names and their frequencies (the number of babies with that name). The only problem with this is that some names have multiple spellings. For example,"John" and ''Jon" are essentially the same name but would be listed separately in the list. Given two lists, one of names/frequencies and the other of pairs of equivalent names, write an algorithm to print a new list of the true frequency of each name. Note that if John and Jon are synonyms, and Jon and Johnny are synonyms, then John and Johnny are synonyms. (It is both transitive and symmetric.) In the final list, choose the name that are lexicographically smallest as the "real" name.
- -Example:
- --Input: names = ["John(15)","Jon(12)","Chris(13)","Kris(4)","Christopher(19)"], synonyms = ["(Jon,John)","(John,Johnny)","(Chris,Kris)","(Chris,Christopher)"] -Output: ["John(27)","Chris(36)"]- -
Note:
- -names.length <= 100000Each year, the government releases a list of the 10000 most common baby names and their frequencies (the number of babies with that name). The only problem with this is that some names have multiple spellings. For example,"John" and ''Jon" are essentially the same name but would be listed separately in the list. Given two lists, one of names/frequencies and the other of pairs of equivalent names, write an algorithm to print a new list of the true frequency of each name. Note that if John and Jon are synonyms, and Jon and Johnny are synonyms, then John and Johnny are synonyms. (It is both transitive and symmetric.) In the final list, choose the name that are lexicographically smallest as the "real" name.
+ +Example:
+ ++Input: names = ["John(15)","Jon(12)","Chris(13)","Kris(4)","Christopher(19)"], synonyms = ["(Jon,John)","(John,Johnny)","(Chris,Kris)","(Chris,Christopher)"] +Output: ["John(27)","Chris(36)"]+ +
Note:
+ +names.length <= 100000Implement a method to perform basic string compression using the counts of repeated characters. For example, the string aabcccccaaa would become a2blc5a3. If the "compressed" string would not become smaller than the original string, your method should return the original string. You can assume the string has only uppercase and lowercase letters (a - z).
- -Example 1:
- --Input: "aabcccccaaa" -Output: "a2b1c5a3" -- -
Example 2:
- --Input: "abbccd" -Output: "abbccd" -Explanation: -The compressed string is "a1b2c2d1", which is longer than the original string. -- -
- -
Note:
- -0 <= S.length <= 50000Implement a method to perform basic string compression using the counts of repeated characters. For example, the string aabcccccaaa would become a2blc5a3. If the "compressed" string would not become smaller than the original string, your method should return the original string. You can assume the string has only uppercase and lowercase letters (a - z).
+ +Example 1:
+ ++Input: "aabcccccaaa" +Output: "a2b1c5a3" ++ +
Example 2:
+ ++Input: "abbccd" +Output: "abbccd" +Explanation: +The compressed string is "a1b2c2d1", which is longer than the original string. ++ +
+ +
Note:
+ +0 <= S.length <= 50000Given two strings, s1 and s2, write code to check if s2 is a rotation of s1 (e.g.,"waterbottle" is a rotation of"erbottlewat"). Can you use only one call to the method that checks if one word is a substring of another?
Example 1:
- --Input: s1 = "waterbottle", s2 = "erbottlewat" -Output: True -- -
Example 2:
- --Input: s1 = "aa", s2 = "aba" -Output: False -- -
- -
Note:
- -0 <= s1.length, s2.length <= 100000Given two strings, s1 and s2, write code to check if s2 is a rotation of s1 (e.g.,"waterbottle" is a rotation of"erbottlewat"). Can you use only one call to the method that checks if one word is a substring of another?
Example 1:
+ ++Input: s1 = "waterbottle", s2 = "erbottlewat" +Output: True ++ +
Example 2:
+ ++Input: s1 = "aa", s2 = "aba" +Output: False ++ +
+ +
Note:
+ +0 <= s1.length, s2.length <= 100000Implement strStr().
-Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
Given two strings needle and haystack, return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
Clarification:
What should we return when needle is an empty string? This is a great question to ask during an interview.
For the purpose of this problem, we will return 0 when needle is an empty string. This is consistent to C's strstr() and Java's indexOf().
For the purpose of this problem, we will return 0 when needle is an empty string. This is consistent to C's strstr() and Java's indexOf().
Example 1:
-Input: haystack = "hello", needle = "ll" + ++Input: haystack = "hello", needle = "ll" Output: 2 -Example 2:
-Input: haystack = "aaaaa", needle = "bba" -Output: -1 -Example 3:
-Input: haystack = "", needle = "" -Output: 0+ +Example 2:
+ ++Input: haystack = "aaaaa", needle = "bba" +Output: -1 ++
Constraints:
0 <= haystack.length, needle.length <= 5 * 104haystack and needle consist of only lower-case English characters.1 <= haystack.length, needle.length <= 104haystack and needle consist of only lowercase English characters.A sentence is a list of words that are separated by a single space with no leading or trailing spaces. Each word consists of lowercase and uppercase English letters.
- -A sentence can be shuffled by appending the 1-indexed word position to each word then rearranging the words in the sentence.
- -"This is a sentence" can be shuffled as "sentence4 a3 is2 This1" or "is2 sentence4 This1 a3".Given a shuffled sentence s containing no more than 9 words, reconstruct and return the original sentence.
-
Example 1:
- --Input: s = "is2 sentence4 This1 a3" -Output: "This is a sentence" -Explanation: Sort the words in s to their original positions "This1 is2 a3 sentence4", then remove the numbers. -- -
Example 2:
- --Input: s = "Myself2 Me1 I4 and3" -Output: "Me Myself and I" -Explanation: Sort the words in s to their original positions "Me1 Myself2 and3 I4", then remove the numbers. -- -
-
Constraints:
- -2 <= s.length <= 200s consists of lowercase and uppercase English letters, spaces, and digits from 1 to 9.s is between 1 and 9.s are separated by a single space.s contains no leading or trailing spaces.A sentence is a list of words that are separated by a single space with no leading or trailing spaces. Each word consists of lowercase and uppercase English letters.
+ +A sentence can be shuffled by appending the 1-indexed word position to each word then rearranging the words in the sentence.
+ +"This is a sentence" can be shuffled as "sentence4 a3 is2 This1" or "is2 sentence4 This1 a3".Given a shuffled sentence s containing no more than 9 words, reconstruct and return the original sentence.
+
Example 1:
+ ++Input: s = "is2 sentence4 This1 a3" +Output: "This is a sentence" +Explanation: Sort the words in s to their original positions "This1 is2 a3 sentence4", then remove the numbers. ++ +
Example 2:
+ ++Input: s = "Myself2 Me1 I4 and3" +Output: "Me Myself and I" +Explanation: Sort the words in s to their original positions "Me1 Myself2 and3 I4", then remove the numbers. ++ +
+
Constraints:
+ +2 <= s.length <= 200s consists of lowercase and uppercase English letters, spaces, and digits from 1 to 9.s is between 1 and 9.s are separated by a single space.s contains no leading or trailing spaces.A split of an integer array is good if:
- -left, mid, right respectively from left to right.left is less than or equal to the sum of the elements in mid, and the sum of the elements in mid is less than or equal to the sum of the elements in right.Given nums, an array of non-negative integers, return the number of good ways to split nums. As the number may be too large, return it modulo 109 + 7.
-
Example 1:
- --Input: nums = [1,1,1] -Output: 1 -Explanation: The only good way to split nums is [1] [1] [1].- -
Example 2:
- --Input: nums = [1,2,2,2,5,0] -Output: 3 -Explanation: There are three good ways of splitting nums: -[1] [2] [2,2,5,0] -[1] [2,2] [2,5,0] -[1,2] [2,2] [5,0] -- -
Example 3:
- --Input: nums = [3,2,1] -Output: 0 -Explanation: There is no good way to split nums.- -
-
Constraints:
- -3 <= nums.length <= 1050 <= nums[i] <= 104A split of an integer array is good if:
+ +left, mid, right respectively from left to right.left is less than or equal to the sum of the elements in mid, and the sum of the elements in mid is less than or equal to the sum of the elements in right.Given nums, an array of non-negative integers, return the number of good ways to split nums. As the number may be too large, return it modulo 109 + 7.
+
Example 1:
+ ++Input: nums = [1,1,1] +Output: 1 +Explanation: The only good way to split nums is [1] [1] [1].+ +
Example 2:
+ ++Input: nums = [1,2,2,2,5,0] +Output: 3 +Explanation: There are three good ways of splitting nums: +[1] [2] [2,2,5,0] +[1] [2,2] [2,5,0] +[1,2] [2,2] [5,0] ++ +
Example 3:
+ ++Input: nums = [3,2,1] +Output: 0 +Explanation: There is no good way to split nums.+ +
+
Constraints:
+ +3 <= nums.length <= 1050 <= nums[i] <= 104In an array of integers, a "peak" is an element which is greater than or equal to the adjacent integers and a "valley" is an element which is less than or equal to the adjacent integers. For example, in the array {5, 8, 4, 2, 3, 4, 6}, {8, 6} are peaks and {5, 2} are valleys. Given an array of integers, sort the array into an alternating sequence of peaks and valleys.
- -Example:
- --Input: [5, 3, 1, 2, 3] -Output: [5, 1, 3, 2, 3] -- -
Note:
- -nums.length <= 10000In an array of integers, a "peak" is an element which is greater than or equal to the adjacent integers and a "valley" is an element which is less than or equal to the adjacent integers. For example, in the array {5, 8, 4, 2, 3, 4, 6}, {8, 6} are peaks and {5, 2} are valleys. Given an array of integers, sort the array into an alternating sequence of peaks and valleys.
+ +Example:
+ ++Input: [5, 3, 1, 2, 3] +Output: [5, 1, 3, 2, 3] ++ +
Note:
+ +nums.length <= 10000English description is not available for the problem. Please switch to Chinese.
+English description is not available for the problem. Please switch to Chinese.
diff --git a/leetcode-cn/problem (English)/布尔运算(English) [boolean-evaluation-lcci].html b/leetcode-cn/problem (English)/布尔运算(English) [boolean-evaluation-lcci].html index 5adef9e1..5ad7692e 100644 --- a/leetcode-cn/problem (English)/布尔运算(English) [boolean-evaluation-lcci].html +++ b/leetcode-cn/problem (English)/布尔运算(English) [boolean-evaluation-lcci].html @@ -1,25 +1,25 @@ -Given a boolean expression consisting of the symbols 0 (false), 1 (true), & (AND), | (OR), and ^ (XOR), and a desired boolean result value result, implement a function to count the number of ways of parenthesizing the expression such that it evaluates to result.
Example 1:
- --Input: s = "1^0|0|1", result = 0 - -Output: 2 -Explanation: Two possible parenthesizing ways are: -1^(0|(0|1)) -1^((0|0)|1) -- -
Example 2:
- --Input: s = "0&0&0&1^1|0", result = 1 - -Output: 10- -
Note:
- -s.Given a boolean expression consisting of the symbols 0 (false), 1 (true), & (AND), | (OR), and ^ (XOR), and a desired boolean result value result, implement a function to count the number of ways of parenthesizing the expression such that it evaluates to result.
Example 1:
+ ++Input: s = "1^0|0|1", result = 0 + +Output: 2 +Explanation: Two possible parenthesizing ways are: +1^(0|(0|1)) +1^((0|0)|1) ++ +
Example 2:
+ ++Input: s = "0&0&0&1^1|0", result = 1 + +Output: 10+ +
Note:
+ +s.Write a method to return all subsets of a set. The elements in a set are pairwise distinct.
- -Note: The result set should not contain duplicated subsets.
- -Example:
- -- Input: nums = [1,2,3] - Output: -[ - [3], - [1], - [2], - [1,2,3], - [1,3], - [2,3], - [1,2], - [] -] -+
Write a method to return all subsets of a set. The elements in a set are pairwise distinct.
+ +Note: The result set should not contain duplicated subsets.
+ +Example:
+ ++ Input: nums = [1,2,3] + Output: +[ + [3], + [1], + [2], + [1,2,3], + [1,3], + [2,3], + [1,2], + [] +] +diff --git a/leetcode-cn/problem (English)/平分正方形(English) [bisect-squares-lcci].html b/leetcode-cn/problem (English)/平分正方形(English) [bisect-squares-lcci].html index 86bcacc2..20d124f2 100644 --- a/leetcode-cn/problem (English)/平分正方形(English) [bisect-squares-lcci].html +++ b/leetcode-cn/problem (English)/平分正方形(English) [bisect-squares-lcci].html @@ -1,22 +1,22 @@ -
Given two squares on a two-dimensional plane, find a line that would cut these two squares in half. Assume that the top and the bottom sides of the square run parallel to the x-axis.
- -Each square consists of three values, the coordinate of bottom left corner [X,Y] = [square[0],square[1]], and the side length of the square square[2]. The line will intersect to the two squares in four points. Return the coordinates of two intersection points [X1,Y1] and [X2,Y2] that the forming segment covers the other two intersection points in format of {X1,Y1,X2,Y2}. If X1 != X2, there should be X1 < X2, otherwise there should be Y1 <= Y2.
If there are more than one line that can cut these two squares in half, return the one that has biggest slope (slope of a line parallel to the y-axis is considered as infinity).
- -Example:
- -
-Input:
-square1 = {-1, -1, 2}
-square2 = {0, -1, 2}
-Output: {-1,0,2,0}
-Explanation: y = 0 is the line that can cut these two squares in half.
-
-
-Note:
- -square.length == 3square[2] > 0Given two squares on a two-dimensional plane, find a line that would cut these two squares in half. Assume that the top and the bottom sides of the square run parallel to the x-axis.
+ +Each square consists of three values, the coordinate of bottom left corner [X,Y] = [square[0],square[1]], and the side length of the square square[2]. The line will intersect to the two squares in four points. Return the coordinates of two intersection points [X1,Y1] and [X2,Y2] that the forming segment covers the other two intersection points in format of {X1,Y1,X2,Y2}. If X1 != X2, there should be X1 < X2, otherwise there should be Y1 <= Y2.
If there are more than one line that can cut these two squares in half, return the one that has biggest slope (slope of a line parallel to the y-axis is considered as infinity).
+ +Example:
+ +
+Input:
+square1 = {-1, -1, 2}
+square2 = {0, -1, 2}
+Output: {-1,0,2,0}
+Explanation: y = 0 is the line that can cut these two squares in half.
+
+
+Note:
+ +square.length == 3square[2] > 0You are given an m x n integer matrix grid, where m and n are both even integers, and an integer k.
The matrix is composed of several layers, which is shown in the below image, where each color is its own layer:
- -
A cyclic rotation of the matrix is done by cyclically rotating each layer in the matrix. To cyclically rotate a layer once, each element in the layer will take the place of the adjacent element in the counter-clockwise direction. An example rotation is shown below:
-
-Return the matrix after applying k cyclic rotations to it.
-
Example 1:
-
--Input: grid = [[40,10],[30,20]], k = 1 -Output: [[10,20],[40,30]] -Explanation: The figures above represent the grid at every state. -- -
Example 2:
-
-
--Input: grid = [[1,2,3,4],[5,6,7,8],[9,10,11,12],[13,14,15,16]], k = 2 -Output: [[3,4,8,12],[2,11,10,16],[1,7,6,15],[5,9,13,14]] -Explanation: The figures above represent the grid at every state. -- -
-
Constraints:
- -m == grid.lengthn == grid[i].length2 <= m, n <= 50m and n are even integers.1 <= grid[i][j] <= 50001 <= k <= 109You are given an m x n integer matrix grid, where m and n are both even integers, and an integer k.
The matrix is composed of several layers, which is shown in the below image, where each color is its own layer:
+ +
A cyclic rotation of the matrix is done by cyclically rotating each layer in the matrix. To cyclically rotate a layer once, each element in the layer will take the place of the adjacent element in the counter-clockwise direction. An example rotation is shown below:
+
+Return the matrix after applying k cyclic rotations to it.
+
Example 1:
+
++Input: grid = [[40,10],[30,20]], k = 1 +Output: [[10,20],[40,30]] +Explanation: The figures above represent the grid at every state. ++ +
Example 2:
+
+
++Input: grid = [[1,2,3,4],[5,6,7,8],[9,10,11,12],[13,14,15,16]], k = 2 +Output: [[3,4,8,12],[2,11,10,16],[1,7,6,15],[5,9,13,14]] +Explanation: The figures above represent the grid at every state. ++ +
+
Constraints:
+ +m == grid.lengthn == grid[i].length2 <= m, n <= 50m and n are even integers.1 <= grid[i][j] <= 50001 <= k <= 109Oh, no! You have accidentally removed all spaces, punctuation, and capitalization in a lengthy document. A sentence like "I reset the computer. It still didn't boot!" became "iresetthecomputeritstilldidntboot''. You'll deal with the punctuation and capitalization later; right now you need to re-insert the spaces. Most of the words are in a dictionary but a few are not. Given a dictionary (a list of strings) and the document (a string), design an algorithm to unconcatenate the document in a way that minimizes the number of unrecognized characters. Return the number of unrecognized characters.
- -Note: This problem is slightly different from the original one in the book.
- -- -
Example:
- --Input: -dictionary = ["looked","just","like","her","brother"] -sentence = "jesslookedjustliketimherbrother" -Output: 7 -Explanation: After unconcatenating, we got "jess looked just like tim her brother", which containing 7 unrecognized characters. -- -
Note:
- -0 <= len(sentence) <= 1000The total number of characters in dictionary is less than or equal to 150000.dictionary and sentence.Oh, no! You have accidentally removed all spaces, punctuation, and capitalization in a lengthy document. A sentence like "I reset the computer. It still didn't boot!" became "iresetthecomputeritstilldidntboot''. You'll deal with the punctuation and capitalization later; right now you need to re-insert the spaces. Most of the words are in a dictionary but a few are not. Given a dictionary (a list of strings) and the document (a string), design an algorithm to unconcatenate the document in a way that minimizes the number of unrecognized characters. Return the number of unrecognized characters.
+ +Note: This problem is slightly different from the original one in the book.
+ ++ +
Example:
+ ++Input: +dictionary = ["looked","just","like","her","brother"] +sentence = "jesslookedjustliketimherbrother" +Output: 7 +Explanation: After unconcatenating, we got "jess looked just like tim her brother", which containing 7 unrecognized characters. ++ +
Note:
+ +0 <= len(sentence) <= 1000The total number of characters in dictionary is less than or equal to 150000.dictionary and sentence.Constraints:
1 <= nums.length <= 2001 <= nums.length <= 50-106 <= nums[i] <= 106nums are unique.5 * 104 calls in total will be made to reset and shuffle.104 calls in total will be made to reset and shuffle.There are n friends that are playing a game. The friends are sitting in a circle and are numbered from 1 to n in clockwise order. More formally, moving clockwise from the ith friend brings you to the (i+1)th friend for 1 <= i < n, and moving clockwise from the nth friend brings you to the 1st friend.
The rules of the game are as follows:
- -1st friend.k friends in the clockwise direction including the friend you started at. The counting wraps around the circle and may count some friends more than once.2 starting from the friend immediately clockwise of the friend who just lost and repeat.Given the number of friends, n, and an integer k, return the winner of the game.
-
Example 1:
-
--Input: n = 5, k = 2 -Output: 3 -Explanation: Here are the steps of the game: -1) Start at friend 1. -2) Count 2 friends clockwise, which are friends 1 and 2. -3) Friend 2 leaves the circle. Next start is friend 3. -4) Count 2 friends clockwise, which are friends 3 and 4. -5) Friend 4 leaves the circle. Next start is friend 5. -6) Count 2 friends clockwise, which are friends 5 and 1. -7) Friend 1 leaves the circle. Next start is friend 3. -8) Count 2 friends clockwise, which are friends 3 and 5. -9) Friend 5 leaves the circle. Only friend 3 is left, so they are the winner.- -
Example 2:
- --Input: n = 6, k = 5 -Output: 1 -Explanation: The friends leave in this order: 5, 4, 6, 2, 3. The winner is friend 1. -- -
-
Constraints:
- -1 <= k <= n <= 500There are n friends that are playing a game. The friends are sitting in a circle and are numbered from 1 to n in clockwise order. More formally, moving clockwise from the ith friend brings you to the (i+1)th friend for 1 <= i < n, and moving clockwise from the nth friend brings you to the 1st friend.
The rules of the game are as follows:
+ +1st friend.k friends in the clockwise direction including the friend you started at. The counting wraps around the circle and may count some friends more than once.2 starting from the friend immediately clockwise of the friend who just lost and repeat.Given the number of friends, n, and an integer k, return the winner of the game.
+
Example 1:
+
++Input: n = 5, k = 2 +Output: 3 +Explanation: Here are the steps of the game: +1) Start at friend 1. +2) Count 2 friends clockwise, which are friends 1 and 2. +3) Friend 2 leaves the circle. Next start is friend 3. +4) Count 2 friends clockwise, which are friends 3 and 4. +5) Friend 4 leaves the circle. Next start is friend 5. +6) Count 2 friends clockwise, which are friends 5 and 1. +7) Friend 1 leaves the circle. Next start is friend 3. +8) Count 2 friends clockwise, which are friends 3 and 5. +9) Friend 5 leaves the circle. Only friend 3 is left, so they are the winner.+ +
Example 2:
+ ++Input: n = 6, k = 5 +Output: 1 +Explanation: The friends leave in this order: 5, 4, 6, 2, 3. The winner is friend 1. ++ +
+
Constraints:
+ +1 <= k <= n <= 500Implement an algorithm to print all valid (e.g., properly opened and closed) combinations of n pairs of parentheses.
- -Note: The result set should not contain duplicated subsets.
- -For example, given n = 3, the result should be:
- --[ - "((()))", - "(()())", - "(())()", - "()(())", - "()()()" -] -+
Implement an algorithm to print all valid (e.g., properly opened and closed) combinations of n pairs of parentheses.
+ +Note: The result set should not contain duplicated subsets.
+ +For example, given n = 3, the result should be:
+ ++[ + "((()))", + "(()())", + "(())()", + "()(())", + "()()()" +] +diff --git a/leetcode-cn/problem (English)/按摩师(English) [the-masseuse-lcci].html b/leetcode-cn/problem (English)/按摩师(English) [the-masseuse-lcci].html index d885a592..641b61d6 100644 --- a/leetcode-cn/problem (English)/按摩师(English) [the-masseuse-lcci].html +++ b/leetcode-cn/problem (English)/按摩师(English) [the-masseuse-lcci].html @@ -1,29 +1,29 @@ -
A popular masseuse receives a sequence of back-to-back appointment requests and is debating which ones to accept. She needs a break between appointments and therefore she cannot accept any adjacent requests. Given a sequence of back-to-back appoint ment requests, find the optimal (highest total booked minutes) set the masseuse can honor. Return the number of minutes.
- -Note: This problem is slightly different from the original one in the book.
- -- -
Example 1:
- --Input: [1,2,3,1] -Output: 4 -Explanation: Accept request 1 and 3, total minutes = 1 + 3 = 4 -- -
Example 2:
- --Input: [2,7,9,3,1] -Output: 12 -Explanation: Accept request 1, 3 and 5, total minutes = 2 + 9 + 1 = 12 -- -
Example 3:
- --Input: [2,1,4,5,3,1,1,3] -Output: 12 -Explanation: Accept request 1, 3, 5 and 8, total minutes = 2 + 4 + 3 + 3 = 12 -+
A popular masseuse receives a sequence of back-to-back appointment requests and is debating which ones to accept. She needs a break between appointments and therefore she cannot accept any adjacent requests. Given a sequence of back-to-back appoint ment requests, find the optimal (highest total booked minutes) set the masseuse can honor. Return the number of minutes.
+ +Note: This problem is slightly different from the original one in the book.
+ ++ +
Example 1:
+ ++Input: [1,2,3,1] +Output: 4 +Explanation: Accept request 1 and 3, total minutes = 1 + 3 = 4 ++ +
Example 2:
+ ++Input: [2,7,9,3,1] +Output: 12 +Explanation: Accept request 1, 3 and 5, total minutes = 2 + 9 + 1 = 12 ++ +
Example 3:
+ ++Input: [2,1,4,5,3,1,1,3] +Output: 12 +Explanation: Accept request 1, 3, 5 and 8, total minutes = 2 + 4 + 3 + 3 = 12 +diff --git a/leetcode-cn/problem (English)/排序矩阵查找(English) [sorted-matrix-search-lcci].html b/leetcode-cn/problem (English)/排序矩阵查找(English) [sorted-matrix-search-lcci].html index 47030f8d..e596869e 100644 --- a/leetcode-cn/problem (English)/排序矩阵查找(English) [sorted-matrix-search-lcci].html +++ b/leetcode-cn/problem (English)/排序矩阵查找(English) [sorted-matrix-search-lcci].html @@ -1,19 +1,19 @@ -
Given an M x N matrix in which each row and each column is sorted in ascending order, write a method to find an element.
- -Example:
- -Given matrix:
- --[ - [1, 4, 7, 11, 15], - [2, 5, 8, 12, 19], - [3, 6, 9, 16, 22], - [10, 13, 14, 17, 24], - [18, 21, 23, 26, 30] -] -- -
Given target = 5, return true.
Given target = 20, return false.
Given an M x N matrix in which each row and each column is sorted in ascending order, write a method to find an element.
+ +Example:
+ +Given matrix:
+ ++[ + [1, 4, 7, 11, 15], + [2, 5, 8, 12, 19], + [3, 6, 9, 16, 22], + [10, 13, 14, 17, 24], + [18, 21, 23, 26, 30] +] ++ +
Given target = 5, return true.
Given target = 20, return false.
You are given two 32-bit numbers, N and M, and two bit positions, i and j. Write a method to insert M into N such that M starts at bit j and ends at bit i. You can assume that the bits j through i have enough space to fit all of M. That is, if M = 10011, you can assume that there are at least 5 bits between j and i. You would not, for example, have j = 3 and i = 2, because M could not fully fit between bit 3 and bit 2.
- -Example1:
- -- Input: N = 10000000000, M = 10011, i = 2, j = 6 - Output: N = 10001001100 -- -
Example2:
- -- Input: N = 0, M = 11111, i = 0, j = 4 - Output: N = 11111 -+
You are given two 32-bit numbers, N and M, and two bit positions, i and j. Write a method to insert M into N such that M starts at bit j and ends at bit i. You can assume that the bits j through i have enough space to fit all of M. That is, if M = 10011, you can assume that there are at least 5 bits between j and i. You would not, for example, have j = 3 and i = 2, because M could not fully fit between bit 3 and bit 2.
+ +Example1:
+ ++ Input: N = 10000000000, M = 10011, i = 2, j = 6 + Output: N = 10001001100 ++ +
Example2:
+ ++ Input: N = 0, M = 11111, i = 0, j = 4 + Output: N = 11111 +diff --git a/leetcode-cn/problem (English)/搜索旋转数组(English) [search-rotate-array-lcci].html b/leetcode-cn/problem (English)/搜索旋转数组(English) [search-rotate-array-lcci].html index 915da1d3..9bd33556 100644 --- a/leetcode-cn/problem (English)/搜索旋转数组(English) [search-rotate-array-lcci].html +++ b/leetcode-cn/problem (English)/搜索旋转数组(English) [search-rotate-array-lcci].html @@ -1,21 +1,21 @@ -
Given a sorted array of n integers that has been rotated an unknown number of times, write code to find an element in the array. You may assume that the array was originally sorted in increasing order. If there are more than one target elements in the array, return the smallest index.
- -Example1:
- -- Input: arr = [15, 16, 19, 20, 25, 1, 3, 4, 5, 7, 10, 14], target = 5 - Output: 8 (the index of 5 in the array) -- -
Example2:
- -- Input: arr = [15, 16, 19, 20, 25, 1, 3, 4, 5, 7, 10, 14], target = 11 - Output: -1 (not found) -- -
Note:
- -1 <= arr.length <= 1000000Given a sorted array of n integers that has been rotated an unknown number of times, write code to find an element in the array. You may assume that the array was originally sorted in increasing order. If there are more than one target elements in the array, return the smallest index.
+ +Example1:
+ ++ Input: arr = [15, 16, 19, 20, 25, 1, 3, 4, 5, 7, 10, 14], target = 5 + Output: 8 (the index of 5 in the array) ++ +
Example2:
+ ++ Input: arr = [15, 16, 19, 20, 25, 1, 3, 4, 5, 7, 10, 14], target = 11 + Output: -1 (not found) ++ +
Note:
+ +1 <= arr.length <= 1000000Imagine you are reading in a stream of integers. Periodically, you wish to be able to look up the rank of a number x (the number of values less than or equal to x). lmplement the data structures and algorithms to support these operations. That is, implement the method track (int x), which is called when each number is generated, and the method getRankOfNumber(int x), which returns the number of values less than or equal to x.
Note: This problem is slightly different from the original one in the book.
- -Example:
- --Input: -["StreamRank", "getRankOfNumber", "track", "getRankOfNumber"] -[[], [1], [0], [0]] -Output: -[null,0,null,1] -- -
Note:
- -x <= 50000track and getRankOfNumber methods are less than or equal to 2000.Imagine you are reading in a stream of integers. Periodically, you wish to be able to look up the rank of a number x (the number of values less than or equal to x). lmplement the data structures and algorithms to support these operations. That is, implement the method track (int x), which is called when each number is generated, and the method getRankOfNumber(int x), which returns the number of values less than or equal to x.
Note: This problem is slightly different from the original one in the book.
+ +Example:
+ ++Input: +["StreamRank", "getRankOfNumber", "track", "getRankOfNumber"] +[[], [1], [0], [0]] +Output: +[null,0,null,1] ++ +
Note:
+ +x <= 50000track and getRankOfNumber methods are less than or equal to 2000.Design an algorithm to find all pairs of integers within an array which sum to a specified value.
- -Example 1:
- --Input: nums = [5,6,5], target = 11 -Output: [[5,6]]- -
Example 2:
- --Input: nums = [5,6,5,6], target = 11 -Output: [[5,6],[5,6]]- -
Note:
- -nums.length <= 100000Design an algorithm to find all pairs of integers within an array which sum to a specified value.
+ +Example 1:
+ ++Input: nums = [5,6,5], target = 11 +Output: [[5,6]]+ +
Example 2:
+ ++Input: nums = [5,6,5,6], target = 11 +Output: [[5,6],[5,6]]+ +
Note:
+ +nums.length <= 100000English description is not available for the problem. Please switch to Chinese.
+English description is not available for the problem. Please switch to Chinese.
diff --git a/leetcode-cn/problem (English)/数组中数字出现的次数(English) [shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof].html b/leetcode-cn/problem (English)/数组中数字出现的次数(English) [shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof].html index 579f7fd7..5c5502aa 100644 --- a/leetcode-cn/problem (English)/数组中数字出现的次数(English) [shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof].html +++ b/leetcode-cn/problem (English)/数组中数字出现的次数(English) [shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof].html @@ -1 +1 @@ -English description is not available for the problem. Please switch to Chinese.
+English description is not available for the problem. Please switch to Chinese.
diff --git a/leetcode-cn/problem (English)/数组中最大数对和的最小值(English) [minimize-maximum-pair-sum-in-array].html b/leetcode-cn/problem (English)/数组中最大数对和的最小值(English) [minimize-maximum-pair-sum-in-array].html index efb50d7a..8af5295a 100644 --- a/leetcode-cn/problem (English)/数组中最大数对和的最小值(English) [minimize-maximum-pair-sum-in-array].html +++ b/leetcode-cn/problem (English)/数组中最大数对和的最小值(English) [minimize-maximum-pair-sum-in-array].html @@ -1,43 +1,43 @@ -The pair sum of a pair (a,b) is equal to a + b. The maximum pair sum is the largest pair sum in a list of pairs.
(1,5), (2,3), and (4,4), the maximum pair sum would be max(1+5, 2+3, 4+4) = max(6, 5, 8) = 8.Given an array nums of even length n, pair up the elements of nums into n / 2 pairs such that:
nums is in exactly one pair, andReturn the minimized maximum pair sum after optimally pairing up the elements.
- --
Example 1:
- --Input: nums = [3,5,2,3] -Output: 7 -Explanation: The elements can be paired up into pairs (3,3) and (5,2). -The maximum pair sum is max(3+3, 5+2) = max(6, 7) = 7. -- -
Example 2:
- --Input: nums = [3,5,4,2,4,6] -Output: 8 -Explanation: The elements can be paired up into pairs (3,5), (4,4), and (6,2). -The maximum pair sum is max(3+5, 4+4, 6+2) = max(8, 8, 8) = 8. -- -
-
Constraints:
- -n == nums.length2 <= n <= 105n is even.1 <= nums[i] <= 105The pair sum of a pair (a,b) is equal to a + b. The maximum pair sum is the largest pair sum in a list of pairs.
(1,5), (2,3), and (4,4), the maximum pair sum would be max(1+5, 2+3, 4+4) = max(6, 5, 8) = 8.Given an array nums of even length n, pair up the elements of nums into n / 2 pairs such that:
nums is in exactly one pair, andReturn the minimized maximum pair sum after optimally pairing up the elements.
+ ++
Example 1:
+ ++Input: nums = [3,5,2,3] +Output: 7 +Explanation: The elements can be paired up into pairs (3,3) and (5,2). +The maximum pair sum is max(3+3, 5+2) = max(6, 7) = 7. ++ +
Example 2:
+ ++Input: nums = [3,5,4,2,4,6] +Output: 8 +Explanation: The elements can be paired up into pairs (3,5), (4,4), and (6,2). +The maximum pair sum is max(3+5, 4+4, 6+2) = max(8, 8, 8) = 8. ++ +
+
Constraints:
+ +n == nums.length2 <= n <= 105n is even.1 <= nums[i] <= 105English description is not available for the problem. Please switch to Chinese.
+English description is not available for the problem. Please switch to Chinese.
diff --git a/leetcode-cn/problem (English)/整数的英语表示(English) [english-int-lcci].html b/leetcode-cn/problem (English)/整数的英语表示(English) [english-int-lcci].html index 019df598..ee3a792d 100644 --- a/leetcode-cn/problem (English)/整数的英语表示(English) [english-int-lcci].html +++ b/leetcode-cn/problem (English)/整数的英语表示(English) [english-int-lcci].html @@ -1,26 +1,26 @@ -Given any integer, print an English phrase that describes the integer (e.g., "One Thousand Two Hundred Thirty Four").
- -Example 1:
- --Input: 123 -Output: "One Hundred Twenty Three" -- -
Example 2:
- --Input: 12345 -Output: "Twelve Thousand Three Hundred Forty Five"- -
Example 3:
- --Input: 1234567 -Output: "One Million Two Hundred Thirty Four Thousand Five Hundred Sixty Seven"- -
Example 4:
- --Input: 1234567891 -Output: "One Billion Two Hundred Thirty Four Million Five Hundred Sixty Seven Thousand Eight Hundred Ninety One"+
Given any integer, print an English phrase that describes the integer (e.g., "One Thousand Two Hundred Thirty Four").
+ +Example 1:
+ ++Input: 123 +Output: "One Hundred Twenty Three" ++ +
Example 2:
+ ++Input: 12345 +Output: "Twelve Thousand Three Hundred Forty Five"+ +
Example 3:
+ ++Input: 1234567 +Output: "One Million Two Hundred Thirty Four Thousand Five Hundred Sixty Seven"+ +
Example 4:
+ ++Input: 1234567891 +Output: "One Billion Two Hundred Thirty Four Million Five Hundred Sixty Seven Thousand Eight Hundred Ninety One"diff --git a/leetcode-cn/problem (English)/整数转换(English) [convert-integer-lcci].html b/leetcode-cn/problem (English)/整数转换(English) [convert-integer-lcci].html index 72d9c8e1..c8807562 100644 --- a/leetcode-cn/problem (English)/整数转换(English) [convert-integer-lcci].html +++ b/leetcode-cn/problem (English)/整数转换(English) [convert-integer-lcci].html @@ -1,21 +1,21 @@ -
Write a function to determine the number of bits you would need to flip to convert integer A to integer B.
- -Example1:
- -- Input: A = 29 (0b11101), B = 15 (0b01111) - Output: 2 -- -
Example2:
- -- Input: A = 1,B = 2 - Output: 2 -- -
Note:
- --2147483648 <= A, B <= 2147483647Write a function to determine the number of bits you would need to flip to convert integer A to integer B.
+ +Example1:
+ ++ Input: A = 29 (0b11101), B = 15 (0b01111) + Output: 2 ++ +
Example2:
+ ++ Input: A = 1,B = 2 + Output: 2 ++ +
Note:
+ +-2147483648 <= A, B <= 2147483647You are given an m x n matrix of characters box representing a side-view of a box. Each cell of the box is one of the following:
'#''*''.'The box is rotated 90 degrees clockwise, causing some of the stones to fall due to gravity. Each stone falls down until it lands on an obstacle, another stone, or the bottom of the box. Gravity does not affect the obstacles' positions, and the inertia from the box's rotation does not affect the stones' horizontal positions.
- -It is guaranteed that each stone in box rests on an obstacle, another stone, or the bottom of the box.
Return an n x m matrix representing the box after the rotation described above.
-
Example 1:
- -
-Input: box = [["#",".","#"]] -Output: [["."], - ["#"], - ["#"]] -- -
Example 2:
- -
-Input: box = [["#",".","*","."], - ["#","#","*","."]] -Output: [["#","."], - ["#","#"], - ["*","*"], - [".","."]] -- -
Example 3:
- -
-Input: box = [["#","#","*",".","*","."], - ["#","#","#","*",".","."], - ["#","#","#",".","#","."]] -Output: [[".","#","#"], - [".","#","#"], - ["#","#","*"], - ["#","*","."], - ["#",".","*"], - ["#",".","."]] -- -
-
Constraints:
- -m == box.lengthn == box[i].length1 <= m, n <= 500box[i][j] is either '#', '*', or '.'.You are given an m x n matrix of characters box representing a side-view of a box. Each cell of the box is one of the following:
'#''*''.'The box is rotated 90 degrees clockwise, causing some of the stones to fall due to gravity. Each stone falls down until it lands on an obstacle, another stone, or the bottom of the box. Gravity does not affect the obstacles' positions, and the inertia from the box's rotation does not affect the stones' horizontal positions.
+ +It is guaranteed that each stone in box rests on an obstacle, another stone, or the bottom of the box.
Return an n x m matrix representing the box after the rotation described above.
+
Example 1:
+ +
+Input: box = [["#",".","#"]] +Output: [["."], + ["#"], + ["#"]] ++ +
Example 2:
+ +
+Input: box = [["#",".","*","."], + ["#","#","*","."]] +Output: [["#","."], + ["#","#"], + ["*","*"], + [".","."]] ++ +
Example 3:
+ +
+Input: box = [["#","#","*",".","*","."], + ["#","#","#","*",".","."], + ["#","#","#",".","#","."]] +Output: [[".","#","#"], + [".","#","#"], + ["#","#","*"], + ["#","*","."], + ["#",".","*"], + ["#",".","."]] ++ +
+
Constraints:
+ +m == box.lengthn == box[i].length1 <= m, n <= 500box[i][j] is either '#', '*', or '.'.Given an image represented by an N x N matrix, where each pixel in the image is 4 bytes, write a method to rotate the image by 90 degrees. Can you do this in place?
- -- -
Example 1:
- --Given matrix = -[ - [1,2,3], - [4,5,6], - [7,8,9] -], - -Rotate the matrix in place. It becomes: -[ - [7,4,1], - [8,5,2], - [9,6,3] -] -- -
Example 2:
- --Given matrix = -[ - [ 5, 1, 9,11], - [ 2, 4, 8,10], - [13, 3, 6, 7], - [15,14,12,16] -], - -Rotate the matrix in place. It becomes: -[ - [15,13, 2, 5], - [14, 3, 4, 1], - [12, 6, 8, 9], - [16, 7,10,11] -] -+
Given an image represented by an N x N matrix, where each pixel in the image is 4 bytes, write a method to rotate the image by 90 degrees. Can you do this in place?
+ ++ +
Example 1:
+ ++Given matrix = +[ + [1,2,3], + [4,5,6], + [7,8,9] +], + +Rotate the matrix in place. It becomes: +[ + [7,4,1], + [8,5,2], + [9,6,3] +] ++ +
Example 2:
+ ++Given matrix = +[ + [ 5, 1, 9,11], + [ 2, 4, 8,10], + [13, 3, 6, 7], + [15,14,12,16] +], + +Rotate the matrix in place. It becomes: +[ + [15,13, 2, 5], + [14, 3, 4, 1], + [12, 6, 8, 9], + [16, 7,10,11] +] +diff --git a/leetcode-cn/problem (English)/无重复字符串的排列组合(English) [permutation-i-lcci].html b/leetcode-cn/problem (English)/无重复字符串的排列组合(English) [permutation-i-lcci].html index fa9bdf23..cdc7273c 100644 --- a/leetcode-cn/problem (English)/无重复字符串的排列组合(English) [permutation-i-lcci].html +++ b/leetcode-cn/problem (English)/无重复字符串的排列组合(English) [permutation-i-lcci].html @@ -1,22 +1,22 @@ -
Write a method to compute all permutations of a string of unique characters.
- -Example1:
- -- Input: S = "qwe" - Output: ["qwe", "qew", "wqe", "weq", "ewq", "eqw"] -- -
Example2:
- -- Input: S = "ab" - Output: ["ab", "ba"] -- -
Note:
- -1 <= S.length <= 9Write a method to compute all permutations of a string of unique characters.
+ +Example1:
+ ++ Input: S = "qwe" + Output: ["qwe", "qew", "wqe", "weq", "ewq", "eqw"] ++ +
Example2:
+ ++ Input: S = "ab" + Output: ["ab", "ba"] ++ +
Note:
+ +1 <= S.length <= 9English description is not available for the problem. Please switch to Chinese.
+English description is not available for the problem. Please switch to Chinese.
diff --git a/leetcode-cn/problem (English)/最佳直线(English) [best-line-lcci].html b/leetcode-cn/problem (English)/最佳直线(English) [best-line-lcci].html index 5793fd16..fe686a7c 100644 --- a/leetcode-cn/problem (English)/最佳直线(English) [best-line-lcci].html +++ b/leetcode-cn/problem (English)/最佳直线(English) [best-line-lcci].html @@ -1,18 +1,18 @@ -Given a two-dimensional graph with points on it, find a line which passes the most number of points.
- -Assume all the points that passed by the line are stored in list S sorted by their number. You need to return [S[0], S[1]], that is , two points that have smallest number. If there are more than one line that passes the most number of points, choose the one that has the smallest S[0]. If there are more that one line that has the same S[0], choose the one that has smallest S[1].
Example:
- --Input: [[0,0],[1,1],[1,0],[2,0]] -Output: [0,2] -Explanation: The numbers of points passed by the line are [0,2,3]. -- -
Note:
- -2 <= len(Points) <= 300len(Points[i]) = 2Given a two-dimensional graph with points on it, find a line which passes the most number of points.
+ +Assume all the points that passed by the line are stored in list S sorted by their number. You need to return [S[0], S[1]], that is , two points that have smallest number. If there are more than one line that passes the most number of points, choose the one that has the smallest S[0]. If there are more that one line that has the same S[0], choose the one that has smallest S[1].
Example:
+ ++Input: [[0,0],[1,1],[1,0],[2,0]] +Output: [0,2] +Explanation: The numbers of points passed by the line are [0,2,3]. ++ +
Note:
+ +2 <= len(Points) <= 300len(Points[i]) = 2The alternating sum of a 0-indexed array is defined as the sum of the elements at even indices minus the sum of the elements at odd indices.
- -[4,2,5,3] is (4 + 5) - (2 + 3) = 4.Given an array nums, return the maximum alternating sum of any subsequence of nums (after reindexing the elements of the subsequence).
A subsequence of an array is a new array generated from the original array by deleting some elements (possibly none) without changing the remaining elements' relative order. For example, [2,7,4] is a subsequence of [4,2,3,7,2,1,4] (the underlined elements), while [2,4,2] is not.
-
Example 1:
- --Input: nums = [4,2,5,3] -Output: 7 -Explanation: It is optimal to choose the subsequence [4,2,5] with alternating sum (4 + 5) - 2 = 7. -- -
Example 2:
- --Input: nums = [5,6,7,8] -Output: 8 -Explanation: It is optimal to choose the subsequence [8] with alternating sum 8. -- -
Example 3:
- --Input: nums = [6,2,1,2,4,5] -Output: 10 -Explanation: It is optimal to choose the subsequence [6,1,5] with alternating sum (6 + 5) - 1 = 10. -- -
-
Constraints:
- -1 <= nums.length <= 1051 <= nums[i] <= 105The alternating sum of a 0-indexed array is defined as the sum of the elements at even indices minus the sum of the elements at odd indices.
+ +[4,2,5,3] is (4 + 5) - (2 + 3) = 4.Given an array nums, return the maximum alternating sum of any subsequence of nums (after reindexing the elements of the subsequence).
A subsequence of an array is a new array generated from the original array by deleting some elements (possibly none) without changing the remaining elements' relative order. For example, [2,7,4] is a subsequence of [4,2,3,7,2,1,4] (the underlined elements), while [2,4,2] is not.
+
Example 1:
+ ++Input: nums = [4,2,5,3] +Output: 7 +Explanation: It is optimal to choose the subsequence [4,2,5] with alternating sum (4 + 5) - 2 = 7. ++ +
Example 2:
+ ++Input: nums = [5,6,7,8] +Output: 8 +Explanation: It is optimal to choose the subsequence [8] with alternating sum 8. ++ +
Example 3:
+ ++Input: nums = [6,2,1,2,4,5] +Output: 10 +Explanation: It is optimal to choose the subsequence [6,1,5] with alternating sum (6 + 5) - 1 = 10. ++ +
+
Constraints:
+ +1 <= nums.length <= 1051 <= nums[i] <= 105Given an NxM matrix of positive and negative integers, write code to find the submatrix with the largest possible sum.
- -Return an array [r1, c1, r2, c2], where r1, c1 are the row number and the column number of the submatrix's upper left corner respectively, and r2, c2 are the row number of and the column number of lower right corner. If there are more than one answers, return any one of them.
Note: This problem is slightly different from the original one in the book.
- -Example:
- -
-Input:
-[
- [-1,0],
- [0,-1]
-]
-Output: [0,1,0,1]
-
-Note:
- -1 <= matrix.length, matrix[0].length <= 200Given an NxM matrix of positive and negative integers, write code to find the submatrix with the largest possible sum.
+ +Return an array [r1, c1, r2, c2], where r1, c1 are the row number and the column number of the submatrix's upper left corner respectively, and r2, c2 are the row number of and the column number of lower right corner. If there are more than one answers, return any one of them.
Note: This problem is slightly different from the original one in the book.
+ +Example:
+ +
+Input:
+[
+ [-1,0],
+ [0,-1]
+]
+Output: [0,1,0,1]
+
+Note:
+ +1 <= matrix.length, matrix[0].length <= 200Write a method that finds the maximum of two numbers. You should not use if-else or any other comparison operator.
- -Example:
- --Input: a = 1, b = 2 -Output: 2 -+
Write a method that finds the maximum of two numbers. You should not use if-else or any other comparison operator.
+ +Example:
+ ++Input: a = 1, b = 2 +Output: 2 +diff --git a/leetcode-cn/problem (English)/最大黑方阵(English) [max-black-square-lcci].html b/leetcode-cn/problem (English)/最大黑方阵(English) [max-black-square-lcci].html index 8eb73a81..ae719452 100644 --- a/leetcode-cn/problem (English)/最大黑方阵(English) [max-black-square-lcci].html +++ b/leetcode-cn/problem (English)/最大黑方阵(English) [max-black-square-lcci].html @@ -1,34 +1,34 @@ -
Imagine you have a square matrix, where each cell (pixel) is either black or white Design an algorithm to find the maximum subsquare such that all four borders are filled with black pixels.
- -Return an array [r, c, size], where r, c are the row number and the column number of the subsquare's upper left corner respectively, and size is the side length of the subsquare. If there are more than one answers, return the one that has smallest r. If there are more than one answers that have the same r, return the one that has smallest c. If there's no answer, return an empty array.
Example 1:
- --Input: -[ - [1,0,1], - [0,0,1], - [0,0,1] -] -Output: [1,0,2] -Explanation: 0 represents black, and 1 represents white, bold elements in the input is the answer. -- -
Example 2:
- --Input: -[ - [0,1,1], - [1,0,1], - [1,1,0] -] -Output: [0,0,1] -- -
Note:
- -matrix.length == matrix[0].length <= 200Imagine you have a square matrix, where each cell (pixel) is either black or white Design an algorithm to find the maximum subsquare such that all four borders are filled with black pixels.
+ +Return an array [r, c, size], where r, c are the row number and the column number of the subsquare's upper left corner respectively, and size is the side length of the subsquare. If there are more than one answers, return the one that has smallest r. If there are more than one answers that have the same r, return the one that has smallest c. If there's no answer, return an empty array.
Example 1:
+ ++Input: +[ + [1,0,1], + [0,0,1], + [0,0,1] +] +Output: [1,0,2] +Explanation: 0 represents black, and 1 represents white, bold elements in the input is the answer. ++ +
Example 2:
+ ++Input: +[ + [0,1,1], + [1,0,1], + [1,1,0] +] +Output: [0,0,1] ++ +
Note:
+ +matrix.length == matrix[0].length <= 200Design an algorithm to find the smallest K numbers in an array.
- -Example:
- --Input: arr = [1,3,5,7,2,4,6,8], k = 4 -Output: [1,2,3,4] -- -
Note:
- -0 <= len(arr) <= 1000000 <= k <= min(100000, len(arr))Design an algorithm to find the smallest K numbers in an array.
+ +Example:
+ ++Input: arr = [1,3,5,7,2,4,6,8], k = 4 +Output: [1,2,3,4] ++ +
Note:
+ +0 <= len(arr) <= 1000000 <= k <= min(100000, len(arr))You are a hiker preparing for an upcoming hike. You are given heights, a 2D array of size rows x columns, where heights[row][col] represents the height of cell (row, col). You are situated in the top-left cell, (0, 0), and you hope to travel to the bottom-right cell, (rows-1, columns-1) (i.e., 0-indexed). You can move up, down, left, or right, and you wish to find a route that requires the minimum effort.
A route's effort is the maximum absolute difference in heights between two consecutive cells of the route.
- -Return the minimum effort required to travel from the top-left cell to the bottom-right cell.
- --
Example 1:
- -
-Input: heights = [[1,2,2],[3,8,2],[5,3,5]] -Output: 2 -Explanation: The route of [1,3,5,3,5] has a maximum absolute difference of 2 in consecutive cells. -This is better than the route of [1,2,2,2,5], where the maximum absolute difference is 3. -- -
Example 2:
- -
-Input: heights = [[1,2,3],[3,8,4],[5,3,5]] -Output: 1 -Explanation: The route of [1,2,3,4,5] has a maximum absolute difference of 1 in consecutive cells, which is better than route [1,3,5,3,5]. -- -
Example 3:
-
--Input: heights = [[1,2,1,1,1],[1,2,1,2,1],[1,2,1,2,1],[1,2,1,2,1],[1,1,1,2,1]] -Output: 0 -Explanation: This route does not require any effort. -- -
-
Constraints:
- -rows == heights.lengthcolumns == heights[i].length1 <= rows, columns <= 1001 <= heights[i][j] <= 106You are a hiker preparing for an upcoming hike. You are given heights, a 2D array of size rows x columns, where heights[row][col] represents the height of cell (row, col). You are situated in the top-left cell, (0, 0), and you hope to travel to the bottom-right cell, (rows-1, columns-1) (i.e., 0-indexed). You can move up, down, left, or right, and you wish to find a route that requires the minimum effort.
A route's effort is the maximum absolute difference in heights between two consecutive cells of the route.
+ +Return the minimum effort required to travel from the top-left cell to the bottom-right cell.
+ ++
Example 1:
+ +
+Input: heights = [[1,2,2],[3,8,2],[5,3,5]] +Output: 2 +Explanation: The route of [1,3,5,3,5] has a maximum absolute difference of 2 in consecutive cells. +This is better than the route of [1,2,2,2,5], where the maximum absolute difference is 3. ++ +
Example 2:
+ +
+Input: heights = [[1,2,3],[3,8,4],[5,3,5]] +Output: 1 +Explanation: The route of [1,2,3,4,5] has a maximum absolute difference of 1 in consecutive cells, which is better than route [1,3,5,3,5]. ++ +
Example 3:
+
++Input: heights = [[1,2,1,1,1],[1,2,1,2,1],[1,2,1,2,1],[1,2,1,2,1],[1,1,1,2,1]] +Output: 0 +Explanation: This route does not require any effort. ++ +
+
Constraints:
+ +rows == heights.lengthcolumns == heights[i].length1 <= rows, columns <= 1001 <= heights[i][j] <= 106Given two arrays of integers, compute the pair of values (one value in each array) with the smallest (non-negative) difference. Return the difference.
- -Example:
- -
-Input: {1, 3, 15, 11, 2}, {23, 127, 235, 19, 8}
-Output: 3, the pair (11, 8)
-
-
-Note:
- -1 <= a.length, b.length <= 100000-2147483648 <= a[i], b[i] <= 2147483647Given two arrays of integers, compute the pair of values (one value in each array) with the smallest (non-negative) difference. Return the difference.
+ +Example:
+ +
+Input: {1, 3, 15, 11, 2}, {23, 127, 235, 19, 8}
+Output: 3, the pair (11, 8)
+
+
+Note:
+ +1 <= a.length, b.length <= 100000-2147483648 <= a[i], b[i] <= 2147483647Given a sorted (increasing order) array with unique integer elements, write an algorithm to create a binary search tree with minimal height.
- -Example:
- --Given sorted array: [-10,-3,0,5,9], - -One possible answer is: [0,-3,9,-10,null,5],which represents the following tree: - - 0 - / \ - -3 9 - / / - -10 5 -+
Given a sorted (increasing order) array with unique integer elements, write an algorithm to create a binary search tree with minimal height.
+ +Example:
+ ++Given sorted array: [-10,-3,0,5,9], + +One possible answer is: [0,-3,9,-10,null,5],which represents the following tree: + + 0 + / \ + -3 9 + / / + -10 5 +diff --git a/leetcode-cn/problem (English)/最少操作使数组递增(English) [minimum-operations-to-make-the-array-increasing].html b/leetcode-cn/problem (English)/最少操作使数组递增(English) [minimum-operations-to-make-the-array-increasing].html index 009e8c1a..549ba5db 100644 --- a/leetcode-cn/problem (English)/最少操作使数组递增(English) [minimum-operations-to-make-the-array-increasing].html +++ b/leetcode-cn/problem (English)/最少操作使数组递增(English) [minimum-operations-to-make-the-array-increasing].html @@ -1,43 +1,43 @@ -
You are given an integer array nums (0-indexed). In one operation, you can choose an element of the array and increment it by 1.
nums = [1,2,3], you can choose to increment nums[1] to make nums = [1,3,3].Return the minimum number of operations needed to make nums strictly increasing.
An array nums is strictly increasing if nums[i] < nums[i+1] for all 0 <= i < nums.length - 1. An array of length 1 is trivially strictly increasing.
-
Example 1:
- --Input: nums = [1,1,1] -Output: 3 -Explanation: You can do the following operations: -1) Increment nums[2], so nums becomes [1,1,2]. -2) Increment nums[1], so nums becomes [1,2,2]. -3) Increment nums[2], so nums becomes [1,2,3]. -- -
Example 2:
- --Input: nums = [1,5,2,4,1] -Output: 14 -- -
Example 3:
- --Input: nums = [8] -Output: 0 -- -
-
Constraints:
- -1 <= nums.length <= 50001 <= nums[i] <= 104You are given an integer array nums (0-indexed). In one operation, you can choose an element of the array and increment it by 1.
nums = [1,2,3], you can choose to increment nums[1] to make nums = [1,3,3].Return the minimum number of operations needed to make nums strictly increasing.
An array nums is strictly increasing if nums[i] < nums[i+1] for all 0 <= i < nums.length - 1. An array of length 1 is trivially strictly increasing.
+
Example 1:
+ ++Input: nums = [1,1,1] +Output: 3 +Explanation: You can do the following operations: +1) Increment nums[2], so nums becomes [1,1,2]. +2) Increment nums[1], so nums becomes [1,2,2]. +3) Increment nums[2], so nums becomes [1,2,3]. ++ +
Example 2:
+ ++Input: nums = [1,5,2,4,1] +Output: 14 ++ +
Example 3:
+ ++Input: nums = [8] +Output: 0 ++ +
+
Constraints:
+ +1 <= nums.length <= 50001 <= nums[i] <= 104You are given two arrays, one shorter (with all distinct elements) and one longer. Find the shortest subarray in the longer array that contains all the elements in the shorter array. The items can appear in any order.
- -Return the indexes of the leftmost and the rightmost elements of the array. If there are more than one answer, return the one that has the smallest left index. If there is no answer, return an empty array.
- -Example 1:
- -
-Input:
-big = [7,5,9,0,2,1,3,5,7,9,1,1,5,8,8,9,7]
-small = [1,5,9]
-Output: [7,10]
-
-Example 2:
- -
-Input:
-big = [1,2,3]
-small = [4]
-Output: []
-
-Note:
- -big.length <= 1000001 <= small.length <= 100000You are given two arrays, one shorter (with all distinct elements) and one longer. Find the shortest subarray in the longer array that contains all the elements in the shorter array. The items can appear in any order.
+ +Return the indexes of the leftmost and the rightmost elements of the array. If there are more than one answer, return the one that has the smallest left index. If there is no answer, return an empty array.
+ +Example 1:
+ +
+Input:
+big = [7,5,9,0,2,1,3,5,7,9,1,1,5,8,8,9,7]
+small = [1,5,9]
+Output: [7,10]
+
+Example 2:
+ +
+Input:
+big = [1,2,3]
+small = [4]
+Output: []
+
+Note:
+ +big.length <= 1000001 <= small.length <= 100000A wonderful string is a string where at most one letter appears an odd number of times.
- -"ccjjc" and "abab" are wonderful, but "ab" is not.Given a string word that consists of the first ten lowercase English letters ('a' through 'j'), return the number of wonderful non-empty substrings in word. If the same substring appears multiple times in word, then count each occurrence separately.
A substring is a contiguous sequence of characters in a string.
- --
Example 1:
- --Input: word = "aba" -Output: 4 -Explanation: The four wonderful substrings are underlined below: -- "aba" -> "a" -- "aba" -> "b" -- "aba" -> "a" -- "aba" -> "aba" -- -
Example 2:
- --Input: word = "aabb" -Output: 9 -Explanation: The nine wonderful substrings are underlined below: -- "aabb" -> "a" -- "aabb" -> "aa" -- "aabb" -> "aab" -- "aabb" -> "aabb" -- "aabb" -> "a" -- "aabb" -> "abb" -- "aabb" -> "b" -- "aabb" -> "bb" -- "aabb" -> "b" -- -
Example 3:
- --Input: word = "he" -Output: 2 -Explanation: The two wonderful substrings are underlined below: -- "he" -> "h" -- "he" -> "e" -- -
-
Constraints:
- -1 <= word.length <= 105word consists of lowercase English letters from 'a' to 'j'.A wonderful string is a string where at most one letter appears an odd number of times.
+ +"ccjjc" and "abab" are wonderful, but "ab" is not.Given a string word that consists of the first ten lowercase English letters ('a' through 'j'), return the number of wonderful non-empty substrings in word. If the same substring appears multiple times in word, then count each occurrence separately.
A substring is a contiguous sequence of characters in a string.
+ ++
Example 1:
+ ++Input: word = "aba" +Output: 4 +Explanation: The four wonderful substrings are underlined below: +- "aba" -> "a" +- "aba" -> "b" +- "aba" -> "a" +- "aba" -> "aba" ++ +
Example 2:
+ ++Input: word = "aabb" +Output: 9 +Explanation: The nine wonderful substrings are underlined below: +- "aabb" -> "a" +- "aabb" -> "aa" +- "aabb" -> "aab" +- "aabb" -> "aabb" +- "aabb" -> "a" +- "aabb" -> "abb" +- "aabb" -> "b" +- "aabb" -> "bb" +- "aabb" -> "b" ++ +
Example 3:
+ ++Input: word = "he" +Output: 2 +Explanation: The two wonderful substrings are underlined below: +- "he" -> "h" +- "he" -> "e" ++ +
+
Constraints:
+ +1 <= word.length <= 105word consists of lowercase English letters from 'a' to 'j'.Given a list of words, write a program to find the longest word made of other words in the list. If there are more than one answer, return the one that has smallest lexicographic order. If no answer, return an empty string.
- -Example:
- --Input: ["cat","banana","dog","nana","walk","walker","dogwalker"] -Output: "dogwalker" -Explanation: "dogwalker" can be made of "dog" and "walker". -- -
Note:
- -0 <= len(words) <= 2001 <= len(words[i]) <= 100Given a list of words, write a program to find the longest word made of other words in the list. If there are more than one answer, return the one that has smallest lexicographic order. If no answer, return an empty string.
+ +Example:
+ ++Input: ["cat","banana","dog","nana","walk","walker","dogwalker"] +Output: "dogwalker" +Explanation: "dogwalker" can be made of "dog" and "walker". ++ +
Note:
+ +0 <= len(words) <= 2001 <= len(words[i]) <= 100There is a directed graph of n colored nodes and m edges. The nodes are numbered from 0 to n - 1.
You are given a string colors where colors[i] is a lowercase English letter representing the color of the ith node in this graph (0-indexed). You are also given a 2D array edges where edges[j] = [aj, bj] indicates that there is a directed edge from node aj to node bj.
A valid path in the graph is a sequence of nodes x1 -> x2 -> x3 -> ... -> xk such that there is a directed edge from xi to xi+1 for every 1 <= i < k. The color value of the path is the number of nodes that are colored the most frequently occurring color along that path.
Return the largest color value of any valid path in the given graph, or -1 if the graph contains a cycle.
-
Example 1:
- -
-Input: colors = "abaca", edges = [[0,1],[0,2],[2,3],[3,4]]
-Output: 3
-Explanation: The path 0 -> 2 -> 3 -> 4 contains 3 nodes that are colored "a" (red in the above image).
-
-
-Example 2:
- -
-Input: colors = "a", edges = [[0,0]] -Output: -1 -Explanation: There is a cycle from 0 to 0. -- -
-
Constraints:
- -n == colors.lengthm == edges.length1 <= n <= 1050 <= m <= 105colors consists of lowercase English letters.0 <= aj, bj < nThere is a directed graph of n colored nodes and m edges. The nodes are numbered from 0 to n - 1.
You are given a string colors where colors[i] is a lowercase English letter representing the color of the ith node in this graph (0-indexed). You are also given a 2D array edges where edges[j] = [aj, bj] indicates that there is a directed edge from node aj to node bj.
A valid path in the graph is a sequence of nodes x1 -> x2 -> x3 -> ... -> xk such that there is a directed edge from xi to xi+1 for every 1 <= i < k. The color value of the path is the number of nodes that are colored the most frequently occurring color along that path.
Return the largest color value of any valid path in the given graph, or -1 if the graph contains a cycle.
+
Example 1:
+ +
+Input: colors = "abaca", edges = [[0,1],[0,2],[2,3],[3,4]]
+Output: 3
+Explanation: The path 0 -> 2 -> 3 -> 4 contains 3 nodes that are colored "a" (red in the above image).
+
+
+Example 2:
+ +
+Input: colors = "a", edges = [[0,0]] +Output: -1 +Explanation: There is a cycle from 0 to 0. ++ +
+
Constraints:
+ +n == colors.lengthm == edges.length1 <= n <= 1050 <= m <= 105colors consists of lowercase English letters.0 <= aj, bj < nWrite a method to compute all permutations of a string whose characters are not necessarily unique. The list of permutations should not have duplicates.
- -Example1:
- -- Input: S = "qqe" - Output: ["eqq","qeq","qqe"] -- -
Example2:
- -- Input: S = "ab" - Output: ["ab", "ba"] -- -
Note:
- -1 <= S.length <= 9Write a method to compute all permutations of a string whose characters are not necessarily unique. The list of permutations should not have duplicates.
+ +Example1:
+ ++ Input: S = "qqe" + Output: ["eqq","qeq","qqe"] ++ +
Example2:
+ ++ Input: S = "ab" + Output: ["ab", "ba"] ++ +
Note:
+ +1 <= S.length <= 9English description is not available. Please switch to Chinese.
+English description is not available. Please switch to Chinese.
diff --git a/leetcode-cn/problem (English)/栈排序(English) [sort-of-stacks-lcci].html b/leetcode-cn/problem (English)/栈排序(English) [sort-of-stacks-lcci].html index bafb55a8..942464f5 100644 --- a/leetcode-cn/problem (English)/栈排序(English) [sort-of-stacks-lcci].html +++ b/leetcode-cn/problem (English)/栈排序(English) [sort-of-stacks-lcci].html @@ -1,27 +1,27 @@ -Write a program to sort a stack such that the smallest items are on the top. You can use an additional temporary stack, but you may not copy the elements into any other data structure (such as an array). The stack supports the following operations: push, pop, peek, and isEmpty. When the stack is empty, peek should return -1.
Example1:
- -- Input: -["SortedStack", "push", "push", "peek", "pop", "peek"] -[[], [1], [2], [], [], []] - Output: -[null,null,null,1,null,2] -- -
Example2:
- -- Input: -["SortedStack", "pop", "pop", "push", "pop", "isEmpty"] -[[], [], [], [1], [], []] - Output: -[null,null,null,null,null,true] -- -
Note:
- -Write a program to sort a stack such that the smallest items are on the top. You can use an additional temporary stack, but you may not copy the elements into any other data structure (such as an array). The stack supports the following operations: push, pop, peek, and isEmpty. When the stack is empty, peek should return -1.
Example1:
+ ++ Input: +["SortedStack", "push", "push", "peek", "pop", "peek"] +[[], [1], [2], [], [], []] + Output: +[null,null,null,1,null,2] ++ +
Example2:
+ ++ Input: +["SortedStack", "pop", "pop", "push", "pop", "isEmpty"] +[[], [], [], [1], [], []] + Output: +[null,null,null,null,null,true] ++ +
Note:
+ +How would you design a stack which, in addition to push and pop, has a function min which returns the minimum element? Push, pop and min should all operate in 0(1) time.
- -Example:
- --MinStack minStack = new MinStack(); -minStack.push(-2); -minStack.push(0); -minStack.push(-3); -minStack.getMin(); --> return -3. -minStack.pop(); -minStack.top(); --> return 0. -minStack.getMin(); --> return -2.+
How would you design a stack which, in addition to push and pop, has a function min which returns the minimum element? Push, pop and min should all operate in 0(1) time.
+ +Example:
+ ++MinStack minStack = new MinStack(); +minStack.push(-2); +minStack.push(0); +minStack.push(-3); +minStack.getMin(); --> return -3. +minStack.pop(); +minStack.top(); --> return 0. +minStack.getMin(); --> return -2.diff --git a/leetcode-cn/problem (English)/检查子树(English) [check-subtree-lcci].html b/leetcode-cn/problem (English)/检查子树(English) [check-subtree-lcci].html index ca998614..19640227 100644 --- a/leetcode-cn/problem (English)/检查子树(English) [check-subtree-lcci].html +++ b/leetcode-cn/problem (English)/检查子树(English) [check-subtree-lcci].html @@ -1,25 +1,25 @@ -
T1 and T2 are two very large binary trees. Create an algorithm to determine if T2 is a subtree of T1.
- -A tree T2 is a subtree of T1 if there exists a node n in T1 such that the subtree of n is identical to T2. That is, if you cut off the tree at node n, the two trees would be identical.
- -Note: This problem is slightly different from the original problem.
- -Example1:
- -- Input: t1 = [1, 2, 3], t2 = [2] - Output: true -- -
Example2:
- -- Input: t1 = [1, null, 2, 4], t2 = [3, 2] - Output: false -- -
Note:
- -T1 and T2 are two very large binary trees. Create an algorithm to determine if T2 is a subtree of T1.
+ +A tree T2 is a subtree of T1 if there exists a node n in T1 such that the subtree of n is identical to T2. That is, if you cut off the tree at node n, the two trees would be identical.
+ +Note: This problem is slightly different from the original problem.
+ +Example1:
+ ++ Input: t1 = [1, 2, 3], t2 = [2] + Output: true ++ +
Example2:
+ ++ Input: t1 = [1, null, 2, 4], t2 = [3, 2] + Output: false ++ +
Note:
+ +Implement a function to check if a binary tree is balanced. For the purposes of this question, a balanced tree is defined to be a tree such that the heights of the two subtrees of any node never differ by more than one.
- -
-Example 1:
-Given tree [3,9,20,null,null,15,7] - 3 - / \ - 9 20 - / \ - 15 7 -return true.- -
Example 2:
- --Given [1,2,2,3,3,null,null,4,4] - 1 - / \ - 2 2 - / \ - 3 3 - / \ -4 4 -return false.- -
+
Implement a function to check if a binary tree is balanced. For the purposes of this question, a balanced tree is defined to be a tree such that the heights of the two subtrees of any node never differ by more than one.
+ +
+Example 1:
+Given tree [3,9,20,null,null,15,7] + 3 + / \ + 9 20 + / \ + 15 7 +return true.+ +
Example 2:
+ ++Given [1,2,2,3,3,null,null,4,4] + 1 + / \ + 2 2 + / \ + 3 3 + / \ +4 4 +return false.+ +
diff --git a/leetcode-cn/problem (English)/棒球比赛(English) [baseball-game].html b/leetcode-cn/problem (English)/棒球比赛(English) [baseball-game].html index 5b600f28..c9e5a28f 100644 --- a/leetcode-cn/problem (English)/棒球比赛(English) [baseball-game].html +++ b/leetcode-cn/problem (English)/棒球比赛(English) [baseball-game].html @@ -9,7 +9,7 @@
"C" - Invalidate the previous score, removing it from the record. It is guaranteed there will always be a previous score.Return the sum of all the scores on the record.
+Return the sum of all the scores on the record. The test cases are generated so that the answer fits in a 32-bit integer.
Example 1:
diff --git a/leetcode-cn/problem (English)/模式匹配(English) [pattern-matching-lcci].html b/leetcode-cn/problem (English)/模式匹配(English) [pattern-matching-lcci].html index b6b0a280..02d358f8 100644 --- a/leetcode-cn/problem (English)/模式匹配(English) [pattern-matching-lcci].html +++ b/leetcode-cn/problem (English)/模式匹配(English) [pattern-matching-lcci].html @@ -1,38 +1,38 @@ -You are given two strings, pattern and value. The pattern string consists of just the letters a and b, describing a pattern within a string. For example, the string catcatgocatgo matches the pattern aabab (where cat is a and go is b). It also matches patterns like a, ab, and b. Write a method to determine if value matches pattern. a and b cannot be the same string.
- -Example 1:
- --Input: pattern = "abba", value = "dogcatcatdog" -Output: true -- -
Example 2:
- --Input: pattern = "abba", value = "dogcatcatfish" -Output: false -- -
Example 3:
- --Input: pattern = "aaaa", value = "dogcatcatdog" -Output: false -- -
Example 4:
- --Input: pattern = "abba", value = "dogdogdogdog" -Output: true -Explanation: "a"="dogdog",b="",vice versa. -- -
Note:
- -0 <= len(pattern) <= 10000 <= len(value) <= 1000pattern only contains "a" and "b", value only contains lowercase letters.You are given two strings, pattern and value. The pattern string consists of just the letters a and b, describing a pattern within a string. For example, the string catcatgocatgo matches the pattern aabab (where cat is a and go is b). It also matches patterns like a, ab, and b. Write a method to determine if value matches pattern. a and b cannot be the same string.
+ +Example 1:
+ ++Input: pattern = "abba", value = "dogcatcatdog" +Output: true ++ +
Example 2:
+ ++Input: pattern = "abba", value = "dogcatcatfish" +Output: false ++ +
Example 3:
+ ++Input: pattern = "aaaa", value = "dogcatcatdog" +Output: false ++ +
Example 4:
+ ++Input: pattern = "abba", value = "dogdogdogdog" +Output: true +Explanation: "a"="dogdog",b="",vice versa. ++ +
Note:
+ +0 <= len(pattern) <= 10000 <= len(value) <= 1000pattern only contains "a" and "b", value only contains lowercase letters.You have an integer matrix representing a plot of land, where the value at that location represents the height above sea level. A value of zero indicates water. A pond is a region of water connected vertically, horizontally, or diagonally. The size of the pond is the total number of connected water cells. Write a method to compute the sizes of all ponds in the matrix.
- -Example:
- --Input: -[ - [0,2,1,0], - [0,1,0,1], - [1,1,0,1], - [0,1,0,1] -] -Output: [1,2,4] -- -
Note:
- -0 < len(land) <= 10000 < len(land[i]) <= 1000You have an integer matrix representing a plot of land, where the value at that location represents the height above sea level. A value of zero indicates water. A pond is a region of water connected vertically, horizontally, or diagonally. The size of the pond is the total number of connected water cells. Write a method to compute the sizes of all ponds in the matrix.
+ +Example:
+ ++Input: +[ + [0,2,1,0], + [0,1,0,1], + [1,1,0,1], + [0,1,0,1] +] +Output: [1,2,4] ++ +
Note:
+ +0 < len(land) <= 10000 < len(land[i]) <= 1000English description is not available for the problem. Please switch to Chinese.
+English description is not available for the problem. Please switch to Chinese.
diff --git a/leetcode-cn/problem (English)/求和路径(English) [paths-with-sum-lcci].html b/leetcode-cn/problem (English)/求和路径(English) [paths-with-sum-lcci].html index 534739e7..d1066bd4 100644 --- a/leetcode-cn/problem (English)/求和路径(English) [paths-with-sum-lcci].html +++ b/leetcode-cn/problem (English)/求和路径(English) [paths-with-sum-lcci].html @@ -1,26 +1,26 @@ -You are given a binary tree in which each node contains an integer value (which might be positive or negative). Design an algorithm to count the number of paths that sum to a given value. The path does not need to start or end at the root or a leaf, but it must go downwards (traveling only from parent nodes to child nodes).
- -Example:
-Given the following tree and sum = 22,
- 5 - / \ - 4 8 - / / \ - 11 13 4 - / \ / \ - 7 2 5 1 -- -
Output:
- --3 -Explanation: Paths that have sum 22 are: [5,4,11,2], [5,8,4,5], [4,11,7]- -
Note:
- -node number <= 10000You are given a binary tree in which each node contains an integer value (which might be positive or negative). Design an algorithm to count the number of paths that sum to a given value. The path does not need to start or end at the root or a leaf, but it must go downwards (traveling only from parent nodes to child nodes).
+ +Example:
+Given the following tree and sum = 22,
+ 5 + / \ + 4 8 + / / \ + 11 13 4 + / \ / \ + 7 2 5 1 ++ +
Output:
+ ++3 +Explanation: Paths that have sum 22 are: [5,4,11,2], [5,8,4,5], [4,11,7]+ +
Note:
+ +node number <= 10000In the classic problem of the Towers of Hanoi, you have 3 towers and N disks of different sizes which can slide onto any tower. The puzzle starts with disks sorted in ascending order of size from top to bottom (i.e., each disk sits on top of an even larger one). You have the following constraints:
- -(1) Only one disk can be moved at a time.
-(2) A disk is slid off the top of one tower onto another tower.
-(3) A disk cannot be placed on top of a smaller disk.
Write a program to move the disks from the first tower to the last using stacks.
- -Example1:
- -- Input: A = [2, 1, 0], B = [], C = [] - Output: C = [2, 1, 0] -- -
Example2:
- -- Input: A = [1, 0], B = [], C = [] - Output: C = [1, 0] -- -
Note:
- -A.length <= 14In the classic problem of the Towers of Hanoi, you have 3 towers and N disks of different sizes which can slide onto any tower. The puzzle starts with disks sorted in ascending order of size from top to bottom (i.e., each disk sits on top of an even larger one). You have the following constraints:
+ +(1) Only one disk can be moved at a time.
+(2) A disk is slid off the top of one tower onto another tower.
+(3) A disk cannot be placed on top of a smaller disk.
Write a program to move the disks from the first tower to the last using stacks.
+ +Example1:
+ ++ Input: A = [2, 1, 0], B = [], C = [] + Output: C = [2, 1, 0] ++ +
Example2:
+ ++ Input: A = [1, 0], B = [], C = [] + Output: C = [1, 0] ++ +
Note:
+ +A.length <= 14You are given an array with all the numbers from 1 to N appearing exactly once, except for two number that is missing. How can you find the missing number in O(N) time and 0(1) space?
- -You can return the missing numbers in any order.
- -Example 1:
- -
-Input: [1]
-Output: [2,3]
-
-Example 2:
- -
-Input: [2,3]
-Output: [1,4]
-
-Note:
- -nums.length <= 30000You are given an array with all the numbers from 1 to N appearing exactly once, except for two number that is missing. How can you find the missing number in O(N) time and 0(1) space?
+ +You can return the missing numbers in any order.
+ +Example 1:
+ +
+Input: [1]
+Output: [2,3]
+
+Example 2:
+ +
+Input: [2,3]
+Output: [1,4]
+
+Note:
+ +nums.length <= 30000An array contains all the integers from 0 to n, except for one number which is missing. Write code to find the missing integer. Can you do it in O(n) time?
- -Note: This problem is slightly different from the original one the book.
- -Example 1:
- --Input: [3,0,1] -Output: 2- -
- -
Example 2:
- --Input: [9,6,4,2,3,5,7,0,1] -Output: 8 -+
An array contains all the integers from 0 to n, except for one number which is missing. Write code to find the missing integer. Can you do it in O(n) time?
+ +Note: This problem is slightly different from the original one the book.
+ +Example 1:
+ ++Input: [3,0,1] +Output: 2+ +
+ +
Example 2:
+ ++Input: [9,6,4,2,3,5,7,0,1] +Output: 8 +diff --git a/leetcode-cn/problem (English)/滑动窗口的最大值(English) [hua-dong-chuang-kou-de-zui-da-zhi-lcof].html b/leetcode-cn/problem (English)/滑动窗口的最大值(English) [hua-dong-chuang-kou-de-zui-da-zhi-lcof].html index 579f7fd7..5c5502aa 100644 --- a/leetcode-cn/problem (English)/滑动窗口的最大值(English) [hua-dong-chuang-kou-de-zui-da-zhi-lcof].html +++ b/leetcode-cn/problem (English)/滑动窗口的最大值(English) [hua-dong-chuang-kou-de-zui-da-zhi-lcof].html @@ -1 +1 @@ -
English description is not available for the problem. Please switch to Chinese.
+English description is not available for the problem. Please switch to Chinese.
diff --git a/leetcode-cn/problem (English)/特定深度节点链表(English) [list-of-depth-lcci].html b/leetcode-cn/problem (English)/特定深度节点链表(English) [list-of-depth-lcci].html index 18189d23..f3a9f144 100644 --- a/leetcode-cn/problem (English)/特定深度节点链表(English) [list-of-depth-lcci].html +++ b/leetcode-cn/problem (English)/特定深度节点链表(English) [list-of-depth-lcci].html @@ -1,19 +1,19 @@ -Given a binary tree, design an algorithm which creates a linked list of all the nodes at each depth (e.g., if you have a tree with depth D, you'll have D linked lists). Return a array containing all the linked lists.
- -- -
Example:
- --Input: [1,2,3,4,5,null,7,8] - - 1 - / \ - 2 3 - / \ \ - 4 5 7 - / - 8 - -Output: [[1],[2,3],[4,5,7],[8]] -+
Given a binary tree, design an algorithm which creates a linked list of all the nodes at each depth (e.g., if you have a tree with depth D, you'll have D linked lists). Return a array containing all the linked lists.
+ ++ +
Example:
+ ++Input: [1,2,3,4,5,null,7,8] + + 1 + / \ + 2 3 + / \ \ + 4 5 7 + / + 8 + +Output: [[1],[2,3],[4,5,7],[8]] +diff --git a/leetcode-cn/problem (English)/猜数字(English) [guess-numbers].html b/leetcode-cn/problem (English)/猜数字(English) [guess-numbers].html index 1866e7ae..b9fce7cd 100644 --- a/leetcode-cn/problem (English)/猜数字(English) [guess-numbers].html +++ b/leetcode-cn/problem (English)/猜数字(English) [guess-numbers].html @@ -1,2 +1,2 @@ -
English description is not available for the problem. Please switch to Chinese.
-
English description is not available for the problem. Please switch to Chinese.
+
Given a circular linked list, implement an algorithm that returns the node at the beginning of the loop.
- -Circular linked list: A (corrupt) linked list in which a node's next pointer points to an earlier node, so as to make a loop in the linked list.
- -Example 1:
- --Input: head = [3,2,0,-4], pos = 1 -Output: tail connects to node index 1- -
Example 2:
- --Input: head = [1,2], pos = 0 -Output: tail connects to node index 0- -
Example 3:
- --Input: head = [1], pos = -1 -Output: no cycle- -
Follow Up:
-Can you solve it without using additional space?
Given a circular linked list, implement an algorithm that returns the node at the beginning of the loop.
+ +Circular linked list: A (corrupt) linked list in which a node's next pointer points to an earlier node, so as to make a loop in the linked list.
+ +Example 1:
+ ++Input: head = [3,2,0,-4], pos = 1 +Output: tail connects to node index 1+ +
Example 2:
+ ++Input: head = [1,2], pos = 0 +Output: tail connects to node index 0+ +
Example 3:
+ ++Input: head = [1], pos = -1 +Output: no cycle+ +
Follow Up:
+Can you solve it without using additional space?
The Game of Master Mind is played as follows:
- -The computer has four slots, and each slot will contain a ball that is red (R). yellow (Y). green (G) or blue (B). For example, the computer might have RGGB (Slot #1 is red, Slots #2 and #3 are green, Slot #4 is blue).
- -You, the user, are trying to guess the solution. You might, for example, guess YRGB.
- -When you guess the correct color for the correct slot, you get a "hit:' If you guess a color that exists but is in the wrong slot, you get a "pseudo-hit:' Note that a slot that is a hit can never count as a pseudo-hit.
- -For example, if the actual solution is RGBY and you guess GGRR, you have one hit and one pseudo-hit. Write a method that, given a guess and a solution, returns the number of hits and pseudo-hits.
- -Given a sequence of colors solution, and a guess, write a method that return the number of hits and pseudo-hit answer, where answer[0] is the number of hits and answer[1] is the number of pseudo-hit.
Example:
- --Input: solution="RGBY",guess="GGRR" -Output: [1,1] -Explanation: hit once, pseudo-hit once. -- -
Note:
- -len(solution) = len(guess) = 4"R","G","B","Y" in solution and guess.The Game of Master Mind is played as follows:
+ +The computer has four slots, and each slot will contain a ball that is red (R). yellow (Y). green (G) or blue (B). For example, the computer might have RGGB (Slot #1 is red, Slots #2 and #3 are green, Slot #4 is blue).
+ +You, the user, are trying to guess the solution. You might, for example, guess YRGB.
+ +When you guess the correct color for the correct slot, you get a "hit:' If you guess a color that exists but is in the wrong slot, you get a "pseudo-hit:' Note that a slot that is a hit can never count as a pseudo-hit.
+ +For example, if the actual solution is RGBY and you guess GGRR, you have one hit and one pseudo-hit. Write a method that, given a guess and a solution, returns the number of hits and pseudo-hits.
+ +Given a sequence of colors solution, and a guess, write a method that return the number of hits and pseudo-hit answer, where answer[0] is the number of hits and answer[1] is the number of pseudo-hit.
Example:
+ ++Input: solution="RGBY",guess="GGRR" +Output: [1,1] +Explanation: hit once, pseudo-hit once. ++ +
Note:
+ +len(solution) = len(guess) = 4"R","G","B","Y" in solution and guess.Given a list of people with their birth and death years, implement a method to compute the year with the most number of people alive. You may assume that all people were born between 1900 and 2000 (inclusive). If a person was alive during any portion of that year, they should be included in that year's count. For example, Person (birth= 1908, death= 1909) is included in the counts for both 1908 and 1909.
- -If there are more than one years that have the most number of people alive, return the smallest one.
- -Example:
- -
-Input:
-birth = {1900, 1901, 1950}
-death = {1948, 1951, 2000}
-Output: 1901
-
-
-Note:
- -0 < birth.length == death.length <= 10000birth[i] <= death[i]Given a list of people with their birth and death years, implement a method to compute the year with the most number of people alive. You may assume that all people were born between 1900 and 2000 (inclusive). If a person was alive during any portion of that year, they should be included in that year's count. For example, Person (birth= 1908, death= 1909) is included in the counts for both 1908 and 1909.
+ +If there are more than one years that have the most number of people alive, return the smallest one.
+ +Example:
+ +
+Input:
+birth = {1900, 1901, 1950}
+death = {1948, 1951, 2000}
+Output: 1901
+
+
+Note:
+ +0 < birth.length == death.length <= 10000birth[i] <= death[i]Imagine a histogram (bar graph). Design an algorithm to compute the volume of water it could hold if someone poured water across the top. You can assume that each histogram bar has width 1.
- -
The above elevation map is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of water (blue section) are being trapped. Thanks Marcos for contributing this image!
- -Example:
- --Input: [0,1,0,2,1,0,1,3,2,1,2,1] -Output: 6+
Imagine a histogram (bar graph). Design an algorithm to compute the volume of water it could hold if someone poured water across the top. You can assume that each histogram bar has width 1.
+ +
The above elevation map is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of water (blue section) are being trapped. Thanks Marcos for contributing this image!
+ +Example:
+ ++Input: [0,1,0,2,1,0,1,3,2,1,2,1] +Output: 6diff --git a/leetcode-cn/problem (English)/石子游戏 VIII(English) [stone-game-viii].html b/leetcode-cn/problem (English)/石子游戏 VIII(English) [stone-game-viii].html index 416664c4..8335d110 100644 --- a/leetcode-cn/problem (English)/石子游戏 VIII(English) [stone-game-viii].html +++ b/leetcode-cn/problem (English)/石子游戏 VIII(English) [stone-game-viii].html @@ -1,60 +1,60 @@ -
Alice and Bob take turns playing a game, with Alice starting first.
- -There are n stones arranged in a row. On each player's turn, while the number of stones is more than one, they will do the following:
x > 1, and remove the leftmost x stones from the row.The game stops when only one stone is left in the row.
- -The score difference between Alice and Bob is (Alice's score - Bob's score). Alice's goal is to maximize the score difference, and Bob's goal is the minimize the score difference.
Given an integer array stones of length n where stones[i] represents the value of the ith stone from the left, return the score difference between Alice and Bob if they both play optimally.
-
Example 1:
- --Input: stones = [-1,2,-3,4,-5] -Output: 5 -Explanation: -- Alice removes the first 4 stones, adds (-1) + 2 + (-3) + 4 = 2 to her score, and places a stone of - value 2 on the left. stones = [2,-5]. -- Bob removes the first 2 stones, adds 2 + (-5) = -3 to his score, and places a stone of value -3 on - the left. stones = [-3]. -The difference between their scores is 2 - (-3) = 5. -- -
Example 2:
- --Input: stones = [7,-6,5,10,5,-2,-6] -Output: 13 -Explanation: -- Alice removes all stones, adds 7 + (-6) + 5 + 10 + 5 + (-2) + (-6) = 13 to her score, and places a - stone of value 13 on the left. stones = [13]. -The difference between their scores is 13 - 0 = 13. -- -
Example 3:
- --Input: stones = [-10,-12] -Output: -22 -Explanation: -- Alice can only make one move, which is to remove both stones. She adds (-10) + (-12) = -22 to her - score and places a stone of value -22 on the left. stones = [-22]. -The difference between their scores is (-22) - 0 = -22. -- -
-
Constraints:
- -n == stones.length2 <= n <= 105-104 <= stones[i] <= 104Alice and Bob take turns playing a game, with Alice starting first.
+ +There are n stones arranged in a row. On each player's turn, while the number of stones is more than one, they will do the following:
x > 1, and remove the leftmost x stones from the row.The game stops when only one stone is left in the row.
+ +The score difference between Alice and Bob is (Alice's score - Bob's score). Alice's goal is to maximize the score difference, and Bob's goal is the minimize the score difference.
Given an integer array stones of length n where stones[i] represents the value of the ith stone from the left, return the score difference between Alice and Bob if they both play optimally.
+
Example 1:
+ ++Input: stones = [-1,2,-3,4,-5] +Output: 5 +Explanation: +- Alice removes the first 4 stones, adds (-1) + 2 + (-3) + 4 = 2 to her score, and places a stone of + value 2 on the left. stones = [2,-5]. +- Bob removes the first 2 stones, adds 2 + (-5) = -3 to his score, and places a stone of value -3 on + the left. stones = [-3]. +The difference between their scores is 2 - (-3) = 5. ++ +
Example 2:
+ ++Input: stones = [7,-6,5,10,5,-2,-6] +Output: 13 +Explanation: +- Alice removes all stones, adds 7 + (-6) + 5 + 10 + 5 + (-2) + (-6) = 13 to her score, and places a + stone of value 13 on the left. stones = [13]. +The difference between their scores is 13 - 0 = 13. ++ +
Example 3:
+ ++Input: stones = [-10,-12] +Output: -22 +Explanation: +- Alice can only make one move, which is to remove both stones. She adds (-10) + (-12) = -22 to her + score and places a stone of value -22 on the left. stones = [-22]. +The difference between their scores is (-22) - 0 = -22. ++ +
+
Constraints:
+ +n == stones.length2 <= n <= 105-104 <= stones[i] <= 104Given an infinite number of quarters (25 cents), dimes (10 cents), nickels (5 cents), and pennies (1 cent), write code to calculate the number of ways of representing n cents. (The result may be large, so you should return it modulo 1000000007)
- -Example1:
- -- Input: n = 5 - Output: 2 - Explanation: There are two ways: -5=5 -5=1+1+1+1+1 -- -
Example2:
- -- Input: n = 10 - Output: 4 - Explanation: There are four ways: -10=10 -10=5+5 -10=5+1+1+1+1+1 -10=1+1+1+1+1+1+1+1+1+1 -- -
Notes:
- -You can assume:
- -Given an infinite number of quarters (25 cents), dimes (10 cents), nickels (5 cents), and pennies (1 cent), write code to calculate the number of ways of representing n cents. (The result may be large, so you should return it modulo 1000000007)
+ +Example1:
+ ++ Input: n = 5 + Output: 2 + Explanation: There are two ways: +5=5 +5=1+1+1+1+1 ++ +
Example2:
+ ++ Input: n = 10 + Output: 4 + Explanation: There are four ways: +10=10 +10=5+5 +10=5+1+1+1+1+1 +10=1+1+1+1+1+1+1+1+1+1 ++ +
Notes:
+ +You can assume:
+ +You are given a 2D integer array orders, where each orders[i] = [pricei, amounti, orderTypei] denotes that amounti orders have been placed of type orderTypei at the price pricei. The orderTypei is:
0 if it is a batch of buy orders, or1 if it is a batch of sell orders.Note that orders[i] represents a batch of amounti independent orders with the same price and order type. All orders represented by orders[i] will be placed before all orders represented by orders[i+1] for all valid i.
There is a backlog that consists of orders that have not been executed. The backlog is initially empty. When an order is placed, the following happens:
- -buy order, you look at the sell order with the smallest price in the backlog. If that sell order's price is smaller than or equal to the current buy order's price, they will match and be executed, and that sell order will be removed from the backlog. Else, the buy order is added to the backlog.sell order, you look at the buy order with the largest price in the backlog. If that buy order's price is larger than or equal to the current sell order's price, they will match and be executed, and that buy order will be removed from the backlog. Else, the sell order is added to the backlog.Return the total amount of orders in the backlog after placing all the orders from the input. Since this number can be large, return it modulo 109 + 7.
-
Example 1:
-
--Input: orders = [[10,5,0],[15,2,1],[25,1,1],[30,4,0]] -Output: 6 -Explanation: Here is what happens with the orders: -- 5 orders of type buy with price 10 are placed. There are no sell orders, so the 5 orders are added to the backlog. -- 2 orders of type sell with price 15 are placed. There are no buy orders with prices larger than or equal to 15, so the 2 orders are added to the backlog. -- 1 order of type sell with price 25 is placed. There are no buy orders with prices larger than or equal to 25 in the backlog, so this order is added to the backlog. -- 4 orders of type buy with price 30 are placed. The first 2 orders are matched with the 2 sell orders of the least price, which is 15 and these 2 sell orders are removed from the backlog. The 3rd order is matched with the sell order of the least price, which is 25 and this sell order is removed from the backlog. Then, there are no more sell orders in the backlog, so the 4th order is added to the backlog. -Finally, the backlog has 5 buy orders with price 10, and 1 buy order with price 30. So the total number of orders in the backlog is 6. -- -
Example 2:
-
--Input: orders = [[7,1000000000,1],[15,3,0],[5,999999995,0],[5,1,1]] -Output: 999999984 -Explanation: Here is what happens with the orders: -- 109 orders of type sell with price 7 are placed. There are no buy orders, so the 109 orders are added to the backlog. -- 3 orders of type buy with price 15 are placed. They are matched with the 3 sell orders with the least price which is 7, and those 3 sell orders are removed from the backlog. -- 999999995 orders of type buy with price 5 are placed. The least price of a sell order is 7, so the 999999995 orders are added to the backlog. -- 1 order of type sell with price 5 is placed. It is matched with the buy order of the highest price, which is 5, and that buy order is removed from the backlog. -Finally, the backlog has (1000000000-3) sell orders with price 7, and (999999995-1) buy orders with price 5. So the total number of orders = 1999999991, which is equal to 999999984 % (109 + 7). -- -
-
Constraints:
- -1 <= orders.length <= 105orders[i].length == 31 <= pricei, amounti <= 109orderTypei is either 0 or 1.You are given a 2D integer array orders, where each orders[i] = [pricei, amounti, orderTypei] denotes that amounti orders have been placed of type orderTypei at the price pricei. The orderTypei is:
0 if it is a batch of buy orders, or1 if it is a batch of sell orders.Note that orders[i] represents a batch of amounti independent orders with the same price and order type. All orders represented by orders[i] will be placed before all orders represented by orders[i+1] for all valid i.
There is a backlog that consists of orders that have not been executed. The backlog is initially empty. When an order is placed, the following happens:
+ +buy order, you look at the sell order with the smallest price in the backlog. If that sell order's price is smaller than or equal to the current buy order's price, they will match and be executed, and that sell order will be removed from the backlog. Else, the buy order is added to the backlog.sell order, you look at the buy order with the largest price in the backlog. If that buy order's price is larger than or equal to the current sell order's price, they will match and be executed, and that buy order will be removed from the backlog. Else, the sell order is added to the backlog.Return the total amount of orders in the backlog after placing all the orders from the input. Since this number can be large, return it modulo 109 + 7.
+
Example 1:
+
++Input: orders = [[10,5,0],[15,2,1],[25,1,1],[30,4,0]] +Output: 6 +Explanation: Here is what happens with the orders: +- 5 orders of type buy with price 10 are placed. There are no sell orders, so the 5 orders are added to the backlog. +- 2 orders of type sell with price 15 are placed. There are no buy orders with prices larger than or equal to 15, so the 2 orders are added to the backlog. +- 1 order of type sell with price 25 is placed. There are no buy orders with prices larger than or equal to 25 in the backlog, so this order is added to the backlog. +- 4 orders of type buy with price 30 are placed. The first 2 orders are matched with the 2 sell orders of the least price, which is 15 and these 2 sell orders are removed from the backlog. The 3rd order is matched with the sell order of the least price, which is 25 and this sell order is removed from the backlog. Then, there are no more sell orders in the backlog, so the 4th order is added to the backlog. +Finally, the backlog has 5 buy orders with price 10, and 1 buy order with price 30. So the total number of orders in the backlog is 6. ++ +
Example 2:
+
++Input: orders = [[7,1000000000,1],[15,3,0],[5,999999995,0],[5,1,1]] +Output: 999999984 +Explanation: Here is what happens with the orders: +- 109 orders of type sell with price 7 are placed. There are no buy orders, so the 109 orders are added to the backlog. +- 3 orders of type buy with price 15 are placed. They are matched with the 3 sell orders with the least price which is 7, and those 3 sell orders are removed from the backlog. +- 999999995 orders of type buy with price 5 are placed. The least price of a sell order is 7, so the 999999995 orders are added to the backlog. +- 1 order of type sell with price 5 is placed. It is matched with the buy order of the highest price, which is 5, and that buy order is removed from the backlog. +Finally, the backlog has (1000000000-3) sell orders with price 7, and (999999995-1) buy orders with price 5. So the total number of orders = 1999999991, which is equal to 999999984 % (109 + 7). ++ +
+
Constraints:
+ +1 <= orders.length <= 105orders[i].length == 31 <= pricei, amounti <= 109orderTypei is either 0 or 1.Write code to remove duplicates from an unsorted linked list.
- -Example1:
- -- Input: [1, 2, 3, 3, 2, 1] - Output: [1, 2, 3] -- -
Example2:
- -- Input: [1, 1, 1, 1, 2] - Output: [1, 2] -- -
Note:
- -Follow Up:
- -How would you solve this problem if a temporary buffer is not allowed?
+Write code to remove duplicates from an unsorted linked list.
+ +Example1:
+ ++ Input: [1, 2, 3, 3, 2, 1] + Output: [1, 2, 3] ++ +
Example2:
+ ++ Input: [1, 1, 1, 1, 2] + Output: [1, 2] ++ +
Note:
+ +Follow Up:
+ +How would you solve this problem if a temporary buffer is not allowed?
diff --git a/leetcode-cn/problem (English)/稀疏数组搜索(English) [sparse-array-search-lcci].html b/leetcode-cn/problem (English)/稀疏数组搜索(English) [sparse-array-search-lcci].html index f96663f1..3c032c67 100644 --- a/leetcode-cn/problem (English)/稀疏数组搜索(English) [sparse-array-search-lcci].html +++ b/leetcode-cn/problem (English)/稀疏数组搜索(English) [sparse-array-search-lcci].html @@ -1,22 +1,22 @@ -Given a sorted array of strings that is interspersed with empty strings, write a method to find the location of a given string.
- -Example1:
- -- Input: words = ["at", "", "", "", "ball", "", "", "car", "", "","dad", "", ""], s = "ta" - Output: -1 - Explanation: Return -1 if- -sis not inwords. -
Example2:
- -- Input: words = ["at", "", "", "", "ball", "", "", "car", "", "","dad", "", ""], s = "ball" - Output: 4 -- -
Note:
- -1 <= words.length <= 1000000Given a sorted array of strings that is interspersed with empty strings, write a method to find the location of a given string.
+ +Example1:
+ ++ Input: words = ["at", "", "", "", "ball", "", "", "car", "", "","dad", "", ""], s = "ta" + Output: -1 + Explanation: Return -1 if+ +sis not inwords. +
Example2:
+ ++ Input: words = ["at", "", "", "", "ball", "", "", "car", "", "","dad", "", ""], s = "ball" + Output: 4 ++ +
Note:
+ +1 <= words.length <= 1000000The similarity of two documents (each with distinct words) is defined to be the size of the intersection divided by the size of the union. For example, if the documents consist of integers, the similarity of {1, 5, 3} and {1, 7, 2, 3} is 0.4, because the intersection has size 2 and the union has size 5. We have a long list of documents (with distinct values and each with an associated ID) where the similarity is believed to be "sparse". That is, any two arbitrarily selected documents are very likely to have similarity 0. Design an algorithm that returns a list of pairs of document IDs and the associated similarity.
- -Input is a 2D array docs, where docs[i] is the document with id i. Return an array of strings, where each string represents a pair of documents with similarity greater than 0. The string should be formatted as {id1},{id2}: {similarity}, where id1 is the smaller id in the two documents, and similarity is the similarity rounded to four decimal places. You can return the array in any order.
Example:
- -
-Input:
-[
- [14, 15, 100, 9, 3],
- [32, 1, 9, 3, 5],
- [15, 29, 2, 6, 8, 7],
- [7, 10]
-]
-Output:
-[
- "0,1: 0.2500",
- "0,2: 0.1000",
- "2,3: 0.1429"
-]
-
-Note:
- -docs.length <= 500docs[i].length <= 500The similarity of two documents (each with distinct words) is defined to be the size of the intersection divided by the size of the union. For example, if the documents consist of integers, the similarity of {1, 5, 3} and {1, 7, 2, 3} is 0.4, because the intersection has size 2 and the union has size 5. We have a long list of documents (with distinct values and each with an associated ID) where the similarity is believed to be "sparse". That is, any two arbitrarily selected documents are very likely to have similarity 0. Design an algorithm that returns a list of pairs of document IDs and the associated similarity.
+ +Input is a 2D array docs, where docs[i] is the document with id i. Return an array of strings, where each string represents a pair of documents with similarity greater than 0. The string should be formatted as {id1},{id2}: {similarity}, where id1 is the smaller id in the two documents, and similarity is the similarity rounded to four decimal places. You can return the array in any order.
Example:
+ +
+Input:
+[
+ [14, 15, 100, 9, 3],
+ [32, 1, 9, 3, 5],
+ [15, 29, 2, 6, 8, 7],
+ [7, 10]
+]
+Output:
+[
+ "0,1: 0.2500",
+ "0,2: 0.1000",
+ "2,3: 0.1429"
+]
+
+Note:
+ +docs.length <= 500docs[i].length <= 500Design an algorithm to find the kth number such that the only prime factors are 3, 5, and 7. Note that 3, 5, and 7 do not have to be factors, but it should not have any other prime factors. For example, the first several multiples would be (in order) 1, 3, 5, 7, 9, 15, 21.
- -Example 1:
- --Input: k = 5 - -Output: 9 -+
Design an algorithm to find the kth number such that the only prime factors are 3, 5, and 7. Note that 3, 5, and 7 do not have to be factors, but it should not have any other prime factors. For example, the first several multiples would be (in order) 1, 3, 5, 7, 9, 15, 21.
+ +Example 1:
+ ++Input: k = 5 + +Output: 9 +diff --git a/leetcode-cn/problem (English)/绘制直线(English) [draw-line-lcci].html b/leetcode-cn/problem (English)/绘制直线(English) [draw-line-lcci].html index 858ce499..e6c8b580 100644 --- a/leetcode-cn/problem (English)/绘制直线(English) [draw-line-lcci].html +++ b/leetcode-cn/problem (English)/绘制直线(English) [draw-line-lcci].html @@ -1,18 +1,18 @@ -
A monochrome screen is stored as a single array of int, allowing 32 consecutive pixels to be stored in one int. The screen has width w, where w is divisible by 32 (that is, no byte will be split across rows). The height of the screen, of course, can be derived from the length of the array and the width. Implement a function that draws a horizontal line from (x1, y) to (x2, y).
Given the length of the array, the width of the array (in bit), start position x1 (in bit) of the line, end position x2 (in bit) of the line and the row number y of the line, return the array after drawing.
Example1:
- -- Input: length = 1, w = 32, x1 = 30, x2 = 31, y = 0 - Output: [3] - Explanation: After drawing a line from (30, 0) to (31, 0), the screen becomes [0b000000000000000000000000000000011]. -- -
Example2:
- -- Input: length = 3, w = 96, x1 = 0, x2 = 95, y = 0 - Output: [-1, -1, -1] -+
A monochrome screen is stored as a single array of int, allowing 32 consecutive pixels to be stored in one int. The screen has width w, where w is divisible by 32 (that is, no byte will be split across rows). The height of the screen, of course, can be derived from the length of the array and the width. Implement a function that draws a horizontal line from (x1, y) to (x2, y).
Given the length of the array, the width of the array (in bit), start position x1 (in bit) of the line, end position x2 (in bit) of the line and the row number y of the line, return the array after drawing.
Example1:
+ ++ Input: length = 1, w = 32, x1 = 30, x2 = 31, y = 0 + Output: [3] + Explanation: After drawing a line from (30, 0) to (31, 0), the screen becomes [0b000000000000000000000000000000011]. ++ +
Example2:
+ ++ Input: length = 3, w = 96, x1 = 0, x2 = 95, y = 0 + Output: [-1, -1, -1] +diff --git a/leetcode-cn/problem (English)/统计同构子字符串的数目(English) [count-number-of-homogenous-substrings].html b/leetcode-cn/problem (English)/统计同构子字符串的数目(English) [count-number-of-homogenous-substrings].html index c0505a66..5413d1d5 100644 --- a/leetcode-cn/problem (English)/统计同构子字符串的数目(English) [count-number-of-homogenous-substrings].html +++ b/leetcode-cn/problem (English)/统计同构子字符串的数目(English) [count-number-of-homogenous-substrings].html @@ -1,43 +1,43 @@ -
Given a string s, return the number of homogenous substrings of s. Since the answer may be too large, return it modulo 109 + 7.
A string is homogenous if all the characters of the string are the same.
- -A substring is a contiguous sequence of characters within a string.
- --
Example 1:
- --Input: s = "abbcccaa" -Output: 13 -Explanation: The homogenous substrings are listed as below: -"a" appears 3 times. -"aa" appears 1 time. -"b" appears 2 times. -"bb" appears 1 time. -"c" appears 3 times. -"cc" appears 2 times. -"ccc" appears 1 time. -3 + 1 + 2 + 1 + 3 + 2 + 1 = 13.- -
Example 2:
- --Input: s = "xy" -Output: 2 -Explanation: The homogenous substrings are "x" and "y".- -
Example 3:
- --Input: s = "zzzzz" -Output: 15 -- -
-
Constraints:
- -1 <= s.length <= 105s consists of lowercase letters.Given a string s, return the number of homogenous substrings of s. Since the answer may be too large, return it modulo 109 + 7.
A string is homogenous if all the characters of the string are the same.
+ +A substring is a contiguous sequence of characters within a string.
+ ++
Example 1:
+ ++Input: s = "abbcccaa" +Output: 13 +Explanation: The homogenous substrings are listed as below: +"a" appears 3 times. +"aa" appears 1 time. +"b" appears 2 times. +"bb" appears 1 time. +"c" appears 3 times. +"cc" appears 2 times. +"ccc" appears 1 time. +3 + 1 + 2 + 1 + 3 + 2 + 1 = 13.+ +
Example 2:
+ ++Input: s = "xy" +Output: 2 +Explanation: The homogenous substrings are "x" and "y".+ +
Example 3:
+ ++Input: s = "zzzzz" +Output: 15 ++ +
+
Constraints:
+ +1 <= s.length <= 105s consists of lowercase letters.There are n cities numbered from 1 to n. You are given an array edges of size n-1, where edges[i] = [ui, vi] represents a bidirectional edge between cities ui and vi. There exists a unique path between each pair of cities. In other words, the cities form a tree.
A subtree is a subset of cities where every city is reachable from every other city in the subset, where the path between each pair passes through only the cities from the subset. Two subtrees are different if there is a city in one subtree that is not present in the other.
- -For each d from 1 to n-1, find the number of subtrees in which the maximum distance between any two cities in the subtree is equal to d.
Return an array of size n-1 where the dth element (1-indexed) is the number of subtrees in which the maximum distance between any two cities is equal to d.
Notice that the distance between the two cities is the number of edges in the path between them.
- --
Example 1:
- -
-Input: n = 4, edges = [[1,2],[2,3],[2,4]]
-Output: [3,4,0]
-Explanation:
-The subtrees with subsets {1,2}, {2,3} and {2,4} have a max distance of 1.
-The subtrees with subsets {1,2,3}, {1,2,4}, {2,3,4} and {1,2,3,4} have a max distance of 2.
-No subtree has two nodes where the max distance between them is 3.
-
-
-Example 2:
- --Input: n = 2, edges = [[1,2]] -Output: [1] -- -
Example 3:
- --Input: n = 3, edges = [[1,2],[2,3]] -Output: [2,1] -- -
-
Constraints:
- -2 <= n <= 15edges.length == n-1edges[i].length == 21 <= ui, vi <= n(ui, vi) are distinct.There are n cities numbered from 1 to n. You are given an array edges of size n-1, where edges[i] = [ui, vi] represents a bidirectional edge between cities ui and vi. There exists a unique path between each pair of cities. In other words, the cities form a tree.
A subtree is a subset of cities where every city is reachable from every other city in the subset, where the path between each pair passes through only the cities from the subset. Two subtrees are different if there is a city in one subtree that is not present in the other.
+ +For each d from 1 to n-1, find the number of subtrees in which the maximum distance between any two cities in the subtree is equal to d.
Return an array of size n-1 where the dth element (1-indexed) is the number of subtrees in which the maximum distance between any two cities is equal to d.
Notice that the distance between the two cities is the number of edges in the path between them.
+ ++
Example 1:
+ +
+Input: n = 4, edges = [[1,2],[2,3],[2,4]]
+Output: [3,4,0]
+Explanation:
+The subtrees with subsets {1,2}, {2,3} and {2,4} have a max distance of 1.
+The subtrees with subsets {1,2,3}, {1,2,4}, {2,3,4} and {1,2,3,4} have a max distance of 2.
+No subtree has two nodes where the max distance between them is 3.
+
+
+Example 2:
+ ++Input: n = 2, edges = [[1,2]] +Output: [1] ++ +
Example 3:
+ ++Input: n = 3, edges = [[1,2],[2,3]] +Output: [2,1] ++ +
+
Constraints:
+ +2 <= n <= 15edges.length == n-1edges[i].length == 21 <= ui, vi <= n(ui, vi) are distinct.Given a (0-indexed) integer array nums and two integers low and high, return the number of nice pairs.
A nice pair is a pair (i, j) where 0 <= i < j < nums.length and low <= (nums[i] XOR nums[j]) <= high.
-
Example 1:
- --Input: nums = [1,4,2,7], low = 2, high = 6 -Output: 6 -Explanation: All nice pairs (i, j) are as follows: - - (0, 1): nums[0] XOR nums[1] = 5 - - (0, 2): nums[0] XOR nums[2] = 3 - - (0, 3): nums[0] XOR nums[3] = 6 - - (1, 2): nums[1] XOR nums[2] = 6 - - (1, 3): nums[1] XOR nums[3] = 3 - - (2, 3): nums[2] XOR nums[3] = 5 -- -
Example 2:
- --Input: nums = [9,8,4,2,1], low = 5, high = 14 -Output: 8 -Explanation: All nice pairs (i, j) are as follows: - - (0, 2): nums[0] XOR nums[2] = 13 - - (0, 3): nums[0] XOR nums[3] = 11 - - (0, 4): nums[0] XOR nums[4] = 8 - - (1, 2): nums[1] XOR nums[2] = 12 - - (1, 3): nums[1] XOR nums[3] = 10 - - (1, 4): nums[1] XOR nums[4] = 9 - - (2, 3): nums[2] XOR nums[3] = 6 - - (2, 4): nums[2] XOR nums[4] = 5- -
-
Constraints:
- -1 <= nums.length <= 2 * 1041 <= nums[i] <= 2 * 1041 <= low <= high <= 2 * 104Given a (0-indexed) integer array nums and two integers low and high, return the number of nice pairs.
A nice pair is a pair (i, j) where 0 <= i < j < nums.length and low <= (nums[i] XOR nums[j]) <= high.
+
Example 1:
+ ++Input: nums = [1,4,2,7], low = 2, high = 6 +Output: 6 +Explanation: All nice pairs (i, j) are as follows: + - (0, 1): nums[0] XOR nums[1] = 5 + - (0, 2): nums[0] XOR nums[2] = 3 + - (0, 3): nums[0] XOR nums[3] = 6 + - (1, 2): nums[1] XOR nums[2] = 6 + - (1, 3): nums[1] XOR nums[3] = 3 + - (2, 3): nums[2] XOR nums[3] = 5 ++ +
Example 2:
+ ++Input: nums = [9,8,4,2,1], low = 5, high = 14 +Output: 8 +Explanation: All nice pairs (i, j) are as follows: + - (0, 2): nums[0] XOR nums[2] = 13 + - (0, 3): nums[0] XOR nums[3] = 11 + - (0, 4): nums[0] XOR nums[4] = 8 + - (1, 2): nums[1] XOR nums[2] = 12 + - (1, 3): nums[1] XOR nums[3] = 10 + - (1, 4): nums[1] XOR nums[4] = 9 + - (2, 3): nums[2] XOR nums[3] = 6 + - (2, 4): nums[2] XOR nums[4] = 5+ +
+
Constraints:
+ +1 <= nums.length <= 2 * 1041 <= nums[i] <= 2 * 1041 <= low <= high <= 2 * 104You have an integer and you can flip exactly one bit from a 0 to a 1. Write code to find the length of the longest sequence of 1s you could create.
- -Example 1:
- -
-Input: num = 1775(110111011112)
-Output: 8
-
-
-Example 2:
- -
-Input: num = 7(01112)
-Output: 4
-
+You have an integer and you can flip exactly one bit from a 0 to a 1. Write code to find the length of the longest sequence of 1s you could create.
+ +Example 1:
+ +
+Input: num = 1775(110111011112)
+Output: 8
+
+
+Example 2:
+ +
+Input: num = 7(01112)
+Output: 4
+
diff --git a/leetcode-cn/problem (English)/节点间通路(English) [route-between-nodes-lcci].html b/leetcode-cn/problem (English)/节点间通路(English) [route-between-nodes-lcci].html
index cd29d05a..91c743a3 100644
--- a/leetcode-cn/problem (English)/节点间通路(English) [route-between-nodes-lcci].html
+++ b/leetcode-cn/problem (English)/节点间通路(English) [route-between-nodes-lcci].html
@@ -1,23 +1,23 @@
-Given a directed graph, design an algorithm to find out whether there is a route between two nodes.
- -Example1:
- -- Input: n = 3, graph = [[0, 1], [0, 2], [1, 2], [1, 2]], start = 0, target = 2 - Output: true -- -
Example2:
- -- Input: n = 5, graph = [[0, 1], [0, 2], [0, 4], [0, 4], [0, 1], [1, 3], [1, 4], [1, 3], [2, 3], [3, 4]], start = 0, target = 4 - Output true -- -
Note:
- -0 <= n <= 100000Given a directed graph, design an algorithm to find out whether there is a route between two nodes.
+ +Example1:
+ ++ Input: n = 3, graph = [[0, 1], [0, 2], [1, 2], [1, 2]], start = 0, target = 2 + Output: true ++ +
Example2:
+ ++ Input: n = 5, graph = [[0, 1], [0, 2], [0, 4], [0, 4], [0, 1], [1, 3], [1, 4], [1, 3], [2, 3], [3, 4]], start = 0, target = 4 + Output true ++ +
Note:
+ +0 <= n <= 100000English description is not available for the problem. Please switch to Chinese.
+English description is not available for the problem. Please switch to Chinese.
diff --git a/leetcode-cn/problem (English)/覆盖(English) [broken-board-dominoes].html b/leetcode-cn/problem (English)/覆盖(English) [broken-board-dominoes].html index 579f7fd7..5c5502aa 100644 --- a/leetcode-cn/problem (English)/覆盖(English) [broken-board-dominoes].html +++ b/leetcode-cn/problem (English)/覆盖(English) [broken-board-dominoes].html @@ -1 +1 @@ -English description is not available for the problem. Please switch to Chinese.
+English description is not available for the problem. Please switch to Chinese.
diff --git a/leetcode-cn/problem (English)/计算器(English) [calculator-lcci].html b/leetcode-cn/problem (English)/计算器(English) [calculator-lcci].html index be465e8d..1103e2b9 100644 --- a/leetcode-cn/problem (English)/计算器(English) [calculator-lcci].html +++ b/leetcode-cn/problem (English)/计算器(English) [calculator-lcci].html @@ -1,30 +1,30 @@ -Given an arithmetic equation consisting of positive integers, +, -, * and / (no parentheses), compute the result.
- -The expression string contains only non-negative integers, +, -, *, / operators and empty spaces . The integer division should truncate toward zero.
- -Example 1:
- --Input: "3+2*2" -Output: 7 -- -
Example 2:
- --Input: " 3/2 " -Output: 1- -
Example 3:
- --Input: " 3+5 / 2 " -Output: 5 -- -
Note:
- -Given an arithmetic equation consisting of positive integers, +, -, * and / (no parentheses), compute the result.
+ +The expression string contains only non-negative integers, +, -, *, / operators and empty spaces . The integer division should truncate toward zero.
+ +Example 1:
+ ++Input: "3+2*2" +Output: 7 ++ +
Example 2:
+ ++Input: " 3/2 " +Output: 1+ +
Example 3:
+ ++Input: " 3+5 / 2 " +Output: 5 ++ +
Note:
+ +You have a movie renting company consisting of n shops. You want to implement a renting system that supports searching for, booking, and returning movies. The system should also support generating a report of the currently rented movies.
Each movie is given as a 2D integer array entries where entries[i] = [shopi, moviei, pricei] indicates that there is a copy of movie moviei at shop shopi with a rental price of pricei. Each shop carries at most one copy of a movie moviei.
The system should support the following functions:
- -shopi should appear first. If there are less than 5 matching shops, then all of them should be returned. If no shop has an unrented copy, then an empty list should be returned.res where res[j] = [shopj, moviej] describes that the jth cheapest rented movie moviej was rented from the shop shopj. The movies in res should be sorted by price in ascending order, and in case of a tie, the one with the smaller shopj should appear first, and if there is still tie, the one with the smaller moviej should appear first. If there are fewer than 5 rented movies, then all of them should be returned. If no movies are currently being rented, then an empty list should be returned.Implement the MovieRentingSystem class:
MovieRentingSystem(int n, int[][] entries) Initializes the MovieRentingSystem object with n shops and the movies in entries.List<Integer> search(int movie) Returns a list of shops that have an unrented copy of the given movie as described above.void rent(int shop, int movie) Rents the given movie from the given shop.void drop(int shop, int movie) Drops off a previously rented movie at the given shop.List<List<Integer>> report() Returns a list of cheapest rented movies as described above.Note: The test cases will be generated such that rent will only be called if the shop has an unrented copy of the movie, and drop will only be called if the shop had previously rented out the movie.
-
Example 1:
- --Input -["MovieRentingSystem", "search", "rent", "rent", "report", "drop", "search"] -[[3, [[0, 1, 5], [0, 2, 6], [0, 3, 7], [1, 1, 4], [1, 2, 7], [2, 1, 5]]], [1], [0, 1], [1, 2], [], [1, 2], [2]] -Output -[null, [1, 0, 2], null, null, [[0, 1], [1, 2]], null, [0, 1]] - -Explanation -MovieRentingSystem movieRentingSystem = new MovieRentingSystem(3, [[0, 1, 5], [0, 2, 6], [0, 3, 7], [1, 1, 4], [1, 2, 7], [2, 1, 5]]); -movieRentingSystem.search(1); // return [1, 0, 2], Movies of ID 1 are unrented at shops 1, 0, and 2. Shop 1 is cheapest; shop 0 and 2 are the same price, so order by shop number. -movieRentingSystem.rent(0, 1); // Rent movie 1 from shop 0. Unrented movies at shop 0 are now [2,3]. -movieRentingSystem.rent(1, 2); // Rent movie 2 from shop 1. Unrented movies at shop 1 are now [1]. -movieRentingSystem.report(); // return [[0, 1], [1, 2]]. Movie 1 from shop 0 is cheapest, followed by movie 2 from shop 1. -movieRentingSystem.drop(1, 2); // Drop off movie 2 at shop 1. Unrented movies at shop 1 are now [1,2]. -movieRentingSystem.search(2); // return [0, 1]. Movies of ID 2 are unrented at shops 0 and 1. Shop 0 is cheapest, followed by shop 1. -- -
-
Constraints:
- -1 <= n <= 3 * 1051 <= entries.length <= 1050 <= shopi < n1 <= moviei, pricei <= 104moviei.105 calls in total will be made to search, rent, drop and report.You have a movie renting company consisting of n shops. You want to implement a renting system that supports searching for, booking, and returning movies. The system should also support generating a report of the currently rented movies.
Each movie is given as a 2D integer array entries where entries[i] = [shopi, moviei, pricei] indicates that there is a copy of movie moviei at shop shopi with a rental price of pricei. Each shop carries at most one copy of a movie moviei.
The system should support the following functions:
+ +shopi should appear first. If there are less than 5 matching shops, then all of them should be returned. If no shop has an unrented copy, then an empty list should be returned.res where res[j] = [shopj, moviej] describes that the jth cheapest rented movie moviej was rented from the shop shopj. The movies in res should be sorted by price in ascending order, and in case of a tie, the one with the smaller shopj should appear first, and if there is still tie, the one with the smaller moviej should appear first. If there are fewer than 5 rented movies, then all of them should be returned. If no movies are currently being rented, then an empty list should be returned.Implement the MovieRentingSystem class:
MovieRentingSystem(int n, int[][] entries) Initializes the MovieRentingSystem object with n shops and the movies in entries.List<Integer> search(int movie) Returns a list of shops that have an unrented copy of the given movie as described above.void rent(int shop, int movie) Rents the given movie from the given shop.void drop(int shop, int movie) Drops off a previously rented movie at the given shop.List<List<Integer>> report() Returns a list of cheapest rented movies as described above.Note: The test cases will be generated such that rent will only be called if the shop has an unrented copy of the movie, and drop will only be called if the shop had previously rented out the movie.
+
Example 1:
+ ++Input +["MovieRentingSystem", "search", "rent", "rent", "report", "drop", "search"] +[[3, [[0, 1, 5], [0, 2, 6], [0, 3, 7], [1, 1, 4], [1, 2, 7], [2, 1, 5]]], [1], [0, 1], [1, 2], [], [1, 2], [2]] +Output +[null, [1, 0, 2], null, null, [[0, 1], [1, 2]], null, [0, 1]] + +Explanation +MovieRentingSystem movieRentingSystem = new MovieRentingSystem(3, [[0, 1, 5], [0, 2, 6], [0, 3, 7], [1, 1, 4], [1, 2, 7], [2, 1, 5]]); +movieRentingSystem.search(1); // return [1, 0, 2], Movies of ID 1 are unrented at shops 1, 0, and 2. Shop 1 is cheapest; shop 0 and 2 are the same price, so order by shop number. +movieRentingSystem.rent(0, 1); // Rent movie 1 from shop 0. Unrented movies at shop 0 are now [2,3]. +movieRentingSystem.rent(1, 2); // Rent movie 2 from shop 1. Unrented movies at shop 1 are now [1]. +movieRentingSystem.report(); // return [[0, 1], [1, 2]]. Movie 1 from shop 0 is cheapest, followed by movie 2 from shop 1. +movieRentingSystem.drop(1, 2); // Drop off movie 2 at shop 1. Unrented movies at shop 1 are now [1,2]. +movieRentingSystem.search(2); // return [0, 1]. Movies of ID 2 are unrented at shops 0 and 1. Shop 0 is cheapest, followed by shop 1. ++ +
+
Constraints:
+ +1 <= n <= 3 * 1051 <= entries.length <= 1050 <= shopi < n1 <= moviei, pricei <= 104moviei.105 calls in total will be made to search, rent, drop and report.English description is not available for the problem. Please switch to Chinese.
+English description is not available for the problem. Please switch to Chinese.
diff --git a/leetcode-cn/problem (English)/跳水板(English) [diving-board-lcci].html b/leetcode-cn/problem (English)/跳水板(English) [diving-board-lcci].html index 4df7b0c3..b96e2906 100644 --- a/leetcode-cn/problem (English)/跳水板(English) [diving-board-lcci].html +++ b/leetcode-cn/problem (English)/跳水板(English) [diving-board-lcci].html @@ -1,20 +1,20 @@ -You are building a diving board by placing a bunch of planks of wood end-to-end. There are two types of planks, one of length shorter and one of length longer. You must use exactly K planks of wood. Write a method to generate all possible lengths for the diving board.
return all lengths in non-decreasing order.
- -Example:
- -
-Input:
-shorter = 1
-longer = 2
-k = 3
-Output: {3,4,5,6}
-
-
-Note:
- -You are building a diving board by placing a bunch of planks of wood end-to-end. There are two types of planks, one of length shorter and one of length longer. You must use exactly K planks of wood. Write a method to generate all possible lengths for the diving board.
return all lengths in non-decreasing order.
+ +Example:
+ +
+Input:
+shorter = 1
+longer = 2
+k = 3
+Output: {3,4,5,6}
+
+
+Note:
+ +Write methods to implement the multiply, subtract, and divide operations for integers. The results of all of these are integers. Use only the add operator.
- -You should implement following methods:
- -Operations() constructorminus(a, b) Subtraction, returns a - bmultiply(a, b) Multiplication, returns a * bdivide(a, b) Division, returns a / bExample:
- --Operations operations = new Operations(); -operations.minus(1, 2); //returns -1 -operations.multiply(3, 4); //returns 12 -operations.divide(5, -2); //returns -2 -- -
Note:
- -Write methods to implement the multiply, subtract, and divide operations for integers. The results of all of these are integers. Use only the add operator.
+ +You should implement following methods:
+ +Operations() constructorminus(a, b) Subtraction, returns a - bmultiply(a, b) Multiplication, returns a * bdivide(a, b) Division, returns a / bExample:
+ ++Operations operations = new Operations(); +operations.minus(1, 2); //returns -1 +operations.multiply(3, 4); //returns 12 +operations.divide(5, -2); //returns -2 ++ +
Note:
+ +Implement an algorithm to find the kth to last element of a singly linked list. Return the value of the element.
- -Note: This problem is slightly different from the original one in the book.
- -Example:
- --Input: 1->2->3->4->5 和 k = 2 -Output: 4- -
Note:
- -k is always valid.
+Implement an algorithm to find the kth to last element of a singly linked list. Return the value of the element.
+ +Note: This problem is slightly different from the original one in the book.
+ +Example:
+ ++Input: 1->2->3->4->5 和 k = 2 +Output: 4+ +
Note:
+ +k is always valid.
diff --git a/leetcode-cn/problem (English)/连续中值(English) [continuous-median-lcci].html b/leetcode-cn/problem (English)/连续中值(English) [continuous-median-lcci].html index a1212c22..c162fa45 100644 --- a/leetcode-cn/problem (English)/连续中值(English) [continuous-median-lcci].html +++ b/leetcode-cn/problem (English)/连续中值(English) [continuous-median-lcci].html @@ -1,26 +1,26 @@ -Numbers are randomly generated and passed to a method. Write a program to find and maintain the median value as new values are generated.
- -Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle value.
- -For example,
- -[2,3,4], the median is 3
- -[2,3], the median is (2 + 3) / 2 = 2.5
- -Design a data structure that supports the following two operations:
- -Example:
- --addNum(1) -addNum(2) -findMedian() -> 1.5 -addNum(3) -findMedian() -> 2 -+
Numbers are randomly generated and passed to a method. Write a program to find and maintain the median value as new values are generated.
+ +Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle value.
+ +For example,
+ +[2,3,4], the median is 3
+ +[2,3], the median is (2 + 3) / 2 = 2.5
+ +Design a data structure that supports the following two operations:
+ +Example:
+ ++addNum(1) +addNum(2) +findMedian() -> 1.5 +addNum(3) +findMedian() -> 2 +diff --git a/leetcode-cn/problem (English)/连续出现的数字(English) [consecutive-numbers].html b/leetcode-cn/problem (English)/连续出现的数字(English) [consecutive-numbers].html index 9be178bb..02ce97aa 100644 --- a/leetcode-cn/problem (English)/连续出现的数字(English) [consecutive-numbers].html +++ b/leetcode-cn/problem (English)/连续出现的数字(English) [consecutive-numbers].html @@ -8,6 +8,7 @@ | num | varchar | +-------------+---------+ id is the primary key for this table. +id is an autoincrement column.
diff --git a/leetcode-cn/problem (English)/连续数列(English) [contiguous-sequence-lcci].html b/leetcode-cn/problem (English)/连续数列(English) [contiguous-sequence-lcci].html index ecfc218e..a6006d6f 100644 --- a/leetcode-cn/problem (English)/连续数列(English) [contiguous-sequence-lcci].html +++ b/leetcode-cn/problem (English)/连续数列(English) [contiguous-sequence-lcci].html @@ -1,13 +1,13 @@ -
You are given an array of integers (both positive and negative). Find the contiguous sequence with the largest sum. Return the sum.
- -Example:
- --Input: [-2,1,-3,4,-1,2,1,-5,4] -Output: 6 -Explanation: [4,-1,2,1] has the largest sum 6. -- -
Follow Up:
- -If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
+You are given an array of integers (both positive and negative). Find the contiguous sequence with the largest sum. Return the sum.
+ +Example:
+ ++Input: [-2,1,-3,4,-1,2,1,-5,4] +Output: 6 +Explanation: [4,-1,2,1] has the largest sum 6. ++ +
Follow Up:
+ +If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
diff --git a/leetcode-cn/problem (English)/迷路的机器人(English) [robot-in-a-grid-lcci].html b/leetcode-cn/problem (English)/迷路的机器人(English) [robot-in-a-grid-lcci].html index 92df483f..16392b73 100644 --- a/leetcode-cn/problem (English)/迷路的机器人(English) [robot-in-a-grid-lcci].html +++ b/leetcode-cn/problem (English)/迷路的机器人(English) [robot-in-a-grid-lcci].html @@ -1,24 +1,24 @@ -Imagine a robot sitting on the upper left corner of grid with r rows and c columns. The robot can only move in two directions, right and down, but certain cells are "off limits" such that the robot cannot step on them. Design an algorithm to find a path for the robot from the top left to the bottom right.
- -
"off limits" and empty grid are represented by 1 and 0 respectively.
Return a valid path, consisting of row number and column number of grids in the path.
- -Example 1:
- --Input: -[ - [0,0,0], - [0,1,0], - [0,0,0] -] -Output: [[0,0],[0,1],[0,2],[1,2],[2,2]]- -
Note:
- -r, c <= 100Imagine a robot sitting on the upper left corner of grid with r rows and c columns. The robot can only move in two directions, right and down, but certain cells are "off limits" such that the robot cannot step on them. Design an algorithm to find a path for the robot from the top left to the bottom right.
+ +
"off limits" and empty grid are represented by 1 and 0 respectively.
Return a valid path, consisting of row number and column number of grids in the path.
+ +Example 1:
+ ++Input: +[ + [0,0,0], + [0,1,0], + [0,0,0] +] +Output: [[0,0],[0,1],[0,2],[1,2],[2,2]]+ +
Note:
+ +r, c <= 100Write a recursive function to multiply two positive integers without using the * operator. You can use addition, subtraction, and bit shifting, but you should minimize the number of those operations.
- -Example 1:
- -- Input: A = 1, B = 10 - Output: 10 -- -
Example 2:
- -- Input: A = 3, B = 4 - Output: 12 -- -
Note:
- -Write a recursive function to multiply two positive integers without using the * operator. You can use addition, subtraction, and bit shifting, but you should minimize the number of those operations.
+ +Example 1:
+ ++ Input: A = 1, B = 10 + Output: 10 ++ +
Example 2:
+ ++ Input: A = 3, B = 4 + Output: 12 ++ +
Note:
+ +Given an integer array instructions, you are asked to create a sorted array from the elements in instructions. You start with an empty container nums. For each element from left to right in instructions, insert it into nums. The cost of each insertion is the minimum of the following:
nums that are strictly less than instructions[i].nums that are strictly greater than instructions[i].For example, if inserting element 3 into nums = [1,2,3,5], the cost of insertion is min(2, 1) (elements 1 and 2 are less than 3, element 5 is greater than 3) and nums will become [1,2,3,3,5].
Return the total cost to insert all elements from instructions into nums. Since the answer may be large, return it modulo 109 + 7
-
Example 1:
- --Input: instructions = [1,5,6,2] -Output: 1 -Explanation: Begin with nums = []. -Insert 1 with cost min(0, 0) = 0, now nums = [1]. -Insert 5 with cost min(1, 0) = 0, now nums = [1,5]. -Insert 6 with cost min(2, 0) = 0, now nums = [1,5,6]. -Insert 2 with cost min(1, 2) = 1, now nums = [1,2,5,6]. -The total cost is 0 + 0 + 0 + 1 = 1.- -
Example 2:
- --Input: instructions = [1,2,3,6,5,4] -Output: 3 -Explanation: Begin with nums = []. -Insert 1 with cost min(0, 0) = 0, now nums = [1]. -Insert 2 with cost min(1, 0) = 0, now nums = [1,2]. -Insert 3 with cost min(2, 0) = 0, now nums = [1,2,3]. -Insert 6 with cost min(3, 0) = 0, now nums = [1,2,3,6]. -Insert 5 with cost min(3, 1) = 1, now nums = [1,2,3,5,6]. -Insert 4 with cost min(3, 2) = 2, now nums = [1,2,3,4,5,6]. -The total cost is 0 + 0 + 0 + 0 + 1 + 2 = 3. -- -
Example 3:
- --Input: instructions = [1,3,3,3,2,4,2,1,2] -Output: 4 -Explanation: Begin with nums = []. -Insert 1 with cost min(0, 0) = 0, now nums = [1]. -Insert 3 with cost min(1, 0) = 0, now nums = [1,3]. -Insert 3 with cost min(1, 0) = 0, now nums = [1,3,3]. -Insert 3 with cost min(1, 0) = 0, now nums = [1,3,3,3]. -Insert 2 with cost min(1, 3) = 1, now nums = [1,2,3,3,3]. -Insert 4 with cost min(5, 0) = 0, now nums = [1,2,3,3,3,4]. -Insert 2 with cost min(1, 4) = 1, now nums = [1,2,2,3,3,3,4]. -Insert 1 with cost min(0, 6) = 0, now nums = [1,1,2,2,3,3,3,4]. -Insert 2 with cost min(2, 4) = 2, now nums = [1,1,2,2,2,3,3,3,4]. -The total cost is 0 + 0 + 0 + 0 + 1 + 0 + 1 + 0 + 2 = 4. -- -
-
Constraints:
- -1 <= instructions.length <= 1051 <= instructions[i] <= 105Given an integer array instructions, you are asked to create a sorted array from the elements in instructions. You start with an empty container nums. For each element from left to right in instructions, insert it into nums. The cost of each insertion is the minimum of the following:
nums that are strictly less than instructions[i].nums that are strictly greater than instructions[i].For example, if inserting element 3 into nums = [1,2,3,5], the cost of insertion is min(2, 1) (elements 1 and 2 are less than 3, element 5 is greater than 3) and nums will become [1,2,3,3,5].
Return the total cost to insert all elements from instructions into nums. Since the answer may be large, return it modulo 109 + 7
+
Example 1:
+ ++Input: instructions = [1,5,6,2] +Output: 1 +Explanation: Begin with nums = []. +Insert 1 with cost min(0, 0) = 0, now nums = [1]. +Insert 5 with cost min(1, 0) = 0, now nums = [1,5]. +Insert 6 with cost min(2, 0) = 0, now nums = [1,5,6]. +Insert 2 with cost min(1, 2) = 1, now nums = [1,2,5,6]. +The total cost is 0 + 0 + 0 + 1 = 1.+ +
Example 2:
+ ++Input: instructions = [1,2,3,6,5,4] +Output: 3 +Explanation: Begin with nums = []. +Insert 1 with cost min(0, 0) = 0, now nums = [1]. +Insert 2 with cost min(1, 0) = 0, now nums = [1,2]. +Insert 3 with cost min(2, 0) = 0, now nums = [1,2,3]. +Insert 6 with cost min(3, 0) = 0, now nums = [1,2,3,6]. +Insert 5 with cost min(3, 1) = 1, now nums = [1,2,3,5,6]. +Insert 4 with cost min(3, 2) = 2, now nums = [1,2,3,4,5,6]. +The total cost is 0 + 0 + 0 + 0 + 1 + 2 = 3. ++ +
Example 3:
+ ++Input: instructions = [1,3,3,3,2,4,2,1,2] +Output: 4 +Explanation: Begin with nums = []. +Insert 1 with cost min(0, 0) = 0, now nums = [1]. +Insert 3 with cost min(1, 0) = 0, now nums = [1,3]. +Insert 3 with cost min(1, 0) = 0, now nums = [1,3,3]. +Insert 3 with cost min(1, 0) = 0, now nums = [1,3,3,3]. +Insert 2 with cost min(1, 3) = 1, now nums = [1,2,3,3,3]. +Insert 4 with cost min(5, 0) = 0, now nums = [1,2,3,3,3,4]. +Insert 2 with cost min(1, 4) = 1, now nums = [1,2,2,3,3,3,4]. +Insert 1 with cost min(0, 6) = 0, now nums = [1,1,2,2,3,3,3,4]. +Insert 2 with cost min(2, 4) = 2, now nums = [1,1,2,2,2,3,3,3,4]. +The total cost is 0 + 0 + 0 + 0 + 1 + 0 + 1 + 0 + 2 = 4. ++ +
+
Constraints:
+ +1 <= instructions.length <= 1051 <= instructions[i] <= 105Your country has an infinite number of lakes. Initially, all the lakes are empty, but when it rains over the nth lake, the nth lake becomes full of water. If it rains over a lake which is full of water, there will be a flood. Your goal is to avoid the flood in any lake.
Your country has an infinite number of lakes. Initially, all the lakes are empty, but when it rains over the nth lake, the nth lake becomes full of water. If it rains over a lake that is full of water, there will be a flood. Your goal is to avoid floods in any lake.
Given an integer array rains where:
If there are multiple valid answers return any of them. If it is impossible to avoid flood return an empty array.
-Notice that if you chose to dry a full lake, it becomes empty, but if you chose to dry an empty lake, nothing changes. (see example 4)
+Notice that if you chose to dry a full lake, it becomes empty, but if you chose to dry an empty lake, nothing changes.
Example 1:
diff --git a/leetcode-cn/problem (English)/部分排序(English) [sub-sort-lcci].html b/leetcode-cn/problem (English)/部分排序(English) [sub-sort-lcci].html index 982ad59f..a0658560 100644 --- a/leetcode-cn/problem (English)/部分排序(English) [sub-sort-lcci].html +++ b/leetcode-cn/problem (English)/部分排序(English) [sub-sort-lcci].html @@ -1,16 +1,16 @@ -Given an array of integers, write a method to find indices m and n such that if you sorted elements m through n, the entire array would be sorted. Minimize n - m (that is, find the smallest such sequence).
Return [m,n]. If there are no such m and n (e.g. the array is already sorted), return [-1, -1].
Example:
- --Input: [1,2,4,7,10,11,7,12,6,7,16,18,19] -Output: [3,9] -- -
Note:
- -0 <= len(array) <= 1000000Given an array of integers, write a method to find indices m and n such that if you sorted elements m through n, the entire array would be sorted. Minimize n - m (that is, find the smallest such sequence).
Return [m,n]. If there are no such m and n (e.g. the array is already sorted), return [-1, -1].
Example:
+ ++Input: [1,2,4,7,10,11,7,12,6,7,16,18,19] +Output: [3,9] ++ +
Note:
+ +0 <= len(array) <= 1000000Write a program to swap odd and even bits in an integer with as few instructions as possible (e.g., bit 0 and bit 1 are swapped, bit 2 and bit 3 are swapped, and so on).
- -Example1:
- -- Input: num = 2(0b10) - Output 1 (0b01) -- -
Example2:
- -- Input: num = 3 - Output: 3 -- -
Note:
- -0 <= num <= 2^30 - 1Write a program to swap odd and even bits in an integer with as few instructions as possible (e.g., bit 0 and bit 1 are swapped, bit 2 and bit 3 are swapped, and so on).
+ +Example1:
+ ++ Input: num = 2(0b10) + Output 1 (0b01) ++ +
Example2:
+ ++ Input: num = 3 + Output: 3 ++ +
Note:
+ +0 <= num <= 2^30 - 1You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the 1's digit is at the head of the list. Write a function that adds the two numbers and returns the sum as a linked list.
- -- -
Example:
- --Input: (7 -> 1 -> 6) + (5 -> 9 -> 2). That is, 617 + 295. -Output: 2 -> 1 -> 9. That is, 912. -- -
Follow Up: Suppose the digits are stored in forward order. Repeat the above problem.
- -Example:
- --Input: (6 -> 1 -> 7) + (2 -> 9 -> 5). That is, 617 + 295. -Output: 9 -> 1 -> 2. That is, 912. -+
You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the 1's digit is at the head of the list. Write a function that adds the two numbers and returns the sum as a linked list.
+ ++ +
Example:
+ ++Input: (7 -> 1 -> 6) + (5 -> 9 -> 2). That is, 617 + 295. +Output: 2 -> 1 -> 9. That is, 912. ++ +
Follow Up: Suppose the digits are stored in forward order. Repeat the above problem.
+ +Example:
+ ++Input: (6 -> 1 -> 7) + (2 -> 9 -> 5). That is, 617 + 295. +Output: 9 -> 1 -> 2. That is, 912. +diff --git a/leetcode-cn/problem (English)/链表相交(English) [intersection-of-two-linked-lists-lcci].html b/leetcode-cn/problem (English)/链表相交(English) [intersection-of-two-linked-lists-lcci].html index 35ed21c5..f7a49166 100644 --- a/leetcode-cn/problem (English)/链表相交(English) [intersection-of-two-linked-lists-lcci].html +++ b/leetcode-cn/problem (English)/链表相交(English) [intersection-of-two-linked-lists-lcci].html @@ -1,32 +1,32 @@ -
Given two (singly) linked lists, determine if the two lists intersect. Return the inter secting node. Note that the intersection is defined based on reference, not value. That is, if the kth node of the first linked list is the exact same node (by reference) as the jth node of the second linked list, then they are intersecting.
- -Example 1:
- --Input: intersectVal = 8, listA = [4,1,8,4,5], listB = [5,0,1,8,4,5], skipA = 2, skipB = 3 -Output: Reference of the node with value = 8 -Input Explanation: The intersected node's value is 8 (note that this must not be 0 if the two lists intersect). From the head of A, it reads as [4,1,8,4,5]. From the head of B, it reads as [5,0,1,8,4,5]. There are 2 nodes before the intersected node in A; There are 3 nodes before the intersected node in B.- -
Example 2:
- --Input: intersectVal = 2, listA = [0,9,1,2,4], listB = [3,2,4], skipA = 3, skipB = 1 -Output: Reference of the node with value = 2 -Input Explanation: The intersected node's value is 2 (note that this must not be 0 if the two lists intersect). From the head of A, it reads as [0,9,1,2,4]. From the head of B, it reads as [3,2,4]. There are 3 nodes before the intersected node in A; There are 1 node before the intersected node in B.- -
Example 3:
- --Input: intersectVal = 0, listA = [2,6,4], listB = [1,5], skipA = 3, skipB = 2 -Output: null -Input Explanation: From the head of A, it reads as [2,6,4]. From the head of B, it reads as [1,5]. Since the two lists do not intersect, intersectVal must be 0, while skipA and skipB can be arbitrary values. -Explanation: The two lists do not intersect, so return null.- -
Notes:
- -null.Given two (singly) linked lists, determine if the two lists intersect. Return the inter secting node. Note that the intersection is defined based on reference, not value. That is, if the kth node of the first linked list is the exact same node (by reference) as the jth node of the second linked list, then they are intersecting.
+ +Example 1:
+ ++Input: intersectVal = 8, listA = [4,1,8,4,5], listB = [5,0,1,8,4,5], skipA = 2, skipB = 3 +Output: Reference of the node with value = 8 +Input Explanation: The intersected node's value is 8 (note that this must not be 0 if the two lists intersect). From the head of A, it reads as [4,1,8,4,5]. From the head of B, it reads as [5,0,1,8,4,5]. There are 2 nodes before the intersected node in A; There are 3 nodes before the intersected node in B.+ +
Example 2:
+ ++Input: intersectVal = 2, listA = [0,9,1,2,4], listB = [3,2,4], skipA = 3, skipB = 1 +Output: Reference of the node with value = 2 +Input Explanation: The intersected node's value is 2 (note that this must not be 0 if the two lists intersect). From the head of A, it reads as [0,9,1,2,4]. From the head of B, it reads as [3,2,4]. There are 3 nodes before the intersected node in A; There are 1 node before the intersected node in B.+ +
Example 3:
+ ++Input: intersectVal = 0, listA = [2,6,4], listB = [1,5], skipA = 3, skipB = 2 +Output: null +Input Explanation: From the head of A, it reads as [2,6,4]. From the head of B, it reads as [1,5]. Since the two lists do not intersect, intersectVal must be 0, while skipA and skipB can be arbitrary values. +Explanation: The two lists do not intersect, so return null.+ +
Notes:
+ +null.Write an algorithm which computes the number of trailing zeros in n factorial.
- -Example 1:
- --Input: 3 -Output: 0 -Explanation: 3! = 6, no trailing zero.- -
Example 2:
- --Input: 5 -Output: 1 -Explanation: 5! = 120, one trailing zero.- -
Note: Your solution should be in logarithmic time complexity.
+Write an algorithm which computes the number of trailing zeros in n factorial.
+ +Example 1:
+ ++Input: 3 +Output: 0 +Explanation: 3! = 6, no trailing zero.+ +
Example 2:
+ ++Input: 5 +Output: 1 +Explanation: 5! = 120, one trailing zero.+ +
Note: Your solution should be in logarithmic time complexity.
diff --git a/leetcode-cn/problem (English)/雪糕的最大数量(English) [maximum-ice-cream-bars].html b/leetcode-cn/problem (English)/雪糕的最大数量(English) [maximum-ice-cream-bars].html index dbd83e17..580546b3 100644 --- a/leetcode-cn/problem (English)/雪糕的最大数量(English) [maximum-ice-cream-bars].html +++ b/leetcode-cn/problem (English)/雪糕的最大数量(English) [maximum-ice-cream-bars].html @@ -1,42 +1,42 @@ -It is a sweltering summer day, and a boy wants to buy some ice cream bars.
- -At the store, there are n ice cream bars. You are given an array costs of length n, where costs[i] is the price of the ith ice cream bar in coins. The boy initially has coins coins to spend, and he wants to buy as many ice cream bars as possible.
Return the maximum number of ice cream bars the boy can buy with coins coins.
Note: The boy can buy the ice cream bars in any order.
- --
Example 1:
- --Input: costs = [1,3,2,4,1], coins = 7 -Output: 4 -Explanation: The boy can buy ice cream bars at indices 0,1,2,4 for a total price of 1 + 3 + 2 + 1 = 7. -- -
Example 2:
- --Input: costs = [10,6,8,7,7,8], coins = 5 -Output: 0 -Explanation: The boy cannot afford any of the ice cream bars. -- -
Example 3:
- --Input: costs = [1,6,3,1,2,5], coins = 20 -Output: 6 -Explanation: The boy can buy all the ice cream bars for a total price of 1 + 6 + 3 + 1 + 2 + 5 = 18. -- -
-
Constraints:
- -costs.length == n1 <= n <= 1051 <= costs[i] <= 1051 <= coins <= 108It is a sweltering summer day, and a boy wants to buy some ice cream bars.
+ +At the store, there are n ice cream bars. You are given an array costs of length n, where costs[i] is the price of the ith ice cream bar in coins. The boy initially has coins coins to spend, and he wants to buy as many ice cream bars as possible.
Return the maximum number of ice cream bars the boy can buy with coins coins.
Note: The boy can buy the ice cream bars in any order.
+ ++
Example 1:
+ ++Input: costs = [1,3,2,4,1], coins = 7 +Output: 4 +Explanation: The boy can buy ice cream bars at indices 0,1,2,4 for a total price of 1 + 3 + 2 + 1 = 7. ++ +
Example 2:
+ ++Input: costs = [10,6,8,7,7,8], coins = 5 +Output: 0 +Explanation: The boy cannot afford any of the ice cream bars. ++ +
Example 3:
+ ++Input: costs = [1,6,3,1,2,5], coins = 20 +Output: 6 +Explanation: The boy can buy all the ice cream bars for a total price of 1 + 6 + 3 + 1 + 2 + 5 = 18. ++ +
+
Constraints:
+ +costs.length == n1 <= n <= 1051 <= costs[i] <= 1051 <= coins <= 108Write an algorithm such that if an element in an MxN matrix is 0, its entire row and column are set to 0.
- -- -
Example 1:
- --Input: -[ - [1,1,1], - [1,0,1], - [1,1,1] -] -Output: -[ - [1,0,1], - [0,0,0], - [1,0,1] -] -- -
Example 2:
- --Input: -[ - [0,1,2,0], - [3,4,5,2], - [1,3,1,5] -] -Output: -[ - [0,0,0,0], - [0,4,5,0], - [0,3,1,0] -] -+
Write an algorithm such that if an element in an MxN matrix is 0, its entire row and column are set to 0.
+ ++ +
Example 1:
+ ++Input: +[ + [1,1,1], + [1,0,1], + [1,1,1] +] +Output: +[ + [1,0,1], + [0,0,0], + [1,0,1] +] ++ +
Example 2:
+ ++Input: +[ + [0,1,2,0], + [3,4,5,2], + [1,3,1,5] +] +Output: +[ + [0,0,0,0], + [0,4,5,0], + [0,3,1,0] +] +diff --git a/leetcode-cn/problem (English)/颜色填充(English) [color-fill-lcci].html b/leetcode-cn/problem (English)/颜色填充(English) [color-fill-lcci].html index 3a95db67..208e27bb 100644 --- a/leetcode-cn/problem (English)/颜色填充(English) [color-fill-lcci].html +++ b/leetcode-cn/problem (English)/颜色填充(English) [color-fill-lcci].html @@ -1,22 +1,22 @@ -
Implement the "paint fill" function that one might see on many image editing programs. That is, given a screen (represented by a two-dimensional array of colors), a point, and a new color, fill in the surrounding area until the color changes from the original color.
- -Example1:
- --Input: -image = [[1,1,1],[1,1,0],[1,0,1]] -sr = 1, sc = 1, newColor = 2 -Output: [[2,2,2],[2,2,0],[2,0,1]] -Explanation: -From the center of the image (with position (sr, sc) = (1, 1)), all pixels connected -by a path of the same color as the starting pixel are colored with the new color. -Note the bottom corner is not colored 2, because it is not 4-directionally connected -to the starting pixel.- -
Note:
- -image and image[0] will be in the range [1, 50].0 <= sr < image.length and 0 <= sc < image[0].length.image[i][j] and newColor will be an integer in [0, 65535].Implement the "paint fill" function that one might see on many image editing programs. That is, given a screen (represented by a two-dimensional array of colors), a point, and a new color, fill in the surrounding area until the color changes from the original color.
+ +Example1:
+ ++Input: +image = [[1,1,1],[1,1,0],[1,0,1]] +sr = 1, sc = 1, newColor = 2 +Output: [[2,2,2],[2,2,0],[2,0,1]] +Explanation: +From the center of the image (with position (sr, sc) = (1, 1)), all pixels connected +by a path of the same color as the starting pixel are colored with the new color. +Note the bottom corner is not colored 2, because it is not 4-directionally connected +to the starting pixel.+ +
Note:
+ +image and image[0] will be in the range [1, 50].0 <= sr < image.length and 0 <= sc < image[0].length.image[i][j] and newColor will be an integer in [0, 65535].Design an algorithm and write code to find the first common ancestor of two nodes in a binary tree. Avoid storing additional nodes in a data structure. NOTE: This is not necessarily a binary search tree.
- -For example, Given the following tree: root = [3,5,1,6,2,0,8,null,null,7,4]
- -- 3 - / \ - 5 1 - / \ / \ -6 2 0 8 - / \ - 7 4 -- -
Example 1:
- --Input: root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 1 -Input: 3 -Explanation: The first common ancestor of node 5 and node 1 is node 3.- -
Example 2:
- --Input: root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 4 -Output: 5 -Explanation: The first common ancestor of node 5 and node 4 is node 5.- -
Notes:
- -Design an algorithm and write code to find the first common ancestor of two nodes in a binary tree. Avoid storing additional nodes in a data structure. NOTE: This is not necessarily a binary search tree.
+ +For example, Given the following tree: root = [3,5,1,6,2,0,8,null,null,7,4]
+ ++ 3 + / \ + 5 1 + / \ / \ +6 2 0 8 + / \ + 7 4 ++ +
Example 1:
+ ++Input: root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 1 +Input: 3 +Explanation: The first common ancestor of node 5 and node 1 is node 3.+ +
Example 2:
+ ++Input: root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 4 +Output: 5 +Explanation: The first common ancestor of node 5 and node 4 is node 5.+ +
Notes:
+ +A circus is designing a tower routine consisting of people standing atop one another's shoulders. For practical and aesthetic reasons, each person must be both shorter and lighter than the person below him or her. Given the heights and weights of each person in the circus, write a method to compute the largest possible number of people in such a tower.
- -Example:
- --Input: height = [65,70,56,75,60,68] weight = [100,150,90,190,95,110] -Output: 6 -Explanation: The longest tower is length 6 and includes from top to bottom: (56,90), (60,95), (65,100), (68,110), (70,150), (75,190)- -
Note:
- -height.length == weight.length <= 10000A circus is designing a tower routine consisting of people standing atop one another's shoulders. For practical and aesthetic reasons, each person must be both shorter and lighter than the person below him or her. Given the heights and weights of each person in the circus, write a method to compute the largest possible number of people in such a tower.
+ +Example:
+ ++Input: height = [65,70,56,75,60,68] weight = [100,150,90,190,95,110] +Output: 6 +Explanation: The longest tower is length 6 and includes from top to bottom: (56,90), (60,95), (65,100), (68,110), (70,150), (75,190)+ +
Note:
+ +height.length == weight.length <= 10000A magic index in an array A[0...n-1] is defined to be an index such that A[i] = i. Given a sorted array of integers, write a method to find a magic index, if one exists, in array A. If not, return -1. If there are more than one magic index, return the smallest one.
Example1:
- -- Input: nums = [0, 2, 3, 4, 5] - Output: 0 -- -
Example2:
- -- Input: nums = [1, 1, 1] - Output: 1 -- -
Note:
- -1 <= nums.length <= 1000000A magic index in an array A[0...n-1] is defined to be an index such that A[i] = i. Given a sorted array of integers, write a method to find a magic index, if one exists, in array A. If not, return -1. If there are more than one magic index, return the smallest one.
Example1:
+ ++ Input: nums = [0, 2, 3, 4, 5] + Output: 0 ++ +
Example2:
+ ++ Input: nums = [1, 1, 1] + Output: 1 ++ +
Note:
+ +1 <= nums.length <= 1000000