diff --git a/README.md b/README.md index 37741a84..768b7057 100644 --- a/README.md +++ b/README.md @@ -1,6 +1,6 @@ # 力扣题库(完整版) -> 最后更新日期: **2023.05.03** +> 最后更新日期: **2023.05.15** > > 使用脚本前请务必仔细完整阅读本 `README.md` 文件 diff --git a/leetcode-cn/origin-data.json b/leetcode-cn/origin-data.json index 5efd3180..9e95f9ea 100644 --- a/leetcode-cn/origin-data.json +++ b/leetcode-cn/origin-data.json @@ -1,19 +1,145 @@ { "user_name": "", "num_solved": 0, - "num_total": 3045, + "num_total": 3076, "ac_easy": 0, "ac_medium": 0, "ac_hard": 0, "stat_status_pairs": [ + { + "stat": { + "question_id": 1000570, + "question__title": "万灵之树", + "question__title_slug": "cnHoX6", + "question__hide": false, + "total_acs": 123, + "total_submitted": 854, + "total_column_articles": 4, + "frontend_question_id": "LCP 82", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 1000569, + "question__title": "与非的谜题", + "question__title_slug": "ryfUiz", + "question__hide": false, + "total_acs": 383, + "total_submitted": 931, + "total_column_articles": 13, + "frontend_question_id": "LCP 81", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 1000568, + "question__title": "生物进化录", + "question__title_slug": "qoQAMX", + "question__hide": false, + "total_acs": 776, + "total_submitted": 1594, + "total_column_articles": 12, + "frontend_question_id": "LCP 80", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 1000567, + "question__title": "提取咒文", + "question__title_slug": "kjpLFZ", + "question__hide": false, + "total_acs": 1212, + "total_submitted": 4607, + "total_column_articles": 16, + "frontend_question_id": "LCP 79", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 1000566, + "question__title": "城墙防线", + "question__title_slug": "Nsibyl", + "question__hide": false, + "total_acs": 1312, + "total_submitted": 2959, + "total_column_articles": 20, + "frontend_question_id": "LCP 78", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 1000565, + "question__title": "符文储备", + "question__title_slug": "W2ZX4X", + "question__hide": false, + "total_acs": 1821, + "total_submitted": 2475, + "total_column_articles": 18, + "frontend_question_id": "LCP 77", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 1000564, "question__title": "魔法棋盘", "question__title_slug": "1ybDKD", "question__hide": false, - "total_acs": 552, - "total_submitted": 1492, + "total_acs": 595, + "total_submitted": 1659, "total_column_articles": 12, "frontend_question_id": "LCP 76", "is_new_question": false @@ -33,8 +159,8 @@ "question__title": "传送卷轴", "question__title_slug": "rdmXM7", "question__hide": false, - "total_acs": 746, - "total_submitted": 2118, + "total_acs": 787, + "total_submitted": 2210, "total_column_articles": 15, "frontend_question_id": "LCP 75", "is_new_question": false @@ -54,9 +180,9 @@ "question__title": "最强祝福力场", "question__title_slug": "xepqZ5", "question__hide": false, - "total_acs": 1626, - "total_submitted": 5998, - "total_column_articles": 32, + "total_acs": 1828, + "total_submitted": 6454, + "total_column_articles": 35, "frontend_question_id": "LCP 74", "is_new_question": false }, @@ -75,9 +201,9 @@ "question__title": "探险营地", "question__title_slug": "0Zeoeg", "question__hide": false, - "total_acs": 2905, - "total_submitted": 6398, - "total_column_articles": 22, + "total_acs": 3033, + "total_submitted": 6651, + "total_column_articles": 23, "frontend_question_id": "LCP 73", "is_new_question": false }, @@ -96,9 +222,9 @@ "question__title": "补给马车", "question__title_slug": "hqCnmP", "question__hide": false, - "total_acs": 3254, - "total_submitted": 4664, - "total_column_articles": 36, + "total_acs": 3436, + "total_submitted": 4918, + "total_column_articles": 37, "frontend_question_id": "LCP 72", "is_new_question": false }, @@ -117,8 +243,8 @@ "question__title": "集水器", "question__title_slug": "kskhHQ", "question__hide": false, - "total_acs": 540, - "total_submitted": 996, + "total_acs": 568, + "total_submitted": 1034, "total_column_articles": 13, "frontend_question_id": "LCP 71", "is_new_question": false @@ -138,8 +264,8 @@ "question__title": "沙地治理", "question__title_slug": "XxZZjK", "question__hide": false, - "total_acs": 597, - "total_submitted": 2207, + "total_acs": 618, + "total_submitted": 2234, "total_column_articles": 15, "frontend_question_id": "LCP 70", "is_new_question": false @@ -159,8 +285,8 @@ "question__title": "Hello LeetCode!", "question__title_slug": "rMeRt2", "question__hide": false, - "total_acs": 1161, - "total_submitted": 3489, + "total_acs": 1274, + "total_submitted": 3756, "total_column_articles": 20, "frontend_question_id": "LCP 69", "is_new_question": false @@ -180,9 +306,9 @@ "question__title": "美观的花束", "question__title_slug": "1GxJYY", "question__hide": false, - "total_acs": 3115, - "total_submitted": 6167, - "total_column_articles": 50, + "total_acs": 3154, + "total_submitted": 6221, + "total_column_articles": 51, "frontend_question_id": "LCP 68", "is_new_question": false }, @@ -201,9 +327,9 @@ "question__title": "装饰树", "question__title_slug": "KnLfVT", "question__hide": false, - "total_acs": 4970, - "total_submitted": 5658, - "total_column_articles": 73, + "total_acs": 5079, + "total_submitted": 5772, + "total_column_articles": 76, "frontend_question_id": "LCP 67", "is_new_question": false }, @@ -222,9 +348,9 @@ "question__title": "最小展台数量", "question__title_slug": "600YaG", "question__hide": false, - "total_acs": 4933, - "total_submitted": 6374, - "total_column_articles": 76, + "total_acs": 5012, + "total_submitted": 6464, + "total_column_articles": 79, "frontend_question_id": "LCP 66", "is_new_question": false }, @@ -243,8 +369,8 @@ "question__title": "弹珠游戏", "question__title_slug": "EXvqDp", "question__hide": false, - "total_acs": 3873, - "total_submitted": 14767, + "total_acs": 3901, + "total_submitted": 14816, "total_column_articles": 113, "frontend_question_id": "LCP 63", "is_new_question": false @@ -264,9 +390,9 @@ "question__title": "二叉树灯饰", "question__title_slug": "U7WvvU", "question__hide": false, - "total_acs": 1965, - "total_submitted": 5542, - "total_column_articles": 49, + "total_acs": 1989, + "total_submitted": 5582, + "total_column_articles": 50, "frontend_question_id": "LCP 64", "is_new_question": false }, @@ -285,8 +411,8 @@ "question__title": "舒适的湿度", "question__title_slug": "3aqs1c", "question__hide": false, - "total_acs": 1016, - "total_submitted": 2216, + "total_acs": 1027, + "total_submitted": 2241, "total_column_articles": 14, "frontend_question_id": "LCP 65", "is_new_question": false @@ -306,9 +432,9 @@ "question__title": "交通枢纽", "question__title_slug": "D9PW8w", "question__hide": false, - "total_acs": 5874, - "total_submitted": 9431, - "total_column_articles": 68, + "total_acs": 5935, + "total_submitted": 9516, + "total_column_articles": 70, "frontend_question_id": "LCP 62", "is_new_question": false }, @@ -327,9 +453,9 @@ "question__title": "气温变化趋势", "question__title_slug": "6CE719", "question__hide": false, - "total_acs": 7408, - "total_submitted": 12049, - "total_column_articles": 80, + "total_acs": 7485, + "total_submitted": 12173, + "total_column_articles": 81, "frontend_question_id": "LCP 61", "is_new_question": false }, @@ -348,8 +474,8 @@ "question__title": "积木拼接", "question__title_slug": "De4qBB", "question__hide": false, - "total_acs": 414, - "total_submitted": 1174, + "total_acs": 428, + "total_submitted": 1231, "total_column_articles": 17, "frontend_question_id": "LCP 58", "is_new_question": false @@ -369,8 +495,8 @@ "question__title": "力扣泡泡龙", "question__title_slug": "WInSav", "question__hide": false, - "total_acs": 854, - "total_submitted": 4100, + "total_acs": 862, + "total_submitted": 4188, "total_column_articles": 27, "frontend_question_id": "LCP 60", "is_new_question": false @@ -390,8 +516,8 @@ "question__title": "搭桥过河", "question__title_slug": "NfY1m5", "question__hide": false, - "total_acs": 263, - "total_submitted": 848, + "total_acs": 267, + "total_submitted": 865, "total_column_articles": 10, "frontend_question_id": "LCP 59", "is_new_question": false @@ -411,9 +537,9 @@ "question__title": "打地鼠", "question__title_slug": "ZbAuEH", "question__hide": false, - "total_acs": 1898, - "total_submitted": 7017, - "total_column_articles": 42, + "total_acs": 1933, + "total_submitted": 7078, + "total_column_articles": 43, "frontend_question_id": "LCP 57", "is_new_question": false }, @@ -432,9 +558,9 @@ "question__title": "信物传送", "question__title_slug": "6UEx57", "question__hide": false, - "total_acs": 2452, - "total_submitted": 5711, - "total_column_articles": 70, + "total_acs": 2497, + "total_submitted": 5779, + "total_column_articles": 71, "frontend_question_id": "LCP 56", "is_new_question": false }, @@ -453,8 +579,8 @@ "question__title": "采集果实", "question__title_slug": "PTXy4P", "question__hide": false, - "total_acs": 5135, - "total_submitted": 6990, + "total_acs": 5182, + "total_submitted": 7049, "total_column_articles": 76, "frontend_question_id": "LCP 55", "is_new_question": false @@ -474,9 +600,9 @@ "question__title": "夺回据点", "question__title_slug": "s5kipK", "question__hide": false, - "total_acs": 520, - "total_submitted": 1301, - "total_column_articles": 11, + "total_acs": 538, + "total_submitted": 1337, + "total_column_articles": 12, "frontend_question_id": "LCP 54", "is_new_question": false }, @@ -495,8 +621,8 @@ "question__title": "守护太空城", "question__title_slug": "EJvmW4", "question__hide": false, - "total_acs": 947, - "total_submitted": 2166, + "total_acs": 959, + "total_submitted": 2179, "total_column_articles": 17, "frontend_question_id": "LCP 53", "is_new_question": false @@ -516,8 +642,8 @@ "question__title": "二叉搜索树染色", "question__title_slug": "QO5KpG", "question__hide": false, - "total_acs": 3976, - "total_submitted": 14062, + "total_acs": 4015, + "total_submitted": 14151, "total_column_articles": 93, "frontend_question_id": "LCP 52", "is_new_question": false @@ -537,8 +663,8 @@ "question__title": "烹饪料理", "question__title_slug": "UEcfPD", "question__hide": false, - "total_acs": 5235, - "total_submitted": 10931, + "total_acs": 5274, + "total_submitted": 11008, "total_column_articles": 106, "frontend_question_id": "LCP 51", "is_new_question": false @@ -558,9 +684,9 @@ "question__title": "宝石补给", "question__title_slug": "WHnhjV", "question__hide": false, - "total_acs": 7560, - "total_submitted": 11087, - "total_column_articles": 74, + "total_acs": 7620, + "total_submitted": 11179, + "total_column_articles": 75, "frontend_question_id": "LCP 50", "is_new_question": false }, @@ -579,8 +705,8 @@ "question__title": "自行车炫技赛场", "question__title_slug": "kplEvH", "question__hide": false, - "total_acs": 2596, - "total_submitted": 9005, + "total_acs": 2611, + "total_submitted": 9035, "total_column_articles": 57, "frontend_question_id": "LCP 45", "is_new_question": false @@ -600,8 +726,8 @@ "question__title": "无限棋局", "question__title_slug": "fsa7oZ", "question__hide": false, - "total_acs": 952, - "total_submitted": 3349, + "total_acs": 959, + "total_submitted": 3370, "total_column_articles": 17, "frontend_question_id": "LCP 48", "is_new_question": false @@ -621,8 +747,8 @@ "question__title": "志愿者调配", "question__title_slug": "05ZEDJ", "question__hide": false, - "total_acs": 1918, - "total_submitted": 3921, + "total_acs": 1931, + "total_submitted": 3941, "total_column_articles": 44, "frontend_question_id": "LCP 46", "is_new_question": false @@ -642,8 +768,8 @@ "question__title": "玩具套圈", "question__title_slug": "vFjcfV", "question__hide": false, - "total_acs": 2572, - "total_submitted": 8995, + "total_acs": 2588, + "total_submitted": 9026, "total_column_articles": 48, "frontend_question_id": "LCP 42", "is_new_question": false @@ -663,8 +789,8 @@ "question__title": "黑白翻转棋", "question__title_slug": "fHi6rV", "question__hide": false, - "total_acs": 2774, - "total_submitted": 5394, + "total_acs": 2795, + "total_submitted": 5421, "total_column_articles": 68, "frontend_question_id": "LCP 41", "is_new_question": false @@ -684,8 +810,8 @@ "question__title": "无人机方阵", "question__title_slug": "0jQkd0", "question__hide": false, - "total_acs": 8750, - "total_submitted": 15772, + "total_acs": 8790, + "total_submitted": 15854, "total_column_articles": 95, "frontend_question_id": "LCP 39", "is_new_question": false @@ -705,9 +831,9 @@ "question__title": "心算挑战", "question__title_slug": "uOAnQW", "question__hide": false, - "total_acs": 8730, - "total_submitted": 28096, - "total_column_articles": 180, + "total_acs": 8778, + "total_submitted": 28247, + "total_column_articles": 181, "frontend_question_id": "LCP 40", "is_new_question": false }, @@ -726,8 +852,8 @@ "question__title": "十字路口的交通", "question__title_slug": "Y1VbOX", "question__hide": false, - "total_acs": 1247, - "total_submitted": 2444, + "total_acs": 1256, + "total_submitted": 2460, "total_column_articles": 30, "frontend_question_id": "LCP 43", "is_new_question": false @@ -747,9 +873,9 @@ "question__title": "开幕式焰火", "question__title_slug": "sZ59z6", "question__hide": false, - "total_acs": 14004, - "total_submitted": 17756, - "total_column_articles": 204, + "total_acs": 14112, + "total_submitted": 17905, + "total_column_articles": 207, "frontend_question_id": "LCP 44", "is_new_question": false }, @@ -768,9 +894,9 @@ "question__title": "入场安检", "question__title_slug": "oPs9Bm", "question__hide": false, - "total_acs": 1737, - "total_submitted": 3889, - "total_column_articles": 32, + "total_acs": 1756, + "total_submitted": 3917, + "total_column_articles": 33, "frontend_question_id": "LCP 47", "is_new_question": false }, @@ -789,9 +915,9 @@ "question__title": "环形闯关游戏", "question__title_slug": "K8GULz", "question__hide": false, - "total_acs": 954, - "total_submitted": 2737, - "total_column_articles": 19, + "total_acs": 969, + "total_submitted": 2760, + "total_column_articles": 20, "frontend_question_id": "LCP 49", "is_new_question": false }, @@ -810,9 +936,9 @@ "question__title": "省份数量", "question__title_slug": "bLyHh0", "question__hide": false, - "total_acs": 21474, - "total_submitted": 31844, - "total_column_articles": 210, + "total_acs": 21797, + "total_submitted": 32308, + "total_column_articles": 211, "frontend_question_id": "剑指 Offer II 116", "is_new_question": false }, @@ -831,9 +957,9 @@ "question__title": "路径的数目", "question__title_slug": "2AoeFn", "question__hide": false, - "total_acs": 20190, - "total_submitted": 26457, - "total_column_articles": 204, + "total_acs": 20466, + "total_submitted": 26825, + "total_column_articles": 205, "frontend_question_id": "剑指 Offer II 098", "is_new_question": false }, @@ -852,9 +978,9 @@ "question__title": "含有 k 个元素的组合", "question__title_slug": "uUsW3B", "question__hide": false, - "total_acs": 27062, - "total_submitted": 32539, - "total_column_articles": 197, + "total_acs": 27479, + "total_submitted": 33017, + "total_column_articles": 198, "frontend_question_id": "剑指 Offer II 080", "is_new_question": false }, @@ -873,9 +999,9 @@ "question__title": "所有子集", "question__title_slug": "TVdhkn", "question__hide": false, - "total_acs": 29545, - "total_submitted": 34532, - "total_column_articles": 300, + "total_acs": 29952, + "total_submitted": 35005, + "total_column_articles": 301, "frontend_question_id": "剑指 Offer II 079", "is_new_question": false }, @@ -894,8 +1020,8 @@ "question__title": "合并排序链表", "question__title_slug": "vvXgSW", "question__hide": false, - "total_acs": 28580, - "total_submitted": 44698, + "total_acs": 28997, + "total_submitted": 45300, "total_column_articles": 265, "frontend_question_id": "剑指 Offer II 078", "is_new_question": false @@ -915,9 +1041,9 @@ "question__title": "链表排序", "question__title_slug": "7WHec2", "question__hide": false, - "total_acs": 36942, - "total_submitted": 58733, - "total_column_articles": 349, + "total_acs": 37423, + "total_submitted": 59543, + "total_column_articles": 348, "frontend_question_id": "剑指 Offer II 077", "is_new_question": false }, @@ -936,9 +1062,9 @@ "question__title": "数组中的第 k 大的数字", "question__title_slug": "xx4gT2", "question__hide": false, - "total_acs": 43860, - "total_submitted": 65359, - "total_column_articles": 288, + "total_acs": 44501, + "total_submitted": 66309, + "total_column_articles": 294, "frontend_question_id": "剑指 Offer II 076", "is_new_question": false }, @@ -957,9 +1083,9 @@ "question__title": "数组相对排序", "question__title_slug": "0H97ZC", "question__hide": false, - "total_acs": 25761, - "total_submitted": 36677, - "total_column_articles": 324, + "total_acs": 26133, + "total_submitted": 37227, + "total_column_articles": 325, "frontend_question_id": "剑指 Offer II 075", "is_new_question": false }, @@ -978,9 +1104,9 @@ "question__title": "合并区间", "question__title_slug": "SsGoHC", "question__hide": false, - "total_acs": 26560, - "total_submitted": 46867, - "total_column_articles": 235, + "total_acs": 27107, + "total_submitted": 47877, + "total_column_articles": 237, "frontend_question_id": "剑指 Offer II 074", "is_new_question": false }, @@ -999,9 +1125,9 @@ "question__title": "狒狒吃香蕉", "question__title_slug": "nZZqjQ", "question__hide": false, - "total_acs": 22362, - "total_submitted": 41946, - "total_column_articles": 185, + "total_acs": 22686, + "total_submitted": 42524, + "total_column_articles": 186, "frontend_question_id": "剑指 Offer II 073", "is_new_question": false }, @@ -1020,9 +1146,9 @@ "question__title": "求平方根", "question__title_slug": "jJ0w9p", "question__hide": false, - "total_acs": 35453, - "total_submitted": 81632, - "total_column_articles": 242, + "total_acs": 35848, + "total_submitted": 82561, + "total_column_articles": 244, "frontend_question_id": "剑指 Offer II 072", "is_new_question": false }, @@ -1041,9 +1167,9 @@ "question__title": "按权重生成随机数", "question__title_slug": "cuyjEf", "question__hide": false, - "total_acs": 15843, - "total_submitted": 31856, - "total_column_articles": 108, + "total_acs": 16076, + "total_submitted": 32279, + "total_column_articles": 110, "frontend_question_id": "剑指 Offer II 071", "is_new_question": false }, @@ -1062,8 +1188,8 @@ "question__title": "排序数组中只出现一次的数字", "question__title_slug": "skFtm2", "question__hide": false, - "total_acs": 28116, - "total_submitted": 45541, + "total_acs": 28544, + "total_submitted": 46363, "total_column_articles": 252, "frontend_question_id": "剑指 Offer II 070", "is_new_question": false @@ -1083,9 +1209,9 @@ "question__title": "山峰数组的顶部", "question__title_slug": "B1IidL", "question__hide": false, - "total_acs": 63827, - "total_submitted": 90409, - "total_column_articles": 602, + "total_acs": 64275, + "total_submitted": 91026, + "total_column_articles": 603, "frontend_question_id": "剑指 Offer II 069", "is_new_question": false }, @@ -1104,9 +1230,9 @@ "question__title": "查找插入位置", "question__title_slug": "N6YdxV", "question__hide": false, - "total_acs": 29362, - "total_submitted": 59598, - "total_column_articles": 267, + "total_acs": 29866, + "total_submitted": 60662, + "total_column_articles": 271, "frontend_question_id": "剑指 Offer II 068", "is_new_question": false }, @@ -1125,9 +1251,9 @@ "question__title": "最大的异或", "question__title_slug": "ms70jA", "question__hide": false, - "total_acs": 13905, - "total_submitted": 21143, - "total_column_articles": 142, + "total_acs": 14070, + "total_submitted": 21380, + "total_column_articles": 143, "frontend_question_id": "剑指 Offer II 067", "is_new_question": false }, @@ -1146,9 +1272,9 @@ "question__title": "单词之和", "question__title_slug": "z1R5dt", "question__hide": false, - "total_acs": 15393, - "total_submitted": 23889, - "total_column_articles": 219, + "total_acs": 15597, + "total_submitted": 24209, + "total_column_articles": 221, "frontend_question_id": "剑指 Offer II 066", "is_new_question": false }, @@ -1167,8 +1293,8 @@ "question__title": "最短的单词编码", "question__title_slug": "iSwD2y", "question__hide": false, - "total_acs": 15486, - "total_submitted": 24423, + "total_acs": 15724, + "total_submitted": 24781, "total_column_articles": 171, "frontend_question_id": "剑指 Offer II 065", "is_new_question": false @@ -1188,8 +1314,8 @@ "question__title": "神奇的字典", "question__title_slug": "US1pGT", "question__hide": false, - "total_acs": 15361, - "total_submitted": 25215, + "total_acs": 15589, + "total_submitted": 25573, "total_column_articles": 172, "frontend_question_id": "剑指 Offer II 064", "is_new_question": false @@ -1209,8 +1335,8 @@ "question__title": "替换单词", "question__title_slug": "UhWRSj", "question__hide": false, - "total_acs": 19383, - "total_submitted": 27320, + "total_acs": 19681, + "total_submitted": 27739, "total_column_articles": 253, "frontend_question_id": "剑指 Offer II 063", "is_new_question": false @@ -1230,9 +1356,9 @@ "question__title": "和最小的 k 个数对", "question__title_slug": "qn8gGX", "question__hide": false, - "total_acs": 19578, - "total_submitted": 36533, - "total_column_articles": 178, + "total_acs": 19864, + "total_submitted": 37051, + "total_column_articles": 179, "frontend_question_id": "剑指 Offer II 061", "is_new_question": false }, @@ -1251,9 +1377,9 @@ "question__title": "实现前缀树", "question__title_slug": "QC3q1f", "question__hide": false, - "total_acs": 21586, - "total_submitted": 28563, - "total_column_articles": 193, + "total_acs": 22038, + "total_submitted": 29164, + "total_column_articles": 197, "frontend_question_id": "剑指 Offer II 062", "is_new_question": false }, @@ -1272,9 +1398,9 @@ "question__title": "出现频率最高的 k 个数字", "question__title_slug": "g5c51o", "question__hide": false, - "total_acs": 25419, - "total_submitted": 36965, - "total_column_articles": 263, + "total_acs": 25828, + "total_submitted": 37538, + "total_column_articles": 265, "frontend_question_id": "剑指 Offer II 060", "is_new_question": false }, @@ -1293,9 +1419,9 @@ "question__title": "数据流的第 K 大数值", "question__title_slug": "jBjn9C", "question__hide": false, - "total_acs": 22686, - "total_submitted": 36174, - "total_column_articles": 193, + "total_acs": 23026, + "total_submitted": 36734, + "total_column_articles": 195, "frontend_question_id": "剑指 Offer II 059", "is_new_question": false }, @@ -1314,8 +1440,8 @@ "question__title": "日程表", "question__title_slug": "fi9suh", "question__hide": false, - "total_acs": 17999, - "total_submitted": 29322, + "total_acs": 18265, + "total_submitted": 29762, "total_column_articles": 170, "frontend_question_id": "剑指 Offer II 058", "is_new_question": false @@ -1335,9 +1461,9 @@ "question__title": "值和下标之差都在给定的范围内", "question__title_slug": "7WqeDu", "question__hide": false, - "total_acs": 19365, - "total_submitted": 55364, - "total_column_articles": 140, + "total_acs": 19662, + "total_submitted": 56135, + "total_column_articles": 141, "frontend_question_id": "剑指 Offer II 057", "is_new_question": false }, @@ -1356,9 +1482,9 @@ "question__title": "最长连续序列", "question__title_slug": "WhsWhI", "question__hide": false, - "total_acs": 24805, - "total_submitted": 50368, - "total_column_articles": 212, + "total_acs": 25223, + "total_submitted": 51210, + "total_column_articles": 214, "frontend_question_id": "剑指 Offer II 119", "is_new_question": false }, @@ -1377,9 +1503,9 @@ "question__title": "二叉搜索树中两个节点之和", "question__title_slug": "opLdQZ", "question__hide": false, - "total_acs": 30110, - "total_submitted": 41044, - "total_column_articles": 295, + "total_acs": 30641, + "total_submitted": 41754, + "total_column_articles": 297, "frontend_question_id": "剑指 Offer II 056", "is_new_question": false }, @@ -1398,8 +1524,8 @@ "question__title": "多余的边", "question__title_slug": "7LpjUW", "question__hide": false, - "total_acs": 10956, - "total_submitted": 15756, + "total_acs": 11162, + "total_submitted": 16052, "total_column_articles": 126, "frontend_question_id": "剑指 Offer II 118", "is_new_question": false @@ -1419,8 +1545,8 @@ "question__title": "相似的字符串", "question__title_slug": "H6lPxb", "question__hide": false, - "total_acs": 9236, - "total_submitted": 14880, + "total_acs": 9424, + "total_submitted": 15188, "total_column_articles": 94, "frontend_question_id": "剑指 Offer II 117", "is_new_question": false @@ -1440,8 +1566,8 @@ "question__title": "二叉搜索树迭代器", "question__title_slug": "kTOapQ", "question__hide": false, - "total_acs": 20838, - "total_submitted": 24422, + "total_acs": 21092, + "total_submitted": 24718, "total_column_articles": 197, "frontend_question_id": "剑指 Offer II 055", "is_new_question": false @@ -1461,9 +1587,9 @@ "question__title": "所有大于等于节点的值之和", "question__title_slug": "w6cpku", "question__hide": false, - "total_acs": 25262, - "total_submitted": 29525, - "total_column_articles": 266, + "total_acs": 25603, + "total_submitted": 29934, + "total_column_articles": 269, "frontend_question_id": "剑指 Offer II 054", "is_new_question": false }, @@ -1482,8 +1608,8 @@ "question__title": "重建序列", "question__title_slug": "ur2n8P", "question__hide": false, - "total_acs": 24762, - "total_submitted": 48633, + "total_acs": 24975, + "total_submitted": 48996, "total_column_articles": 276, "frontend_question_id": "剑指 Offer II 115", "is_new_question": false @@ -1503,9 +1629,9 @@ "question__title": "二叉搜索树中的中序后继", "question__title_slug": "P5rCT8", "question__hide": false, - "total_acs": 31201, - "total_submitted": 49288, - "total_column_articles": 272, + "total_acs": 31610, + "total_submitted": 49946, + "total_column_articles": 273, "frontend_question_id": "剑指 Offer II 053", "is_new_question": false }, @@ -1524,8 +1650,8 @@ "question__title": "外星文字典", "question__title_slug": "Jf1JuT", "question__hide": false, - "total_acs": 21118, - "total_submitted": 40577, + "total_acs": 21269, + "total_submitted": 40918, "total_column_articles": 215, "frontend_question_id": "剑指 Offer II 114", "is_new_question": false @@ -1545,9 +1671,9 @@ "question__title": "展平二叉搜索树", "question__title_slug": "NYBBNL", "question__hide": false, - "total_acs": 29962, - "total_submitted": 40617, - "total_column_articles": 262, + "total_acs": 30350, + "total_submitted": 41125, + "total_column_articles": 265, "frontend_question_id": "剑指 Offer II 052", "is_new_question": false }, @@ -1566,9 +1692,9 @@ "question__title": "课程顺序", "question__title_slug": "QA2IGt", "question__hide": false, - "total_acs": 14059, - "total_submitted": 24887, - "total_column_articles": 148, + "total_acs": 14346, + "total_submitted": 25332, + "total_column_articles": 149, "frontend_question_id": "剑指 Offer II 113", "is_new_question": false }, @@ -1587,9 +1713,9 @@ "question__title": "节点之和最大的路径", "question__title_slug": "jC7MId", "question__hide": false, - "total_acs": 19513, - "total_submitted": 39866, - "total_column_articles": 165, + "total_acs": 19757, + "total_submitted": 40341, + "total_column_articles": 169, "frontend_question_id": "剑指 Offer II 051", "is_new_question": false }, @@ -1608,8 +1734,8 @@ "question__title": "最长递增路径", "question__title_slug": "fpTFWP", "question__hide": false, - "total_acs": 13390, - "total_submitted": 23067, + "total_acs": 13596, + "total_submitted": 23443, "total_column_articles": 127, "frontend_question_id": "剑指 Offer II 112", "is_new_question": false @@ -1629,9 +1755,9 @@ "question__title": "向下的路径节点之和", "question__title_slug": "6eUYwP", "question__hide": false, - "total_acs": 25712, - "total_submitted": 49482, - "total_column_articles": 211, + "total_acs": 26048, + "total_submitted": 50286, + "total_column_articles": 213, "frontend_question_id": "剑指 Offer II 050", "is_new_question": false }, @@ -1650,9 +1776,9 @@ "question__title": "从根节点到叶节点的路径数字之和", "question__title_slug": "3Etpl5", "question__hide": false, - "total_acs": 28834, - "total_submitted": 38995, - "total_column_articles": 281, + "total_acs": 29254, + "total_submitted": 39600, + "total_column_articles": 282, "frontend_question_id": "剑指 Offer II 049", "is_new_question": false }, @@ -1671,9 +1797,9 @@ "question__title": "计算除法", "question__title_slug": "vlzXQL", "question__hide": false, - "total_acs": 8801, - "total_submitted": 13550, - "total_column_articles": 113, + "total_acs": 8946, + "total_submitted": 13801, + "total_column_articles": 114, "frontend_question_id": "剑指 Offer II 111", "is_new_question": false }, @@ -1692,8 +1818,8 @@ "question__title": "序列化与反序列化二叉树", "question__title_slug": "h54YBf", "question__hide": false, - "total_acs": 21171, - "total_submitted": 31482, + "total_acs": 21426, + "total_submitted": 31860, "total_column_articles": 178, "frontend_question_id": "剑指 Offer II 048", "is_new_question": false @@ -1713,9 +1839,9 @@ "question__title": "所有路径", "question__title_slug": "bP4bmD", "question__hide": false, - "total_acs": 17881, - "total_submitted": 22106, - "total_column_articles": 205, + "total_acs": 18229, + "total_submitted": 22514, + "total_column_articles": 206, "frontend_question_id": "剑指 Offer II 110", "is_new_question": false }, @@ -1734,8 +1860,8 @@ "question__title": "开密码锁", "question__title_slug": "zlDJc7", "question__hide": false, - "total_acs": 13429, - "total_submitted": 23258, + "total_acs": 13680, + "total_submitted": 23714, "total_column_articles": 125, "frontend_question_id": "剑指 Offer II 109", "is_new_question": false @@ -1755,8 +1881,8 @@ "question__title": "二叉树剪枝", "question__title_slug": "pOCWxh", "question__hide": false, - "total_acs": 29038, - "total_submitted": 42391, + "total_acs": 29413, + "total_submitted": 42942, "total_column_articles": 330, "frontend_question_id": "剑指 Offer II 047", "is_new_question": false @@ -1776,8 +1902,8 @@ "question__title": "单词演变", "question__title_slug": "om3reC", "question__hide": false, - "total_acs": 10239, - "total_submitted": 17129, + "total_acs": 10430, + "total_submitted": 17474, "total_column_articles": 87, "frontend_question_id": "剑指 Offer II 108", "is_new_question": false @@ -1797,9 +1923,9 @@ "question__title": "二叉树的右侧视图", "question__title_slug": "WNC0Lk", "question__hide": false, - "total_acs": 26836, - "total_submitted": 37952, - "total_column_articles": 326, + "total_acs": 27202, + "total_submitted": 38456, + "total_column_articles": 329, "frontend_question_id": "剑指 Offer II 046", "is_new_question": false }, @@ -1818,9 +1944,9 @@ "question__title": "二叉树最底层最左边的值", "question__title_slug": "LwUNpT", "question__hide": false, - "total_acs": 30364, - "total_submitted": 38272, - "total_column_articles": 329, + "total_acs": 30735, + "total_submitted": 38773, + "total_column_articles": 330, "frontend_question_id": "剑指 Offer II 045", "is_new_question": false }, @@ -1839,9 +1965,9 @@ "question__title": "二叉树每层的最大值", "question__title_slug": "hPov7L", "question__hide": false, - "total_acs": 29838, - "total_submitted": 46694, - "total_column_articles": 289, + "total_acs": 30248, + "total_submitted": 47260, + "total_column_articles": 290, "frontend_question_id": "剑指 Offer II 044", "is_new_question": false }, @@ -1860,9 +1986,9 @@ "question__title": "矩阵中的距离", "question__title_slug": "2bCMpM", "question__hide": false, - "total_acs": 14345, - "total_submitted": 27886, - "total_column_articles": 113, + "total_acs": 14626, + "total_submitted": 28482, + "total_column_articles": 115, "frontend_question_id": "剑指 Offer II 107", "is_new_question": false }, @@ -1881,9 +2007,9 @@ "question__title": "往完全二叉树添加节点", "question__title_slug": "NaqhDT", "question__hide": false, - "total_acs": 22082, - "total_submitted": 35413, - "total_column_articles": 255, + "total_acs": 22381, + "total_submitted": 35840, + "total_column_articles": 256, "frontend_question_id": "剑指 Offer II 043", "is_new_question": false }, @@ -1902,9 +2028,9 @@ "question__title": "二分图", "question__title_slug": "vEAB3K", "question__hide": false, - "total_acs": 15197, - "total_submitted": 27480, - "total_column_articles": 142, + "total_acs": 15473, + "total_submitted": 27956, + "total_column_articles": 145, "frontend_question_id": "剑指 Offer II 106", "is_new_question": false }, @@ -1923,9 +2049,9 @@ "question__title": "最近请求次数", "question__title_slug": "H8086Q", "question__hide": false, - "total_acs": 26490, - "total_submitted": 32263, - "total_column_articles": 211, + "total_acs": 26779, + "total_submitted": 32603, + "total_column_articles": 212, "frontend_question_id": "剑指 Offer II 042", "is_new_question": false }, @@ -1944,9 +2070,9 @@ "question__title": "滑动窗口的平均值", "question__title_slug": "qIsx9U", "question__hide": false, - "total_acs": 55685, - "total_submitted": 71402, - "total_column_articles": 466, + "total_acs": 56142, + "total_submitted": 72031, + "total_column_articles": 468, "frontend_question_id": "剑指 Offer II 041", "is_new_question": false }, @@ -1965,9 +2091,9 @@ "question__title": "岛屿的最大面积", "question__title_slug": "ZL6zAn", "question__hide": false, - "total_acs": 28463, - "total_submitted": 40759, - "total_column_articles": 285, + "total_acs": 28926, + "total_submitted": 41430, + "total_column_articles": 289, "frontend_question_id": "剑指 Offer II 105", "is_new_question": false }, @@ -1986,9 +2112,9 @@ "question__title": "排列的数目", "question__title_slug": "D0F0SV", "question__hide": false, - "total_acs": 13955, - "total_submitted": 24220, - "total_column_articles": 109, + "total_acs": 14176, + "total_submitted": 24593, + "total_column_articles": 110, "frontend_question_id": "剑指 Offer II 104", "is_new_question": false }, @@ -2007,9 +2133,9 @@ "question__title": "最少的硬币数目", "question__title_slug": "gaM7Ch", "question__hide": false, - "total_acs": 27415, - "total_submitted": 53953, - "total_column_articles": 177, + "total_acs": 27816, + "total_submitted": 54705, + "total_column_articles": 178, "frontend_question_id": "剑指 Offer II 103", "is_new_question": false }, @@ -2028,8 +2154,8 @@ "question__title": "加减的目标值", "question__title_slug": "YaVDxD", "question__hide": false, - "total_acs": 19439, - "total_submitted": 34264, + "total_acs": 19688, + "total_submitted": 34680, "total_column_articles": 134, "frontend_question_id": "剑指 Offer II 102", "is_new_question": false @@ -2049,8 +2175,8 @@ "question__title": "分割等和子集", "question__title_slug": "NUPfPr", "question__hide": false, - "total_acs": 24343, - "total_submitted": 49383, + "total_acs": 24653, + "total_submitted": 50017, "total_column_articles": 159, "frontend_question_id": "剑指 Offer II 101", "is_new_question": false @@ -2070,9 +2196,9 @@ "question__title": "三角形中最小路径之和", "question__title_slug": "IlPe0q", "question__hide": false, - "total_acs": 20280, - "total_submitted": 27300, - "total_column_articles": 215, + "total_acs": 20604, + "total_submitted": 27715, + "total_column_articles": 216, "frontend_question_id": "剑指 Offer II 100", "is_new_question": false }, @@ -2091,8 +2217,8 @@ "question__title": "最小路径之和", "question__title_slug": "0i0mDW", "question__hide": false, - "total_acs": 23602, - "total_submitted": 32157, + "total_acs": 23912, + "total_submitted": 32545, "total_column_articles": 215, "frontend_question_id": "剑指 Offer II 099", "is_new_question": false @@ -2112,9 +2238,9 @@ "question__title": "矩阵中最大的矩形", "question__title_slug": "PLYXKQ", "question__hide": false, - "total_acs": 16851, - "total_submitted": 28959, - "total_column_articles": 183, + "total_acs": 17099, + "total_submitted": 29363, + "total_column_articles": 185, "frontend_question_id": "剑指 Offer II 040", "is_new_question": false }, @@ -2133,9 +2259,9 @@ "question__title": "直方图最大矩形面积", "question__title_slug": "0ynMMM", "question__hide": false, - "total_acs": 25273, - "total_submitted": 49877, - "total_column_articles": 196, + "total_acs": 25646, + "total_submitted": 50610, + "total_column_articles": 197, "frontend_question_id": "剑指 Offer II 039", "is_new_question": false }, @@ -2154,9 +2280,9 @@ "question__title": "每日温度", "question__title_slug": "iIQa4I", "question__hide": false, - "total_acs": 36044, - "total_submitted": 47211, - "total_column_articles": 325, + "total_acs": 36549, + "total_submitted": 47863, + "total_column_articles": 327, "frontend_question_id": "剑指 Offer II 038", "is_new_question": false }, @@ -2175,9 +2301,9 @@ "question__title": "小行星碰撞", "question__title_slug": "XagZNi", "question__hide": false, - "total_acs": 29299, - "total_submitted": 65281, - "total_column_articles": 323, + "total_acs": 29687, + "total_submitted": 66093, + "total_column_articles": 325, "frontend_question_id": "剑指 Offer II 037", "is_new_question": false }, @@ -2196,9 +2322,9 @@ "question__title": "子序列的数目", "question__title_slug": "21dk04", "question__hide": false, - "total_acs": 13953, - "total_submitted": 25230, - "total_column_articles": 118, + "total_acs": 14147, + "total_submitted": 25586, + "total_column_articles": 119, "frontend_question_id": "剑指 Offer II 097", "is_new_question": false }, @@ -2217,9 +2343,9 @@ "question__title": "后缀表达式", "question__title_slug": "8Zf90G", "question__hide": false, - "total_acs": 27418, - "total_submitted": 49369, - "total_column_articles": 275, + "total_acs": 27767, + "total_submitted": 49998, + "total_column_articles": 276, "frontend_question_id": "剑指 Offer II 036", "is_new_question": false }, @@ -2238,9 +2364,9 @@ "question__title": "最小时间差", "question__title_slug": "569nqc", "question__hide": false, - "total_acs": 28520, - "total_submitted": 43191, - "total_column_articles": 209, + "total_acs": 28883, + "total_submitted": 43737, + "total_column_articles": 212, "frontend_question_id": "剑指 Offer II 035", "is_new_question": false }, @@ -2259,8 +2385,8 @@ "question__title": "字符串交织", "question__title_slug": "IY6buf", "question__hide": false, - "total_acs": 15537, - "total_submitted": 32420, + "total_acs": 15763, + "total_submitted": 32908, "total_column_articles": 119, "frontend_question_id": "剑指 Offer II 096", "is_new_question": false @@ -2280,9 +2406,9 @@ "question__title": "外星语言是否排序", "question__title_slug": "lwyVBB", "question__hide": false, - "total_acs": 24328, - "total_submitted": 43627, - "total_column_articles": 298, + "total_acs": 24597, + "total_submitted": 44133, + "total_column_articles": 299, "frontend_question_id": "剑指 Offer II 034", "is_new_question": false }, @@ -2301,9 +2427,9 @@ "question__title": "变位词组", "question__title_slug": "sfvd7V", "question__hide": false, - "total_acs": 28343, - "total_submitted": 37843, - "total_column_articles": 227, + "total_acs": 28681, + "total_submitted": 38330, + "total_column_articles": 228, "frontend_question_id": "剑指 Offer II 033", "is_new_question": false }, @@ -2322,9 +2448,9 @@ "question__title": "最长公共子序列", "question__title_slug": "qJnOS7", "question__hide": false, - "total_acs": 41259, - "total_submitted": 62831, - "total_column_articles": 257, + "total_acs": 41752, + "total_submitted": 63583, + "total_column_articles": 259, "frontend_question_id": "剑指 Offer II 095", "is_new_question": false }, @@ -2343,9 +2469,9 @@ "question__title": "有效的变位词", "question__title_slug": "dKk3P7", "question__hide": false, - "total_acs": 33147, - "total_submitted": 55364, - "total_column_articles": 263, + "total_acs": 33566, + "total_submitted": 56051, + "total_column_articles": 264, "frontend_question_id": "剑指 Offer II 032", "is_new_question": false }, @@ -2364,8 +2490,8 @@ "question__title": "最少回文分割", "question__title_slug": "omKAoA", "question__hide": false, - "total_acs": 13512, - "total_submitted": 23404, + "total_acs": 13694, + "total_submitted": 23704, "total_column_articles": 106, "frontend_question_id": "剑指 Offer II 094", "is_new_question": false @@ -2385,9 +2511,9 @@ "question__title": "最长斐波那契数列", "question__title_slug": "Q91FMA", "question__hide": false, - "total_acs": 18960, - "total_submitted": 32437, - "total_column_articles": 129, + "total_acs": 19236, + "total_submitted": 32935, + "total_column_articles": 130, "frontend_question_id": "剑指 Offer II 093", "is_new_question": false }, @@ -2406,9 +2532,9 @@ "question__title": "最近最少使用缓存", "question__title_slug": "OrIXps", "question__hide": false, - "total_acs": 25876, - "total_submitted": 46589, - "total_column_articles": 252, + "total_acs": 26251, + "total_submitted": 47205, + "total_column_articles": 254, "frontend_question_id": "剑指 Offer II 031", "is_new_question": false }, @@ -2427,9 +2553,9 @@ "question__title": "翻转字符", "question__title_slug": "cyJERH", "question__hide": false, - "total_acs": 20507, - "total_submitted": 30100, - "total_column_articles": 233, + "total_acs": 20768, + "total_submitted": 30483, + "total_column_articles": 237, "frontend_question_id": "剑指 Offer II 092", "is_new_question": false }, @@ -2448,9 +2574,9 @@ "question__title": "粉刷房子", "question__title_slug": "JEj789", "question__hide": false, - "total_acs": 44907, - "total_submitted": 57896, - "total_column_articles": 542, + "total_acs": 45247, + "total_submitted": 58337, + "total_column_articles": 543, "frontend_question_id": "剑指 Offer II 091", "is_new_question": false }, @@ -2469,9 +2595,9 @@ "question__title": "插入、删除和随机访问都是 O(1) 的容器", "question__title_slug": "FortPu", "question__hide": false, - "total_acs": 24123, - "total_submitted": 44788, - "total_column_articles": 169, + "total_acs": 24430, + "total_submitted": 45369, + "total_column_articles": 171, "frontend_question_id": "剑指 Offer II 030", "is_new_question": false }, @@ -2490,9 +2616,9 @@ "question__title": "环形房屋偷盗", "question__title_slug": "PzWKhm", "question__hide": false, - "total_acs": 17633, - "total_submitted": 36103, - "total_column_articles": 146, + "total_acs": 17918, + "total_submitted": 36676, + "total_column_articles": 148, "frontend_question_id": "剑指 Offer II 090", "is_new_question": false }, @@ -2511,9 +2637,9 @@ "question__title": "排序的循环链表", "question__title_slug": "4ueAj6", "question__hide": false, - "total_acs": 44905, - "total_submitted": 134555, - "total_column_articles": 620, + "total_acs": 45204, + "total_submitted": 135489, + "total_column_articles": 621, "frontend_question_id": "剑指 Offer II 029", "is_new_question": false }, @@ -2532,8 +2658,8 @@ "question__title": "展平多级双向链表", "question__title_slug": "Qv1Da2", "question__hide": false, - "total_acs": 24826, - "total_submitted": 41075, + "total_acs": 25114, + "total_submitted": 41561, "total_column_articles": 337, "frontend_question_id": "剑指 Offer II 028", "is_new_question": false @@ -2553,9 +2679,9 @@ "question__title": "回文链表", "question__title_slug": "aMhZSa", "question__hide": false, - "total_acs": 59820, - "total_submitted": 97917, - "total_column_articles": 476, + "total_acs": 60505, + "total_submitted": 99102, + "total_column_articles": 477, "frontend_question_id": "剑指 Offer II 027", "is_new_question": false }, @@ -2574,9 +2700,9 @@ "question__title": "重排链表", "question__title_slug": "LGjMqU", "question__hide": false, - "total_acs": 40345, - "total_submitted": 60588, - "total_column_articles": 378, + "total_acs": 40847, + "total_submitted": 61339, + "total_column_articles": 380, "frontend_question_id": "剑指 Offer II 026", "is_new_question": false }, @@ -2595,9 +2721,9 @@ "question__title": "链表中的两数相加", "question__title_slug": "lMSNwu", "question__hide": false, - "total_acs": 37631, - "total_submitted": 64271, - "total_column_articles": 401, + "total_acs": 38092, + "total_submitted": 65204, + "total_column_articles": 403, "frontend_question_id": "剑指 Offer II 025", "is_new_question": false }, @@ -2616,9 +2742,9 @@ "question__title": "反转链表", "question__title_slug": "UHnkqh", "question__hide": false, - "total_acs": 93348, - "total_submitted": 123597, - "total_column_articles": 560, + "total_acs": 94639, + "total_submitted": 125335, + "total_column_articles": 561, "frontend_question_id": "剑指 Offer II 024", "is_new_question": false }, @@ -2637,9 +2763,9 @@ "question__title": "两个链表的第一个重合节点", "question__title_slug": "3u1WK4", "question__hide": false, - "total_acs": 42885, - "total_submitted": 61253, - "total_column_articles": 289, + "total_acs": 43395, + "total_submitted": 61990, + "total_column_articles": 290, "frontend_question_id": "剑指 Offer II 023", "is_new_question": false }, @@ -2658,9 +2784,9 @@ "question__title": "链表中环的入口节点", "question__title_slug": "c32eOV", "question__hide": false, - "total_acs": 54373, - "total_submitted": 97371, - "total_column_articles": 359, + "total_acs": 55080, + "total_submitted": 98626, + "total_column_articles": 362, "frontend_question_id": "剑指 Offer II 022", "is_new_question": false }, @@ -2679,9 +2805,9 @@ "question__title": "删除链表的倒数第 n 个结点", "question__title_slug": "SLwz0R", "question__hide": false, - "total_acs": 50013, - "total_submitted": 92550, - "total_column_articles": 464, + "total_acs": 50662, + "total_submitted": 93675, + "total_column_articles": 466, "frontend_question_id": "剑指 Offer II 021", "is_new_question": false }, @@ -2700,9 +2826,9 @@ "question__title": "回文子字符串的个数", "question__title_slug": "a7VOhD", "question__hide": false, - "total_acs": 36705, - "total_submitted": 51136, - "total_column_articles": 300, + "total_acs": 37115, + "total_submitted": 51706, + "total_column_articles": 302, "frontend_question_id": "剑指 Offer II 020", "is_new_question": false }, @@ -2721,9 +2847,9 @@ "question__title": "最多删除一个字符得到回文", "question__title_slug": "RQku0D", "question__hide": false, - "total_acs": 36505, - "total_submitted": 79754, - "total_column_articles": 325, + "total_acs": 36933, + "total_submitted": 80630, + "total_column_articles": 331, "frontend_question_id": "剑指 Offer II 019", "is_new_question": false }, @@ -2742,9 +2868,9 @@ "question__title": "有效的回文", "question__title_slug": "XltzEq", "question__hide": false, - "total_acs": 41714, - "total_submitted": 80970, - "total_column_articles": 344, + "total_acs": 42206, + "total_submitted": 81861, + "total_column_articles": 347, "frontend_question_id": "剑指 Offer II 018", "is_new_question": false }, @@ -2763,9 +2889,9 @@ "question__title": "含有所有字符的最短字符串", "question__title_slug": "M1oyTv", "question__hide": false, - "total_acs": 30159, - "total_submitted": 59415, - "total_column_articles": 302, + "total_acs": 30535, + "total_submitted": 60141, + "total_column_articles": 305, "frontend_question_id": "剑指 Offer II 017", "is_new_question": false }, @@ -2784,9 +2910,9 @@ "question__title": "不含重复字符的最长子字符串", "question__title_slug": "wtcaE1", "question__hide": false, - "total_acs": 45265, - "total_submitted": 95199, - "total_column_articles": 437, + "total_acs": 45826, + "total_submitted": 96352, + "total_column_articles": 441, "frontend_question_id": "剑指 Offer II 016", "is_new_question": false }, @@ -2805,8 +2931,8 @@ "question__title": "字符串中的所有变位词", "question__title_slug": "VabMRr", "question__hide": false, - "total_acs": 33539, - "total_submitted": 54267, + "total_acs": 33973, + "total_submitted": 54969, "total_column_articles": 293, "frontend_question_id": "剑指 Offer II 015", "is_new_question": false @@ -2826,9 +2952,9 @@ "question__title": "字符串中的变位词", "question__title_slug": "MPnaiL", "question__hide": false, - "total_acs": 41928, - "total_submitted": 81447, - "total_column_articles": 329, + "total_acs": 42466, + "total_submitted": 82436, + "total_column_articles": 334, "frontend_question_id": "剑指 Offer II 014", "is_new_question": false }, @@ -2847,9 +2973,9 @@ "question__title": "二维子矩阵的和", "question__title_slug": "O4NDxx", "question__hide": false, - "total_acs": 33772, - "total_submitted": 49097, - "total_column_articles": 290, + "total_acs": 34222, + "total_submitted": 49720, + "total_column_articles": 293, "frontend_question_id": "剑指 Offer II 013", "is_new_question": false }, @@ -2868,9 +2994,9 @@ "question__title": "左右两边子数组的和相等", "question__title_slug": "tvdfij", "question__hide": false, - "total_acs": 44028, - "total_submitted": 65765, - "total_column_articles": 394, + "total_acs": 44519, + "total_submitted": 66468, + "total_column_articles": 396, "frontend_question_id": "剑指 Offer II 012", "is_new_question": false }, @@ -2889,9 +3015,9 @@ "question__title": "0 和 1 个数相同的子数组", "question__title_slug": "A1NYOS", "question__hide": false, - "total_acs": 38934, - "total_submitted": 70781, - "total_column_articles": 332, + "total_acs": 39357, + "total_submitted": 71601, + "total_column_articles": 336, "frontend_question_id": "剑指 Offer II 011", "is_new_question": false }, @@ -2910,9 +3036,9 @@ "question__title": "和为 k 的子数组", "question__title_slug": "QTMn0o", "question__hide": false, - "total_acs": 50771, - "total_submitted": 118016, - "total_column_articles": 358, + "total_acs": 51442, + "total_submitted": 119610, + "total_column_articles": 365, "frontend_question_id": "剑指 Offer II 010", "is_new_question": false }, @@ -2931,8 +3057,8 @@ "question__title": "房屋偷盗", "question__title_slug": "Gu0c2T", "question__hide": false, - "total_acs": 25110, - "total_submitted": 41400, + "total_acs": 25468, + "total_submitted": 42031, "total_column_articles": 198, "frontend_question_id": "剑指 Offer II 089", "is_new_question": false @@ -2952,9 +3078,9 @@ "question__title": "乘积小于 K 的子数组", "question__title_slug": "ZVAVXX", "question__hide": false, - "total_acs": 46277, - "total_submitted": 86914, - "total_column_articles": 377, + "total_acs": 46814, + "total_submitted": 87886, + "total_column_articles": 380, "frontend_question_id": "剑指 Offer II 009", "is_new_question": false }, @@ -2973,9 +3099,9 @@ "question__title": "爬楼梯的最少成本", "question__title_slug": "GzCJIP", "question__hide": false, - "total_acs": 35834, - "total_submitted": 49388, - "total_column_articles": 289, + "total_acs": 36321, + "total_submitted": 50080, + "total_column_articles": 291, "frontend_question_id": "剑指 Offer II 088", "is_new_question": false }, @@ -2994,9 +3120,9 @@ "question__title": "和大于等于 target 的最短子数组", "question__title_slug": "2VG8Kg", "question__hide": false, - "total_acs": 55297, - "total_submitted": 111164, - "total_column_articles": 451, + "total_acs": 55934, + "total_submitted": 112421, + "total_column_articles": 456, "frontend_question_id": "剑指 Offer II 008", "is_new_question": false }, @@ -3015,8 +3141,8 @@ "question__title": "复原 IP ", "question__title_slug": "0on3uN", "question__hide": false, - "total_acs": 20696, - "total_submitted": 32782, + "total_acs": 21013, + "total_submitted": 33272, "total_column_articles": 212, "frontend_question_id": "剑指 Offer II 087", "is_new_question": false @@ -3036,8 +3162,8 @@ "question__title": "分割回文子字符串", "question__title_slug": "M99OJA", "question__hide": false, - "total_acs": 19696, - "total_submitted": 26031, + "total_acs": 19976, + "total_submitted": 26380, "total_column_articles": 159, "frontend_question_id": "剑指 Offer II 086", "is_new_question": false @@ -3057,9 +3183,9 @@ "question__title": "数组中和为 0 的三个数", "question__title_slug": "1fGaJU", "question__hide": false, - "total_acs": 52891, - "total_submitted": 120954, - "total_column_articles": 342, + "total_acs": 53475, + "total_submitted": 122409, + "total_column_articles": 347, "frontend_question_id": "剑指 Offer II 007", "is_new_question": false }, @@ -3078,8 +3204,8 @@ "question__title": "生成匹配的括号", "question__title_slug": "IDBivT", "question__hide": false, - "total_acs": 27444, - "total_submitted": 32322, + "total_acs": 27805, + "total_submitted": 32759, "total_column_articles": 279, "frontend_question_id": "剑指 Offer II 085", "is_new_question": false @@ -3099,9 +3225,9 @@ "question__title": "排序数组中两个数字之和", "question__title_slug": "kLl5u1", "question__hide": false, - "total_acs": 61398, - "total_submitted": 90976, - "total_column_articles": 453, + "total_acs": 62088, + "total_submitted": 92007, + "total_column_articles": 458, "frontend_question_id": "剑指 Offer II 006", "is_new_question": false }, @@ -3120,9 +3246,9 @@ "question__title": "单词长度的最大乘积", "question__title_slug": "aseY1I", "question__hide": false, - "total_acs": 50305, - "total_submitted": 70580, - "total_column_articles": 400, + "total_acs": 50829, + "total_submitted": 71311, + "total_column_articles": 403, "frontend_question_id": "剑指 Offer II 005", "is_new_question": false }, @@ -3141,8 +3267,8 @@ "question__title": "含有重复元素集合的全排列 ", "question__title_slug": "7p8L0Z", "question__hide": false, - "total_acs": 22820, - "total_submitted": 33004, + "total_acs": 23175, + "total_submitted": 33513, "total_column_articles": 197, "frontend_question_id": "剑指 Offer II 084", "is_new_question": false @@ -3162,9 +3288,9 @@ "question__title": "没有重复元素集合的全排列", "question__title_slug": "VvJkup", "question__hide": false, - "total_acs": 26857, - "total_submitted": 31314, - "total_column_articles": 268, + "total_acs": 27288, + "total_submitted": 31818, + "total_column_articles": 271, "frontend_question_id": "剑指 Offer II 083", "is_new_question": false }, @@ -3183,9 +3309,9 @@ "question__title": "只出现一次的数字 ", "question__title_slug": "WGki4K", "question__hide": false, - "total_acs": 62002, - "total_submitted": 87470, - "total_column_articles": 470, + "total_acs": 62612, + "total_submitted": 88343, + "total_column_articles": 473, "frontend_question_id": "剑指 Offer II 004", "is_new_question": false }, @@ -3204,9 +3330,9 @@ "question__title": "含有重复元素集合的组合", "question__title_slug": "4sjJUc", "question__hide": false, - "total_acs": 23387, - "total_submitted": 35455, - "total_column_articles": 191, + "total_acs": 23737, + "total_submitted": 35977, + "total_column_articles": 192, "frontend_question_id": "剑指 Offer II 082", "is_new_question": false }, @@ -3225,9 +3351,9 @@ "question__title": "二进制加法", "question__title_slug": "JFETK5", "question__hide": false, - "total_acs": 55808, - "total_submitted": 103517, - "total_column_articles": 557, + "total_acs": 56381, + "total_submitted": 104597, + "total_column_articles": 562, "frontend_question_id": "剑指 Offer II 002", "is_new_question": false }, @@ -3246,9 +3372,9 @@ "question__title": "前 n 个数字二进制中 1 的个数", "question__title_slug": "w3tCBm", "question__hide": false, - "total_acs": 71518, - "total_submitted": 91401, - "total_column_articles": 604, + "total_acs": 72213, + "total_submitted": 92307, + "total_column_articles": 608, "frontend_question_id": "剑指 Offer II 003", "is_new_question": false }, @@ -3267,9 +3393,9 @@ "question__title": "允许重复选择元素的组合", "question__title_slug": "Ygoe9J", "question__hide": false, - "total_acs": 27207, - "total_submitted": 33764, - "total_column_articles": 230, + "total_acs": 27560, + "total_submitted": 34202, + "total_column_articles": 231, "frontend_question_id": "剑指 Offer II 081", "is_new_question": false }, @@ -3288,9 +3414,9 @@ "question__title": "整数除法", "question__title_slug": "xoh6Oh", "question__hide": false, - "total_acs": 59962, - "total_submitted": 285058, - "total_column_articles": 490, + "total_acs": 60579, + "total_submitted": 287625, + "total_column_articles": 494, "frontend_question_id": "剑指 Offer II 001", "is_new_question": false }, @@ -3309,8 +3435,8 @@ "question__title": "主题空间", "question__title_slug": "YesdPw", "question__hide": false, - "total_acs": 3580, - "total_submitted": 8658, + "total_acs": 3606, + "total_submitted": 8738, "total_column_articles": 95, "frontend_question_id": "LCS 03", "is_new_question": false @@ -3330,8 +3456,8 @@ "question__title": "完成一半题目", "question__title_slug": "WqXACV", "question__hide": false, - "total_acs": 9019, - "total_submitted": 13962, + "total_acs": 9077, + "total_submitted": 14044, "total_column_articles": 178, "frontend_question_id": "LCS 02", "is_new_question": false @@ -3351,9 +3477,9 @@ "question__title": "下载插件", "question__title_slug": "Ju9Xwi", "question__hide": false, - "total_acs": 13101, - "total_submitted": 24316, - "total_column_articles": 261, + "total_acs": 13226, + "total_submitted": 24538, + "total_column_articles": 260, "frontend_question_id": "LCS 01", "is_new_question": false }, @@ -3372,8 +3498,8 @@ "question__title": "魔塔游戏", "question__title_slug": "p0NxJO", "question__hide": false, - "total_acs": 9468, - "total_submitted": 25183, + "total_acs": 9516, + "total_submitted": 25312, "total_column_articles": 141, "frontend_question_id": "LCP 30", "is_new_question": false @@ -3393,8 +3519,8 @@ "question__title": "守卫城堡", "question__title_slug": "7rLGCR", "question__hide": false, - "total_acs": 1039, - "total_submitted": 1868, + "total_acs": 1061, + "total_submitted": 1893, "total_column_articles": 20, "frontend_question_id": "LCP 38", "is_new_question": false @@ -3414,8 +3540,8 @@ "question__title": "最多牌组数", "question__title_slug": "Up5XYM", "question__hide": false, - "total_acs": 1578, - "total_submitted": 4664, + "total_acs": 1593, + "total_submitted": 4710, "total_column_articles": 26, "frontend_question_id": "LCP 36", "is_new_question": false @@ -3435,8 +3561,8 @@ "question__title": "蓄水", "question__title_slug": "o8SXZn", "question__hide": false, - "total_acs": 9038, - "total_submitted": 34200, + "total_acs": 9081, + "total_submitted": 34320, "total_column_articles": 141, "frontend_question_id": "LCP 33", "is_new_question": false @@ -3456,8 +3582,8 @@ "question__title": "电动车游城市", "question__title_slug": "DFPeFJ", "question__hide": false, - "total_acs": 2354, - "total_submitted": 4917, + "total_acs": 2387, + "total_submitted": 4977, "total_column_articles": 39, "frontend_question_id": "LCP 35", "is_new_question": false @@ -3477,8 +3603,8 @@ "question__title": "批量处理任务", "question__title_slug": "t3fKg1", "question__hide": false, - "total_acs": 2242, - "total_submitted": 5226, + "total_acs": 2253, + "total_submitted": 5277, "total_column_articles": 33, "frontend_question_id": "LCP 32", "is_new_question": false @@ -3498,8 +3624,8 @@ "question__title": "变换的迷宫", "question__title_slug": "Db3wC1", "question__hide": false, - "total_acs": 2763, - "total_submitted": 9454, + "total_acs": 2788, + "total_submitted": 9528, "total_column_articles": 42, "frontend_question_id": "LCP 31", "is_new_question": false @@ -3519,8 +3645,8 @@ "question__title": "乐团站位", "question__title_slug": "SNJvJP", "question__hide": false, - "total_acs": 8122, - "total_submitted": 38451, + "total_acs": 8131, + "total_submitted": 38487, "total_column_articles": 169, "frontend_question_id": "LCP 29", "is_new_question": false @@ -3540,9 +3666,9 @@ "question__title": "采购方案", "question__title_slug": "4xy4Wx", "question__hide": false, - "total_acs": 18500, - "total_submitted": 58234, - "total_column_articles": 290, + "total_acs": 18571, + "total_submitted": 58447, + "total_column_articles": 291, "frontend_question_id": "LCP 28", "is_new_question": false }, @@ -3561,8 +3687,8 @@ "question__title": "黑盒光线反射", "question__title_slug": "IQvJ9i", "question__hide": false, - "total_acs": 1646, - "total_submitted": 4832, + "total_acs": 1650, + "total_submitted": 4842, "total_column_articles": 31, "frontend_question_id": "LCP 27", "is_new_question": false @@ -3582,9 +3708,9 @@ "question__title": "早餐组合", "question__title_slug": "2vYnGI", "question__hide": false, - "total_acs": 24814, - "total_submitted": 82200, - "total_column_articles": 353, + "total_acs": 24893, + "total_submitted": 82441, + "total_column_articles": 354, "frontend_question_id": "LCP 18", "is_new_question": false }, @@ -3603,8 +3729,8 @@ "question__title": "黑白方格画", "question__title_slug": "ccw6C7", "question__hide": false, - "total_acs": 11304, - "total_submitted": 32362, + "total_acs": 11336, + "total_submitted": 32455, "total_column_articles": 220, "frontend_question_id": "LCP 22", "is_new_question": false @@ -3624,9 +3750,9 @@ "question__title": "速算机器人", "question__title_slug": "nGK0Fy", "question__hide": false, - "total_acs": 32544, - "total_submitted": 40589, - "total_column_articles": 352, + "total_acs": 32642, + "total_submitted": 40702, + "total_column_articles": 353, "frontend_question_id": "LCP 17", "is_new_question": false }, @@ -3645,8 +3771,8 @@ "question__title": "古董键盘", "question__title_slug": "Uh984O", "question__hide": false, - "total_acs": 1941, - "total_submitted": 5208, + "total_acs": 1952, + "total_submitted": 5221, "total_column_articles": 35, "frontend_question_id": "LCP 25", "is_new_question": false @@ -3666,8 +3792,8 @@ "question__title": "追逐游戏", "question__title_slug": "Za25hA", "question__hide": false, - "total_acs": 1501, - "total_submitted": 3905, + "total_acs": 1512, + "total_submitted": 3930, "total_column_articles": 35, "frontend_question_id": "LCP 21", "is_new_question": false @@ -3687,8 +3813,8 @@ "question__title": "快速公交", "question__title_slug": "meChtZ", "question__hide": false, - "total_acs": 2512, - "total_submitted": 7090, + "total_acs": 2521, + "total_submitted": 7111, "total_column_articles": 39, "frontend_question_id": "LCP 20", "is_new_question": false @@ -3708,8 +3834,8 @@ "question__title": "导航装置", "question__title_slug": "hSRGyL", "question__hide": false, - "total_acs": 947, - "total_submitted": 2509, + "total_acs": 954, + "total_submitted": 2520, "total_column_articles": 24, "frontend_question_id": "LCP 26", "is_new_question": false @@ -3729,8 +3855,8 @@ "question__title": "数字游戏", "question__title_slug": "5TxKeK", "question__hide": false, - "total_acs": 1461, - "total_submitted": 4539, + "total_acs": 1465, + "total_submitted": 4550, "total_column_articles": 30, "frontend_question_id": "LCP 24", "is_new_question": false @@ -3750,8 +3876,8 @@ "question__title": "秋叶收藏集", "question__title_slug": "UlBDOe", "question__hide": false, - "total_acs": 21937, - "total_submitted": 42314, + "total_acs": 21955, + "total_submitted": 42362, "total_column_articles": 234, "frontend_question_id": "LCP 19", "is_new_question": false @@ -3771,8 +3897,8 @@ "question__title": "寻宝", "question__title_slug": "xun-bao", "question__hide": false, - "total_acs": 10251, - "total_submitted": 17145, + "total_acs": 10281, + "total_submitted": 17217, "total_column_articles": 101, "frontend_question_id": "LCP 13", "is_new_question": false @@ -3792,8 +3918,8 @@ "question__title": "最小矩形面积", "question__title_slug": "zui-xiao-ju-xing-mian-ji", "question__hide": false, - "total_acs": 1604, - "total_submitted": 6340, + "total_acs": 1614, + "total_submitted": 6390, "total_column_articles": 27, "frontend_question_id": "LCP 37", "is_new_question": false @@ -3813,8 +3939,8 @@ "question__title": "最小跳跃次数", "question__title_slug": "zui-xiao-tiao-yue-ci-shu", "question__hide": false, - "total_acs": 10717, - "total_submitted": 33746, + "total_acs": 10768, + "total_submitted": 33861, "total_column_articles": 134, "frontend_question_id": "LCP 09", "is_new_question": false @@ -3834,8 +3960,8 @@ "question__title": "二叉树染色", "question__title_slug": "er-cha-shu-ran-se-UGC", "question__hide": false, - "total_acs": 5118, - "total_submitted": 9166, + "total_acs": 5163, + "total_submitted": 9242, "total_column_articles": 100, "frontend_question_id": "LCP 34", "is_new_question": false @@ -3855,8 +3981,8 @@ "question__title": "游乐园的迷宫", "question__title_slug": "you-le-yuan-de-mi-gong", "question__hide": false, - "total_acs": 1349, - "total_submitted": 2205, + "total_acs": 1361, + "total_submitted": 2234, "total_column_articles": 30, "frontend_question_id": "LCP 15", "is_new_question": false @@ -3876,8 +4002,8 @@ "question__title": "小张刷题计划", "question__title_slug": "xiao-zhang-shua-ti-ji-hua", "question__hide": false, - "total_acs": 10752, - "total_submitted": 24550, + "total_acs": 10790, + "total_submitted": 24628, "total_column_articles": 154, "frontend_question_id": "LCP 12", "is_new_question": false @@ -3897,8 +4023,8 @@ "question__title": "期望个数统计", "question__title_slug": "qi-wang-ge-shu-tong-ji", "question__hide": false, - "total_acs": 10039, - "total_submitted": 13866, + "total_acs": 10067, + "total_submitted": 13904, "total_column_articles": 99, "frontend_question_id": "LCP 11", "is_new_question": false @@ -3918,8 +4044,8 @@ "question__title": "游乐园的游览计划", "question__title_slug": "you-le-yuan-de-you-lan-ji-hua", "question__hide": false, - "total_acs": 1045, - "total_submitted": 3003, + "total_acs": 1053, + "total_submitted": 3014, "total_column_articles": 22, "frontend_question_id": "LCP 16", "is_new_question": false @@ -3939,9 +4065,9 @@ "question__title": "传递信息", "question__title_slug": "chuan-di-xin-xi", "question__hide": false, - "total_acs": 52951, - "total_submitted": 69990, - "total_column_articles": 617, + "total_acs": 53140, + "total_submitted": 70234, + "total_column_articles": 619, "frontend_question_id": "LCP 07", "is_new_question": false }, @@ -3960,8 +4086,8 @@ "question__title": "二叉树任务调度", "question__title_slug": "er-cha-shu-ren-wu-diao-du", "question__hide": false, - "total_acs": 2945, - "total_submitted": 4797, + "total_acs": 2969, + "total_submitted": 4824, "total_column_articles": 52, "frontend_question_id": "LCP 10", "is_new_question": false @@ -3981,8 +4107,8 @@ "question__title": "切分数组", "question__title_slug": "qie-fen-shu-zu", "question__hide": false, - "total_acs": 3920, - "total_submitted": 16388, + "total_acs": 3943, + "total_submitted": 16444, "total_column_articles": 59, "frontend_question_id": "LCP 14", "is_new_question": false @@ -4002,8 +4128,8 @@ "question__title": "魔术排列", "question__title_slug": "er94lq", "question__hide": false, - "total_acs": 3720, - "total_submitted": 10085, + "total_acs": 3729, + "total_submitted": 10099, "total_column_articles": 67, "frontend_question_id": "LCP 23", "is_new_question": false @@ -4023,8 +4149,8 @@ "question__title": "剧情触发时间", "question__title_slug": "ju-qing-hong-fa-shi-jian", "question__hide": false, - "total_acs": 7313, - "total_submitted": 22365, + "total_acs": 7335, + "total_submitted": 22397, "total_column_articles": 130, "frontend_question_id": "LCP 08", "is_new_question": false @@ -4044,9 +4170,9 @@ "question__title": "拿硬币", "question__title_slug": "na-ying-bi", "question__hide": false, - "total_acs": 57568, - "total_submitted": 68514, - "total_column_articles": 861, + "total_acs": 57773, + "total_submitted": 68802, + "total_column_articles": 862, "frontend_question_id": "LCP 06", "is_new_question": false }, @@ -4065,9 +4191,9 @@ "question__title": "Sparse Similarity LCCI", "question__title_slug": "sparse-similarity-lcci", "question__hide": false, - "total_acs": 5782, - "total_submitted": 16333, - "total_column_articles": 88, + "total_acs": 5800, + "total_submitted": 16417, + "total_column_articles": 89, "frontend_question_id": "面试题 17.26", "is_new_question": false }, @@ -4086,8 +4212,8 @@ "question__title": "Langtons Ant LCCI", "question__title_slug": "langtons-ant-lcci", "question__hide": false, - "total_acs": 4578, - "total_submitted": 7894, + "total_acs": 4607, + "total_submitted": 7940, "total_column_articles": 83, "frontend_question_id": "面试题 16.22", "is_new_question": false @@ -4107,8 +4233,8 @@ "question__title": "Word Rectangle LCCI", "question__title_slug": "word-rectangle-lcci", "question__hide": false, - "total_acs": 3006, - "total_submitted": 5880, + "total_acs": 3021, + "total_submitted": 5906, "total_column_articles": 58, "frontend_question_id": "面试题 17.25", "is_new_question": false @@ -4128,9 +4254,9 @@ "question__title": "Sum Swap LCCI", "question__title_slug": "sum-swap-lcci", "question__hide": false, - "total_acs": 15387, - "total_submitted": 32301, - "total_column_articles": 266, + "total_acs": 15471, + "total_submitted": 32449, + "total_column_articles": 267, "frontend_question_id": "面试题 16.21", "is_new_question": false }, @@ -4149,8 +4275,8 @@ "question__title": "T9 LCCI", "question__title_slug": "t9-lcci", "question__hide": false, - "total_acs": 14450, - "total_submitted": 20282, + "total_acs": 14524, + "total_submitted": 20397, "total_column_articles": 254, "frontend_question_id": "面试题 16.20", "is_new_question": false @@ -4170,9 +4296,9 @@ "question__title": "Max Submatrix LCCI", "question__title_slug": "max-submatrix-lcci", "question__hide": false, - "total_acs": 22443, - "total_submitted": 41826, - "total_column_articles": 196, + "total_acs": 22596, + "total_submitted": 42082, + "total_column_articles": 197, "frontend_question_id": "面试题 17.24", "is_new_question": false }, @@ -4191,9 +4317,9 @@ "question__title": "Max Black Square LCCI", "question__title_slug": "max-black-square-lcci", "question__hide": false, - "total_acs": 7738, - "total_submitted": 20676, - "total_column_articles": 153, + "total_acs": 7872, + "total_submitted": 20932, + "total_column_articles": 154, "frontend_question_id": "面试题 17.23", "is_new_question": false }, @@ -4212,9 +4338,9 @@ "question__title": "Missing Two LCCI", "question__title_slug": "missing-two-lcci", "question__hide": false, - "total_acs": 39837, - "total_submitted": 65740, - "total_column_articles": 571, + "total_acs": 39901, + "total_submitted": 65841, + "total_column_articles": 573, "frontend_question_id": "面试题 17.19", "is_new_question": false }, @@ -4233,8 +4359,8 @@ "question__title": "Shortest Supersequence LCCI", "question__title_slug": "shortest-supersequence-lcci", "question__hide": false, - "total_acs": 13693, - "total_submitted": 30830, + "total_acs": 13766, + "total_submitted": 31017, "total_column_articles": 174, "frontend_question_id": "面试题 17.18", "is_new_question": false @@ -4254,8 +4380,8 @@ "question__title": "Pairs With Sum LCCI", "question__title_slug": "pairs-with-sum-lcci", "question__hide": false, - "total_acs": 17221, - "total_submitted": 35724, + "total_acs": 17302, + "total_submitted": 35897, "total_column_articles": 246, "frontend_question_id": "面试题 16.24", "is_new_question": false @@ -4275,8 +4401,8 @@ "question__title": "Rank from Stream LCCI", "question__title_slug": "rank-from-stream-lcci", "question__hide": false, - "total_acs": 9316, - "total_submitted": 15020, + "total_acs": 9388, + "total_submitted": 15138, "total_column_articles": 148, "frontend_question_id": "面试题 10.10", "is_new_question": false @@ -4296,8 +4422,8 @@ "question__title": "Group Anagrams LCCI", "question__title_slug": "group-anagrams-lcci", "question__hide": false, - "total_acs": 41372, - "total_submitted": 55716, + "total_acs": 41448, + "total_submitted": 55807, "total_column_articles": 479, "frontend_question_id": "面试题 10.02", "is_new_question": false @@ -4317,8 +4443,8 @@ "question__title": "Find Closest LCCI", "question__title_slug": "find-closest-lcci", "question__hide": false, - "total_acs": 50213, - "total_submitted": 68709, + "total_acs": 50271, + "total_submitted": 68801, "total_column_articles": 665, "frontend_question_id": "面试题 17.11", "is_new_question": false @@ -4338,9 +4464,9 @@ "question__title": "Find Majority Element LCCI", "question__title_slug": "find-majority-element-lcci", "question__hide": false, - "total_acs": 76998, - "total_submitted": 136725, - "total_column_articles": 1051, + "total_acs": 77137, + "total_submitted": 136993, + "total_column_articles": 1052, "frontend_question_id": "面试题 17.10", "is_new_question": false }, @@ -4359,9 +4485,9 @@ "question__title": "Get Kth Magic Number LCCI", "question__title_slug": "get-kth-magic-number-lcci", "question__hide": false, - "total_acs": 46976, - "total_submitted": 83577, - "total_column_articles": 426, + "total_acs": 47051, + "total_submitted": 83760, + "total_column_articles": 427, "frontend_question_id": "面试题 17.09", "is_new_question": false }, @@ -4380,8 +4506,8 @@ "question__title": "Circus Tower LCCI", "question__title_slug": "circus-tower-lcci", "question__hide": false, - "total_acs": 12540, - "total_submitted": 43973, + "total_acs": 12578, + "total_submitted": 44118, "total_column_articles": 166, "frontend_question_id": "面试题 17.08", "is_new_question": false @@ -4401,8 +4527,8 @@ "question__title": "Baby Names LCCI", "question__title_slug": "baby-names-lcci", "question__hide": false, - "total_acs": 12564, - "total_submitted": 30249, + "total_acs": 12602, + "total_submitted": 30324, "total_column_articles": 280, "frontend_question_id": "面试题 17.07", "is_new_question": false @@ -4422,8 +4548,8 @@ "question__title": "Number Of 2s In Range LCCI", "question__title_slug": "number-of-2s-in-range-lcci", "question__hide": false, - "total_acs": 9398, - "total_submitted": 19123, + "total_acs": 9465, + "total_submitted": 19248, "total_column_articles": 178, "frontend_question_id": "面试题 17.06", "is_new_question": false @@ -4443,8 +4569,8 @@ "question__title": "Find Longest Subarray LCCI", "question__title_slug": "find-longest-subarray-lcci", "question__hide": false, - "total_acs": 30094, - "total_submitted": 63316, + "total_acs": 30174, + "total_submitted": 63530, "total_column_articles": 280, "frontend_question_id": "面试题 17.05", "is_new_question": false @@ -4464,9 +4590,9 @@ "question__title": "Missing Number LCCI", "question__title_slug": "missing-number-lcci", "question__hide": false, - "total_acs": 50890, - "total_submitted": 85279, - "total_column_articles": 715, + "total_acs": 51241, + "total_submitted": 85966, + "total_column_articles": 719, "frontend_question_id": "面试题 17.04", "is_new_question": false }, @@ -4485,8 +4611,8 @@ "question__title": "Boolean Evaluation LCCI", "question__title_slug": "boolean-evaluation-lcci", "question__hide": false, - "total_acs": 7783, - "total_submitted": 14774, + "total_acs": 7813, + "total_submitted": 14827, "total_column_articles": 112, "frontend_question_id": "面试题 08.14", "is_new_question": false @@ -4506,8 +4632,8 @@ "question__title": "Word Transformer LCCI", "question__title_slug": "word-transformer-lcci", "question__hide": false, - "total_acs": 14148, - "total_submitted": 35256, + "total_acs": 14234, + "total_submitted": 35425, "total_column_articles": 205, "frontend_question_id": "面试题 17.22", "is_new_question": false @@ -4527,9 +4653,9 @@ "question__title": "Volume of Histogram LCCI", "question__title_slug": "volume-of-histogram-lcci", "question__hide": false, - "total_acs": 50473, - "total_submitted": 79212, - "total_column_articles": 591, + "total_acs": 50541, + "total_submitted": 79314, + "total_column_articles": 592, "frontend_question_id": "面试题 17.21", "is_new_question": false }, @@ -4548,8 +4674,8 @@ "question__title": "Continuous Median LCCI", "question__title_slug": "continuous-median-lcci", "question__hide": false, - "total_acs": 6751, - "total_submitted": 11594, + "total_acs": 6786, + "total_submitted": 11642, "total_column_articles": 109, "frontend_question_id": "面试题 17.20", "is_new_question": false @@ -4569,9 +4695,9 @@ "question__title": "Calculator LCCI", "question__title_slug": "calculator-lcci", "question__hide": false, - "total_acs": 23911, - "total_submitted": 60067, - "total_column_articles": 291, + "total_acs": 24010, + "total_submitted": 60329, + "total_column_articles": 292, "frontend_question_id": "面试题 16.26", "is_new_question": false }, @@ -4590,8 +4716,8 @@ "question__title": "LRU Cache LCCI", "question__title_slug": "lru-cache-lcci", "question__hide": false, - "total_acs": 46382, - "total_submitted": 83701, + "total_acs": 46595, + "total_submitted": 84092, "total_column_articles": 348, "frontend_question_id": "面试题 16.25", "is_new_question": false @@ -4611,8 +4737,8 @@ "question__title": "Add Without Plus LCCI", "question__title_slug": "add-without-plus-lcci", "question__hide": false, - "total_acs": 20909, - "total_submitted": 34073, + "total_acs": 21090, + "total_submitted": 34356, "total_column_articles": 233, "frontend_question_id": "面试题 17.01", "is_new_question": false @@ -4632,9 +4758,9 @@ "question__title": "Multi Search LCCI", "question__title_slug": "multi-search-lcci", "question__hide": false, - "total_acs": 13007, - "total_submitted": 29011, - "total_column_articles": 251, + "total_acs": 13069, + "total_submitted": 29149, + "total_column_articles": 252, "frontend_question_id": "面试题 17.17", "is_new_question": false }, @@ -4653,9 +4779,9 @@ "question__title": "The Masseuse LCCI", "question__title_slug": "the-masseuse-lcci", "question__hide": false, - "total_acs": 76754, - "total_submitted": 150286, - "total_column_articles": 1303, + "total_acs": 76976, + "total_submitted": 150721, + "total_column_articles": 1305, "frontend_question_id": "面试题 17.16", "is_new_question": false }, @@ -4674,8 +4800,8 @@ "question__title": "Longest Word LCCI", "question__title_slug": "longest-word-lcci", "question__hide": false, - "total_acs": 11360, - "total_submitted": 27805, + "total_acs": 11402, + "total_submitted": 27890, "total_column_articles": 188, "frontend_question_id": "面试题 17.15", "is_new_question": false @@ -4695,9 +4821,9 @@ "question__title": "Smallest K LCCI", "question__title_slug": "smallest-k-lcci", "question__hide": false, - "total_acs": 101718, - "total_submitted": 172495, - "total_column_articles": 914, + "total_acs": 102037, + "total_submitted": 173088, + "total_column_articles": 919, "frontend_question_id": "面试题 17.14", "is_new_question": false }, @@ -4716,8 +4842,8 @@ "question__title": "Re-Space LCCI", "question__title_slug": "re-space-lcci", "question__hide": false, - "total_acs": 28613, - "total_submitted": 51645, + "total_acs": 28679, + "total_submitted": 51741, "total_column_articles": 302, "frontend_question_id": "面试题 17.13", "is_new_question": false @@ -4737,8 +4863,8 @@ "question__title": "BiNode LCCI", "question__title_slug": "binode-lcci", "question__hide": false, - "total_acs": 30635, - "total_submitted": 47991, + "total_acs": 30741, + "total_submitted": 48148, "total_column_articles": 392, "frontend_question_id": "面试题 17.12", "is_new_question": false @@ -4758,8 +4884,8 @@ "question__title": "English Int LCCI", "question__title_slug": "english-int-lcci", "question__hide": false, - "total_acs": 3878, - "total_submitted": 9942, + "total_acs": 3891, + "total_submitted": 9973, "total_column_articles": 79, "frontend_question_id": "面试题 16.08", "is_new_question": false @@ -4779,8 +4905,8 @@ "question__title": "Factorial Zeros LCCI", "question__title_slug": "factorial-zeros-lcci", "question__hide": false, - "total_acs": 17400, - "total_submitted": 39673, + "total_acs": 17489, + "total_submitted": 39883, "total_column_articles": 176, "frontend_question_id": "面试题 16.05", "is_new_question": false @@ -4800,8 +4926,8 @@ "question__title": "Sorted Matrix Search LCCI", "question__title_slug": "sorted-matrix-search-lcci", "question__hide": false, - "total_acs": 20402, - "total_submitted": 45701, + "total_acs": 20500, + "total_submitted": 45939, "total_column_articles": 225, "frontend_question_id": "面试题 10.09", "is_new_question": false @@ -4821,8 +4947,8 @@ "question__title": "Hanota LCCI", "question__title_slug": "hanota-lcci", "question__hide": false, - "total_acs": 42195, - "total_submitted": 64999, + "total_acs": 42409, + "total_submitted": 65360, "total_column_articles": 416, "frontend_question_id": "面试题 08.06", "is_new_question": false @@ -4842,9 +4968,9 @@ "question__title": "Peaks and Valleys LCCI", "question__title_slug": "peaks-and-valleys-lcci", "question__hide": false, - "total_acs": 13824, - "total_submitted": 20981, - "total_column_articles": 164, + "total_acs": 13924, + "total_submitted": 21149, + "total_column_articles": 165, "frontend_question_id": "面试题 10.11", "is_new_question": false }, @@ -4863,8 +4989,8 @@ "question__title": "Sorted Merge LCCI", "question__title_slug": "sorted-merge-lcci", "question__hide": false, - "total_acs": 76121, - "total_submitted": 135646, + "total_acs": 76407, + "total_submitted": 136124, "total_column_articles": 2534, "frontend_question_id": "面试题 10.01", "is_new_question": false @@ -4884,9 +5010,9 @@ "question__title": "Robot in a Grid LCCI", "question__title_slug": "robot-in-a-grid-lcci", "question__hide": false, - "total_acs": 21269, - "total_submitted": 58873, - "total_column_articles": 305, + "total_acs": 21371, + "total_submitted": 59172, + "total_column_articles": 306, "frontend_question_id": "面试题 08.02", "is_new_question": false }, @@ -4905,8 +5031,8 @@ "question__title": "BST Sequences LCCI", "question__title_slug": "bst-sequences-lcci", "question__hide": false, - "total_acs": 10910, - "total_submitted": 22328, + "total_acs": 10952, + "total_submitted": 22413, "total_column_articles": 161, "frontend_question_id": "面试题 04.09", "is_new_question": false @@ -4926,8 +5052,8 @@ "question__title": "Paths with Sum LCCI", "question__title_slug": "paths-with-sum-lcci", "question__hide": false, - "total_acs": 28909, - "total_submitted": 59035, + "total_acs": 29048, + "total_submitted": 59301, "total_column_articles": 349, "frontend_question_id": "面试题 04.12", "is_new_question": false @@ -4947,9 +5073,9 @@ "question__title": "Partition List LCCI", "question__title_slug": "partition-list-lcci", "question__hide": false, - "total_acs": 43065, - "total_submitted": 70080, - "total_column_articles": 559, + "total_acs": 43341, + "total_submitted": 70646, + "total_column_articles": 560, "frontend_question_id": "面试题 02.04", "is_new_question": false }, @@ -4968,9 +5094,9 @@ "question__title": "Kth Node From End of List LCCI", "question__title_slug": "kth-node-from-end-of-list-lcci", "question__hide": false, - "total_acs": 89682, - "total_submitted": 114830, - "total_column_articles": 1215, + "total_acs": 90046, + "total_submitted": 115276, + "total_column_articles": 1217, "frontend_question_id": "面试题 02.02", "is_new_question": false }, @@ -4989,9 +5115,9 @@ "question__title": "One Away LCCI", "question__title_slug": "one-away-lcci", "question__hide": false, - "total_acs": 87229, - "total_submitted": 247844, - "total_column_articles": 1332, + "total_acs": 87546, + "total_submitted": 248837, + "total_column_articles": 1335, "frontend_question_id": "面试题 01.05", "is_new_question": false }, @@ -5010,9 +5136,9 @@ "question__title": "Pond Sizes LCCI", "question__title_slug": "pond-sizes-lcci", "question__hide": false, - "total_acs": 27644, - "total_submitted": 44142, - "total_column_articles": 477, + "total_acs": 27740, + "total_submitted": 44281, + "total_column_articles": 478, "frontend_question_id": "面试题 16.19", "is_new_question": false }, @@ -5031,8 +5157,8 @@ "question__title": "Pattern Matching LCCI", "question__title_slug": "pattern-matching-lcci", "question__hide": false, - "total_acs": 17666, - "total_submitted": 52123, + "total_acs": 17706, + "total_submitted": 52257, "total_column_articles": 344, "frontend_question_id": "面试题 16.18", "is_new_question": false @@ -5052,8 +5178,8 @@ "question__title": "Contiguous Sequence LCCI", "question__title_slug": "contiguous-sequence-lcci", "question__hide": false, - "total_acs": 47940, - "total_submitted": 81321, + "total_acs": 48111, + "total_submitted": 81652, "total_column_articles": 515, "frontend_question_id": "面试题 16.17", "is_new_question": false @@ -5073,9 +5199,9 @@ "question__title": "Sub Sort LCCI", "question__title_slug": "sub-sort-lcci", "question__hide": false, - "total_acs": 25436, - "total_submitted": 54370, - "total_column_articles": 315, + "total_acs": 25533, + "total_submitted": 54619, + "total_column_articles": 316, "frontend_question_id": "面试题 16.16", "is_new_question": false }, @@ -5094,8 +5220,8 @@ "question__title": "Master Mind LCCI", "question__title_slug": "master-mind-lcci", "question__hide": false, - "total_acs": 15695, - "total_submitted": 33867, + "total_acs": 15764, + "total_submitted": 34022, "total_column_articles": 336, "frontend_question_id": "面试题 16.15", "is_new_question": false @@ -5115,8 +5241,8 @@ "question__title": "Best Line LCCI", "question__title_slug": "best-line-lcci", "question__hide": false, - "total_acs": 5947, - "total_submitted": 10692, + "total_acs": 5971, + "total_submitted": 10745, "total_column_articles": 88, "frontend_question_id": "面试题 16.14", "is_new_question": false @@ -5136,9 +5262,9 @@ "question__title": "Bisect Squares LCCI", "question__title_slug": "bisect-squares-lcci", "question__hide": false, - "total_acs": 3477, - "total_submitted": 7997, - "total_column_articles": 81, + "total_acs": 3519, + "total_submitted": 8071, + "total_column_articles": 82, "frontend_question_id": "面试题 16.13", "is_new_question": false }, @@ -5157,9 +5283,9 @@ "question__title": "Diving Board LCCI", "question__title_slug": "diving-board-lcci", "question__hide": false, - "total_acs": 59182, - "total_submitted": 134911, - "total_column_articles": 670, + "total_acs": 59265, + "total_submitted": 135135, + "total_column_articles": 671, "frontend_question_id": "面试题 16.11", "is_new_question": false }, @@ -5178,8 +5304,8 @@ "question__title": "Living People LCCI", "question__title_slug": "living-people-lcci", "question__hide": false, - "total_acs": 16294, - "total_submitted": 24288, + "total_acs": 16359, + "total_submitted": 24393, "total_column_articles": 266, "frontend_question_id": "面试题 16.10", "is_new_question": false @@ -5199,8 +5325,8 @@ "question__title": "Operations LCCI", "question__title_slug": "operations-lcci", "question__hide": false, - "total_acs": 3797, - "total_submitted": 6768, + "total_acs": 3813, + "total_submitted": 6793, "total_column_articles": 60, "frontend_question_id": "面试题 16.09", "is_new_question": false @@ -5220,9 +5346,9 @@ "question__title": "Maximum LCCI", "question__title_slug": "maximum-lcci", "question__hide": false, - "total_acs": 32277, - "total_submitted": 43658, - "total_column_articles": 420, + "total_acs": 32436, + "total_submitted": 43864, + "total_column_articles": 422, "frontend_question_id": "面试题 16.07", "is_new_question": false }, @@ -5241,9 +5367,9 @@ "question__title": "Permutation II LCCI", "question__title_slug": "permutation-ii-lcci", "question__hide": false, - "total_acs": 29513, - "total_submitted": 42220, - "total_column_articles": 367, + "total_acs": 29738, + "total_submitted": 42571, + "total_column_articles": 369, "frontend_question_id": "面试题 08.08", "is_new_question": false }, @@ -5262,9 +5388,9 @@ "question__title": "二叉树的最近公共祖先 LCOF", "question__title_slug": "er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof", "question__hide": false, - "total_acs": 211430, - "total_submitted": 300550, - "total_column_articles": 1101, + "total_acs": 212500, + "total_submitted": 302071, + "total_column_articles": 1104, "frontend_question_id": "剑指 Offer 68 - II", "is_new_question": false }, @@ -5283,9 +5409,9 @@ "question__title": "二叉搜索树的最近公共祖先 LCOF", "question__title_slug": "er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof", "question__hide": false, - "total_acs": 218434, - "total_submitted": 314978, - "total_column_articles": 1105, + "total_acs": 219564, + "total_submitted": 316608, + "total_column_articles": 1109, "frontend_question_id": "剑指 Offer 68 - I", "is_new_question": false }, @@ -5304,9 +5430,9 @@ "question__title": "求1+2+…+n LCOF", "question__title_slug": "qiu-12n-lcof", "question__hide": false, - "total_acs": 235395, - "total_submitted": 273807, - "total_column_articles": 1771, + "total_acs": 236561, + "total_submitted": 275193, + "total_column_articles": 1773, "frontend_question_id": "剑指 Offer 64", "is_new_question": false }, @@ -5325,8 +5451,8 @@ "question__title": "股票的最大利润 LCOF", "question__title_slug": "gu-piao-de-zui-da-li-run-lcof", "question__hide": false, - "total_acs": 266587, - "total_submitted": 422922, + "total_acs": 267747, + "total_submitted": 424845, "total_column_articles": 1605, "frontend_question_id": "剑指 Offer 63", "is_new_question": false @@ -5346,9 +5472,9 @@ "question__title": "圆圈中最后剩下的数字 LCOF", "question__title_slug": "yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof", "question__hide": false, - "total_acs": 189791, - "total_submitted": 289314, - "total_column_articles": 1091, + "total_acs": 190561, + "total_submitted": 290614, + "total_column_articles": 1095, "frontend_question_id": "剑指 Offer 62", "is_new_question": false }, @@ -5367,9 +5493,9 @@ "question__title": "平衡二叉树 LCOF", "question__title_slug": "ping-heng-er-cha-shu-lcof", "question__hide": false, - "total_acs": 248017, - "total_submitted": 415369, - "total_column_articles": 1450, + "total_acs": 249236, + "total_submitted": 417470, + "total_column_articles": 1452, "frontend_question_id": "剑指 Offer 55 - II", "is_new_question": false }, @@ -5388,9 +5514,9 @@ "question__title": "扑克牌中的顺子 LCOF", "question__title_slug": "bu-ke-pai-zhong-de-shun-zi-lcof", "question__hide": false, - "total_acs": 210428, - "total_submitted": 462840, - "total_column_articles": 1715, + "total_acs": 211522, + "total_submitted": 465438, + "total_column_articles": 1716, "frontend_question_id": "剑指 Offer 61", "is_new_question": false }, @@ -5409,9 +5535,9 @@ "question__title": "把字符串转换成整数 LCOF", "question__title_slug": "ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof", "question__hide": false, - "total_acs": 129248, - "total_submitted": 446650, - "total_column_articles": 964, + "total_acs": 130549, + "total_submitted": 452206, + "total_column_articles": 973, "frontend_question_id": "剑指 Offer 67", "is_new_question": false }, @@ -5430,9 +5556,9 @@ "question__title": "n个骰子的点数 LCOF", "question__title_slug": "nge-tou-zi-de-dian-shu-lcof", "question__hide": false, - "total_acs": 122156, - "total_submitted": 212566, - "total_column_articles": 983, + "total_acs": 122804, + "total_submitted": 213733, + "total_column_articles": 985, "frontend_question_id": "剑指 Offer 60", "is_new_question": false }, @@ -5451,9 +5577,9 @@ "question__title": "构建乘积数组 LCOF", "question__title_slug": "gou-jian-cheng-ji-shu-zu-lcof", "question__hide": false, - "total_acs": 144138, - "total_submitted": 245381, - "total_column_articles": 938, + "total_acs": 144879, + "total_submitted": 246769, + "total_column_articles": 946, "frontend_question_id": "剑指 Offer 66", "is_new_question": false }, @@ -5472,9 +5598,9 @@ "question__title": "队列的最大值 LCOF", "question__title_slug": "dui-lie-de-zui-da-zhi-lcof", "question__hide": false, - "total_acs": 161680, - "total_submitted": 335551, - "total_column_articles": 1425, + "total_acs": 162793, + "total_submitted": 338109, + "total_column_articles": 1431, "frontend_question_id": "剑指 Offer 59 - II", "is_new_question": false }, @@ -5493,9 +5619,9 @@ "question__title": "滑动窗口的最大值 LCOF", "question__title_slug": "hua-dong-chuang-kou-de-zui-da-zhi-lcof", "question__hide": false, - "total_acs": 219935, - "total_submitted": 487623, - "total_column_articles": 1701, + "total_acs": 221161, + "total_submitted": 490174, + "total_column_articles": 1707, "frontend_question_id": "剑指 Offer 59 - I", "is_new_question": false }, @@ -5514,9 +5640,9 @@ "question__title": "不用加减乘除做加法 LCOF", "question__title_slug": "bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof", "question__hide": false, - "total_acs": 140257, - "total_submitted": 235377, - "total_column_articles": 827, + "total_acs": 141009, + "total_submitted": 236612, + "total_column_articles": 830, "frontend_question_id": "剑指 Offer 65", "is_new_question": false }, @@ -5535,9 +5661,9 @@ "question__title": "丑数 LCOF", "question__title_slug": "chou-shu-lcof", "question__hide": false, - "total_acs": 161835, - "total_submitted": 249871, - "total_column_articles": 862, + "total_acs": 162692, + "total_submitted": 251206, + "total_column_articles": 866, "frontend_question_id": "剑指 Offer 49", "is_new_question": false }, @@ -5556,9 +5682,9 @@ "question__title": "二叉搜索树的第k大节点 LCOF", "question__title_slug": "er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof", "question__hide": false, - "total_acs": 297475, - "total_submitted": 388989, - "total_column_articles": 1836, + "total_acs": 298814, + "total_submitted": 390764, + "total_column_articles": 1844, "frontend_question_id": "剑指 Offer 54", "is_new_question": false }, @@ -5577,9 +5703,9 @@ "question__title": "最长不含重复字符的子字符串 LCOF", "question__title_slug": "zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 297764, - "total_submitted": 645088, - "total_column_articles": 1831, + "total_acs": 299086, + "total_submitted": 648099, + "total_column_articles": 1837, "frontend_question_id": "剑指 Offer 48", "is_new_question": false }, @@ -5598,9 +5724,9 @@ "question__title": "缺失的数字 LCOF", "question__title_slug": "que-shi-de-shu-zi-lcof", "question__hide": false, - "total_acs": 342754, - "total_submitted": 764165, - "total_column_articles": 2506, + "total_acs": 344339, + "total_submitted": 767652, + "total_column_articles": 2511, "frontend_question_id": "剑指 Offer 53 - II", "is_new_question": false }, @@ -5619,9 +5745,9 @@ "question__title": "左旋转字符串 LCOF", "question__title_slug": "zuo-xuan-zhuan-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 462655, - "total_submitted": 538641, - "total_column_articles": 3122, + "total_acs": 466808, + "total_submitted": 543644, + "total_column_articles": 3137, "frontend_question_id": "剑指 Offer 58 - II", "is_new_question": false }, @@ -5640,9 +5766,9 @@ "question__title": "在排序数组中查找数字 LCOF", "question__title_slug": "zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof", "question__hide": false, - "total_acs": 377299, - "total_submitted": 714904, - "total_column_articles": 2604, + "total_acs": 379063, + "total_submitted": 718264, + "total_column_articles": 2611, "frontend_question_id": "剑指 Offer 53 - I", "is_new_question": false }, @@ -5661,9 +5787,9 @@ "question__title": "翻转单词顺序 LCOF", "question__title_slug": "fan-zhuan-dan-ci-shun-xu-lcof", "question__hide": false, - "total_acs": 248083, - "total_submitted": 554875, - "total_column_articles": 1622, + "total_acs": 249591, + "total_submitted": 558321, + "total_column_articles": 1635, "frontend_question_id": "剑指 Offer 58 - I", "is_new_question": false }, @@ -5682,9 +5808,9 @@ "question__title": "礼物的最大价值 LCOF", "question__title_slug": "li-wu-de-zui-da-jie-zhi-lcof", "question__hide": false, - "total_acs": 267194, - "total_submitted": 384833, - "total_column_articles": 1885, + "total_acs": 268180, + "total_submitted": 386303, + "total_column_articles": 1889, "frontend_question_id": "剑指 Offer 47", "is_new_question": false }, @@ -5703,9 +5829,9 @@ "question__title": "两个链表的第一个公共节点 LCOF", "question__title_slug": "liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof", "question__hide": false, - "total_acs": 306149, - "total_submitted": 466027, - "total_column_articles": 1546, + "total_acs": 307827, + "total_submitted": 468555, + "total_column_articles": 1556, "frontend_question_id": "剑指 Offer 52", "is_new_question": false }, @@ -5724,9 +5850,9 @@ "question__title": "把数字翻译成字符串 LCOF", "question__title_slug": "ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 244890, - "total_submitted": 476584, - "total_column_articles": 2302, + "total_acs": 245929, + "total_submitted": 478594, + "total_column_articles": 2313, "frontend_question_id": "剑指 Offer 46", "is_new_question": false }, @@ -5745,9 +5871,9 @@ "question__title": "和为s的连续正数序列 LCOF", "question__title_slug": "he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof", "question__hide": false, - "total_acs": 236444, - "total_submitted": 331713, - "total_column_articles": 2431, + "total_acs": 237479, + "total_submitted": 333126, + "total_column_articles": 2434, "frontend_question_id": "剑指 Offer 57 - II", "is_new_question": false }, @@ -5766,9 +5892,9 @@ "question__title": "把数组排成最小的数 LCOF", "question__title_slug": "ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof", "question__hide": false, - "total_acs": 219399, - "total_submitted": 397869, - "total_column_articles": 1449, + "total_acs": 220486, + "total_submitted": 399899, + "total_column_articles": 1453, "frontend_question_id": "剑指 Offer 45", "is_new_question": false }, @@ -5787,9 +5913,9 @@ "question__title": "和为s的两个数字 LCOF", "question__title_slug": "he-wei-sde-liang-ge-shu-zi-lcof", "question__hide": false, - "total_acs": 261364, - "total_submitted": 384016, - "total_column_articles": 1428, + "total_acs": 263005, + "total_submitted": 386545, + "total_column_articles": 1434, "frontend_question_id": "剑指 Offer 57", "is_new_question": false }, @@ -5808,9 +5934,9 @@ "question__title": "数组中数字出现的次数 II LCOF", "question__title_slug": "shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof", "question__hide": false, - "total_acs": 165684, - "total_submitted": 205295, - "total_column_articles": 1087, + "total_acs": 166412, + "total_submitted": 206245, + "total_column_articles": 1090, "frontend_question_id": "剑指 Offer 56 - II", "is_new_question": false }, @@ -5829,9 +5955,9 @@ "question__title": "数组中数字出现的次数 LCOF", "question__title_slug": "shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof", "question__hide": false, - "total_acs": 199100, - "total_submitted": 288898, - "total_column_articles": 1546, + "total_acs": 199999, + "total_submitted": 290212, + "total_column_articles": 1553, "frontend_question_id": "剑指 Offer 56 - I", "is_new_question": false }, @@ -5850,9 +5976,9 @@ "question__title": "二叉树的深度 LCOF", "question__title_slug": "er-cha-shu-de-shen-du-lcof", "question__hide": false, - "total_acs": 303276, - "total_submitted": 381652, - "total_column_articles": 1809, + "total_acs": 304650, + "total_submitted": 383373, + "total_column_articles": 1812, "frontend_question_id": "剑指 Offer 55 - I", "is_new_question": false }, @@ -5871,9 +5997,9 @@ "question__title": "数组中的逆序对 LCOF", "question__title_slug": "shu-zu-zhong-de-ni-xu-dui-lcof", "question__hide": false, - "total_acs": 193910, - "total_submitted": 391194, - "total_column_articles": 1456, + "total_acs": 195042, + "total_submitted": 393553, + "total_column_articles": 1459, "frontend_question_id": "剑指 Offer 51", "is_new_question": false }, @@ -5892,9 +6018,9 @@ "question__title": "二叉树中和为某一值的路径 LCOF", "question__title_slug": "er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof", "question__hide": false, - "total_acs": 257257, - "total_submitted": 435876, - "total_column_articles": 1483, + "total_acs": 258494, + "total_submitted": 437959, + "total_column_articles": 1490, "frontend_question_id": "剑指 Offer 34", "is_new_question": false }, @@ -5913,9 +6039,9 @@ "question__title": "第一个只出现一次的字符 LCOF", "question__title_slug": "di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof", "question__hide": false, - "total_acs": 314467, - "total_submitted": 507659, - "total_column_articles": 1812, + "total_acs": 315839, + "total_submitted": 509918, + "total_column_articles": 1815, "frontend_question_id": "剑指 Offer 50", "is_new_question": false }, @@ -5934,9 +6060,9 @@ "question__title": "二叉搜索树的后序遍历序列 LCOF", "question__title_slug": "er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof", "question__hide": false, - "total_acs": 217699, - "total_submitted": 383059, - "total_column_articles": 1621, + "total_acs": 218788, + "total_submitted": 384928, + "total_column_articles": 1629, "frontend_question_id": "剑指 Offer 33", "is_new_question": false }, @@ -5955,9 +6081,9 @@ "question__title": "从上到下打印二叉树 III LCOF", "question__title_slug": "cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof", "question__hide": false, - "total_acs": 251189, - "total_submitted": 431233, - "total_column_articles": 2085, + "total_acs": 252308, + "total_submitted": 433192, + "total_column_articles": 2092, "frontend_question_id": "剑指 Offer 32 - III", "is_new_question": false }, @@ -5976,9 +6102,9 @@ "question__title": "数字序列中某一位的数字 LCOF", "question__title_slug": "shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof", "question__hide": false, - "total_acs": 104292, - "total_submitted": 242047, - "total_column_articles": 788, + "total_acs": 104777, + "total_submitted": 243215, + "total_column_articles": 791, "frontend_question_id": "剑指 Offer 44", "is_new_question": false }, @@ -5997,9 +6123,9 @@ "question__title": "从上到下打印二叉树 II LCOF", "question__title_slug": "cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof", "question__hide": false, - "total_acs": 271802, - "total_submitted": 394425, - "total_column_articles": 1869, + "total_acs": 273011, + "total_submitted": 396237, + "total_column_articles": 1872, "frontend_question_id": "剑指 Offer 32 - II", "is_new_question": false }, @@ -6018,9 +6144,9 @@ "question__title": "从上到下打印二叉树 LCOF", "question__title_slug": "cong-shang-dao-xia-da-yin-er-cha-shu-lcof", "question__hide": false, - "total_acs": 275764, - "total_submitted": 436476, - "total_column_articles": 1686, + "total_acs": 277068, + "total_submitted": 438507, + "total_column_articles": 1689, "frontend_question_id": "剑指 Offer 32 - I", "is_new_question": false }, @@ -6039,9 +6165,9 @@ "question__title": "数组中出现次数超过一半的数字 LCOF", "question__title_slug": "shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof", "question__hide": false, - "total_acs": 297730, - "total_submitted": 424921, - "total_column_articles": 1566, + "total_acs": 299084, + "total_submitted": 426934, + "total_column_articles": 1573, "frontend_question_id": "剑指 Offer 39", "is_new_question": false }, @@ -6060,9 +6186,9 @@ "question__title": "1~n整数中1出现的次数 LCOF", "question__title_slug": "1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof", "question__hide": false, - "total_acs": 87342, - "total_submitted": 172838, - "total_column_articles": 771, + "total_acs": 87776, + "total_submitted": 173712, + "total_column_articles": 773, "frontend_question_id": "剑指 Offer 43", "is_new_question": false }, @@ -6081,9 +6207,9 @@ "question__title": "字符串的排列 LCOF", "question__title_slug": "zi-fu-chuan-de-pai-lie-lcof", "question__hide": false, - "total_acs": 266961, - "total_submitted": 463159, - "total_column_articles": 1612, + "total_acs": 268334, + "total_submitted": 465751, + "total_column_articles": 1622, "frontend_question_id": "剑指 Offer 38", "is_new_question": false }, @@ -6102,9 +6228,9 @@ "question__title": "序列化二叉树 LCOF", "question__title_slug": "xu-lie-hua-er-cha-shu-lcof", "question__hide": false, - "total_acs": 133571, - "total_submitted": 232201, - "total_column_articles": 846, + "total_acs": 134181, + "total_submitted": 233285, + "total_column_articles": 848, "frontend_question_id": "剑指 Offer 37", "is_new_question": false }, @@ -6123,9 +6249,9 @@ "question__title": "栈的压入、弹出序列 LCOF", "question__title_slug": "zhan-de-ya-ru-dan-chu-xu-lie-lcof", "question__hide": false, - "total_acs": 211971, - "total_submitted": 347446, - "total_column_articles": 1529, + "total_acs": 213333, + "total_submitted": 349661, + "total_column_articles": 1536, "frontend_question_id": "剑指 Offer 31", "is_new_question": false }, @@ -6144,9 +6270,9 @@ "question__title": "二叉搜索树与双向链表 LCOF", "question__title_slug": "er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof", "question__hide": false, - "total_acs": 209466, - "total_submitted": 322388, - "total_column_articles": 1608, + "total_acs": 210447, + "total_submitted": 323922, + "total_column_articles": 1621, "frontend_question_id": "剑指 Offer 36", "is_new_question": false }, @@ -6165,9 +6291,9 @@ "question__title": "连续子数组的最大和 LCOF", "question__title_slug": "lian-xu-zi-shu-zu-de-zui-da-he-lcof", "question__hide": false, - "total_acs": 397273, - "total_submitted": 657780, - "total_column_articles": 2267, + "total_acs": 398857, + "total_submitted": 660478, + "total_column_articles": 2271, "frontend_question_id": "剑指 Offer 42", "is_new_question": false }, @@ -6186,9 +6312,9 @@ "question__title": "数据流中的中位数 LCOF", "question__title_slug": "shu-ju-liu-zhong-de-zhong-wei-shu-lcof", "question__hide": false, - "total_acs": 132764, - "total_submitted": 227621, - "total_column_articles": 864, + "total_acs": 133357, + "total_submitted": 228643, + "total_column_articles": 869, "frontend_question_id": "剑指 Offer 41", "is_new_question": false }, @@ -6207,9 +6333,9 @@ "question__title": "包含min函数的栈 LCOF", "question__title_slug": "bao-han-minhan-shu-de-zhan-lcof", "question__hide": false, - "total_acs": 343928, - "total_submitted": 621494, - "total_column_articles": 1999, + "total_acs": 345405, + "total_submitted": 624136, + "total_column_articles": 2004, "frontend_question_id": "剑指 Offer 30", "is_new_question": false }, @@ -6228,9 +6354,9 @@ "question__title": "最小的k个数 LCOF", "question__title_slug": "zui-xiao-de-kge-shu-lcof", "question__hide": false, - "total_acs": 431374, - "total_submitted": 748592, - "total_column_articles": 2524, + "total_acs": 433252, + "total_submitted": 751655, + "total_column_articles": 2532, "frontend_question_id": "剑指 Offer 40", "is_new_question": false }, @@ -6249,9 +6375,9 @@ "question__title": "复杂链表的复制 LCOF", "question__title_slug": "fu-za-lian-biao-de-fu-zhi-lcof", "question__hide": false, - "total_acs": 277815, - "total_submitted": 388114, - "total_column_articles": 1748, + "total_acs": 279317, + "total_submitted": 390219, + "total_column_articles": 1754, "frontend_question_id": "剑指 Offer 35", "is_new_question": false }, @@ -6270,9 +6396,9 @@ "question__title": "删除链表的节点 LCOF", "question__title_slug": "shan-chu-lian-biao-de-jie-dian-lcof", "question__hide": false, - "total_acs": 348599, - "total_submitted": 580994, - "total_column_articles": 2264, + "total_acs": 350759, + "total_submitted": 584776, + "total_column_articles": 2274, "frontend_question_id": "剑指 Offer 18", "is_new_question": false }, @@ -6291,9 +6417,9 @@ "question__title": "反转链表 LCOF", "question__title_slug": "fan-zhuan-lian-biao-lcof", "question__hide": false, - "total_acs": 553186, - "total_submitted": 745060, - "total_column_articles": 2884, + "total_acs": 555866, + "total_submitted": 748661, + "total_column_articles": 2898, "frontend_question_id": "剑指 Offer 24", "is_new_question": false }, @@ -6312,9 +6438,9 @@ "question__title": "正则表达式匹配 LCOF", "question__title_slug": "zheng-ze-biao-da-shi-pi-pei-lcof", "question__hide": false, - "total_acs": 118355, - "total_submitted": 307515, - "total_column_articles": 706, + "total_acs": 118990, + "total_submitted": 309092, + "total_column_articles": 708, "frontend_question_id": "剑指 Offer 19", "is_new_question": false }, @@ -6333,9 +6459,9 @@ "question__title": "打印从1到最大的n位数 LCOF", "question__title_slug": "da-yin-cong-1dao-zui-da-de-nwei-shu-lcof", "question__hide": false, - "total_acs": 254515, - "total_submitted": 327346, - "total_column_articles": 1567, + "total_acs": 255770, + "total_submitted": 328985, + "total_column_articles": 1574, "frontend_question_id": "剑指 Offer 17", "is_new_question": false }, @@ -6354,9 +6480,9 @@ "question__title": "数值的整数次方 LCOF", "question__title_slug": "shu-zhi-de-zheng-shu-ci-fang-lcof", "question__hide": false, - "total_acs": 233571, - "total_submitted": 670491, - "total_column_articles": 1267, + "total_acs": 234705, + "total_submitted": 673767, + "total_column_articles": 1273, "frontend_question_id": "剑指 Offer 16", "is_new_question": false }, @@ -6375,9 +6501,9 @@ "question__title": "链表中倒数第k个节点 LCOF", "question__title_slug": "lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof", "question__hide": false, - "total_acs": 454230, - "total_submitted": 566650, - "total_column_articles": 3533, + "total_acs": 456859, + "total_submitted": 569983, + "total_column_articles": 3552, "frontend_question_id": "剑指 Offer 22", "is_new_question": false }, @@ -6396,9 +6522,9 @@ "question__title": "顺时针打印矩阵 LCOF", "question__title_slug": "shun-shi-zhen-da-yin-ju-zhen-lcof", "question__hide": false, - "total_acs": 253375, - "total_submitted": 587347, - "total_column_articles": 2166, + "total_acs": 254900, + "total_submitted": 591238, + "total_column_articles": 2173, "frontend_question_id": "剑指 Offer 29", "is_new_question": false }, @@ -6417,9 +6543,9 @@ "question__title": "二进制中1的个数 LCOF", "question__title_slug": "er-jin-zhi-zhong-1de-ge-shu-lcof", "question__hide": false, - "total_acs": 329015, - "total_submitted": 435157, - "total_column_articles": 1804, + "total_acs": 330331, + "total_submitted": 436791, + "total_column_articles": 1810, "frontend_question_id": "剑指 Offer 15", "is_new_question": false }, @@ -6438,9 +6564,9 @@ "question__title": "调整数组顺序使奇数位于偶数前面 LCOF", "question__title_slug": "diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof", "question__hide": false, - "total_acs": 366043, - "total_submitted": 562985, - "total_column_articles": 2583, + "total_acs": 368202, + "total_submitted": 566291, + "total_column_articles": 2592, "frontend_question_id": "剑指 Offer 21", "is_new_question": false }, @@ -6459,9 +6585,9 @@ "question__title": "表示数值的字符串 LCOF", "question__title_slug": "biao-shi-shu-zhi-de-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 136925, - "total_submitted": 541030, - "total_column_articles": 1482, + "total_acs": 138088, + "total_submitted": 546064, + "total_column_articles": 1497, "frontend_question_id": "剑指 Offer 20", "is_new_question": false }, @@ -6480,9 +6606,9 @@ "question__title": "对称的二叉树 LCOF", "question__title_slug": "dui-cheng-de-er-cha-shu-lcof", "question__hide": false, - "total_acs": 289372, - "total_submitted": 501992, - "total_column_articles": 1835, + "total_acs": 290619, + "total_submitted": 504201, + "total_column_articles": 1842, "frontend_question_id": "剑指 Offer 28", "is_new_question": false }, @@ -6501,9 +6627,9 @@ "question__title": "二叉树的镜像 LCOF", "question__title_slug": "er-cha-shu-de-jing-xiang-lcof", "question__hide": false, - "total_acs": 353054, - "total_submitted": 443426, - "total_column_articles": 2201, + "total_acs": 354515, + "total_submitted": 445212, + "total_column_articles": 2206, "frontend_question_id": "剑指 Offer 27", "is_new_question": false }, @@ -6522,9 +6648,9 @@ "question__title": "树的子结构 LCOF", "question__title_slug": "shu-de-zi-jie-gou-lcof", "question__hide": false, - "total_acs": 299965, - "total_submitted": 645576, - "total_column_articles": 2054, + "total_acs": 301345, + "total_submitted": 648668, + "total_column_articles": 2064, "frontend_question_id": "剑指 Offer 26", "is_new_question": false }, @@ -6543,9 +6669,9 @@ "question__title": "合并两个排序的链表 LCOF", "question__title_slug": "he-bing-liang-ge-pai-xu-de-lian-biao-lcof", "question__hide": false, - "total_acs": 348066, - "total_submitted": 481225, - "total_column_articles": 1884, + "total_acs": 350202, + "total_submitted": 484318, + "total_column_articles": 1893, "frontend_question_id": "剑指 Offer 25", "is_new_question": false }, @@ -6564,9 +6690,9 @@ "question__title": "剪绳子 II LCOF", "question__title_slug": "jian-sheng-zi-ii-lcof", "question__hide": false, - "total_acs": 147673, - "total_submitted": 469871, - "total_column_articles": 768, + "total_acs": 148336, + "total_submitted": 472043, + "total_column_articles": 770, "frontend_question_id": "剑指 Offer 14- II", "is_new_question": false }, @@ -6585,9 +6711,9 @@ "question__title": "剪绳子 LCOF", "question__title_slug": "jian-sheng-zi-lcof", "question__hide": false, - "total_acs": 283306, - "total_submitted": 493374, - "total_column_articles": 2014, + "total_acs": 284621, + "total_submitted": 495598, + "total_column_articles": 2018, "frontend_question_id": "剑指 Offer 14- I", "is_new_question": false }, @@ -6606,9 +6732,9 @@ "question__title": "重建二叉树 LCOF", "question__title_slug": "zhong-jian-er-cha-shu-lcof", "question__hide": false, - "total_acs": 329764, - "total_submitted": 469242, - "total_column_articles": 2131, + "total_acs": 331244, + "total_submitted": 471325, + "total_column_articles": 2140, "frontend_question_id": "剑指 Offer 07", "is_new_question": false }, @@ -6627,9 +6753,9 @@ "question__title": "从尾到头打印链表 LCOF", "question__title_slug": "cong-wei-dao-tou-da-yin-lian-biao-lcof", "question__hide": false, - "total_acs": 605379, - "total_submitted": 812941, - "total_column_articles": 3542, + "total_acs": 608590, + "total_submitted": 817187, + "total_column_articles": 3550, "frontend_question_id": "剑指 Offer 06", "is_new_question": false }, @@ -6648,9 +6774,9 @@ "question__title": "机器人的运动范围 LCOF", "question__title_slug": "ji-qi-ren-de-yun-dong-fan-wei-lcof", "question__hide": false, - "total_acs": 311279, - "total_submitted": 580054, - "total_column_articles": 2504, + "total_acs": 312913, + "total_submitted": 583195, + "total_column_articles": 2512, "frontend_question_id": "剑指 Offer 13", "is_new_question": false }, @@ -6669,9 +6795,9 @@ "question__title": "替换空格 LCOF", "question__title_slug": "ti-huan-kong-ge-lcof", "question__hide": false, - "total_acs": 645716, - "total_submitted": 856721, - "total_column_articles": 3404, + "total_acs": 651211, + "total_submitted": 864351, + "total_column_articles": 3425, "frontend_question_id": "剑指 Offer 05", "is_new_question": false }, @@ -6690,9 +6816,9 @@ "question__title": "矩阵中的路径 LCOF", "question__title_slug": "ju-zhen-zhong-de-lu-jing-lcof", "question__hide": false, - "total_acs": 330310, - "total_submitted": 723010, - "total_column_articles": 1826, + "total_acs": 331880, + "total_submitted": 726386, + "total_column_articles": 1831, "frontend_question_id": "剑指 Offer 12", "is_new_question": false }, @@ -6711,9 +6837,9 @@ "question__title": "旋转数组的最小数字 LCOF", "question__title_slug": "xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof", "question__hide": false, - "total_acs": 481120, - "total_submitted": 972898, - "total_column_articles": 2571, + "total_acs": 483034, + "total_submitted": 976737, + "total_column_articles": 2579, "frontend_question_id": "剑指 Offer 11", "is_new_question": false }, @@ -6732,9 +6858,9 @@ "question__title": "青蛙跳台阶问题 LCOF", "question__title_slug": "qing-wa-tiao-tai-jie-wen-ti-lcof", "question__hide": false, - "total_acs": 374995, - "total_submitted": 819512, - "total_column_articles": 2050, + "total_acs": 376617, + "total_submitted": 823110, + "total_column_articles": 2054, "frontend_question_id": "剑指 Offer 10- II", "is_new_question": false }, @@ -6753,9 +6879,9 @@ "question__title": "二维数组中的查找 LCOF", "question__title_slug": "er-wei-shu-zu-zhong-de-cha-zhao-lcof", "question__hide": false, - "total_acs": 505880, - "total_submitted": 1278575, - "total_column_articles": 3464, + "total_acs": 508172, + "total_submitted": 1284609, + "total_column_articles": 3475, "frontend_question_id": "剑指 Offer 04", "is_new_question": false }, @@ -6774,9 +6900,9 @@ "question__title": "数组中重复的数字 LCOF", "question__title_slug": "shu-zu-zhong-zhong-fu-de-shu-zi-lcof", "question__hide": false, - "total_acs": 736749, - "total_submitted": 1097038, - "total_column_articles": 4306, + "total_acs": 739931, + "total_submitted": 1102058, + "total_column_articles": 4323, "frontend_question_id": "剑指 Offer 03", "is_new_question": false }, @@ -6795,9 +6921,9 @@ "question__title": "斐波那契数列 LCOF", "question__title_slug": "fei-bo-na-qi-shu-lie-lcof", "question__hide": false, - "total_acs": 481441, - "total_submitted": 1338674, - "total_column_articles": 2799, + "total_acs": 483365, + "total_submitted": 1344185, + "total_column_articles": 2807, "frontend_question_id": "剑指 Offer 10- I", "is_new_question": false }, @@ -6816,9 +6942,9 @@ "question__title": "用两个栈实现队列 LCOF", "question__title_slug": "yong-liang-ge-zhan-shi-xian-dui-lie-lcof", "question__hide": false, - "total_acs": 555806, - "total_submitted": 789787, - "total_column_articles": 2959, + "total_acs": 558037, + "total_submitted": 793001, + "total_column_articles": 2967, "frontend_question_id": "剑指 Offer 09", "is_new_question": false }, @@ -6837,9 +6963,9 @@ "question__title": "Smallest Difference LCCI", "question__title_slug": "smallest-difference-lcci", "question__hide": false, - "total_acs": 21545, - "total_submitted": 50349, - "total_column_articles": 282, + "total_acs": 21651, + "total_submitted": 50590, + "total_column_articles": 285, "frontend_question_id": "面试题 16.06", "is_new_question": false }, @@ -6858,9 +6984,9 @@ "question__title": "Tic-Tac-Toe LCCI", "question__title_slug": "tic-tac-toe-lcci", "question__hide": false, - "total_acs": 11379, - "total_submitted": 24326, - "total_column_articles": 216, + "total_acs": 11433, + "total_submitted": 24423, + "total_column_articles": 218, "frontend_question_id": "面试题 16.04", "is_new_question": false }, @@ -6879,8 +7005,8 @@ "question__title": "Intersection LCCI", "question__title_slug": "intersection-lcci", "question__hide": false, - "total_acs": 11018, - "total_submitted": 25123, + "total_acs": 11030, + "total_submitted": 25150, "total_column_articles": 252, "frontend_question_id": "面试题 16.03", "is_new_question": false @@ -6900,9 +7026,9 @@ "question__title": "Words Frequency LCCI", "question__title_slug": "words-frequency-lcci", "question__hide": false, - "total_acs": 23248, - "total_submitted": 30250, - "total_column_articles": 270, + "total_acs": 23367, + "total_submitted": 30384, + "total_column_articles": 271, "frontend_question_id": "面试题 16.02", "is_new_question": false }, @@ -6921,9 +7047,9 @@ "question__title": "Swap Numbers LCCI", "question__title_slug": "swap-numbers-lcci", "question__hide": false, - "total_acs": 38749, - "total_submitted": 47543, - "total_column_articles": 551, + "total_acs": 38922, + "total_submitted": 47754, + "total_column_articles": 554, "frontend_question_id": "面试题 16.01", "is_new_question": false }, @@ -6942,9 +7068,9 @@ "question__title": "Sparse Array Search LCCI", "question__title_slug": "sparse-array-search-lcci", "question__hide": false, - "total_acs": 29724, - "total_submitted": 52239, - "total_column_articles": 357, + "total_acs": 29848, + "total_submitted": 52501, + "total_column_articles": 359, "frontend_question_id": "面试题 10.05", "is_new_question": false }, @@ -6963,9 +7089,9 @@ "question__title": "Permutation I LCCI", "question__title_slug": "permutation-i-lcci", "question__hide": false, - "total_acs": 31900, - "total_submitted": 39361, - "total_column_articles": 457, + "total_acs": 32046, + "total_submitted": 39552, + "total_column_articles": 459, "frontend_question_id": "面试题 08.07", "is_new_question": false }, @@ -6984,8 +7110,8 @@ "question__title": "Magic Index LCCI", "question__title_slug": "magic-index-lcci", "question__hide": false, - "total_acs": 61547, - "total_submitted": 91309, + "total_acs": 61703, + "total_submitted": 91523, "total_column_articles": 489, "frontend_question_id": "面试题 08.03", "is_new_question": false @@ -7005,8 +7131,8 @@ "question__title": "Eight Queens LCCI", "question__title_slug": "eight-queens-lcci", "question__hide": false, - "total_acs": 28295, - "total_submitted": 37023, + "total_acs": 28408, + "total_submitted": 37171, "total_column_articles": 414, "frontend_question_id": "面试题 08.12", "is_new_question": false @@ -7026,9 +7152,9 @@ "question__title": "Search Rotate Array LCCI", "question__title_slug": "search-rotate-array-lcci", "question__hide": false, - "total_acs": 25278, - "total_submitted": 65610, - "total_column_articles": 294, + "total_acs": 25416, + "total_submitted": 66002, + "total_column_articles": 296, "frontend_question_id": "面试题 10.03", "is_new_question": false }, @@ -7047,8 +7173,8 @@ "question__title": "Coin LCCI", "question__title_slug": "coin-lcci", "question__hide": false, - "total_acs": 43045, - "total_submitted": 86575, + "total_acs": 43182, + "total_submitted": 86837, "total_column_articles": 375, "frontend_question_id": "面试题 08.11", "is_new_question": false @@ -7068,8 +7194,8 @@ "question__title": "Reverse Bits LCCI", "question__title_slug": "reverse-bits-lcci", "question__hide": false, - "total_acs": 21061, - "total_submitted": 55932, + "total_acs": 21152, + "total_submitted": 56170, "total_column_articles": 352, "frontend_question_id": "面试题 05.03", "is_new_question": false @@ -7089,9 +7215,9 @@ "question__title": "Check SubTree LCCI", "question__title_slug": "check-subtree-lcci", "question__hide": false, - "total_acs": 26528, - "total_submitted": 39009, - "total_column_articles": 379, + "total_acs": 26654, + "total_submitted": 39270, + "total_column_articles": 381, "frontend_question_id": "面试题 04.10", "is_new_question": false }, @@ -7110,9 +7236,9 @@ "question__title": "Animal Shelter LCCI", "question__title_slug": "animal-shelter-lcci", "question__hide": false, - "total_acs": 18824, - "total_submitted": 32218, - "total_column_articles": 257, + "total_acs": 18908, + "total_submitted": 32397, + "total_column_articles": 258, "frontend_question_id": "面试题 03.06", "is_new_question": false }, @@ -7129,10 +7255,10 @@ "stat": { "question_id": 100203, "question__title": "Binary Number to String LCCI", - "question__title_slug": "bianry-number-to-string-lcci", + "question__title_slug": "binary-number-to-string-lcci", "question__hide": false, - "total_acs": 37159, - "total_submitted": 48387, + "total_acs": 37233, + "total_submitted": 48473, "total_column_articles": 426, "frontend_question_id": "面试题 05.02", "is_new_question": false @@ -7152,8 +7278,8 @@ "question__title": "Pile Box LCCI", "question__title_slug": "pile-box-lcci", "question__hide": false, - "total_acs": 11697, - "total_submitted": 22815, + "total_acs": 11757, + "total_submitted": 22935, "total_column_articles": 132, "frontend_question_id": "面试题 08.13", "is_new_question": false @@ -7173,9 +7299,9 @@ "question__title": "Color Fill LCCI", "question__title_slug": "color-fill-lcci", "question__hide": false, - "total_acs": 22157, - "total_submitted": 39739, - "total_column_articles": 329, + "total_acs": 22309, + "total_submitted": 40016, + "total_column_articles": 331, "frontend_question_id": "面试题 08.10", "is_new_question": false }, @@ -7194,8 +7320,8 @@ "question__title": "Bracket LCCI", "question__title_slug": "bracket-lcci", "question__hide": false, - "total_acs": 32712, - "total_submitted": 39846, + "total_acs": 32829, + "total_submitted": 39976, "total_column_articles": 491, "frontend_question_id": "面试题 08.09", "is_new_question": false @@ -7215,9 +7341,9 @@ "question__title": "Recursive Mulitply LCCI", "question__title_slug": "recursive-mulitply-lcci", "question__hide": false, - "total_acs": 43606, - "total_submitted": 66480, - "total_column_articles": 742, + "total_acs": 43874, + "total_submitted": 66932, + "total_column_articles": 745, "frontend_question_id": "面试题 08.05", "is_new_question": false }, @@ -7236,8 +7362,8 @@ "question__title": "Power Set LCCI", "question__title_slug": "power-set-lcci", "question__hide": false, - "total_acs": 30775, - "total_submitted": 37506, + "total_acs": 30891, + "total_submitted": 37638, "total_column_articles": 457, "frontend_question_id": "面试题 08.04", "is_new_question": false @@ -7257,8 +7383,8 @@ "question__title": "Three Steps Problem LCCI", "question__title_slug": "three-steps-problem-lcci", "question__hide": false, - "total_acs": 61792, - "total_submitted": 168339, + "total_acs": 62125, + "total_submitted": 169267, "total_column_articles": 649, "frontend_question_id": "面试题 08.01", "is_new_question": false @@ -7278,8 +7404,8 @@ "question__title": "Draw Line LCCI", "question__title_slug": "draw-line-lcci", "question__hide": false, - "total_acs": 6480, - "total_submitted": 12035, + "total_acs": 6526, + "total_submitted": 12144, "total_column_articles": 134, "frontend_question_id": "面试题 05.08", "is_new_question": false @@ -7299,8 +7425,8 @@ "question__title": "Stack of Plates LCCI", "question__title_slug": "stack-of-plates-lcci", "question__hide": false, - "total_acs": 15488, - "total_submitted": 40309, + "total_acs": 15609, + "total_submitted": 40595, "total_column_articles": 209, "frontend_question_id": "面试题 03.03", "is_new_question": false @@ -7320,9 +7446,9 @@ "question__title": "Sum Lists LCCI", "question__title_slug": "sum-lists-lcci", "question__hide": false, - "total_acs": 62015, - "total_submitted": 132168, - "total_column_articles": 753, + "total_acs": 62355, + "total_submitted": 132914, + "total_column_articles": 754, "frontend_question_id": "面试题 02.05", "is_new_question": false }, @@ -7341,9 +7467,9 @@ "question__title": "Delete Middle Node LCCI", "question__title_slug": "delete-middle-node-lcci", "question__hide": false, - "total_acs": 93115, - "total_submitted": 108303, - "total_column_articles": 857, + "total_acs": 93445, + "total_submitted": 108670, + "total_column_articles": 858, "frontend_question_id": "面试题 02.03", "is_new_question": false }, @@ -7362,9 +7488,9 @@ "question__title": "Zero Matrix LCCI", "question__title_slug": "zero-matrix-lcci", "question__hide": false, - "total_acs": 110480, - "total_submitted": 171389, - "total_column_articles": 990, + "total_acs": 110976, + "total_submitted": 172187, + "total_column_articles": 992, "frontend_question_id": "面试题 01.08", "is_new_question": false }, @@ -7383,9 +7509,9 @@ "question__title": "Rotate Matrix LCCI", "question__title_slug": "rotate-matrix-lcci", "question__hide": false, - "total_acs": 108141, - "total_submitted": 147427, - "total_column_articles": 1212, + "total_acs": 108622, + "total_submitted": 148129, + "total_column_articles": 1215, "frontend_question_id": "面试题 01.07", "is_new_question": false }, @@ -7404,9 +7530,9 @@ "question__title": "Palindrome Permutation LCCI", "question__title_slug": "palindrome-permutation-lcci", "question__hide": false, - "total_acs": 67488, - "total_submitted": 125613, - "total_column_articles": 1133, + "total_acs": 67841, + "total_submitted": 126254, + "total_column_articles": 1136, "frontend_question_id": "面试题 01.04", "is_new_question": false }, @@ -7425,8 +7551,8 @@ "question__title": "Closed Number LCCI", "question__title_slug": "closed-number-lcci", "question__hide": false, - "total_acs": 8776, - "total_submitted": 24522, + "total_acs": 8803, + "total_submitted": 24631, "total_column_articles": 197, "frontend_question_id": "面试题 05.04", "is_new_question": false @@ -7446,8 +7572,8 @@ "question__title": "Exchange LCCI", "question__title_slug": "exchange-lcci", "question__hide": false, - "total_acs": 18152, - "total_submitted": 25562, + "total_acs": 18203, + "total_submitted": 25632, "total_column_articles": 293, "frontend_question_id": "面试题 05.07", "is_new_question": false @@ -7467,8 +7593,8 @@ "question__title": "Convert Integer LCCI", "question__title_slug": "convert-integer-lcci", "question__hide": false, - "total_acs": 20203, - "total_submitted": 39212, + "total_acs": 20262, + "total_submitted": 39332, "total_column_articles": 333, "frontend_question_id": "面试题 05.06", "is_new_question": false @@ -7488,9 +7614,9 @@ "question__title": "Insert Into Bits LCCI", "question__title_slug": "insert-into-bits-lcci", "question__hide": false, - "total_acs": 16513, - "total_submitted": 32144, - "total_column_articles": 298, + "total_acs": 16595, + "total_submitted": 32297, + "total_column_articles": 299, "frontend_question_id": "面试题 05.01", "is_new_question": false }, @@ -7509,8 +7635,8 @@ "question__title": "First Common Ancestor LCCI", "question__title_slug": "first-common-ancestor-lcci", "question__hide": false, - "total_acs": 27196, - "total_submitted": 38033, + "total_acs": 27325, + "total_submitted": 38207, "total_column_articles": 272, "frontend_question_id": "面试题 04.08", "is_new_question": false @@ -7530,9 +7656,9 @@ "question__title": "Successor LCCI", "question__title_slug": "successor-lcci", "question__hide": false, - "total_acs": 64721, - "total_submitted": 103500, - "total_column_articles": 665, + "total_acs": 64881, + "total_submitted": 103784, + "total_column_articles": 666, "frontend_question_id": "面试题 04.06", "is_new_question": false }, @@ -7551,9 +7677,9 @@ "question__title": "Legal Binary Search Tree LCCI", "question__title_slug": "legal-binary-search-tree-lcci", "question__hide": false, - "total_acs": 38355, - "total_submitted": 107650, - "total_column_articles": 444, + "total_acs": 38514, + "total_submitted": 108039, + "total_column_articles": 445, "frontend_question_id": "面试题 04.05", "is_new_question": false }, @@ -7572,9 +7698,9 @@ "question__title": "Check Balance LCCI", "question__title_slug": "check-balance-lcci", "question__hide": false, - "total_acs": 45028, - "total_submitted": 75448, - "total_column_articles": 469, + "total_acs": 45200, + "total_submitted": 75702, + "total_column_articles": 470, "frontend_question_id": "面试题 04.04", "is_new_question": false }, @@ -7593,9 +7719,9 @@ "question__title": "List of Depth LCCI", "question__title_slug": "list-of-depth-lcci", "question__hide": false, - "total_acs": 34637, - "total_submitted": 42900, - "total_column_articles": 713, + "total_acs": 34770, + "total_submitted": 43075, + "total_column_articles": 714, "frontend_question_id": "面试题 04.03", "is_new_question": false }, @@ -7614,9 +7740,9 @@ "question__title": "Minimum Height Tree LCCI", "question__title_slug": "minimum-height-tree-lcci", "question__hide": false, - "total_acs": 47638, - "total_submitted": 60397, - "total_column_articles": 560, + "total_acs": 47787, + "total_submitted": 60587, + "total_column_articles": 562, "frontend_question_id": "面试题 04.02", "is_new_question": false }, @@ -7635,9 +7761,9 @@ "question__title": "Sort of Stacks LCCI", "question__title_slug": "sort-of-stacks-lcci", "question__hide": false, - "total_acs": 26342, - "total_submitted": 49141, - "total_column_articles": 342, + "total_acs": 26478, + "total_submitted": 49383, + "total_column_articles": 343, "frontend_question_id": "面试题 03.05", "is_new_question": false }, @@ -7656,8 +7782,8 @@ "question__title": "Three in One LCCI", "question__title_slug": "three-in-one-lcci", "question__hide": false, - "total_acs": 20238, - "total_submitted": 37788, + "total_acs": 20378, + "total_submitted": 38052, "total_column_articles": 284, "frontend_question_id": "面试题 03.01", "is_new_question": false @@ -7677,8 +7803,8 @@ "question__title": "Route Between Nodes LCCI ", "question__title_slug": "route-between-nodes-lcci", "question__hide": false, - "total_acs": 30020, - "total_submitted": 56173, + "total_acs": 30222, + "total_submitted": 56510, "total_column_articles": 385, "frontend_question_id": "面试题 04.01", "is_new_question": false @@ -7698,9 +7824,9 @@ "question__title": "Implement Queue using Stacks LCCI", "question__title_slug": "implement-queue-using-stacks-lcci", "question__hide": false, - "total_acs": 33631, - "total_submitted": 46804, - "total_column_articles": 437, + "total_acs": 33765, + "total_submitted": 46985, + "total_column_articles": 438, "frontend_question_id": "面试题 03.04", "is_new_question": false }, @@ -7719,8 +7845,8 @@ "question__title": "Min Stack LCCI", "question__title_slug": "min-stack-lcci", "question__hide": false, - "total_acs": 38907, - "total_submitted": 62747, + "total_acs": 39102, + "total_submitted": 63046, "total_column_articles": 412, "frontend_question_id": "面试题 03.02", "is_new_question": false @@ -7740,9 +7866,9 @@ "question__title": "Linked List Cycle LCCI", "question__title_slug": "linked-list-cycle-lcci", "question__hide": false, - "total_acs": 42077, - "total_submitted": 76499, - "total_column_articles": 405, + "total_acs": 42288, + "total_submitted": 76824, + "total_column_articles": 406, "frontend_question_id": "面试题 02.08", "is_new_question": false }, @@ -7761,9 +7887,9 @@ "question__title": "Intersection of Two Linked Lists LCCI", "question__title_slug": "intersection-of-two-linked-lists-lcci", "question__hide": false, - "total_acs": 163887, - "total_submitted": 246737, - "total_column_articles": 1099, + "total_acs": 165939, + "total_submitted": 249885, + "total_column_articles": 1105, "frontend_question_id": "面试题 02.07", "is_new_question": false }, @@ -7782,8 +7908,8 @@ "question__title": "Palindrome Linked List LCCI", "question__title_slug": "palindrome-linked-list-lcci", "question__hide": false, - "total_acs": 60461, - "total_submitted": 124030, + "total_acs": 60726, + "total_submitted": 124532, "total_column_articles": 681, "frontend_question_id": "面试题 02.06", "is_new_question": false @@ -7803,9 +7929,9 @@ "question__title": "Remove Duplicate Node LCCI", "question__title_slug": "remove-duplicate-node-lcci", "question__hide": false, - "total_acs": 90234, - "total_submitted": 135013, - "total_column_articles": 875, + "total_acs": 90574, + "total_submitted": 135575, + "total_column_articles": 877, "frontend_question_id": "面试题 02.01", "is_new_question": false }, @@ -7824,9 +7950,9 @@ "question__title": "String Rotation LCCI", "question__title_slug": "string-rotation-lcci", "question__hide": false, - "total_acs": 85318, - "total_submitted": 157463, - "total_column_articles": 845, + "total_acs": 85677, + "total_submitted": 158139, + "total_column_articles": 848, "frontend_question_id": "面试题 01.09", "is_new_question": false }, @@ -7845,9 +7971,9 @@ "question__title": "Compress String LCCI", "question__title_slug": "compress-string-lcci", "question__hide": false, - "total_acs": 106099, - "total_submitted": 229537, - "total_column_articles": 1454, + "total_acs": 106501, + "total_submitted": 230383, + "total_column_articles": 1459, "frontend_question_id": "面试题 01.06", "is_new_question": false }, @@ -7866,9 +7992,9 @@ "question__title": "String to URL LCCI", "question__title_slug": "string-to-url-lcci", "question__hide": false, - "total_acs": 74886, - "total_submitted": 130499, - "total_column_articles": 739, + "total_acs": 75256, + "total_submitted": 131143, + "total_column_articles": 741, "frontend_question_id": "面试题 01.03", "is_new_question": false }, @@ -7887,9 +8013,9 @@ "question__title": "Check Permutation LCCI", "question__title_slug": "check-permutation-lcci", "question__hide": false, - "total_acs": 127113, - "total_submitted": 193348, - "total_column_articles": 1862, + "total_acs": 127530, + "total_submitted": 194009, + "total_column_articles": 1865, "frontend_question_id": "面试题 01.02", "is_new_question": false }, @@ -7908,9 +8034,9 @@ "question__title": "Is Unique LCCI", "question__title_slug": "is-unique-lcci", "question__hide": false, - "total_acs": 151381, - "total_submitted": 213110, - "total_column_articles": 2169, + "total_acs": 152111, + "total_submitted": 214145, + "total_column_articles": 2176, "frontend_question_id": "面试题 01.01", "is_new_question": false }, @@ -7929,9 +8055,9 @@ "question__title": "Guess Numbers", "question__title_slug": "guess-numbers", "question__hide": false, - "total_acs": 97963, - "total_submitted": 115705, - "total_column_articles": 800, + "total_acs": 98180, + "total_submitted": 115963, + "total_column_articles": 801, "frontend_question_id": "LCP 01", "is_new_question": false }, @@ -7950,8 +8076,8 @@ "question__title": "Programmable Robot", "question__title_slug": "programmable-robot", "question__hide": false, - "total_acs": 15508, - "total_submitted": 66938, + "total_acs": 15548, + "total_submitted": 67057, "total_column_articles": 241, "frontend_question_id": "LCP 03", "is_new_question": false @@ -7971,9 +8097,9 @@ "question__title": "Coin Bonus", "question__title_slug": "coin-bonus", "question__hide": false, - "total_acs": 2984, - "total_submitted": 13448, - "total_column_articles": 67, + "total_acs": 3008, + "total_submitted": 13567, + "total_column_articles": 68, "frontend_question_id": "LCP 05", "is_new_question": false }, @@ -7992,8 +8118,8 @@ "question__title": "Broken Board Dominoes", "question__title_slug": "broken-board-dominoes", "question__hide": false, - "total_acs": 4038, - "total_submitted": 9838, + "total_acs": 4073, + "total_submitted": 9953, "total_column_articles": 92, "frontend_question_id": "LCP 04", "is_new_question": false @@ -8013,9 +8139,9 @@ "question__title": "Deep Dark Fraction", "question__title_slug": "deep-dark-fraction", "question__hide": false, - "total_acs": 19462, - "total_submitted": 27775, - "total_column_articles": 327, + "total_acs": 19524, + "total_submitted": 27849, + "total_column_articles": 328, "frontend_question_id": "LCP 02", "is_new_question": false }, @@ -8030,14 +8156,14 @@ }, { "stat": { - "question_id": 2815, - "question__title": "Find Maximal Uncovered Ranges", - "question__title_slug": "find-maximal-uncovered-ranges", + "question_id": 2842, + "question__title": "Find Active Users", + "question__title_slug": "find-active-users", "question__hide": false, - "total_acs": 29, - "total_submitted": 48, + "total_acs": 14, + "total_submitted": 22, "total_column_articles": 2, - "frontend_question_id": "2655", + "frontend_question_id": "2688", "is_new_question": true }, "status": null, @@ -8049,15 +8175,330 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2841, + "question__title": "Bikes Last Time Used ", + "question__title_slug": "bikes-last-time-used", + "question__hide": false, + "total_acs": 21, + "total_submitted": 21, + "total_column_articles": 1, + "frontend_question_id": "2687", + "is_new_question": true + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2840, + "question__title": "Immediate Food Delivery III", + "question__title_slug": "immediate-food-delivery-iii", + "question__hide": false, + "total_acs": 17, + "total_submitted": 20, + "total_column_articles": 2, + "frontend_question_id": "2686", + "is_new_question": true + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2835, + "question__title": "Split a Circular Linked List", + "question__title_slug": "split-a-circular-linked-list", + "question__hide": false, + "total_acs": 36, + "total_submitted": 37, + "total_column_articles": 2, + "frontend_question_id": "2674", + "is_new_question": true + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2830, + "question__title": "Count Artist Occurrences On Spotify Ranking List", + "question__title_slug": "count-artist-occurrences-on-spotify-ranking-list", + "question__hide": false, + "total_acs": 70, + "total_submitted": 86, + "total_column_articles": 2, + "frontend_question_id": "2669", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2829, + "question__title": "Find Latest Salaries", + "question__title_slug": "find-latest-salaries", + "question__hide": false, + "total_acs": 79, + "total_submitted": 109, + "total_column_articles": 4, + "frontend_question_id": "2668", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2823, + "question__title": "The Knight’s Tour", + "question__title_slug": "the-knights-tour", + "question__hide": false, + "total_acs": 45, + "total_submitted": 69, + "total_column_articles": 4, + "frontend_question_id": "2664", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2815, + "question__title": "Find Maximal Uncovered Ranges", + "question__title_slug": "find-maximal-uncovered-ranges", + "question__hide": false, + "total_acs": 47, + "total_submitted": 76, + "total_column_articles": 2, + "frontend_question_id": "2655", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2809, + "question__title": "Create Hello World Function", + "question__title_slug": "create-hello-world-function", + "question__hide": false, + "total_acs": 518, + "total_submitted": 582, + "total_column_articles": 4, + "frontend_question_id": "2667", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2798, + "question__title": "Chunk Array", + "question__title_slug": "chunk-array", + "question__hide": false, + "total_acs": 148, + "total_submitted": 200, + "total_column_articles": 7, + "frontend_question_id": "2677", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2796, + "question__title": "Allow One Function Call", + "question__title_slug": "allow-one-function-call", + "question__hide": false, + "total_acs": 316, + "total_submitted": 384, + "total_column_articles": 11, + "frontend_question_id": "2666", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2794, + "question__title": "Maximum Number of Moves in a Grid", + "question__title_slug": "maximum-number-of-moves-in-a-grid", + "question__hide": false, + "total_acs": 4043, + "total_submitted": 10188, + "total_column_articles": 42, + "frontend_question_id": "2684", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2793, + "question__title": "Count the Number of Complete Components", + "question__title_slug": "count-the-number-of-complete-components", + "question__hide": false, + "total_acs": 3073, + "total_submitted": 4609, + "total_column_articles": 36, + "frontend_question_id": "2685", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2792, + "question__title": "Neighboring Bitwise XOR", + "question__title_slug": "neighboring-bitwise-xor", + "question__hide": false, + "total_acs": 4204, + "total_submitted": 6235, + "total_column_articles": 36, + "frontend_question_id": "2683", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2791, + "question__title": "Find the Losers of the Circular Game", + "question__title_slug": "find-the-losers-of-the-circular-game", + "question__hide": false, + "total_acs": 4571, + "total_submitted": 8341, + "total_column_articles": 23, + "frontend_question_id": "2682", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2789, + "question__title": "Counter II", + "question__title_slug": "counter-ii", + "question__hide": false, + "total_acs": 402, + "total_submitted": 512, + "total_column_articles": 9, + "frontend_question_id": "2665", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2788, "question__title": "Design Cancellable Function", "question__title_slug": "design-cancellable-function", "question__hide": false, - "total_acs": 132, - "total_submitted": 265, - "total_column_articles": 10, + "total_acs": 185, + "total_submitted": 360, + "total_column_articles": 12, "frontend_question_id": "2650", "is_new_question": false }, @@ -8070,15 +8511,36 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2784, + "question__title": "Power of Heroes", + "question__title_slug": "power-of-heroes", + "question__hide": false, + "total_acs": 1576, + "total_submitted": 4698, + "total_column_articles": 22, + "frontend_question_id": "2681", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2783, "question__title": "Nested Array Generator", "question__title_slug": "nested-array-generator", "question__hide": false, - "total_acs": 225, - "total_submitted": 285, - "total_column_articles": 11, + "total_acs": 354, + "total_submitted": 459, + "total_column_articles": 15, "frontend_question_id": "2649", "is_new_question": false }, @@ -8091,15 +8553,99 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2780, + "question__title": "Make Costs of Paths Equal in a Binary Tree", + "question__title_slug": "make-costs-of-paths-equal-in-a-binary-tree", + "question__hide": false, + "total_acs": 3654, + "total_submitted": 5523, + "total_column_articles": 59, + "frontend_question_id": "2673", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2779, + "question__title": "Number of Adjacent Elements With the Same Color", + "question__title_slug": "number-of-adjacent-elements-with-the-same-color", + "question__hide": false, + "total_acs": 4265, + "total_submitted": 7308, + "total_column_articles": 43, + "frontend_question_id": "2672", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2778, + "question__title": "Frequency Tracker", + "question__title_slug": "frequency-tracker", + "question__hide": false, + "total_acs": 4948, + "total_submitted": 15435, + "total_column_articles": 49, + "frontend_question_id": "2671", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2777, + "question__title": "Find the Distinct Difference Array", + "question__title_slug": "find-the-distinct-difference-array", + "question__hide": false, + "total_acs": 5723, + "total_submitted": 7357, + "total_column_articles": 44, + "frontend_question_id": "2670", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2775, "question__title": "Generate Fibonacci Sequence", "question__title_slug": "generate-fibonacci-sequence", "question__hide": false, - "total_acs": 452, - "total_submitted": 521, - "total_column_articles": 19, + "total_acs": 708, + "total_submitted": 821, + "total_column_articles": 20, "frontend_question_id": "2648", "is_new_question": false }, @@ -8112,15 +8658,57 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2771, + "question__title": "Throttle", + "question__title_slug": "throttle", + "question__hide": false, + "total_acs": 86, + "total_submitted": 182, + "total_column_articles": 3, + "frontend_question_id": "2676", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2769, + "question__title": "Array of Objects to Matrix", + "question__title_slug": "array-of-objects-to-matrix", + "question__hide": false, + "total_acs": 50, + "total_submitted": 80, + "total_column_articles": 3, + "frontend_question_id": "2675", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2767, "question__title": "Maximum Sum With Exactly K Elements ", "question__title_slug": "maximum-sum-with-exactly-k-elements", "question__hide": false, - "total_acs": 2616, - "total_submitted": 2946, - "total_column_articles": 25, + "total_acs": 3679, + "total_submitted": 4307, + "total_column_articles": 34, "frontend_question_id": "2656", "is_new_question": false }, @@ -8139,9 +8727,9 @@ "question__title": "Find the Prefix Common Array of Two Arrays", "question__title_slug": "find-the-prefix-common-array-of-two-arrays", "question__hide": false, - "total_acs": 2421, - "total_submitted": 2865, - "total_column_articles": 24, + "total_acs": 3074, + "total_submitted": 3651, + "total_column_articles": 30, "frontend_question_id": "2657", "is_new_question": false }, @@ -8160,9 +8748,9 @@ "question__title": "Make Array Empty", "question__title_slug": "make-array-empty", "question__hide": false, - "total_acs": 1362, - "total_submitted": 4015, - "total_column_articles": 18, + "total_acs": 1815, + "total_submitted": 4863, + "total_column_articles": 25, "frontend_question_id": "2659", "is_new_question": false }, @@ -8181,9 +8769,9 @@ "question__title": "Maximum Number of Fish in a Grid", "question__title_slug": "maximum-number-of-fish-in-a-grid", "question__hide": false, - "total_acs": 2170, - "total_submitted": 3617, - "total_column_articles": 27, + "total_acs": 2864, + "total_submitted": 4769, + "total_column_articles": 33, "frontend_question_id": "2658", "is_new_question": false }, @@ -8202,9 +8790,9 @@ "question__title": "Cache With Time Limit", "question__title_slug": "cache-with-time-limit", "question__hide": false, - "total_acs": 421, - "total_submitted": 695, - "total_column_articles": 19, + "total_acs": 649, + "total_submitted": 1137, + "total_column_articles": 29, "frontend_question_id": "2622", "is_new_question": false }, @@ -8223,9 +8811,9 @@ "question__title": "Array Reduce Transformation", "question__title_slug": "array-reduce-transformation", "question__hide": false, - "total_acs": 703, - "total_submitted": 860, - "total_column_articles": 20, + "total_acs": 1115, + "total_submitted": 1384, + "total_column_articles": 22, "frontend_question_id": "2626", "is_new_question": false }, @@ -8244,9 +8832,9 @@ "question__title": "Snail Traversal", "question__title_slug": "snail-traversal", "question__hide": false, - "total_acs": 399, - "total_submitted": 534, - "total_column_articles": 26, + "total_acs": 639, + "total_submitted": 896, + "total_column_articles": 35, "frontend_question_id": "2624", "is_new_question": false }, @@ -8265,9 +8853,9 @@ "question__title": "Flatten Deeply Nested Array", "question__title_slug": "flatten-deeply-nested-array", "question__hide": false, - "total_acs": 586, - "total_submitted": 1145, - "total_column_articles": 25, + "total_acs": 920, + "total_submitted": 1766, + "total_column_articles": 33, "frontend_question_id": "2625", "is_new_question": false }, @@ -8286,9 +8874,9 @@ "question__title": "Check if Object Instance of Class", "question__title_slug": "check-if-object-instance-of-class", "question__hide": false, - "total_acs": 821, - "total_submitted": 2599, - "total_column_articles": 17, + "total_acs": 1272, + "total_submitted": 3977, + "total_column_articles": 24, "frontend_question_id": "2618", "is_new_question": false }, @@ -8307,9 +8895,9 @@ "question__title": "Minimum Number of Operations to Make All Array Elements Equal to 1", "question__title_slug": "minimum-number-of-operations-to-make-all-array-elements-equal-to-1", "question__hide": false, - "total_acs": 3022, - "total_submitted": 7729, - "total_column_articles": 25, + "total_acs": 3202, + "total_submitted": 8026, + "total_column_articles": 26, "frontend_question_id": "2654", "is_new_question": false }, @@ -8328,9 +8916,9 @@ "question__title": "Sum Multiples", "question__title_slug": "sum-multiples", "question__hide": false, - "total_acs": 5702, - "total_submitted": 6723, - "total_column_articles": 30, + "total_acs": 6140, + "total_submitted": 7280, + "total_column_articles": 35, "frontend_question_id": "2652", "is_new_question": false }, @@ -8349,9 +8937,9 @@ "question__title": "Sliding Subarray Beauty", "question__title_slug": "sliding-subarray-beauty", "question__hide": false, - "total_acs": 4206, - "total_submitted": 12403, - "total_column_articles": 55, + "total_acs": 4425, + "total_submitted": 12852, + "total_column_articles": 59, "frontend_question_id": "2653", "is_new_question": false }, @@ -8370,9 +8958,9 @@ "question__title": "Promise Pool", "question__title_slug": "promise-pool", "question__hide": false, - "total_acs": 316, - "total_submitted": 528, - "total_column_articles": 12, + "total_acs": 455, + "total_submitted": 759, + "total_column_articles": 15, "frontend_question_id": "2636", "is_new_question": false }, @@ -8391,9 +8979,9 @@ "question__title": "Promise Time Limit", "question__title_slug": "promise-time-limit", "question__hide": false, - "total_acs": 387, - "total_submitted": 554, - "total_column_articles": 13, + "total_acs": 621, + "total_submitted": 1007, + "total_column_articles": 14, "frontend_question_id": "2637", "is_new_question": false }, @@ -8412,9 +9000,9 @@ "question__title": "Calculate Delayed Arrival Time", "question__title_slug": "calculate-delayed-arrival-time", "question__hide": false, - "total_acs": 6179, - "total_submitted": 6924, - "total_column_articles": 23, + "total_acs": 7032, + "total_submitted": 8009, + "total_column_articles": 25, "frontend_question_id": "2651", "is_new_question": false }, @@ -8433,9 +9021,9 @@ "question__title": "Apply Transform Over Each Element in Array", "question__title_slug": "apply-transform-over-each-element-in-array", "question__hide": false, - "total_acs": 563, - "total_submitted": 713, - "total_column_articles": 14, + "total_acs": 905, + "total_submitted": 1223, + "total_column_articles": 17, "frontend_question_id": "2635", "is_new_question": false }, @@ -8454,9 +9042,9 @@ "question__title": "Filter Elements from Array", "question__title_slug": "filter-elements-from-array", "question__hide": false, - "total_acs": 607, - "total_submitted": 894, - "total_column_articles": 17, + "total_acs": 999, + "total_submitted": 1503, + "total_column_articles": 21, "frontend_question_id": "2634", "is_new_question": false }, @@ -8475,9 +9063,9 @@ "question__title": "Convert Object to JSON String", "question__title_slug": "convert-object-to-json-string", "question__hide": false, - "total_acs": 314, - "total_submitted": 515, - "total_column_articles": 16, + "total_acs": 445, + "total_submitted": 771, + "total_column_articles": 22, "frontend_question_id": "2633", "is_new_question": false }, @@ -8496,9 +9084,9 @@ "question__title": "Memoize II", "question__title_slug": "memoize-ii", "question__hide": false, - "total_acs": 235, - "total_submitted": 430, - "total_column_articles": 10, + "total_acs": 327, + "total_submitted": 642, + "total_column_articles": 13, "frontend_question_id": "2630", "is_new_question": false }, @@ -8517,9 +9105,9 @@ "question__title": "Debounce", "question__title_slug": "debounce", "question__hide": false, - "total_acs": 460, - "total_submitted": 579, - "total_column_articles": 15, + "total_acs": 700, + "total_submitted": 882, + "total_column_articles": 17, "frontend_question_id": "2627", "is_new_question": false }, @@ -8538,9 +9126,9 @@ "question__title": "Group By", "question__title_slug": "group-by", "question__hide": false, - "total_acs": 371, - "total_submitted": 451, - "total_column_articles": 13, + "total_acs": 547, + "total_submitted": 669, + "total_column_articles": 16, "frontend_question_id": "2631", "is_new_question": false }, @@ -8559,9 +9147,9 @@ "question__title": "Function Composition", "question__title_slug": "function-composition", "question__hide": false, - "total_acs": 619, - "total_submitted": 749, - "total_column_articles": 19, + "total_acs": 988, + "total_submitted": 1270, + "total_column_articles": 22, "frontend_question_id": "2629", "is_new_question": false }, @@ -8580,9 +9168,9 @@ "question__title": "Curry", "question__title_slug": "curry", "question__hide": false, - "total_acs": 391, - "total_submitted": 454, - "total_column_articles": 14, + "total_acs": 628, + "total_submitted": 765, + "total_column_articles": 18, "frontend_question_id": "2632", "is_new_question": false }, @@ -8601,8 +9189,8 @@ "question__title": "Minimize the Total Price of the Trips", "question__title_slug": "minimize-the-total-price-of-the-trips", "question__hide": false, - "total_acs": 2800, - "total_submitted": 5782, + "total_acs": 2878, + "total_submitted": 5900, "total_column_articles": 48, "frontend_question_id": "2646", "is_new_question": false @@ -8622,8 +9210,8 @@ "question__title": "Count the Number of K-Free Subsets", "question__title_slug": "count-the-number-of-k-free-subsets", "question__hide": false, - "total_acs": 53, - "total_submitted": 90, + "total_acs": 61, + "total_submitted": 103, "total_column_articles": 2, "frontend_question_id": "2638", "is_new_question": false @@ -8643,9 +9231,9 @@ "question__title": "Row With Maximum Ones", "question__title_slug": "row-with-maximum-ones", "question__hide": false, - "total_acs": 6933, - "total_submitted": 8625, - "total_column_articles": 29, + "total_acs": 7154, + "total_submitted": 8916, + "total_column_articles": 30, "frontend_question_id": "2643", "is_new_question": false }, @@ -8664,9 +9252,9 @@ "question__title": "Minimum Additions to Make Valid String", "question__title_slug": "minimum-additions-to-make-valid-string", "question__hide": false, - "total_acs": 6402, - "total_submitted": 11412, - "total_column_articles": 96, + "total_acs": 6531, + "total_submitted": 11616, + "total_column_articles": 98, "frontend_question_id": "2645", "is_new_question": false }, @@ -8685,9 +9273,9 @@ "question__title": "JSON Deep Equal", "question__title_slug": "json-deep-equal", "question__hide": false, - "total_acs": 366, - "total_submitted": 1128, - "total_column_articles": 20, + "total_acs": 573, + "total_submitted": 1786, + "total_column_articles": 26, "frontend_question_id": "2628", "is_new_question": false }, @@ -8706,9 +9294,9 @@ "question__title": "Array Prototype Last", "question__title_slug": "array-prototype-last", "question__hide": false, - "total_acs": 1866, - "total_submitted": 2414, - "total_column_articles": 26, + "total_acs": 3162, + "total_submitted": 4214, + "total_column_articles": 33, "frontend_question_id": "2619", "is_new_question": false }, @@ -8727,9 +9315,9 @@ "question__title": "Sleep", "question__title_slug": "sleep", "question__hide": false, - "total_acs": 1235, - "total_submitted": 1443, - "total_column_articles": 19, + "total_acs": 2028, + "total_submitted": 2378, + "total_column_articles": 22, "frontend_question_id": "2621", "is_new_question": false }, @@ -8748,9 +9336,9 @@ "question__title": "Counter", "question__title_slug": "counter", "question__hide": false, - "total_acs": 1863, - "total_submitted": 2176, - "total_column_articles": 21, + "total_acs": 2970, + "total_submitted": 3555, + "total_column_articles": 27, "frontend_question_id": "2620", "is_new_question": false }, @@ -8769,9 +9357,9 @@ "question__title": "Memoize", "question__title_slug": "memoize", "question__hide": false, - "total_acs": 476, - "total_submitted": 664, - "total_column_articles": 14, + "total_acs": 708, + "total_submitted": 1029, + "total_column_articles": 18, "frontend_question_id": "2623", "is_new_question": false }, @@ -8784,14 +9372,77 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2730, + "question__title": "Maximum OR", + "question__title_slug": "maximum-or", + "question__hide": false, + "total_acs": 1969, + "total_submitted": 4665, + "total_column_articles": 27, + "frontend_question_id": "2680", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2728, + "question__title": "Sum in a Matrix", + "question__title_slug": "sum-in-a-matrix", + "question__hide": false, + "total_acs": 2651, + "total_submitted": 3562, + "total_column_articles": 19, + "frontend_question_id": "2679", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2727, + "question__title": "Number of Senior Citizens", + "question__title_slug": "number-of-senior-citizens", + "question__hide": false, + "total_acs": 2811, + "total_submitted": 3266, + "total_column_articles": 18, + "frontend_question_id": "2678", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2726, "question__title": "Minimum Reverse Operations", "question__title_slug": "minimum-reverse-operations", "question__hide": false, - "total_acs": 2201, - "total_submitted": 10928, + "total_acs": 2258, + "total_submitted": 11153, "total_column_articles": 31, "frontend_question_id": "2612", "is_new_question": false @@ -8811,9 +9462,9 @@ "question__title": "Mice and Cheese", "question__title_slug": "mice-and-cheese", "question__hide": false, - "total_acs": 6103, - "total_submitted": 12849, - "total_column_articles": 58, + "total_acs": 6213, + "total_submitted": 13037, + "total_column_articles": 60, "frontend_question_id": "2611", "is_new_question": false }, @@ -8832,9 +9483,9 @@ "question__title": "Convert an Array Into a 2D Array With Conditions", "question__title_slug": "convert-an-array-into-a-2d-array-with-conditions", "question__hide": false, - "total_acs": 7082, - "total_submitted": 8320, - "total_column_articles": 79, + "total_acs": 7242, + "total_submitted": 8515, + "total_column_articles": 80, "frontend_question_id": "2610", "is_new_question": false }, @@ -8853,9 +9504,9 @@ "question__title": "Find the Longest Balanced Substring of a Binary String", "question__title_slug": "find-the-longest-balanced-substring-of-a-binary-string", "question__hide": false, - "total_acs": 7509, - "total_submitted": 15315, - "total_column_articles": 90, + "total_acs": 7653, + "total_submitted": 15583, + "total_column_articles": 91, "frontend_question_id": "2609", "is_new_question": false }, @@ -8874,9 +9525,9 @@ "question__title": "Prime In Diagonal", "question__title_slug": "prime-in-diagonal", "question__hide": false, - "total_acs": 7175, - "total_submitted": 22208, - "total_column_articles": 45, + "total_acs": 7321, + "total_submitted": 22559, + "total_column_articles": 47, "frontend_question_id": "2614", "is_new_question": false }, @@ -8895,9 +9546,9 @@ "question__title": "Sum of Distances", "question__title_slug": "sum-of-distances", "question__hide": false, - "total_acs": 5123, - "total_submitted": 14666, - "total_column_articles": 61, + "total_acs": 5226, + "total_submitted": 14870, + "total_column_articles": 62, "frontend_question_id": "2615", "is_new_question": false }, @@ -8916,8 +9567,8 @@ "question__title": "Minimize the Maximum Difference of Pairs", "question__title_slug": "minimize-the-maximum-difference-of-pairs", "question__hide": false, - "total_acs": 3409, - "total_submitted": 8881, + "total_acs": 3473, + "total_submitted": 9013, "total_column_articles": 31, "frontend_question_id": "2616", "is_new_question": false @@ -8937,8 +9588,8 @@ "question__title": "Beautiful Pairs", "question__title_slug": "beautiful-pairs", "question__hide": false, - "total_acs": 35, - "total_submitted": 86, + "total_acs": 39, + "total_submitted": 92, "total_column_articles": 2, "frontend_question_id": "2613", "is_new_question": false @@ -8958,9 +9609,9 @@ "question__title": "Minimum Operations to Make All Array Elements Equal", "question__title_slug": "minimum-operations-to-make-all-array-elements-equal", "question__hide": false, - "total_acs": 6293, - "total_submitted": 18985, - "total_column_articles": 98, + "total_acs": 6364, + "total_submitted": 19217, + "total_column_articles": 97, "frontend_question_id": "2602", "is_new_question": false }, @@ -8979,8 +9630,8 @@ "question__title": "Collect Coins in a Tree", "question__title_slug": "collect-coins-in-a-tree", "question__hide": false, - "total_acs": 2341, - "total_submitted": 5420, + "total_acs": 2389, + "total_submitted": 5520, "total_column_articles": 41, "frontend_question_id": "2603", "is_new_question": false @@ -9000,9 +9651,9 @@ "question__title": "Prime Subtraction Operation", "question__title_slug": "prime-subtraction-operation", "question__hide": false, - "total_acs": 6757, - "total_submitted": 17613, - "total_column_articles": 84, + "total_acs": 6819, + "total_submitted": 17768, + "total_column_articles": 85, "frontend_question_id": "2601", "is_new_question": false }, @@ -9021,8 +9672,8 @@ "question__title": "K Items With the Maximum Sum", "question__title_slug": "k-items-with-the-maximum-sum", "question__hide": false, - "total_acs": 8489, - "total_submitted": 12905, + "total_acs": 8686, + "total_submitted": 13196, "total_column_articles": 52, "frontend_question_id": "2600", "is_new_question": false @@ -9042,9 +9693,9 @@ "question__title": "Left and Right Sum Differences", "question__title_slug": "left-and-right-sum-differences", "question__hide": false, - "total_acs": 10230, - "total_submitted": 12015, - "total_column_articles": 96, + "total_acs": 10416, + "total_submitted": 12231, + "total_column_articles": 97, "frontend_question_id": "2574", "is_new_question": false }, @@ -9063,9 +9714,9 @@ "question__title": "Find the Divisibility Array of a String", "question__title_slug": "find-the-divisibility-array-of-a-string", "question__hide": false, - "total_acs": 7453, - "total_submitted": 22878, - "total_column_articles": 72, + "total_acs": 7530, + "total_submitted": 23040, + "total_column_articles": 74, "frontend_question_id": "2575", "is_new_question": false }, @@ -9084,8 +9735,8 @@ "question__title": "Find the Maximum Number of Marked Indices", "question__title_slug": "find-the-maximum-number-of-marked-indices", "question__hide": false, - "total_acs": 6218, - "total_submitted": 17071, + "total_acs": 6260, + "total_submitted": 17152, "total_column_articles": 72, "frontend_question_id": "2576", "is_new_question": false @@ -9105,8 +9756,8 @@ "question__title": "Minimum Time to Visit a Cell In a Grid", "question__title_slug": "minimum-time-to-visit-a-cell-in-a-grid", "question__hide": false, - "total_acs": 3512, - "total_submitted": 9017, + "total_acs": 3552, + "total_submitted": 9100, "total_column_articles": 42, "frontend_question_id": "2577", "is_new_question": false @@ -9126,9 +9777,9 @@ "question__title": "Minimum Operations to Reduce an Integer to 0", "question__title_slug": "minimum-operations-to-reduce-an-integer-to-0", "question__hide": false, - "total_acs": 6809, - "total_submitted": 12668, - "total_column_articles": 114, + "total_acs": 6865, + "total_submitted": 12763, + "total_column_articles": 116, "frontend_question_id": "2571", "is_new_question": false }, @@ -9147,8 +9798,8 @@ "question__title": "Count the Number of Square-Free Subsets", "question__title_slug": "count-the-number-of-square-free-subsets", "question__hide": false, - "total_acs": 3236, - "total_submitted": 11386, + "total_acs": 3260, + "total_submitted": 11453, "total_column_articles": 42, "frontend_question_id": "2572", "is_new_question": false @@ -9168,8 +9819,8 @@ "question__title": "Find the String with LCP", "question__title_slug": "find-the-string-with-lcp", "question__hide": false, - "total_acs": 1687, - "total_submitted": 4823, + "total_acs": 1712, + "total_submitted": 4870, "total_column_articles": 31, "frontend_question_id": "2573", "is_new_question": false @@ -9189,9 +9840,9 @@ "question__title": "Merge Two 2D Arrays by Summing Values", "question__title_slug": "merge-two-2d-arrays-by-summing-values", "question__hide": false, - "total_acs": 7940, - "total_submitted": 11439, - "total_column_articles": 63, + "total_acs": 8036, + "total_submitted": 11582, + "total_column_articles": 64, "frontend_question_id": "2570", "is_new_question": false }, @@ -9210,8 +9861,8 @@ "question__title": "Minimum Score by Changing Two Elements", "question__title_slug": "minimum-score-by-changing-two-elements", "question__hide": false, - "total_acs": 3628, - "total_submitted": 7053, + "total_acs": 3679, + "total_submitted": 7142, "total_column_articles": 36, "frontend_question_id": "2567", "is_new_question": false @@ -9231,9 +9882,9 @@ "question__title": "Minimum Impossible OR", "question__title_slug": "minimum-impossible-or", "question__hide": false, - "total_acs": 3309, - "total_submitted": 5584, - "total_column_articles": 26, + "total_acs": 3347, + "total_submitted": 5642, + "total_column_articles": 27, "frontend_question_id": "2568", "is_new_question": false }, @@ -9252,8 +9903,8 @@ "question__title": "Maximum Difference by Remapping a Digit", "question__title_slug": "maximum-difference-by-remapping-a-digit", "question__hide": false, - "total_acs": 4675, - "total_submitted": 7326, + "total_acs": 4755, + "total_submitted": 7450, "total_column_articles": 47, "frontend_question_id": "2566", "is_new_question": false @@ -9273,8 +9924,8 @@ "question__title": "Handling Sum Queries After Update", "question__title_slug": "handling-sum-queries-after-update", "question__hide": false, - "total_acs": 2407, - "total_submitted": 6250, + "total_acs": 2456, + "total_submitted": 6393, "total_column_articles": 42, "frontend_question_id": "2569", "is_new_question": false @@ -9294,8 +9945,8 @@ "question__title": "Maximum Number of Integers to Choose From a Range II", "question__title_slug": "maximum-number-of-integers-to-choose-from-a-range-ii", "question__hide": false, - "total_acs": 144, - "total_submitted": 326, + "total_acs": 150, + "total_submitted": 341, "total_column_articles": 6, "frontend_question_id": "2557", "is_new_question": false @@ -9315,8 +9966,8 @@ "question__title": "Subsequence With the Minimum Score", "question__title_slug": "subsequence-with-the-minimum-score", "question__hide": false, - "total_acs": 2663, - "total_submitted": 7474, + "total_acs": 2698, + "total_submitted": 7553, "total_column_articles": 34, "frontend_question_id": "2565", "is_new_question": false @@ -9336,8 +9987,8 @@ "question__title": "Substring XOR Queries", "question__title_slug": "substring-xor-queries", "question__hide": false, - "total_acs": 4580, - "total_submitted": 12624, + "total_acs": 4602, + "total_submitted": 12670, "total_column_articles": 59, "frontend_question_id": "2564", "is_new_question": false @@ -9357,9 +10008,9 @@ "question__title": "Count the Number of Fair Pairs", "question__title_slug": "count-the-number-of-fair-pairs", "question__hide": false, - "total_acs": 6496, - "total_submitted": 19479, - "total_column_articles": 74, + "total_acs": 6544, + "total_submitted": 19613, + "total_column_articles": 75, "frontend_question_id": "2563", "is_new_question": false }, @@ -9378,8 +10029,8 @@ "question__title": "Find the Array Concatenation Value", "question__title_slug": "find-the-array-concatenation-value", "question__hide": false, - "total_acs": 7919, - "total_submitted": 10788, + "total_acs": 8002, + "total_submitted": 10910, "total_column_articles": 73, "frontend_question_id": "2562", "is_new_question": false @@ -9399,9 +10050,9 @@ "question__title": "Minimum Number of Visited Cells in a Grid", "question__title_slug": "minimum-number-of-visited-cells-in-a-grid", "question__hide": false, - "total_acs": 3152, - "total_submitted": 9603, - "total_column_articles": 60, + "total_acs": 3200, + "total_submitted": 9843, + "total_column_articles": 61, "frontend_question_id": "2617", "is_new_question": false }, @@ -9420,9 +10071,9 @@ "question__title": "The Number of Beautiful Subsets", "question__title_slug": "the-number-of-beautiful-subsets", "question__hide": false, - "total_acs": 6515, - "total_submitted": 18909, - "total_column_articles": 52, + "total_acs": 6572, + "total_submitted": 19025, + "total_column_articles": 53, "frontend_question_id": "2597", "is_new_question": false }, @@ -9441,8 +10092,8 @@ "question__title": "Find Score of an Array After Marking All Elements", "question__title_slug": "find-score-of-an-array-after-marking-all-elements", "question__hide": false, - "total_acs": 3895, - "total_submitted": 7537, + "total_acs": 3919, + "total_submitted": 7585, "total_column_articles": 49, "frontend_question_id": "2593", "is_new_question": false @@ -9462,8 +10113,8 @@ "question__title": "Find the Maximum Divisibility Score", "question__title_slug": "find-the-maximum-divisibility-score", "question__hide": false, - "total_acs": 6358, - "total_submitted": 12586, + "total_acs": 6479, + "total_submitted": 12815, "total_column_articles": 26, "frontend_question_id": "2644", "is_new_question": false @@ -9483,8 +10134,8 @@ "question__title": "Maximum Price to Fill a Bag", "question__title_slug": "maximum-price-to-fill-a-bag", "question__hide": false, - "total_acs": 76, - "total_submitted": 110, + "total_acs": 81, + "total_submitted": 126, "total_column_articles": 3, "frontend_question_id": "2548", "is_new_question": false @@ -9504,8 +10155,8 @@ "question__title": "Take Gifts From the Richest Pile", "question__title_slug": "take-gifts-from-the-richest-pile", "question__hide": false, - "total_acs": 7274, - "total_submitted": 10674, + "total_acs": 7371, + "total_submitted": 10803, "total_column_articles": 65, "frontend_question_id": "2558", "is_new_question": false @@ -9525,8 +10176,8 @@ "question__title": "Count Vowel Strings in Ranges", "question__title_slug": "count-vowel-strings-in-ranges", "question__hide": false, - "total_acs": 6081, - "total_submitted": 11303, + "total_acs": 6134, + "total_submitted": 11377, "total_column_articles": 74, "frontend_question_id": "2559", "is_new_question": false @@ -9546,8 +10197,8 @@ "question__title": "House Robber IV", "question__title_slug": "house-robber-iv", "question__hide": false, - "total_acs": 5088, - "total_submitted": 10240, + "total_acs": 5187, + "total_submitted": 10442, "total_column_articles": 61, "frontend_question_id": "2560", "is_new_question": false @@ -9567,8 +10218,8 @@ "question__title": "Rearranging Fruits", "question__title_slug": "rearranging-fruits", "question__hide": false, - "total_acs": 2845, - "total_submitted": 7789, + "total_acs": 2866, + "total_submitted": 7881, "total_column_articles": 36, "frontend_question_id": "2561", "is_new_question": false @@ -9588,9 +10239,9 @@ "question__title": "Design a Todo List", "question__title_slug": "design-a-todo-list", "question__hide": false, - "total_acs": 51, - "total_submitted": 84, - "total_column_articles": 1, + "total_acs": 60, + "total_submitted": 95, + "total_column_articles": 2, "frontend_question_id": "2590", "is_new_question": false }, @@ -9609,9 +10260,9 @@ "question__title": "Lexicographically Smallest Beautiful String", "question__title_slug": "lexicographically-smallest-beautiful-string", "question__hide": false, - "total_acs": 1075, - "total_submitted": 2549, - "total_column_articles": 25, + "total_acs": 1491, + "total_submitted": 3379, + "total_column_articles": 31, "frontend_question_id": "2663", "is_new_question": false }, @@ -9630,9 +10281,9 @@ "question__title": "Minimum Cost of a Path With Special Roads", "question__title_slug": "minimum-cost-of-a-path-with-special-roads", "question__hide": false, - "total_acs": 2048, - "total_submitted": 6258, - "total_column_articles": 42, + "total_acs": 2833, + "total_submitted": 7897, + "total_column_articles": 49, "frontend_question_id": "2662", "is_new_question": false }, @@ -9651,9 +10302,9 @@ "question__title": "First Completely Painted Row or Column", "question__title_slug": "first-completely-painted-row-or-column", "question__hide": false, - "total_acs": 3071, - "total_submitted": 6238, - "total_column_articles": 34, + "total_acs": 4168, + "total_submitted": 8228, + "total_column_articles": 43, "frontend_question_id": "2661", "is_new_question": false }, @@ -9672,9 +10323,9 @@ "question__title": "Determine the Winner of a Bowling Game", "question__title_slug": "determine-the-winner-of-a-bowling-game", "question__hide": false, - "total_acs": 3600, - "total_submitted": 11618, - "total_column_articles": 28, + "total_acs": 4747, + "total_submitted": 14651, + "total_column_articles": 35, "frontend_question_id": "2660", "is_new_question": false }, @@ -9693,8 +10344,8 @@ "question__title": "Count the Number of Good Subsequences", "question__title_slug": "count-the-number-of-good-subsequences", "question__hide": false, - "total_acs": 154, - "total_submitted": 237, + "total_acs": 158, + "total_submitted": 244, "total_column_articles": 5, "frontend_question_id": "2539", "is_new_question": false @@ -9714,8 +10365,8 @@ "question__title": "Count Increasing Quadruplets", "question__title_slug": "count-increasing-quadruplets", "question__hide": false, - "total_acs": 2799, - "total_submitted": 6356, + "total_acs": 2826, + "total_submitted": 6430, "total_column_articles": 37, "frontend_question_id": "2552", "is_new_question": false @@ -9735,8 +10386,8 @@ "question__title": "Put Marbles in Bags", "question__title_slug": "put-marbles-in-bags", "question__hide": false, - "total_acs": 3373, - "total_submitted": 5918, + "total_acs": 3419, + "total_submitted": 5997, "total_column_articles": 37, "frontend_question_id": "2551", "is_new_question": false @@ -9756,8 +10407,8 @@ "question__title": "Count Collisions of Monkeys on a Polygon", "question__title_slug": "count-collisions-of-monkeys-on-a-polygon", "question__hide": false, - "total_acs": 5150, - "total_submitted": 17932, + "total_acs": 5186, + "total_submitted": 18049, "total_column_articles": 44, "frontend_question_id": "2550", "is_new_question": false @@ -9777,8 +10428,8 @@ "question__title": "Count Distinct Numbers on Board", "question__title_slug": "count-distinct-numbers-on-board", "question__hide": false, - "total_acs": 6672, - "total_submitted": 10615, + "total_acs": 6756, + "total_submitted": 10746, "total_column_articles": 43, "frontend_question_id": "2549", "is_new_question": false @@ -9798,9 +10449,9 @@ "question__title": "Design Graph With Shortest Path Calculator", "question__title_slug": "design-graph-with-shortest-path-calculator", "question__hide": false, - "total_acs": 3271, - "total_submitted": 6064, - "total_column_articles": 43, + "total_acs": 3426, + "total_submitted": 6282, + "total_column_articles": 44, "frontend_question_id": "2642", "is_new_question": false }, @@ -9819,8 +10470,8 @@ "question__title": "Cousins in Binary Tree II", "question__title_slug": "cousins-in-binary-tree-ii", "question__hide": false, - "total_acs": 3322, - "total_submitted": 4769, + "total_acs": 3443, + "total_submitted": 4934, "total_column_articles": 36, "frontend_question_id": "2641", "is_new_question": false @@ -9840,9 +10491,9 @@ "question__title": "Find the Score of All Prefixes of an Array", "question__title_slug": "find-the-score-of-all-prefixes-of-an-array", "question__hide": false, - "total_acs": 3792, - "total_submitted": 4694, - "total_column_articles": 28, + "total_acs": 3924, + "total_submitted": 4865, + "total_column_articles": 29, "frontend_question_id": "2640", "is_new_question": false }, @@ -9861,9 +10512,9 @@ "question__title": "Find the Width of Columns of a Grid", "question__title_slug": "find-the-width-of-columns-of-a-grid", "question__hide": false, - "total_acs": 3853, - "total_submitted": 5018, - "total_column_articles": 30, + "total_acs": 3999, + "total_submitted": 5219, + "total_column_articles": 31, "frontend_question_id": "2639", "is_new_question": false }, @@ -9882,9 +10533,9 @@ "question__title": "Make the Prefix Sum Non-negative", "question__title_slug": "make-the-prefix-sum-non-negative", "question__hide": false, - "total_acs": 69, - "total_submitted": 122, - "total_column_articles": 4, + "total_acs": 86, + "total_submitted": 154, + "total_column_articles": 5, "frontend_question_id": "2599", "is_new_question": false }, @@ -9903,8 +10554,8 @@ "question__title": "Maximize Win From Two Segments", "question__title_slug": "maximize-win-from-two-segments", "question__hide": false, - "total_acs": 2807, - "total_submitted": 7145, + "total_acs": 2857, + "total_submitted": 7259, "total_column_articles": 31, "frontend_question_id": "2555", "is_new_question": false @@ -9924,8 +10575,8 @@ "question__title": "Number of Good Binary Strings", "question__title_slug": "number-of-good-binary-strings", "question__hide": false, - "total_acs": 87, - "total_submitted": 122, + "total_acs": 92, + "total_submitted": 129, "total_column_articles": 3, "frontend_question_id": "2533", "is_new_question": false @@ -9945,9 +10596,9 @@ "question__title": "Shortest Cycle in a Graph", "question__title_slug": "shortest-cycle-in-a-graph", "question__hide": false, - "total_acs": 2561, - "total_submitted": 6347, - "total_column_articles": 29, + "total_acs": 2673, + "total_submitted": 6587, + "total_column_articles": 30, "frontend_question_id": "2608", "is_new_question": false }, @@ -9966,8 +10617,8 @@ "question__title": "Make K-Subarray Sums Equal", "question__title_slug": "make-k-subarray-sums-equal", "question__hide": false, - "total_acs": 2480, - "total_submitted": 6519, + "total_acs": 2528, + "total_submitted": 6623, "total_column_articles": 23, "frontend_question_id": "2607", "is_new_question": false @@ -9987,9 +10638,9 @@ "question__title": "Find the Substring With Maximum Cost", "question__title_slug": "find-the-substring-with-maximum-cost", "question__hide": false, - "total_acs": 3965, - "total_submitted": 7566, - "total_column_articles": 34, + "total_acs": 4061, + "total_submitted": 7726, + "total_column_articles": 36, "frontend_question_id": "2606", "is_new_question": false }, @@ -10008,9 +10659,9 @@ "question__title": "Form Smallest Number From Two Digit Arrays", "question__title_slug": "form-smallest-number-from-two-digit-arrays", "question__hide": false, - "total_acs": 4685, - "total_submitted": 7259, - "total_column_articles": 39, + "total_acs": 4866, + "total_submitted": 7581, + "total_column_articles": 41, "frontend_question_id": "2605", "is_new_question": false }, @@ -10029,8 +10680,8 @@ "question__title": "Maximum Frequency Score of a Subarray", "question__title_slug": "maximum-frequency-score-of-a-subarray", "question__hide": false, - "total_acs": 111, - "total_submitted": 217, + "total_acs": 114, + "total_submitted": 222, "total_column_articles": 3, "frontend_question_id": "2524", "is_new_question": false @@ -10050,8 +10701,8 @@ "question__title": "Minimum Time to Eat All Grains", "question__title_slug": "minimum-time-to-eat-all-grains", "question__hide": false, - "total_acs": 58, - "total_submitted": 148, + "total_acs": 70, + "total_submitted": 173, "total_column_articles": 2, "frontend_question_id": "2604", "is_new_question": false @@ -10071,8 +10722,8 @@ "question__title": "Minimum Time to Repair Cars", "question__title_slug": "minimum-time-to-repair-cars", "question__hide": false, - "total_acs": 3499, - "total_submitted": 7586, + "total_acs": 3575, + "total_submitted": 7750, "total_column_articles": 32, "frontend_question_id": "2594", "is_new_question": false @@ -10092,8 +10743,8 @@ "question__title": "Maximize Greatness of an Array", "question__title_slug": "maximize-greatness-of-an-array", "question__hide": false, - "total_acs": 4618, - "total_submitted": 8052, + "total_acs": 4688, + "total_submitted": 8169, "total_column_articles": 57, "frontend_question_id": "2592", "is_new_question": false @@ -10113,8 +10764,8 @@ "question__title": "Distribute Money to Maximum Children", "question__title_slug": "distribute-money-to-maximum-children", "question__hide": false, - "total_acs": 5084, - "total_submitted": 24883, + "total_acs": 5261, + "total_submitted": 25529, "total_column_articles": 54, "frontend_question_id": "2591", "is_new_question": false @@ -10134,9 +10785,9 @@ "question__title": "Check Knight Tour Configuration", "question__title_slug": "check-knight-tour-configuration", "question__hide": false, - "total_acs": 7368, - "total_submitted": 14030, - "total_column_articles": 96, + "total_acs": 7433, + "total_submitted": 14157, + "total_column_articles": 98, "frontend_question_id": "2596", "is_new_question": false }, @@ -10155,8 +10806,8 @@ "question__title": "Smallest Missing Non-negative Integer After Operations", "question__title_slug": "smallest-missing-non-negative-integer-after-operations", "question__hide": false, - "total_acs": 4899, - "total_submitted": 12591, + "total_acs": 4964, + "total_submitted": 12697, "total_column_articles": 53, "frontend_question_id": "2598", "is_new_question": false @@ -10176,9 +10827,9 @@ "question__title": "Number of Even and Odd Bits", "question__title_slug": "number-of-even-and-odd-bits", "question__hide": false, - "total_acs": 8912, - "total_submitted": 12258, - "total_column_articles": 55, + "total_acs": 9041, + "total_submitted": 12438, + "total_column_articles": 56, "frontend_question_id": "2595", "is_new_question": false }, @@ -10197,8 +10848,8 @@ "question__title": "Count the Number of K-Big Indices", "question__title_slug": "count-the-number-of-k-big-indices", "question__hide": false, - "total_acs": 137, - "total_submitted": 171, + "total_acs": 146, + "total_submitted": 185, "total_column_articles": 10, "frontend_question_id": "2519", "is_new_question": false @@ -10218,8 +10869,8 @@ "question__title": "Minimum Time to Complete All Tasks", "question__title_slug": "minimum-time-to-complete-all-tasks", "question__hide": false, - "total_acs": 3553, - "total_submitted": 8478, + "total_acs": 3717, + "total_submitted": 8781, "total_column_articles": 34, "frontend_question_id": "2589", "is_new_question": false @@ -10239,8 +10890,8 @@ "question__title": "Count the Number of Beautiful Subarrays", "question__title_slug": "count-the-number-of-beautiful-subarrays", "question__hide": false, - "total_acs": 5902, - "total_submitted": 14181, + "total_acs": 5925, + "total_submitted": 14223, "total_column_articles": 59, "frontend_question_id": "2588", "is_new_question": false @@ -10260,9 +10911,9 @@ "question__title": "Rearrange Array to Maximize Prefix Score", "question__title_slug": "rearrange-array-to-maximize-prefix-score", "question__hide": false, - "total_acs": 8075, - "total_submitted": 19973, - "total_column_articles": 42, + "total_acs": 8126, + "total_submitted": 20073, + "total_column_articles": 43, "frontend_question_id": "2587", "is_new_question": false }, @@ -10281,9 +10932,9 @@ "question__title": "Count the Number of Vowel Strings in Range", "question__title_slug": "count-the-number-of-vowel-strings-in-range", "question__hide": false, - "total_acs": 9257, - "total_submitted": 11310, - "total_column_articles": 47, + "total_acs": 9458, + "total_submitted": 11549, + "total_column_articles": 49, "frontend_question_id": "2586", "is_new_question": false }, @@ -10302,8 +10953,8 @@ "question__title": "Check if There is a Path With Equal Number of 0's And 1's", "question__title_slug": "check-if-there-is-a-path-with-equal-number-of-0s-and-1s", "question__hide": false, - "total_acs": 138, - "total_submitted": 207, + "total_acs": 145, + "total_submitted": 216, "total_column_articles": 7, "frontend_question_id": "2510", "is_new_question": false @@ -10323,8 +10974,8 @@ "question__title": "Count Number of Possible Root Nodes", "question__title_slug": "count-number-of-possible-root-nodes", "question__hide": false, - "total_acs": 2301, - "total_submitted": 4016, + "total_acs": 2333, + "total_submitted": 4058, "total_column_articles": 26, "frontend_question_id": "2581", "is_new_question": false @@ -10344,9 +10995,9 @@ "question__title": "Count Ways to Group Overlapping Ranges", "question__title_slug": "count-ways-to-group-overlapping-ranges", "question__hide": false, - "total_acs": 4570, - "total_submitted": 13004, - "total_column_articles": 49, + "total_acs": 4610, + "total_submitted": 13099, + "total_column_articles": 50, "frontend_question_id": "2580", "is_new_question": false }, @@ -10365,8 +11016,8 @@ "question__title": "Split With Minimum Sum", "question__title_slug": "split-with-minimum-sum", "question__hide": false, - "total_acs": 5491, - "total_submitted": 7171, + "total_acs": 5576, + "total_submitted": 7281, "total_column_articles": 61, "frontend_question_id": "2578", "is_new_question": false @@ -10386,8 +11037,8 @@ "question__title": "Count Total Number of Colored Cells", "question__title_slug": "count-total-number-of-colored-cells", "question__hide": false, - "total_acs": 4945, - "total_submitted": 7444, + "total_acs": 5007, + "total_submitted": 7532, "total_column_articles": 35, "frontend_question_id": "2579", "is_new_question": false @@ -10407,9 +11058,9 @@ "question__title": "Number of Ways to Earn Points", "question__title_slug": "number-of-ways-to-earn-points", "question__hide": false, - "total_acs": 4977, - "total_submitted": 7751, - "total_column_articles": 51, + "total_acs": 5050, + "total_submitted": 7843, + "total_column_articles": 54, "frontend_question_id": "2585", "is_new_question": false }, @@ -10428,8 +11079,8 @@ "question__title": "Split the Array to Make Coprime Products", "question__title_slug": "split-the-array-to-make-coprime-products", "question__hide": false, - "total_acs": 5382, - "total_submitted": 21389, + "total_acs": 5484, + "total_submitted": 21603, "total_column_articles": 71, "frontend_question_id": "2584", "is_new_question": false @@ -10449,9 +11100,9 @@ "question__title": "Kth Largest Sum in a Binary Tree", "question__title_slug": "kth-largest-sum-in-a-binary-tree", "question__hide": false, - "total_acs": 8015, - "total_submitted": 18329, - "total_column_articles": 65, + "total_acs": 8105, + "total_submitted": 18471, + "total_column_articles": 67, "frontend_question_id": "2583", "is_new_question": false }, @@ -10470,9 +11121,9 @@ "question__title": "Pass the Pillow", "question__title_slug": "pass-the-pillow", "question__hide": false, - "total_acs": 9342, - "total_submitted": 16733, - "total_column_articles": 81, + "total_acs": 9471, + "total_submitted": 16929, + "total_column_articles": 85, "frontend_question_id": "2582", "is_new_question": false }, @@ -10491,8 +11142,8 @@ "question__title": "Bitwise OR of All Subsequence Sums", "question__title_slug": "bitwise-or-of-all-subsequence-sums", "question__hide": false, - "total_acs": 117, - "total_submitted": 199, + "total_acs": 124, + "total_submitted": 209, "total_column_articles": 3, "frontend_question_id": "2505", "is_new_question": false @@ -10512,8 +11163,8 @@ "question__title": "Concatenate the Name and the Profession", "question__title_slug": "concatenate-the-name-and-the-profession", "question__hide": false, - "total_acs": 547, - "total_submitted": 720, + "total_acs": 572, + "total_submitted": 750, "total_column_articles": 8, "frontend_question_id": "2504", "is_new_question": false @@ -10533,8 +11184,8 @@ "question__title": "Time to Cross a Bridge", "question__title_slug": "time-to-cross-a-bridge", "question__hide": false, - "total_acs": 1744, - "total_submitted": 3369, + "total_acs": 1750, + "total_submitted": 3378, "total_column_articles": 50, "frontend_question_id": "2532", "is_new_question": false @@ -10554,9 +11205,9 @@ "question__title": "Disconnect Path in a Binary Matrix by at Most One Flip", "question__title_slug": "disconnect-path-in-a-binary-matrix-by-at-most-one-flip", "question__hide": false, - "total_acs": 2652, - "total_submitted": 8739, - "total_column_articles": 47, + "total_acs": 2770, + "total_submitted": 9162, + "total_column_articles": 46, "frontend_question_id": "2556", "is_new_question": false }, @@ -10575,9 +11226,9 @@ "question__title": "Maximum Number of Integers to Choose From a Range I", "question__title_slug": "maximum-number-of-integers-to-choose-from-a-range-i", "question__hide": false, - "total_acs": 4037, - "total_submitted": 6937, - "total_column_articles": 38, + "total_acs": 4102, + "total_submitted": 7073, + "total_column_articles": 39, "frontend_question_id": "2554", "is_new_question": false }, @@ -10596,9 +11247,9 @@ "question__title": "Separate the Digits in an Array", "question__title_slug": "separate-the-digits-in-an-array", "question__hide": false, - "total_acs": 5514, - "total_submitted": 6642, - "total_column_articles": 54, + "total_acs": 5641, + "total_submitted": 6823, + "total_column_articles": 55, "frontend_question_id": "2553", "is_new_question": false }, @@ -10617,8 +11268,8 @@ "question__title": "Number of Subarrays Having Even Product", "question__title_slug": "number-of-subarrays-having-even-product", "question__hide": false, - "total_acs": 185, - "total_submitted": 256, + "total_acs": 190, + "total_submitted": 267, "total_column_articles": 12, "frontend_question_id": "2495", "is_new_question": false @@ -10638,8 +11289,8 @@ "question__title": "Merge Overlapping Events in the Same Hall", "question__title_slug": "merge-overlapping-events-in-the-same-hall", "question__hide": false, - "total_acs": 303, - "total_submitted": 770, + "total_acs": 318, + "total_submitted": 816, "total_column_articles": 6, "frontend_question_id": "2494", "is_new_question": false @@ -10659,9 +11310,9 @@ "question__title": "Maximum Subsequence Score", "question__title_slug": "maximum-subsequence-score", "question__hide": false, - "total_acs": 2470, - "total_submitted": 4960, - "total_column_articles": 29, + "total_acs": 2590, + "total_submitted": 5157, + "total_column_articles": 33, "frontend_question_id": "2542", "is_new_question": false }, @@ -10680,8 +11331,8 @@ "question__title": "Check if Point Is Reachable", "question__title_slug": "check-if-point-is-reachable", "question__hide": false, - "total_acs": 1717, - "total_submitted": 3776, + "total_acs": 1737, + "total_submitted": 3818, "total_column_articles": 14, "frontend_question_id": "2543", "is_new_question": false @@ -10701,9 +11352,9 @@ "question__title": "Minimum Common Value", "question__title_slug": "minimum-common-value", "question__hide": false, - "total_acs": 5076, - "total_submitted": 8398, - "total_column_articles": 55, + "total_acs": 5217, + "total_submitted": 8635, + "total_column_articles": 57, "frontend_question_id": "2540", "is_new_question": false }, @@ -10722,8 +11373,8 @@ "question__title": "Minimum Cost to Split an Array", "question__title_slug": "minimum-cost-to-split-an-array", "question__hide": false, - "total_acs": 3087, - "total_submitted": 5448, + "total_acs": 3132, + "total_submitted": 5562, "total_column_articles": 37, "frontend_question_id": "2547", "is_new_question": false @@ -10743,8 +11394,8 @@ "question__title": "Apply Bitwise Operations to Make Strings Equal", "question__title_slug": "apply-bitwise-operations-to-make-strings-equal", "question__hide": false, - "total_acs": 3997, - "total_submitted": 9529, + "total_acs": 4028, + "total_submitted": 9583, "total_column_articles": 49, "frontend_question_id": "2546", "is_new_question": false @@ -10764,8 +11415,8 @@ "question__title": "Sort the Students by Their Kth Score", "question__title_slug": "sort-the-students-by-their-kth-score", "question__hide": false, - "total_acs": 5932, - "total_submitted": 6835, + "total_acs": 6054, + "total_submitted": 6974, "total_column_articles": 66, "frontend_question_id": "2545", "is_new_question": false @@ -10785,8 +11436,8 @@ "question__title": "Alternating Digit Sum", "question__title_slug": "alternating-digit-sum", "question__hide": false, - "total_acs": 6257, - "total_submitted": 7787, + "total_acs": 6387, + "total_submitted": 7947, "total_column_articles": 68, "frontend_question_id": "2544", "is_new_question": false @@ -10806,8 +11457,8 @@ "question__title": "Number of Substrings With Fixed Ratio", "question__title_slug": "number-of-substrings-with-fixed-ratio", "question__hide": false, - "total_acs": 103, - "total_submitted": 149, + "total_acs": 105, + "total_submitted": 154, "total_column_articles": 3, "frontend_question_id": "2489", "is_new_question": false @@ -10827,8 +11478,8 @@ "question__title": "Minimize the Maximum of Two Arrays", "question__title_slug": "minimize-the-maximum-of-two-arrays", "question__hide": false, - "total_acs": 2369, - "total_submitted": 6825, + "total_acs": 2395, + "total_submitted": 6920, "total_column_articles": 32, "frontend_question_id": "2513", "is_new_question": false @@ -10848,8 +11499,8 @@ "question__title": "Difference Between Maximum and Minimum Price Sum", "question__title_slug": "difference-between-maximum-and-minimum-price-sum", "question__hide": false, - "total_acs": 2941, - "total_submitted": 6196, + "total_acs": 2984, + "total_submitted": 6274, "total_column_articles": 42, "frontend_question_id": "2538", "is_new_question": false @@ -10869,8 +11520,8 @@ "question__title": "Count the Number of Good Subarrays", "question__title_slug": "count-the-number-of-good-subarrays", "question__hide": false, - "total_acs": 5004, - "total_submitted": 10290, + "total_acs": 5049, + "total_submitted": 10375, "total_column_articles": 78, "frontend_question_id": "2537", "is_new_question": false @@ -10890,8 +11541,8 @@ "question__title": "Increment Submatrices by One", "question__title_slug": "increment-submatrices-by-one", "question__hide": false, - "total_acs": 6616, - "total_submitted": 10995, + "total_acs": 6668, + "total_submitted": 11073, "total_column_articles": 74, "frontend_question_id": "2536", "is_new_question": false @@ -10911,9 +11562,9 @@ "question__title": "Difference Between Element Sum and Digit Sum of an Array", "question__title_slug": "difference-between-element-sum-and-digit-sum-of-an-array", "question__hide": false, - "total_acs": 9693, - "total_submitted": 11463, - "total_column_articles": 101, + "total_acs": 9829, + "total_submitted": 11639, + "total_column_articles": 105, "frontend_question_id": "2535", "is_new_question": false }, @@ -10932,8 +11583,8 @@ "question__title": "Maximum XOR of Two Non-Overlapping Subtrees", "question__title_slug": "maximum-xor-of-two-non-overlapping-subtrees", "question__hide": false, - "total_acs": 137, - "total_submitted": 209, + "total_acs": 140, + "total_submitted": 215, "total_column_articles": 7, "frontend_question_id": "2479", "is_new_question": false @@ -10953,8 +11604,8 @@ "question__title": "Form a Chemical Bond", "question__title_slug": "form-a-chemical-bond", "question__hide": false, - "total_acs": 563, - "total_submitted": 663, + "total_acs": 599, + "total_submitted": 715, "total_column_articles": 5, "frontend_question_id": "2480", "is_new_question": false @@ -10974,8 +11625,8 @@ "question__title": "Find Xor-Beauty of Array", "question__title_slug": "find-xor-beauty-of-array", "question__hide": false, - "total_acs": 3345, - "total_submitted": 4786, + "total_acs": 3367, + "total_submitted": 4816, "total_column_articles": 39, "frontend_question_id": "2527", "is_new_question": false @@ -10995,8 +11646,8 @@ "question__title": "Find Consecutive Integers from a Data Stream", "question__title_slug": "find-consecutive-integers-from-a-data-stream", "question__hide": false, - "total_acs": 4238, - "total_submitted": 7865, + "total_acs": 4274, + "total_submitted": 7932, "total_column_articles": 43, "frontend_question_id": "2526", "is_new_question": false @@ -11016,9 +11667,9 @@ "question__title": "Categorize Box According to Criteria", "question__title_slug": "categorize-box-according-to-criteria", "question__hide": false, - "total_acs": 4348, - "total_submitted": 9177, - "total_column_articles": 34, + "total_acs": 4411, + "total_submitted": 9314, + "total_column_articles": 35, "frontend_question_id": "2525", "is_new_question": false }, @@ -11037,8 +11688,8 @@ "question__title": "Maximize the Minimum Powered City", "question__title_slug": "maximize-the-minimum-powered-city", "question__hide": false, - "total_acs": 3082, - "total_submitted": 7650, + "total_acs": 3102, + "total_submitted": 7703, "total_column_articles": 36, "frontend_question_id": "2528", "is_new_question": false @@ -11058,8 +11709,8 @@ "question__title": "Time Taken to Cross the Door", "question__title_slug": "time-taken-to-cross-the-door", "question__hide": false, - "total_acs": 92, - "total_submitted": 149, + "total_acs": 95, + "total_submitted": 152, "total_column_articles": 8, "frontend_question_id": "2534", "is_new_question": false @@ -11079,8 +11730,8 @@ "question__title": "Maximal Score After Applying K Operations", "question__title_slug": "maximal-score-after-applying-k-operations", "question__hide": false, - "total_acs": 6281, - "total_submitted": 13995, + "total_acs": 6324, + "total_submitted": 14110, "total_column_articles": 66, "frontend_question_id": "2530", "is_new_question": false @@ -11100,8 +11751,8 @@ "question__title": "Make Number of Distinct Characters Equal", "question__title_slug": "make-number-of-distinct-characters-equal", "question__hide": false, - "total_acs": 5415, - "total_submitted": 18359, + "total_acs": 5435, + "total_submitted": 18409, "total_column_articles": 86, "frontend_question_id": "2531", "is_new_question": false @@ -11121,8 +11772,8 @@ "question__title": "Maximum Count of Positive Integer and Negative Integer", "question__title_slug": "maximum-count-of-positive-integer-and-negative-integer", "question__hide": false, - "total_acs": 8566, - "total_submitted": 11134, + "total_acs": 8691, + "total_submitted": 11313, "total_column_articles": 70, "frontend_question_id": "2529", "is_new_question": false @@ -11142,8 +11793,8 @@ "question__title": "Customers With Strictly Increasing Purchases", "question__title_slug": "customers-with-strictly-increasing-purchases", "question__hide": false, - "total_acs": 347, - "total_submitted": 729, + "total_acs": 375, + "total_submitted": 773, "total_column_articles": 13, "frontend_question_id": "2474", "is_new_question": false @@ -11163,8 +11814,8 @@ "question__title": "Minimum Cost to Buy Apples", "question__title_slug": "minimum-cost-to-buy-apples", "question__hide": false, - "total_acs": 132, - "total_submitted": 224, + "total_acs": 134, + "total_submitted": 226, "total_column_articles": 6, "frontend_question_id": "2473", "is_new_question": false @@ -11184,8 +11835,8 @@ "question__title": "Closest Prime Numbers in Range", "question__title_slug": "closest-prime-numbers-in-range", "question__hide": false, - "total_acs": 6277, - "total_submitted": 15196, + "total_acs": 6317, + "total_submitted": 15302, "total_column_articles": 63, "frontend_question_id": "2523", "is_new_question": false @@ -11205,9 +11856,9 @@ "question__title": "Distinct Prime Factors of Product of Array", "question__title_slug": "distinct-prime-factors-of-product-of-array", "question__hide": false, - "total_acs": 6414, - "total_submitted": 10317, - "total_column_articles": 60, + "total_acs": 6490, + "total_submitted": 10423, + "total_column_articles": 61, "frontend_question_id": "2521", "is_new_question": false }, @@ -11226,9 +11877,9 @@ "question__title": "Count the Digits That Divide a Number", "question__title_slug": "count-the-digits-that-divide-a-number", "question__hide": false, - "total_acs": 8319, - "total_submitted": 9946, - "total_column_articles": 75, + "total_acs": 8462, + "total_submitted": 10137, + "total_column_articles": 76, "frontend_question_id": "2520", "is_new_question": false }, @@ -11247,8 +11898,8 @@ "question__title": "Minimum Subarrays in a Valid Split", "question__title_slug": "minimum-subarrays-in-a-valid-split", "question__hide": false, - "total_acs": 133, - "total_submitted": 206, + "total_acs": 134, + "total_submitted": 213, "total_column_articles": 7, "frontend_question_id": "2464", "is_new_question": false @@ -11268,8 +11919,8 @@ "question__title": "Difference Between Ones and Zeros in Row and Column", "question__title_slug": "difference-between-ones-and-zeros-in-row-and-column", "question__hide": false, - "total_acs": 4789, - "total_submitted": 5821, + "total_acs": 4842, + "total_submitted": 5883, "total_column_articles": 60, "frontend_question_id": "2482", "is_new_question": false @@ -11289,8 +11940,8 @@ "question__title": "Count Anagrams", "question__title_slug": "count-anagrams", "question__hide": false, - "total_acs": 2142, - "total_submitted": 4684, + "total_acs": 2168, + "total_submitted": 4754, "total_column_articles": 33, "frontend_question_id": "2514", "is_new_question": false @@ -11310,8 +11961,8 @@ "question__title": "Minimum Operations to Make Array Equal II", "question__title_slug": "minimum-operations-to-make-array-equal-ii", "question__hide": false, - "total_acs": 3083, - "total_submitted": 9934, + "total_acs": 3110, + "total_submitted": 10012, "total_column_articles": 30, "frontend_question_id": "2541", "is_new_question": false @@ -11331,8 +11982,8 @@ "question__title": "Reward Top K Students", "question__title_slug": "reward-top-k-students", "question__hide": false, - "total_acs": 3331, - "total_submitted": 7198, + "total_acs": 3394, + "total_submitted": 7323, "total_column_articles": 49, "frontend_question_id": "2512", "is_new_question": false @@ -11352,8 +12003,8 @@ "question__title": "Maximum Enemy Forts That Can Be Captured", "question__title_slug": "maximum-enemy-forts-that-can-be-captured", "question__hide": false, - "total_acs": 3867, - "total_submitted": 7786, + "total_acs": 3937, + "total_submitted": 7928, "total_column_articles": 61, "frontend_question_id": "2511", "is_new_question": false @@ -11373,8 +12024,8 @@ "question__title": "Number of Great Partitions", "question__title_slug": "number-of-great-partitions", "question__hide": false, - "total_acs": 2564, - "total_submitted": 5997, + "total_acs": 2575, + "total_submitted": 6019, "total_column_articles": 30, "frontend_question_id": "2518", "is_new_question": false @@ -11394,8 +12045,8 @@ "question__title": "Maximum Tastiness of Candy Basket", "question__title_slug": "maximum-tastiness-of-candy-basket", "question__hide": false, - "total_acs": 4376, - "total_submitted": 6281, + "total_acs": 4431, + "total_submitted": 6359, "total_column_articles": 45, "frontend_question_id": "2517", "is_new_question": false @@ -11415,9 +12066,9 @@ "question__title": "Take K of Each Character From Left and Right", "question__title_slug": "take-k-of-each-character-from-left-and-right", "question__hide": false, - "total_acs": 5114, - "total_submitted": 13892, - "total_column_articles": 72, + "total_acs": 5178, + "total_submitted": 14030, + "total_column_articles": 73, "frontend_question_id": "2516", "is_new_question": false }, @@ -11436,9 +12087,9 @@ "question__title": "Shortest Distance to Target String in a Circular Array", "question__title_slug": "shortest-distance-to-target-string-in-a-circular-array", "question__hide": false, - "total_acs": 6312, - "total_submitted": 11371, - "total_column_articles": 64, + "total_acs": 6393, + "total_submitted": 11521, + "total_column_articles": 66, "frontend_question_id": "2515", "is_new_question": false }, @@ -11457,8 +12108,8 @@ "question__title": "Cycle Length Queries in a Tree", "question__title_slug": "cycle-length-queries-in-a-tree", "question__hide": false, - "total_acs": 3859, - "total_submitted": 5909, + "total_acs": 3877, + "total_submitted": 5937, "total_column_articles": 59, "frontend_question_id": "2509", "is_new_question": false @@ -11478,8 +12129,8 @@ "question__title": "Add Edges to Make Degrees of All Nodes Even", "question__title_slug": "add-edges-to-make-degrees-of-all-nodes-even", "question__hide": false, - "total_acs": 3322, - "total_submitted": 11337, + "total_acs": 3335, + "total_submitted": 11385, "total_column_articles": 53, "frontend_question_id": "2508", "is_new_question": false @@ -11499,8 +12150,8 @@ "question__title": "Smallest Value After Replacing With Sum of Prime Factors", "question__title_slug": "smallest-value-after-replacing-with-sum-of-prime-factors", "question__hide": false, - "total_acs": 5754, - "total_submitted": 11518, + "total_acs": 5773, + "total_submitted": 11571, "total_column_articles": 60, "frontend_question_id": "2507", "is_new_question": false @@ -11520,9 +12171,9 @@ "question__title": "Count Pairs Of Similar Strings", "question__title_slug": "count-pairs-of-similar-strings", "question__hide": false, - "total_acs": 7205, - "total_submitted": 9166, - "total_column_articles": 80, + "total_acs": 7275, + "total_submitted": 9272, + "total_column_articles": 81, "frontend_question_id": "2506", "is_new_question": false }, @@ -11541,8 +12192,8 @@ "question__title": "Number of Distinct Binary Strings After Applying Operations", "question__title_slug": "number-of-distinct-binary-strings-after-applying-operations", "question__hide": false, - "total_acs": 141, - "total_submitted": 187, + "total_acs": 147, + "total_submitted": 194, "total_column_articles": 8, "frontend_question_id": "2450", "is_new_question": false @@ -11562,8 +12213,8 @@ "question__title": "Minimum Total Cost to Make Arrays Unequal", "question__title_slug": "minimum-total-cost-to-make-arrays-unequal", "question__hide": false, - "total_acs": 1503, - "total_submitted": 3529, + "total_acs": 1513, + "total_submitted": 3547, "total_column_articles": 27, "frontend_question_id": "2499", "is_new_question": false @@ -11583,8 +12234,8 @@ "question__title": "Frog Jump II", "question__title_slug": "frog-jump-ii", "question__hide": false, - "total_acs": 3385, - "total_submitted": 5200, + "total_acs": 3436, + "total_submitted": 5279, "total_column_articles": 46, "frontend_question_id": "2498", "is_new_question": false @@ -11604,9 +12255,9 @@ "question__title": "Maximum Star Sum of a Graph", "question__title_slug": "maximum-star-sum-of-a-graph", "question__hide": false, - "total_acs": 3532, - "total_submitted": 9420, - "total_column_articles": 48, + "total_acs": 3690, + "total_submitted": 9795, + "total_column_articles": 49, "frontend_question_id": "2497", "is_new_question": false }, @@ -11625,9 +12276,9 @@ "question__title": "Maximum Value of a String in an Array", "question__title_slug": "maximum-value-of-a-string-in-an-array", "question__hide": false, - "total_acs": 5820, - "total_submitted": 7464, - "total_column_articles": 73, + "total_acs": 5932, + "total_submitted": 7615, + "total_column_articles": 75, "frontend_question_id": "2496", "is_new_question": false }, @@ -11646,9 +12297,9 @@ "question__title": "Maximum Number of Points From Grid Queries", "question__title_slug": "maximum-number-of-points-from-grid-queries", "question__hide": false, - "total_acs": 3894, - "total_submitted": 9074, - "total_column_articles": 61, + "total_acs": 3957, + "total_submitted": 9162, + "total_column_articles": 62, "frontend_question_id": "2503", "is_new_question": false }, @@ -11667,8 +12318,8 @@ "question__title": "Design Memory Allocator", "question__title_slug": "design-memory-allocator", "question__hide": false, - "total_acs": 4981, - "total_submitted": 9544, + "total_acs": 5030, + "total_submitted": 9627, "total_column_articles": 72, "frontend_question_id": "2502", "is_new_question": false @@ -11688,9 +12339,9 @@ "question__title": "Longest Square Streak in an Array", "question__title_slug": "longest-square-streak-in-an-array", "question__hide": false, - "total_acs": 7060, - "total_submitted": 16931, - "total_column_articles": 80, + "total_acs": 7113, + "total_submitted": 17084, + "total_column_articles": 82, "frontend_question_id": "2501", "is_new_question": false }, @@ -11709,9 +12360,9 @@ "question__title": "Delete Greatest Value in Each Row", "question__title_slug": "delete-greatest-value-in-each-row", "question__hide": false, - "total_acs": 8759, - "total_submitted": 10521, - "total_column_articles": 108, + "total_acs": 8904, + "total_submitted": 10722, + "total_column_articles": 109, "frontend_question_id": "2500", "is_new_question": false }, @@ -11730,9 +12381,9 @@ "question__title": "Number of Nodes With Value One", "question__title_slug": "number-of-nodes-with-value-one", "question__hide": false, - "total_acs": 230, - "total_submitted": 294, - "total_column_articles": 14, + "total_acs": 238, + "total_submitted": 305, + "total_column_articles": 15, "frontend_question_id": "2445", "is_new_question": false }, @@ -11751,8 +12402,8 @@ "question__title": "Divide Nodes Into the Maximum Number of Groups", "question__title_slug": "divide-nodes-into-the-maximum-number-of-groups", "question__hide": false, - "total_acs": 2789, - "total_submitted": 6511, + "total_acs": 2820, + "total_submitted": 6564, "total_column_articles": 44, "frontend_question_id": "2493", "is_new_question": false @@ -11772,9 +12423,9 @@ "question__title": "Minimum Score of a Path Between Two Cities", "question__title_slug": "minimum-score-of-a-path-between-two-cities", "question__hide": false, - "total_acs": 6822, - "total_submitted": 16573, - "total_column_articles": 116, + "total_acs": 6868, + "total_submitted": 16638, + "total_column_articles": 118, "frontend_question_id": "2492", "is_new_question": false }, @@ -11793,9 +12444,9 @@ "question__title": "Divide Players Into Teams of Equal Skill", "question__title_slug": "divide-players-into-teams-of-equal-skill", "question__hide": false, - "total_acs": 8135, - "total_submitted": 14681, - "total_column_articles": 103, + "total_acs": 8196, + "total_submitted": 14770, + "total_column_articles": 105, "frontend_question_id": "2491", "is_new_question": false }, @@ -11814,8 +12465,8 @@ "question__title": "Circular Sentence", "question__title_slug": "circular-sentence", "question__hide": false, - "total_acs": 8860, - "total_submitted": 12708, + "total_acs": 8964, + "total_submitted": 12854, "total_column_articles": 89, "frontend_question_id": "2490", "is_new_question": false @@ -11835,8 +12486,8 @@ "question__title": "Minimum Split Into Subarrays With GCD Greater Than One", "question__title_slug": "minimum-split-into-subarrays-with-gcd-greater-than-one", "question__hide": false, - "total_acs": 166, - "total_submitted": 216, + "total_acs": 175, + "total_submitted": 226, "total_column_articles": 9, "frontend_question_id": "2436", "is_new_question": false @@ -11856,8 +12507,8 @@ "question__title": "Count Palindromic Subsequences", "question__title_slug": "count-palindromic-subsequences", "question__hide": false, - "total_acs": 2633, - "total_submitted": 5566, + "total_acs": 2653, + "total_submitted": 5598, "total_column_articles": 47, "frontend_question_id": "2484", "is_new_question": false @@ -11877,8 +12528,8 @@ "question__title": "Minimum Penalty for a Shop", "question__title_slug": "minimum-penalty-for-a-shop", "question__hide": false, - "total_acs": 5250, - "total_submitted": 8270, + "total_acs": 5311, + "total_submitted": 8362, "total_column_articles": 76, "frontend_question_id": "2483", "is_new_question": false @@ -11898,8 +12549,8 @@ "question__title": "Minimum Cuts to Divide a Circle", "question__title_slug": "minimum-cuts-to-divide-a-circle", "question__hide": false, - "total_acs": 5293, - "total_submitted": 10209, + "total_acs": 5365, + "total_submitted": 10387, "total_column_articles": 52, "frontend_question_id": "2481", "is_new_question": false @@ -11919,8 +12570,8 @@ "question__title": "Count Subarrays With Median K", "question__title_slug": "count-subarrays-with-median-k", "question__hide": false, - "total_acs": 20109, - "total_submitted": 39580, + "total_acs": 20172, + "total_submitted": 39712, "total_column_articles": 203, "frontend_question_id": "2488", "is_new_question": false @@ -11940,8 +12591,8 @@ "question__title": "Remove Nodes From Linked List", "question__title_slug": "remove-nodes-from-linked-list", "question__hide": false, - "total_acs": 8397, - "total_submitted": 12186, + "total_acs": 8515, + "total_submitted": 12341, "total_column_articles": 115, "frontend_question_id": "2487", "is_new_question": false @@ -11961,9 +12612,9 @@ "question__title": "Append Characters to String to Make Subsequence", "question__title_slug": "append-characters-to-string-to-make-subsequence", "question__hide": false, - "total_acs": 7363, - "total_submitted": 11294, - "total_column_articles": 80, + "total_acs": 7423, + "total_submitted": 11365, + "total_column_articles": 81, "frontend_question_id": "2486", "is_new_question": false }, @@ -11982,8 +12633,8 @@ "question__title": "Find the Pivot Integer", "question__title_slug": "find-the-pivot-integer", "question__hide": false, - "total_acs": 10107, - "total_submitted": 12558, + "total_acs": 10224, + "total_submitted": 12716, "total_column_articles": 105, "frontend_question_id": "2485", "is_new_question": false @@ -12003,8 +12654,8 @@ "question__title": "Maximize Total Tastiness of Purchased Fruits", "question__title_slug": "maximize-total-tastiness-of-purchased-fruits", "question__hide": false, - "total_acs": 147, - "total_submitted": 237, + "total_acs": 149, + "total_submitted": 242, "total_column_articles": 11, "frontend_question_id": "2431", "is_new_question": false @@ -12024,8 +12675,8 @@ "question__title": "Number of Beautiful Partitions", "question__title_slug": "number-of-beautiful-partitions", "question__hide": false, - "total_acs": 4009, - "total_submitted": 9993, + "total_acs": 4031, + "total_submitted": 10055, "total_column_articles": 48, "frontend_question_id": "2478", "is_new_question": false @@ -12045,9 +12696,9 @@ "question__title": "Minimum Fuel Cost to Report to the Capital", "question__title_slug": "minimum-fuel-cost-to-report-to-the-capital", "question__hide": false, - "total_acs": 4635, - "total_submitted": 8779, - "total_column_articles": 71, + "total_acs": 4677, + "total_submitted": 8850, + "total_column_articles": 72, "frontend_question_id": "2477", "is_new_question": false }, @@ -12066,8 +12717,8 @@ "question__title": "Closest Nodes Queries in a Binary Search Tree", "question__title_slug": "closest-nodes-queries-in-a-binary-search-tree", "question__hide": false, - "total_acs": 6626, - "total_submitted": 16085, + "total_acs": 6653, + "total_submitted": 16140, "total_column_articles": 97, "frontend_question_id": "2476", "is_new_question": false @@ -12087,8 +12738,8 @@ "question__title": "Number of Unequal Triplets in Array", "question__title_slug": "number-of-unequal-triplets-in-array", "question__hide": false, - "total_acs": 8949, - "total_submitted": 11911, + "total_acs": 9030, + "total_submitted": 12030, "total_column_articles": 60, "frontend_question_id": "2475", "is_new_question": false @@ -12108,8 +12759,8 @@ "question__title": "Merge Operations to Turn Array Into a Palindrome", "question__title_slug": "merge-operations-to-turn-array-into-a-palindrome", "question__hide": false, - "total_acs": 216, - "total_submitted": 301, + "total_acs": 219, + "total_submitted": 306, "total_column_articles": 11, "frontend_question_id": "2422", "is_new_question": false @@ -12129,8 +12780,8 @@ "question__title": "Most Profitable Path in a Tree", "question__title_slug": "most-profitable-path-in-a-tree", "question__hide": false, - "total_acs": 2820, - "total_submitted": 5662, + "total_acs": 2851, + "total_submitted": 5706, "total_column_articles": 44, "frontend_question_id": "2467", "is_new_question": false @@ -12150,8 +12801,8 @@ "question__title": "Split Message Based on Limit", "question__title_slug": "split-message-based-on-limit", "question__hide": false, - "total_acs": 2124, - "total_submitted": 4786, + "total_acs": 2127, + "total_submitted": 4793, "total_column_articles": 53, "frontend_question_id": "2468", "is_new_question": false @@ -12171,9 +12822,9 @@ "question__title": "Count Ways To Build Good Strings", "question__title_slug": "count-ways-to-build-good-strings", "question__hide": false, - "total_acs": 4380, - "total_submitted": 9640, - "total_column_articles": 66, + "total_acs": 4600, + "total_submitted": 9988, + "total_column_articles": 67, "frontend_question_id": "2466", "is_new_question": false }, @@ -12192,9 +12843,9 @@ "question__title": "Number of Distinct Averages", "question__title_slug": "number-of-distinct-averages", "question__hide": false, - "total_acs": 6216, - "total_submitted": 9124, - "total_column_articles": 79, + "total_acs": 6300, + "total_submitted": 9245, + "total_column_articles": 81, "frontend_question_id": "2465", "is_new_question": false }, @@ -12213,8 +12864,8 @@ "question__title": "Closest Fair Integer", "question__title_slug": "closest-fair-integer", "question__hide": false, - "total_acs": 124, - "total_submitted": 265, + "total_acs": 125, + "total_submitted": 268, "total_column_articles": 9, "frontend_question_id": "2417", "is_new_question": false @@ -12234,8 +12885,8 @@ "question__title": "Maximum Number of Non-overlapping Palindrome Substrings", "question__title_slug": "maximum-number-of-non-overlapping-palindrome-substrings", "question__hide": false, - "total_acs": 5050, - "total_submitted": 11532, + "total_acs": 5084, + "total_submitted": 11591, "total_column_articles": 84, "frontend_question_id": "2472", "is_new_question": false @@ -12255,9 +12906,9 @@ "question__title": "Minimum Number of Operations to Sort a Binary Tree by Level", "question__title_slug": "minimum-number-of-operations-to-sort-a-binary-tree-by-level", "question__hide": false, - "total_acs": 6555, - "total_submitted": 11824, - "total_column_articles": 91, + "total_acs": 6589, + "total_submitted": 11876, + "total_column_articles": 92, "frontend_question_id": "2471", "is_new_question": false }, @@ -12276,9 +12927,9 @@ "question__title": "Number of Subarrays With LCM Equal to K", "question__title_slug": "number-of-subarrays-with-lcm-equal-to-k", "question__hide": false, - "total_acs": 7786, - "total_submitted": 19200, - "total_column_articles": 87, + "total_acs": 7830, + "total_submitted": 19301, + "total_column_articles": 88, "frontend_question_id": "2470", "is_new_question": false }, @@ -12297,9 +12948,9 @@ "question__title": "Convert the Temperature", "question__title_slug": "convert-the-temperature", "question__hide": false, - "total_acs": 41109, - "total_submitted": 46590, - "total_column_articles": 162, + "total_acs": 41739, + "total_submitted": 47433, + "total_column_articles": 165, "frontend_question_id": "2469", "is_new_question": false }, @@ -12318,8 +12969,8 @@ "question__title": "Design SQL", "question__title_slug": "design-sql", "question__hide": false, - "total_acs": 144, - "total_submitted": 232, + "total_acs": 155, + "total_submitted": 243, "total_column_articles": 7, "frontend_question_id": "2408", "is_new_question": false @@ -12339,9 +12990,9 @@ "question__title": "Minimum Total Distance Traveled", "question__title_slug": "minimum-total-distance-traveled", "question__hide": false, - "total_acs": 3593, - "total_submitted": 7798, - "total_column_articles": 57, + "total_acs": 3614, + "total_submitted": 7830, + "total_column_articles": 58, "frontend_question_id": "2463", "is_new_question": false }, @@ -12360,9 +13011,9 @@ "question__title": "Total Cost to Hire K Workers", "question__title_slug": "total-cost-to-hire-k-workers", "question__hide": false, - "total_acs": 5807, - "total_submitted": 15667, - "total_column_articles": 115, + "total_acs": 5946, + "total_submitted": 15959, + "total_column_articles": 116, "frontend_question_id": "2462", "is_new_question": false }, @@ -12381,8 +13032,8 @@ "question__title": "Maximum Sum of Distinct Subarrays With Length K", "question__title_slug": "maximum-sum-of-distinct-subarrays-with-length-k", "question__hide": false, - "total_acs": 7988, - "total_submitted": 26191, + "total_acs": 8059, + "total_submitted": 26417, "total_column_articles": 141, "frontend_question_id": "2461", "is_new_question": false @@ -12402,8 +13053,8 @@ "question__title": "Apply Operations to an Array", "question__title_slug": "apply-operations-to-an-array", "question__hide": false, - "total_acs": 9165, - "total_submitted": 13492, + "total_acs": 9252, + "total_submitted": 13635, "total_column_articles": 87, "frontend_question_id": "2460", "is_new_question": false @@ -12423,9 +13074,9 @@ "question__title": "Words Within Two Edits of Dictionary", "question__title_slug": "words-within-two-edits-of-dictionary", "question__hide": false, - "total_acs": 4413, - "total_submitted": 6775, - "total_column_articles": 41, + "total_acs": 4438, + "total_submitted": 6808, + "total_column_articles": 42, "frontend_question_id": "2452", "is_new_question": false }, @@ -12444,8 +13095,8 @@ "question__title": "Next Greater Element IV", "question__title_slug": "next-greater-element-iv", "question__hide": false, - "total_acs": 3852, - "total_submitted": 7884, + "total_acs": 3898, + "total_submitted": 7971, "total_column_articles": 80, "frontend_question_id": "2454", "is_new_question": false @@ -12465,8 +13116,8 @@ "question__title": "Destroy Sequential Targets", "question__title_slug": "destroy-sequential-targets", "question__hide": false, - "total_acs": 4198, - "total_submitted": 11914, + "total_acs": 4229, + "total_submitted": 11981, "total_column_articles": 68, "frontend_question_id": "2453", "is_new_question": false @@ -12486,8 +13137,8 @@ "question__title": "Odd String Difference", "question__title_slug": "odd-string-difference", "question__hide": false, - "total_acs": 5229, - "total_submitted": 8707, + "total_acs": 5300, + "total_submitted": 8812, "total_column_articles": 66, "frontend_question_id": "2451", "is_new_question": false @@ -12507,9 +13158,9 @@ "question__title": "Number of Subarrays With GCD Equal to K", "question__title_slug": "number-of-subarrays-with-gcd-equal-to-k", "question__hide": false, - "total_acs": 7458, - "total_submitted": 18353, - "total_column_articles": 63, + "total_acs": 7508, + "total_submitted": 18432, + "total_column_articles": 64, "frontend_question_id": "2447", "is_new_question": false }, @@ -12528,9 +13179,9 @@ "question__title": "Height of Binary Tree After Subtree Removal Queries", "question__title_slug": "height-of-binary-tree-after-subtree-removal-queries", "question__hide": false, - "total_acs": 4331, - "total_submitted": 10580, - "total_column_articles": 78, + "total_acs": 4361, + "total_submitted": 10629, + "total_column_articles": 79, "frontend_question_id": "2458", "is_new_question": false }, @@ -12549,9 +13200,9 @@ "question__title": "Minimum Addition to Make Integer Beautiful", "question__title_slug": "minimum-addition-to-make-integer-beautiful", "question__hide": false, - "total_acs": 6606, - "total_submitted": 16791, - "total_column_articles": 120, + "total_acs": 6637, + "total_submitted": 16888, + "total_column_articles": 121, "frontend_question_id": "2457", "is_new_question": false }, @@ -12570,8 +13221,8 @@ "question__title": "Most Popular Video Creator", "question__title_slug": "most-popular-video-creator", "question__hide": false, - "total_acs": 7981, - "total_submitted": 20917, + "total_acs": 8024, + "total_submitted": 21019, "total_column_articles": 118, "frontend_question_id": "2456", "is_new_question": false @@ -12591,8 +13242,8 @@ "question__title": "Average Value of Even Numbers That Are Divisible by Three", "question__title_slug": "average-value-of-even-numbers-that-are-divisible-by-three", "question__hide": false, - "total_acs": 10127, - "total_submitted": 16368, + "total_acs": 10219, + "total_submitted": 16526, "total_column_articles": 67, "frontend_question_id": "2455", "is_new_question": false @@ -12612,9 +13263,9 @@ "question__title": "Sum of Number and Its Reverse", "question__title_slug": "sum-of-number-and-its-reverse", "question__hide": false, - "total_acs": 9354, - "total_submitted": 20070, - "total_column_articles": 77, + "total_acs": 9428, + "total_submitted": 20280, + "total_column_articles": 78, "frontend_question_id": "2443", "is_new_question": false }, @@ -12633,9 +13284,9 @@ "question__title": "Color the Triangle Red", "question__title_slug": "color-the-triangle-red", "question__hide": false, - "total_acs": 25, - "total_submitted": 35, - "total_column_articles": 0, + "total_acs": 32, + "total_submitted": 45, + "total_column_articles": 1, "frontend_question_id": "2647", "is_new_question": false }, @@ -12654,9 +13305,9 @@ "question__title": "Minimum Number of Operations to Make Arrays Similar", "question__title_slug": "minimum-number-of-operations-to-make-arrays-similar", "question__hide": false, - "total_acs": 3762, - "total_submitted": 5760, - "total_column_articles": 46, + "total_acs": 3790, + "total_submitted": 5799, + "total_column_articles": 47, "frontend_question_id": "2449", "is_new_question": false }, @@ -12675,8 +13326,8 @@ "question__title": "Minimum Cost to Make Array Equal", "question__title_slug": "minimum-cost-to-make-array-equal", "question__hide": false, - "total_acs": 5302, - "total_submitted": 14830, + "total_acs": 5332, + "total_submitted": 14914, "total_column_articles": 80, "frontend_question_id": "2448", "is_new_question": false @@ -12696,8 +13347,8 @@ "question__title": "Minimum Time to Kill All Monsters", "question__title_slug": "minimum-time-to-kill-all-monsters", "question__hide": false, - "total_acs": 287, - "total_submitted": 383, + "total_acs": 294, + "total_submitted": 398, "total_column_articles": 17, "frontend_question_id": "2403", "is_new_question": false @@ -12717,9 +13368,9 @@ "question__title": "Determine if Two Events Have Conflict", "question__title_slug": "determine-if-two-events-have-conflict", "question__hide": false, - "total_acs": 9878, - "total_submitted": 17304, - "total_column_articles": 80, + "total_acs": 9992, + "total_submitted": 17487, + "total_column_articles": 81, "frontend_question_id": "2446", "is_new_question": false }, @@ -12738,9 +13389,9 @@ "question__title": "Count Strictly Increasing Subarrays", "question__title_slug": "count-strictly-increasing-subarrays", "question__hide": false, - "total_acs": 319, - "total_submitted": 404, - "total_column_articles": 12, + "total_acs": 356, + "total_submitted": 451, + "total_column_articles": 13, "frontend_question_id": "2393", "is_new_question": false }, @@ -12759,8 +13410,8 @@ "question__title": "Employees With Deductions", "question__title_slug": "employees-with-deductions", "question__hide": false, - "total_acs": 643, - "total_submitted": 1214, + "total_acs": 675, + "total_submitted": 1253, "total_column_articles": 13, "frontend_question_id": "2394", "is_new_question": false @@ -12780,9 +13431,9 @@ "question__title": "Bitwise XOR of All Pairings", "question__title_slug": "bitwise-xor-of-all-pairings", "question__hide": false, - "total_acs": 4905, - "total_submitted": 7546, - "total_column_articles": 68, + "total_acs": 4953, + "total_submitted": 7625, + "total_column_articles": 69, "frontend_question_id": "2425", "is_new_question": false }, @@ -12801,9 +13452,9 @@ "question__title": "Remove Letter To Equalize Frequency", "question__title_slug": "remove-letter-to-equalize-frequency", "question__hide": false, - "total_acs": 18978, - "total_submitted": 75043, - "total_column_articles": 266, + "total_acs": 19379, + "total_submitted": 76616, + "total_column_articles": 265, "frontend_question_id": "2423", "is_new_question": false }, @@ -12822,8 +13473,8 @@ "question__title": "Create Components With Same Value", "question__title_slug": "create-components-with-same-value", "question__hide": false, - "total_acs": 2144, - "total_submitted": 3500, + "total_acs": 2166, + "total_submitted": 3530, "total_column_articles": 31, "frontend_question_id": "2440", "is_new_question": false @@ -12843,8 +13494,8 @@ "question__title": "Minimize Maximum of Array", "question__title_slug": "minimize-maximum-of-array", "question__hide": false, - "total_acs": 5877, - "total_submitted": 15220, + "total_acs": 5979, + "total_submitted": 15420, "total_column_articles": 116, "frontend_question_id": "2439", "is_new_question": false @@ -12864,8 +13515,8 @@ "question__title": "Range Product Queries of Powers", "question__title_slug": "range-product-queries-of-powers", "question__hide": false, - "total_acs": 4595, - "total_submitted": 11199, + "total_acs": 4683, + "total_submitted": 11381, "total_column_articles": 82, "frontend_question_id": "2438", "is_new_question": false @@ -12885,9 +13536,9 @@ "question__title": "Number of Valid Clock Times", "question__title_slug": "number-of-valid-clock-times", "question__hide": false, - "total_acs": 6421, - "total_submitted": 14421, - "total_column_articles": 84, + "total_acs": 24243, + "total_submitted": 47876, + "total_column_articles": 283, "frontend_question_id": "2437", "is_new_question": false }, @@ -12906,9 +13557,9 @@ "question__title": "Count Subarrays With Fixed Bounds", "question__title_slug": "count-subarrays-with-fixed-bounds", "question__hide": false, - "total_acs": 6565, - "total_submitted": 14843, - "total_column_articles": 95, + "total_acs": 6626, + "total_submitted": 14969, + "total_column_articles": 96, "frontend_question_id": "2444", "is_new_question": false }, @@ -12927,9 +13578,9 @@ "question__title": "Longest Increasing Subsequence II", "question__title_slug": "longest-increasing-subsequence-ii", "question__hide": false, - "total_acs": 4982, - "total_submitted": 16948, - "total_column_articles": 85, + "total_acs": 5027, + "total_submitted": 17098, + "total_column_articles": 86, "frontend_question_id": "2407", "is_new_question": false }, @@ -12948,9 +13599,9 @@ "question__title": "Count Number of Distinct Integers After Reverse Operations", "question__title_slug": "count-number-of-distinct-integers-after-reverse-operations", "question__hide": false, - "total_acs": 10036, - "total_submitted": 13320, - "total_column_articles": 90, + "total_acs": 10225, + "total_submitted": 13622, + "total_column_articles": 93, "frontend_question_id": "2442", "is_new_question": false }, @@ -12969,9 +13620,9 @@ "question__title": "Largest Positive Integer That Exists With Its Negative", "question__title_slug": "largest-positive-integer-that-exists-with-its-negative", "question__hide": false, - "total_acs": 11717, - "total_submitted": 16744, - "total_column_articles": 117, + "total_acs": 28444, + "total_submitted": 39174, + "total_column_articles": 260, "frontend_question_id": "2441", "is_new_question": false }, @@ -12990,9 +13641,9 @@ "question__title": "Change Null Values in a Table to the Previous Value", "question__title_slug": "change-null-values-in-a-table-to-the-previous-value", "question__hide": false, - "total_acs": 603, - "total_submitted": 901, - "total_column_articles": 12, + "total_acs": 622, + "total_submitted": 923, + "total_column_articles": 13, "frontend_question_id": "2388", "is_new_question": false }, @@ -13011,8 +13662,8 @@ "question__title": "Median of a Row Wise Sorted Matrix", "question__title_slug": "median-of-a-row-wise-sorted-matrix", "question__hide": false, - "total_acs": 191, - "total_submitted": 253, + "total_acs": 196, + "total_submitted": 258, "total_column_articles": 5, "frontend_question_id": "2387", "is_new_question": false @@ -13032,9 +13683,9 @@ "question__title": "Paths in Matrix Whose Sum Is Divisible by K", "question__title_slug": "paths-in-matrix-whose-sum-is-divisible-by-k", "question__hide": false, - "total_acs": 5834, - "total_submitted": 11378, - "total_column_articles": 93, + "total_acs": 5897, + "total_submitted": 11464, + "total_column_articles": 94, "frontend_question_id": "2435", "is_new_question": false }, @@ -13053,8 +13704,8 @@ "question__title": "Using a Robot to Print the Lexicographically Smallest String", "question__title_slug": "using-a-robot-to-print-the-lexicographically-smallest-string", "question__hide": false, - "total_acs": 6418, - "total_submitted": 15261, + "total_acs": 6471, + "total_submitted": 15402, "total_column_articles": 113, "frontend_question_id": "2434", "is_new_question": false @@ -13074,9 +13725,9 @@ "question__title": "Find The Original Array of Prefix Xor", "question__title_slug": "find-the-original-array-of-prefix-xor", "question__hide": false, - "total_acs": 7819, - "total_submitted": 9194, - "total_column_articles": 83, + "total_acs": 7990, + "total_submitted": 9410, + "total_column_articles": 84, "frontend_question_id": "2433", "is_new_question": false }, @@ -13095,9 +13746,9 @@ "question__title": "The Employee That Worked on the Longest Task", "question__title_slug": "the-employee-that-worked-on-the-longest-task", "question__hide": false, - "total_acs": 8670, - "total_submitted": 17778, - "total_column_articles": 94, + "total_acs": 28960, + "total_submitted": 52428, + "total_column_articles": 219, "frontend_question_id": "2432", "is_new_question": false }, @@ -13116,8 +13767,8 @@ "question__title": "Choose Edges to Maximize Score in a Tree", "question__title_slug": "choose-edges-to-maximize-score-in-a-tree", "question__hide": false, - "total_acs": 194, - "total_submitted": 288, + "total_acs": 198, + "total_submitted": 292, "total_column_articles": 8, "frontend_question_id": "2378", "is_new_question": false @@ -13137,8 +13788,8 @@ "question__title": "Sort the Olympic Table", "question__title_slug": "sort-the-olympic-table", "question__hide": false, - "total_acs": 703, - "total_submitted": 881, + "total_acs": 731, + "total_submitted": 918, "total_column_articles": 9, "frontend_question_id": "2377", "is_new_question": false @@ -13158,8 +13809,8 @@ "question__title": "Calculate the Influence of Each Salesperson", "question__title_slug": "calculate-the-influence-of-each-salesperson", "question__hide": false, - "total_acs": 705, - "total_submitted": 916, + "total_acs": 722, + "total_submitted": 933, "total_column_articles": 9, "frontend_question_id": "2372", "is_new_question": false @@ -13179,9 +13830,9 @@ "question__title": "Number of Pairs Satisfying Inequality", "question__title_slug": "number-of-pairs-satisfying-inequality", "question__hide": false, - "total_acs": 4021, - "total_submitted": 8790, - "total_column_articles": 78, + "total_acs": 4067, + "total_submitted": 8865, + "total_column_articles": 80, "frontend_question_id": "2426", "is_new_question": false }, @@ -13200,9 +13851,9 @@ "question__title": "Longest Uploaded Prefix", "question__title_slug": "longest-uploaded-prefix", "question__hide": false, - "total_acs": 5427, - "total_submitted": 9680, - "total_column_articles": 79, + "total_acs": 5472, + "total_submitted": 9756, + "total_column_articles": 80, "frontend_question_id": "2424", "is_new_question": false }, @@ -13221,8 +13872,8 @@ "question__title": "Partition String Into Substrings With Values at Most K", "question__title_slug": "partition-string-into-substrings-with-values-at-most-k", "question__hide": false, - "total_acs": 5681, - "total_submitted": 11464, + "total_acs": 5732, + "total_submitted": 11575, "total_column_articles": 59, "frontend_question_id": "2522", "is_new_question": false @@ -13242,8 +13893,8 @@ "question__title": "Maximum Deletions on a String", "question__title_slug": "maximum-deletions-on-a-string", "question__hide": false, - "total_acs": 6698, - "total_submitted": 14049, + "total_acs": 6727, + "total_submitted": 14098, "total_column_articles": 106, "frontend_question_id": "2430", "is_new_question": false @@ -13263,8 +13914,8 @@ "question__title": "Minimize XOR", "question__title_slug": "minimize-xor", "question__hide": false, - "total_acs": 7244, - "total_submitted": 16353, + "total_acs": 7263, + "total_submitted": 16378, "total_column_articles": 110, "frontend_question_id": "2429", "is_new_question": false @@ -13284,8 +13935,8 @@ "question__title": "Maximum Sum of an Hourglass", "question__title_slug": "maximum-sum-of-an-hourglass", "question__hide": false, - "total_acs": 8166, - "total_submitted": 10934, + "total_acs": 8209, + "total_submitted": 10992, "total_column_articles": 94, "frontend_question_id": "2428", "is_new_question": false @@ -13305,9 +13956,9 @@ "question__title": "Number of Common Factors", "question__title_slug": "number-of-common-factors", "question__hide": false, - "total_acs": 32555, - "total_submitted": 39814, - "total_column_articles": 231, + "total_acs": 32706, + "total_submitted": 40012, + "total_column_articles": 232, "frontend_question_id": "2427", "is_new_question": false }, @@ -13326,8 +13977,8 @@ "question__title": "Minimize Maximum Value in a Grid", "question__title_slug": "minimize-maximum-value-in-a-grid", "question__hide": false, - "total_acs": 214, - "total_submitted": 286, + "total_acs": 217, + "total_submitted": 290, "total_column_articles": 11, "frontend_question_id": "2371", "is_new_question": false @@ -13347,9 +13998,9 @@ "question__title": "Number of Good Paths", "question__title_slug": "number-of-good-paths", "question__hide": false, - "total_acs": 3883, - "total_submitted": 9153, - "total_column_articles": 51, + "total_acs": 3917, + "total_submitted": 9207, + "total_column_articles": 52, "frontend_question_id": "2421", "is_new_question": false }, @@ -13368,9 +14019,9 @@ "question__title": "Find All Good Indices", "question__title_slug": "find-all-good-indices", "question__hide": false, - "total_acs": 7607, - "total_submitted": 24361, - "total_column_articles": 139, + "total_acs": 7643, + "total_submitted": 24433, + "total_column_articles": 140, "frontend_question_id": "2420", "is_new_question": false }, @@ -13389,8 +14040,8 @@ "question__title": "Longest Subarray With Maximum Bitwise AND", "question__title_slug": "longest-subarray-with-maximum-bitwise-and", "question__hide": false, - "total_acs": 8370, - "total_submitted": 19835, + "total_acs": 8412, + "total_submitted": 19910, "total_column_articles": 106, "frontend_question_id": "2419", "is_new_question": false @@ -13410,9 +14061,9 @@ "question__title": "Sort the People", "question__title_slug": "sort-the-people", "question__hide": false, - "total_acs": 35666, - "total_submitted": 44748, - "total_column_articles": 359, + "total_acs": 35904, + "total_submitted": 45088, + "total_column_articles": 362, "frontend_question_id": "2418", "is_new_question": false }, @@ -13431,8 +14082,8 @@ "question__title": "Generate the Invoice", "question__title_slug": "generate-the-invoice", "question__hide": false, - "total_acs": 501, - "total_submitted": 681, + "total_acs": 529, + "total_submitted": 726, "total_column_articles": 14, "frontend_question_id": "2362", "is_new_question": false @@ -13452,8 +14103,8 @@ "question__title": "Minimum Costs Using the Train Line", "question__title_slug": "minimum-costs-using-the-train-line", "question__hide": false, - "total_acs": 314, - "total_submitted": 406, + "total_acs": 320, + "total_submitted": 414, "total_column_articles": 13, "frontend_question_id": "2361", "is_new_question": false @@ -13473,8 +14124,8 @@ "question__title": "Minimum Money Required Before Transactions", "question__title_slug": "minimum-money-required-before-transactions", "question__hide": false, - "total_acs": 3388, - "total_submitted": 7048, + "total_acs": 3434, + "total_submitted": 7138, "total_column_articles": 61, "frontend_question_id": "2412", "is_new_question": false @@ -13494,8 +14145,8 @@ "question__title": "Smallest Subarrays With Maximum Bitwise OR", "question__title_slug": "smallest-subarrays-with-maximum-bitwise-or", "question__hide": false, - "total_acs": 4564, - "total_submitted": 10669, + "total_acs": 4606, + "total_submitted": 10739, "total_column_articles": 61, "frontend_question_id": "2411", "is_new_question": false @@ -13515,9 +14166,9 @@ "question__title": "Maximum Matching of Players With Trainers", "question__title_slug": "maximum-matching-of-players-with-trainers", "question__hide": false, - "total_acs": 6718, - "total_submitted": 10386, - "total_column_articles": 79, + "total_acs": 6769, + "total_submitted": 10468, + "total_column_articles": 80, "frontend_question_id": "2410", "is_new_question": false }, @@ -13536,9 +14187,9 @@ "question__title": "Count Days Spent Together", "question__title_slug": "count-days-spent-together", "question__hide": false, - "total_acs": 25020, - "total_submitted": 44694, - "total_column_articles": 315, + "total_acs": 25091, + "total_submitted": 44811, + "total_column_articles": 316, "frontend_question_id": "2409", "is_new_question": false }, @@ -13557,9 +14208,9 @@ "question__title": "Number of Unique Subjects Taught by Each Teacher", "question__title_slug": "number-of-unique-subjects-taught-by-each-teacher", "question__hide": false, - "total_acs": 2194, - "total_submitted": 2626, - "total_column_articles": 20, + "total_acs": 2732, + "total_submitted": 3290, + "total_column_articles": 21, "frontend_question_id": "2356", "is_new_question": false }, @@ -13578,9 +14229,9 @@ "question__title": "Sum of Prefix Scores of Strings", "question__title_slug": "sum-of-prefix-scores-of-strings", "question__hide": false, - "total_acs": 8794, - "total_submitted": 21777, - "total_column_articles": 122, + "total_acs": 8863, + "total_submitted": 21915, + "total_column_articles": 123, "frontend_question_id": "2416", "is_new_question": false }, @@ -13599,8 +14250,8 @@ "question__title": "Reverse Odd Levels of Binary Tree", "question__title_slug": "reverse-odd-levels-of-binary-tree", "question__hide": false, - "total_acs": 10205, - "total_submitted": 14569, + "total_acs": 10257, + "total_submitted": 14639, "total_column_articles": 135, "frontend_question_id": "2415", "is_new_question": false @@ -13620,9 +14271,9 @@ "question__title": "Length of the Longest Alphabetical Continuous Substring", "question__title_slug": "length-of-the-longest-alphabetical-continuous-substring", "question__hide": false, - "total_acs": 11706, - "total_submitted": 19385, - "total_column_articles": 119, + "total_acs": 11765, + "total_submitted": 19465, + "total_column_articles": 120, "frontend_question_id": "2414", "is_new_question": false }, @@ -13641,9 +14292,9 @@ "question__title": "Smallest Even Multiple", "question__title_slug": "smallest-even-multiple", "question__hide": false, - "total_acs": 43577, - "total_submitted": 49313, - "total_column_articles": 270, + "total_acs": 44324, + "total_submitted": 50260, + "total_column_articles": 277, "frontend_question_id": "2413", "is_new_question": false }, @@ -13662,8 +14313,8 @@ "question__title": "Maximum Number of Books You Can Take", "question__title_slug": "maximum-number-of-books-you-can-take", "question__hide": false, - "total_acs": 306, - "total_submitted": 511, + "total_acs": 309, + "total_submitted": 514, "total_column_articles": 10, "frontend_question_id": "2355", "is_new_question": false @@ -13683,8 +14334,8 @@ "question__title": "Sort Array by Moving Items to Empty Space", "question__title_slug": "sort-array-by-moving-items-to-empty-space", "question__hide": false, - "total_acs": 136, - "total_submitted": 225, + "total_acs": 138, + "total_submitted": 227, "total_column_articles": 3, "frontend_question_id": "2459", "is_new_question": false @@ -13704,9 +14355,9 @@ "question__title": "Divide Intervals Into Minimum Number of Groups", "question__title_slug": "divide-intervals-into-minimum-number-of-groups", "question__hide": false, - "total_acs": 8345, - "total_submitted": 18805, - "total_column_articles": 126, + "total_acs": 8394, + "total_submitted": 18875, + "total_column_articles": 128, "frontend_question_id": "2406", "is_new_question": false }, @@ -13725,9 +14376,9 @@ "question__title": "Optimal Partition of String", "question__title_slug": "optimal-partition-of-string", "question__hide": false, - "total_acs": 10279, - "total_submitted": 13761, - "total_column_articles": 123, + "total_acs": 10336, + "total_submitted": 13832, + "total_column_articles": 124, "frontend_question_id": "2405", "is_new_question": false }, @@ -13746,8 +14397,8 @@ "question__title": "Most Frequent Even Element", "question__title_slug": "most-frequent-even-element", "question__hide": false, - "total_acs": 35634, - "total_submitted": 60951, + "total_acs": 35738, + "total_submitted": 61169, "total_column_articles": 341, "frontend_question_id": "2404", "is_new_question": false @@ -13767,8 +14418,8 @@ "question__title": "Finding the Number of Visible Mountains", "question__title_slug": "finding-the-number-of-visible-mountains", "question__hide": false, - "total_acs": 193, - "total_submitted": 389, + "total_acs": 198, + "total_submitted": 398, "total_column_articles": 6, "frontend_question_id": "2345", "is_new_question": false @@ -13788,8 +14439,8 @@ "question__title": "Compute the Rank as a Percentage", "question__title_slug": "compute-the-rank-as-a-percentage", "question__hide": false, - "total_acs": 683, - "total_submitted": 1845, + "total_acs": 718, + "total_submitted": 1930, "total_column_articles": 9, "frontend_question_id": "2346", "is_new_question": false @@ -13809,9 +14460,9 @@ "question__title": "Task Scheduler II", "question__title_slug": "task-scheduler-ii", "question__hide": false, - "total_acs": 6065, - "total_submitted": 12624, - "total_column_articles": 77, + "total_acs": 6099, + "total_submitted": 12696, + "total_column_articles": 78, "frontend_question_id": "2365", "is_new_question": false }, @@ -13830,8 +14481,8 @@ "question__title": "Maximum Rows Covered by Columns", "question__title_slug": "maximum-rows-covered-by-columns", "question__hide": false, - "total_acs": 5509, - "total_submitted": 10231, + "total_acs": 5584, + "total_submitted": 10338, "total_column_articles": 99, "frontend_question_id": "2397", "is_new_question": false @@ -13851,9 +14502,9 @@ "question__title": "Strictly Palindromic Number", "question__title_slug": "strictly-palindromic-number", "question__hide": false, - "total_acs": 10533, - "total_submitted": 11974, - "total_column_articles": 108, + "total_acs": 10648, + "total_submitted": 12117, + "total_column_articles": 112, "frontend_question_id": "2396", "is_new_question": false }, @@ -13872,8 +14523,8 @@ "question__title": "Find Subarrays With Equal Sum", "question__title_slug": "find-subarrays-with-equal-sum", "question__hide": false, - "total_acs": 27402, - "total_submitted": 35849, + "total_acs": 27481, + "total_submitted": 35985, "total_column_articles": 233, "frontend_question_id": "2395", "is_new_question": false @@ -13893,9 +14544,9 @@ "question__title": "Meeting Rooms III", "question__title_slug": "meeting-rooms-iii", "question__hide": false, - "total_acs": 6012, - "total_submitted": 18498, - "total_column_articles": 115, + "total_acs": 6114, + "total_submitted": 18790, + "total_column_articles": 116, "frontend_question_id": "2402", "is_new_question": false }, @@ -13914,9 +14565,9 @@ "question__title": "Longest Nice Subarray", "question__title_slug": "longest-nice-subarray", "question__hide": false, - "total_acs": 9716, - "total_submitted": 19750, - "total_column_articles": 157, + "total_acs": 10008, + "total_submitted": 20255, + "total_column_articles": 159, "frontend_question_id": "2401", "is_new_question": false }, @@ -13935,9 +14586,9 @@ "question__title": "Number of Ways to Reach a Position After Exactly k Steps", "question__title_slug": "number-of-ways-to-reach-a-position-after-exactly-k-steps", "question__hide": false, - "total_acs": 10763, - "total_submitted": 33036, - "total_column_articles": 154, + "total_acs": 10843, + "total_submitted": 33236, + "total_column_articles": 155, "frontend_question_id": "2400", "is_new_question": false }, @@ -13956,9 +14607,9 @@ "question__title": "Check Distances Between Same Letters", "question__title_slug": "check-distances-between-same-letters", "question__hide": false, - "total_acs": 30493, - "total_submitted": 40519, - "total_column_articles": 300, + "total_acs": 30569, + "total_submitted": 40626, + "total_column_articles": 301, "frontend_question_id": "2399", "is_new_question": false }, @@ -13977,8 +14628,8 @@ "question__title": "Largest Palindromic Number", "question__title_slug": "largest-palindromic-number", "question__hide": false, - "total_acs": 9664, - "total_submitted": 31121, + "total_acs": 9723, + "total_submitted": 31286, "total_column_articles": 147, "frontend_question_id": "2384", "is_new_question": false @@ -13998,8 +14649,8 @@ "question__title": "Minimum Adjacent Swaps to Make a Valid Array", "question__title_slug": "minimum-adjacent-swaps-to-make-a-valid-array", "question__hide": false, - "total_acs": 295, - "total_submitted": 388, + "total_acs": 300, + "total_submitted": 394, "total_column_articles": 9, "frontend_question_id": "2340", "is_new_question": false @@ -14019,9 +14670,9 @@ "question__title": "Max Sum of a Pair With Equal Sum of Digits", "question__title_slug": "max-sum-of-a-pair-with-equal-sum-of-digits", "question__hide": false, - "total_acs": 11217, - "total_submitted": 20935, - "total_column_articles": 139, + "total_acs": 11279, + "total_submitted": 21053, + "total_column_articles": 141, "frontend_question_id": "2342", "is_new_question": false }, @@ -14040,8 +14691,8 @@ "question__title": "Build a Matrix With Conditions", "question__title_slug": "build-a-matrix-with-conditions", "question__hide": false, - "total_acs": 5406, - "total_submitted": 9769, + "total_acs": 5465, + "total_submitted": 9838, "total_column_articles": 93, "frontend_question_id": "2392", "is_new_question": false @@ -14061,9 +14712,9 @@ "question__title": "Minimum Amount of Time to Collect Garbage", "question__title_slug": "minimum-amount-of-time-to-collect-garbage", "question__hide": false, - "total_acs": 9810, - "total_submitted": 11407, - "total_column_articles": 151, + "total_acs": 9883, + "total_submitted": 11506, + "total_column_articles": 155, "frontend_question_id": "2391", "is_new_question": false }, @@ -14082,9 +14733,9 @@ "question__title": "Removing Stars From a String", "question__title_slug": "removing-stars-from-a-string", "question__hide": false, - "total_acs": 11956, - "total_submitted": 17717, - "total_column_articles": 139, + "total_acs": 12389, + "total_submitted": 18272, + "total_column_articles": 143, "frontend_question_id": "2390", "is_new_question": false }, @@ -14103,8 +14754,8 @@ "question__title": "Longest Subsequence With Limited Sum", "question__title_slug": "longest-subsequence-with-limited-sum", "question__hide": false, - "total_acs": 34541, - "total_submitted": 48616, + "total_acs": 34638, + "total_submitted": 48768, "total_column_articles": 340, "frontend_question_id": "2389", "is_new_question": false @@ -14124,8 +14775,8 @@ "question__title": "Valid Palindrome IV", "question__title_slug": "valid-palindrome-iv", "question__hide": false, - "total_acs": 347, - "total_submitted": 423, + "total_acs": 356, + "total_submitted": 435, "total_column_articles": 14, "frontend_question_id": "2330", "is_new_question": false @@ -14145,9 +14796,9 @@ "question__title": "Maximum Segment Sum After Removals", "question__title_slug": "maximum-segment-sum-after-removals", "question__hide": false, - "total_acs": 3797, - "total_submitted": 6781, - "total_column_articles": 86, + "total_acs": 3849, + "total_submitted": 6853, + "total_column_articles": 87, "frontend_question_id": "2382", "is_new_question": false }, @@ -14166,8 +14817,8 @@ "question__title": "Shifting Letters II", "question__title_slug": "shifting-letters-ii", "question__hide": false, - "total_acs": 5376, - "total_submitted": 14706, + "total_acs": 5438, + "total_submitted": 14835, "total_column_articles": 98, "frontend_question_id": "2381", "is_new_question": false @@ -14187,8 +14838,8 @@ "question__title": "Time Needed to Rearrange a Binary String", "question__title_slug": "time-needed-to-rearrange-a-binary-string", "question__hide": false, - "total_acs": 6420, - "total_submitted": 11452, + "total_acs": 6463, + "total_submitted": 11526, "total_column_articles": 71, "frontend_question_id": "2380", "is_new_question": false @@ -14208,9 +14859,9 @@ "question__title": "Minimum Recolors to Get K Consecutive Black Blocks", "question__title_slug": "minimum-recolors-to-get-k-consecutive-black-blocks", "question__hide": false, - "total_acs": 35824, - "total_submitted": 57980, - "total_column_articles": 421, + "total_acs": 35942, + "total_submitted": 58178, + "total_column_articles": 425, "frontend_question_id": "2379", "is_new_question": false }, @@ -14229,8 +14880,8 @@ "question__title": "Find the K-Sum of an Array", "question__title_slug": "find-the-k-sum-of-an-array", "question__hide": false, - "total_acs": 3728, - "total_submitted": 8853, + "total_acs": 3832, + "total_submitted": 9060, "total_column_articles": 49, "frontend_question_id": "2386", "is_new_question": false @@ -14250,8 +14901,8 @@ "question__title": "Amount of Time for Binary Tree to Be Infected", "question__title_slug": "amount-of-time-for-binary-tree-to-be-infected", "question__hide": false, - "total_acs": 8220, - "total_submitted": 17801, + "total_acs": 8249, + "total_submitted": 17859, "total_column_articles": 154, "frontend_question_id": "2385", "is_new_question": false @@ -14271,8 +14922,8 @@ "question__title": "Minimum Hours of Training to Win a Competition", "question__title_slug": "minimum-hours-of-training-to-win-a-competition", "question__hide": false, - "total_acs": 35085, - "total_submitted": 74300, + "total_acs": 35133, + "total_submitted": 74399, "total_column_articles": 358, "frontend_question_id": "2383", "is_new_question": false @@ -14292,8 +14943,8 @@ "question__title": "Find Minimum Time to Finish All Jobs II", "question__title_slug": "find-minimum-time-to-finish-all-jobs-ii", "question__hide": false, - "total_acs": 246, - "total_submitted": 351, + "total_acs": 251, + "total_submitted": 357, "total_column_articles": 10, "frontend_question_id": "2323", "is_new_question": false @@ -14313,8 +14964,8 @@ "question__title": "Count Special Integers", "question__title_slug": "count-special-integers", "question__hide": false, - "total_acs": 7794, - "total_submitted": 15309, + "total_acs": 7851, + "total_submitted": 15391, "total_column_articles": 112, "frontend_question_id": "2376", "is_new_question": false @@ -14334,8 +14985,8 @@ "question__title": "Construct Smallest Number From DI String", "question__title_slug": "construct-smallest-number-from-di-string", "question__hide": false, - "total_acs": 9560, - "total_submitted": 13657, + "total_acs": 9595, + "total_submitted": 13720, "total_column_articles": 211, "frontend_question_id": "2375", "is_new_question": false @@ -14355,8 +15006,8 @@ "question__title": "Node With Highest Edge Score", "question__title_slug": "node-with-highest-edge-score", "question__hide": false, - "total_acs": 9633, - "total_submitted": 22819, + "total_acs": 9660, + "total_submitted": 22875, "total_column_articles": 104, "frontend_question_id": "2374", "is_new_question": false @@ -14376,8 +15027,8 @@ "question__title": "Largest Local Values in a Matrix", "question__title_slug": "largest-local-values-in-a-matrix", "question__hide": false, - "total_acs": 36846, - "total_submitted": 43236, + "total_acs": 36938, + "total_submitted": 43344, "total_column_articles": 307, "frontend_question_id": "2373", "is_new_question": false @@ -14397,8 +15048,8 @@ "question__title": "All the Matches of the League", "question__title_slug": "all-the-matches-of-the-league", "question__hide": false, - "total_acs": 903, - "total_submitted": 1187, + "total_acs": 925, + "total_submitted": 1218, "total_column_articles": 11, "frontend_question_id": "2339", "is_new_question": false @@ -14418,8 +15069,8 @@ "question__title": "Product Sales Analysis V", "question__title_slug": "product-sales-analysis-v", "question__hide": false, - "total_acs": 959, - "total_submitted": 1331, + "total_acs": 990, + "total_submitted": 1368, "total_column_articles": 10, "frontend_question_id": "2329", "is_new_question": false @@ -14439,8 +15090,8 @@ "question__title": "Product Sales Analysis IV", "question__title_slug": "product-sales-analysis-iv", "question__hide": false, - "total_acs": 787, - "total_submitted": 1116, + "total_acs": 806, + "total_submitted": 1140, "total_column_articles": 10, "frontend_question_id": "2324", "is_new_question": false @@ -14460,8 +15111,8 @@ "question__title": "Minimum Replacements to Sort the Array", "question__title_slug": "minimum-replacements-to-sort-the-array", "question__hide": false, - "total_acs": 4090, - "total_submitted": 9653, + "total_acs": 4112, + "total_submitted": 9701, "total_column_articles": 47, "frontend_question_id": "2366", "is_new_question": false @@ -14481,9 +15132,9 @@ "question__title": "Maximum Number of Robots Within Budget", "question__title_slug": "maximum-number-of-robots-within-budget", "question__hide": false, - "total_acs": 4082, - "total_submitted": 12027, - "total_column_articles": 80, + "total_acs": 4138, + "total_submitted": 12121, + "total_column_articles": 83, "frontend_question_id": "2398", "is_new_question": false }, @@ -14502,8 +15153,8 @@ "question__title": "Count Number of Bad Pairs", "question__title_slug": "count-number-of-bad-pairs", "question__hide": false, - "total_acs": 6190, - "total_submitted": 14703, + "total_acs": 6215, + "total_submitted": 14747, "total_column_articles": 86, "frontend_question_id": "2364", "is_new_question": false @@ -14523,8 +15174,8 @@ "question__title": "Merge Similar Items", "question__title_slug": "merge-similar-items", "question__hide": false, - "total_acs": 34396, - "total_submitted": 43892, + "total_acs": 34475, + "total_submitted": 44037, "total_column_articles": 292, "frontend_question_id": "2363", "is_new_question": false @@ -14544,8 +15195,8 @@ "question__title": "The First Day of the Maximum Recorded Degree in Each City", "question__title_slug": "the-first-day-of-the-maximum-recorded-degree-in-each-city", "question__hide": false, - "total_acs": 786, - "total_submitted": 1096, + "total_acs": 805, + "total_submitted": 1121, "total_column_articles": 12, "frontend_question_id": "2314", "is_new_question": false @@ -14565,8 +15216,8 @@ "question__title": "Reachable Nodes With Restrictions", "question__title_slug": "reachable-nodes-with-restrictions", "question__hide": false, - "total_acs": 9736, - "total_submitted": 21192, + "total_acs": 9765, + "total_submitted": 21251, "total_column_articles": 146, "frontend_question_id": "2368", "is_new_question": false @@ -14586,8 +15237,8 @@ "question__title": "Longest Ideal Subsequence", "question__title_slug": "longest-ideal-subsequence", "question__hide": false, - "total_acs": 8197, - "total_submitted": 19080, + "total_acs": 8234, + "total_submitted": 19178, "total_column_articles": 114, "frontend_question_id": "2370", "is_new_question": false @@ -14607,8 +15258,8 @@ "question__title": "Check if There is a Valid Partition For The Array", "question__title_slug": "check-if-there-is-a-valid-partition-for-the-array", "question__hide": false, - "total_acs": 8615, - "total_submitted": 22475, + "total_acs": 8655, + "total_submitted": 22566, "total_column_articles": 115, "frontend_question_id": "2369", "is_new_question": false @@ -14628,8 +15279,8 @@ "question__title": "Number of Arithmetic Triplets", "question__title_slug": "number-of-arithmetic-triplets", "question__hide": false, - "total_acs": 40746, - "total_submitted": 48823, + "total_acs": 40920, + "total_submitted": 49040, "total_column_articles": 377, "frontend_question_id": "2367", "is_new_question": false @@ -14649,8 +15300,8 @@ "question__title": "Arrange Table by Gender", "question__title_slug": "arrange-table-by-gender", "question__hide": false, - "total_acs": 822, - "total_submitted": 1068, + "total_acs": 839, + "total_submitted": 1091, "total_column_articles": 13, "frontend_question_id": "2308", "is_new_question": false @@ -14670,8 +15321,8 @@ "question__title": "Tasks Count in the Weekend", "question__title_slug": "tasks-count-in-the-weekend", "question__hide": false, - "total_acs": 901, - "total_submitted": 1137, + "total_acs": 933, + "total_submitted": 1180, "total_column_articles": 11, "frontend_question_id": "2298", "is_new_question": false @@ -14691,9 +15342,9 @@ "question__title": "Longest Cycle in a Graph", "question__title_slug": "longest-cycle-in-a-graph", "question__hide": false, - "total_acs": 7913, - "total_submitted": 20980, - "total_column_articles": 140, + "total_acs": 7983, + "total_submitted": 21156, + "total_column_articles": 141, "frontend_question_id": "2360", "is_new_question": false }, @@ -14712,8 +15363,8 @@ "question__title": "Find Closest Node to Given Two Nodes", "question__title_slug": "find-closest-node-to-given-two-nodes", "question__hide": false, - "total_acs": 7815, - "total_submitted": 25947, + "total_acs": 7855, + "total_submitted": 26045, "total_column_articles": 109, "frontend_question_id": "2359", "is_new_question": false @@ -14733,8 +15384,8 @@ "question__title": "Maximum Number of Groups Entering a Competition", "question__title_slug": "maximum-number-of-groups-entering-a-competition", "question__hide": false, - "total_acs": 10412, - "total_submitted": 16216, + "total_acs": 10451, + "total_submitted": 16268, "total_column_articles": 170, "frontend_question_id": "2358", "is_new_question": false @@ -14754,9 +15405,9 @@ "question__title": "Make Array Zero by Subtracting Equal Amounts", "question__title_slug": "make-array-zero-by-subtracting-equal-amounts", "question__hide": false, - "total_acs": 41591, - "total_submitted": 54705, - "total_column_articles": 465, + "total_acs": 41696, + "total_submitted": 54857, + "total_column_articles": 464, "frontend_question_id": "2357", "is_new_question": false }, @@ -14775,8 +15426,8 @@ "question__title": "Shortest Impossible Sequence of Rolls", "question__title_slug": "shortest-impossible-sequence-of-rolls", "question__hide": false, - "total_acs": 3976, - "total_submitted": 6154, + "total_acs": 4003, + "total_submitted": 6194, "total_column_articles": 72, "frontend_question_id": "2350", "is_new_question": false @@ -14796,9 +15447,9 @@ "question__title": "Design a Number Container System", "question__title_slug": "design-a-number-container-system", "question__hide": false, - "total_acs": 6257, - "total_submitted": 16755, - "total_column_articles": 92, + "total_acs": 6302, + "total_submitted": 16859, + "total_column_articles": 94, "frontend_question_id": "2349", "is_new_question": false }, @@ -14817,8 +15468,8 @@ "question__title": "Best Poker Hand", "question__title_slug": "best-poker-hand", "question__hide": false, - "total_acs": 31988, - "total_submitted": 53836, + "total_acs": 32043, + "total_submitted": 53937, "total_column_articles": 284, "frontend_question_id": "2347", "is_new_question": false @@ -14838,9 +15489,9 @@ "question__title": "Number of Zero-Filled Subarrays", "question__title_slug": "number-of-zero-filled-subarrays", "question__hide": false, - "total_acs": 7904, - "total_submitted": 14063, - "total_column_articles": 113, + "total_acs": 7959, + "total_submitted": 14158, + "total_column_articles": 114, "frontend_question_id": "2348", "is_new_question": false }, @@ -14859,8 +15510,8 @@ "question__title": "Products With Three or More Orders in Two Consecutive Years", "question__title_slug": "products-with-three-or-more-orders-in-two-consecutive-years", "question__hide": false, - "total_acs": 894, - "total_submitted": 2050, + "total_acs": 925, + "total_submitted": 2107, "total_column_articles": 14, "frontend_question_id": "2292", "is_new_question": false @@ -14880,8 +15531,8 @@ "question__title": "Number of Excellent Pairs", "question__title_slug": "number-of-excellent-pairs", "question__hide": false, - "total_acs": 6167, - "total_submitted": 13917, + "total_acs": 6182, + "total_submitted": 13942, "total_column_articles": 74, "frontend_question_id": "2354", "is_new_question": false @@ -14901,9 +15552,9 @@ "question__title": "Design a Food Rating System", "question__title_slug": "design-a-food-rating-system", "question__hide": false, - "total_acs": 7562, - "total_submitted": 24662, - "total_column_articles": 115, + "total_acs": 7620, + "total_submitted": 24843, + "total_column_articles": 116, "frontend_question_id": "2353", "is_new_question": false }, @@ -14922,9 +15573,9 @@ "question__title": "Equal Row and Column Pairs", "question__title_slug": "equal-row-and-column-pairs", "question__hide": false, - "total_acs": 11682, - "total_submitted": 16247, - "total_column_articles": 119, + "total_acs": 12012, + "total_submitted": 16696, + "total_column_articles": 127, "frontend_question_id": "2352", "is_new_question": false }, @@ -14943,9 +15594,9 @@ "question__title": "First Letter to Appear Twice", "question__title_slug": "first-letter-to-appear-twice", "question__hide": false, - "total_acs": 39377, - "total_submitted": 46392, - "total_column_articles": 397, + "total_acs": 39583, + "total_submitted": 46692, + "total_column_articles": 399, "frontend_question_id": "2351", "is_new_question": false }, @@ -14964,8 +15615,8 @@ "question__title": "Maximum Profit From Trading Stocks", "question__title_slug": "maximum-profit-from-trading-stocks", "question__hide": false, - "total_acs": 375, - "total_submitted": 627, + "total_acs": 389, + "total_submitted": 660, "total_column_articles": 14, "frontend_question_id": "2291", "is_new_question": false @@ -14985,8 +15636,8 @@ "question__title": "Number of People That Can Be Seen in a Grid", "question__title_slug": "number-of-people-that-can-be-seen-in-a-grid", "question__hide": false, - "total_acs": 207, - "total_submitted": 419, + "total_acs": 211, + "total_submitted": 432, "total_column_articles": 10, "frontend_question_id": "2282", "is_new_question": false @@ -15006,8 +15657,8 @@ "question__title": "Minimum Deletions to Make Array Divisible", "question__title_slug": "minimum-deletions-to-make-array-divisible", "question__hide": false, - "total_acs": 8327, - "total_submitted": 15678, + "total_acs": 8353, + "total_submitted": 15721, "total_column_articles": 116, "frontend_question_id": "2344", "is_new_question": false @@ -15027,9 +15678,9 @@ "question__title": "Query Kth Smallest Trimmed Number", "question__title_slug": "query-kth-smallest-trimmed-number", "question__hide": false, - "total_acs": 9241, - "total_submitted": 22432, - "total_column_articles": 139, + "total_acs": 9299, + "total_submitted": 22542, + "total_column_articles": 142, "frontend_question_id": "2343", "is_new_question": false }, @@ -15048,9 +15699,9 @@ "question__title": "Maximum Number of Pairs in Array", "question__title_slug": "maximum-number-of-pairs-in-array", "question__hide": false, - "total_acs": 39037, - "total_submitted": 48005, - "total_column_articles": 469, + "total_acs": 39131, + "total_submitted": 48123, + "total_column_articles": 470, "frontend_question_id": "2341", "is_new_question": false }, @@ -15069,8 +15720,8 @@ "question__title": "Closest Node to Path in Tree", "question__title_slug": "closest-node-to-path-in-tree", "question__hide": false, - "total_acs": 337, - "total_submitted": 475, + "total_acs": 342, + "total_submitted": 482, "total_column_articles": 13, "frontend_question_id": "2277", "is_new_question": false @@ -15090,8 +15741,8 @@ "question__title": "Subarray With Elements Greater Than Varying Threshold", "question__title_slug": "subarray-with-elements-greater-than-varying-threshold", "question__hide": false, - "total_acs": 3210, - "total_submitted": 6820, + "total_acs": 3240, + "total_submitted": 6882, "total_column_articles": 53, "frontend_question_id": "2334", "is_new_question": false @@ -15111,8 +15762,8 @@ "question__title": "Minimum Sum of Squared Difference", "question__title_slug": "minimum-sum-of-squared-difference", "question__hide": false, - "total_acs": 4735, - "total_submitted": 17853, + "total_acs": 4770, + "total_submitted": 17980, "total_column_articles": 74, "frontend_question_id": "2333", "is_new_question": false @@ -15132,8 +15783,8 @@ "question__title": "The Latest Time to Catch a Bus", "question__title_slug": "the-latest-time-to-catch-a-bus", "question__hide": false, - "total_acs": 5230, - "total_submitted": 21870, + "total_acs": 5276, + "total_submitted": 22005, "total_column_articles": 91, "frontend_question_id": "2332", "is_new_question": false @@ -15153,8 +15804,8 @@ "question__title": "Evaluate Boolean Binary Tree", "question__title_slug": "evaluate-boolean-binary-tree", "question__hide": false, - "total_acs": 31470, - "total_submitted": 37400, + "total_acs": 31633, + "total_submitted": 37605, "total_column_articles": 350, "frontend_question_id": "2331", "is_new_question": false @@ -15174,8 +15825,8 @@ "question__title": "Count the Number of Ideal Arrays", "question__title_slug": "count-the-number-of-ideal-arrays", "question__hide": false, - "total_acs": 2789, - "total_submitted": 9178, + "total_acs": 2803, + "total_submitted": 9203, "total_column_articles": 44, "frontend_question_id": "2338", "is_new_question": false @@ -15195,9 +15846,9 @@ "question__title": "Move Pieces to Obtain a String", "question__title_slug": "move-pieces-to-obtain-a-string", "question__hide": false, - "total_acs": 8040, - "total_submitted": 20559, - "total_column_articles": 123, + "total_acs": 8093, + "total_submitted": 20657, + "total_column_articles": 124, "frontend_question_id": "2337", "is_new_question": false }, @@ -15216,9 +15867,9 @@ "question__title": "Smallest Number in Infinite Set", "question__title_slug": "smallest-number-in-infinite-set", "question__hide": false, - "total_acs": 9717, - "total_submitted": 13819, - "total_column_articles": 128, + "total_acs": 9911, + "total_submitted": 14103, + "total_column_articles": 131, "frontend_question_id": "2336", "is_new_question": false }, @@ -15237,8 +15888,8 @@ "question__title": "Minimum Amount of Time to Fill Cups", "question__title_slug": "minimum-amount-of-time-to-fill-cups", "question__hide": false, - "total_acs": 33023, - "total_submitted": 51122, + "total_acs": 33099, + "total_submitted": 51262, "total_column_articles": 391, "frontend_question_id": "2335", "is_new_question": false @@ -15258,8 +15909,8 @@ "question__title": "Spiral Matrix IV", "question__title_slug": "spiral-matrix-iv", "question__hide": false, - "total_acs": 9916, - "total_submitted": 14856, + "total_acs": 9962, + "total_submitted": 14930, "total_column_articles": 134, "frontend_question_id": "2326", "is_new_question": false @@ -15279,8 +15930,8 @@ "question__title": "Number of Increasing Paths in a Grid", "question__title_slug": "number-of-increasing-paths-in-a-grid", "question__hide": false, - "total_acs": 6188, - "total_submitted": 12202, + "total_acs": 6226, + "total_submitted": 12269, "total_column_articles": 112, "frontend_question_id": "2328", "is_new_question": false @@ -15300,9 +15951,9 @@ "question__title": "Number of People Aware of a Secret", "question__title_slug": "number-of-people-aware-of-a-secret", "question__hide": false, - "total_acs": 9741, - "total_submitted": 21238, - "total_column_articles": 195, + "total_acs": 9817, + "total_submitted": 21395, + "total_column_articles": 197, "frontend_question_id": "2327", "is_new_question": false }, @@ -15321,9 +15972,9 @@ "question__title": "Decode the Message", "question__title_slug": "decode-the-message", "question__hide": false, - "total_acs": 42760, - "total_submitted": 49626, - "total_column_articles": 422, + "total_acs": 42933, + "total_submitted": 49887, + "total_column_articles": 421, "frontend_question_id": "2325", "is_new_question": false }, @@ -15342,8 +15993,8 @@ "question__title": "Minimum Number of Keypresses", "question__title_slug": "minimum-number-of-keypresses", "question__hide": false, - "total_acs": 451, - "total_submitted": 662, + "total_acs": 459, + "total_submitted": 674, "total_column_articles": 18, "frontend_question_id": "2268", "is_new_question": false @@ -15363,8 +16014,8 @@ "question__title": "Number of Distinct Roll Sequences", "question__title_slug": "number-of-distinct-roll-sequences", "question__hide": false, - "total_acs": 3548, - "total_submitted": 6239, + "total_acs": 3575, + "total_submitted": 6280, "total_column_articles": 67, "frontend_question_id": "2318", "is_new_question": false @@ -15384,8 +16035,8 @@ "question__title": "Count Unreachable Pairs of Nodes in an Undirected Graph", "question__title_slug": "count-unreachable-pairs-of-nodes-in-an-undirected-graph", "question__hide": false, - "total_acs": 6874, - "total_submitted": 17631, + "total_acs": 6937, + "total_submitted": 17735, "total_column_articles": 118, "frontend_question_id": "2316", "is_new_question": false @@ -15405,9 +16056,9 @@ "question__title": "Maximum XOR After Operations ", "question__title_slug": "maximum-xor-after-operations", "question__hide": false, - "total_acs": 5222, - "total_submitted": 6130, - "total_column_articles": 64, + "total_acs": 5278, + "total_submitted": 6195, + "total_column_articles": 65, "frontend_question_id": "2317", "is_new_question": false }, @@ -15426,9 +16077,9 @@ "question__title": "Count Asterisks", "question__title_slug": "count-asterisks", "question__hide": false, - "total_acs": 34430, - "total_submitted": 39995, - "total_column_articles": 456, + "total_acs": 34634, + "total_submitted": 40252, + "total_column_articles": 457, "frontend_question_id": "2315", "is_new_question": false }, @@ -15447,8 +16098,8 @@ "question__title": "Minimum Score After Removals on a Tree", "question__title_slug": "minimum-score-after-removals-on-a-tree", "question__hide": false, - "total_acs": 3428, - "total_submitted": 5812, + "total_acs": 3429, + "total_submitted": 5814, "total_column_articles": 55, "frontend_question_id": "2322", "is_new_question": false @@ -15468,8 +16119,8 @@ "question__title": "Minimum Flips in Binary Tree to Get Result", "question__title_slug": "minimum-flips-in-binary-tree-to-get-result", "question__hide": false, - "total_acs": 206, - "total_submitted": 302, + "total_acs": 209, + "total_submitted": 308, "total_column_articles": 15, "frontend_question_id": "2313", "is_new_question": false @@ -15489,8 +16140,8 @@ "question__title": "Check if Matrix Is X-Matrix", "question__title_slug": "check-if-matrix-is-x-matrix", "question__hide": false, - "total_acs": 35995, - "total_submitted": 47152, + "total_acs": 36103, + "total_submitted": 47303, "total_column_articles": 335, "frontend_question_id": "2319", "is_new_question": false @@ -15510,8 +16161,8 @@ "question__title": "Count Number of Ways to Place Houses", "question__title_slug": "count-number-of-ways-to-place-houses", "question__hide": false, - "total_acs": 8409, - "total_submitted": 20823, + "total_acs": 8462, + "total_submitted": 20960, "total_column_articles": 93, "frontend_question_id": "2320", "is_new_question": false @@ -15531,8 +16182,8 @@ "question__title": "Design Video Sharing Platform", "question__title_slug": "design-video-sharing-platform", "question__hide": false, - "total_acs": 142, - "total_submitted": 226, + "total_acs": 146, + "total_submitted": 234, "total_column_articles": 6, "frontend_question_id": "2254", "is_new_question": false @@ -15552,8 +16203,8 @@ "question__title": "Longest Binary Subsequence Less Than or Equal to K", "question__title_slug": "longest-binary-subsequence-less-than-or-equal-to-k", "question__hide": false, - "total_acs": 7263, - "total_submitted": 19650, + "total_acs": 7285, + "total_submitted": 19707, "total_column_articles": 132, "frontend_question_id": "2311", "is_new_question": false @@ -15573,8 +16224,8 @@ "question__title": "Count Subarrays With Score Less Than K", "question__title_slug": "count-subarrays-with-score-less-than-k", "question__hide": false, - "total_acs": 5251, - "total_submitted": 10396, + "total_acs": 5286, + "total_submitted": 10470, "total_column_articles": 80, "frontend_question_id": "2302", "is_new_question": false @@ -15594,8 +16245,8 @@ "question__title": "Match Substring After Replacement", "question__title_slug": "match-substring-after-replacement", "question__hide": false, - "total_acs": 4294, - "total_submitted": 9502, + "total_acs": 4302, + "total_submitted": 9517, "total_column_articles": 67, "frontend_question_id": "2301", "is_new_question": false @@ -15615,9 +16266,9 @@ "question__title": "Successful Pairs of Spells and Potions", "question__title_slug": "successful-pairs-of-spells-and-potions", "question__hide": false, - "total_acs": 7245, - "total_submitted": 18751, - "total_column_articles": 102, + "total_acs": 7534, + "total_submitted": 19406, + "total_column_articles": 104, "frontend_question_id": "2300", "is_new_question": false }, @@ -15636,8 +16287,8 @@ "question__title": "Strong Password Checker II", "question__title_slug": "strong-password-checker-ii", "question__hide": false, - "total_acs": 24911, - "total_submitted": 37868, + "total_acs": 24971, + "total_submitted": 37977, "total_column_articles": 292, "frontend_question_id": "2299", "is_new_question": false @@ -15657,8 +16308,8 @@ "question__title": "Naming a Company", "question__title_slug": "naming-a-company", "question__hide": false, - "total_acs": 4534, - "total_submitted": 10244, + "total_acs": 4554, + "total_submitted": 10289, "total_column_articles": 66, "frontend_question_id": "2306", "is_new_question": false @@ -15678,8 +16329,8 @@ "question__title": "Design a Text Editor", "question__title_slug": "design-a-text-editor", "question__hide": false, - "total_acs": 6857, - "total_submitted": 15615, + "total_acs": 6919, + "total_submitted": 15721, "total_column_articles": 124, "frontend_question_id": "2296", "is_new_question": false @@ -15699,8 +16350,8 @@ "question__title": "Replace Elements in an Array", "question__title_slug": "replace-elements-in-an-array", "question__hide": false, - "total_acs": 8628, - "total_submitted": 14939, + "total_acs": 8660, + "total_submitted": 14994, "total_column_articles": 114, "frontend_question_id": "2295", "is_new_question": false @@ -15720,8 +16371,8 @@ "question__title": "Partition Array Such That Maximum Difference Is K", "question__title_slug": "partition-array-such-that-maximum-difference-is-k", "question__hide": false, - "total_acs": 8345, - "total_submitted": 12268, + "total_acs": 8367, + "total_submitted": 12322, "total_column_articles": 110, "frontend_question_id": "2294", "is_new_question": false @@ -15741,8 +16392,8 @@ "question__title": "Min Max Game", "question__title_slug": "min-max-game", "question__hide": false, - "total_acs": 28883, - "total_submitted": 39527, + "total_acs": 28951, + "total_submitted": 39638, "total_column_articles": 315, "frontend_question_id": "2293", "is_new_question": false @@ -15762,8 +16413,8 @@ "question__title": "Count Positions on Street With Required Brightness", "question__title_slug": "count-positions-on-street-with-required-brightness", "question__hide": false, - "total_acs": 295, - "total_submitted": 397, + "total_acs": 298, + "total_submitted": 400, "total_column_articles": 16, "frontend_question_id": "2237", "is_new_question": false @@ -15783,9 +16434,9 @@ "question__title": "Root Equals Sum of Children", "question__title_slug": "root-equals-sum-of-children", "question__hide": false, - "total_acs": 20837, - "total_submitted": 24142, - "total_column_articles": 149, + "total_acs": 21219, + "total_submitted": 24617, + "total_column_articles": 155, "frontend_question_id": "2236", "is_new_question": false }, @@ -15804,9 +16455,9 @@ "question__title": "Add Two Integers", "question__title_slug": "add-two-integers", "question__hide": false, - "total_acs": 30213, - "total_submitted": 34892, - "total_column_articles": 135, + "total_acs": 31050, + "total_submitted": 35872, + "total_column_articles": 139, "frontend_question_id": "2235", "is_new_question": false }, @@ -15825,8 +16476,8 @@ "question__title": "Dynamic Unpivoting of a Table", "question__title_slug": "dynamic-unpivoting-of-a-table", "question__hide": false, - "total_acs": 236, - "total_submitted": 335, + "total_acs": 244, + "total_submitted": 344, "total_column_articles": 3, "frontend_question_id": "2253", "is_new_question": false @@ -15846,8 +16497,8 @@ "question__title": "Dynamic Pivoting of a Table", "question__title_slug": "dynamic-pivoting-of-a-table", "question__hide": false, - "total_acs": 265, - "total_submitted": 463, + "total_acs": 271, + "total_submitted": 472, "total_column_articles": 3, "frontend_question_id": "2252", "is_new_question": false @@ -15867,9 +16518,9 @@ "question__title": "Booking Concert Tickets in Groups", "question__title_slug": "booking-concert-tickets-in-groups", "question__hide": false, - "total_acs": 3047, - "total_submitted": 13304, - "total_column_articles": 57, + "total_acs": 3075, + "total_submitted": 13364, + "total_column_articles": 59, "frontend_question_id": "2286", "is_new_question": false }, @@ -15888,8 +16539,8 @@ "question__title": "Maximum Total Importance of Roads", "question__title_slug": "maximum-total-importance-of-roads", "question__hide": false, - "total_acs": 6047, - "total_submitted": 10518, + "total_acs": 6080, + "total_submitted": 10573, "total_column_articles": 88, "frontend_question_id": "2285", "is_new_question": false @@ -15909,9 +16560,9 @@ "question__title": "Sender With Largest Word Count", "question__title_slug": "sender-with-largest-word-count", "question__hide": false, - "total_acs": 6405, - "total_submitted": 11276, - "total_column_articles": 90, + "total_acs": 6448, + "total_submitted": 11351, + "total_column_articles": 92, "frontend_question_id": "2284", "is_new_question": false }, @@ -15930,9 +16581,9 @@ "question__title": "Check if Number Has Equal Digit Count and Digit Value", "question__title_slug": "check-if-number-has-equal-digit-count-and-digit-value", "question__hide": false, - "total_acs": 31168, - "total_submitted": 39353, - "total_column_articles": 374, + "total_acs": 31356, + "total_submitted": 39615, + "total_column_articles": 375, "frontend_question_id": "2283", "is_new_question": false }, @@ -15951,8 +16602,8 @@ "question__title": "Number of Times a Driver Was a Passenger", "question__title_slug": "number-of-times-a-driver-was-a-passenger", "question__hide": false, - "total_acs": 1023, - "total_submitted": 1467, + "total_acs": 1047, + "total_submitted": 1506, "total_column_articles": 14, "frontend_question_id": "2238", "is_new_question": false @@ -15972,8 +16623,8 @@ "question__title": "Minimum Obstacle Removal to Reach Corner", "question__title_slug": "minimum-obstacle-removal-to-reach-corner", "question__hide": false, - "total_acs": 5879, - "total_submitted": 10548, + "total_acs": 5982, + "total_submitted": 10673, "total_column_articles": 94, "frontend_question_id": "2290", "is_new_question": false @@ -15993,8 +16644,8 @@ "question__title": "Steps to Make Array Non-decreasing", "question__title_slug": "steps-to-make-array-non-decreasing", "question__hide": false, - "total_acs": 5716, - "total_submitted": 26308, + "total_acs": 5754, + "total_submitted": 26437, "total_column_articles": 96, "frontend_question_id": "2289", "is_new_question": false @@ -16014,8 +16665,8 @@ "question__title": "Apply Discount to Prices", "question__title_slug": "apply-discount-to-prices", "question__hide": false, - "total_acs": 8202, - "total_submitted": 26111, + "total_acs": 8225, + "total_submitted": 26163, "total_column_articles": 113, "frontend_question_id": "2288", "is_new_question": false @@ -16035,8 +16686,8 @@ "question__title": "Rearrange Characters to Make Target String", "question__title_slug": "rearrange-characters-to-make-target-string", "question__hide": false, - "total_acs": 31740, - "total_submitted": 48688, + "total_acs": 31781, + "total_submitted": 48760, "total_column_articles": 421, "frontend_question_id": "2287", "is_new_question": false @@ -16056,8 +16707,8 @@ "question__title": "The Users That Are Eligible for Discount", "question__title_slug": "the-users-that-are-eligible-for-discount", "question__hide": false, - "total_acs": 991, - "total_submitted": 1998, + "total_acs": 1016, + "total_submitted": 2044, "total_column_articles": 9, "frontend_question_id": "2230", "is_new_question": false @@ -16077,8 +16728,8 @@ "question__title": "Users With Two Purchases Within Seven Days", "question__title_slug": "users-with-two-purchases-within-seven-days", "question__hide": false, - "total_acs": 1092, - "total_submitted": 2324, + "total_acs": 1128, + "total_submitted": 2397, "total_column_articles": 19, "frontend_question_id": "2228", "is_new_question": false @@ -16098,8 +16749,8 @@ "question__title": "Maximum Sum Score of Array", "question__title_slug": "maximum-sum-score-of-array", "question__hide": false, - "total_acs": 302, - "total_submitted": 477, + "total_acs": 304, + "total_submitted": 480, "total_column_articles": 15, "frontend_question_id": "2219", "is_new_question": false @@ -16119,8 +16770,8 @@ "question__title": "Sum of Total Strength of Wizards", "question__title_slug": "sum-of-total-strength-of-wizards", "question__hide": false, - "total_acs": 3987, - "total_submitted": 15116, + "total_acs": 4016, + "total_submitted": 15193, "total_column_articles": 71, "frontend_question_id": "2281", "is_new_question": false @@ -16140,9 +16791,9 @@ "question__title": "Minimum Lines to Represent a Line Chart", "question__title_slug": "minimum-lines-to-represent-a-line-chart", "question__hide": false, - "total_acs": 9450, - "total_submitted": 42400, - "total_column_articles": 153, + "total_acs": 9507, + "total_submitted": 42574, + "total_column_articles": 154, "frontend_question_id": "2280", "is_new_question": false }, @@ -16161,8 +16812,8 @@ "question__title": "Maximum Bags With Full Capacity of Rocks", "question__title_slug": "maximum-bags-with-full-capacity-of-rocks", "question__hide": false, - "total_acs": 13141, - "total_submitted": 20529, + "total_acs": 13232, + "total_submitted": 20704, "total_column_articles": 137, "frontend_question_id": "2279", "is_new_question": false @@ -16182,9 +16833,9 @@ "question__title": "Percentage of Letter in String", "question__title_slug": "percentage-of-letter-in-string", "question__hide": false, - "total_acs": 14662, - "total_submitted": 18141, - "total_column_articles": 132, + "total_acs": 14757, + "total_submitted": 18255, + "total_column_articles": 133, "frontend_question_id": "2278", "is_new_question": false }, @@ -16203,8 +16854,8 @@ "question__title": "Longest Path With Different Adjacent Characters", "question__title_slug": "longest-path-with-different-adjacent-characters", "question__hide": false, - "total_acs": 5436, - "total_submitted": 11667, + "total_acs": 5562, + "total_submitted": 11894, "total_column_articles": 69, "frontend_question_id": "2246", "is_new_question": false @@ -16224,9 +16875,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": 4573, - "total_submitted": 12750, - "total_column_articles": 97, + "total_acs": 4591, + "total_submitted": 12776, + "total_column_articles": 98, "frontend_question_id": "2245", "is_new_question": false }, @@ -16245,9 +16896,9 @@ "question__title": "Minimum Rounds to Complete All Tasks", "question__title_slug": "minimum-rounds-to-complete-all-tasks", "question__hide": false, - "total_acs": 10776, - "total_submitted": 18905, - "total_column_articles": 156, + "total_acs": 10829, + "total_submitted": 18981, + "total_column_articles": 157, "frontend_question_id": "2244", "is_new_question": false }, @@ -16266,9 +16917,9 @@ "question__title": "Calculate Digit Sum of a String", "question__title_slug": "calculate-digit-sum-of-a-string", "question__hide": false, - "total_acs": 11921, - "total_submitted": 18819, - "total_column_articles": 162, + "total_acs": 12002, + "total_submitted": 18944, + "total_column_articles": 163, "frontend_question_id": "2243", "is_new_question": false }, @@ -16287,8 +16938,8 @@ "question__title": "Substring With Largest Variance", "question__title_slug": "substring-with-largest-variance", "question__hide": false, - "total_acs": 3684, - "total_submitted": 9503, + "total_acs": 3700, + "total_submitted": 9541, "total_column_articles": 42, "frontend_question_id": "2272", "is_new_question": false @@ -16308,9 +16959,9 @@ "question__title": "Maximum White Tiles Covered by a Carpet", "question__title_slug": "maximum-white-tiles-covered-by-a-carpet", "question__hide": false, - "total_acs": 5868, - "total_submitted": 18084, - "total_column_articles": 98, + "total_acs": 5897, + "total_submitted": 18154, + "total_column_articles": 99, "frontend_question_id": "2271", "is_new_question": false }, @@ -16329,8 +16980,8 @@ "question__title": "Number of Ways to Split Array", "question__title_slug": "number-of-ways-to-split-array", "question__hide": false, - "total_acs": 6683, - "total_submitted": 14390, + "total_acs": 6709, + "total_submitted": 14446, "total_column_articles": 75, "frontend_question_id": "2270", "is_new_question": false @@ -16350,8 +17001,8 @@ "question__title": "Count Integers in Intervals", "question__title_slug": "count-integers-in-intervals", "question__hide": false, - "total_acs": 6111, - "total_submitted": 16656, + "total_acs": 6136, + "total_submitted": 16701, "total_column_articles": 99, "frontend_question_id": "2276", "is_new_question": false @@ -16371,8 +17022,8 @@ "question__title": "Largest Combination With Bitwise AND Greater Than Zero", "question__title_slug": "largest-combination-with-bitwise-and-greater-than-zero", "question__hide": false, - "total_acs": 7984, - "total_submitted": 13348, + "total_acs": 8028, + "total_submitted": 13397, "total_column_articles": 102, "frontend_question_id": "2275", "is_new_question": false @@ -16392,8 +17043,8 @@ "question__title": "Maximum Consecutive Floors Without Special Floors", "question__title_slug": "maximum-consecutive-floors-without-special-floors", "question__hide": false, - "total_acs": 9873, - "total_submitted": 18783, + "total_acs": 9906, + "total_submitted": 18844, "total_column_articles": 108, "frontend_question_id": "2274", "is_new_question": false @@ -16434,8 +17085,8 @@ "question__title": "Maximum Score of a Node Sequence", "question__title_slug": "maximum-score-of-a-node-sequence", "question__hide": false, - "total_acs": 3132, - "total_submitted": 9286, + "total_acs": 3164, + "total_submitted": 9344, "total_column_articles": 46, "frontend_question_id": "2242", "is_new_question": false @@ -16455,8 +17106,8 @@ "question__title": "Design an ATM Machine", "question__title_slug": "design-an-atm-machine", "question__hide": false, - "total_acs": 6593, - "total_submitted": 18157, + "total_acs": 6656, + "total_submitted": 18312, "total_column_articles": 78, "frontend_question_id": "2241", "is_new_question": false @@ -16476,8 +17127,8 @@ "question__title": "Number of Ways to Buy Pens and Pencils", "question__title_slug": "number-of-ways-to-buy-pens-and-pencils", "question__hide": false, - "total_acs": 6817, - "total_submitted": 11855, + "total_acs": 6864, + "total_submitted": 11924, "total_column_articles": 80, "frontend_question_id": "2240", "is_new_question": false @@ -16497,8 +17148,8 @@ "question__title": "Find Closest Number to Zero", "question__title_slug": "find-closest-number-to-zero", "question__hide": false, - "total_acs": 11094, - "total_submitted": 20674, + "total_acs": 11176, + "total_submitted": 20839, "total_column_articles": 136, "frontend_question_id": "2239", "is_new_question": false @@ -16518,9 +17169,9 @@ "question__title": " Check if There Is a Valid Parentheses String Path", "question__title_slug": "check-if-there-is-a-valid-parentheses-string-path", "question__hide": false, - "total_acs": 7933, - "total_submitted": 21082, - "total_column_articles": 130, + "total_acs": 7988, + "total_submitted": 21173, + "total_column_articles": 131, "frontend_question_id": "2267", "is_new_question": false }, @@ -16539,9 +17190,9 @@ "question__title": "Count Number of Texts", "question__title_slug": "count-number-of-texts", "question__hide": false, - "total_acs": 7641, - "total_submitted": 17573, - "total_column_articles": 135, + "total_acs": 7681, + "total_submitted": 17645, + "total_column_articles": 137, "frontend_question_id": "2266", "is_new_question": false }, @@ -16560,9 +17211,9 @@ "question__title": "Count Nodes Equal to Average of Subtree", "question__title_slug": "count-nodes-equal-to-average-of-subtree", "question__hide": false, - "total_acs": 10531, - "total_submitted": 12735, - "total_column_articles": 190, + "total_acs": 10670, + "total_submitted": 12906, + "total_column_articles": 196, "frontend_question_id": "2265", "is_new_question": false }, @@ -16581,9 +17232,9 @@ "question__title": "Largest 3-Same-Digit Number in String", "question__title_slug": "largest-3-same-digit-number-in-string", "question__hide": false, - "total_acs": 12788, - "total_submitted": 20670, - "total_column_articles": 165, + "total_acs": 12854, + "total_submitted": 20768, + "total_column_articles": 166, "frontend_question_id": "2264", "is_new_question": false }, @@ -16602,8 +17253,8 @@ "question__title": "Minimum Number of Operations to Convert Time", "question__title_slug": "minimum-number-of-operations-to-convert-time", "question__hide": false, - "total_acs": 12050, - "total_submitted": 17395, + "total_acs": 12123, + "total_submitted": 17487, "total_column_articles": 158, "frontend_question_id": "2224", "is_new_question": false @@ -16623,9 +17274,9 @@ "question__title": "Escape the Spreading Fire", "question__title_slug": "escape-the-spreading-fire", "question__hide": false, - "total_acs": 2921, - "total_submitted": 8176, - "total_column_articles": 85, + "total_acs": 2942, + "total_submitted": 8234, + "total_column_articles": 86, "frontend_question_id": "2258", "is_new_question": false }, @@ -16644,8 +17295,8 @@ "question__title": "Count Unguarded Cells in the Grid", "question__title_slug": "count-unguarded-cells-in-the-grid", "question__hide": false, - "total_acs": 5122, - "total_submitted": 9765, + "total_acs": 5169, + "total_submitted": 9837, "total_column_articles": 106, "frontend_question_id": "2257", "is_new_question": false @@ -16665,9 +17316,9 @@ "question__title": "Minimum Average Difference", "question__title_slug": "minimum-average-difference", "question__hide": false, - "total_acs": 6375, - "total_submitted": 17371, - "total_column_articles": 79, + "total_acs": 6410, + "total_submitted": 17446, + "total_column_articles": 80, "frontend_question_id": "2256", "is_new_question": false }, @@ -16686,9 +17337,9 @@ "question__title": "Count Prefixes of a Given String", "question__title_slug": "count-prefixes-of-a-given-string", "question__hide": false, - "total_acs": 9715, - "total_submitted": 12343, - "total_column_articles": 145, + "total_acs": 9846, + "total_submitted": 12510, + "total_column_articles": 147, "frontend_question_id": "2255", "is_new_question": false }, @@ -16707,8 +17358,8 @@ "question__title": "Total Appeal of A String", "question__title_slug": "total-appeal-of-a-string", "question__hide": false, - "total_acs": 6635, - "total_submitted": 11588, + "total_acs": 6679, + "total_submitted": 11650, "total_column_articles": 120, "frontend_question_id": "2262", "is_new_question": false @@ -16728,8 +17379,8 @@ "question__title": "K Divisible Elements Subarrays", "question__title_slug": "k-divisible-elements-subarrays", "question__hide": false, - "total_acs": 8294, - "total_submitted": 15718, + "total_acs": 8334, + "total_submitted": 15767, "total_column_articles": 131, "frontend_question_id": "2261", "is_new_question": false @@ -16749,8 +17400,8 @@ "question__title": "Minimum Consecutive Cards to Pick Up", "question__title_slug": "minimum-consecutive-cards-to-pick-up", "question__hide": false, - "total_acs": 10315, - "total_submitted": 20376, + "total_acs": 10357, + "total_submitted": 20467, "total_column_articles": 151, "frontend_question_id": "2260", "is_new_question": false @@ -16770,9 +17421,9 @@ "question__title": "Remove Digit From Number to Maximize Result", "question__title_slug": "remove-digit-from-number-to-maximize-result", "question__hide": false, - "total_acs": 12491, - "total_submitted": 24954, - "total_column_articles": 151, + "total_acs": 12580, + "total_submitted": 25151, + "total_column_articles": 152, "frontend_question_id": "2259", "is_new_question": false }, @@ -16791,8 +17442,8 @@ "question__title": "The Number of Users That Are Eligible for Discount", "question__title_slug": "the-number-of-users-that-are-eligible-for-discount", "question__hide": false, - "total_acs": 1096, - "total_submitted": 2441, + "total_acs": 1122, + "total_submitted": 2496, "total_column_articles": 14, "frontend_question_id": "2205", "is_new_question": false @@ -16812,8 +17463,8 @@ "question__title": "Finding the Topic of Each Post", "question__title_slug": "finding-the-topic-of-each-post", "question__hide": false, - "total_acs": 694, - "total_submitted": 1150, + "total_acs": 721, + "total_submitted": 1217, "total_column_articles": 12, "frontend_question_id": "2199", "is_new_question": false @@ -16833,8 +17484,8 @@ "question__title": "Number of Flowers in Full Bloom", "question__title_slug": "number-of-flowers-in-full-bloom", "question__hide": false, - "total_acs": 6575, - "total_submitted": 13476, + "total_acs": 6620, + "total_submitted": 13550, "total_column_articles": 130, "frontend_question_id": "2251", "is_new_question": false @@ -16854,9 +17505,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": 6507, - "total_submitted": 18817, - "total_column_articles": 119, + "total_acs": 6541, + "total_submitted": 18896, + "total_column_articles": 120, "frontend_question_id": "2250", "is_new_question": false }, @@ -16875,9 +17526,9 @@ "question__title": "Count Lattice Points Inside a Circle", "question__title_slug": "count-lattice-points-inside-a-circle", "question__hide": false, - "total_acs": 9505, - "total_submitted": 17922, - "total_column_articles": 131, + "total_acs": 9556, + "total_submitted": 18008, + "total_column_articles": 133, "frontend_question_id": "2249", "is_new_question": false }, @@ -16896,8 +17547,8 @@ "question__title": "Intersection of Multiple Arrays", "question__title_slug": "intersection-of-multiple-arrays", "question__hide": false, - "total_acs": 14971, - "total_submitted": 22330, + "total_acs": 15088, + "total_submitted": 22508, "total_column_articles": 190, "frontend_question_id": "2248", "is_new_question": false @@ -16917,9 +17568,9 @@ "question__title": "Maximum Total Beauty of the Gardens", "question__title_slug": "maximum-total-beauty-of-the-gardens", "question__hide": false, - "total_acs": 3099, - "total_submitted": 11125, - "total_column_articles": 75, + "total_acs": 3125, + "total_submitted": 11176, + "total_column_articles": 76, "frontend_question_id": "2234", "is_new_question": false }, @@ -16938,8 +17589,8 @@ "question__title": "Maximum Product After K Increments", "question__title_slug": "maximum-product-after-k-increments", "question__hide": false, - "total_acs": 8595, - "total_submitted": 23405, + "total_acs": 8644, + "total_submitted": 23517, "total_column_articles": 166, "frontend_question_id": "2233", "is_new_question": false @@ -16959,9 +17610,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": 7284, - "total_submitted": 11913, - "total_column_articles": 132, + "total_acs": 7305, + "total_submitted": 11944, + "total_column_articles": 133, "frontend_question_id": "2232", "is_new_question": false }, @@ -16980,9 +17631,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": 11475, - "total_submitted": 17876, - "total_column_articles": 192, + "total_acs": 11540, + "total_submitted": 17973, + "total_column_articles": 193, "frontend_question_id": "2231", "is_new_question": false }, @@ -17001,8 +17652,8 @@ "question__title": "Sum of Scores of Built Strings", "question__title_slug": "sum-of-scores-of-built-strings", "question__hide": false, - "total_acs": 3652, - "total_submitted": 9683, + "total_acs": 3667, + "total_submitted": 9711, "total_column_articles": 57, "frontend_question_id": "2223", "is_new_question": false @@ -17022,8 +17673,8 @@ "question__title": "Number of Ways to Select Buildings", "question__title_slug": "number-of-ways-to-select-buildings", "question__hide": false, - "total_acs": 6388, - "total_submitted": 12831, + "total_acs": 6433, + "total_submitted": 12904, "total_column_articles": 137, "frontend_question_id": "2222", "is_new_question": false @@ -17043,8 +17694,8 @@ "question__title": "Find Triangular Sum of an Array", "question__title_slug": "find-triangular-sum-of-an-array", "question__hide": false, - "total_acs": 9274, - "total_submitted": 11585, + "total_acs": 9346, + "total_submitted": 11679, "total_column_articles": 118, "frontend_question_id": "2221", "is_new_question": false @@ -17064,9 +17715,9 @@ "question__title": "Minimum Bit Flips to Convert Number", "question__title_slug": "minimum-bit-flips-to-convert-number", "question__hide": false, - "total_acs": 10031, - "total_submitted": 12119, - "total_column_articles": 154, + "total_acs": 10118, + "total_submitted": 12228, + "total_column_articles": 157, "frontend_question_id": "2220", "is_new_question": false }, @@ -17085,8 +17736,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": 359, - "total_submitted": 650, + "total_acs": 361, + "total_submitted": 657, "total_column_articles": 17, "frontend_question_id": "2184", "is_new_question": false @@ -17106,8 +17757,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": 4238, - "total_submitted": 11303, + "total_acs": 4264, + "total_submitted": 11344, "total_column_articles": 71, "frontend_question_id": "2203", "is_new_question": false @@ -17127,8 +17778,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": 12129, - "total_submitted": 22590, + "total_acs": 12173, + "total_submitted": 22652, "total_column_articles": 147, "frontend_question_id": "2200", "is_new_question": false @@ -17148,8 +17799,8 @@ "question__title": "Longest Substring of One Repeating Character", "question__title_slug": "longest-substring-of-one-repeating-character", "question__hide": false, - "total_acs": 2929, - "total_submitted": 7475, + "total_acs": 2955, + "total_submitted": 7514, "total_column_articles": 84, "frontend_question_id": "2213", "is_new_question": false @@ -17169,8 +17820,8 @@ "question__title": "Maximum Points in an Archery Competition", "question__title_slug": "maximum-points-in-an-archery-competition", "question__hide": false, - "total_acs": 7343, - "total_submitted": 15423, + "total_acs": 7391, + "total_submitted": 15490, "total_column_articles": 166, "frontend_question_id": "2212", "is_new_question": false @@ -17190,8 +17841,8 @@ "question__title": "Count Collisions on a Road", "question__title_slug": "count-collisions-on-a-road", "question__hide": false, - "total_acs": 9726, - "total_submitted": 23753, + "total_acs": 9784, + "total_submitted": 23870, "total_column_articles": 146, "frontend_question_id": "2211", "is_new_question": false @@ -17211,8 +17862,8 @@ "question__title": "Count Hills and Valleys in an Array", "question__title_slug": "count-hills-and-valleys-in-an-array", "question__hide": false, - "total_acs": 12066, - "total_submitted": 20576, + "total_acs": 12116, + "total_submitted": 20654, "total_column_articles": 157, "frontend_question_id": "2210", "is_new_question": false @@ -17232,8 +17883,8 @@ "question__title": "The Change in Global Rankings", "question__title_slug": "the-change-in-global-rankings", "question__hide": false, - "total_acs": 1054, - "total_submitted": 1936, + "total_acs": 1071, + "total_submitted": 1967, "total_column_articles": 12, "frontend_question_id": "2175", "is_new_question": false @@ -17253,8 +17904,8 @@ "question__title": "Remove All Ones With Row and Column Flips II", "question__title_slug": "remove-all-ones-with-row-and-column-flips-ii", "question__hide": false, - "total_acs": 202, - "total_submitted": 298, + "total_acs": 205, + "total_submitted": 303, "total_column_articles": 9, "frontend_question_id": "2174", "is_new_question": false @@ -17274,8 +17925,8 @@ "question__title": "Longest Winning Streak", "question__title_slug": "longest-winning-streak", "question__hide": false, - "total_acs": 1208, - "total_submitted": 2157, + "total_acs": 1246, + "total_submitted": 2214, "total_column_articles": 26, "frontend_question_id": "2173", "is_new_question": false @@ -17295,8 +17946,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": 9017, - "total_submitted": 15353, + "total_acs": 9110, + "total_submitted": 15513, "total_column_articles": 111, "frontend_question_id": "2190", "is_new_question": false @@ -17316,8 +17967,8 @@ "question__title": "Minimum White Tiles After Covering With Carpets", "question__title_slug": "minimum-white-tiles-after-covering-with-carpets", "question__hide": false, - "total_acs": 4541, - "total_submitted": 11702, + "total_acs": 4587, + "total_submitted": 11779, "total_column_articles": 52, "frontend_question_id": "2209", "is_new_question": false @@ -17337,9 +17988,9 @@ "question__title": "Minimum Operations to Halve Array Sum", "question__title_slug": "minimum-operations-to-halve-array-sum", "question__hide": false, - "total_acs": 6471, - "total_submitted": 15869, - "total_column_articles": 98, + "total_acs": 6504, + "total_submitted": 15930, + "total_column_articles": 99, "frontend_question_id": "2208", "is_new_question": false }, @@ -17358,8 +18009,8 @@ "question__title": "Maximize Number of Subsequences in a String", "question__title_slug": "maximize-number-of-subsequences-in-a-string", "question__hide": false, - "total_acs": 6804, - "total_submitted": 21703, + "total_acs": 6844, + "total_submitted": 21770, "total_column_articles": 107, "frontend_question_id": "2207", "is_new_question": false @@ -17379,9 +18030,9 @@ "question__title": "Divide Array Into Equal Pairs", "question__title_slug": "divide-array-into-equal-pairs", "question__hide": false, - "total_acs": 12889, - "total_submitted": 17452, - "total_column_articles": 153, + "total_acs": 12988, + "total_submitted": 17587, + "total_column_articles": 155, "frontend_question_id": "2206", "is_new_question": false }, @@ -17400,8 +18051,8 @@ "question__title": "Replace Non-Coprime Numbers in Array", "question__title_slug": "replace-non-coprime-numbers-in-array", "question__hide": false, - "total_acs": 5616, - "total_submitted": 16278, + "total_acs": 5636, + "total_submitted": 16309, "total_column_articles": 91, "frontend_question_id": "2197", "is_new_question": false @@ -17421,8 +18072,8 @@ "question__title": "Create Binary Tree From Descriptions", "question__title_slug": "create-binary-tree-from-descriptions", "question__hide": false, - "total_acs": 9253, - "total_submitted": 12712, + "total_acs": 9291, + "total_submitted": 12764, "total_column_articles": 158, "frontend_question_id": "2196", "is_new_question": false @@ -17442,8 +18093,8 @@ "question__title": "Append K Integers With Minimal Sum", "question__title_slug": "append-k-integers-with-minimal-sum", "question__hide": false, - "total_acs": 11448, - "total_submitted": 47794, + "total_acs": 11471, + "total_submitted": 47911, "total_column_articles": 227, "frontend_question_id": "2195", "is_new_question": false @@ -17463,8 +18114,8 @@ "question__title": "Cells in a Range on an Excel Sheet", "question__title_slug": "cells-in-a-range-on-an-excel-sheet", "question__hide": false, - "total_acs": 13741, - "total_submitted": 16321, + "total_acs": 13811, + "total_submitted": 16400, "total_column_articles": 147, "frontend_question_id": "2194", "is_new_question": false @@ -17484,9 +18135,9 @@ "question__title": "Unique Substrings With Equal Digit Frequency", "question__title_slug": "unique-substrings-with-equal-digit-frequency", "question__hide": false, - "total_acs": 458, - "total_submitted": 721, - "total_column_articles": 13, + "total_acs": 465, + "total_submitted": 732, + "total_column_articles": 14, "frontend_question_id": "2168", "is_new_question": false }, @@ -17505,8 +18156,8 @@ "question__title": "Order Two Columns Independently", "question__title_slug": "order-two-columns-independently", "question__hide": false, - "total_acs": 1177, - "total_submitted": 1928, + "total_acs": 1196, + "total_submitted": 1961, "total_column_articles": 10, "frontend_question_id": "2159", "is_new_question": false @@ -17526,8 +18177,8 @@ "question__title": "Count Array Pairs Divisible by K", "question__title_slug": "count-array-pairs-divisible-by-k", "question__hide": false, - "total_acs": 4775, - "total_submitted": 16988, + "total_acs": 4800, + "total_submitted": 17040, "total_column_articles": 59, "frontend_question_id": "2183", "is_new_question": false @@ -17547,8 +18198,8 @@ "question__title": "Construct String With Repeat Limit", "question__title_slug": "construct-string-with-repeat-limit", "question__hide": false, - "total_acs": 6915, - "total_submitted": 14262, + "total_acs": 6930, + "total_submitted": 14281, "total_column_articles": 143, "frontend_question_id": "2182", "is_new_question": false @@ -17568,8 +18219,8 @@ "question__title": "Merge Nodes in Between Zeros", "question__title_slug": "merge-nodes-in-between-zeros", "question__hide": false, - "total_acs": 14324, - "total_submitted": 16854, + "total_acs": 14420, + "total_submitted": 16961, "total_column_articles": 203, "frontend_question_id": "2181", "is_new_question": false @@ -17589,8 +18240,8 @@ "question__title": "Count Integers With Even Digit Sum", "question__title_slug": "count-integers-with-even-digit-sum", "question__hide": false, - "total_acs": 34032, - "total_submitted": 50048, + "total_acs": 34126, + "total_submitted": 50211, "total_column_articles": 370, "frontend_question_id": "2180", "is_new_question": false @@ -17610,9 +18261,9 @@ "question__title": "Amount of New Area Painted Each Day", "question__title_slug": "amount-of-new-area-painted-each-day", "question__hide": false, - "total_acs": 537, - "total_submitted": 981, - "total_column_articles": 18, + "total_acs": 553, + "total_submitted": 1008, + "total_column_articles": 19, "frontend_question_id": "2158", "is_new_question": false }, @@ -17631,8 +18282,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": 602, - "total_submitted": 1328, + "total_acs": 620, + "total_submitted": 1368, "total_column_articles": 9, "frontend_question_id": "2153", "is_new_question": false @@ -17652,8 +18303,8 @@ "question__title": "Minimum Time to Finish the Race", "question__title_slug": "minimum-time-to-finish-the-race", "question__hide": false, - "total_acs": 4366, - "total_submitted": 9858, + "total_acs": 4390, + "total_submitted": 9902, "total_column_articles": 69, "frontend_question_id": "2188", "is_new_question": false @@ -17673,8 +18324,8 @@ "question__title": "Minimum Time to Complete Trips", "question__title_slug": "minimum-time-to-complete-trips", "question__hide": false, - "total_acs": 12309, - "total_submitted": 43652, + "total_acs": 12368, + "total_submitted": 43860, "total_column_articles": 152, "frontend_question_id": "2187", "is_new_question": false @@ -17694,8 +18345,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": 10522, - "total_submitted": 14499, + "total_acs": 10574, + "total_submitted": 14563, "total_column_articles": 125, "frontend_question_id": "2186", "is_new_question": false @@ -17715,8 +18366,8 @@ "question__title": "Counting Words With a Given Prefix", "question__title_slug": "counting-words-with-a-given-prefix", "question__hide": false, - "total_acs": 36261, - "total_submitted": 44426, + "total_acs": 36363, + "total_submitted": 44556, "total_column_articles": 381, "frontend_question_id": "2185", "is_new_question": false @@ -17736,8 +18387,8 @@ "question__title": "Maximum AND Sum of Array", "question__title_slug": "maximum-and-sum-of-array", "question__hide": false, - "total_acs": 4244, - "total_submitted": 8524, + "total_acs": 4259, + "total_submitted": 8548, "total_column_articles": 75, "frontend_question_id": "2172", "is_new_question": false @@ -17757,9 +18408,9 @@ "question__title": "Removing Minimum Number of Magic Beans", "question__title_slug": "removing-minimum-number-of-magic-beans", "question__hide": false, - "total_acs": 9120, - "total_submitted": 22710, - "total_column_articles": 182, + "total_acs": 9170, + "total_submitted": 22794, + "total_column_articles": 183, "frontend_question_id": "2171", "is_new_question": false }, @@ -17778,9 +18429,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": 9312, - "total_submitted": 29934, - "total_column_articles": 161, + "total_acs": 9349, + "total_submitted": 30023, + "total_column_articles": 163, "frontend_question_id": "2170", "is_new_question": false }, @@ -17799,8 +18450,8 @@ "question__title": "Count Operations to Obtain Zero", "question__title_slug": "count-operations-to-obtain-zero", "question__hide": false, - "total_acs": 16719, - "total_submitted": 22709, + "total_acs": 16852, + "total_submitted": 22902, "total_column_articles": 142, "frontend_question_id": "2169", "is_new_question": false @@ -17820,8 +18471,8 @@ "question__title": "Minimum Number of Lines to Cover Points", "question__title_slug": "minimum-number-of-lines-to-cover-points", "question__hide": false, - "total_acs": 375, - "total_submitted": 708, + "total_acs": 379, + "total_submitted": 724, "total_column_articles": 17, "frontend_question_id": "2152", "is_new_question": false @@ -17841,8 +18492,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": 4630, - "total_submitted": 9416, + "total_acs": 4651, + "total_submitted": 9453, "total_column_articles": 79, "frontend_question_id": "2167", "is_new_question": false @@ -17862,9 +18513,9 @@ "question__title": "Design Bitset", "question__title_slug": "design-bitset", "question__hide": false, - "total_acs": 6080, - "total_submitted": 19876, - "total_column_articles": 156, + "total_acs": 6119, + "total_submitted": 20007, + "total_column_articles": 158, "frontend_question_id": "2166", "is_new_question": false }, @@ -17883,9 +18534,9 @@ "question__title": "Smallest Value of the Rearranged Number", "question__title_slug": "smallest-value-of-the-rearranged-number", "question__hide": false, - "total_acs": 8082, - "total_submitted": 14629, - "total_column_articles": 138, + "total_acs": 8119, + "total_submitted": 14703, + "total_column_articles": 140, "frontend_question_id": "2165", "is_new_question": false }, @@ -17904,8 +18555,8 @@ "question__title": "Sort Even and Odd Indices Independently", "question__title_slug": "sort-even-and-odd-indices-independently", "question__hide": false, - "total_acs": 10878, - "total_submitted": 15859, + "total_acs": 10978, + "total_submitted": 15994, "total_column_articles": 143, "frontend_question_id": "2164", "is_new_question": false @@ -17925,8 +18576,8 @@ "question__title": "Choose Numbers From Two Arrays in Range", "question__title_slug": "choose-numbers-from-two-arrays-in-range", "question__hide": false, - "total_acs": 205, - "total_submitted": 363, + "total_acs": 214, + "total_submitted": 375, "total_column_articles": 10, "frontend_question_id": "2143", "is_new_question": false @@ -17946,8 +18597,8 @@ "question__title": "The Number of Passengers in Each Bus I", "question__title_slug": "the-number-of-passengers-in-each-bus-i", "question__hide": false, - "total_acs": 1283, - "total_submitted": 2757, + "total_acs": 1302, + "total_submitted": 2792, "total_column_articles": 20, "frontend_question_id": "2142", "is_new_question": false @@ -17967,9 +18618,9 @@ "question__title": "Count Good Triplets in an Array", "question__title_slug": "count-good-triplets-in-an-array", "question__hide": false, - "total_acs": 3266, - "total_submitted": 8872, - "total_column_articles": 77, + "total_acs": 3283, + "total_submitted": 8900, + "total_column_articles": 78, "frontend_question_id": "2179", "is_new_question": false }, @@ -17988,8 +18639,8 @@ "question__title": "Maximum Split of Positive Even Integers", "question__title_slug": "maximum-split-of-positive-even-integers", "question__hide": false, - "total_acs": 6978, - "total_submitted": 12350, + "total_acs": 7015, + "total_submitted": 12413, "total_column_articles": 111, "frontend_question_id": "2178", "is_new_question": false @@ -18009,9 +18660,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": 8685, - "total_submitted": 12418, - "total_column_articles": 93, + "total_acs": 8777, + "total_submitted": 12544, + "total_column_articles": 97, "frontend_question_id": "2177", "is_new_question": false }, @@ -18030,8 +18681,8 @@ "question__title": "Count Equal and Divisible Pairs in an Array", "question__title_slug": "count-equal-and-divisible-pairs-in-an-array", "question__hide": false, - "total_acs": 10102, - "total_submitted": 12803, + "total_acs": 10176, + "total_submitted": 12906, "total_column_articles": 121, "frontend_question_id": "2176", "is_new_question": false @@ -18051,8 +18702,8 @@ "question__title": "Groups of Strings", "question__title_slug": "groups-of-strings", "question__hide": false, - "total_acs": 3520, - "total_submitted": 11296, + "total_acs": 3536, + "total_submitted": 11325, "total_column_articles": 79, "frontend_question_id": "2157", "is_new_question": false @@ -18072,9 +18723,9 @@ "question__title": "Find Substring With Given Hash Value", "question__title_slug": "find-substring-with-given-hash-value", "question__hide": false, - "total_acs": 5679, - "total_submitted": 22725, - "total_column_articles": 93, + "total_acs": 5743, + "total_submitted": 22859, + "total_column_articles": 96, "frontend_question_id": "2156", "is_new_question": false }, @@ -18093,9 +18744,9 @@ "question__title": "Keep Multiplying Found Values by Two", "question__title_slug": "keep-multiplying-found-values-by-two", "question__hide": false, - "total_acs": 15904, - "total_submitted": 21615, - "total_column_articles": 188, + "total_acs": 16020, + "total_submitted": 21784, + "total_column_articles": 189, "frontend_question_id": "2154", "is_new_question": false }, @@ -18114,8 +18765,8 @@ "question__title": "Pour Water Between Buckets to Make Water Levels Equal", "question__title_slug": "pour-water-between-buckets-to-make-water-levels-equal", "question__hide": false, - "total_acs": 323, - "total_submitted": 538, + "total_acs": 326, + "total_submitted": 542, "total_column_articles": 13, "frontend_question_id": "2137", "is_new_question": false @@ -18135,9 +18786,9 @@ "question__title": "Maximum Good People Based on Statements", "question__title_slug": "maximum-good-people-based-on-statements", "question__hide": false, - "total_acs": 5218, - "total_submitted": 10421, - "total_column_articles": 91, + "total_acs": 5249, + "total_submitted": 10465, + "total_column_articles": 92, "frontend_question_id": "2151", "is_new_question": false }, @@ -18156,9 +18807,9 @@ "question__title": "Rearrange Array Elements by Sign", "question__title_slug": "rearrange-array-elements-by-sign", "question__hide": false, - "total_acs": 11486, - "total_submitted": 14408, - "total_column_articles": 127, + "total_acs": 11561, + "total_submitted": 14500, + "total_column_articles": 129, "frontend_question_id": "2149", "is_new_question": false }, @@ -18177,9 +18828,9 @@ "question__title": "Find All Lonely Numbers in the Array", "question__title_slug": "find-all-lonely-numbers-in-the-array", "question__hide": false, - "total_acs": 9338, - "total_submitted": 15696, - "total_column_articles": 111, + "total_acs": 9405, + "total_submitted": 15804, + "total_column_articles": 112, "frontend_question_id": "2150", "is_new_question": false }, @@ -18198,9 +18849,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": 12257, - "total_submitted": 21223, - "total_column_articles": 162, + "total_acs": 12372, + "total_submitted": 21401, + "total_column_articles": 163, "frontend_question_id": "2148", "is_new_question": false }, @@ -18219,8 +18870,8 @@ "question__title": "Remove All Ones With Row and Column Flips", "question__title_slug": "remove-all-ones-with-row-and-column-flips", "question__hide": false, - "total_acs": 539, - "total_submitted": 710, + "total_acs": 544, + "total_submitted": 718, "total_column_articles": 15, "frontend_question_id": "2128", "is_new_question": false @@ -18240,8 +18891,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": 3141, - "total_submitted": 6418, + "total_acs": 3154, + "total_submitted": 6437, "total_column_articles": 61, "frontend_question_id": "2163", "is_new_question": false @@ -18261,9 +18912,9 @@ "question__title": "Minimum Cost to Set Cooking Time", "question__title_slug": "minimum-cost-to-set-cooking-time", "question__hide": false, - "total_acs": 3405, - "total_submitted": 9987, - "total_column_articles": 81, + "total_acs": 3429, + "total_submitted": 10036, + "total_column_articles": 82, "frontend_question_id": "2162", "is_new_question": false }, @@ -18282,9 +18933,9 @@ "question__title": "Partition Array According to Given Pivot", "question__title_slug": "partition-array-according-to-given-pivot", "question__hide": false, - "total_acs": 8149, - "total_submitted": 9874, - "total_column_articles": 120, + "total_acs": 8209, + "total_submitted": 9944, + "total_column_articles": 121, "frontend_question_id": "2161", "is_new_question": false }, @@ -18303,9 +18954,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": 13641, - "total_submitted": 16208, - "total_column_articles": 205, + "total_acs": 13774, + "total_submitted": 16358, + "total_column_articles": 211, "frontend_question_id": "2160", "is_new_question": false }, @@ -18324,9 +18975,9 @@ "question__title": "Maximum Running Time of N Computers", "question__title_slug": "maximum-running-time-of-n-computers", "question__hide": false, - "total_acs": 5634, - "total_submitted": 13998, - "total_column_articles": 83, + "total_acs": 5694, + "total_submitted": 14095, + "total_column_articles": 84, "frontend_question_id": "2141", "is_new_question": false }, @@ -18345,9 +18996,9 @@ "question__title": "Solving Questions With Brainpower", "question__title_slug": "solving-questions-with-brainpower", "question__hide": false, - "total_acs": 8803, - "total_submitted": 20295, - "total_column_articles": 163, + "total_acs": 9068, + "total_submitted": 20811, + "total_column_articles": 166, "frontend_question_id": "2140", "is_new_question": false }, @@ -18366,9 +19017,9 @@ "question__title": "All Divisions With the Highest Score of a Binary Array", "question__title_slug": "all-divisions-with-the-highest-score-of-a-binary-array", "question__hide": false, - "total_acs": 8085, - "total_submitted": 12530, - "total_column_articles": 117, + "total_acs": 8131, + "total_submitted": 12607, + "total_column_articles": 118, "frontend_question_id": "2155", "is_new_question": false }, @@ -18387,8 +19038,8 @@ "question__title": "Divide a String Into Groups of Size k", "question__title_slug": "divide-a-string-into-groups-of-size-k", "question__hide": false, - "total_acs": 10346, - "total_submitted": 15587, + "total_acs": 10396, + "total_submitted": 15672, "total_column_articles": 155, "frontend_question_id": "2138", "is_new_question": false @@ -18408,8 +19059,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": 255, - "total_submitted": 476, + "total_acs": 264, + "total_submitted": 486, "total_column_articles": 6, "frontend_question_id": "2123", "is_new_question": false @@ -18429,8 +19080,8 @@ "question__title": "Elements in Array After Removing and Replacing Elements", "question__title_slug": "elements-in-array-after-removing-and-replacing-elements", "question__hide": false, - "total_acs": 275, - "total_submitted": 456, + "total_acs": 283, + "total_submitted": 465, "total_column_articles": 13, "frontend_question_id": "2113", "is_new_question": false @@ -18450,8 +19101,8 @@ "question__title": "Earliest Possible Day of Full Bloom", "question__title_slug": "earliest-possible-day-of-full-bloom", "question__hide": false, - "total_acs": 4436, - "total_submitted": 6709, + "total_acs": 4469, + "total_submitted": 6760, "total_column_articles": 75, "frontend_question_id": "2136", "is_new_question": false @@ -18471,8 +19122,8 @@ "question__title": "Count Words Obtained After Adding a Letter", "question__title_slug": "count-words-obtained-after-adding-a-letter", "question__hide": false, - "total_acs": 5419, - "total_submitted": 15020, + "total_acs": 5435, + "total_submitted": 15074, "total_column_articles": 106, "frontend_question_id": "2135", "is_new_question": false @@ -18492,8 +19143,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": 7519, - "total_submitted": 15445, + "total_acs": 7559, + "total_submitted": 15529, "total_column_articles": 172, "frontend_question_id": "2134", "is_new_question": false @@ -18513,9 +19164,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": 10551, - "total_submitted": 18985, - "total_column_articles": 156, + "total_acs": 10625, + "total_submitted": 19104, + "total_column_articles": 157, "frontend_question_id": "2133", "is_new_question": false }, @@ -18534,8 +19185,8 @@ "question__title": "Build the Equation", "question__title_slug": "build-the-equation", "question__hide": false, - "total_acs": 713, - "total_submitted": 1288, + "total_acs": 730, + "total_submitted": 1323, "total_column_articles": 16, "frontend_question_id": "2118", "is_new_question": false @@ -18555,9 +19206,9 @@ "question__title": "The Airport With the Most Traffic", "question__title_slug": "the-airport-with-the-most-traffic", "question__hide": false, - "total_acs": 1321, - "total_submitted": 1932, - "total_column_articles": 21, + "total_acs": 1342, + "total_submitted": 1961, + "total_column_articles": 22, "frontend_question_id": "2112", "is_new_question": false }, @@ -18576,8 +19227,8 @@ "question__title": "Number of Ways to Divide a Long Corridor", "question__title_slug": "number-of-ways-to-divide-a-long-corridor", "question__hide": false, - "total_acs": 3709, - "total_submitted": 9055, + "total_acs": 3749, + "total_submitted": 9137, "total_column_articles": 84, "frontend_question_id": "2147", "is_new_question": false @@ -18597,8 +19248,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": 4106, - "total_submitted": 10291, + "total_acs": 4124, + "total_submitted": 10333, "total_column_articles": 96, "frontend_question_id": "2146", "is_new_question": false @@ -18618,8 +19269,8 @@ "question__title": "Count the Hidden Sequences", "question__title_slug": "count-the-hidden-sequences", "question__hide": false, - "total_acs": 5409, - "total_submitted": 15146, + "total_acs": 5423, + "total_submitted": 15187, "total_column_articles": 115, "frontend_question_id": "2145", "is_new_question": false @@ -18639,9 +19290,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": 10041, - "total_submitted": 15000, - "total_column_articles": 170, + "total_acs": 10141, + "total_submitted": 15146, + "total_column_articles": 171, "frontend_question_id": "2144", "is_new_question": false }, @@ -18660,8 +19311,8 @@ "question__title": "Number of Unique Flavors After Sharing K Candies", "question__title_slug": "number-of-unique-flavors-after-sharing-k-candies", "question__hide": false, - "total_acs": 432, - "total_submitted": 1163, + "total_acs": 447, + "total_submitted": 1184, "total_column_articles": 14, "frontend_question_id": "2107", "is_new_question": false @@ -18681,8 +19332,8 @@ "question__title": "Maximum Employees to Be Invited to a Meeting", "question__title_slug": "maximum-employees-to-be-invited-to-a-meeting", "question__hide": false, - "total_acs": 3563, - "total_submitted": 10504, + "total_acs": 3581, + "total_submitted": 10548, "total_column_articles": 67, "frontend_question_id": "2127", "is_new_question": false @@ -18702,8 +19353,8 @@ "question__title": "Destroying Asteroids", "question__title_slug": "destroying-asteroids", "question__hide": false, - "total_acs": 8710, - "total_submitted": 17847, + "total_acs": 8758, + "total_submitted": 17950, "total_column_articles": 111, "frontend_question_id": "2126", "is_new_question": false @@ -18723,9 +19374,9 @@ "question__title": "Number of Laser Beams in a Bank", "question__title_slug": "number-of-laser-beams-in-a-bank", "question__hide": false, - "total_acs": 9822, - "total_submitted": 11834, - "total_column_articles": 125, + "total_acs": 9883, + "total_submitted": 11904, + "total_column_articles": 126, "frontend_question_id": "2125", "is_new_question": false }, @@ -18744,9 +19395,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": 12324, - "total_submitted": 17737, - "total_column_articles": 205, + "total_acs": 12410, + "total_submitted": 17858, + "total_column_articles": 207, "frontend_question_id": "2124", "is_new_question": false }, @@ -18765,8 +19416,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": 323, - "total_submitted": 912, + "total_acs": 328, + "total_submitted": 938, "total_column_articles": 11, "frontend_question_id": "2098", "is_new_question": false @@ -18786,8 +19437,8 @@ "question__title": "Recover the Original Array", "question__title_slug": "recover-the-original-array", "question__hide": false, - "total_acs": 3960, - "total_submitted": 9479, + "total_acs": 3985, + "total_submitted": 9520, "total_column_articles": 67, "frontend_question_id": "2122", "is_new_question": false @@ -18807,9 +19458,9 @@ "question__title": "Intervals Between Identical Elements", "question__title_slug": "intervals-between-identical-elements", "question__hide": false, - "total_acs": 6649, - "total_submitted": 17286, - "total_column_articles": 161, + "total_acs": 6684, + "total_submitted": 17356, + "total_column_articles": 162, "frontend_question_id": "2121", "is_new_question": false }, @@ -18828,9 +19479,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": 7921, - "total_submitted": 9601, - "total_column_articles": 120, + "total_acs": 7970, + "total_submitted": 9655, + "total_column_articles": 121, "frontend_question_id": "2120", "is_new_question": false }, @@ -18849,9 +19500,9 @@ "question__title": "A Number After a Double Reversal", "question__title_slug": "a-number-after-a-double-reversal", "question__hide": false, - "total_acs": 17140, - "total_submitted": 23160, - "total_column_articles": 184, + "total_acs": 17300, + "total_submitted": 23390, + "total_column_articles": 186, "frontend_question_id": "2119", "is_new_question": false }, @@ -18870,9 +19521,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": 9688, - "total_submitted": 22534, - "total_column_articles": 147, + "total_acs": 9743, + "total_submitted": 22681, + "total_column_articles": 148, "frontend_question_id": "2131", "is_new_question": false }, @@ -18891,9 +19542,9 @@ "question__title": "Maximum Twin Sum of a Linked List", "question__title_slug": "maximum-twin-sum-of-a-linked-list", "question__hide": false, - "total_acs": 9850, - "total_submitted": 12184, - "total_column_articles": 153, + "total_acs": 10169, + "total_submitted": 12597, + "total_column_articles": 158, "frontend_question_id": "2130", "is_new_question": false }, @@ -18912,9 +19563,9 @@ "question__title": "Capitalize the Title", "question__title_slug": "capitalize-the-title", "question__hide": false, - "total_acs": 8862, - "total_submitted": 14601, - "total_column_articles": 150, + "total_acs": 8935, + "total_submitted": 14727, + "total_column_articles": 153, "frontend_question_id": "2129", "is_new_question": false }, @@ -18933,8 +19584,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": 4534, - "total_submitted": 13068, + "total_acs": 4570, + "total_submitted": 13120, "total_column_articles": 97, "frontend_question_id": "2111", "is_new_question": false @@ -18954,9 +19605,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": 9596, - "total_submitted": 18184, - "total_column_articles": 158, + "total_acs": 9672, + "total_submitted": 18322, + "total_column_articles": 161, "frontend_question_id": "2110", "is_new_question": false }, @@ -18975,8 +19626,8 @@ "question__title": "Adding Spaces to a String", "question__title_slug": "adding-spaces-to-a-string", "question__hide": false, - "total_acs": 9839, - "total_submitted": 15965, + "total_acs": 9908, + "total_submitted": 16083, "total_column_articles": 120, "frontend_question_id": "2109", "is_new_question": false @@ -18996,9 +19647,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": 13714, - "total_submitted": 17707, - "total_column_articles": 204, + "total_acs": 13861, + "total_submitted": 17881, + "total_column_articles": 205, "frontend_question_id": "2108", "is_new_question": false }, @@ -19017,8 +19668,8 @@ "question__title": "Minimum Cost to Reach City With Discounts", "question__title_slug": "minimum-cost-to-reach-city-with-discounts", "question__hide": false, - "total_acs": 408, - "total_submitted": 695, + "total_acs": 414, + "total_submitted": 705, "total_column_articles": 20, "frontend_question_id": "2093", "is_new_question": false @@ -19038,9 +19689,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": 5158, - "total_submitted": 14718, - "total_column_articles": 99, + "total_acs": 17184, + "total_submitted": 38121, + "total_column_articles": 203, "frontend_question_id": "2106", "is_new_question": false }, @@ -19059,8 +19710,8 @@ "question__title": "Watering Plants II", "question__title_slug": "watering-plants-ii", "question__hide": false, - "total_acs": 8890, - "total_submitted": 16694, + "total_acs": 8928, + "total_submitted": 16767, "total_column_articles": 142, "frontend_question_id": "2105", "is_new_question": false @@ -19080,9 +19731,9 @@ "question__title": "Sum of Subarray Ranges", "question__title_slug": "sum-of-subarray-ranges", "question__hide": false, - "total_acs": 41048, - "total_submitted": 65321, - "total_column_articles": 399, + "total_acs": 41119, + "total_submitted": 65425, + "total_column_articles": 400, "frontend_question_id": "2104", "is_new_question": false }, @@ -19101,8 +19752,8 @@ "question__title": "Rings and Rods", "question__title_slug": "rings-and-rods", "question__hide": false, - "total_acs": 11109, - "total_submitted": 13947, + "total_acs": 11188, + "total_submitted": 14042, "total_column_articles": 194, "frontend_question_id": "2103", "is_new_question": false @@ -19122,8 +19773,8 @@ "question__title": "Substrings That Begin and End With the Same Letter", "question__title_slug": "substrings-that-begin-and-end-with-the-same-letter", "question__hide": false, - "total_acs": 466, - "total_submitted": 765, + "total_acs": 468, + "total_submitted": 767, "total_column_articles": 16, "frontend_question_id": "2083", "is_new_question": false @@ -19143,9 +19794,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": 1992, - "total_submitted": 2413, - "total_column_articles": 40, + "total_acs": 2024, + "total_submitted": 2451, + "total_column_articles": 41, "frontend_question_id": "2084", "is_new_question": false }, @@ -19164,8 +19815,8 @@ "question__title": "The Number of Rich Customers", "question__title_slug": "the-number-of-rich-customers", "question__hide": false, - "total_acs": 2459, - "total_submitted": 3313, + "total_acs": 2493, + "total_submitted": 3368, "total_column_articles": 25, "frontend_question_id": "2082", "is_new_question": false @@ -19185,8 +19836,8 @@ "question__title": "Abbreviating the Product of a Range", "question__title_slug": "abbreviating-the-product-of-a-range", "question__hide": false, - "total_acs": 1476, - "total_submitted": 4787, + "total_acs": 1479, + "total_submitted": 4803, "total_column_articles": 26, "frontend_question_id": "2117", "is_new_question": false @@ -19206,9 +19857,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": 4046, - "total_submitted": 12600, - "total_column_articles": 72, + "total_acs": 4073, + "total_submitted": 12670, + "total_column_articles": 73, "frontend_question_id": "2116", "is_new_question": false }, @@ -19227,9 +19878,9 @@ "question__title": "Find All Possible Recipes from Given Supplies", "question__title_slug": "find-all-possible-recipes-from-given-supplies", "question__hide": false, - "total_acs": 5877, - "total_submitted": 13951, - "total_column_articles": 116, + "total_acs": 5933, + "total_submitted": 14055, + "total_column_articles": 117, "frontend_question_id": "2115", "is_new_question": false }, @@ -19248,9 +19899,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": 18516, - "total_submitted": 21776, - "total_column_articles": 240, + "total_acs": 18645, + "total_submitted": 21919, + "total_column_articles": 242, "frontend_question_id": "2114", "is_new_question": false }, @@ -19269,8 +19920,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": 215, - "total_submitted": 342, + "total_acs": 217, + "total_submitted": 344, "total_column_articles": 9, "frontend_question_id": "2077", "is_new_question": false @@ -19290,8 +19941,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": 7665, - "total_submitted": 17208, + "total_acs": 7697, + "total_submitted": 17285, "total_column_articles": 208, "frontend_question_id": "2096", "is_new_question": false @@ -19311,9 +19962,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": 15262, - "total_submitted": 26493, - "total_column_articles": 198, + "total_acs": 15718, + "total_submitted": 27345, + "total_column_articles": 200, "frontend_question_id": "2095", "is_new_question": false }, @@ -19332,9 +19983,9 @@ "question__title": "Finding 3-Digit Even Numbers", "question__title_slug": "finding-3-digit-even-numbers", "question__hide": false, - "total_acs": 11479, - "total_submitted": 20640, - "total_column_articles": 183, + "total_acs": 11562, + "total_submitted": 20778, + "total_column_articles": 184, "frontend_question_id": "2094", "is_new_question": false }, @@ -19353,8 +20004,8 @@ "question__title": "The Winner University", "question__title_slug": "the-winner-university", "question__hide": false, - "total_acs": 2310, - "total_submitted": 3342, + "total_acs": 2344, + "total_submitted": 3394, "total_column_articles": 30, "frontend_question_id": "2072", "is_new_question": false @@ -19374,8 +20025,8 @@ "question__title": "Find All People With Secret", "question__title_slug": "find-all-people-with-secret", "question__hide": false, - "total_acs": 5913, - "total_submitted": 20353, + "total_acs": 5959, + "total_submitted": 20496, "total_column_articles": 130, "frontend_question_id": "2092", "is_new_question": false @@ -19395,8 +20046,8 @@ "question__title": "Removing Minimum and Maximum From Array", "question__title_slug": "removing-minimum-and-maximum-from-array", "question__hide": false, - "total_acs": 8234, - "total_submitted": 14564, + "total_acs": 8282, + "total_submitted": 14661, "total_column_articles": 146, "frontend_question_id": "2091", "is_new_question": false @@ -19416,8 +20067,8 @@ "question__title": "K Radius Subarray Averages", "question__title_slug": "k-radius-subarray-averages", "question__hide": false, - "total_acs": 7828, - "total_submitted": 21094, + "total_acs": 7863, + "total_submitted": 21181, "total_column_articles": 114, "frontend_question_id": "2090", "is_new_question": false @@ -19437,9 +20088,9 @@ "question__title": "Find Target Indices After Sorting Array", "question__title_slug": "find-target-indices-after-sorting-array", "question__hide": false, - "total_acs": 17807, - "total_submitted": 22627, - "total_column_articles": 235, + "total_acs": 17963, + "total_submitted": 22838, + "total_column_articles": 237, "frontend_question_id": "2089", "is_new_question": false }, @@ -19458,8 +20109,8 @@ "question__title": "Number of Equal Count Substrings", "question__title_slug": "number-of-equal-count-substrings", "question__hide": false, - "total_acs": 222, - "total_submitted": 416, + "total_acs": 227, + "total_submitted": 422, "total_column_articles": 12, "frontend_question_id": "2067", "is_new_question": false @@ -19479,8 +20130,8 @@ "question__title": "Account Balance", "question__title_slug": "account-balance", "question__hide": false, - "total_acs": 1916, - "total_submitted": 2423, + "total_acs": 1941, + "total_submitted": 2460, "total_column_articles": 28, "frontend_question_id": "2066", "is_new_question": false @@ -19500,8 +20151,8 @@ "question__title": "Sequentially Ordinal Rank Tracker", "question__title_slug": "sequentially-ordinal-rank-tracker", "question__hide": false, - "total_acs": 3274, - "total_submitted": 5887, + "total_acs": 3315, + "total_submitted": 5942, "total_column_articles": 87, "frontend_question_id": "2102", "is_new_question": false @@ -19521,8 +20172,8 @@ "question__title": "Detonate the Maximum Bombs", "question__title_slug": "detonate-the-maximum-bombs", "question__hide": false, - "total_acs": 5543, - "total_submitted": 14015, + "total_acs": 5593, + "total_submitted": 14149, "total_column_articles": 101, "frontend_question_id": "2101", "is_new_question": false @@ -19542,9 +20193,9 @@ "question__title": "Find Good Days to Rob the Bank", "question__title_slug": "find-good-days-to-rob-the-bank", "question__hide": false, - "total_acs": 34293, - "total_submitted": 70389, - "total_column_articles": 433, + "total_acs": 34339, + "total_submitted": 70497, + "total_column_articles": 434, "frontend_question_id": "2100", "is_new_question": false }, @@ -19563,9 +20214,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": 9079, - "total_submitted": 18738, - "total_column_articles": 181, + "total_acs": 9168, + "total_submitted": 18902, + "total_column_articles": 182, "frontend_question_id": "2099", "is_new_question": false }, @@ -19584,8 +20235,8 @@ "question__title": "Number of Spaces Cleaning Robot Cleaned", "question__title_slug": "number-of-spaces-cleaning-robot-cleaned", "question__hide": false, - "total_acs": 636, - "total_submitted": 1280, + "total_acs": 640, + "total_submitted": 1284, "total_column_articles": 26, "frontend_question_id": "2061", "is_new_question": false @@ -19605,8 +20256,8 @@ "question__title": "Sum of k-Mirror Numbers", "question__title_slug": "sum-of-k-mirror-numbers", "question__hide": false, - "total_acs": 3250, - "total_submitted": 7492, + "total_acs": 3255, + "total_submitted": 7500, "total_column_articles": 83, "frontend_question_id": "2081", "is_new_question": false @@ -19626,8 +20277,8 @@ "question__title": "Valid Arrangement of Pairs", "question__title_slug": "valid-arrangement-of-pairs", "question__hide": false, - "total_acs": 2858, - "total_submitted": 7554, + "total_acs": 2862, + "total_submitted": 7570, "total_column_articles": 55, "frontend_question_id": "2097", "is_new_question": false @@ -19647,8 +20298,8 @@ "question__title": "Stamping the Grid", "question__title_slug": "stamping-the-grid", "question__hide": false, - "total_acs": 2685, - "total_submitted": 8840, + "total_acs": 2707, + "total_submitted": 8901, "total_column_articles": 65, "frontend_question_id": "2132", "is_new_question": false @@ -19668,9 +20319,9 @@ "question__title": "Two Furthest Houses With Different Colors", "question__title_slug": "two-furthest-houses-with-different-colors", "question__hide": false, - "total_acs": 12648, - "total_submitted": 17457, - "total_column_articles": 200, + "total_acs": 12768, + "total_submitted": 17631, + "total_column_articles": 202, "frontend_question_id": "2078", "is_new_question": false }, @@ -19689,8 +20340,8 @@ "question__title": "Process Restricted Friend Requests", "question__title_slug": "process-restricted-friend-requests", "question__hide": false, - "total_acs": 3675, - "total_submitted": 7214, + "total_acs": 3693, + "total_submitted": 7239, "total_column_articles": 88, "frontend_question_id": "2076", "is_new_question": false @@ -19710,9 +20361,9 @@ "question__title": "Decode the Slanted Ciphertext", "question__title_slug": "decode-the-slanted-ciphertext", "question__hide": false, - "total_acs": 4565, - "total_submitted": 9693, - "total_column_articles": 84, + "total_acs": 4593, + "total_submitted": 9751, + "total_column_articles": 85, "frontend_question_id": "2075", "is_new_question": false }, @@ -19731,8 +20382,8 @@ "question__title": "Reverse Nodes in Even Length Groups", "question__title_slug": "reverse-nodes-in-even-length-groups", "question__hide": false, - "total_acs": 6491, - "total_submitted": 14235, + "total_acs": 6528, + "total_submitted": 14307, "total_column_articles": 157, "frontend_question_id": "2074", "is_new_question": false @@ -19752,8 +20403,8 @@ "question__title": "Time Needed to Buy Tickets", "question__title_slug": "time-needed-to-buy-tickets", "question__hide": false, - "total_acs": 12987, - "total_submitted": 21039, + "total_acs": 13094, + "total_submitted": 21213, "total_column_articles": 218, "frontend_question_id": "2073", "is_new_question": false @@ -19773,8 +20424,8 @@ "question__title": "The Category of Each Member in the Store", "question__title_slug": "the-category-of-each-member-in-the-store", "question__hide": false, - "total_acs": 1442, - "total_submitted": 2202, + "total_acs": 1459, + "total_submitted": 2228, "total_column_articles": 21, "frontend_question_id": "2051", "is_new_question": false @@ -19794,9 +20445,9 @@ "question__title": "Count Fertile Pyramids in a Land", "question__title_slug": "count-fertile-pyramids-in-a-land", "question__hide": false, - "total_acs": 2434, - "total_submitted": 3839, - "total_column_articles": 55, + "total_acs": 2457, + "total_submitted": 3869, + "total_column_articles": 56, "frontend_question_id": "2088", "is_new_question": false }, @@ -19815,8 +20466,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": 3948, - "total_submitted": 7896, + "total_acs": 3973, + "total_submitted": 7949, "total_column_articles": 87, "frontend_question_id": "2087", "is_new_question": false @@ -19836,8 +20487,8 @@ "question__title": "Minimum Number of Food Buckets to Feed the Hamsters", "question__title_slug": "minimum-number-of-food-buckets-to-feed-the-hamsters", "question__hide": false, - "total_acs": 5415, - "total_submitted": 11557, + "total_acs": 5459, + "total_submitted": 11662, "total_column_articles": 104, "frontend_question_id": "2086", "is_new_question": false @@ -19857,9 +20508,9 @@ "question__title": "Count Common Words With One Occurrence", "question__title_slug": "count-common-words-with-one-occurrence", "question__hide": false, - "total_acs": 8777, - "total_submitted": 12248, - "total_column_articles": 138, + "total_acs": 8841, + "total_submitted": 12360, + "total_column_articles": 139, "frontend_question_id": "2085", "is_new_question": false }, @@ -19878,8 +20529,8 @@ "question__title": "Maximum Path Quality of a Graph", "question__title_slug": "maximum-path-quality-of-a-graph", "question__hide": false, - "total_acs": 3018, - "total_submitted": 5582, + "total_acs": 3030, + "total_submitted": 5612, "total_column_articles": 68, "frontend_question_id": "2065", "is_new_question": false @@ -19899,8 +20550,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": 5832, - "total_submitted": 13066, + "total_acs": 5884, + "total_submitted": 13177, "total_column_articles": 105, "frontend_question_id": "2064", "is_new_question": false @@ -19920,8 +20571,8 @@ "question__title": "Vowels of All Substrings", "question__title_slug": "vowels-of-all-substrings", "question__hide": false, - "total_acs": 6633, - "total_submitted": 12923, + "total_acs": 6678, + "total_submitted": 12999, "total_column_articles": 134, "frontend_question_id": "2063", "is_new_question": false @@ -19941,8 +20592,8 @@ "question__title": "Count Vowel Substrings of a String", "question__title_slug": "count-vowel-substrings-of-a-string", "question__hide": false, - "total_acs": 8769, - "total_submitted": 13987, + "total_acs": 8808, + "total_submitted": 14044, "total_column_articles": 156, "frontend_question_id": "2062", "is_new_question": false @@ -19962,8 +20613,8 @@ "question__title": "Accepted Candidates From the Interviews", "question__title_slug": "accepted-candidates-from-the-interviews", "question__hide": false, - "total_acs": 1955, - "total_submitted": 2550, + "total_acs": 1985, + "total_submitted": 2588, "total_column_articles": 29, "frontend_question_id": "2041", "is_new_question": false @@ -19983,8 +20634,8 @@ "question__title": "Check if an Original String Exists Given Two Encoded Strings", "question__title_slug": "check-if-an-original-string-exists-given-two-encoded-strings", "question__hide": false, - "total_acs": 1591, - "total_submitted": 3931, + "total_acs": 1595, + "total_submitted": 3951, "total_column_articles": 27, "frontend_question_id": "2060", "is_new_question": false @@ -20004,9 +20655,9 @@ "question__title": "Minimum Operations to Convert Number", "question__title_slug": "minimum-operations-to-convert-number", "question__hide": false, - "total_acs": 6945, - "total_submitted": 14451, - "total_column_articles": 122, + "total_acs": 6994, + "total_submitted": 14541, + "total_column_articles": 123, "frontend_question_id": "2059", "is_new_question": false }, @@ -20025,8 +20676,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": 7933, - "total_submitted": 14047, + "total_acs": 7963, + "total_submitted": 14099, "total_column_articles": 120, "frontend_question_id": "2058", "is_new_question": false @@ -20046,8 +20697,8 @@ "question__title": "Smallest Index With Equal Value", "question__title_slug": "smallest-index-with-equal-value", "question__hide": false, - "total_acs": 12173, - "total_submitted": 16103, + "total_acs": 12254, + "total_submitted": 16202, "total_column_articles": 119, "frontend_question_id": "2057", "is_new_question": false @@ -20067,8 +20718,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": 3220, - "total_submitted": 10873, + "total_acs": 3298, + "total_submitted": 11076, "total_column_articles": 50, "frontend_question_id": "2071", "is_new_question": false @@ -20088,8 +20739,8 @@ "question__title": "Most Beautiful Item for Each Query", "question__title_slug": "most-beautiful-item-for-each-query", "question__hide": false, - "total_acs": 4239, - "total_submitted": 9469, + "total_acs": 4268, + "total_submitted": 9521, "total_column_articles": 113, "frontend_question_id": "2070", "is_new_question": false @@ -20109,8 +20760,8 @@ "question__title": "Walking Robot Simulation II", "question__title_slug": "walking-robot-simulation-ii", "question__hide": false, - "total_acs": 4624, - "total_submitted": 21074, + "total_acs": 4669, + "total_submitted": 21216, "total_column_articles": 111, "frontend_question_id": "2069", "is_new_question": false @@ -20130,9 +20781,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": 9294, - "total_submitted": 13313, - "total_column_articles": 149, + "total_acs": 9371, + "total_submitted": 13417, + "total_column_articles": 152, "frontend_question_id": "2068", "is_new_question": false }, @@ -20151,8 +20802,8 @@ "question__title": "Parallel Courses III", "question__title_slug": "parallel-courses-iii", "question__hide": false, - "total_acs": 3957, - "total_submitted": 6778, + "total_acs": 3985, + "total_submitted": 6827, "total_column_articles": 106, "frontend_question_id": "2050", "is_new_question": false @@ -20172,9 +20823,9 @@ "question__title": "Count Nodes With the Highest Score", "question__title_slug": "count-nodes-with-the-highest-score", "question__hide": false, - "total_acs": 27586, - "total_submitted": 53255, - "total_column_articles": 314, + "total_acs": 27631, + "total_submitted": 53341, + "total_column_articles": 315, "frontend_question_id": "2049", "is_new_question": false }, @@ -20193,9 +20844,9 @@ "question__title": "Next Greater Numerically Balanced Number", "question__title_slug": "next-greater-numerically-balanced-number", "question__hide": false, - "total_acs": 5987, - "total_submitted": 13243, - "total_column_articles": 118, + "total_acs": 6013, + "total_submitted": 13284, + "total_column_articles": 119, "frontend_question_id": "2048", "is_new_question": false }, @@ -20214,8 +20865,8 @@ "question__title": "Number of Valid Words in a Sentence", "question__title_slug": "number-of-valid-words-in-a-sentence", "question__hide": false, - "total_acs": 28267, - "total_submitted": 73055, + "total_acs": 28301, + "total_submitted": 73146, "total_column_articles": 430, "frontend_question_id": "2047", "is_new_question": false @@ -20235,8 +20886,8 @@ "question__title": "Low-Quality Problems", "question__title_slug": "low-quality-problems", "question__hide": false, - "total_acs": 3472, - "total_submitted": 4325, + "total_acs": 3506, + "total_submitted": 4378, "total_column_articles": 33, "frontend_question_id": "2026", "is_new_question": false @@ -20256,8 +20907,8 @@ "question__title": "Second Minimum Time to Reach Destination", "question__title_slug": "second-minimum-time-to-reach-destination", "question__hide": false, - "total_acs": 16769, - "total_submitted": 31426, + "total_acs": 16813, + "total_submitted": 31508, "total_column_articles": 166, "frontend_question_id": "2045", "is_new_question": false @@ -20277,8 +20928,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": 35978, - "total_submitted": 43986, + "total_acs": 36043, + "total_submitted": 44060, "total_column_articles": 400, "frontend_question_id": "2044", "is_new_question": false @@ -20298,8 +20949,8 @@ "question__title": "Simple Bank System", "question__title_slug": "simple-bank-system", "question__hide": false, - "total_acs": 35780, - "total_submitted": 54150, + "total_acs": 35900, + "total_submitted": 54333, "total_column_articles": 310, "frontend_question_id": "2043", "is_new_question": false @@ -20319,8 +20970,8 @@ "question__title": "Check if Numbers Are Ascending in a Sentence", "question__title_slug": "check-if-numbers-are-ascending-in-a-sentence", "question__hide": false, - "total_acs": 36191, - "total_submitted": 50245, + "total_acs": 36265, + "total_submitted": 50352, "total_column_articles": 498, "frontend_question_id": "2042", "is_new_question": false @@ -20340,8 +20991,8 @@ "question__title": "Number of Accounts That Did Not Stream", "question__title_slug": "number-of-accounts-that-did-not-stream", "question__hide": false, - "total_acs": 1831, - "total_submitted": 2582, + "total_acs": 1854, + "total_submitted": 2612, "total_column_articles": 34, "frontend_question_id": "2020", "is_new_question": false @@ -20361,9 +21012,9 @@ "question__title": "Number of Valid Move Combinations On Chessboard", "question__title_slug": "number-of-valid-move-combinations-on-chessboard", "question__hide": false, - "total_acs": 1057, - "total_submitted": 1799, - "total_column_articles": 22, + "total_acs": 1090, + "total_submitted": 1836, + "total_column_articles": 23, "frontend_question_id": "2056", "is_new_question": false }, @@ -20382,8 +21033,8 @@ "question__title": "Plates Between Candles", "question__title_slug": "plates-between-candles", "question__hide": false, - "total_acs": 34152, - "total_submitted": 78669, + "total_acs": 34174, + "total_submitted": 78715, "total_column_articles": 437, "frontend_question_id": "2055", "is_new_question": false @@ -20403,9 +21054,9 @@ "question__title": "Two Best Non-Overlapping Events", "question__title_slug": "two-best-non-overlapping-events", "question__hide": false, - "total_acs": 4553, - "total_submitted": 12009, - "total_column_articles": 85, + "total_acs": 4575, + "total_submitted": 12056, + "total_column_articles": 86, "frontend_question_id": "2054", "is_new_question": false }, @@ -20424,8 +21075,8 @@ "question__title": "Kth Distinct String in an Array", "question__title_slug": "kth-distinct-string-in-an-array", "question__hide": false, - "total_acs": 9764, - "total_submitted": 13744, + "total_acs": 9843, + "total_submitted": 13852, "total_column_articles": 169, "frontend_question_id": "2053", "is_new_question": false @@ -20445,8 +21096,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": 3863, - "total_submitted": 11208, + "total_acs": 3882, + "total_submitted": 11238, "total_column_articles": 72, "frontend_question_id": "2035", "is_new_question": false @@ -20466,9 +21117,9 @@ "question__title": "Stock Price Fluctuation ", "question__title_slug": "stock-price-fluctuation", "question__hide": false, - "total_acs": 23992, - "total_submitted": 52291, - "total_column_articles": 241, + "total_acs": 24118, + "total_submitted": 52488, + "total_column_articles": 243, "frontend_question_id": "2034", "is_new_question": false }, @@ -20487,8 +21138,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": 6483, - "total_submitted": 15066, + "total_acs": 6504, + "total_submitted": 15102, "total_column_articles": 123, "frontend_question_id": "2033", "is_new_question": false @@ -20508,8 +21159,8 @@ "question__title": "Two Out of Three", "question__title_slug": "two-out-of-three", "question__hide": false, - "total_acs": 31951, - "total_submitted": 43666, + "total_acs": 32014, + "total_submitted": 43750, "total_column_articles": 410, "frontend_question_id": "2032", "is_new_question": false @@ -20529,9 +21180,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": 1872, - "total_submitted": 3041, - "total_column_articles": 43, + "total_acs": 1910, + "total_submitted": 3101, + "total_column_articles": 44, "frontend_question_id": "2010", "is_new_question": false }, @@ -20550,8 +21201,8 @@ "question__title": "Smallest K-Length Subsequence With Occurrences of a Letter", "question__title_slug": "smallest-k-length-subsequence-with-occurrences-of-a-letter", "question__hide": false, - "total_acs": 2178, - "total_submitted": 5999, + "total_acs": 2199, + "total_submitted": 6048, "total_column_articles": 53, "frontend_question_id": "2030", "is_new_question": false @@ -20571,8 +21222,8 @@ "question__title": "Stone Game IX", "question__title_slug": "stone-game-ix", "question__hide": false, - "total_acs": 20207, - "total_submitted": 43021, + "total_acs": 20222, + "total_submitted": 43067, "total_column_articles": 198, "frontend_question_id": "2029", "is_new_question": false @@ -20592,8 +21243,8 @@ "question__title": "Find Missing Observations", "question__title_slug": "find-missing-observations", "question__hide": false, - "total_acs": 34732, - "total_submitted": 68568, + "total_acs": 34762, + "total_submitted": 68625, "total_column_articles": 400, "frontend_question_id": "2028", "is_new_question": false @@ -20613,8 +21264,8 @@ "question__title": "Minimum Moves to Convert String", "question__title_slug": "minimum-moves-to-convert-string", "question__hide": false, - "total_acs": 27609, - "total_submitted": 41176, + "total_acs": 27666, + "total_submitted": 41270, "total_column_articles": 304, "frontend_question_id": "2027", "is_new_question": false @@ -20634,9 +21285,9 @@ "question__title": "Subtree Removal Game with Fibonacci Tree", "question__title_slug": "subtree-removal-game-with-fibonacci-tree", "question__hide": false, - "total_acs": 159, - "total_submitted": 329, - "total_column_articles": 9, + "total_acs": 172, + "total_submitted": 345, + "total_column_articles": 10, "frontend_question_id": "2005", "is_new_question": false }, @@ -20655,8 +21306,8 @@ "question__title": "The Number of Seniors and Juniors to Join the Company", "question__title_slug": "the-number-of-seniors-and-juniors-to-join-the-company", "question__hide": false, - "total_acs": 1291, - "total_submitted": 3070, + "total_acs": 1313, + "total_submitted": 3128, "total_column_articles": 29, "frontend_question_id": "2004", "is_new_question": false @@ -20676,8 +21327,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": 20482, - "total_submitted": 36661, + "total_acs": 20496, + "total_submitted": 36684, "total_column_articles": 181, "frontend_question_id": "2039", "is_new_question": false @@ -20697,8 +21348,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": 1949, - "total_submitted": 5807, + "total_acs": 1954, + "total_submitted": 5839, "total_column_articles": 35, "frontend_question_id": "2040", "is_new_question": false @@ -20718,8 +21369,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": 34768, - "total_submitted": 54847, + "total_acs": 34800, + "total_submitted": 54902, "total_column_articles": 451, "frontend_question_id": "2038", "is_new_question": false @@ -20739,8 +21390,8 @@ "question__title": "Minimum Number of Moves to Seat Everyone", "question__title_slug": "minimum-number-of-moves-to-seat-everyone", "question__hide": false, - "total_acs": 23092, - "total_submitted": 27107, + "total_acs": 23193, + "total_submitted": 27222, "total_column_articles": 255, "frontend_question_id": "2037", "is_new_question": false @@ -20760,8 +21411,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": 1836, - "total_submitted": 4916, + "total_acs": 1844, + "total_submitted": 4938, "total_column_articles": 43, "frontend_question_id": "2019", "is_new_question": false @@ -20781,8 +21432,8 @@ "question__title": "Check if Word Can Be Placed In Crossword", "question__title_slug": "check-if-word-can-be-placed-in-crossword", "question__hide": false, - "total_acs": 3116, - "total_submitted": 7401, + "total_acs": 3134, + "total_submitted": 7432, "total_column_articles": 67, "frontend_question_id": "2018", "is_new_question": false @@ -20802,8 +21453,8 @@ "question__title": "Grid Game", "question__title_slug": "grid-game", "question__hide": false, - "total_acs": 5617, - "total_submitted": 14673, + "total_acs": 5646, + "total_submitted": 14737, "total_column_articles": 126, "frontend_question_id": "2017", "is_new_question": false @@ -20823,9 +21474,9 @@ "question__title": "Maximum Difference Between Increasing Elements", "question__title_slug": "maximum-difference-between-increasing-elements", "question__hide": false, - "total_acs": 44702, - "total_submitted": 74847, - "total_column_articles": 504, + "total_acs": 44785, + "total_submitted": 74977, + "total_column_articles": 505, "frontend_question_id": "2016", "is_new_question": false }, @@ -20844,8 +21495,8 @@ "question__title": "Count the Number of Experiments", "question__title_slug": "count-the-number-of-experiments", "question__hide": false, - "total_acs": 2332, - "total_submitted": 4952, + "total_acs": 2359, + "total_submitted": 5019, "total_column_articles": 27, "frontend_question_id": "1990", "is_new_question": false @@ -20865,8 +21516,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": 347, - "total_submitted": 607, + "total_acs": 354, + "total_submitted": 616, "total_column_articles": 16, "frontend_question_id": "2015", "is_new_question": false @@ -20886,8 +21537,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": 287, - "total_submitted": 620, + "total_acs": 290, + "total_submitted": 623, "total_column_articles": 14, "frontend_question_id": "1999", "is_new_question": false @@ -20907,8 +21558,8 @@ "question__title": "Longest Subsequence Repeated k Times", "question__title_slug": "longest-subsequence-repeated-k-times", "question__hide": false, - "total_acs": 2292, - "total_submitted": 4192, + "total_acs": 2299, + "total_submitted": 4215, "total_column_articles": 31, "frontend_question_id": "2014", "is_new_question": false @@ -20928,8 +21579,8 @@ "question__title": "Detect Squares", "question__title_slug": "detect-squares", "question__hide": false, - "total_acs": 21528, - "total_submitted": 38043, + "total_acs": 21541, + "total_submitted": 38073, "total_column_articles": 244, "frontend_question_id": "2013", "is_new_question": false @@ -20949,8 +21600,8 @@ "question__title": "Sum of Beauty in the Array", "question__title_slug": "sum-of-beauty-in-the-array", "question__hide": false, - "total_acs": 5958, - "total_submitted": 15365, + "total_acs": 5991, + "total_submitted": 15426, "total_column_articles": 104, "frontend_question_id": "2012", "is_new_question": false @@ -20970,8 +21621,8 @@ "question__title": "Final Value of Variable After Performing Operations", "question__title_slug": "final-value-of-variable-after-performing-operations", "question__hide": false, - "total_acs": 45103, - "total_submitted": 51836, + "total_acs": 45369, + "total_submitted": 52159, "total_column_articles": 396, "frontend_question_id": "2011", "is_new_question": false @@ -20991,8 +21642,8 @@ "question__title": "Find Cutoff Score for Each School", "question__title_slug": "find-cutoff-score-for-each-school", "question__hide": false, - "total_acs": 4672, - "total_submitted": 7243, + "total_acs": 4703, + "total_submitted": 7283, "total_column_articles": 60, "frontend_question_id": "1988", "is_new_question": false @@ -21012,8 +21663,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": 2381, - "total_submitted": 7944, + "total_acs": 2390, + "total_submitted": 7965, "total_column_articles": 61, "frontend_question_id": "2025", "is_new_question": false @@ -21033,8 +21684,8 @@ "question__title": "Maximize the Confusion of an Exam", "question__title_slug": "maximize-the-confusion-of-an-exam", "question__hide": false, - "total_acs": 38258, - "total_submitted": 66806, + "total_acs": 38318, + "total_submitted": 66914, "total_column_articles": 440, "frontend_question_id": "2024", "is_new_question": false @@ -21054,9 +21705,9 @@ "question__title": "Number of Pairs of Strings With Concatenation Equal to Target", "question__title_slug": "number-of-pairs-of-strings-with-concatenation-equal-to-target", "question__hide": false, - "total_acs": 6331, - "total_submitted": 8542, - "total_column_articles": 102, + "total_acs": 6371, + "total_submitted": 8593, + "total_column_articles": 101, "frontend_question_id": "2023", "is_new_question": false }, @@ -21075,9 +21726,9 @@ "question__title": "Convert 1D Array Into 2D Array", "question__title_slug": "convert-1d-array-into-2d-array", "question__hide": false, - "total_acs": 40132, - "total_submitted": 61210, - "total_column_articles": 477, + "total_acs": 40237, + "total_submitted": 61386, + "total_column_articles": 480, "frontend_question_id": "2022", "is_new_question": false }, @@ -21096,8 +21747,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": 2959, - "total_submitted": 6942, + "total_acs": 2972, + "total_submitted": 6960, "total_column_articles": 60, "frontend_question_id": "2003", "is_new_question": false @@ -21117,9 +21768,9 @@ "question__title": "Maximum Product of the Length of Two Palindromic Subsequences", "question__title_slug": "maximum-product-of-the-length-of-two-palindromic-subsequences", "question__hide": false, - "total_acs": 5740, - "total_submitted": 9550, - "total_column_articles": 121, + "total_acs": 5754, + "total_submitted": 9571, + "total_column_articles": 122, "frontend_question_id": "2002", "is_new_question": false }, @@ -21138,8 +21789,8 @@ "question__title": "Number of Pairs of Interchangeable Rectangles", "question__title_slug": "number-of-pairs-of-interchangeable-rectangles", "question__hide": false, - "total_acs": 8220, - "total_submitted": 21222, + "total_acs": 8248, + "total_submitted": 21272, "total_column_articles": 164, "frontend_question_id": "2001", "is_new_question": false @@ -21159,9 +21810,9 @@ "question__title": "Reverse Prefix of Word", "question__title_slug": "reverse-prefix-of-word", "question__hide": false, - "total_acs": 37715, - "total_submitted": 48643, - "total_column_articles": 477, + "total_acs": 37841, + "total_submitted": 48820, + "total_column_articles": 478, "frontend_question_id": "2000", "is_new_question": false }, @@ -21180,8 +21831,8 @@ "question__title": "Employees Whose Manager Left the Company", "question__title_slug": "employees-whose-manager-left-the-company", "question__hide": false, - "total_acs": 3577, - "total_submitted": 6952, + "total_acs": 3958, + "total_submitted": 7741, "total_column_articles": 37, "frontend_question_id": "1978", "is_new_question": false @@ -21201,8 +21852,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": 489, - "total_submitted": 817, + "total_acs": 493, + "total_submitted": 826, "total_column_articles": 21, "frontend_question_id": "1973", "is_new_question": false @@ -21222,8 +21873,8 @@ "question__title": "GCD Sort of an Array", "question__title_slug": "gcd-sort-of-an-array", "question__hide": false, - "total_acs": 2839, - "total_submitted": 6321, + "total_acs": 2877, + "total_submitted": 6374, "total_column_articles": 56, "frontend_question_id": "1998", "is_new_question": false @@ -21243,8 +21894,8 @@ "question__title": "First Day Where You Have Been in All the Rooms", "question__title_slug": "first-day-where-you-have-been-in-all-the-rooms", "question__hide": false, - "total_acs": 3458, - "total_submitted": 9840, + "total_acs": 3477, + "total_submitted": 9884, "total_column_articles": 53, "frontend_question_id": "1997", "is_new_question": false @@ -21264,8 +21915,8 @@ "question__title": "The Number of Weak Characters in the Game", "question__title_slug": "the-number-of-weak-characters-in-the-game", "question__hide": false, - "total_acs": 29374, - "total_submitted": 70809, + "total_acs": 29397, + "total_submitted": 70857, "total_column_articles": 307, "frontend_question_id": "1996", "is_new_question": false @@ -21285,8 +21936,8 @@ "question__title": "Count Special Quadruplets", "question__title_slug": "count-special-quadruplets", "question__hide": false, - "total_acs": 37195, - "total_submitted": 56141, + "total_acs": 37272, + "total_submitted": 56266, "total_column_articles": 287, "frontend_question_id": "1995", "is_new_question": false @@ -21306,9 +21957,9 @@ "question__title": "Find if Path Exists in Graph", "question__title_slug": "find-if-path-exists-in-graph", "question__hide": false, - "total_acs": 27327, - "total_submitted": 50102, - "total_column_articles": 312, + "total_acs": 27562, + "total_submitted": 50683, + "total_column_articles": 311, "frontend_question_id": "1971", "is_new_question": false }, @@ -21327,8 +21978,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": 2634, - "total_submitted": 6179, + "total_acs": 2665, + "total_submitted": 6294, "total_column_articles": 43, "frontend_question_id": "1972", "is_new_question": false @@ -21348,8 +21999,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": 2936, - "total_submitted": 6832, + "total_acs": 2960, + "total_submitted": 6881, "total_column_articles": 73, "frontend_question_id": "2009", "is_new_question": false @@ -21369,8 +22020,8 @@ "question__title": "Maximum Earnings From Taxi", "question__title_slug": "maximum-earnings-from-taxi", "question__hide": false, - "total_acs": 5955, - "total_submitted": 12928, + "total_acs": 5993, + "total_submitted": 13043, "total_column_articles": 101, "frontend_question_id": "2008", "is_new_question": false @@ -21390,8 +22041,8 @@ "question__title": "Find Original Array From Doubled Array", "question__title_slug": "find-original-array-from-doubled-array", "question__hide": false, - "total_acs": 6615, - "total_submitted": 19759, + "total_acs": 6650, + "total_submitted": 19839, "total_column_articles": 125, "frontend_question_id": "2007", "is_new_question": false @@ -21411,9 +22062,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": 52951, - "total_submitted": 63018, - "total_column_articles": 523, + "total_acs": 53140, + "total_submitted": 63296, + "total_column_articles": 524, "frontend_question_id": "2006", "is_new_question": false }, @@ -21432,8 +22083,8 @@ "question__title": "Number of Unique Good Subsequences", "question__title_slug": "number-of-unique-good-subsequences", "question__hide": false, - "total_acs": 2414, - "total_submitted": 4808, + "total_acs": 2427, + "total_submitted": 4833, "total_column_articles": 40, "frontend_question_id": "1987", "is_new_question": false @@ -21453,9 +22104,9 @@ "question__title": "Minimum Number of Work Sessions to Finish the Tasks", "question__title_slug": "minimum-number-of-work-sessions-to-finish-the-tasks", "question__hide": false, - "total_acs": 6307, - "total_submitted": 19588, - "total_column_articles": 111, + "total_acs": 6332, + "total_submitted": 19647, + "total_column_articles": 112, "frontend_question_id": "1986", "is_new_question": false }, @@ -21474,9 +22125,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": 10910, - "total_submitted": 25918, - "total_column_articles": 149, + "total_acs": 10968, + "total_submitted": 26048, + "total_column_articles": 151, "frontend_question_id": "1985", "is_new_question": false }, @@ -21495,9 +22146,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": 45764, - "total_submitted": 73989, - "total_column_articles": 546, + "total_acs": 45880, + "total_submitted": 74184, + "total_column_articles": 547, "frontend_question_id": "1984", "is_new_question": false }, @@ -21516,8 +22167,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": 231, - "total_submitted": 363, + "total_acs": 234, + "total_submitted": 366, "total_column_articles": 10, "frontend_question_id": "1966", "is_new_question": false @@ -21537,9 +22188,9 @@ "question__title": "Employees With Missing Information", "question__title_slug": "employees-with-missing-information", "question__hide": false, - "total_acs": 44406, - "total_submitted": 62474, - "total_column_articles": 280, + "total_acs": 44670, + "total_submitted": 62852, + "total_column_articles": 282, "frontend_question_id": "1965", "is_new_question": false }, @@ -21558,9 +22209,9 @@ "question__title": "Find Array Given Subset Sums", "question__title_slug": "find-array-given-subset-sums", "question__hide": false, - "total_acs": 1435, - "total_submitted": 3009, - "total_column_articles": 27, + "total_acs": 1470, + "total_submitted": 3066, + "total_column_articles": 28, "frontend_question_id": "1982", "is_new_question": false }, @@ -21579,8 +22230,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": 7105, - "total_submitted": 21547, + "total_acs": 7142, + "total_submitted": 21659, "total_column_articles": 107, "frontend_question_id": "1981", "is_new_question": false @@ -21600,9 +22251,9 @@ "question__title": "Find Unique Binary String", "question__title_slug": "find-unique-binary-string", "question__hide": false, - "total_acs": 8584, - "total_submitted": 14391, - "total_column_articles": 145, + "total_acs": 8625, + "total_submitted": 14452, + "total_column_articles": 146, "frontend_question_id": "1980", "is_new_question": false }, @@ -21621,9 +22272,9 @@ "question__title": "Find Greatest Common Divisor of Array", "question__title_slug": "find-greatest-common-divisor-of-array", "question__hide": false, - "total_acs": 21030, - "total_submitted": 27279, - "total_column_articles": 267, + "total_acs": 21229, + "total_submitted": 27547, + "total_column_articles": 268, "frontend_question_id": "1979", "is_new_question": false }, @@ -21642,8 +22293,8 @@ "question__title": "The Number of Good Subsets", "question__title_slug": "the-number-of-good-subsets", "question__hide": false, - "total_acs": 16351, - "total_submitted": 29152, + "total_acs": 16366, + "total_submitted": 29190, "total_column_articles": 189, "frontend_question_id": "1994", "is_new_question": false @@ -21663,8 +22314,8 @@ "question__title": "Operations on Tree", "question__title_slug": "operations-on-tree", "question__hide": false, - "total_acs": 3225, - "total_submitted": 8119, + "total_acs": 3236, + "total_submitted": 8137, "total_column_articles": 68, "frontend_question_id": "1993", "is_new_question": false @@ -21684,8 +22335,8 @@ "question__title": "Find All Groups of Farmland", "question__title_slug": "find-all-groups-of-farmland", "question__hide": false, - "total_acs": 5624, - "total_submitted": 9219, + "total_acs": 5644, + "total_submitted": 9244, "total_column_articles": 117, "frontend_question_id": "1992", "is_new_question": false @@ -21705,9 +22356,9 @@ "question__title": "Find the Middle Index in Array", "question__title_slug": "find-the-middle-index-in-array", "question__hide": false, - "total_acs": 19820, - "total_submitted": 30977, - "total_column_articles": 286, + "total_acs": 19993, + "total_submitted": 31256, + "total_column_articles": 287, "frontend_question_id": "1991", "is_new_question": false }, @@ -21726,9 +22377,9 @@ "question__title": "Last Day Where You Can Still Cross", "question__title_slug": "last-day-where-you-can-still-cross", "question__hide": false, - "total_acs": 3481, - "total_submitted": 6932, - "total_column_articles": 69, + "total_acs": 3518, + "total_submitted": 6990, + "total_column_articles": 70, "frontend_question_id": "1970", "is_new_question": false }, @@ -21747,8 +22398,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": 3838, - "total_submitted": 12888, + "total_acs": 3848, + "total_submitted": 12925, "total_column_articles": 57, "frontend_question_id": "1969", "is_new_question": false @@ -21768,9 +22419,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": 11620, - "total_submitted": 14664, - "total_column_articles": 156, + "total_acs": 11714, + "total_submitted": 14769, + "total_column_articles": 158, "frontend_question_id": "1967", "is_new_question": false }, @@ -21789,8 +22440,8 @@ "question__title": "All the Pairs With the Maximum Number of Common Followers", "question__title_slug": "all-the-pairs-with-the-maximum-number-of-common-followers", "question__hide": false, - "total_acs": 3904, - "total_submitted": 5983, + "total_acs": 3936, + "total_submitted": 6045, "total_column_articles": 52, "frontend_question_id": "1951", "is_new_question": false @@ -21810,8 +22461,8 @@ "question__title": "Strong Friendship", "question__title_slug": "strong-friendship", "question__hide": false, - "total_acs": 3540, - "total_submitted": 6802, + "total_acs": 3570, + "total_submitted": 6851, "total_column_articles": 50, "frontend_question_id": "1949", "is_new_question": false @@ -21831,9 +22482,9 @@ "question__title": "Find the Longest Valid Obstacle Course at Each Position", "question__title_slug": "find-the-longest-valid-obstacle-course-at-each-position", "question__hide": false, - "total_acs": 4638, - "total_submitted": 10902, - "total_column_articles": 68, + "total_acs": 4832, + "total_submitted": 11254, + "total_column_articles": 70, "frontend_question_id": "1964", "is_new_question": false }, @@ -21852,8 +22503,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": 6765, - "total_submitted": 10485, + "total_acs": 6801, + "total_submitted": 10542, "total_column_articles": 84, "frontend_question_id": "1963", "is_new_question": false @@ -21873,8 +22524,8 @@ "question__title": "Remove Stones to Minimize the Total", "question__title_slug": "remove-stones-to-minimize-the-total", "question__hide": false, - "total_acs": 8163, - "total_submitted": 17568, + "total_acs": 8205, + "total_submitted": 17647, "total_column_articles": 103, "frontend_question_id": "1962", "is_new_question": false @@ -21894,8 +22545,8 @@ "question__title": "Check If String Is a Prefix of Array", "question__title_slug": "check-if-string-is-a-prefix-of-array", "question__hide": false, - "total_acs": 12486, - "total_submitted": 23652, + "total_acs": 12557, + "total_submitted": 23797, "total_column_articles": 151, "frontend_question_id": "1961", "is_new_question": false @@ -21915,9 +22566,9 @@ "question__title": "Users That Actively Request Confirmation Messages", "question__title_slug": "users-that-actively-request-confirmation-messages", "question__hide": false, - "total_acs": 2690, - "total_submitted": 4522, - "total_column_articles": 26, + "total_acs": 2725, + "total_submitted": 4576, + "total_column_articles": 27, "frontend_question_id": "1939", "is_new_question": false }, @@ -21936,8 +22587,8 @@ "question__title": "Number of Ways to Separate Numbers", "question__title_slug": "number-of-ways-to-separate-numbers", "question__hide": false, - "total_acs": 1576, - "total_submitted": 5282, + "total_acs": 1582, + "total_submitted": 5332, "total_column_articles": 27, "frontend_question_id": "1977", "is_new_question": false @@ -21957,8 +22608,8 @@ "question__title": "Number of Ways to Arrive at Destination", "question__title_slug": "number-of-ways-to-arrive-at-destination", "question__hide": false, - "total_acs": 5913, - "total_submitted": 16246, + "total_acs": 5972, + "total_submitted": 16399, "total_column_articles": 103, "frontend_question_id": "1976", "is_new_question": false @@ -21978,9 +22629,9 @@ "question__title": "Maximum Matrix Sum", "question__title_slug": "maximum-matrix-sum", "question__hide": false, - "total_acs": 5039, - "total_submitted": 12165, - "total_column_articles": 73, + "total_acs": 5073, + "total_submitted": 12234, + "total_column_articles": 74, "frontend_question_id": "1975", "is_new_question": false }, @@ -21999,9 +22650,9 @@ "question__title": "Minimum Time to Type Word Using Special Typewriter", "question__title_slug": "minimum-time-to-type-word-using-special-typewriter", "question__hide": false, - "total_acs": 9301, - "total_submitted": 12996, - "total_column_articles": 138, + "total_acs": 9391, + "total_submitted": 13122, + "total_column_articles": 139, "frontend_question_id": "1974", "is_new_question": false }, @@ -22020,9 +22671,9 @@ "question__title": "Confirmation Rate", "question__title_slug": "confirmation-rate", "question__hide": false, - "total_acs": 3325, - "total_submitted": 4729, - "total_column_articles": 44, + "total_acs": 3886, + "total_submitted": 5542, + "total_column_articles": 51, "frontend_question_id": "1934", "is_new_question": false }, @@ -22041,9 +22692,9 @@ "question__title": "Count Number of Special Subsequences", "question__title_slug": "count-number-of-special-subsequences", "question__hide": false, - "total_acs": 3806, - "total_submitted": 7250, - "total_column_articles": 59, + "total_acs": 3828, + "total_submitted": 7287, + "total_column_articles": 60, "frontend_question_id": "1955", "is_new_question": false }, @@ -22062,8 +22713,8 @@ "question__title": "Array With Elements Not Equal to Average of Neighbors", "question__title_slug": "array-with-elements-not-equal-to-average-of-neighbors", "question__hide": false, - "total_acs": 6415, - "total_submitted": 16427, + "total_acs": 6441, + "total_submitted": 16482, "total_column_articles": 97, "frontend_question_id": "1968", "is_new_question": false @@ -22083,8 +22734,8 @@ "question__title": "Maximum Number of Weeks for Which You Can Work", "question__title_slug": "maximum-number-of-weeks-for-which-you-can-work", "question__hide": false, - "total_acs": 6410, - "total_submitted": 17390, + "total_acs": 6450, + "total_submitted": 17463, "total_column_articles": 113, "frontend_question_id": "1953", "is_new_question": false @@ -22104,9 +22755,9 @@ "question__title": "Three Divisors", "question__title_slug": "three-divisors", "question__hide": false, - "total_acs": 13912, - "total_submitted": 25428, - "total_column_articles": 166, + "total_acs": 14011, + "total_submitted": 25611, + "total_column_articles": 169, "frontend_question_id": "1952", "is_new_question": false }, @@ -22125,8 +22776,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": 296, - "total_submitted": 619, + "total_acs": 300, + "total_submitted": 629, "total_column_articles": 19, "frontend_question_id": "2052", "is_new_question": false @@ -22146,8 +22797,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": 2422, - "total_submitted": 5321, + "total_acs": 2440, + "total_submitted": 5347, "total_column_articles": 51, "frontend_question_id": "1959", "is_new_question": false @@ -22167,8 +22818,8 @@ "question__title": "Check if Move is Legal", "question__title_slug": "check-if-move-is-legal", "question__hide": false, - "total_acs": 3466, - "total_submitted": 7786, + "total_acs": 3479, + "total_submitted": 7811, "total_column_articles": 62, "frontend_question_id": "1958", "is_new_question": false @@ -22188,8 +22839,8 @@ "question__title": "Delete Duplicate Folders in System", "question__title_slug": "delete-duplicate-folders-in-system", "question__hide": false, - "total_acs": 1657, - "total_submitted": 3060, + "total_acs": 1666, + "total_submitted": 3072, "total_column_articles": 29, "frontend_question_id": "1948", "is_new_question": false @@ -22209,8 +22860,8 @@ "question__title": "Maximum Compatibility Score Sum", "question__title_slug": "maximum-compatibility-score-sum", "question__hide": false, - "total_acs": 6437, - "total_submitted": 11142, + "total_acs": 6517, + "total_submitted": 11282, "total_column_articles": 126, "frontend_question_id": "1947", "is_new_question": false @@ -22230,8 +22881,8 @@ "question__title": "Largest Number After Mutating Substring", "question__title_slug": "largest-number-after-mutating-substring", "question__hide": false, - "total_acs": 7343, - "total_submitted": 22878, + "total_acs": 7368, + "total_submitted": 22961, "total_column_articles": 105, "frontend_question_id": "1946", "is_new_question": false @@ -22251,8 +22902,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": 30968, - "total_submitted": 43914, + "total_acs": 31024, + "total_submitted": 44001, "total_column_articles": 377, "frontend_question_id": "1945", "is_new_question": false @@ -22272,8 +22923,8 @@ "question__title": "Brightest Position on Street", "question__title_slug": "brightest-position-on-street", "question__hide": false, - "total_acs": 608, - "total_submitted": 973, + "total_acs": 613, + "total_submitted": 978, "total_column_articles": 22, "frontend_question_id": "2021", "is_new_question": false @@ -22293,9 +22944,9 @@ "question__title": "Erect the Fence II", "question__title_slug": "erect-the-fence-ii", "question__hide": false, - "total_acs": 238, - "total_submitted": 516, - "total_column_articles": 10, + "total_acs": 243, + "total_submitted": 523, + "total_column_articles": 11, "frontend_question_id": "1924", "is_new_question": false }, @@ -22314,9 +22965,9 @@ "question__title": "Minimum Time For K Virus Variants to Spread", "question__title_slug": "minimum-time-for-k-virus-variants-to-spread", "question__hide": false, - "total_acs": 291, - "total_submitted": 775, - "total_column_articles": 14, + "total_acs": 303, + "total_submitted": 796, + "total_column_articles": 15, "frontend_question_id": "1956", "is_new_question": false }, @@ -22335,8 +22986,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": 425, - "total_submitted": 817, + "total_acs": 430, + "total_submitted": 828, "total_column_articles": 16, "frontend_question_id": "1950", "is_new_question": false @@ -22356,8 +23007,8 @@ "question__title": "Longest Common Subsequence Between Sorted Arrays", "question__title_slug": "longest-common-subsequence-between-sorted-arrays", "question__hide": false, - "total_acs": 868, - "total_submitted": 1163, + "total_acs": 877, + "total_submitted": 1175, "total_column_articles": 39, "frontend_question_id": "1940", "is_new_question": false @@ -22377,8 +23028,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": 1064, - "total_submitted": 2135, + "total_acs": 1073, + "total_submitted": 2200, "total_column_articles": 41, "frontend_question_id": "1933", "is_new_question": false @@ -22398,8 +23049,8 @@ "question__title": "Kth Smallest Subarray Sum", "question__title_slug": "kth-smallest-subarray-sum", "question__hide": false, - "total_acs": 716, - "total_submitted": 1491, + "total_acs": 720, + "total_submitted": 1497, "total_column_articles": 11, "frontend_question_id": "1918", "is_new_question": false @@ -22419,9 +23070,9 @@ "question__title": "Maximum Genetic Difference Query", "question__title_slug": "maximum-genetic-difference-query", "question__hide": false, - "total_acs": 1751, - "total_submitted": 4448, - "total_column_articles": 50, + "total_acs": 1770, + "total_submitted": 4485, + "total_column_articles": 51, "frontend_question_id": "1938", "is_new_question": false }, @@ -22440,8 +23091,8 @@ "question__title": "Maximum Number of Points with Cost", "question__title_slug": "maximum-number-of-points-with-cost", "question__hide": false, - "total_acs": 5023, - "total_submitted": 17520, + "total_acs": 5050, + "total_submitted": 17600, "total_column_articles": 89, "frontend_question_id": "1937", "is_new_question": false @@ -22461,8 +23112,8 @@ "question__title": "Add Minimum Number of Rungs", "question__title_slug": "add-minimum-number-of-rungs", "question__hide": false, - "total_acs": 8349, - "total_submitted": 18076, + "total_acs": 8374, + "total_submitted": 18117, "total_column_articles": 114, "frontend_question_id": "1936", "is_new_question": false @@ -22482,8 +23133,8 @@ "question__title": "Check for Contradictions in Equations", "question__title_slug": "check-for-contradictions-in-equations", "question__hide": false, - "total_acs": 174, - "total_submitted": 389, + "total_acs": 176, + "total_submitted": 396, "total_column_articles": 6, "frontend_question_id": "2307", "is_new_question": false @@ -22503,8 +23154,8 @@ "question__title": "Leetcodify Similar Friends", "question__title_slug": "leetcodify-similar-friends", "question__hide": false, - "total_acs": 1820, - "total_submitted": 4200, + "total_acs": 1852, + "total_submitted": 4261, "total_column_articles": 38, "frontend_question_id": "1919", "is_new_question": false @@ -22524,8 +23175,8 @@ "question__title": "Leetcodify Friends Recommendations", "question__title_slug": "leetcodify-friends-recommendations", "question__hide": false, - "total_acs": 2021, - "total_submitted": 6388, + "total_acs": 2048, + "total_submitted": 6458, "total_column_articles": 27, "frontend_question_id": "1917", "is_new_question": false @@ -22545,8 +23196,8 @@ "question__title": "Game of Nim", "question__title_slug": "game-of-nim", "question__hide": false, - "total_acs": 572, - "total_submitted": 916, + "total_acs": 583, + "total_submitted": 930, "total_column_articles": 19, "frontend_question_id": "1908", "is_new_question": false @@ -22566,9 +23217,9 @@ "question__title": "Painting a Grid With Three Different Colors", "question__title_slug": "painting-a-grid-with-three-different-colors", "question__hide": false, - "total_acs": 3169, - "total_submitted": 5362, - "total_column_articles": 90, + "total_acs": 3201, + "total_submitted": 5409, + "total_column_articles": 93, "frontend_question_id": "1931", "is_new_question": false }, @@ -22587,8 +23238,8 @@ "question__title": "Merge BSTs to Create Single BST", "question__title_slug": "merge-bsts-to-create-single-bst", "question__hide": false, - "total_acs": 1973, - "total_submitted": 5947, + "total_acs": 1984, + "total_submitted": 5970, "total_column_articles": 54, "frontend_question_id": "1932", "is_new_question": false @@ -22608,9 +23259,9 @@ "question__title": "Unique Length-3 Palindromic Subsequences", "question__title_slug": "unique-length-3-palindromic-subsequences", "question__hide": false, - "total_acs": 8544, - "total_submitted": 16608, - "total_column_articles": 150, + "total_acs": 8591, + "total_submitted": 16668, + "total_column_articles": 151, "frontend_question_id": "1930", "is_new_question": false }, @@ -22629,9 +23280,9 @@ "question__title": "Concatenation of Array", "question__title_slug": "concatenation-of-array", "question__hide": false, - "total_acs": 37035, - "total_submitted": 42932, - "total_column_articles": 338, + "total_acs": 37370, + "total_submitted": 43324, + "total_column_articles": 339, "frontend_question_id": "1929", "is_new_question": false }, @@ -22650,9 +23301,9 @@ "question__title": "Count Salary Categories", "question__title_slug": "count-salary-categories", "question__hide": false, - "total_acs": 3087, - "total_submitted": 4857, - "total_column_articles": 46, + "total_acs": 3411, + "total_submitted": 5308, + "total_column_articles": 51, "frontend_question_id": "1907", "is_new_question": false }, @@ -22671,8 +23322,8 @@ "question__title": "Jump Game VIII", "question__title_slug": "jump-game-viii", "question__hide": false, - "total_acs": 193, - "total_submitted": 338, + "total_acs": 196, + "total_submitted": 343, "total_column_articles": 13, "frontend_question_id": "2297", "is_new_question": false @@ -22692,8 +23343,8 @@ "question__title": "Describe the Painting", "question__title_slug": "describe-the-painting", "question__hide": false, - "total_acs": 3054, - "total_submitted": 6982, + "total_acs": 3068, + "total_submitted": 7001, "total_column_articles": 75, "frontend_question_id": "1943", "is_new_question": false @@ -22713,9 +23364,9 @@ "question__title": "The Number of the Smallest Unoccupied Chair", "question__title_slug": "the-number-of-the-smallest-unoccupied-chair", "question__hide": false, - "total_acs": 5056, - "total_submitted": 12127, - "total_column_articles": 108, + "total_acs": 5117, + "total_submitted": 12254, + "total_column_articles": 109, "frontend_question_id": "1942", "is_new_question": false }, @@ -22734,9 +23385,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": 12324, - "total_submitted": 16765, - "total_column_articles": 185, + "total_acs": 12426, + "total_submitted": 16901, + "total_column_articles": 187, "frontend_question_id": "1941", "is_new_question": false }, @@ -22755,8 +23406,8 @@ "question__title": "Depth of BST Given Insertion Order", "question__title_slug": "depth-of-bst-given-insertion-order", "question__hide": false, - "total_acs": 420, - "total_submitted": 827, + "total_acs": 424, + "total_submitted": 833, "total_column_articles": 14, "frontend_question_id": "1902", "is_new_question": false @@ -22776,9 +23427,9 @@ "question__title": "Longest Common Subpath", "question__title_slug": "longest-common-subpath", "question__hide": false, - "total_acs": 2635, - "total_submitted": 9878, - "total_column_articles": 48, + "total_acs": 2646, + "total_submitted": 9923, + "total_column_articles": 49, "frontend_question_id": "1923", "is_new_question": false }, @@ -22797,8 +23448,8 @@ "question__title": "Count Good Numbers", "question__title_slug": "count-good-numbers", "question__hide": false, - "total_acs": 6786, - "total_submitted": 18798, + "total_acs": 6814, + "total_submitted": 18871, "total_column_articles": 104, "frontend_question_id": "1922", "is_new_question": false @@ -22818,8 +23469,8 @@ "question__title": "Eliminate Maximum Number of Monsters", "question__title_slug": "eliminate-maximum-number-of-monsters", "question__hide": false, - "total_acs": 8045, - "total_submitted": 21839, + "total_acs": 8089, + "total_submitted": 21954, "total_column_articles": 123, "frontend_question_id": "1921", "is_new_question": false @@ -22839,9 +23490,9 @@ "question__title": "Build Array from Permutation", "question__title_slug": "build-array-from-permutation", "question__hide": false, - "total_acs": 33540, - "total_submitted": 38680, - "total_column_articles": 314, + "total_acs": 33804, + "total_submitted": 38992, + "total_column_articles": 313, "frontend_question_id": "1920", "is_new_question": false }, @@ -22860,8 +23511,8 @@ "question__title": "Find a Peak Element II", "question__title_slug": "find-a-peak-element-ii", "question__hide": false, - "total_acs": 7130, - "total_submitted": 12087, + "total_acs": 7174, + "total_submitted": 12161, "total_column_articles": 129, "frontend_question_id": "1901", "is_new_question": false @@ -22881,8 +23532,8 @@ "question__title": "Page Recommendations II", "question__title_slug": "page-recommendations-ii", "question__hide": false, - "total_acs": 2076, - "total_submitted": 5587, + "total_acs": 2098, + "total_submitted": 5617, "total_column_articles": 33, "frontend_question_id": "1892", "is_new_question": false @@ -22902,8 +23553,8 @@ "question__title": "Cutting Ribbons", "question__title_slug": "cutting-ribbons", "question__hide": false, - "total_acs": 4316, - "total_submitted": 10240, + "total_acs": 4332, + "total_submitted": 10265, "total_column_articles": 49, "frontend_question_id": "1891", "is_new_question": false @@ -22923,8 +23574,8 @@ "question__title": "Number of Wonderful Substrings", "question__title_slug": "number-of-wonderful-substrings", "question__hide": false, - "total_acs": 4511, - "total_submitted": 10224, + "total_acs": 4530, + "total_submitted": 10257, "total_column_articles": 82, "frontend_question_id": "1915", "is_new_question": false @@ -22944,8 +23595,8 @@ "question__title": "Cyclically Rotating a Grid", "question__title_slug": "cyclically-rotating-a-grid", "question__hide": false, - "total_acs": 4245, - "total_submitted": 9160, + "total_acs": 4264, + "total_submitted": 9187, "total_column_articles": 100, "frontend_question_id": "1914", "is_new_question": false @@ -22965,8 +23616,8 @@ "question__title": "Maximum Product Difference Between Two Pairs", "question__title_slug": "maximum-product-difference-between-two-pairs", "question__hide": false, - "total_acs": 19013, - "total_submitted": 23364, + "total_acs": 19173, + "total_submitted": 23571, "total_column_articles": 228, "frontend_question_id": "1913", "is_new_question": false @@ -22986,9 +23637,9 @@ "question__title": "The Latest Login in 2020", "question__title_slug": "the-latest-login-in-2020", "question__hide": false, - "total_acs": 27864, - "total_submitted": 39742, - "total_column_articles": 191, + "total_acs": 28160, + "total_submitted": 40136, + "total_column_articles": 192, "frontend_question_id": "1890", "is_new_question": false }, @@ -23007,9 +23658,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": 5183, - "total_submitted": 11446, - "total_column_articles": 81, + "total_acs": 5241, + "total_submitted": 11532, + "total_column_articles": 82, "frontend_question_id": "1928", "is_new_question": false }, @@ -23028,8 +23679,8 @@ "question__title": "Sum Game", "question__title_slug": "sum-game", "question__hide": false, - "total_acs": 2987, - "total_submitted": 6849, + "total_acs": 3006, + "total_submitted": 6898, "total_column_articles": 67, "frontend_question_id": "1927", "is_new_question": false @@ -23049,9 +23700,9 @@ "question__title": "Nearest Exit from Entrance in Maze", "question__title_slug": "nearest-exit-from-entrance-in-maze", "question__hide": false, - "total_acs": 11581, - "total_submitted": 28848, - "total_column_articles": 174, + "total_acs": 11950, + "total_submitted": 29845, + "total_column_articles": 181, "frontend_question_id": "1926", "is_new_question": false }, @@ -23070,9 +23721,9 @@ "question__title": "Count Square Sum Triples", "question__title_slug": "count-square-sum-triples", "question__hide": false, - "total_acs": 11771, - "total_submitted": 16966, - "total_column_articles": 142, + "total_acs": 11845, + "total_submitted": 17067, + "total_column_articles": 143, "frontend_question_id": "1925", "is_new_question": false }, @@ -23091,8 +23742,8 @@ "question__title": "Count Pairs in Two Arrays", "question__title_slug": "count-pairs-in-two-arrays", "question__hide": false, - "total_acs": 1200, - "total_submitted": 2036, + "total_acs": 1208, + "total_submitted": 2047, "total_column_articles": 29, "frontend_question_id": "1885", "is_new_question": false @@ -23112,9 +23763,9 @@ "question__title": "Count Sub Islands", "question__title_slug": "count-sub-islands", "question__hide": false, - "total_acs": 24985, - "total_submitted": 37172, - "total_column_articles": 411, + "total_acs": 25233, + "total_submitted": 37535, + "total_column_articles": 414, "frontend_question_id": "1905", "is_new_question": false }, @@ -23133,8 +23784,8 @@ "question__title": "Minimum Absolute Difference Queries", "question__title_slug": "minimum-absolute-difference-queries", "question__hide": false, - "total_acs": 3901, - "total_submitted": 8679, + "total_acs": 3920, + "total_submitted": 8732, "total_column_articles": 72, "frontend_question_id": "1906", "is_new_question": false @@ -23154,8 +23805,8 @@ "question__title": "The Number of Full Rounds You Have Played", "question__title_slug": "the-number-of-full-rounds-you-have-played", "question__hide": false, - "total_acs": 5618, - "total_submitted": 17968, + "total_acs": 5645, + "total_submitted": 18033, "total_column_articles": 106, "frontend_question_id": "1904", "is_new_question": false @@ -23175,9 +23826,9 @@ "question__title": "Largest Odd Number in String", "question__title_slug": "largest-odd-number-in-string", "question__hide": false, - "total_acs": 16097, - "total_submitted": 26527, - "total_column_articles": 200, + "total_acs": 16192, + "total_submitted": 26717, + "total_column_articles": 201, "frontend_question_id": "1903", "is_new_question": false }, @@ -23196,9 +23847,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": 7718, - "total_submitted": 10966, - "total_column_articles": 108, + "total_acs": 7801, + "total_submitted": 11090, + "total_column_articles": 109, "frontend_question_id": "1884", "is_new_question": false }, @@ -23217,8 +23868,8 @@ "question__title": "Group Employees of the Same Salary", "question__title_slug": "group-employees-of-the-same-salary", "question__hide": false, - "total_acs": 2241, - "total_submitted": 3497, + "total_acs": 2264, + "total_submitted": 3528, "total_column_articles": 45, "frontend_question_id": "1875", "is_new_question": false @@ -23238,8 +23889,8 @@ "question__title": "Minimize Product Sum of Two Arrays", "question__title_slug": "minimize-product-sum-of-two-arrays", "question__hide": false, - "total_acs": 1063, - "total_submitted": 1231, + "total_acs": 1072, + "total_submitted": 1240, "total_column_articles": 37, "frontend_question_id": "1874", "is_new_question": false @@ -23259,8 +23910,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": 1823, - "total_submitted": 3985, + "total_acs": 1829, + "total_submitted": 3997, "total_column_articles": 46, "frontend_question_id": "1900", "is_new_question": false @@ -23280,8 +23931,8 @@ "question__title": "Maximum Number of Removable Characters", "question__title_slug": "maximum-number-of-removable-characters", "question__hide": false, - "total_acs": 8523, - "total_submitted": 22522, + "total_acs": 8564, + "total_submitted": 22613, "total_column_articles": 118, "frontend_question_id": "1898", "is_new_question": false @@ -23301,8 +23952,8 @@ "question__title": "Merge Triplets to Form Target Triplet", "question__title_slug": "merge-triplets-to-form-target-triplet", "question__hide": false, - "total_acs": 5529, - "total_submitted": 8492, + "total_acs": 5565, + "total_submitted": 8534, "total_column_articles": 83, "frontend_question_id": "1899", "is_new_question": false @@ -23322,8 +23973,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": 10654, - "total_submitted": 19273, + "total_acs": 10705, + "total_submitted": 19362, "total_column_articles": 140, "frontend_question_id": "1897", "is_new_question": false @@ -23343,9 +23994,9 @@ "question__title": "Calculate Special Bonus", "question__title_slug": "calculate-special-bonus", "question__hide": false, - "total_acs": 78457, - "total_submitted": 124810, - "total_column_articles": 381, + "total_acs": 78874, + "total_submitted": 125506, + "total_column_articles": 382, "frontend_question_id": "1873", "is_new_question": false }, @@ -23364,9 +24015,9 @@ "question__title": "Design Movie Rental System", "question__title_slug": "design-movie-rental-system", "question__hide": false, - "total_acs": 4226, - "total_submitted": 17612, - "total_column_articles": 82, + "total_acs": 4244, + "total_submitted": 17661, + "total_column_articles": 83, "frontend_question_id": "1912", "is_new_question": false }, @@ -23385,8 +24036,8 @@ "question__title": "Maximum Alternating Subsequence Sum", "question__title_slug": "maximum-alternating-subsequence-sum", "question__hide": false, - "total_acs": 6293, - "total_submitted": 10667, + "total_acs": 6359, + "total_submitted": 10775, "total_column_articles": 117, "frontend_question_id": "1911", "is_new_question": false @@ -23406,9 +24057,9 @@ "question__title": "Remove All Occurrences of a Substring", "question__title_slug": "remove-all-occurrences-of-a-substring", "question__hide": false, - "total_acs": 6546, - "total_submitted": 9880, - "total_column_articles": 123, + "total_acs": 6611, + "total_submitted": 9961, + "total_column_articles": 122, "frontend_question_id": "1910", "is_new_question": false }, @@ -23427,8 +24078,8 @@ "question__title": "Remove One Element to Make the Array Strictly Increasing", "question__title_slug": "remove-one-element-to-make-the-array-strictly-increasing", "question__hide": false, - "total_acs": 10176, - "total_submitted": 33925, + "total_acs": 10252, + "total_submitted": 34148, "total_column_articles": 169, "frontend_question_id": "1909", "is_new_question": false @@ -23448,8 +24099,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": 2262, - "total_submitted": 4648, + "total_acs": 2273, + "total_submitted": 4664, "total_column_articles": 50, "frontend_question_id": "1868", "is_new_question": false @@ -23469,8 +24120,8 @@ "question__title": "Minimum Space Wasted From Packaging", "question__title_slug": "minimum-space-wasted-from-packaging", "question__hide": false, - "total_acs": 3643, - "total_submitted": 12411, + "total_acs": 3659, + "total_submitted": 12456, "total_column_articles": 67, "frontend_question_id": "1889", "is_new_question": false @@ -23490,8 +24141,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": 4207, - "total_submitted": 11569, + "total_acs": 4225, + "total_submitted": 11613, "total_column_articles": 93, "frontend_question_id": "1888", "is_new_question": false @@ -23511,8 +24162,8 @@ "question__title": "Reduction Operations to Make the Array Elements Equal", "question__title_slug": "reduction-operations-to-make-the-array-elements-equal", "question__hide": false, - "total_acs": 7826, - "total_submitted": 11911, + "total_acs": 7857, + "total_submitted": 11979, "total_column_articles": 111, "frontend_question_id": "1887", "is_new_question": false @@ -23532,9 +24183,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": 10971, - "total_submitted": 18498, - "total_column_articles": 169, + "total_acs": 11022, + "total_submitted": 18595, + "total_column_articles": 170, "frontend_question_id": "1886", "is_new_question": false }, @@ -23553,8 +24204,8 @@ "question__title": "Orders With Maximum Quantity Above Average", "question__title_slug": "orders-with-maximum-quantity-above-average", "question__hide": false, - "total_acs": 4836, - "total_submitted": 7098, + "total_acs": 4870, + "total_submitted": 7149, "total_column_articles": 56, "frontend_question_id": "1867", "is_new_question": false @@ -23574,9 +24225,9 @@ "question__title": "Minimum Skips to Arrive at Meeting On Time", "question__title_slug": "minimum-skips-to-arrive-at-meeting-on-time", "question__hide": false, - "total_acs": 2450, - "total_submitted": 6116, - "total_column_articles": 38, + "total_acs": 2454, + "total_submitted": 6124, + "total_column_articles": 39, "frontend_question_id": "1883", "is_new_question": false }, @@ -23595,8 +24246,8 @@ "question__title": "Process Tasks Using Servers", "question__title_slug": "process-tasks-using-servers", "question__hide": false, - "total_acs": 5484, - "total_submitted": 17938, + "total_acs": 5524, + "total_submitted": 18025, "total_column_articles": 146, "frontend_question_id": "1882", "is_new_question": false @@ -23616,8 +24267,8 @@ "question__title": "Maximum Value after Insertion", "question__title_slug": "maximum-value-after-insertion", "question__hide": false, - "total_acs": 8933, - "total_submitted": 23749, + "total_acs": 8969, + "total_submitted": 23826, "total_column_articles": 95, "frontend_question_id": "1881", "is_new_question": false @@ -23637,9 +24288,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": 12543, - "total_submitted": 16420, - "total_column_articles": 206, + "total_acs": 12613, + "total_submitted": 16512, + "total_column_articles": 210, "frontend_question_id": "1880", "is_new_question": false }, @@ -23658,8 +24309,8 @@ "question__title": "Longest Word With All Prefixes", "question__title_slug": "longest-word-with-all-prefixes", "question__hide": false, - "total_acs": 1088, - "total_submitted": 1646, + "total_acs": 1094, + "total_submitted": 1657, "total_column_articles": 45, "frontend_question_id": "1858", "is_new_question": false @@ -23679,8 +24330,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": 1323, - "total_submitted": 2489, + "total_acs": 1338, + "total_submitted": 2507, "total_column_articles": 37, "frontend_question_id": "1896", "is_new_question": false @@ -23700,8 +24351,8 @@ "question__title": "Maximum Cost of Trip With K Highways", "question__title_slug": "maximum-cost-of-trip-with-k-highways", "question__hide": false, - "total_acs": 269, - "total_submitted": 468, + "total_acs": 271, + "total_submitted": 471, "total_column_articles": 14, "frontend_question_id": "2247", "is_new_question": false @@ -23721,8 +24372,8 @@ "question__title": "Find the Student that Will Replace the Chalk", "question__title_slug": "find-the-student-that-will-replace-the-chalk", "question__hide": false, - "total_acs": 47917, - "total_submitted": 104525, + "total_acs": 47996, + "total_submitted": 104683, "total_column_articles": 619, "frontend_question_id": "1894", "is_new_question": false @@ -23742,8 +24393,8 @@ "question__title": "Check if All the Integers in a Range Are Covered", "question__title_slug": "check-if-all-the-integers-in-a-range-are-covered", "question__hide": false, - "total_acs": 39100, - "total_submitted": 66424, + "total_acs": 39178, + "total_submitted": 66552, "total_column_articles": 526, "frontend_question_id": "1893", "is_new_question": false @@ -23763,8 +24414,8 @@ "question__title": "Convert Date Format", "question__title_slug": "convert-date-format", "question__hide": false, - "total_acs": 3273, - "total_submitted": 5220, + "total_acs": 3306, + "total_submitted": 5264, "total_column_articles": 31, "frontend_question_id": "1853", "is_new_question": false @@ -23784,8 +24435,8 @@ "question__title": "Distinct Numbers in Each Subarray", "question__title_slug": "distinct-numbers-in-each-subarray", "question__hide": false, - "total_acs": 811, - "total_submitted": 1380, + "total_acs": 820, + "total_submitted": 1390, "total_column_articles": 21, "frontend_question_id": "1852", "is_new_question": false @@ -23805,8 +24456,8 @@ "question__title": "Stone Game VIII", "question__title_slug": "stone-game-viii", "question__hide": false, - "total_acs": 3310, - "total_submitted": 5403, + "total_acs": 3318, + "total_submitted": 5414, "total_column_articles": 45, "frontend_question_id": "1872", "is_new_question": false @@ -23826,9 +24477,9 @@ "question__title": "Jump Game VII", "question__title_slug": "jump-game-vii", "question__hide": false, - "total_acs": 9049, - "total_submitted": 32011, - "total_column_articles": 176, + "total_acs": 9084, + "total_submitted": 32126, + "total_column_articles": 177, "frontend_question_id": "1871", "is_new_question": false }, @@ -23847,8 +24498,8 @@ "question__title": "Minimum Speed to Arrive on Time", "question__title_slug": "minimum-speed-to-arrive-on-time", "question__hide": false, - "total_acs": 13064, - "total_submitted": 30938, + "total_acs": 13107, + "total_submitted": 31041, "total_column_articles": 139, "frontend_question_id": "1870", "is_new_question": false @@ -23868,9 +24519,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": 18315, - "total_submitted": 25855, - "total_column_articles": 256, + "total_acs": 18373, + "total_submitted": 25953, + "total_column_articles": 257, "frontend_question_id": "1869", "is_new_question": false }, @@ -23889,8 +24540,8 @@ "question__title": "Suspicious Bank Accounts", "question__title_slug": "suspicious-bank-accounts", "question__hide": false, - "total_acs": 2662, - "total_submitted": 6097, + "total_acs": 2692, + "total_submitted": 6138, "total_column_articles": 46, "frontend_question_id": "1843", "is_new_question": false @@ -23910,8 +24561,8 @@ "question__title": "Next Palindrome Using Same Digits", "question__title_slug": "next-palindrome-using-same-digits", "question__hide": false, - "total_acs": 362, - "total_submitted": 648, + "total_acs": 368, + "total_submitted": 660, "total_column_articles": 19, "frontend_question_id": "1842", "is_new_question": false @@ -23931,8 +24582,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": 3673, - "total_submitted": 5943, + "total_acs": 3702, + "total_submitted": 5987, "total_column_articles": 72, "frontend_question_id": "1866", "is_new_question": false @@ -23952,8 +24603,8 @@ "question__title": "Finding Pairs With a Certain Sum", "question__title_slug": "finding-pairs-with-a-certain-sum", "question__hide": false, - "total_acs": 7190, - "total_submitted": 14120, + "total_acs": 7207, + "total_submitted": 14150, "total_column_articles": 86, "frontend_question_id": "1865", "is_new_question": false @@ -23973,8 +24624,8 @@ "question__title": "Minimum Number of Swaps to Make the Binary String Alternating", "question__title_slug": "minimum-number-of-swaps-to-make-the-binary-string-alternating", "question__hide": false, - "total_acs": 6931, - "total_submitted": 17000, + "total_acs": 6979, + "total_submitted": 17112, "total_column_articles": 156, "frontend_question_id": "1864", "is_new_question": false @@ -23994,9 +24645,9 @@ "question__title": "Sum of All Subset XOR Totals", "question__title_slug": "sum-of-all-subset-xor-totals", "question__hide": false, - "total_acs": 21411, - "total_submitted": 25426, - "total_column_articles": 266, + "total_acs": 21490, + "total_submitted": 25529, + "total_column_articles": 267, "frontend_question_id": "1863", "is_new_question": false }, @@ -24015,8 +24666,8 @@ "question__title": "Sort Linked List Already Sorted Using Absolute Values", "question__title_slug": "sort-linked-list-already-sorted-using-absolute-values", "question__hide": false, - "total_acs": 735, - "total_submitted": 1157, + "total_acs": 745, + "total_submitted": 1171, "total_column_articles": 32, "frontend_question_id": "2046", "is_new_question": false @@ -24036,8 +24687,8 @@ "question__title": "League Statistics", "question__title_slug": "league-statistics", "question__hide": false, - "total_acs": 2756, - "total_submitted": 5231, + "total_acs": 2776, + "total_submitted": 5265, "total_column_articles": 63, "frontend_question_id": "1841", "is_new_question": false @@ -24057,9 +24708,9 @@ "question__title": "Get Biggest Three Rhombus Sums in a Grid", "question__title_slug": "get-biggest-three-rhombus-sums-in-a-grid", "question__hide": false, - "total_acs": 3057, - "total_submitted": 6721, - "total_column_articles": 74, + "total_acs": 3071, + "total_submitted": 6757, + "total_column_articles": 75, "frontend_question_id": "1878", "is_new_question": false }, @@ -24078,8 +24729,8 @@ "question__title": "Minimum XOR Sum of Two Arrays", "question__title_slug": "minimum-xor-sum-of-two-arrays", "question__hide": false, - "total_acs": 3570, - "total_submitted": 7366, + "total_acs": 3589, + "total_submitted": 7390, "total_column_articles": 64, "frontend_question_id": "1879", "is_new_question": false @@ -24099,9 +24750,9 @@ "question__title": "Minimize Maximum Pair Sum in Array", "question__title_slug": "minimize-maximum-pair-sum-in-array", "question__hide": false, - "total_acs": 37837, - "total_submitted": 46638, - "total_column_articles": 479, + "total_acs": 37932, + "total_submitted": 46759, + "total_column_articles": 483, "frontend_question_id": "1877", "is_new_question": false }, @@ -24120,9 +24771,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": 15654, - "total_submitted": 22156, - "total_column_articles": 250, + "total_acs": 15801, + "total_submitted": 22374, + "total_column_articles": 252, "frontend_question_id": "1876", "is_new_question": false }, @@ -24141,9 +24792,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": 4022, - "total_submitted": 8253, - "total_column_articles": 64, + "total_acs": 4082, + "total_submitted": 8351, + "total_column_articles": 65, "frontend_question_id": "1857", "is_new_question": false }, @@ -24162,8 +24813,8 @@ "question__title": "Maximum Subarray Min-Product", "question__title_slug": "maximum-subarray-min-product", "question__hide": false, - "total_acs": 9134, - "total_submitted": 24533, + "total_acs": 9213, + "total_submitted": 24713, "total_column_articles": 143, "frontend_question_id": "1856", "is_new_question": false @@ -24183,9 +24834,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": 21041, - "total_submitted": 35251, - "total_column_articles": 234, + "total_acs": 21089, + "total_submitted": 35348, + "total_column_articles": 235, "frontend_question_id": "1855", "is_new_question": false }, @@ -24204,9 +24855,9 @@ "question__title": "Maximum Population Year", "question__title_slug": "maximum-population-year", "question__hide": false, - "total_acs": 17422, - "total_submitted": 24030, - "total_column_articles": 217, + "total_acs": 17517, + "total_submitted": 24176, + "total_column_articles": 219, "frontend_question_id": "1854", "is_new_question": false }, @@ -24225,8 +24876,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": 1946, - "total_submitted": 2659, + "total_acs": 1966, + "total_submitted": 2697, "total_column_articles": 60, "frontend_question_id": "1836", "is_new_question": false @@ -24246,8 +24897,8 @@ "question__title": "Maximum Transaction Each Day", "question__title_slug": "maximum-transaction-each-day", "question__hide": false, - "total_acs": 4535, - "total_submitted": 5802, + "total_acs": 4615, + "total_submitted": 5896, "total_column_articles": 64, "frontend_question_id": "1831", "is_new_question": false @@ -24267,8 +24918,8 @@ "question__title": "Faulty Sensor", "question__title_slug": "faulty-sensor", "question__hide": false, - "total_acs": 807, - "total_submitted": 1958, + "total_acs": 831, + "total_submitted": 1988, "total_column_articles": 39, "frontend_question_id": "1826", "is_new_question": false @@ -24288,8 +24939,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": 278, - "total_submitted": 503, + "total_acs": 285, + "total_submitted": 523, "total_column_articles": 14, "frontend_question_id": "1989", "is_new_question": false @@ -24309,8 +24960,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": 3523, - "total_submitted": 5624, + "total_acs": 3532, + "total_submitted": 5637, "total_column_articles": 67, "frontend_question_id": "1850", "is_new_question": false @@ -24330,8 +24981,8 @@ "question__title": "Minimum Interval to Include Each Query", "question__title_slug": "minimum-interval-to-include-each-query", "question__hide": false, - "total_acs": 3473, - "total_submitted": 7904, + "total_acs": 3492, + "total_submitted": 7946, "total_column_articles": 79, "frontend_question_id": "1851", "is_new_question": false @@ -24351,8 +25002,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": 7391, - "total_submitted": 22317, + "total_acs": 7418, + "total_submitted": 22386, "total_column_articles": 138, "frontend_question_id": "1849", "is_new_question": false @@ -24372,9 +25023,9 @@ "question__title": "Minimum Distance to the Target Element", "question__title_slug": "minimum-distance-to-the-target-element", "question__hide": false, - "total_acs": 13425, - "total_submitted": 20193, - "total_column_articles": 180, + "total_acs": 13550, + "total_submitted": 20394, + "total_column_articles": 181, "frontend_question_id": "1848", "is_new_question": false }, @@ -24393,8 +25044,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": 5816, - "total_submitted": 6528, + "total_acs": 6052, + "total_submitted": 6813, "total_column_articles": 42, "frontend_question_id": "1821", "is_new_question": false @@ -24414,8 +25065,8 @@ "question__title": "Rotating the Box", "question__title_slug": "rotating-the-box", "question__hide": false, - "total_acs": 5616, - "total_submitted": 8899, + "total_acs": 5646, + "total_submitted": 8948, "total_column_articles": 108, "frontend_question_id": "1861", "is_new_question": false @@ -24435,8 +25086,8 @@ "question__title": "Incremental Memory Leak", "question__title_slug": "incremental-memory-leak", "question__hide": false, - "total_acs": 6494, - "total_submitted": 8538, + "total_acs": 6533, + "total_submitted": 8592, "total_column_articles": 125, "frontend_question_id": "1860", "is_new_question": false @@ -24456,9 +25107,9 @@ "question__title": "Sorting the Sentence", "question__title_slug": "sorting-the-sentence", "question__hide": false, - "total_acs": 15105, - "total_submitted": 20741, - "total_column_articles": 315, + "total_acs": 15207, + "total_submitted": 20875, + "total_column_articles": 318, "frontend_question_id": "1859", "is_new_question": false }, @@ -24477,8 +25128,8 @@ "question__title": "Maximum Number of Accepted Invitations", "question__title_slug": "maximum-number-of-accepted-invitations", "question__hide": false, - "total_acs": 375, - "total_submitted": 795, + "total_acs": 380, + "total_submitted": 802, "total_column_articles": 17, "frontend_question_id": "1820", "is_new_question": false @@ -24498,8 +25149,8 @@ "question__title": "Maximum Building Height", "question__title_slug": "maximum-building-height", "question__hide": false, - "total_acs": 2856, - "total_submitted": 7239, + "total_acs": 2871, + "total_submitted": 7274, "total_column_articles": 63, "frontend_question_id": "1840", "is_new_question": false @@ -24519,9 +25170,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": 11726, - "total_submitted": 23641, - "total_column_articles": 206, + "total_acs": 11833, + "total_submitted": 23926, + "total_column_articles": 207, "frontend_question_id": "1839", "is_new_question": false }, @@ -24540,8 +25191,8 @@ "question__title": "Frequency of the Most Frequent Element", "question__title_slug": "frequency-of-the-most-frequent-element", "question__hide": false, - "total_acs": 36416, - "total_submitted": 84670, + "total_acs": 36471, + "total_submitted": 84786, "total_column_articles": 381, "frontend_question_id": "1838", "is_new_question": false @@ -24561,9 +25212,9 @@ "question__title": "Sum of Digits in Base K", "question__title_slug": "sum-of-digits-in-base-k", "question__hide": false, - "total_acs": 14918, - "total_submitted": 18796, - "total_column_articles": 169, + "total_acs": 15008, + "total_submitted": 18912, + "total_column_articles": 171, "frontend_question_id": "1837", "is_new_question": false }, @@ -24582,8 +25233,8 @@ "question__title": "Find Interview Candidates", "question__title_slug": "find-interview-candidates", "question__hide": false, - "total_acs": 3104, - "total_submitted": 4859, + "total_acs": 3126, + "total_submitted": 4886, "total_column_articles": 53, "frontend_question_id": "1811", "is_new_question": false @@ -24603,8 +25254,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": 5048, - "total_submitted": 9059, + "total_acs": 5063, + "total_submitted": 9088, "total_column_articles": 77, "frontend_question_id": "1835", "is_new_question": false @@ -24624,9 +25275,9 @@ "question__title": "Single-Threaded CPU", "question__title_slug": "single-threaded-cpu", "question__hide": false, - "total_acs": 9972, - "total_submitted": 26482, - "total_column_articles": 176, + "total_acs": 10119, + "total_submitted": 26763, + "total_column_articles": 178, "frontend_question_id": "1834", "is_new_question": false }, @@ -24645,9 +25296,9 @@ "question__title": "Maximum Ice Cream Bars", "question__title_slug": "maximum-ice-cream-bars", "question__hide": false, - "total_acs": 48981, - "total_submitted": 71956, - "total_column_articles": 463, + "total_acs": 49052, + "total_submitted": 72054, + "total_column_articles": 464, "frontend_question_id": "1833", "is_new_question": false }, @@ -24666,9 +25317,9 @@ "question__title": "Check if the Sentence Is Pangram", "question__title_slug": "check-if-the-sentence-is-pangram", "question__hide": false, - "total_acs": 50294, - "total_submitted": 59201, - "total_column_articles": 601, + "total_acs": 50461, + "total_submitted": 59425, + "total_column_articles": 607, "frontend_question_id": "1832", "is_new_question": false }, @@ -24687,8 +25338,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": 381, - "total_submitted": 609, + "total_acs": 384, + "total_submitted": 613, "total_column_articles": 10, "frontend_question_id": "1810", "is_new_question": false @@ -24708,8 +25359,8 @@ "question__title": "Ad-Free Sessions", "question__title_slug": "ad-free-sessions", "question__hide": false, - "total_acs": 4436, - "total_submitted": 7286, + "total_acs": 4465, + "total_submitted": 7332, "total_column_articles": 50, "frontend_question_id": "1809", "is_new_question": false @@ -24729,9 +25380,9 @@ "question__title": "Closest Room", "question__title_slug": "closest-room", "question__hide": false, - "total_acs": 3851, - "total_submitted": 9681, - "total_column_articles": 71, + "total_acs": 3876, + "total_submitted": 9731, + "total_column_articles": 73, "frontend_question_id": "1847", "is_new_question": false }, @@ -24750,8 +25401,8 @@ "question__title": "Maximum Element After Decreasing and Rearranging", "question__title_slug": "maximum-element-after-decreasing-and-rearranging", "question__hide": false, - "total_acs": 30882, - "total_submitted": 48982, + "total_acs": 30909, + "total_submitted": 49028, "total_column_articles": 415, "frontend_question_id": "1846", "is_new_question": false @@ -24771,8 +25422,8 @@ "question__title": "Seat Reservation Manager", "question__title_slug": "seat-reservation-manager", "question__hide": false, - "total_acs": 15156, - "total_submitted": 31424, + "total_acs": 15235, + "total_submitted": 31608, "total_column_articles": 163, "frontend_question_id": "1845", "is_new_question": false @@ -24792,9 +25443,9 @@ "question__title": "Replace All Digits with Characters", "question__title_slug": "replace-all-digits-with-characters", "question__hide": false, - "total_acs": 13013, - "total_submitted": 16572, - "total_column_articles": 210, + "total_acs": 13101, + "total_submitted": 16681, + "total_column_articles": 212, "frontend_question_id": "1844", "is_new_question": false }, @@ -24813,8 +25464,8 @@ "question__title": "Finding MK Average", "question__title_slug": "finding-mk-average", "question__hide": false, - "total_acs": 13562, - "total_submitted": 31257, + "total_acs": 13575, + "total_submitted": 31282, "total_column_articles": 191, "frontend_question_id": "1825", "is_new_question": false @@ -24834,9 +25485,9 @@ "question__title": "Minimum Sideway Jumps", "question__title_slug": "minimum-sideway-jumps", "question__hide": false, - "total_acs": 22938, - "total_submitted": 33520, - "total_column_articles": 329, + "total_acs": 23024, + "total_submitted": 33672, + "total_column_articles": 330, "frontend_question_id": "1824", "is_new_question": false }, @@ -24855,8 +25506,8 @@ "question__title": "Find the Winner of the Circular Game", "question__title_slug": "find-the-winner-of-the-circular-game", "question__hide": false, - "total_acs": 53318, - "total_submitted": 67815, + "total_acs": 53443, + "total_submitted": 67994, "total_column_articles": 577, "frontend_question_id": "1823", "is_new_question": false @@ -24876,9 +25527,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": 74019, - "total_submitted": 103143, - "total_column_articles": 726, + "total_acs": 74142, + "total_submitted": 103315, + "total_column_articles": 727, "frontend_question_id": "1822", "is_new_question": false }, @@ -24897,8 +25548,8 @@ "question__title": "Implement Trie II (Prefix Tree)", "question__title_slug": "implement-trie-ii-prefix-tree", "question__hide": false, - "total_acs": 2248, - "total_submitted": 3928, + "total_acs": 2268, + "total_submitted": 3957, "total_column_articles": 60, "frontend_question_id": "1804", "is_new_question": false @@ -24918,8 +25569,8 @@ "question__title": "Rearrange Products Table", "question__title_slug": "rearrange-products-table", "question__hide": false, - "total_acs": 39380, - "total_submitted": 50314, + "total_acs": 39651, + "total_submitted": 50655, "total_column_articles": 174, "frontend_question_id": "1795", "is_new_question": false @@ -24939,8 +25590,8 @@ "question__title": "Number of Different Subsequences GCDs", "question__title_slug": "number-of-different-subsequences-gcds", "question__hide": false, - "total_acs": 15905, - "total_submitted": 25111, + "total_acs": 15922, + "total_submitted": 25143, "total_column_articles": 108, "frontend_question_id": "1819", "is_new_question": false @@ -24960,8 +25611,8 @@ "question__title": "Minimum Absolute Sum Difference", "question__title_slug": "minimum-absolute-sum-difference", "question__hide": false, - "total_acs": 31379, - "total_submitted": 83462, + "total_acs": 31419, + "total_submitted": 83589, "total_column_articles": 391, "frontend_question_id": "1818", "is_new_question": false @@ -24981,8 +25632,8 @@ "question__title": "Finding the Users Active Minutes", "question__title_slug": "finding-the-users-active-minutes", "question__hide": false, - "total_acs": 24204, - "total_submitted": 30403, + "total_acs": 24265, + "total_submitted": 30534, "total_column_articles": 313, "frontend_question_id": "1817", "is_new_question": false @@ -25002,9 +25653,9 @@ "question__title": "Truncate Sentence", "question__title_slug": "truncate-sentence", "question__hide": false, - "total_acs": 54565, - "total_submitted": 75334, - "total_column_articles": 733, + "total_acs": 54649, + "total_submitted": 75447, + "total_column_articles": 735, "frontend_question_id": "1816", "is_new_question": false }, @@ -25023,8 +25674,8 @@ "question__title": "Count Pairs of Equal Substrings With Minimum Difference", "question__title_slug": "count-pairs-of-equal-substrings-with-minimum-difference", "question__hide": false, - "total_acs": 369, - "total_submitted": 670, + "total_acs": 373, + "total_submitted": 675, "total_column_articles": 13, "frontend_question_id": "1794", "is_new_question": false @@ -25044,9 +25695,9 @@ "question__title": "Primary Department for Each Employee", "question__title_slug": "primary-department-for-each-employee", "question__hide": false, - "total_acs": 5114, - "total_submitted": 7126, - "total_column_articles": 69, + "total_acs": 5558, + "total_submitted": 7712, + "total_column_articles": 71, "frontend_question_id": "1789", "is_new_question": false }, @@ -25065,8 +25716,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": 1452, - "total_submitted": 2739, + "total_acs": 1456, + "total_submitted": 2746, "total_column_articles": 30, "frontend_question_id": "1830", "is_new_question": false @@ -25086,8 +25737,8 @@ "question__title": "Maximum XOR for Each Query", "question__title_slug": "maximum-xor-for-each-query", "question__hide": false, - "total_acs": 6181, - "total_submitted": 8595, + "total_acs": 6212, + "total_submitted": 8636, "total_column_articles": 116, "frontend_question_id": "1829", "is_new_question": false @@ -25107,9 +25758,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": 29017, - "total_submitted": 32621, - "total_column_articles": 319, + "total_acs": 29251, + "total_submitted": 32936, + "total_column_articles": 320, "frontend_question_id": "1828", "is_new_question": false }, @@ -25128,9 +25779,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": 38380, - "total_submitted": 47075, - "total_column_articles": 413, + "total_acs": 38493, + "total_submitted": 47245, + "total_column_articles": 417, "frontend_question_id": "1827", "is_new_question": false }, @@ -25149,8 +25800,8 @@ "question__title": "Maximize the Beauty of the Garden", "question__title_slug": "maximize-the-beauty-of-the-garden", "question__hide": false, - "total_acs": 649, - "total_submitted": 993, + "total_acs": 655, + "total_submitted": 1001, "total_column_articles": 32, "frontend_question_id": "1788", "is_new_question": false @@ -25170,8 +25821,8 @@ "question__title": "Maximize Number of Nice Divisors", "question__title_slug": "maximize-number-of-nice-divisors", "question__hide": false, - "total_acs": 3284, - "total_submitted": 11527, + "total_acs": 3297, + "total_submitted": 11549, "total_column_articles": 61, "frontend_question_id": "1808", "is_new_question": false @@ -25191,8 +25842,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": 25702, - "total_submitted": 33504, + "total_acs": 25755, + "total_submitted": 33575, "total_column_articles": 304, "frontend_question_id": "1806", "is_new_question": false @@ -25212,9 +25863,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": 30962, - "total_submitted": 45824, - "total_column_articles": 435, + "total_acs": 31003, + "total_submitted": 45890, + "total_column_articles": 434, "frontend_question_id": "1807", "is_new_question": false }, @@ -25233,9 +25884,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": 39122, - "total_submitted": 90436, - "total_column_articles": 548, + "total_acs": 39206, + "total_submitted": 90661, + "total_column_articles": 549, "frontend_question_id": "1805", "is_new_question": false }, @@ -25254,8 +25905,8 @@ "question__title": "Grand Slam Titles", "question__title_slug": "grand-slam-titles", "question__hide": false, - "total_acs": 5980, - "total_submitted": 7428, + "total_acs": 6066, + "total_submitted": 7527, "total_column_articles": 83, "frontend_question_id": "1783", "is_new_question": false @@ -25275,8 +25926,8 @@ "question__title": "Shortest Path in a Hidden Grid", "question__title_slug": "shortest-path-in-a-hidden-grid", "question__hide": false, - "total_acs": 435, - "total_submitted": 904, + "total_acs": 440, + "total_submitted": 915, "total_column_articles": 16, "frontend_question_id": "1778", "is_new_question": false @@ -25296,8 +25947,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": 22775, - "total_submitted": 32052, + "total_acs": 22823, + "total_submitted": 32126, "total_column_articles": 241, "frontend_question_id": "1798", "is_new_question": false @@ -25317,8 +25968,8 @@ "question__title": "Maximum Value at a Given Index in a Bounded Array", "question__title_slug": "maximum-value-at-a-given-index-in-a-bounded-array", "question__hide": false, - "total_acs": 24836, - "total_submitted": 65269, + "total_acs": 24879, + "total_submitted": 65374, "total_column_articles": 382, "frontend_question_id": "1802", "is_new_question": false @@ -25338,9 +25989,9 @@ "question__title": "Number of Orders in the Backlog", "question__title_slug": "number-of-orders-in-the-backlog", "question__hide": false, - "total_acs": 20559, - "total_submitted": 38614, - "total_column_articles": 300, + "total_acs": 20593, + "total_submitted": 38673, + "total_column_articles": 299, "frontend_question_id": "1801", "is_new_question": false }, @@ -25359,9 +26010,9 @@ "question__title": "Maximum Ascending Subarray Sum", "question__title_slug": "maximum-ascending-subarray-sum", "question__hide": false, - "total_acs": 43723, - "total_submitted": 63597, - "total_column_articles": 637, + "total_acs": 43784, + "total_submitted": 63689, + "total_column_articles": 638, "frontend_question_id": "1800", "is_new_question": false }, @@ -25380,8 +26031,8 @@ "question__title": "Product's Price for Each Store", "question__title_slug": "products-price-for-each-store", "question__hide": false, - "total_acs": 8536, - "total_submitted": 10888, + "total_acs": 8577, + "total_submitted": 10944, "total_column_articles": 85, "frontend_question_id": "1777", "is_new_question": false @@ -25401,9 +26052,9 @@ "question__title": "Count Nice Pairs in an Array", "question__title_slug": "count-nice-pairs-in-an-array", "question__hide": false, - "total_acs": 25282, - "total_submitted": 53633, - "total_column_articles": 316, + "total_acs": 25313, + "total_submitted": 53699, + "total_column_articles": 315, "frontend_question_id": "1814", "is_new_question": false }, @@ -25422,8 +26073,8 @@ "question__title": "Maximum Number of Groups Getting Fresh Donuts", "question__title_slug": "maximum-number-of-groups-getting-fresh-donuts", "question__hide": false, - "total_acs": 11024, - "total_submitted": 20626, + "total_acs": 11037, + "total_submitted": 20647, "total_column_articles": 94, "frontend_question_id": "1815", "is_new_question": false @@ -25443,9 +26094,9 @@ "question__title": "Sentence Similarity III", "question__title_slug": "sentence-similarity-iii", "question__hide": false, - "total_acs": 25282, - "total_submitted": 60668, - "total_column_articles": 332, + "total_acs": 25309, + "total_submitted": 60756, + "total_column_articles": 333, "frontend_question_id": "1813", "is_new_question": false }, @@ -25464,8 +26115,8 @@ "question__title": "Determine Color of a Chessboard Square", "question__title_slug": "determine-color-of-a-chessboard-square", "question__hide": false, - "total_acs": 41369, - "total_submitted": 50495, + "total_acs": 41485, + "total_submitted": 50666, "total_column_articles": 693, "frontend_question_id": "1812", "is_new_question": false @@ -25485,8 +26136,8 @@ "question__title": "Sort Features by Popularity", "question__title_slug": "sort-features-by-popularity", "question__hide": false, - "total_acs": 785, - "total_submitted": 1663, + "total_acs": 791, + "total_submitted": 1670, "total_column_articles": 21, "frontend_question_id": "1772", "is_new_question": false @@ -25506,8 +26157,8 @@ "question__title": "Maximum Score of a Good Subarray", "question__title_slug": "maximum-score-of-a-good-subarray", "question__hide": false, - "total_acs": 5793, - "total_submitted": 12782, + "total_acs": 5840, + "total_submitted": 12867, "total_column_articles": 126, "frontend_question_id": "1793", "is_new_question": false @@ -25527,8 +26178,8 @@ "question__title": "Maximum Average Pass Ratio", "question__title_slug": "maximum-average-pass-ratio", "question__hide": false, - "total_acs": 24183, - "total_submitted": 41124, + "total_acs": 24223, + "total_submitted": 41183, "total_column_articles": 255, "frontend_question_id": "1792", "is_new_question": false @@ -25548,9 +26199,9 @@ "question__title": "Find Center of Star Graph", "question__title_slug": "find-center-of-star-graph", "question__hide": false, - "total_acs": 55466, - "total_submitted": 66725, - "total_column_articles": 503, + "total_acs": 55611, + "total_submitted": 66904, + "total_column_articles": 506, "frontend_question_id": "1791", "is_new_question": false }, @@ -25569,9 +26220,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": 64601, - "total_submitted": 122955, - "total_column_articles": 860, + "total_acs": 64717, + "total_submitted": 123175, + "total_column_articles": 864, "frontend_question_id": "1790", "is_new_question": false }, @@ -25590,9 +26241,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": 3447, - "total_submitted": 4302, - "total_column_articles": 59, + "total_acs": 3508, + "total_submitted": 4368, + "total_column_articles": 60, "frontend_question_id": "1767", "is_new_question": false }, @@ -25611,8 +26262,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": 12724, - "total_submitted": 19769, + "total_acs": 12734, + "total_submitted": 19790, "total_column_articles": 67, "frontend_question_id": "1787", "is_new_question": false @@ -25632,9 +26283,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": 5646, - "total_submitted": 15595, - "total_column_articles": 130, + "total_acs": 5707, + "total_submitted": 15748, + "total_column_articles": 132, "frontend_question_id": "1786", "is_new_question": false }, @@ -25653,8 +26304,8 @@ "question__title": "Minimum Elements to Add to Form a Given Sum", "question__title_slug": "minimum-elements-to-add-to-form-a-given-sum", "question__hide": false, - "total_acs": 27015, - "total_submitted": 62058, + "total_acs": 27053, + "total_submitted": 62135, "total_column_articles": 291, "frontend_question_id": "1785", "is_new_question": false @@ -25674,9 +26325,9 @@ "question__title": "Check if Binary String Has at Most One Segment of Ones", "question__title_slug": "check-if-binary-string-has-at-most-one-segment-of-ones", "question__hide": false, - "total_acs": 39441, - "total_submitted": 66301, - "total_column_articles": 538, + "total_acs": 39489, + "total_submitted": 66396, + "total_column_articles": 539, "frontend_question_id": "1784", "is_new_question": false }, @@ -25695,8 +26346,8 @@ "question__title": "Buildings With an Ocean View", "question__title_slug": "buildings-with-an-ocean-view", "question__hide": false, - "total_acs": 2712, - "total_submitted": 3798, + "total_acs": 2722, + "total_submitted": 3809, "total_column_articles": 46, "frontend_question_id": "1762", "is_new_question": false @@ -25716,9 +26367,9 @@ "question__title": "Recyclable and Low Fat Products", "question__title_slug": "recyclable-and-low-fat-products", "question__hide": false, - "total_acs": 115624, - "total_submitted": 131761, - "total_column_articles": 263, + "total_acs": 117102, + "total_submitted": 133415, + "total_column_articles": 267, "frontend_question_id": "1757", "is_new_question": false }, @@ -25737,8 +26388,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": 16038, - "total_submitted": 28470, + "total_acs": 16049, + "total_submitted": 28494, "total_column_articles": 157, "frontend_question_id": "1803", "is_new_question": false @@ -25758,8 +26409,8 @@ "question__title": "Maximize Score After N Operations", "question__title_slug": "maximize-score-after-n-operations", "question__hide": false, - "total_acs": 13591, - "total_submitted": 20686, + "total_acs": 13668, + "total_submitted": 20806, "total_column_articles": 162, "frontend_question_id": "1799", "is_new_question": false @@ -25779,9 +26430,9 @@ "question__title": "Design Authentication Manager", "question__title_slug": "design-authentication-manager", "question__hide": false, - "total_acs": 32218, - "total_submitted": 49528, - "total_column_articles": 344, + "total_acs": 32282, + "total_submitted": 49645, + "total_column_articles": 347, "frontend_question_id": "1797", "is_new_question": false }, @@ -25800,8 +26451,8 @@ "question__title": "Second Largest Digit in a String", "question__title_slug": "second-largest-digit-in-a-string", "question__hide": false, - "total_acs": 36427, - "total_submitted": 66306, + "total_acs": 36485, + "total_submitted": 66413, "total_column_articles": 456, "frontend_question_id": "1796", "is_new_question": false @@ -25821,9 +26472,9 @@ "question__title": "Design Most Recently Used Queue", "question__title_slug": "design-most-recently-used-queue", "question__hide": false, - "total_acs": 1373, - "total_submitted": 1678, - "total_column_articles": 32, + "total_acs": 1392, + "total_submitted": 1698, + "total_column_articles": 34, "frontend_question_id": "1756", "is_new_question": false }, @@ -25842,8 +26493,8 @@ "question__title": "Car Fleet II", "question__title_slug": "car-fleet-ii", "question__hide": false, - "total_acs": 3002, - "total_submitted": 6182, + "total_acs": 3019, + "total_submitted": 6208, "total_column_articles": 66, "frontend_question_id": "1776", "is_new_question": false @@ -25863,8 +26514,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": 24734, - "total_submitted": 43815, + "total_acs": 24821, + "total_submitted": 43974, "total_column_articles": 360, "frontend_question_id": "1775", "is_new_question": false @@ -25884,8 +26535,8 @@ "question__title": "Closest Dessert Cost", "question__title_slug": "closest-dessert-cost", "question__hide": false, - "total_acs": 26513, - "total_submitted": 46041, + "total_acs": 26572, + "total_submitted": 46169, "total_column_articles": 306, "frontend_question_id": "1774", "is_new_question": false @@ -25905,9 +26556,9 @@ "question__title": "Count Items Matching a Rule", "question__title_slug": "count-items-matching-a-rule", "question__hide": false, - "total_acs": 49579, - "total_submitted": 57231, - "total_column_articles": 503, + "total_acs": 49726, + "total_submitted": 57438, + "total_column_articles": 504, "frontend_question_id": "1773", "is_new_question": false }, @@ -25926,8 +26577,8 @@ "question__title": "Leetflex Banned Accounts", "question__title_slug": "leetflex-banned-accounts", "question__hide": false, - "total_acs": 5828, - "total_submitted": 8853, + "total_acs": 5909, + "total_submitted": 8977, "total_column_articles": 85, "frontend_question_id": "1747", "is_new_question": false @@ -25947,8 +26598,8 @@ "question__title": "Maximize Palindrome Length From Subsequences", "question__title_slug": "maximize-palindrome-length-from-subsequences", "question__hide": false, - "total_acs": 3285, - "total_submitted": 8618, + "total_acs": 3297, + "total_submitted": 8644, "total_column_articles": 62, "frontend_question_id": "1771", "is_new_question": false @@ -25968,8 +26619,8 @@ "question__title": "Maximum Score from Performing Multiplication Operations", "question__title_slug": "maximum-score-from-performing-multiplication-operations", "question__hide": false, - "total_acs": 6047, - "total_submitted": 15262, + "total_acs": 6081, + "total_submitted": 15333, "total_column_articles": 130, "frontend_question_id": "1770", "is_new_question": false @@ -25989,9 +26640,9 @@ "question__title": "Minimum Number of Operations to Move All Balls to Each Box", "question__title_slug": "minimum-number-of-operations-to-move-all-balls-to-each-box", "question__hide": false, - "total_acs": 40204, - "total_submitted": 45584, - "total_column_articles": 559, + "total_acs": 40387, + "total_submitted": 45837, + "total_column_articles": 561, "frontend_question_id": "1769", "is_new_question": false }, @@ -26010,9 +26661,9 @@ "question__title": "Merge Strings Alternately", "question__title_slug": "merge-strings-alternately", "question__hide": false, - "total_acs": 55442, - "total_submitted": 71242, - "total_column_articles": 763, + "total_acs": 56325, + "total_submitted": 72437, + "total_column_articles": 770, "frontend_question_id": "1768", "is_new_question": false }, @@ -26031,8 +26682,8 @@ "question__title": "Maximum Subarray Sum After One Operation", "question__title_slug": "maximum-subarray-sum-after-one-operation", "question__hide": false, - "total_acs": 2712, - "total_submitted": 4492, + "total_acs": 2724, + "total_submitted": 4509, "total_column_articles": 76, "frontend_question_id": "1746", "is_new_question": false @@ -26052,9 +26703,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": 28747, - "total_submitted": 33935, - "total_column_articles": 171, + "total_acs": 29063, + "total_submitted": 34288, + "total_column_articles": 172, "frontend_question_id": "1741", "is_new_question": false }, @@ -26073,9 +26724,9 @@ "question__title": "Count Pairs Of Nodes", "question__title_slug": "count-pairs-of-nodes", "question__hide": false, - "total_acs": 2007, - "total_submitted": 5618, - "total_column_articles": 52, + "total_acs": 2019, + "total_submitted": 5638, + "total_column_articles": 53, "frontend_question_id": "1782", "is_new_question": false }, @@ -26094,9 +26745,9 @@ "question__title": "Sum of Beauty of All Substrings", "question__title_slug": "sum-of-beauty-of-all-substrings", "question__hide": false, - "total_acs": 24569, - "total_submitted": 36908, - "total_column_articles": 224, + "total_acs": 24613, + "total_submitted": 36971, + "total_column_articles": 226, "frontend_question_id": "1781", "is_new_question": false }, @@ -26115,9 +26766,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": 31102, - "total_submitted": 41547, - "total_column_articles": 501, + "total_acs": 31157, + "total_submitted": 41616, + "total_column_articles": 502, "frontend_question_id": "1780", "is_new_question": false }, @@ -26136,8 +26787,8 @@ "question__title": "Find Nearest Point That Has the Same X or Y Coordinate", "question__title_slug": "find-nearest-point-that-has-the-same-x-or-y-coordinate", "question__hide": false, - "total_acs": 45956, - "total_submitted": 66625, + "total_acs": 46003, + "total_submitted": 66699, "total_column_articles": 547, "frontend_question_id": "1779", "is_new_question": false @@ -26157,8 +26808,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": 3903, - "total_submitted": 8508, + "total_acs": 3931, + "total_submitted": 8548, "total_column_articles": 53, "frontend_question_id": "1761", "is_new_question": false @@ -26178,8 +26829,8 @@ "question__title": "Minimum Limit of Balls in a Bag", "question__title_slug": "minimum-limit-of-balls-in-a-bag", "question__hide": false, - "total_acs": 24715, - "total_submitted": 38535, + "total_acs": 24775, + "total_submitted": 38630, "total_column_articles": 279, "frontend_question_id": "1760", "is_new_question": false @@ -26199,8 +26850,8 @@ "question__title": "Count Number of Homogenous Substrings", "question__title_slug": "count-number-of-homogenous-substrings", "question__hide": false, - "total_acs": 23672, - "total_submitted": 46276, + "total_acs": 23704, + "total_submitted": 46344, "total_column_articles": 272, "frontend_question_id": "1759", "is_new_question": false @@ -26220,8 +26871,8 @@ "question__title": "Minimum Changes To Make Alternating Binary String", "question__title_slug": "minimum-changes-to-make-alternating-binary-string", "question__hide": false, - "total_acs": 36356, - "total_submitted": 52121, + "total_acs": 36423, + "total_submitted": 52224, "total_column_articles": 450, "frontend_question_id": "1758", "is_new_question": false @@ -26241,9 +26892,9 @@ "question__title": "Find Distance in a Binary Tree", "question__title_slug": "find-distance-in-a-binary-tree", "question__hide": false, - "total_acs": 1626, - "total_submitted": 2436, - "total_column_articles": 54, + "total_acs": 1641, + "total_submitted": 2453, + "total_column_articles": 55, "frontend_question_id": "1740", "is_new_question": false }, @@ -26262,9 +26913,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": 8068, - "total_submitted": 17044, - "total_column_articles": 86, + "total_acs": 8587, + "total_submitted": 18096, + "total_column_articles": 91, "frontend_question_id": "1731", "is_new_question": false }, @@ -26283,9 +26934,9 @@ "question__title": "Closest Subsequence Sum", "question__title_slug": "closest-subsequence-sum", "question__hide": false, - "total_acs": 5881, - "total_submitted": 13120, - "total_column_articles": 91, + "total_acs": 5936, + "total_submitted": 13224, + "total_column_articles": 92, "frontend_question_id": "1755", "is_new_question": false }, @@ -26304,8 +26955,8 @@ "question__title": "Largest Merge Of Two Strings", "question__title_slug": "largest-merge-of-two-strings", "question__hide": false, - "total_acs": 18718, - "total_submitted": 33225, + "total_acs": 18748, + "total_submitted": 33273, "total_column_articles": 208, "frontend_question_id": "1754", "is_new_question": false @@ -26325,8 +26976,8 @@ "question__title": "Maximum Score From Removing Stones", "question__title_slug": "maximum-score-from-removing-stones", "question__hide": false, - "total_acs": 26457, - "total_submitted": 37422, + "total_acs": 26518, + "total_submitted": 37524, "total_column_articles": 335, "frontend_question_id": "1753", "is_new_question": false @@ -26346,9 +26997,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": 32299, - "total_submitted": 55553, - "total_column_articles": 406, + "total_acs": 32359, + "total_submitted": 55669, + "total_column_articles": 407, "frontend_question_id": "1752", "is_new_question": false }, @@ -26367,9 +27018,9 @@ "question__title": "Find Followers Count", "question__title_slug": "find-followers-count", "question__hide": false, - "total_acs": 29703, - "total_submitted": 48034, - "total_column_articles": 134, + "total_acs": 30175, + "total_submitted": 48832, + "total_column_articles": 135, "frontend_question_id": "1729", "is_new_question": false }, @@ -26388,8 +27039,8 @@ "question__title": "Map of Highest Peak", "question__title_slug": "map-of-highest-peak", "question__hide": false, - "total_acs": 24289, - "total_submitted": 36581, + "total_acs": 24323, + "total_submitted": 36630, "total_column_articles": 327, "frontend_question_id": "1765", "is_new_question": false @@ -26409,8 +27060,8 @@ "question__title": "Tree of Coprimes", "question__title_slug": "tree-of-coprimes", "question__hide": false, - "total_acs": 2355, - "total_submitted": 5874, + "total_acs": 2364, + "total_submitted": 5913, "total_column_articles": 47, "frontend_question_id": "1766", "is_new_question": false @@ -26430,8 +27081,8 @@ "question__title": "Form Array by Concatenating Subarrays of Another Array", "question__title_slug": "form-array-by-concatenating-subarrays-of-another-array", "question__hide": false, - "total_acs": 18155, - "total_submitted": 32485, + "total_acs": 18200, + "total_submitted": 32567, "total_column_articles": 259, "frontend_question_id": "1764", "is_new_question": false @@ -26451,9 +27102,9 @@ "question__title": "Longest Nice Substring", "question__title_slug": "longest-nice-substring", "question__hide": false, - "total_acs": 28238, - "total_submitted": 41912, - "total_column_articles": 305, + "total_acs": 28299, + "total_submitted": 42019, + "total_column_articles": 306, "frontend_question_id": "1763", "is_new_question": false }, @@ -26472,8 +27123,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": 30511, - "total_submitted": 83990, + "total_acs": 30531, + "total_submitted": 84039, "total_column_articles": 391, "frontend_question_id": "1744", "is_new_question": false @@ -26493,8 +27144,8 @@ "question__title": "Palindrome Partitioning IV", "question__title_slug": "palindrome-partitioning-iv", "question__hide": false, - "total_acs": 5241, - "total_submitted": 10401, + "total_acs": 5275, + "total_submitted": 10481, "total_column_articles": 107, "frontend_question_id": "1745", "is_new_question": false @@ -26514,8 +27165,8 @@ "question__title": "Restore the Array From Adjacent Pairs", "question__title_slug": "restore-the-array-from-adjacent-pairs", "question__hide": false, - "total_acs": 24455, - "total_submitted": 35156, + "total_acs": 24479, + "total_submitted": 35184, "total_column_articles": 357, "frontend_question_id": "1743", "is_new_question": false @@ -26535,8 +27186,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": 678, - "total_submitted": 1160, + "total_acs": 684, + "total_submitted": 1166, "total_column_articles": 22, "frontend_question_id": "1724", "is_new_question": false @@ -26556,8 +27207,8 @@ "question__title": "Count Apples and Oranges", "question__title_slug": "count-apples-and-oranges", "question__hide": false, - "total_acs": 3963, - "total_submitted": 5540, + "total_acs": 3998, + "total_submitted": 5585, "total_column_articles": 56, "frontend_question_id": "1715", "is_new_question": false @@ -26577,8 +27228,8 @@ "question__title": "Building Boxes", "question__title_slug": "building-boxes", "question__hide": false, - "total_acs": 12760, - "total_submitted": 19811, + "total_acs": 12778, + "total_submitted": 19842, "total_column_articles": 133, "frontend_question_id": "1739", "is_new_question": false @@ -26598,8 +27249,8 @@ "question__title": "Find Kth Largest XOR Coordinate Value", "question__title_slug": "find-kth-largest-xor-coordinate-value", "question__hide": false, - "total_acs": 31527, - "total_submitted": 48408, + "total_acs": 31563, + "total_submitted": 48461, "total_column_articles": 431, "frontend_question_id": "1738", "is_new_question": false @@ -26619,8 +27270,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": 5718, - "total_submitted": 16026, + "total_acs": 5749, + "total_submitted": 16093, "total_column_articles": 129, "frontend_question_id": "1737", "is_new_question": false @@ -26640,9 +27291,9 @@ "question__title": "Latest Time by Replacing Hidden Digits", "question__title_slug": "latest-time-by-replacing-hidden-digits", "question__hide": false, - "total_acs": 33549, - "total_submitted": 75421, - "total_column_articles": 420, + "total_acs": 33605, + "total_submitted": 75564, + "total_column_articles": 421, "frontend_question_id": "1736", "is_new_question": false }, @@ -26661,9 +27312,9 @@ "question__title": "Biggest Window Between Visits", "question__title_slug": "biggest-window-between-visits", "question__hide": false, - "total_acs": 5558, - "total_submitted": 8044, - "total_column_articles": 81, + "total_acs": 5636, + "total_submitted": 8154, + "total_column_articles": 82, "frontend_question_id": "1709", "is_new_question": false }, @@ -26682,9 +27333,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": 6439, - "total_submitted": 11998, - "total_column_articles": 88, + "total_acs": 6499, + "total_submitted": 12079, + "total_column_articles": 89, "frontend_question_id": "1751", "is_new_question": false }, @@ -26703,8 +27354,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": 24018, - "total_submitted": 47432, + "total_acs": 24058, + "total_submitted": 47516, "total_column_articles": 294, "frontend_question_id": "1750", "is_new_question": false @@ -26724,9 +27375,9 @@ "question__title": "Maximum Absolute Sum of Any Subarray", "question__title_slug": "maximum-absolute-sum-of-any-subarray", "question__hide": false, - "total_acs": 6938, - "total_submitted": 12776, - "total_column_articles": 146, + "total_acs": 6995, + "total_submitted": 12886, + "total_column_articles": 147, "frontend_question_id": "1749", "is_new_question": false }, @@ -26745,9 +27396,9 @@ "question__title": "Sum of Unique Elements", "question__title_slug": "sum-of-unique-elements", "question__hide": false, - "total_acs": 47409, - "total_submitted": 61598, - "total_column_articles": 640, + "total_acs": 47551, + "total_submitted": 61875, + "total_column_articles": 643, "frontend_question_id": "1748", "is_new_question": false }, @@ -26766,8 +27417,8 @@ "question__title": "Largest Subarray Length K", "question__title_slug": "largest-subarray-length-k", "question__hide": false, - "total_acs": 1734, - "total_submitted": 2562, + "total_acs": 1743, + "total_submitted": 2604, "total_column_articles": 51, "frontend_question_id": "1708", "is_new_question": false @@ -26787,8 +27438,8 @@ "question__title": "Largest Submatrix With Rearrangements", "question__title_slug": "largest-submatrix-with-rearrangements", "question__hide": false, - "total_acs": 4696, - "total_submitted": 7959, + "total_acs": 4724, + "total_submitted": 8001, "total_column_articles": 94, "frontend_question_id": "1727", "is_new_question": false @@ -26808,8 +27459,8 @@ "question__title": "Maximum Number of Balls in a Box", "question__title_slug": "maximum-number-of-balls-in-a-box", "question__hide": false, - "total_acs": 38848, - "total_submitted": 51254, + "total_acs": 38911, + "total_submitted": 51343, "total_column_articles": 389, "frontend_question_id": "1742", "is_new_question": false @@ -26829,9 +27480,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": 38685, - "total_submitted": 46691, - "total_column_articles": 480, + "total_acs": 38745, + "total_submitted": 46798, + "total_column_articles": 481, "frontend_question_id": "1725", "is_new_question": false }, @@ -26850,8 +27501,8 @@ "question__title": "Number of Calls Between Two Persons", "question__title_slug": "number-of-calls-between-two-persons", "question__hide": false, - "total_acs": 11501, - "total_submitted": 15070, + "total_acs": 11628, + "total_submitted": 15241, "total_column_articles": 122, "frontend_question_id": "1699", "is_new_question": false @@ -26871,8 +27522,8 @@ "question__title": "Minimize Hamming Distance After Swap Operations", "question__title_slug": "minimize-hamming-distance-after-swap-operations", "question__hide": false, - "total_acs": 6162, - "total_submitted": 12115, + "total_acs": 6179, + "total_submitted": 12139, "total_column_articles": 148, "frontend_question_id": "1722", "is_new_question": false @@ -26892,9 +27543,9 @@ "question__title": "Decode XORed Array", "question__title_slug": "decode-xored-array", "question__hide": false, - "total_acs": 55363, - "total_submitted": 64355, - "total_column_articles": 590, + "total_acs": 55506, + "total_submitted": 64560, + "total_column_articles": 592, "frontend_question_id": "1720", "is_new_question": false }, @@ -26913,8 +27564,8 @@ "question__title": "Number of Distinct Substrings in a String", "question__title_slug": "number-of-distinct-substrings-in-a-string", "question__hide": false, - "total_acs": 983, - "total_submitted": 1795, + "total_acs": 992, + "total_submitted": 1807, "total_column_articles": 28, "frontend_question_id": "1698", "is_new_question": false @@ -26934,8 +27585,8 @@ "question__title": "Daily Leads and Partners", "question__title_slug": "daily-leads-and-partners", "question__hide": false, - "total_acs": 28156, - "total_submitted": 34316, + "total_acs": 28427, + "total_submitted": 34642, "total_column_articles": 161, "frontend_question_id": "1693", "is_new_question": false @@ -26955,8 +27606,8 @@ "question__title": "Count Ways to Make Array With Product", "question__title_slug": "count-ways-to-make-array-with-product", "question__hide": false, - "total_acs": 1839, - "total_submitted": 3529, + "total_acs": 1853, + "total_submitted": 3569, "total_column_articles": 49, "frontend_question_id": "1735", "is_new_question": false @@ -26976,8 +27627,8 @@ "question__title": "Decode XORed Permutation", "question__title_slug": "decode-xored-permutation", "question__hide": false, - "total_acs": 29668, - "total_submitted": 40950, + "total_acs": 29686, + "total_submitted": 40969, "total_column_articles": 384, "frontend_question_id": "1734", "is_new_question": false @@ -26997,9 +27648,9 @@ "question__title": "Minimum Number of People to Teach", "question__title_slug": "minimum-number-of-people-to-teach", "question__hide": false, - "total_acs": 3455, - "total_submitted": 7136, - "total_column_articles": 74, + "total_acs": 3468, + "total_submitted": 7162, + "total_column_articles": 75, "frontend_question_id": "1733", "is_new_question": false }, @@ -27018,9 +27669,9 @@ "question__title": "Find the Highest Altitude", "question__title_slug": "find-the-highest-altitude", "question__hide": false, - "total_acs": 44620, - "total_submitted": 54820, - "total_column_articles": 533, + "total_acs": 45092, + "total_submitted": 55429, + "total_column_articles": 539, "frontend_question_id": "1732", "is_new_question": false }, @@ -27039,8 +27690,8 @@ "question__title": "Minimum Operations to Make a Subsequence", "question__title_slug": "minimum-operations-to-make-a-subsequence", "question__hide": false, - "total_acs": 18676, - "total_submitted": 37457, + "total_acs": 18685, + "total_submitted": 37466, "total_column_articles": 198, "frontend_question_id": "1713", "is_new_question": false @@ -27060,8 +27711,8 @@ "question__title": "Ways to Split Array Into Three Subarrays", "question__title_slug": "ways-to-split-array-into-three-subarrays", "question__hide": false, - "total_acs": 12752, - "total_submitted": 44693, + "total_acs": 12806, + "total_submitted": 44833, "total_column_articles": 174, "frontend_question_id": "1712", "is_new_question": false @@ -27081,8 +27732,8 @@ "question__title": "Count Good Meals", "question__title_slug": "count-good-meals", "question__hide": false, - "total_acs": 32948, - "total_submitted": 91668, + "total_acs": 32988, + "total_submitted": 91763, "total_column_articles": 389, "frontend_question_id": "1711", "is_new_question": false @@ -27102,9 +27753,9 @@ "question__title": "Maximum Units on a Truck", "question__title_slug": "maximum-units-on-a-truck", "question__hide": false, - "total_acs": 49285, - "total_submitted": 67054, - "total_column_articles": 581, + "total_acs": 49425, + "total_submitted": 67272, + "total_column_articles": 582, "frontend_question_id": "1710", "is_new_question": false }, @@ -27123,8 +27774,8 @@ "question__title": "Count Ways to Distribute Candies", "question__title_slug": "count-ways-to-distribute-candies", "question__hide": false, - "total_acs": 723, - "total_submitted": 1056, + "total_acs": 730, + "total_submitted": 1066, "total_column_articles": 25, "frontend_question_id": "1692", "is_new_question": false @@ -27144,9 +27795,9 @@ "question__title": "Invalid Tweets", "question__title_slug": "invalid-tweets", "question__hide": false, - "total_acs": 10152, - "total_submitted": 11480, - "total_column_articles": 59, + "total_acs": 11299, + "total_submitted": 12810, + "total_column_articles": 64, "frontend_question_id": "1683", "is_new_question": false }, @@ -27165,8 +27816,8 @@ "question__title": "Maximum XOR With an Element From Array", "question__title_slug": "maximum-xor-with-an-element-from-array", "question__hide": false, - "total_acs": 16604, - "total_submitted": 32619, + "total_acs": 16650, + "total_submitted": 32697, "total_column_articles": 175, "frontend_question_id": "1707", "is_new_question": false @@ -27186,8 +27837,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": 30868, - "total_submitted": 60721, + "total_acs": 30958, + "total_submitted": 60905, "total_column_articles": 222, "frontend_question_id": "1723", "is_new_question": false @@ -27207,8 +27858,8 @@ "question__title": "Maximum Number of Eaten Apples", "question__title_slug": "maximum-number-of-eaten-apples", "question__hide": false, - "total_acs": 29580, - "total_submitted": 65098, + "total_acs": 29645, + "total_submitted": 65240, "total_column_articles": 393, "frontend_question_id": "1705", "is_new_question": false @@ -27228,9 +27879,9 @@ "question__title": "Determine if String Halves Are Alike", "question__title_slug": "determine-if-string-halves-are-alike", "question__hide": false, - "total_acs": 48231, - "total_submitted": 61507, - "total_column_articles": 566, + "total_acs": 48305, + "total_submitted": 61615, + "total_column_articles": 568, "frontend_question_id": "1704", "is_new_question": false }, @@ -27249,8 +27900,8 @@ "question__title": "Longest Palindromic Subsequence II", "question__title_slug": "longest-palindromic-subsequence-ii", "question__hide": false, - "total_acs": 1127, - "total_submitted": 1967, + "total_acs": 1153, + "total_submitted": 2016, "total_column_articles": 41, "frontend_question_id": "1682", "is_new_question": false @@ -27270,8 +27921,8 @@ "question__title": "Product's Worth Over Invoices", "question__title_slug": "products-worth-over-invoices", "question__hide": false, - "total_acs": 4417, - "total_submitted": 12549, + "total_acs": 4447, + "total_submitted": 12646, "total_column_articles": 53, "frontend_question_id": "1677", "is_new_question": false @@ -27291,8 +27942,8 @@ "question__title": "Number Of Ways To Reconstruct A Tree", "question__title_slug": "number-of-ways-to-reconstruct-a-tree", "question__hide": false, - "total_acs": 12999, - "total_submitted": 18806, + "total_acs": 13013, + "total_submitted": 18828, "total_column_articles": 94, "frontend_question_id": "1719", "is_new_question": false @@ -27312,8 +27963,8 @@ "question__title": "Construct the Lexicographically Largest Valid Sequence", "question__title_slug": "construct-the-lexicographically-largest-valid-sequence", "question__hide": false, - "total_acs": 3296, - "total_submitted": 6531, + "total_acs": 3327, + "total_submitted": 6585, "total_column_articles": 75, "frontend_question_id": "1718", "is_new_question": false @@ -27333,8 +27984,8 @@ "question__title": "Maximum Score From Removing Substrings", "question__title_slug": "maximum-score-from-removing-substrings", "question__hide": false, - "total_acs": 3710, - "total_submitted": 8020, + "total_acs": 3738, + "total_submitted": 8101, "total_column_articles": 84, "frontend_question_id": "1717", "is_new_question": false @@ -27354,9 +28005,9 @@ "question__title": "Calculate Money in Leetcode Bank", "question__title_slug": "calculate-money-in-leetcode-bank", "question__hide": false, - "total_acs": 42129, - "total_submitted": 60944, - "total_column_articles": 742, + "total_acs": 42203, + "total_submitted": 61066, + "total_column_articles": 743, "frontend_question_id": "1716", "is_new_question": false }, @@ -27375,8 +28026,8 @@ "question__title": "Lowest Common Ancestor of a Binary Tree IV", "question__title_slug": "lowest-common-ancestor-of-a-binary-tree-iv", "question__hide": false, - "total_acs": 3182, - "total_submitted": 3903, + "total_acs": 3230, + "total_submitted": 4038, "total_column_articles": 52, "frontend_question_id": "1676", "is_new_question": false @@ -27396,8 +28047,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": 14825, - "total_submitted": 22822, + "total_acs": 14841, + "total_submitted": 22849, "total_column_articles": 163, "frontend_question_id": "1697", "is_new_question": false @@ -27417,9 +28068,9 @@ "question__title": "Jump Game VI", "question__title_slug": "jump-game-vi", "question__hide": false, - "total_acs": 12344, - "total_submitted": 30687, - "total_column_articles": 191, + "total_acs": 12439, + "total_submitted": 30941, + "total_column_articles": 192, "frontend_question_id": "1696", "is_new_question": false }, @@ -27438,9 +28089,9 @@ "question__title": "Maximum Erasure Value", "question__title_slug": "maximum-erasure-value", "question__hide": false, - "total_acs": 13567, - "total_submitted": 26184, - "total_column_articles": 225, + "total_acs": 13656, + "total_submitted": 26350, + "total_column_articles": 226, "frontend_question_id": "1695", "is_new_question": false }, @@ -27459,9 +28110,9 @@ "question__title": "Reformat Phone Number", "question__title_slug": "reformat-phone-number", "question__hide": false, - "total_acs": 37374, - "total_submitted": 56523, - "total_column_articles": 561, + "total_acs": 37418, + "total_submitted": 56589, + "total_column_articles": 564, "frontend_question_id": "1694", "is_new_question": false }, @@ -27480,9 +28131,9 @@ "question__title": "Fix Names in a Table", "question__title_slug": "fix-names-in-a-table", "question__hide": false, - "total_acs": 52250, - "total_submitted": 82085, - "total_column_articles": 269, + "total_acs": 52604, + "total_submitted": 82658, + "total_column_articles": 272, "frontend_question_id": "1667", "is_new_question": false }, @@ -27501,8 +28152,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": 503, - "total_submitted": 754, + "total_acs": 513, + "total_submitted": 770, "total_column_articles": 24, "frontend_question_id": "1666", "is_new_question": false @@ -27522,9 +28173,9 @@ "question__title": "Sum Of Special Evenly-Spaced Elements In Array", "question__title_slug": "sum-of-special-evenly-spaced-elements-in-array", "question__hide": false, - "total_acs": 453, - "total_submitted": 765, - "total_column_articles": 13, + "total_acs": 457, + "total_submitted": 771, + "total_column_articles": 14, "frontend_question_id": "1714", "is_new_question": false }, @@ -27543,9 +28194,9 @@ "question__title": "Stone Game VII", "question__title_slug": "stone-game-vii", "question__hide": false, - "total_acs": 6443, - "total_submitted": 11596, - "total_column_articles": 133, + "total_acs": 6468, + "total_submitted": 11645, + "total_column_articles": 134, "frontend_question_id": "1690", "is_new_question": false }, @@ -27564,8 +28215,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": 21702, - "total_submitted": 25062, + "total_acs": 21804, + "total_submitted": 25176, "total_column_articles": 292, "frontend_question_id": "1689", "is_new_question": false @@ -27585,9 +28236,9 @@ "question__title": "Count of Matches in Tournament", "question__title_slug": "count-of-matches-in-tournament", "question__hide": false, - "total_acs": 60017, - "total_submitted": 71577, - "total_column_articles": 639, + "total_acs": 60137, + "total_submitted": 71742, + "total_column_articles": 640, "frontend_question_id": "1688", "is_new_question": false }, @@ -27606,8 +28257,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": 11597, - "total_submitted": 20455, + "total_acs": 11612, + "total_submitted": 20494, "total_column_articles": 87, "frontend_question_id": "1703", "is_new_question": false @@ -27627,9 +28278,9 @@ "question__title": "Maximum Binary String After Change", "question__title_slug": "maximum-binary-string-after-change", "question__hide": false, - "total_acs": 4862, - "total_submitted": 10006, - "total_column_articles": 97, + "total_acs": 4888, + "total_submitted": 10095, + "total_column_articles": 98, "frontend_question_id": "1702", "is_new_question": false }, @@ -27648,9 +28299,9 @@ "question__title": "Average Waiting Time", "question__title_slug": "average-waiting-time", "question__hide": false, - "total_acs": 7103, - "total_submitted": 11729, - "total_column_articles": 142, + "total_acs": 7136, + "total_submitted": 11783, + "total_column_articles": 143, "frontend_question_id": "1701", "is_new_question": false }, @@ -27669,9 +28320,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": 49658, - "total_submitted": 67718, - "total_column_articles": 752, + "total_acs": 49828, + "total_submitted": 67980, + "total_column_articles": 755, "frontend_question_id": "1700", "is_new_question": false }, @@ -27690,9 +28341,9 @@ "question__title": "Average Time of Process per Machine", "question__title_slug": "average-time-of-process-per-machine", "question__hide": false, - "total_acs": 7607, - "total_submitted": 10250, - "total_column_articles": 102, + "total_acs": 8352, + "total_submitted": 11334, + "total_column_articles": 109, "frontend_question_id": "1661", "is_new_question": false }, @@ -27711,9 +28362,9 @@ "question__title": "Concatenation of Consecutive Binary Numbers", "question__title_slug": "concatenation-of-consecutive-binary-numbers", "question__hide": false, - "total_acs": 7808, - "total_submitted": 15751, - "total_column_articles": 93, + "total_acs": 7848, + "total_submitted": 15811, + "total_column_articles": 94, "frontend_question_id": "1680", "is_new_question": false }, @@ -27732,8 +28383,8 @@ "question__title": "Minimum Incompatibility", "question__title_slug": "minimum-incompatibility", "question__hide": false, - "total_acs": 3908, - "total_submitted": 9056, + "total_acs": 3934, + "total_submitted": 9092, "total_column_articles": 75, "frontend_question_id": "1681", "is_new_question": false @@ -27753,9 +28404,9 @@ "question__title": "Max Number of K-Sum Pairs", "question__title_slug": "max-number-of-k-sum-pairs", "question__hide": false, - "total_acs": 11700, - "total_submitted": 22087, - "total_column_articles": 181, + "total_acs": 12202, + "total_submitted": 22941, + "total_column_articles": 188, "frontend_question_id": "1679", "is_new_question": false }, @@ -27774,9 +28425,9 @@ "question__title": "Goal Parser Interpretation", "question__title_slug": "goal-parser-interpretation", "question__hide": false, - "total_acs": 56033, - "total_submitted": 64967, - "total_column_articles": 758, + "total_acs": 56178, + "total_submitted": 65155, + "total_column_articles": 761, "frontend_question_id": "1678", "is_new_question": false }, @@ -27795,8 +28446,8 @@ "question__title": "Correct a Binary Tree", "question__title_slug": "correct-a-binary-tree", "question__hide": false, - "total_acs": 883, - "total_submitted": 1167, + "total_acs": 898, + "total_submitted": 1183, "total_column_articles": 35, "frontend_question_id": "1660", "is_new_question": false @@ -27816,8 +28467,8 @@ "question__title": "Hopper Company Queries III", "question__title_slug": "hopper-company-queries-iii", "question__hide": false, - "total_acs": 1880, - "total_submitted": 2946, + "total_acs": 1905, + "total_submitted": 2980, "total_column_articles": 36, "frontend_question_id": "1651", "is_new_question": false @@ -27837,8 +28488,8 @@ "question__title": "Minimize Deviation in Array", "question__title_slug": "minimize-deviation-in-array", "question__hide": false, - "total_acs": 6294, - "total_submitted": 13767, + "total_acs": 6328, + "total_submitted": 13881, "total_column_articles": 72, "frontend_question_id": "1675", "is_new_question": false @@ -27858,8 +28509,8 @@ "question__title": "Minimum Moves to Make Array Complementary", "question__title_slug": "minimum-moves-to-make-array-complementary", "question__hide": false, - "total_acs": 4139, - "total_submitted": 9927, + "total_acs": 4156, + "total_submitted": 9951, "total_column_articles": 81, "frontend_question_id": "1674", "is_new_question": false @@ -27879,9 +28530,9 @@ "question__title": "Find the Most Competitive Subsequence", "question__title_slug": "find-the-most-competitive-subsequence", "question__hide": false, - "total_acs": 11551, - "total_submitted": 29406, - "total_column_articles": 226, + "total_acs": 11618, + "total_submitted": 29528, + "total_column_articles": 227, "frontend_question_id": "1673", "is_new_question": false }, @@ -27900,9 +28551,9 @@ "question__title": "Richest Customer Wealth", "question__title_slug": "richest-customer-wealth", "question__hide": false, - "total_acs": 139558, - "total_submitted": 166313, - "total_column_articles": 1334, + "total_acs": 140805, + "total_submitted": 167932, + "total_column_articles": 1347, "frontend_question_id": "1672", "is_new_question": false }, @@ -27921,9 +28572,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": 4877, - "total_submitted": 6101, - "total_column_articles": 63, + "total_acs": 4923, + "total_submitted": 6159, + "total_column_articles": 64, "frontend_question_id": "1650", "is_new_question": false }, @@ -27942,8 +28593,8 @@ "question__title": "Delivering Boxes from Storage to Ports", "question__title_slug": "delivering-boxes-from-storage-to-ports", "question__hide": false, - "total_acs": 12566, - "total_submitted": 21330, + "total_acs": 12575, + "total_submitted": 21346, "total_column_articles": 99, "frontend_question_id": "1687", "is_new_question": false @@ -27963,8 +28614,8 @@ "question__title": "Stone Game VI", "question__title_slug": "stone-game-vi", "question__hide": false, - "total_acs": 4662, - "total_submitted": 9394, + "total_acs": 4706, + "total_submitted": 9453, "total_column_articles": 77, "frontend_question_id": "1686", "is_new_question": false @@ -27984,8 +28635,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": 7668, - "total_submitted": 11847, + "total_acs": 7735, + "total_submitted": 11941, "total_column_articles": 168, "frontend_question_id": "1685", "is_new_question": false @@ -28005,8 +28656,8 @@ "question__title": "Count the Number of Consistent Strings", "question__title_slug": "count-the-number-of-consistent-strings", "question__hide": false, - "total_acs": 60782, - "total_submitted": 71292, + "total_acs": 60957, + "total_submitted": 71498, "total_column_articles": 835, "frontend_question_id": "1684", "is_new_question": false @@ -28026,8 +28677,8 @@ "question__title": "Hopper Company Queries II", "question__title_slug": "hopper-company-queries-ii", "question__hide": false, - "total_acs": 1814, - "total_submitted": 4381, + "total_acs": 1839, + "total_submitted": 4420, "total_column_articles": 36, "frontend_question_id": "1645", "is_new_question": false @@ -28047,8 +28698,8 @@ "question__title": "Minimum Initial Energy to Finish Tasks", "question__title_slug": "minimum-initial-energy-to-finish-tasks", "question__hide": false, - "total_acs": 7630, - "total_submitted": 11667, + "total_acs": 7672, + "total_submitted": 11722, "total_column_articles": 122, "frontend_question_id": "1665", "is_new_question": false @@ -28068,9 +28719,9 @@ "question__title": "Ways to Make a Fair Array", "question__title_slug": "ways-to-make-a-fair-array", "question__hide": false, - "total_acs": 24857, - "total_submitted": 37377, - "total_column_articles": 399, + "total_acs": 24893, + "total_submitted": 37437, + "total_column_articles": 398, "frontend_question_id": "1664", "is_new_question": false }, @@ -28089,8 +28740,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": 26353, - "total_submitted": 40475, + "total_acs": 26373, + "total_submitted": 40509, "total_column_articles": 344, "frontend_question_id": "1663", "is_new_question": false @@ -28110,9 +28761,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": 68376, - "total_submitted": 84402, - "total_column_articles": 704, + "total_acs": 68485, + "total_submitted": 84547, + "total_column_articles": 706, "frontend_question_id": "1662", "is_new_question": false }, @@ -28131,8 +28782,8 @@ "question__title": "Lowest Common Ancestor of a Binary Tree II", "question__title_slug": "lowest-common-ancestor-of-a-binary-tree-ii", "question__hide": false, - "total_acs": 4151, - "total_submitted": 7406, + "total_acs": 4188, + "total_submitted": 7474, "total_column_articles": 56, "frontend_question_id": "1644", "is_new_question": false @@ -28152,8 +28803,8 @@ "question__title": "Hopper Company Queries I", "question__title_slug": "hopper-company-queries-i", "question__hide": false, - "total_acs": 2650, - "total_submitted": 5378, + "total_acs": 2681, + "total_submitted": 5431, "total_column_articles": 54, "frontend_question_id": "1635", "is_new_question": false @@ -28173,8 +28824,8 @@ "question__title": "Maximize Grid Happiness", "question__title_slug": "maximize-grid-happiness", "question__hide": false, - "total_acs": 2174, - "total_submitted": 4886, + "total_acs": 2194, + "total_submitted": 4913, "total_column_articles": 38, "frontend_question_id": "1659", "is_new_question": false @@ -28194,9 +28845,9 @@ "question__title": "Determine if Two Strings Are Close", "question__title_slug": "determine-if-two-strings-are-close", "question__hide": false, - "total_acs": 8831, - "total_submitted": 18678, - "total_column_articles": 130, + "total_acs": 9197, + "total_submitted": 19376, + "total_column_articles": 132, "frontend_question_id": "1657", "is_new_question": false }, @@ -28215,8 +28866,8 @@ "question__title": "Minimum Operations to Reduce X to Zero", "question__title_slug": "minimum-operations-to-reduce-x-to-zero", "question__hide": false, - "total_acs": 37229, - "total_submitted": 94989, + "total_acs": 37540, + "total_submitted": 95712, "total_column_articles": 431, "frontend_question_id": "1658", "is_new_question": false @@ -28236,9 +28887,9 @@ "question__title": "Design an Ordered Stream", "question__title_slug": "design-an-ordered-stream", "question__hide": false, - "total_acs": 39353, - "total_submitted": 46785, - "total_column_articles": 367, + "total_acs": 39415, + "total_submitted": 46867, + "total_column_articles": 368, "frontend_question_id": "1656", "is_new_question": false }, @@ -28257,9 +28908,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": 1881, - "total_submitted": 3157, - "total_column_articles": 54, + "total_acs": 1933, + "total_submitted": 3225, + "total_column_articles": 55, "frontend_question_id": "1634", "is_new_question": false }, @@ -28278,9 +28929,9 @@ "question__title": "Percentage of Users Attended a Contest", "question__title_slug": "percentage-of-users-attended-a-contest", "question__hide": false, - "total_acs": 10832, - "total_submitted": 16936, - "total_column_articles": 81, + "total_acs": 11480, + "total_submitted": 18019, + "total_column_articles": 85, "frontend_question_id": "1633", "is_new_question": false }, @@ -28299,8 +28950,8 @@ "question__title": "Create Sorted Array through Instructions", "question__title_slug": "create-sorted-array-through-instructions", "question__hide": false, - "total_acs": 4147, - "total_submitted": 8472, + "total_acs": 4182, + "total_submitted": 8525, "total_column_articles": 98, "frontend_question_id": "1649", "is_new_question": false @@ -28320,8 +28971,8 @@ "question__title": "Sell Diminishing-Valued Colored Balls", "question__title_slug": "sell-diminishing-valued-colored-balls", "question__hide": false, - "total_acs": 7232, - "total_submitted": 22929, + "total_acs": 7299, + "total_submitted": 23117, "total_column_articles": 148, "frontend_question_id": "1648", "is_new_question": false @@ -28341,8 +28992,8 @@ "question__title": "Minimum Deletions to Make Character Frequencies Unique", "question__title_slug": "minimum-deletions-to-make-character-frequencies-unique", "question__hide": false, - "total_acs": 12387, - "total_submitted": 22744, + "total_acs": 12437, + "total_submitted": 22829, "total_column_articles": 185, "frontend_question_id": "1647", "is_new_question": false @@ -28362,8 +29013,8 @@ "question__title": "Get Maximum in Generated Array", "question__title_slug": "get-maximum-in-generated-array", "question__hide": false, - "total_acs": 49138, - "total_submitted": 94566, + "total_acs": 49330, + "total_submitted": 94977, "total_column_articles": 498, "frontend_question_id": "1646", "is_new_question": false @@ -28383,9 +29034,9 @@ "question__title": "Design an Expression Tree With Evaluate Function", "question__title_slug": "design-an-expression-tree-with-evaluate-function", "question__hide": false, - "total_acs": 927, - "total_submitted": 1128, - "total_column_articles": 32, + "total_acs": 934, + "total_submitted": 1135, + "total_column_articles": 34, "frontend_question_id": "1628", "is_new_question": false }, @@ -28404,9 +29055,9 @@ "question__title": "Design Front Middle Back Queue", "question__title_slug": "design-front-middle-back-queue", "question__hide": false, - "total_acs": 7581, - "total_submitted": 14570, - "total_column_articles": 141, + "total_acs": 7633, + "total_submitted": 14666, + "total_column_articles": 142, "frontend_question_id": "1670", "is_new_question": false }, @@ -28425,9 +29076,9 @@ "question__title": "Minimum Number of Removals to Make Mountain Array", "question__title_slug": "minimum-number-of-removals-to-make-mountain-array", "question__hide": false, - "total_acs": 3791, - "total_submitted": 8066, - "total_column_articles": 72, + "total_acs": 3852, + "total_submitted": 8205, + "total_column_articles": 73, "frontend_question_id": "1671", "is_new_question": false }, @@ -28446,9 +29097,9 @@ "question__title": "Merge In Between Linked Lists", "question__title_slug": "merge-in-between-linked-lists", "question__hide": false, - "total_acs": 44517, - "total_submitted": 57570, - "total_column_articles": 620, + "total_acs": 44805, + "total_submitted": 57948, + "total_column_articles": 621, "frontend_question_id": "1669", "is_new_question": false }, @@ -28467,9 +29118,9 @@ "question__title": "Maximum Repeating Substring", "question__title_slug": "maximum-repeating-substring", "question__hide": false, - "total_acs": 43081, - "total_submitted": 91494, - "total_column_articles": 579, + "total_acs": 43213, + "total_submitted": 91824, + "total_column_articles": 582, "frontend_question_id": "1668", "is_new_question": false }, @@ -28488,8 +29139,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": 6063, - "total_submitted": 7735, + "total_acs": 6086, + "total_submitted": 7766, "total_column_articles": 61, "frontend_question_id": "1623", "is_new_question": false @@ -28509,8 +29160,8 @@ "question__title": "Furthest Building You Can Reach", "question__title_slug": "furthest-building-you-can-reach", "question__hide": false, - "total_acs": 10420, - "total_submitted": 23016, + "total_acs": 10469, + "total_submitted": 23133, "total_column_articles": 167, "frontend_question_id": "1642", "is_new_question": false @@ -28530,9 +29181,9 @@ "question__title": "Count Sorted Vowel Strings", "question__title_slug": "count-sorted-vowel-strings", "question__hide": false, - "total_acs": 38906, - "total_submitted": 47186, - "total_column_articles": 594, + "total_acs": 38984, + "total_submitted": 47288, + "total_column_articles": 595, "frontend_question_id": "1641", "is_new_question": false }, @@ -28551,9 +29202,9 @@ "question__title": "Check Array Formation Through Concatenation", "question__title_slug": "check-array-formation-through-concatenation", "question__hide": false, - "total_acs": 44467, - "total_submitted": 72945, - "total_column_articles": 657, + "total_acs": 44545, + "total_submitted": 73081, + "total_column_articles": 658, "frontend_question_id": "1640", "is_new_question": false }, @@ -28572,8 +29223,8 @@ "question__title": "Find the Missing IDs", "question__title_slug": "find-the-missing-ids", "question__hide": false, - "total_acs": 5268, - "total_submitted": 7238, + "total_acs": 5301, + "total_submitted": 7286, "total_column_articles": 67, "frontend_question_id": "1613", "is_new_question": false @@ -28593,8 +29244,8 @@ "question__title": "Distribute Repeating Integers", "question__title_slug": "distribute-repeating-integers", "question__hide": false, - "total_acs": 3861, - "total_submitted": 9781, + "total_acs": 3889, + "total_submitted": 9861, "total_column_articles": 61, "frontend_question_id": "1655", "is_new_question": false @@ -28614,9 +29265,9 @@ "question__title": "Minimum Jumps to Reach Home", "question__title_slug": "minimum-jumps-to-reach-home", "question__hide": false, - "total_acs": 8793, - "total_submitted": 28153, - "total_column_articles": 114, + "total_acs": 8848, + "total_submitted": 28299, + "total_column_articles": 115, "frontend_question_id": "1654", "is_new_question": false }, @@ -28635,8 +29286,8 @@ "question__title": "Minimum Deletions to Make String Balanced", "question__title_slug": "minimum-deletions-to-make-string-balanced", "question__hide": false, - "total_acs": 34184, - "total_submitted": 56041, + "total_acs": 34257, + "total_submitted": 56169, "total_column_articles": 356, "frontend_question_id": "1653", "is_new_question": false @@ -28656,9 +29307,9 @@ "question__title": "Defuse the Bomb", "question__title_slug": "defuse-the-bomb", "question__hide": false, - "total_acs": 37158, - "total_submitted": 55886, - "total_column_articles": 604, + "total_acs": 37227, + "total_submitted": 55993, + "total_column_articles": 605, "frontend_question_id": "1652", "is_new_question": false }, @@ -28677,9 +29328,9 @@ "question__title": "Path With Minimum Effort", "question__title_slug": "path-with-minimum-effort", "question__hide": false, - "total_acs": 41078, - "total_submitted": 80462, - "total_column_articles": 434, + "total_acs": 41476, + "total_submitted": 81280, + "total_column_articles": 437, "frontend_question_id": "1631", "is_new_question": false }, @@ -28698,9 +29349,9 @@ "question__title": "Arithmetic Subarrays", "question__title_slug": "arithmetic-subarrays", "question__hide": false, - "total_acs": 33459, - "total_submitted": 43943, - "total_column_articles": 445, + "total_acs": 33523, + "total_submitted": 44037, + "total_column_articles": 447, "frontend_question_id": "1630", "is_new_question": false }, @@ -28719,9 +29370,9 @@ "question__title": "Slowest Key", "question__title_slug": "slowest-key", "question__hide": false, - "total_acs": 37025, - "total_submitted": 66340, - "total_column_articles": 444, + "total_acs": 37081, + "total_submitted": 66425, + "total_column_articles": 446, "frontend_question_id": "1629", "is_new_question": false }, @@ -28740,8 +29391,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": 859, - "total_submitted": 1157, + "total_acs": 868, + "total_submitted": 1170, "total_column_articles": 35, "frontend_question_id": "1612", "is_new_question": false @@ -28761,8 +29412,8 @@ "question__title": "Sellers With No Sales", "question__title_slug": "sellers-with-no-sales", "question__hide": false, - "total_acs": 9838, - "total_submitted": 18045, + "total_acs": 9986, + "total_submitted": 18325, "total_column_articles": 90, "frontend_question_id": "1607", "is_new_question": false @@ -28782,8 +29433,8 @@ "question__title": "Best Team With No Conflicts", "question__title_slug": "best-team-with-no-conflicts", "question__hide": false, - "total_acs": 24612, - "total_submitted": 45875, + "total_acs": 24712, + "total_submitted": 46024, "total_column_articles": 248, "frontend_question_id": "1626", "is_new_question": false @@ -28803,8 +29454,8 @@ "question__title": "Lexicographically Smallest String After Applying Operations", "question__title_slug": "lexicographically-smallest-string-after-applying-operations", "question__hide": false, - "total_acs": 17207, - "total_submitted": 25791, + "total_acs": 17237, + "total_submitted": 25836, "total_column_articles": 149, "frontend_question_id": "1625", "is_new_question": false @@ -28824,9 +29475,9 @@ "question__title": "Largest Substring Between Two Equal Characters", "question__title_slug": "largest-substring-between-two-equal-characters", "question__hide": false, - "total_acs": 46236, - "total_submitted": 71754, - "total_column_articles": 686, + "total_acs": 46332, + "total_submitted": 71894, + "total_column_articles": 689, "frontend_question_id": "1624", "is_new_question": false }, @@ -28845,8 +29496,8 @@ "question__title": "Find Nearest Right Node in Binary Tree", "question__title_slug": "find-nearest-right-node-in-binary-tree", "question__hide": false, - "total_acs": 1908, - "total_submitted": 2572, + "total_acs": 1914, + "total_submitted": 2578, "total_column_articles": 60, "frontend_question_id": "1602", "is_new_question": false @@ -28866,8 +29517,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": 2472, - "total_submitted": 5325, + "total_acs": 2512, + "total_submitted": 5379, "total_column_articles": 54, "frontend_question_id": "1639", "is_new_question": false @@ -28887,8 +29538,8 @@ "question__title": "Count Substrings That Differ by One Character", "question__title_slug": "count-substrings-that-differ-by-one-character", "question__hide": false, - "total_acs": 22489, - "total_submitted": 28967, + "total_acs": 22539, + "total_submitted": 29028, "total_column_articles": 194, "frontend_question_id": "1638", "is_new_question": false @@ -28908,8 +29559,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": 29872, - "total_submitted": 35417, + "total_acs": 29921, + "total_submitted": 35477, "total_column_articles": 274, "frontend_question_id": "1637", "is_new_question": false @@ -28929,9 +29580,9 @@ "question__title": "Sort Array by Increasing Frequency", "question__title_slug": "sort-array-by-increasing-frequency", "question__hide": false, - "total_acs": 47640, - "total_submitted": 63694, - "total_column_articles": 604, + "total_acs": 47747, + "total_submitted": 63850, + "total_column_articles": 606, "frontend_question_id": "1636", "is_new_question": false }, @@ -28950,8 +29601,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": 12468, - "total_submitted": 15730, + "total_acs": 12490, + "total_submitted": 15763, "total_column_articles": 101, "frontend_question_id": "1617", "is_new_question": false @@ -28971,8 +29622,8 @@ "question__title": "Split Two Strings to Make Palindrome", "question__title_slug": "split-two-strings-to-make-palindrome", "question__hide": false, - "total_acs": 23905, - "total_submitted": 63624, + "total_acs": 23932, + "total_submitted": 63715, "total_column_articles": 261, "frontend_question_id": "1616", "is_new_question": false @@ -28992,9 +29643,9 @@ "question__title": "Maximal Network Rank", "question__title_slug": "maximal-network-rank", "question__hide": false, - "total_acs": 32091, - "total_submitted": 53387, - "total_column_articles": 289, + "total_acs": 32197, + "total_submitted": 53544, + "total_column_articles": 291, "frontend_question_id": "1615", "is_new_question": false }, @@ -29013,9 +29664,9 @@ "question__title": "Maximum Nesting Depth of the Parentheses", "question__title_slug": "maximum-nesting-depth-of-the-parentheses", "question__hide": false, - "total_acs": 62425, - "total_submitted": 75625, - "total_column_articles": 825, + "total_acs": 62723, + "total_submitted": 76015, + "total_column_articles": 828, "frontend_question_id": "1614", "is_new_question": false }, @@ -29034,8 +29685,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": 768, - "total_submitted": 1126, + "total_acs": 776, + "total_submitted": 1136, "total_column_articles": 32, "frontend_question_id": "1597", "is_new_question": false @@ -29055,8 +29706,8 @@ "question__title": "The Most Frequently Ordered Products for Each Customer", "question__title_slug": "the-most-frequently-ordered-products-for-each-customer", "question__hide": false, - "total_acs": 7203, - "total_submitted": 9816, + "total_acs": 7307, + "total_submitted": 9950, "total_column_articles": 91, "frontend_question_id": "1596", "is_new_question": false @@ -29076,8 +29727,8 @@ "question__title": "Bank Account Summary II", "question__title_slug": "bank-account-summary-ii", "question__hide": false, - "total_acs": 27505, - "total_submitted": 34197, + "total_acs": 27815, + "total_submitted": 34598, "total_column_articles": 153, "frontend_question_id": "1587", "is_new_question": false @@ -29097,8 +29748,8 @@ "question__title": "Maximum Number of Visible Points", "question__title_slug": "maximum-number-of-visible-points", "question__hide": false, - "total_acs": 17548, - "total_submitted": 39522, + "total_acs": 17564, + "total_submitted": 39554, "total_column_articles": 161, "frontend_question_id": "1610", "is_new_question": false @@ -29118,8 +29769,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": 3185, - "total_submitted": 5196, + "total_acs": 3204, + "total_submitted": 5223, "total_column_articles": 72, "frontend_question_id": "1611", "is_new_question": false @@ -29139,8 +29790,8 @@ "question__title": "Even Odd Tree", "question__title_slug": "even-odd-tree", "question__hide": false, - "total_acs": 32752, - "total_submitted": 56368, + "total_acs": 32822, + "total_submitted": 56480, "total_column_articles": 498, "frontend_question_id": "1609", "is_new_question": false @@ -29160,8 +29811,8 @@ "question__title": "Special Array With X Elements Greater Than or Equal X", "question__title_slug": "special-array-with-x-elements-greater-than-or-equal-x", "question__hide": false, - "total_acs": 54014, - "total_submitted": 87939, + "total_acs": 54104, + "total_submitted": 88098, "total_column_articles": 806, "frontend_question_id": "1608", "is_new_question": false @@ -29181,8 +29832,8 @@ "question__title": "Binary Search Tree Iterator II", "question__title_slug": "binary-search-tree-iterator-ii", "question__hide": false, - "total_acs": 832, - "total_submitted": 1323, + "total_acs": 838, + "total_submitted": 1329, "total_column_articles": 40, "frontend_question_id": "1586", "is_new_question": false @@ -29202,8 +29853,8 @@ "question__title": "Fancy Sequence", "question__title_slug": "fancy-sequence", "question__hide": false, - "total_acs": 4921, - "total_submitted": 29111, + "total_acs": 4967, + "total_submitted": 29243, "total_column_articles": 107, "frontend_question_id": "1622", "is_new_question": false @@ -29223,8 +29874,8 @@ "question__title": "Cat and Mouse II", "question__title_slug": "cat-and-mouse-ii", "question__hide": false, - "total_acs": 13675, - "total_submitted": 21324, + "total_acs": 13677, + "total_submitted": 21326, "total_column_articles": 84, "frontend_question_id": "1728", "is_new_question": false @@ -29244,8 +29895,8 @@ "question__title": "Coordinate With Maximum Network Quality", "question__title_slug": "coordinate-with-maximum-network-quality", "question__hide": false, - "total_acs": 28958, - "total_submitted": 62841, + "total_acs": 28970, + "total_submitted": 62900, "total_column_articles": 282, "frontend_question_id": "1620", "is_new_question": false @@ -29265,8 +29916,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": 2954, - "total_submitted": 6173, + "total_acs": 2972, + "total_submitted": 6201, "total_column_articles": 56, "frontend_question_id": "1621", "is_new_question": false @@ -29286,9 +29937,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": 42496, - "total_submitted": 52942, - "total_column_articles": 269, + "total_acs": 43503, + "total_submitted": 54313, + "total_column_articles": 276, "frontend_question_id": "1581", "is_new_question": false }, @@ -29307,8 +29958,8 @@ "question__title": "Maximum Number of Achievable Transfer Requests", "question__title_slug": "maximum-number-of-achievable-transfer-requests", "question__hide": false, - "total_acs": 21870, - "total_submitted": 35363, + "total_acs": 21909, + "total_submitted": 35429, "total_column_articles": 242, "frontend_question_id": "1601", "is_new_question": false @@ -29328,8 +29979,8 @@ "question__title": "Throne Inheritance", "question__title_slug": "throne-inheritance", "question__hide": false, - "total_acs": 19156, - "total_submitted": 29164, + "total_acs": 19188, + "total_submitted": 29209, "total_column_articles": 234, "frontend_question_id": "1600", "is_new_question": false @@ -29349,8 +30000,8 @@ "question__title": "Maximum Profit of Operating a Centennial Wheel", "question__title_slug": "maximum-profit-of-operating-a-centennial-wheel", "question__hide": false, - "total_acs": 22282, - "total_submitted": 43267, + "total_acs": 22298, + "total_submitted": 43315, "total_column_articles": 269, "frontend_question_id": "1599", "is_new_question": false @@ -29370,8 +30021,8 @@ "question__title": "Crawler Log Folder", "question__title_slug": "crawler-log-folder", "question__hide": false, - "total_acs": 44029, - "total_submitted": 63290, + "total_acs": 44096, + "total_submitted": 63381, "total_column_articles": 557, "frontend_question_id": "1598", "is_new_question": false @@ -29391,8 +30042,8 @@ "question__title": "Put Boxes Into the Warehouse II", "question__title_slug": "put-boxes-into-the-warehouse-ii", "question__hide": false, - "total_acs": 577, - "total_submitted": 979, + "total_acs": 582, + "total_submitted": 984, "total_column_articles": 31, "frontend_question_id": "1580", "is_new_question": false @@ -29412,8 +30063,8 @@ "question__title": "Warehouse Manager", "question__title_slug": "warehouse-manager", "question__hide": false, - "total_acs": 11064, - "total_submitted": 14226, + "total_acs": 11166, + "total_submitted": 14352, "total_column_articles": 93, "frontend_question_id": "1571", "is_new_question": false @@ -29433,9 +30084,9 @@ "question__title": "Minimum Cost to Connect Two Groups of Points", "question__title_slug": "minimum-cost-to-connect-two-groups-of-points", "question__hide": false, - "total_acs": 3004, - "total_submitted": 6001, - "total_column_articles": 50, + "total_acs": 3029, + "total_submitted": 6041, + "total_column_articles": 51, "frontend_question_id": "1595", "is_new_question": false }, @@ -29454,9 +30105,9 @@ "question__title": "Maximum Non Negative Product in a Matrix", "question__title_slug": "maximum-non-negative-product-in-a-matrix", "question__hide": false, - "total_acs": 6283, - "total_submitted": 18721, - "total_column_articles": 128, + "total_acs": 6324, + "total_submitted": 18812, + "total_column_articles": 129, "frontend_question_id": "1594", "is_new_question": false }, @@ -29475,8 +30126,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": 8850, - "total_submitted": 15473, + "total_acs": 8907, + "total_submitted": 15565, "total_column_articles": 141, "frontend_question_id": "1593", "is_new_question": false @@ -29496,8 +30147,8 @@ "question__title": "Rearrange Spaces Between Words", "question__title_slug": "rearrange-spaces-between-words", "question__hide": false, - "total_acs": 40658, - "total_submitted": 86910, + "total_acs": 40726, + "total_submitted": 87104, "total_column_articles": 578, "frontend_question_id": "1592", "is_new_question": false @@ -29517,8 +30168,8 @@ "question__title": "Dot Product of Two Sparse Vectors", "question__title_slug": "dot-product-of-two-sparse-vectors", "question__hide": false, - "total_acs": 4138, - "total_submitted": 4647, + "total_acs": 4156, + "total_submitted": 4679, "total_column_articles": 59, "frontend_question_id": "1570", "is_new_question": false @@ -29538,8 +30189,8 @@ "question__title": "Unique Orders and Customers Per Month", "question__title_slug": "unique-orders-and-customers-per-month", "question__hide": false, - "total_acs": 6027, - "total_submitted": 8157, + "total_acs": 6054, + "total_submitted": 8190, "total_column_articles": 55, "frontend_question_id": "1565", "is_new_question": false @@ -29559,8 +30210,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": 27084, - "total_submitted": 33500, + "total_acs": 27144, + "total_submitted": 33570, "total_column_articles": 273, "frontend_question_id": "1605", "is_new_question": false @@ -29580,9 +30231,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": 20988, - "total_submitted": 43380, - "total_column_articles": 200, + "total_acs": 21104, + "total_submitted": 43545, + "total_column_articles": 204, "frontend_question_id": "1606", "is_new_question": false }, @@ -29601,8 +30252,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": 28691, - "total_submitted": 56896, + "total_acs": 28739, + "total_submitted": 56990, "total_column_articles": 346, "frontend_question_id": "1604", "is_new_question": false @@ -29622,9 +30273,9 @@ "question__title": "Design Parking System", "question__title_slug": "design-parking-system", "question__hide": false, - "total_acs": 75317, - "total_submitted": 89852, - "total_column_articles": 579, + "total_acs": 75567, + "total_submitted": 90189, + "total_column_articles": 582, "frontend_question_id": "1603", "is_new_question": false }, @@ -29643,8 +30294,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": 3316, - "total_submitted": 7616, + "total_acs": 3330, + "total_submitted": 7651, "total_column_articles": 53, "frontend_question_id": "1585", "is_new_question": false @@ -29664,9 +30315,9 @@ "question__title": "Min Cost to Connect All Points", "question__title_slug": "min-cost-to-connect-all-points", "question__hide": false, - "total_acs": 49301, - "total_submitted": 74867, - "total_column_articles": 621, + "total_acs": 49873, + "total_submitted": 75777, + "total_column_articles": 625, "frontend_question_id": "1584", "is_new_question": false }, @@ -29685,8 +30336,8 @@ "question__title": "Count Unhappy Friends", "question__title_slug": "count-unhappy-friends", "question__hide": false, - "total_acs": 20521, - "total_submitted": 30213, + "total_acs": 20532, + "total_submitted": 30236, "total_column_articles": 256, "frontend_question_id": "1583", "is_new_question": false @@ -29706,8 +30357,8 @@ "question__title": "Special Positions in a Binary Matrix", "question__title_slug": "special-positions-in-a-binary-matrix", "question__hide": false, - "total_acs": 41106, - "total_submitted": 59144, + "total_acs": 41167, + "total_submitted": 59228, "total_column_articles": 466, "frontend_question_id": "1582", "is_new_question": false @@ -29727,8 +30378,8 @@ "question__title": "Put Boxes Into the Warehouse I", "question__title_slug": "put-boxes-into-the-warehouse-i", "question__hide": false, - "total_acs": 1095, - "total_submitted": 1897, + "total_acs": 1099, + "total_submitted": 1904, "total_column_articles": 41, "frontend_question_id": "1564", "is_new_question": false @@ -29748,8 +30399,8 @@ "question__title": "Bank Account Summary", "question__title_slug": "bank-account-summary", "question__hide": false, - "total_acs": 5241, - "total_submitted": 11707, + "total_acs": 5276, + "total_submitted": 11781, "total_column_articles": 75, "frontend_question_id": "1555", "is_new_question": false @@ -29769,9 +30420,9 @@ "question__title": "Remove Max Number of Edges to Keep Graph Fully Traversable", "question__title_slug": "remove-max-number-of-edges-to-keep-graph-fully-traversable", "question__hide": false, - "total_acs": 18517, - "total_submitted": 29846, - "total_column_articles": 327, + "total_acs": 18555, + "total_submitted": 29911, + "total_column_articles": 328, "frontend_question_id": "1579", "is_new_question": false }, @@ -29790,8 +30441,8 @@ "question__title": "Minimum Time to Make Rope Colorful", "question__title_slug": "minimum-time-to-make-rope-colorful", "question__hide": false, - "total_acs": 15286, - "total_submitted": 25626, + "total_acs": 15335, + "total_submitted": 25714, "total_column_articles": 262, "frontend_question_id": "1578", "is_new_question": false @@ -29811,8 +30462,8 @@ "question__title": "Number of Ways Where Square of Number Is Equal to Product of Two Numbers", "question__title_slug": "number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers", "question__hide": false, - "total_acs": 6770, - "total_submitted": 19620, + "total_acs": 6813, + "total_submitted": 19734, "total_column_articles": 108, "frontend_question_id": "1577", "is_new_question": false @@ -29832,9 +30483,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": 52384, - "total_submitted": 102780, - "total_column_articles": 646, + "total_acs": 52455, + "total_submitted": 102933, + "total_column_articles": 648, "frontend_question_id": "1576", "is_new_question": false }, @@ -29853,8 +30504,8 @@ "question__title": "Strings Differ by One Character", "question__title_slug": "strings-differ-by-one-character", "question__hide": false, - "total_acs": 1207, - "total_submitted": 2376, + "total_acs": 1208, + "total_submitted": 2384, "total_column_articles": 33, "frontend_question_id": "1554", "is_new_question": false @@ -29874,8 +30525,8 @@ "question__title": "Strange Printer II", "question__title_slug": "strange-printer-ii", "question__hide": false, - "total_acs": 2315, - "total_submitted": 3639, + "total_acs": 2337, + "total_submitted": 3676, "total_column_articles": 66, "frontend_question_id": "1591", "is_new_question": false @@ -29895,8 +30546,8 @@ "question__title": "Maximum Sum Obtained of Any Permutation", "question__title_slug": "maximum-sum-obtained-of-any-permutation", "question__hide": false, - "total_acs": 6345, - "total_submitted": 19719, + "total_acs": 6375, + "total_submitted": 19793, "total_column_articles": 94, "frontend_question_id": "1589", "is_new_question": false @@ -29916,8 +30567,8 @@ "question__title": "Make Sum Divisible by P", "question__title_slug": "make-sum-divisible-by-p", "question__hide": false, - "total_acs": 25354, - "total_submitted": 69685, + "total_acs": 25415, + "total_submitted": 69832, "total_column_articles": 193, "frontend_question_id": "1590", "is_new_question": false @@ -29937,9 +30588,9 @@ "question__title": "Sum of All Odd Length Subarrays", "question__title_slug": "sum-of-all-odd-length-subarrays", "question__hide": false, - "total_acs": 65310, - "total_submitted": 78463, - "total_column_articles": 977, + "total_acs": 65569, + "total_submitted": 78770, + "total_column_articles": 981, "frontend_question_id": "1588", "is_new_question": false }, @@ -29958,8 +30609,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": 3119, - "total_submitted": 6424, + "total_acs": 3142, + "total_submitted": 6464, "total_column_articles": 64, "frontend_question_id": "1569", "is_new_question": false @@ -29979,8 +30630,8 @@ "question__title": "Minimum Number of Days to Disconnect Island", "question__title_slug": "minimum-number-of-days-to-disconnect-island", "question__hide": false, - "total_acs": 3849, - "total_submitted": 8511, + "total_acs": 3889, + "total_submitted": 8626, "total_column_articles": 80, "frontend_question_id": "1568", "is_new_question": false @@ -30000,9 +30651,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": 33858, - "total_submitted": 79444, - "total_column_articles": 461, + "total_acs": 33925, + "total_submitted": 79611, + "total_column_articles": 463, "frontend_question_id": "1567", "is_new_question": false }, @@ -30021,9 +30672,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": 12201, - "total_submitted": 27613, - "total_column_articles": 182, + "total_acs": 12259, + "total_submitted": 27729, + "total_column_articles": 183, "frontend_question_id": "1566", "is_new_question": false }, @@ -30042,8 +30693,8 @@ "question__title": "The Most Recent Orders for Each Product", "question__title_slug": "the-most-recent-orders-for-each-product", "question__hide": false, - "total_acs": 8994, - "total_submitted": 13305, + "total_acs": 9081, + "total_submitted": 13428, "total_column_articles": 119, "frontend_question_id": "1549", "is_new_question": false @@ -30063,8 +30714,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": 619, - "total_submitted": 914, + "total_acs": 625, + "total_submitted": 921, "total_column_articles": 24, "frontend_question_id": "1548", "is_new_question": false @@ -30084,8 +30735,8 @@ "question__title": "Fix Product Name Format", "question__title_slug": "fix-product-name-format", "question__hide": false, - "total_acs": 5620, - "total_submitted": 10144, + "total_acs": 5640, + "total_submitted": 10186, "total_column_articles": 56, "frontend_question_id": "1543", "is_new_question": false @@ -30105,8 +30756,8 @@ "question__title": "Stone Game V", "question__title_slug": "stone-game-v", "question__hide": false, - "total_acs": 5647, - "total_submitted": 14269, + "total_acs": 5685, + "total_submitted": 14341, "total_column_articles": 79, "frontend_question_id": "1563", "is_new_question": false @@ -30126,8 +30777,8 @@ "question__title": "Find Latest Group of Size M", "question__title_slug": "find-latest-group-of-size-m", "question__hide": false, - "total_acs": 6815, - "total_submitted": 18766, + "total_acs": 6850, + "total_submitted": 18829, "total_column_articles": 129, "frontend_question_id": "1562", "is_new_question": false @@ -30147,9 +30798,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": 16388, - "total_submitted": 21099, - "total_column_articles": 244, + "total_acs": 16460, + "total_submitted": 21188, + "total_column_articles": 246, "frontend_question_id": "1561", "is_new_question": false }, @@ -30168,8 +30819,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": 11769, - "total_submitted": 20493, + "total_acs": 11809, + "total_submitted": 20561, "total_column_articles": 130, "frontend_question_id": "1560", "is_new_question": false @@ -30189,8 +30840,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": 305, - "total_submitted": 550, + "total_acs": 326, + "total_submitted": 577, "total_column_articles": 12, "frontend_question_id": "1538", "is_new_question": false @@ -30210,9 +30861,9 @@ "question__title": "Count All Possible Routes", "question__title_slug": "count-all-possible-routes", "question__hide": false, - "total_acs": 11293, - "total_submitted": 19580, - "total_column_articles": 122, + "total_acs": 11386, + "total_submitted": 19750, + "total_column_articles": 123, "frontend_question_id": "1575", "is_new_question": false }, @@ -30231,8 +30882,8 @@ "question__title": "Shortest Subarray to be Removed to Make Array Sorted", "question__title_slug": "shortest-subarray-to-be-removed-to-make-array-sorted", "question__hide": false, - "total_acs": 26244, - "total_submitted": 60744, + "total_acs": 26309, + "total_submitted": 60889, "total_column_articles": 281, "frontend_question_id": "1574", "is_new_question": false @@ -30252,9 +30903,9 @@ "question__title": "Number of Ways to Split a String", "question__title_slug": "number-of-ways-to-split-a-string", "question__hide": false, - "total_acs": 6520, - "total_submitted": 21000, - "total_column_articles": 90, + "total_acs": 6563, + "total_submitted": 21107, + "total_column_articles": 91, "frontend_question_id": "1573", "is_new_question": false }, @@ -30273,9 +30924,9 @@ "question__title": "Matrix Diagonal Sum", "question__title_slug": "matrix-diagonal-sum", "question__hide": false, - "total_acs": 35395, - "total_submitted": 43875, - "total_column_articles": 569, + "total_acs": 35650, + "total_submitted": 44172, + "total_column_articles": 574, "frontend_question_id": "1572", "is_new_question": false }, @@ -30294,8 +30945,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": 10737, - "total_submitted": 33182, + "total_acs": 10775, + "total_submitted": 33251, "total_column_articles": 149, "frontend_question_id": "1553", "is_new_question": false @@ -30315,8 +30966,8 @@ "question__title": "Magnetic Force Between Two Balls", "question__title_slug": "magnetic-force-between-two-balls", "question__hide": false, - "total_acs": 17051, - "total_submitted": 30146, + "total_acs": 17140, + "total_submitted": 30275, "total_column_articles": 221, "frontend_question_id": "1552", "is_new_question": false @@ -30336,9 +30987,9 @@ "question__title": "Minimum Operations to Make Array Equal", "question__title_slug": "minimum-operations-to-make-array-equal", "question__hide": false, - "total_acs": 14970, - "total_submitted": 18234, - "total_column_articles": 220, + "total_acs": 15042, + "total_submitted": 18321, + "total_column_articles": 221, "frontend_question_id": "1551", "is_new_question": false }, @@ -30357,9 +31008,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": 954, - "total_submitted": 1629, - "total_column_articles": 40, + "total_acs": 992, + "total_submitted": 1675, + "total_column_articles": 41, "frontend_question_id": "1533", "is_new_question": false }, @@ -30378,8 +31029,8 @@ "question__title": "The Most Recent Three Orders", "question__title_slug": "the-most-recent-three-orders", "question__hide": false, - "total_acs": 7361, - "total_submitted": 11720, + "total_acs": 7460, + "total_submitted": 11848, "total_column_articles": 94, "frontend_question_id": "1532", "is_new_question": false @@ -30399,9 +31050,9 @@ "question__title": "Patients With a Condition", "question__title_slug": "patients-with-a-condition", "question__hide": false, - "total_acs": 52929, - "total_submitted": 113261, - "total_column_articles": 255, + "total_acs": 53338, + "total_submitted": 114159, + "total_column_articles": 258, "frontend_question_id": "1527", "is_new_question": false }, @@ -30420,9 +31071,9 @@ "question__title": "Minimum Cost to Cut a Stick", "question__title_slug": "minimum-cost-to-cut-a-stick", "question__hide": false, - "total_acs": 6390, - "total_submitted": 11317, - "total_column_articles": 104, + "total_acs": 6442, + "total_submitted": 11406, + "total_column_articles": 106, "frontend_question_id": "1547", "is_new_question": false }, @@ -30441,8 +31092,8 @@ "question__title": "Find Longest Awesome Substring", "question__title_slug": "find-longest-awesome-substring", "question__hide": false, - "total_acs": 4096, - "total_submitted": 9475, + "total_acs": 4118, + "total_submitted": 9503, "total_column_articles": 74, "frontend_question_id": "1542", "is_new_question": false @@ -30462,9 +31113,9 @@ "question__title": "Find Kth Bit in Nth Binary String", "question__title_slug": "find-kth-bit-in-nth-binary-string", "question__hide": false, - "total_acs": 14803, - "total_submitted": 25141, - "total_column_articles": 189, + "total_acs": 14873, + "total_submitted": 25237, + "total_column_articles": 190, "frontend_question_id": "1545", "is_new_question": false }, @@ -30483,9 +31134,9 @@ "question__title": "Make The String Great", "question__title_slug": "make-the-string-great", "question__hide": false, - "total_acs": 28264, - "total_submitted": 50617, - "total_column_articles": 446, + "total_acs": 28362, + "total_submitted": 50777, + "total_column_articles": 448, "frontend_question_id": "1544", "is_new_question": false }, @@ -30504,8 +31155,8 @@ "question__title": "Diameter of N-Ary Tree", "question__title_slug": "diameter-of-n-ary-tree", "question__hide": false, - "total_acs": 2304, - "total_submitted": 3235, + "total_acs": 2338, + "total_submitted": 3278, "total_column_articles": 59, "frontend_question_id": "1522", "is_new_question": false @@ -30525,9 +31176,9 @@ "question__title": "Find Users With Valid E-Mails", "question__title_slug": "find-users-with-valid-e-mails", "question__hide": false, - "total_acs": 6879, - "total_submitted": 13236, - "total_column_articles": 58, + "total_acs": 7222, + "total_submitted": 14001, + "total_column_articles": 60, "frontend_question_id": "1517", "is_new_question": false }, @@ -30546,8 +31197,8 @@ "question__title": "Detect Cycles in 2D Grid", "question__title_slug": "detect-cycles-in-2d-grid", "question__hide": false, - "total_acs": 6690, - "total_submitted": 16644, + "total_acs": 6725, + "total_submitted": 16707, "total_column_articles": 111, "frontend_question_id": "1559", "is_new_question": false @@ -30567,8 +31218,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": 6305, - "total_submitted": 10023, + "total_acs": 6326, + "total_submitted": 10050, "total_column_articles": 97, "frontend_question_id": "1558", "is_new_question": false @@ -30588,9 +31239,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": 18062, - "total_submitted": 22214, - "total_column_articles": 233, + "total_acs": 18233, + "total_submitted": 22404, + "total_column_articles": 234, "frontend_question_id": "1557", "is_new_question": false }, @@ -30609,8 +31260,8 @@ "question__title": "Thousand Separator", "question__title_slug": "thousand-separator", "question__hide": false, - "total_acs": 19163, - "total_submitted": 34078, + "total_acs": 19339, + "total_submitted": 34391, "total_column_articles": 297, "frontend_question_id": "1556", "is_new_question": false @@ -30630,9 +31281,9 @@ "question__title": "Get the Maximum Score", "question__title_slug": "get-the-maximum-score", "question__hide": false, - "total_acs": 6701, - "total_submitted": 16797, - "total_column_articles": 129, + "total_acs": 6742, + "total_submitted": 16880, + "total_column_articles": 130, "frontend_question_id": "1537", "is_new_question": false }, @@ -30651,8 +31302,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": 5271, - "total_submitted": 11443, + "total_acs": 5283, + "total_submitted": 11459, "total_column_articles": 96, "frontend_question_id": "1536", "is_new_question": false @@ -30672,9 +31323,9 @@ "question__title": "Find the Winner of an Array Game", "question__title_slug": "find-the-winner-of-an-array-game", "question__hide": false, - "total_acs": 16598, - "total_submitted": 35992, - "total_column_articles": 220, + "total_acs": 16641, + "total_submitted": 36080, + "total_column_articles": 221, "frontend_question_id": "1535", "is_new_question": false }, @@ -30693,9 +31344,9 @@ "question__title": "Count Good Triplets", "question__title_slug": "count-good-triplets", "question__hide": false, - "total_acs": 25551, - "total_submitted": 32984, - "total_column_articles": 240, + "total_acs": 25805, + "total_submitted": 33295, + "total_column_articles": 243, "frontend_question_id": "1534", "is_new_question": false }, @@ -30714,9 +31365,9 @@ "question__title": "Move Sub-Tree of N-Ary Tree", "question__title_slug": "move-sub-tree-of-n-ary-tree", "question__hide": false, - "total_acs": 391, - "total_submitted": 700, - "total_column_articles": 17, + "total_acs": 399, + "total_submitted": 714, + "total_column_articles": 18, "frontend_question_id": "1516", "is_new_question": false }, @@ -30735,9 +31386,9 @@ "question__title": "Customer Order Frequency", "question__title_slug": "customer-order-frequency", "question__hide": false, - "total_acs": 8101, - "total_submitted": 11782, - "total_column_articles": 96, + "total_acs": 8193, + "total_submitted": 11912, + "total_column_articles": 97, "frontend_question_id": "1511", "is_new_question": false }, @@ -30756,8 +31407,8 @@ "question__title": "Number of Good Leaf Nodes Pairs", "question__title_slug": "number-of-good-leaf-nodes-pairs", "question__hide": false, - "total_acs": 11185, - "total_submitted": 19180, + "total_acs": 11245, + "total_submitted": 19262, "total_column_articles": 202, "frontend_question_id": "1530", "is_new_question": false @@ -30777,9 +31428,9 @@ "question__title": "Minimum Suffix Flips", "question__title_slug": "minimum-suffix-flips", "question__hide": false, - "total_acs": 11360, - "total_submitted": 16177, - "total_column_articles": 180, + "total_acs": 11391, + "total_submitted": 16214, + "total_column_articles": 181, "frontend_question_id": "1529", "is_new_question": false }, @@ -30798,9 +31449,9 @@ "question__title": "Shuffle String", "question__title_slug": "shuffle-string", "question__hide": false, - "total_acs": 38535, - "total_submitted": 49150, - "total_column_articles": 479, + "total_acs": 38665, + "total_submitted": 49316, + "total_column_articles": 483, "frontend_question_id": "1528", "is_new_question": false }, @@ -30819,8 +31470,8 @@ "question__title": "Find Root of N-Ary Tree", "question__title_slug": "find-root-of-n-ary-tree", "question__hide": false, - "total_acs": 1097, - "total_submitted": 1361, + "total_acs": 1133, + "total_submitted": 1403, "total_column_articles": 31, "frontend_question_id": "1506", "is_new_question": false @@ -30840,8 +31491,8 @@ "question__title": "Maximum Number of Non-Overlapping Subarrays With Sum Equals Target", "question__title_slug": "maximum-number-of-non-overlapping-subarrays-with-sum-equals-target", "question__hide": false, - "total_acs": 7241, - "total_submitted": 16224, + "total_acs": 7273, + "total_submitted": 16278, "total_column_articles": 109, "frontend_question_id": "1546", "is_new_question": false @@ -30861,8 +31512,8 @@ "question__title": "Minimum Insertions to Balance a Parentheses String", "question__title_slug": "minimum-insertions-to-balance-a-parentheses-string", "question__hide": false, - "total_acs": 17987, - "total_submitted": 36878, + "total_acs": 18160, + "total_submitted": 37223, "total_column_articles": 222, "frontend_question_id": "1541", "is_new_question": false @@ -30882,9 +31533,9 @@ "question__title": "Can Convert String in K Moves", "question__title_slug": "can-convert-string-in-k-moves", "question__hide": false, - "total_acs": 6617, - "total_submitted": 19825, - "total_column_articles": 109, + "total_acs": 6636, + "total_submitted": 19870, + "total_column_articles": 111, "frontend_question_id": "1540", "is_new_question": false }, @@ -30903,9 +31554,9 @@ "question__title": "Kth Missing Positive Number", "question__title_slug": "kth-missing-positive-number", "question__hide": false, - "total_acs": 40406, - "total_submitted": 74773, - "total_column_articles": 556, + "total_acs": 40760, + "total_submitted": 75493, + "total_column_articles": 559, "frontend_question_id": "1539", "is_new_question": false }, @@ -30924,8 +31575,8 @@ "question__title": "Find a Value of a Mysterious Function Closest to Target", "question__title_slug": "find-a-value-of-a-mysterious-function-closest-to-target", "question__hide": false, - "total_acs": 4019, - "total_submitted": 9333, + "total_acs": 4044, + "total_submitted": 9365, "total_column_articles": 77, "frontend_question_id": "1521", "is_new_question": false @@ -30945,8 +31596,8 @@ "question__title": "Maximum Number of Non-Overlapping Substrings", "question__title_slug": "maximum-number-of-non-overlapping-substrings", "question__hide": false, - "total_acs": 3335, - "total_submitted": 9387, + "total_acs": 3351, + "total_submitted": 9428, "total_column_articles": 87, "frontend_question_id": "1520", "is_new_question": false @@ -30966,8 +31617,8 @@ "question__title": "Number of Nodes in the Sub-Tree With the Same Label", "question__title_slug": "number-of-nodes-in-the-sub-tree-with-the-same-label", "question__hide": false, - "total_acs": 7350, - "total_submitted": 22249, + "total_acs": 7373, + "total_submitted": 22285, "total_column_articles": 150, "frontend_question_id": "1519", "is_new_question": false @@ -30987,9 +31638,9 @@ "question__title": "Water Bottles", "question__title_slug": "water-bottles", "question__hide": false, - "total_acs": 61471, - "total_submitted": 88345, - "total_column_articles": 913, + "total_acs": 61642, + "total_submitted": 88594, + "total_column_articles": 914, "frontend_question_id": "1518", "is_new_question": false }, @@ -31008,9 +31659,9 @@ "question__title": "Countries You Can Safely Invest In", "question__title_slug": "countries-you-can-safely-invest-in", "question__hide": false, - "total_acs": 12952, - "total_submitted": 21926, - "total_column_articles": 143, + "total_acs": 13052, + "total_submitted": 22178, + "total_column_articles": 145, "frontend_question_id": "1501", "is_new_question": false }, @@ -31029,8 +31680,8 @@ "question__title": "Design a File Sharing System", "question__title_slug": "design-a-file-sharing-system", "question__hide": false, - "total_acs": 1916, - "total_submitted": 6467, + "total_acs": 1926, + "total_submitted": 6491, "total_column_articles": 51, "frontend_question_id": "1500", "is_new_question": false @@ -31050,8 +31701,8 @@ "question__title": "Friendly Movies Streamed Last Month", "question__title_slug": "friendly-movies-streamed-last-month", "question__hide": false, - "total_acs": 7041, - "total_submitted": 13184, + "total_acs": 7113, + "total_submitted": 13309, "total_column_articles": 48, "frontend_question_id": "1495", "is_new_question": false @@ -31071,8 +31722,8 @@ "question__title": "Best Position for a Service Centre", "question__title_slug": "best-position-for-a-service-centre", "question__hide": false, - "total_acs": 4464, - "total_submitted": 12617, + "total_acs": 4479, + "total_submitted": 12758, "total_column_articles": 72, "frontend_question_id": "1515", "is_new_question": false @@ -31092,9 +31743,9 @@ "question__title": "String Compression II", "question__title_slug": "string-compression-ii", "question__hide": false, - "total_acs": 2816, - "total_submitted": 7427, - "total_column_articles": 47, + "total_acs": 2823, + "total_submitted": 7440, + "total_column_articles": 48, "frontend_question_id": "1531", "is_new_question": false }, @@ -31113,9 +31764,9 @@ "question__title": "Number of Substrings With Only 1s", "question__title_slug": "number-of-substrings-with-only-1s", "question__hide": false, - "total_acs": 14227, - "total_submitted": 36076, - "total_column_articles": 198, + "total_acs": 14329, + "total_submitted": 36274, + "total_column_articles": 199, "frontend_question_id": "1513", "is_new_question": false }, @@ -31134,9 +31785,9 @@ "question__title": "Number of Good Pairs", "question__title_slug": "number-of-good-pairs", "question__hide": false, - "total_acs": 74424, - "total_submitted": 88105, - "total_column_articles": 948, + "total_acs": 74940, + "total_submitted": 88715, + "total_column_articles": 956, "frontend_question_id": "1512", "is_new_question": false }, @@ -31155,9 +31806,9 @@ "question__title": "Clone N-ary Tree", "question__title_slug": "clone-n-ary-tree", "question__hide": false, - "total_acs": 1933, - "total_submitted": 2308, - "total_column_articles": 48, + "total_acs": 1971, + "total_submitted": 2354, + "total_column_articles": 49, "frontend_question_id": "1490", "is_new_question": false }, @@ -31176,9 +31827,9 @@ "question__title": "Minimum Number of Increments on Subarrays to Form a Target Array", "question__title_slug": "minimum-number-of-increments-on-subarrays-to-form-a-target-array", "question__hide": false, - "total_acs": 5020, - "total_submitted": 7744, - "total_column_articles": 87, + "total_acs": 5045, + "total_submitted": 7787, + "total_column_articles": 88, "frontend_question_id": "1526", "is_new_question": false }, @@ -31197,9 +31848,9 @@ "question__title": "Number of Good Ways to Split a String", "question__title_slug": "number-of-good-ways-to-split-a-string", "question__hide": false, - "total_acs": 8340, - "total_submitted": 12607, - "total_column_articles": 156, + "total_acs": 8401, + "total_submitted": 12700, + "total_column_articles": 157, "frontend_question_id": "1525", "is_new_question": false }, @@ -31218,8 +31869,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": 9331, - "total_submitted": 20431, + "total_acs": 9369, + "total_submitted": 20518, "total_column_articles": 165, "frontend_question_id": "1524", "is_new_question": false @@ -31239,8 +31890,8 @@ "question__title": "Count Odd Numbers in an Interval Range", "question__title_slug": "count-odd-numbers-in-an-interval-range", "question__hide": false, - "total_acs": 48540, - "total_submitted": 98811, + "total_acs": 48667, + "total_submitted": 99026, "total_column_articles": 705, "frontend_question_id": "1523", "is_new_question": false @@ -31260,8 +31911,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": 4535, - "total_submitted": 11506, + "total_acs": 4557, + "total_submitted": 11545, "total_column_articles": 93, "frontend_question_id": "1505", "is_new_question": false @@ -31281,8 +31932,8 @@ "question__title": "Count Submatrices With All Ones", "question__title_slug": "count-submatrices-with-all-ones", "question__hide": false, - "total_acs": 11483, - "total_submitted": 18411, + "total_acs": 11541, + "total_submitted": 18486, "total_column_articles": 172, "frontend_question_id": "1504", "is_new_question": false @@ -31302,8 +31953,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": 11497, - "total_submitted": 21537, + "total_acs": 11527, + "total_submitted": 21578, "total_column_articles": 117, "frontend_question_id": "1503", "is_new_question": false @@ -31323,8 +31974,8 @@ "question__title": "Can Make Arithmetic Progression From Sequence", "question__title_slug": "can-make-arithmetic-progression-from-sequence", "question__hide": false, - "total_acs": 45435, - "total_submitted": 65471, + "total_acs": 45564, + "total_submitted": 65655, "total_column_articles": 589, "frontend_question_id": "1502", "is_new_question": false @@ -31344,9 +31995,9 @@ "question__title": "Group Sold Products By The Date", "question__title_slug": "group-sold-products-by-the-date", "question__hide": false, - "total_acs": 53044, - "total_submitted": 78276, - "total_column_articles": 289, + "total_acs": 53428, + "total_submitted": 78851, + "total_column_articles": 290, "frontend_question_id": "1484", "is_new_question": false }, @@ -31365,8 +32016,8 @@ "question__title": "Clone Binary Tree With Random Pointer", "question__title_slug": "clone-binary-tree-with-random-pointer", "question__hide": false, - "total_acs": 1440, - "total_submitted": 1833, + "total_acs": 1454, + "total_submitted": 1851, "total_column_articles": 39, "frontend_question_id": "1485", "is_new_question": false @@ -31386,9 +32037,9 @@ "question__title": "Sales by Day of the Week", "question__title_slug": "sales-by-day-of-the-week", "question__hide": false, - "total_acs": 3812, - "total_submitted": 6845, - "total_column_articles": 62, + "total_acs": 3840, + "total_submitted": 6886, + "total_column_articles": 63, "frontend_question_id": "1479", "is_new_question": false }, @@ -31407,8 +32058,8 @@ "question__title": "Max Value of Equation", "question__title_slug": "max-value-of-equation", "question__hide": false, - "total_acs": 4676, - "total_submitted": 11482, + "total_acs": 4711, + "total_submitted": 11545, "total_column_articles": 92, "frontend_question_id": "1499", "is_new_question": false @@ -31428,9 +32079,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": 9963, - "total_submitted": 26233, - "total_column_articles": 130, + "total_acs": 10141, + "total_submitted": 26602, + "total_column_articles": 131, "frontend_question_id": "1498", "is_new_question": false }, @@ -31449,8 +32100,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": 12727, - "total_submitted": 31753, + "total_acs": 12827, + "total_submitted": 31946, "total_column_articles": 151, "frontend_question_id": "1497", "is_new_question": false @@ -31470,9 +32121,9 @@ "question__title": "Path Crossing", "question__title_slug": "path-crossing", "question__hide": false, - "total_acs": 16248, - "total_submitted": 30399, - "total_column_articles": 245, + "total_acs": 16342, + "total_submitted": 30566, + "total_column_articles": 248, "frontend_question_id": "1496", "is_new_question": false }, @@ -31491,8 +32142,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": 3211, - "total_submitted": 4589, + "total_acs": 3283, + "total_submitted": 4712, "total_column_articles": 101, "frontend_question_id": "1474", "is_new_question": false @@ -31512,8 +32163,8 @@ "question__title": "Stone Game IV", "question__title_slug": "stone-game-iv", "question__hide": false, - "total_acs": 8227, - "total_submitted": 13698, + "total_acs": 8270, + "total_submitted": 13760, "total_column_articles": 105, "frontend_question_id": "1510", "is_new_question": false @@ -31533,8 +32184,8 @@ "question__title": "Minimum Difference Between Largest and Smallest Value in Three Moves", "question__title_slug": "minimum-difference-between-largest-and-smallest-value-in-three-moves", "question__hide": false, - "total_acs": 7808, - "total_submitted": 14108, + "total_acs": 7852, + "total_submitted": 14180, "total_column_articles": 136, "frontend_question_id": "1509", "is_new_question": false @@ -31554,9 +32205,9 @@ "question__title": "Range Sum of Sorted Subarray Sums", "question__title_slug": "range-sum-of-sorted-subarray-sums", "question__hide": false, - "total_acs": 10648, - "total_submitted": 18446, - "total_column_articles": 113, + "total_acs": 10686, + "total_submitted": 18500, + "total_column_articles": 114, "frontend_question_id": "1508", "is_new_question": false }, @@ -31575,8 +32226,8 @@ "question__title": "Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree", "question__title_slug": "find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree", "question__hide": false, - "total_acs": 13347, - "total_submitted": 20046, + "total_acs": 13377, + "total_submitted": 20090, "total_column_articles": 149, "frontend_question_id": "1489", "is_new_question": false @@ -31596,9 +32247,9 @@ "question__title": "Avoid Flood in The City", "question__title_slug": "avoid-flood-in-the-city", "question__hide": false, - "total_acs": 12263, - "total_submitted": 46589, - "total_column_articles": 171, + "total_acs": 12307, + "total_submitted": 46707, + "total_column_articles": 172, "frontend_question_id": "1488", "is_new_question": false }, @@ -31617,8 +32268,8 @@ "question__title": "Making File Names Unique", "question__title_slug": "making-file-names-unique", "question__hide": false, - "total_acs": 35541, - "total_submitted": 85592, + "total_acs": 35579, + "total_submitted": 85682, "total_column_articles": 334, "frontend_question_id": "1487", "is_new_question": false @@ -31638,9 +32289,9 @@ "question__title": "XOR Operation in an Array", "question__title_slug": "xor-operation-in-an-array", "question__hide": false, - "total_acs": 82328, - "total_submitted": 96120, - "total_column_articles": 788, + "total_acs": 82667, + "total_submitted": 96536, + "total_column_articles": 791, "frontend_question_id": "1486", "is_new_question": false }, @@ -31659,8 +32310,8 @@ "question__title": "Find All The Lonely Nodes", "question__title_slug": "find-all-the-lonely-nodes", "question__hide": false, - "total_acs": 4976, - "total_submitted": 6053, + "total_acs": 4996, + "total_submitted": 6074, "total_column_articles": 137, "frontend_question_id": "1469", "is_new_question": false @@ -31680,8 +32331,8 @@ "question__title": "Calculate Salaries", "question__title_slug": "calculate-salaries", "question__hide": false, - "total_acs": 5422, - "total_submitted": 7762, + "total_acs": 5464, + "total_submitted": 7818, "total_column_articles": 65, "frontend_question_id": "1468", "is_new_question": false @@ -31701,8 +32352,8 @@ "question__title": "Rectangles Area", "question__title_slug": "rectangles-area", "question__hide": false, - "total_acs": 6206, - "total_submitted": 9879, + "total_acs": 6239, + "total_submitted": 9944, "total_column_articles": 95, "frontend_question_id": "1459", "is_new_question": false @@ -31722,9 +32373,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": 40911, - "total_submitted": 71874, - "total_column_articles": 506, + "total_acs": 41005, + "total_submitted": 72084, + "total_column_articles": 507, "frontend_question_id": "1482", "is_new_question": false }, @@ -31743,9 +32394,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": 19162, - "total_submitted": 42423, - "total_column_articles": 244, + "total_acs": 19424, + "total_submitted": 42922, + "total_column_articles": 249, "frontend_question_id": "1481", "is_new_question": false }, @@ -31764,9 +32415,9 @@ "question__title": "Running Sum of 1d Array", "question__title_slug": "running-sum-of-1d-array", "question__hide": false, - "total_acs": 308879, - "total_submitted": 402483, - "total_column_articles": 2450, + "total_acs": 311411, + "total_submitted": 406091, + "total_column_articles": 2469, "frontend_question_id": "1480", "is_new_question": false }, @@ -31785,8 +32436,8 @@ "question__title": "Parallel Courses II", "question__title_slug": "parallel-courses-ii", "question__hide": false, - "total_acs": 4390, - "total_submitted": 10808, + "total_acs": 4424, + "total_submitted": 10935, "total_column_articles": 58, "frontend_question_id": "1494", "is_new_question": false @@ -31806,9 +32457,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": 16646, - "total_submitted": 28131, - "total_column_articles": 283, + "total_acs": 17044, + "total_submitted": 28718, + "total_column_articles": 290, "frontend_question_id": "1493", "is_new_question": false }, @@ -31827,9 +32478,9 @@ "question__title": "The kth Factor of n", "question__title_slug": "the-kth-factor-of-n", "question__hide": false, - "total_acs": 14954, - "total_submitted": 24632, - "total_column_articles": 155, + "total_acs": 15039, + "total_submitted": 24760, + "total_column_articles": 157, "frontend_question_id": "1492", "is_new_question": false }, @@ -31848,9 +32499,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": 52270, - "total_submitted": 83362, - "total_column_articles": 695, + "total_acs": 52437, + "total_submitted": 83591, + "total_column_articles": 696, "frontend_question_id": "1491", "is_new_question": false }, @@ -31869,9 +32520,9 @@ "question__title": "Paint House III", "question__title_slug": "paint-house-iii", "question__hide": false, - "total_acs": 17429, - "total_submitted": 26263, - "total_column_articles": 187, + "total_acs": 17451, + "total_submitted": 26308, + "total_column_articles": 188, "frontend_question_id": "1473", "is_new_question": false }, @@ -31890,9 +32541,9 @@ "question__title": "Design Browser History", "question__title_slug": "design-browser-history", "question__hide": false, - "total_acs": 16276, - "total_submitted": 26410, - "total_column_articles": 251, + "total_acs": 16398, + "total_submitted": 26608, + "total_column_articles": 255, "frontend_question_id": "1472", "is_new_question": false }, @@ -31911,8 +32562,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": 9731, - "total_submitted": 17559, + "total_acs": 9766, + "total_submitted": 17602, "total_column_articles": 143, "frontend_question_id": "1471", "is_new_question": false @@ -31932,9 +32583,9 @@ "question__title": "Shuffle the Array", "question__title_slug": "shuffle-the-array", "question__hide": false, - "total_acs": 99475, - "total_submitted": 117078, - "total_column_articles": 1144, + "total_acs": 99830, + "total_submitted": 117515, + "total_column_articles": 1145, "frontend_question_id": "1470", "is_new_question": false }, @@ -31953,9 +32604,9 @@ "question__title": "Active Users", "question__title_slug": "active-users", "question__hide": false, - "total_acs": 10379, - "total_submitted": 26973, - "total_column_articles": 127, + "total_acs": 10437, + "total_submitted": 27165, + "total_column_articles": 128, "frontend_question_id": "1454", "is_new_question": false }, @@ -31974,9 +32625,9 @@ "question__title": "Apples & Oranges", "question__title_slug": "apples-oranges", "question__hide": false, - "total_acs": 12596, - "total_submitted": 14873, - "total_column_articles": 125, + "total_acs": 12723, + "total_submitted": 15037, + "total_column_articles": 127, "frontend_question_id": "1445", "is_new_question": false }, @@ -31995,9 +32646,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": 2536, - "total_submitted": 4026, - "total_column_articles": 67, + "total_acs": 2548, + "total_submitted": 4042, + "total_column_articles": 68, "frontend_question_id": "1467", "is_new_question": false }, @@ -32016,9 +32667,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": 11554, - "total_submitted": 22592, - "total_column_articles": 222, + "total_acs": 11789, + "total_submitted": 23046, + "total_column_articles": 224, "frontend_question_id": "1466", "is_new_question": false }, @@ -32037,8 +32688,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": 8821, - "total_submitted": 26979, + "total_acs": 8843, + "total_submitted": 27037, "total_column_articles": 104, "frontend_question_id": "1465", "is_new_question": false @@ -32058,9 +32709,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": 74520, - "total_submitted": 94652, - "total_column_articles": 852, + "total_acs": 74717, + "total_submitted": 95047, + "total_column_articles": 853, "frontend_question_id": "1464", "is_new_question": false }, @@ -32079,8 +32730,8 @@ "question__title": "Find Two Non-overlapping Sub-arrays Each With Target Sum", "question__title_slug": "find-two-non-overlapping-sub-arrays-each-with-target-sum", "question__hide": false, - "total_acs": 8647, - "total_submitted": 27821, + "total_acs": 8695, + "total_submitted": 27979, "total_column_articles": 144, "frontend_question_id": "1477", "is_new_question": false @@ -32100,8 +32751,8 @@ "question__title": "Subrectangle Queries", "question__title_slug": "subrectangle-queries", "question__hide": false, - "total_acs": 15819, - "total_submitted": 18271, + "total_acs": 15871, + "total_submitted": 18339, "total_column_articles": 145, "frontend_question_id": "1476", "is_new_question": false @@ -32121,9 +32772,9 @@ "question__title": "Allocate Mailboxes", "question__title_slug": "allocate-mailboxes", "question__hide": false, - "total_acs": 5530, - "total_submitted": 8843, - "total_column_articles": 97, + "total_acs": 5563, + "total_submitted": 8890, + "total_column_articles": 98, "frontend_question_id": "1478", "is_new_question": false }, @@ -32142,9 +32793,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": 66682, - "total_submitted": 90952, - "total_column_articles": 846, + "total_acs": 66864, + "total_submitted": 91212, + "total_column_articles": 848, "frontend_question_id": "1475", "is_new_question": false }, @@ -32163,8 +32814,8 @@ "question__title": "Max Dot Product of Two Subsequences", "question__title_slug": "max-dot-product-of-two-subsequences", "question__hide": false, - "total_acs": 7595, - "total_submitted": 16318, + "total_acs": 7665, + "total_submitted": 16438, "total_column_articles": 124, "frontend_question_id": "1458", "is_new_question": false @@ -32184,9 +32835,9 @@ "question__title": "Pseudo-Palindromic Paths in a Binary Tree", "question__title_slug": "pseudo-palindromic-paths-in-a-binary-tree", "question__hide": false, - "total_acs": 11330, - "total_submitted": 18204, - "total_column_articles": 185, + "total_acs": 11393, + "total_submitted": 18335, + "total_column_articles": 186, "frontend_question_id": "1457", "is_new_question": false }, @@ -32205,9 +32856,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": 25949, - "total_submitted": 48269, - "total_column_articles": 345, + "total_acs": 26560, + "total_submitted": 49200, + "total_column_articles": 352, "frontend_question_id": "1456", "is_new_question": false }, @@ -32226,9 +32877,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": 41307, - "total_submitted": 63672, - "total_column_articles": 694, + "total_acs": 41389, + "total_submitted": 63812, + "total_column_articles": 696, "frontend_question_id": "1455", "is_new_question": false }, @@ -32247,8 +32898,8 @@ "question__title": "Evaluate Boolean Expression", "question__title_slug": "evaluate-boolean-expression", "question__hide": false, - "total_acs": 8110, - "total_submitted": 11613, + "total_acs": 8231, + "total_submitted": 11790, "total_column_articles": 87, "frontend_question_id": "1440", "is_new_question": false @@ -32268,9 +32919,9 @@ "question__title": "Create a Session Bar Chart", "question__title_slug": "create-a-session-bar-chart", "question__hide": false, - "total_acs": 6972, - "total_submitted": 10953, - "total_column_articles": 62, + "total_acs": 6999, + "total_submitted": 10992, + "total_column_articles": 63, "frontend_question_id": "1435", "is_new_question": false }, @@ -32289,9 +32940,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": 2209, - "total_submitted": 5894, - "total_column_articles": 42, + "total_acs": 2227, + "total_submitted": 5927, + "total_column_articles": 43, "frontend_question_id": "1453", "is_new_question": false }, @@ -32310,9 +32961,9 @@ "question__title": "People Whose List of Favorite Companies Is Not a Subset of Another List", "question__title_slug": "people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list", "question__hide": false, - "total_acs": 7845, - "total_submitted": 15379, - "total_column_articles": 120, + "total_acs": 7868, + "total_submitted": 15411, + "total_column_articles": 121, "frontend_question_id": "1452", "is_new_question": false }, @@ -32331,9 +32982,9 @@ "question__title": "Rearrange Words in a Sentence", "question__title_slug": "rearrange-words-in-a-sentence", "question__hide": false, - "total_acs": 13726, - "total_submitted": 25490, - "total_column_articles": 210, + "total_acs": 13787, + "total_submitted": 25582, + "total_column_articles": 209, "frontend_question_id": "1451", "is_new_question": false }, @@ -32352,8 +33003,8 @@ "question__title": "Number of Students Doing Homework at a Given Time", "question__title_slug": "number-of-students-doing-homework-at-a-given-time", "question__hide": false, - "total_acs": 60129, - "total_submitted": 73002, + "total_acs": 60225, + "total_submitted": 73118, "total_column_articles": 682, "frontend_question_id": "1450", "is_new_question": false @@ -32373,9 +33024,9 @@ "question__title": "Cherry Pickup II", "question__title_slug": "cherry-pickup-ii", "question__hide": false, - "total_acs": 4605, - "total_submitted": 7423, - "total_column_articles": 101, + "total_acs": 4660, + "total_submitted": 7499, + "total_column_articles": 103, "frontend_question_id": "1463", "is_new_question": false }, @@ -32394,9 +33045,9 @@ "question__title": "Course Schedule IV", "question__title_slug": "course-schedule-iv", "question__hide": false, - "total_acs": 11986, - "total_submitted": 26285, - "total_column_articles": 216, + "total_acs": 12102, + "total_submitted": 26511, + "total_column_articles": 217, "frontend_question_id": "1462", "is_new_question": false }, @@ -32415,9 +33066,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": 9466, - "total_submitted": 18062, - "total_column_articles": 129, + "total_acs": 9527, + "total_submitted": 18163, + "total_column_articles": 130, "frontend_question_id": "1461", "is_new_question": false }, @@ -32436,8 +33087,8 @@ "question__title": "Make Two Arrays Equal by Reversing Subarrays", "question__title_slug": "make-two-arrays-equal-by-reversing-subarrays", "question__hide": false, - "total_acs": 53431, - "total_submitted": 69146, + "total_acs": 53511, + "total_submitted": 69258, "total_column_articles": 751, "frontend_question_id": "1460", "is_new_question": false @@ -32457,8 +33108,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": 5738, - "total_submitted": 10613, + "total_acs": 5770, + "total_submitted": 10665, "total_column_articles": 98, "frontend_question_id": "1444", "is_new_question": false @@ -32478,8 +33129,8 @@ "question__title": "Minimum Time to Collect All Apples in a Tree", "question__title_slug": "minimum-time-to-collect-all-apples-in-a-tree", "question__hide": false, - "total_acs": 7838, - "total_submitted": 18242, + "total_acs": 7885, + "total_submitted": 18349, "total_column_articles": 189, "frontend_question_id": "1443", "is_new_question": false @@ -32499,8 +33150,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": 38746, - "total_submitted": 48869, + "total_acs": 38812, + "total_submitted": 48951, "total_column_articles": 413, "frontend_question_id": "1442", "is_new_question": false @@ -32520,9 +33171,9 @@ "question__title": "Build an Array With Stack Operations", "question__title_slug": "build-an-array-with-stack-operations", "question__hide": false, - "total_acs": 48518, - "total_submitted": 67820, - "total_column_articles": 897, + "total_acs": 48604, + "total_submitted": 67933, + "total_column_articles": 898, "frontend_question_id": "1441", "is_new_question": false }, @@ -32541,8 +33192,8 @@ "question__title": "NPV Queries", "question__title_slug": "npv-queries", "question__hide": false, - "total_acs": 5884, - "total_submitted": 8283, + "total_acs": 5915, + "total_submitted": 8333, "total_column_articles": 49, "frontend_question_id": "1421", "is_new_question": false @@ -32562,9 +33213,9 @@ "question__title": "Find the Kth Smallest Sum of a Matrix With Sorted Rows", "question__title_slug": "find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows", "question__hide": false, - "total_acs": 7399, - "total_submitted": 13026, - "total_column_articles": 100, + "total_acs": 7429, + "total_submitted": 13068, + "total_column_articles": 102, "frontend_question_id": "1439", "is_new_question": false }, @@ -32583,9 +33234,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": 44668, - "total_submitted": 90257, - "total_column_articles": 580, + "total_acs": 44809, + "total_submitted": 90525, + "total_column_articles": 581, "frontend_question_id": "1438", "is_new_question": false }, @@ -32604,8 +33255,8 @@ "question__title": "Check If All 1's Are at Least Length K Places Away", "question__title_slug": "check-if-all-1s-are-at-least-length-k-places-away", "question__hide": false, - "total_acs": 16313, - "total_submitted": 29196, + "total_acs": 16385, + "total_submitted": 29336, "total_column_articles": 258, "frontend_question_id": "1437", "is_new_question": false @@ -32625,8 +33276,8 @@ "question__title": "Destination City", "question__title_slug": "destination-city", "question__hide": false, - "total_acs": 52975, - "total_submitted": 64764, + "total_acs": 53102, + "total_submitted": 64954, "total_column_articles": 764, "frontend_question_id": "1436", "is_new_question": false @@ -32646,8 +33297,8 @@ "question__title": "Find the Quiet Students in All Exams", "question__title_slug": "find-the-quiet-students-in-all-exams", "question__hide": false, - "total_acs": 6422, - "total_submitted": 11825, + "total_acs": 6503, + "total_submitted": 11952, "total_column_articles": 115, "frontend_question_id": "1412", "is_new_question": false @@ -32667,8 +33318,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": 19028, - "total_submitted": 30502, + "total_acs": 19113, + "total_submitted": 30635, "total_column_articles": 231, "frontend_question_id": "1449", "is_new_question": false @@ -32688,9 +33339,9 @@ "question__title": "Count Good Nodes in Binary Tree", "question__title_slug": "count-good-nodes-in-binary-tree", "question__hide": false, - "total_acs": 18948, - "total_submitted": 26403, - "total_column_articles": 293, + "total_acs": 19297, + "total_submitted": 26892, + "total_column_articles": 297, "frontend_question_id": "1448", "is_new_question": false }, @@ -32709,8 +33360,8 @@ "question__title": "Simplified Fractions", "question__title_slug": "simplified-fractions", "question__hide": false, - "total_acs": 41512, - "total_submitted": 61442, + "total_acs": 41573, + "total_submitted": 61546, "total_column_articles": 529, "frontend_question_id": "1447", "is_new_question": false @@ -32730,8 +33381,8 @@ "question__title": "Consecutive Characters", "question__title_slug": "consecutive-characters", "question__hide": false, - "total_acs": 58925, - "total_submitted": 97638, + "total_acs": 59039, + "total_submitted": 97869, "total_column_articles": 790, "frontend_question_id": "1446", "is_new_question": false @@ -32751,9 +33402,9 @@ "question__title": "Top Travellers", "question__title_slug": "top-travellers", "question__hide": false, - "total_acs": 34046, - "total_submitted": 59519, - "total_column_articles": 258, + "total_acs": 34448, + "total_submitted": 60302, + "total_column_articles": 260, "frontend_question_id": "1407", "is_new_question": false }, @@ -32772,8 +33423,8 @@ "question__title": "Diagonal Traverse II", "question__title_slug": "diagonal-traverse-ii", "question__hide": false, - "total_acs": 10265, - "total_submitted": 24345, + "total_acs": 10315, + "total_submitted": 24458, "total_column_articles": 209, "frontend_question_id": "1424", "is_new_question": false @@ -32793,8 +33444,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": 46761, - "total_submitted": 84815, + "total_acs": 46917, + "total_submitted": 85145, "total_column_articles": 646, "frontend_question_id": "1423", "is_new_question": false @@ -32814,9 +33465,9 @@ "question__title": "Maximum Score After Splitting a String", "question__title_slug": "maximum-score-after-splitting-a-string", "question__hide": false, - "total_acs": 41289, - "total_submitted": 72762, - "total_column_articles": 682, + "total_acs": 41539, + "total_submitted": 73234, + "total_column_articles": 683, "frontend_question_id": "1422", "is_new_question": false }, @@ -32835,9 +33486,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": 11604, - "total_submitted": 15905, - "total_column_articles": 139, + "total_acs": 11842, + "total_submitted": 16253, + "total_column_articles": 140, "frontend_question_id": "1398", "is_new_question": false }, @@ -32856,9 +33507,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": 3714, - "total_submitted": 5863, - "total_column_articles": 66, + "total_acs": 3756, + "total_submitted": 5921, + "total_column_articles": 67, "frontend_question_id": "1420", "is_new_question": false }, @@ -32877,9 +33528,9 @@ "question__title": "Minimum Number of Frogs Croaking", "question__title_slug": "minimum-number-of-frogs-croaking", "question__hide": false, - "total_acs": 12075, - "total_submitted": 27701, - "total_column_articles": 230, + "total_acs": 30984, + "total_submitted": 61654, + "total_column_articles": 437, "frontend_question_id": "1419", "is_new_question": false }, @@ -32898,9 +33549,9 @@ "question__title": "Display Table of Food Orders in a Restaurant", "question__title_slug": "display-table-of-food-orders-in-a-restaurant", "question__hide": false, - "total_acs": 28866, - "total_submitted": 39482, - "total_column_articles": 454, + "total_acs": 28905, + "total_submitted": 39528, + "total_column_articles": 453, "frontend_question_id": "1418", "is_new_question": false }, @@ -32919,8 +33570,8 @@ "question__title": "Reformat The String", "question__title_slug": "reformat-the-string", "question__hide": false, - "total_acs": 46516, - "total_submitted": 84225, + "total_acs": 46595, + "total_submitted": 84412, "total_column_articles": 618, "frontend_question_id": "1417", "is_new_question": false @@ -32940,9 +33591,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": 4093, - "total_submitted": 7980, - "total_column_articles": 69, + "total_acs": 4121, + "total_submitted": 8021, + "total_column_articles": 70, "frontend_question_id": "1434", "is_new_question": false }, @@ -32961,8 +33612,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": 8368, - "total_submitted": 12943, + "total_acs": 8412, + "total_submitted": 13019, "total_column_articles": 148, "frontend_question_id": "1433", "is_new_question": false @@ -32982,9 +33633,9 @@ "question__title": "Max Difference You Can Get From Changing an Integer", "question__title_slug": "max-difference-you-can-get-from-changing-an-integer", "question__hide": false, - "total_acs": 6264, - "total_submitted": 15718, - "total_column_articles": 135, + "total_acs": 6302, + "total_submitted": 15800, + "total_column_articles": 136, "frontend_question_id": "1432", "is_new_question": false }, @@ -33003,9 +33654,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": 90987, - "total_submitted": 107545, - "total_column_articles": 1180, + "total_acs": 91535, + "total_submitted": 108218, + "total_column_articles": 1184, "frontend_question_id": "1431", "is_new_question": false }, @@ -33024,9 +33675,9 @@ "question__title": "Number of Ways to Paint N × 3 Grid", "question__title_slug": "number-of-ways-to-paint-n-3-grid", "question__hide": false, - "total_acs": 9836, - "total_submitted": 17249, - "total_column_articles": 166, + "total_acs": 9865, + "total_submitted": 17281, + "total_column_articles": 167, "frontend_question_id": "1411", "is_new_question": false }, @@ -33045,9 +33696,9 @@ "question__title": "HTML Entity Parser", "question__title_slug": "html-entity-parser", "question__hide": false, - "total_acs": 9323, - "total_submitted": 19825, - "total_column_articles": 140, + "total_acs": 9354, + "total_submitted": 19882, + "total_column_articles": 142, "frontend_question_id": "1410", "is_new_question": false }, @@ -33066,9 +33717,9 @@ "question__title": "Queries on a Permutation With Key", "question__title_slug": "queries-on-a-permutation-with-key", "question__hide": false, - "total_acs": 11063, - "total_submitted": 13605, - "total_column_articles": 194, + "total_acs": 11090, + "total_submitted": 13635, + "total_column_articles": 195, "frontend_question_id": "1409", "is_new_question": false }, @@ -33087,9 +33738,9 @@ "question__title": "String Matching in an Array", "question__title_slug": "string-matching-in-an-array", "question__hide": false, - "total_acs": 44774, - "total_submitted": 69519, - "total_column_articles": 553, + "total_acs": 44893, + "total_submitted": 69728, + "total_column_articles": 555, "frontend_question_id": "1408", "is_new_question": false }, @@ -33108,9 +33759,9 @@ "question__title": "Capital Gain/Loss", "question__title_slug": "capital-gainloss", "question__hide": false, - "total_acs": 29546, - "total_submitted": 35290, - "total_column_articles": 255, + "total_acs": 29812, + "total_submitted": 35600, + "total_column_articles": 256, "frontend_question_id": "1393", "is_new_question": false }, @@ -33129,9 +33780,9 @@ "question__title": "Stone Game III", "question__title_slug": "stone-game-iii", "question__hide": false, - "total_acs": 7864, - "total_submitted": 13372, - "total_column_articles": 121, + "total_acs": 7914, + "total_submitted": 13440, + "total_column_articles": 122, "frontend_question_id": "1406", "is_new_question": false }, @@ -33150,8 +33801,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": 9710, - "total_submitted": 19150, + "total_acs": 9760, + "total_submitted": 19225, "total_column_articles": 196, "frontend_question_id": "1404", "is_new_question": false @@ -33171,9 +33822,9 @@ "question__title": "Minimum Subsequence in Non-Increasing Order", "question__title_slug": "minimum-subsequence-in-non-increasing-order", "question__hide": false, - "total_acs": 55841, - "total_submitted": 76125, - "total_column_articles": 752, + "total_acs": 55907, + "total_submitted": 76221, + "total_column_articles": 754, "frontend_question_id": "1403", "is_new_question": false }, @@ -33192,9 +33843,9 @@ "question__title": "Total Sales Amount by Year", "question__title_slug": "total-sales-amount-by-year", "question__hide": false, - "total_acs": 4874, - "total_submitted": 8417, - "total_column_articles": 98, + "total_acs": 4916, + "total_submitted": 8487, + "total_column_articles": 100, "frontend_question_id": "1384", "is_new_question": false }, @@ -33213,9 +33864,9 @@ "question__title": "Restore The Array", "question__title_slug": "restore-the-array", "question__hide": false, - "total_acs": 4418, - "total_submitted": 10328, - "total_column_articles": 79, + "total_acs": 4503, + "total_submitted": 10515, + "total_column_articles": 80, "frontend_question_id": "1416", "is_new_question": false }, @@ -33234,8 +33885,8 @@ "question__title": "The k-th Lexicographical String of All Happy Strings of Length n", "question__title_slug": "the-k-th-lexicographical-string-of-all-happy-strings-of-length-n", "question__hide": false, - "total_acs": 8956, - "total_submitted": 13057, + "total_acs": 8990, + "total_submitted": 13106, "total_column_articles": 236, "frontend_question_id": "1415", "is_new_question": false @@ -33255,8 +33906,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": 30238, - "total_submitted": 42948, + "total_acs": 30274, + "total_submitted": 42996, "total_column_articles": 453, "frontend_question_id": "1414", "is_new_question": false @@ -33276,9 +33927,9 @@ "question__title": "Minimum Value to Get Positive Step by Step Sum", "question__title_slug": "minimum-value-to-get-positive-step-by-step-sum", "question__hide": false, - "total_acs": 46638, - "total_submitted": 63822, - "total_column_articles": 695, + "total_acs": 46751, + "total_submitted": 63991, + "total_column_articles": 699, "frontend_question_id": "1413", "is_new_question": false }, @@ -33297,8 +33948,8 @@ "question__title": "Find All Good Strings", "question__title_slug": "find-all-good-strings", "question__hide": false, - "total_acs": 1999, - "total_submitted": 4610, + "total_acs": 2022, + "total_submitted": 4651, "total_column_articles": 63, "frontend_question_id": "1397", "is_new_question": false @@ -33318,9 +33969,9 @@ "question__title": "Design Underground System", "question__title_slug": "design-underground-system", "question__hide": false, - "total_acs": 20514, - "total_submitted": 49043, - "total_column_articles": 261, + "total_acs": 20661, + "total_submitted": 49285, + "total_column_articles": 264, "frontend_question_id": "1396", "is_new_question": false }, @@ -33339,9 +33990,9 @@ "question__title": "Count Number of Teams", "question__title_slug": "count-number-of-teams", "question__hide": false, - "total_acs": 19653, - "total_submitted": 27490, - "total_column_articles": 288, + "total_acs": 19727, + "total_submitted": 27618, + "total_column_articles": 290, "frontend_question_id": "1395", "is_new_question": false }, @@ -33360,9 +34011,9 @@ "question__title": "Find Lucky Integer in an Array", "question__title_slug": "find-lucky-integer-in-an-array", "question__hide": false, - "total_acs": 25657, - "total_submitted": 39158, - "total_column_articles": 422, + "total_acs": 25790, + "total_submitted": 39349, + "total_column_articles": 424, "frontend_question_id": "1394", "is_new_question": false }, @@ -33381,9 +34032,9 @@ "question__title": "Replace Employee ID With The Unique Identifier", "question__title_slug": "replace-employee-id-with-the-unique-identifier", "question__hide": false, - "total_acs": 13591, - "total_submitted": 15749, - "total_column_articles": 89, + "total_acs": 14690, + "total_submitted": 17064, + "total_column_articles": 94, "frontend_question_id": "1378", "is_new_question": false }, @@ -33402,8 +34053,8 @@ "question__title": "Longest Happy Prefix", "question__title_slug": "longest-happy-prefix", "question__hide": false, - "total_acs": 14023, - "total_submitted": 31536, + "total_acs": 14061, + "total_submitted": 31610, "total_column_articles": 230, "frontend_question_id": "1392", "is_new_question": false @@ -33423,8 +34074,8 @@ "question__title": "Check if There is a Valid Path in a Grid", "question__title_slug": "check-if-there-is-a-valid-path-in-a-grid", "question__hide": false, - "total_acs": 8660, - "total_submitted": 20677, + "total_acs": 8688, + "total_submitted": 20730, "total_column_articles": 266, "frontend_question_id": "1391", "is_new_question": false @@ -33444,8 +34095,8 @@ "question__title": "Create Target Array in the Given Order", "question__title_slug": "create-target-array-in-the-given-order", "question__hide": false, - "total_acs": 34984, - "total_submitted": 42138, + "total_acs": 35074, + "total_submitted": 42250, "total_column_articles": 580, "frontend_question_id": "1389", "is_new_question": false @@ -33465,8 +34116,8 @@ "question__title": "Get the Second Most Recent Activity", "question__title_slug": "get-the-second-most-recent-activity", "question__hide": false, - "total_acs": 6453, - "total_submitted": 10485, + "total_acs": 6491, + "total_submitted": 10542, "total_column_articles": 83, "frontend_question_id": "1369", "is_new_question": false @@ -33486,9 +34137,9 @@ "question__title": "Reducing Dishes", "question__title_slug": "reducing-dishes", "question__hide": false, - "total_acs": 14469, - "total_submitted": 18993, - "total_column_articles": 242, + "total_acs": 14507, + "total_submitted": 19051, + "total_column_articles": 243, "frontend_question_id": "1402", "is_new_question": false }, @@ -33507,8 +34158,8 @@ "question__title": "Construct K Palindrome Strings", "question__title_slug": "construct-k-palindrome-strings", "question__hide": false, - "total_acs": 9358, - "total_submitted": 15264, + "total_acs": 9416, + "total_submitted": 15353, "total_column_articles": 151, "frontend_question_id": "1400", "is_new_question": false @@ -33528,8 +34179,8 @@ "question__title": "Circle and Rectangle Overlapping", "question__title_slug": "circle-and-rectangle-overlapping", "question__hide": false, - "total_acs": 6161, - "total_submitted": 14261, + "total_acs": 6200, + "total_submitted": 14346, "total_column_articles": 130, "frontend_question_id": "1401", "is_new_question": false @@ -33549,8 +34200,8 @@ "question__title": "Count Largest Group", "question__title_slug": "count-largest-group", "question__hide": false, - "total_acs": 13830, - "total_submitted": 20615, + "total_acs": 13879, + "total_submitted": 20692, "total_column_articles": 212, "frontend_question_id": "1399", "is_new_question": false @@ -33570,8 +34221,8 @@ "question__title": "Maximum Performance of a Team", "question__title_slug": "maximum-performance-of-a-team", "question__hide": false, - "total_acs": 6672, - "total_submitted": 18991, + "total_acs": 6693, + "total_submitted": 19026, "total_column_articles": 128, "frontend_question_id": "1383", "is_new_question": false @@ -33591,9 +34242,9 @@ "question__title": "Find a Corresponding Node of a Binary Tree in a Clone of That Tree", "question__title_slug": "find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree", "question__hide": false, - "total_acs": 17125, - "total_submitted": 20573, - "total_column_articles": 243, + "total_acs": 17236, + "total_submitted": 20710, + "total_column_articles": 245, "frontend_question_id": "1379", "is_new_question": false }, @@ -33612,8 +34263,8 @@ "question__title": "Design a Stack With Increment Operation", "question__title_slug": "design-a-stack-with-increment-operation", "question__hide": false, - "total_acs": 17727, - "total_submitted": 24458, + "total_acs": 17788, + "total_submitted": 24547, "total_column_articles": 228, "frontend_question_id": "1381", "is_new_question": false @@ -33633,9 +34284,9 @@ "question__title": "Lucky Numbers in a Matrix", "question__title_slug": "lucky-numbers-in-a-matrix", "question__hide": false, - "total_acs": 55804, - "total_submitted": 73031, - "total_column_articles": 754, + "total_acs": 55912, + "total_submitted": 73181, + "total_column_articles": 756, "frontend_question_id": "1380", "is_new_question": false }, @@ -33654,8 +34305,8 @@ "question__title": "Number of Trusted Contacts of a Customer", "question__title_slug": "number-of-trusted-contacts-of-a-customer", "question__hide": false, - "total_acs": 5983, - "total_submitted": 8757, + "total_acs": 6032, + "total_submitted": 8848, "total_column_articles": 89, "frontend_question_id": "1364", "is_new_question": false @@ -33675,8 +34326,8 @@ "question__title": "Activity Participants", "question__title_slug": "activity-participants", "question__hide": false, - "total_acs": 6979, - "total_submitted": 10454, + "total_acs": 7033, + "total_submitted": 10549, "total_column_articles": 86, "frontend_question_id": "1355", "is_new_question": false @@ -33696,9 +34347,9 @@ "question__title": "Frog Position After T Seconds", "question__title_slug": "frog-position-after-t-seconds", "question__hide": false, - "total_acs": 6058, - "total_submitted": 17927, - "total_column_articles": 168, + "total_acs": 6108, + "total_submitted": 18050, + "total_column_articles": 169, "frontend_question_id": "1377", "is_new_question": false }, @@ -33717,9 +34368,9 @@ "question__title": "Time Needed to Inform All Employees", "question__title_slug": "time-needed-to-inform-all-employees", "question__hide": false, - "total_acs": 29068, - "total_submitted": 48377, - "total_column_articles": 416, + "total_acs": 30997, + "total_submitted": 51415, + "total_column_articles": 427, "frontend_question_id": "1376", "is_new_question": false }, @@ -33738,8 +34389,8 @@ "question__title": "Number of Times Binary String Is Prefix-Aligned", "question__title_slug": "number-of-times-binary-string-is-prefix-aligned", "question__hide": false, - "total_acs": 10778, - "total_submitted": 18115, + "total_acs": 10801, + "total_submitted": 18148, "total_column_articles": 208, "frontend_question_id": "1375", "is_new_question": false @@ -33759,8 +34410,8 @@ "question__title": "Generate a String With Characters That Have Odd Counts", "question__title_slug": "generate-a-string-with-characters-that-have-odd-counts", "question__hide": false, - "total_acs": 53360, - "total_submitted": 68710, + "total_acs": 53455, + "total_submitted": 68831, "total_column_articles": 548, "frontend_question_id": "1374", "is_new_question": false @@ -33780,9 +34431,9 @@ "question__title": "Pizza With 3n Slices", "question__title_slug": "pizza-with-3n-slices", "question__hide": false, - "total_acs": 6906, - "total_submitted": 12239, - "total_column_articles": 75, + "total_acs": 6931, + "total_submitted": 12288, + "total_column_articles": 76, "frontend_question_id": "1388", "is_new_question": false }, @@ -33801,8 +34452,8 @@ "question__title": "Sort Integers by The Power Value", "question__title_slug": "sort-integers-by-the-power-value", "question__hide": false, - "total_acs": 15040, - "total_submitted": 21609, + "total_acs": 15088, + "total_submitted": 21677, "total_column_articles": 268, "frontend_question_id": "1387", "is_new_question": false @@ -33822,9 +34473,9 @@ "question__title": "Cinema Seat Allocation", "question__title_slug": "cinema-seat-allocation", "question__hide": false, - "total_acs": 9801, - "total_submitted": 27833, - "total_column_articles": 174, + "total_acs": 9839, + "total_submitted": 27928, + "total_column_articles": 175, "frontend_question_id": "1386", "is_new_question": false }, @@ -33843,9 +34494,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": 39038, - "total_submitted": 61011, - "total_column_articles": 503, + "total_acs": 39176, + "total_submitted": 61233, + "total_column_articles": 507, "frontend_question_id": "1385", "is_new_question": false }, @@ -33864,9 +34515,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": 7499, - "total_submitted": 12634, - "total_column_articles": 148, + "total_acs": 7590, + "total_submitted": 12760, + "total_column_articles": 150, "frontend_question_id": "1368", "is_new_question": false }, @@ -33885,9 +34536,9 @@ "question__title": "Linked List in Binary Tree", "question__title_slug": "linked-list-in-binary-tree", "question__hide": false, - "total_acs": 23879, - "total_submitted": 54722, - "total_column_articles": 350, + "total_acs": 23977, + "total_submitted": 54897, + "total_column_articles": 351, "frontend_question_id": "1367", "is_new_question": false }, @@ -33906,8 +34557,8 @@ "question__title": "Rank Teams by Votes", "question__title_slug": "rank-teams-by-votes", "question__hide": false, - "total_acs": 12239, - "total_submitted": 23949, + "total_acs": 12320, + "total_submitted": 24092, "total_column_articles": 211, "frontend_question_id": "1366", "is_new_question": false @@ -33927,9 +34578,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": 113709, - "total_submitted": 138056, - "total_column_articles": 1299, + "total_acs": 114223, + "total_submitted": 138675, + "total_column_articles": 1303, "frontend_question_id": "1365", "is_new_question": false }, @@ -33948,8 +34599,8 @@ "question__title": "Students With Invalid Departments", "question__title_slug": "students-with-invalid-departments", "question__hide": false, - "total_acs": 12377, - "total_submitted": 14574, + "total_acs": 12442, + "total_submitted": 14645, "total_column_articles": 105, "frontend_question_id": "1350", "is_new_question": false @@ -33969,9 +34620,9 @@ "question__title": "Movie Rating", "question__title_slug": "movie-rating", "question__hide": false, - "total_acs": 8588, - "total_submitted": 20359, - "total_column_articles": 103, + "total_acs": 9033, + "total_submitted": 21395, + "total_column_articles": 105, "frontend_question_id": "1341", "is_new_question": false }, @@ -33990,8 +34641,8 @@ "question__title": "Construct Target Array With Multiple Sums", "question__title_slug": "construct-target-array-with-multiple-sums", "question__hide": false, - "total_acs": 4176, - "total_submitted": 14439, + "total_acs": 4192, + "total_submitted": 14482, "total_column_articles": 93, "frontend_question_id": "1354", "is_new_question": false @@ -34011,8 +34662,8 @@ "question__title": "Maximum Number of Events That Can Be Attended", "question__title_slug": "maximum-number-of-events-that-can-be-attended", "question__hide": false, - "total_acs": 18184, - "total_submitted": 61684, + "total_acs": 18272, + "total_submitted": 61996, "total_column_articles": 211, "frontend_question_id": "1353", "is_new_question": false @@ -34032,9 +34683,9 @@ "question__title": "Product of the Last K Numbers", "question__title_slug": "product-of-the-last-k-numbers", "question__hide": false, - "total_acs": 11919, - "total_submitted": 24737, - "total_column_articles": 127, + "total_acs": 12018, + "total_submitted": 24911, + "total_column_articles": 128, "frontend_question_id": "1352", "is_new_question": false }, @@ -34053,9 +34704,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": 50536, - "total_submitted": 67994, - "total_column_articles": 780, + "total_acs": 50865, + "total_submitted": 68437, + "total_column_articles": 785, "frontend_question_id": "1351", "is_new_question": false }, @@ -34074,8 +34725,8 @@ "question__title": "Maximum Sum BST in Binary Tree", "question__title_slug": "maximum-sum-bst-in-binary-tree", "question__hide": false, - "total_acs": 18678, - "total_submitted": 43294, + "total_acs": 18783, + "total_submitted": 43500, "total_column_articles": 324, "frontend_question_id": "1373", "is_new_question": false @@ -34095,9 +34746,9 @@ "question__title": "Longest ZigZag Path in a Binary Tree", "question__title_slug": "longest-zigzag-path-in-a-binary-tree", "question__hide": false, - "total_acs": 14659, - "total_submitted": 26767, - "total_column_articles": 248, + "total_acs": 14942, + "total_submitted": 27281, + "total_column_articles": 251, "frontend_question_id": "1372", "is_new_question": false }, @@ -34116,8 +34767,8 @@ "question__title": "Find the Longest Substring Containing Vowels in Even Counts", "question__title_slug": "find-the-longest-substring-containing-vowels-in-even-counts", "question__hide": false, - "total_acs": 26255, - "total_submitted": 44534, + "total_acs": 26303, + "total_submitted": 44607, "total_column_articles": 320, "frontend_question_id": "1371", "is_new_question": false @@ -34137,9 +34788,9 @@ "question__title": "Increasing Decreasing String", "question__title_slug": "increasing-decreasing-string", "question__hide": false, - "total_acs": 54390, - "total_submitted": 68892, - "total_column_articles": 665, + "total_acs": 54465, + "total_submitted": 68993, + "total_column_articles": 667, "frontend_question_id": "1370", "is_new_question": false }, @@ -34158,8 +34809,8 @@ "question__title": "Maximum Students Taking Exam", "question__title_slug": "maximum-students-taking-exam", "question__hide": false, - "total_acs": 5695, - "total_submitted": 10537, + "total_acs": 5720, + "total_submitted": 10572, "total_column_articles": 136, "frontend_question_id": "1349", "is_new_question": false @@ -34179,8 +34830,8 @@ "question__title": "Tweet Counts Per Frequency", "question__title_slug": "tweet-counts-per-frequency", "question__hide": false, - "total_acs": 5317, - "total_submitted": 15310, + "total_acs": 5336, + "total_submitted": 15335, "total_column_articles": 79, "frontend_question_id": "1348", "is_new_question": false @@ -34200,8 +34851,8 @@ "question__title": "Minimum Number of Steps to Make Two Strings Anagram", "question__title_slug": "minimum-number-of-steps-to-make-two-strings-anagram", "question__hide": false, - "total_acs": 11856, - "total_submitted": 15596, + "total_acs": 11934, + "total_submitted": 15698, "total_column_articles": 173, "frontend_question_id": "1347", "is_new_question": false @@ -34221,9 +34872,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": 34655, - "total_submitted": 82422, - "total_column_articles": 536, + "total_acs": 34794, + "total_submitted": 82811, + "total_column_articles": 539, "frontend_question_id": "1346", "is_new_question": false }, @@ -34242,8 +34893,8 @@ "question__title": "Number of Transactions per Visit", "question__title_slug": "number-of-transactions-per-visit", "question__hide": false, - "total_acs": 3612, - "total_submitted": 7953, + "total_acs": 3646, + "total_submitted": 8002, "total_column_articles": 79, "frontend_question_id": "1336", "is_new_question": false @@ -34263,8 +34914,8 @@ "question__title": "Jump Game V", "question__title_slug": "jump-game-v", "question__hide": false, - "total_acs": 6958, - "total_submitted": 11749, + "total_acs": 6988, + "total_submitted": 11785, "total_column_articles": 134, "frontend_question_id": "1340", "is_new_question": false @@ -34284,8 +34935,8 @@ "question__title": "Maximum Product of Splitted Binary Tree", "question__title_slug": "maximum-product-of-splitted-binary-tree", "question__hide": false, - "total_acs": 13004, - "total_submitted": 31380, + "total_acs": 13083, + "total_submitted": 31512, "total_column_articles": 188, "frontend_question_id": "1339", "is_new_question": false @@ -34305,8 +34956,8 @@ "question__title": "Reduce Array Size to The Half", "question__title_slug": "reduce-array-size-to-the-half", "question__hide": false, - "total_acs": 12949, - "total_submitted": 19954, + "total_acs": 13020, + "total_submitted": 20060, "total_column_articles": 185, "frontend_question_id": "1338", "is_new_question": false @@ -34326,9 +34977,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": 57116, - "total_submitted": 83198, - "total_column_articles": 905, + "total_acs": 57236, + "total_submitted": 83385, + "total_column_articles": 908, "frontend_question_id": "1337", "is_new_question": false }, @@ -34347,8 +34998,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": 9905, - "total_submitted": 14275, + "total_acs": 10318, + "total_submitted": 14841, "total_column_articles": 83, "frontend_question_id": "1327", "is_new_question": false @@ -34368,9 +35019,9 @@ "question__title": "Count All Valid Pickup and Delivery Options", "question__title_slug": "count-all-valid-pickup-and-delivery-options", "question__hide": false, - "total_acs": 5558, - "total_submitted": 9540, - "total_column_articles": 118, + "total_acs": 5581, + "total_submitted": 9572, + "total_column_articles": 120, "frontend_question_id": "1359", "is_new_question": false }, @@ -34389,9 +35040,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": 10716, - "total_submitted": 20290, - "total_column_articles": 178, + "total_acs": 10788, + "total_submitted": 20402, + "total_column_articles": 179, "frontend_question_id": "1358", "is_new_question": false }, @@ -34410,8 +35061,8 @@ "question__title": "Apply Discount Every n Orders", "question__title_slug": "apply-discount-every-n-orders", "question__hide": false, - "total_acs": 6737, - "total_submitted": 12383, + "total_acs": 6782, + "total_submitted": 12450, "total_column_articles": 70, "frontend_question_id": "1357", "is_new_question": false @@ -34431,9 +35082,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": 61728, - "total_submitted": 84087, - "total_column_articles": 676, + "total_acs": 61979, + "total_submitted": 84442, + "total_column_articles": 680, "frontend_question_id": "1356", "is_new_question": false }, @@ -34452,9 +35103,9 @@ "question__title": "Minimum Difficulty of a Job Schedule", "question__title_slug": "minimum-difficulty-of-a-job-schedule", "question__hide": false, - "total_acs": 5839, - "total_submitted": 9656, - "total_column_articles": 95, + "total_acs": 5883, + "total_submitted": 9719, + "total_column_articles": 96, "frontend_question_id": "1335", "is_new_question": false }, @@ -34473,9 +35124,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": 11079, - "total_submitted": 21090, - "total_column_articles": 160, + "total_acs": 11206, + "total_submitted": 21292, + "total_column_articles": 163, "frontend_question_id": "1334", "is_new_question": false }, @@ -34494,8 +35145,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": 7965, - "total_submitted": 14085, + "total_acs": 8010, + "total_submitted": 14141, "total_column_articles": 164, "frontend_question_id": "1333", "is_new_question": false @@ -34515,8 +35166,8 @@ "question__title": "Remove Palindromic Subsequences", "question__title_slug": "remove-palindromic-subsequences", "question__hide": false, - "total_acs": 35484, - "total_submitted": 45615, + "total_acs": 35555, + "total_submitted": 45703, "total_column_articles": 377, "frontend_question_id": "1332", "is_new_question": false @@ -34536,9 +35187,9 @@ "question__title": "Ads Performance", "question__title_slug": "ads-performance", "question__hide": false, - "total_acs": 9039, - "total_submitted": 15192, - "total_column_articles": 85, + "total_acs": 9068, + "total_submitted": 15256, + "total_column_articles": 86, "frontend_question_id": "1322", "is_new_question": false }, @@ -34557,9 +35208,9 @@ "question__title": "Restaurant Growth", "question__title_slug": "restaurant-growth", "question__hide": false, - "total_acs": 11113, - "total_submitted": 17877, - "total_column_articles": 150, + "total_acs": 11500, + "total_submitted": 18472, + "total_column_articles": 155, "frontend_question_id": "1321", "is_new_question": false }, @@ -34578,9 +35229,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": 26138, - "total_submitted": 48269, - "total_column_articles": 259, + "total_acs": 26194, + "total_submitted": 48360, + "total_column_articles": 261, "frontend_question_id": "1326", "is_new_question": false }, @@ -34599,8 +35250,8 @@ "question__title": "Delete Leaves With a Given Value", "question__title_slug": "delete-leaves-with-a-given-value", "question__hide": false, - "total_acs": 16823, - "total_submitted": 23003, + "total_acs": 16902, + "total_submitted": 23093, "total_column_articles": 263, "frontend_question_id": "1325", "is_new_question": false @@ -34620,8 +35271,8 @@ "question__title": "Print Words Vertically", "question__title_slug": "print-words-vertically", "question__hide": false, - "total_acs": 9080, - "total_submitted": 15346, + "total_acs": 9130, + "total_submitted": 15429, "total_column_articles": 180, "frontend_question_id": "1324", "is_new_question": false @@ -34641,9 +35292,9 @@ "question__title": "Maximum 69 Number", "question__title_slug": "maximum-69-number", "question__hide": false, - "total_acs": 36217, - "total_submitted": 48365, - "total_column_articles": 633, + "total_acs": 36411, + "total_submitted": 48617, + "total_column_articles": 635, "frontend_question_id": "1323", "is_new_question": false }, @@ -34662,8 +35313,8 @@ "question__title": "Jump Game IV", "question__title_slug": "jump-game-iv", "question__hide": false, - "total_acs": 28942, - "total_submitted": 63247, + "total_acs": 28992, + "total_submitted": 63398, "total_column_articles": 310, "frontend_question_id": "1345", "is_new_question": false @@ -34683,9 +35334,9 @@ "question__title": "Angle Between Hands of a Clock", "question__title_slug": "angle-between-hands-of-a-clock", "question__hide": false, - "total_acs": 11241, - "total_submitted": 18684, - "total_column_articles": 176, + "total_acs": 11293, + "total_submitted": 18767, + "total_column_articles": 177, "frontend_question_id": "1344", "is_new_question": false }, @@ -34704,8 +35355,8 @@ "question__title": "Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold", "question__title_slug": "number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold", "question__hide": false, - "total_acs": 19222, - "total_submitted": 33504, + "total_acs": 19308, + "total_submitted": 33647, "total_column_articles": 300, "frontend_question_id": "1343", "is_new_question": false @@ -34725,9 +35376,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": 130847, - "total_submitted": 171249, - "total_column_articles": 1527, + "total_acs": 132558, + "total_submitted": 173799, + "total_column_articles": 1539, "frontend_question_id": "1342", "is_new_question": false }, @@ -34746,8 +35397,8 @@ "question__title": "Minimum Distance to Type a Word Using Two Fingers", "question__title_slug": "minimum-distance-to-type-a-word-using-two-fingers", "question__hide": false, - "total_acs": 3704, - "total_submitted": 6111, + "total_acs": 3724, + "total_submitted": 6148, "total_column_articles": 77, "frontend_question_id": "1320", "is_new_question": false @@ -34767,9 +35418,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": 44154, - "total_submitted": 70882, - "total_column_articles": 679, + "total_acs": 44303, + "total_submitted": 71113, + "total_column_articles": 682, "frontend_question_id": "1319", "is_new_question": false }, @@ -34788,9 +35439,9 @@ "question__title": "Minimum Flips to Make a OR b Equal to c", "question__title_slug": "minimum-flips-to-make-a-or-b-equal-to-c", "question__hide": false, - "total_acs": 9078, - "total_submitted": 13667, - "total_column_articles": 162, + "total_acs": 9244, + "total_submitted": 13917, + "total_column_articles": 165, "frontend_question_id": "1318", "is_new_question": false }, @@ -34809,8 +35460,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": 14582, - "total_submitted": 23568, + "total_acs": 14657, + "total_submitted": 23682, "total_column_articles": 257, "frontend_question_id": "1317", "is_new_question": false @@ -34830,8 +35481,8 @@ "question__title": "Running Total for Different Genders", "question__title_slug": "running-total-for-different-genders", "question__hide": false, - "total_acs": 12757, - "total_submitted": 17318, + "total_acs": 12843, + "total_submitted": 17415, "total_column_articles": 100, "frontend_question_id": "1308", "is_new_question": false @@ -34851,8 +35502,8 @@ "question__title": "Find the Team Size", "question__title_slug": "find-the-team-size", "question__hide": false, - "total_acs": 21449, - "total_submitted": 26005, + "total_acs": 21542, + "total_submitted": 26107, "total_column_articles": 166, "frontend_question_id": "1303", "is_new_question": false @@ -34872,9 +35523,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": 23749, - "total_submitted": 34448, - "total_column_articles": 245, + "total_acs": 24039, + "total_submitted": 34847, + "total_column_articles": 249, "frontend_question_id": "1312", "is_new_question": false }, @@ -34893,8 +35544,8 @@ "question__title": "Get Watched Videos by Your Friends", "question__title_slug": "get-watched-videos-by-your-friends", "question__hide": false, - "total_acs": 7677, - "total_submitted": 19299, + "total_acs": 7729, + "total_submitted": 19390, "total_column_articles": 117, "frontend_question_id": "1311", "is_new_question": false @@ -34914,8 +35565,8 @@ "question__title": "XOR Queries of a Subarray", "question__title_slug": "xor-queries-of-a-subarray", "question__hide": false, - "total_acs": 42307, - "total_submitted": 58787, + "total_acs": 42360, + "total_submitted": 58853, "total_column_articles": 557, "frontend_question_id": "1310", "is_new_question": false @@ -34935,9 +35586,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": 27444, - "total_submitted": 35737, - "total_column_articles": 475, + "total_acs": 27561, + "total_submitted": 35894, + "total_column_articles": 479, "frontend_question_id": "1309", "is_new_question": false }, @@ -34956,8 +35607,8 @@ "question__title": "Encrypt and Decrypt Strings", "question__title_slug": "encrypt-and-decrypt-strings", "question__hide": false, - "total_acs": 5491, - "total_submitted": 13930, + "total_acs": 5519, + "total_submitted": 13989, "total_column_articles": 86, "frontend_question_id": "2227", "is_new_question": false @@ -34977,8 +35628,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": 1357, - "total_submitted": 2491, + "total_acs": 1362, + "total_submitted": 2499, "total_column_articles": 54, "frontend_question_id": "1430", "is_new_question": false @@ -34998,8 +35649,8 @@ "question__title": "All Ancestors of a Node in a Directed Acyclic Graph", "question__title_slug": "all-ancestors-of-a-node-in-a-directed-acyclic-graph", "question__hide": false, - "total_acs": 6089, - "total_submitted": 13583, + "total_acs": 6133, + "total_submitted": 13661, "total_column_articles": 111, "frontend_question_id": "2192", "is_new_question": false @@ -35019,8 +35670,8 @@ "question__title": "Find the K-Beauty of a Number", "question__title_slug": "find-the-k-beauty-of-a-number", "question__hide": false, - "total_acs": 9509, - "total_submitted": 15191, + "total_acs": 9599, + "total_submitted": 15330, "total_column_articles": 121, "frontend_question_id": "2269", "is_new_question": false @@ -35040,8 +35691,8 @@ "question__title": "Verbal Arithmetic Puzzle", "question__title_slug": "verbal-arithmetic-puzzle", "question__hide": false, - "total_acs": 2575, - "total_submitted": 7473, + "total_acs": 2587, + "total_submitted": 7494, "total_column_articles": 73, "frontend_question_id": "1307", "is_new_question": false @@ -35061,9 +35712,9 @@ "question__title": "Jump Game III", "question__title_slug": "jump-game-iii", "question__hide": false, - "total_acs": 30689, - "total_submitted": 52529, - "total_column_articles": 443, + "total_acs": 30948, + "total_submitted": 53017, + "total_column_articles": 446, "frontend_question_id": "1306", "is_new_question": false }, @@ -35082,8 +35733,8 @@ "question__title": "All Elements in Two Binary Search Trees", "question__title_slug": "all-elements-in-two-binary-search-trees", "question__hide": false, - "total_acs": 50511, - "total_submitted": 64713, + "total_acs": 50620, + "total_submitted": 64864, "total_column_articles": 687, "frontend_question_id": "1305", "is_new_question": false @@ -35103,9 +35754,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": 28690, - "total_submitted": 40727, - "total_column_articles": 483, + "total_acs": 28780, + "total_submitted": 40860, + "total_column_articles": 484, "frontend_question_id": "1304", "is_new_question": false }, @@ -35124,8 +35775,8 @@ "question__title": "Weather Type in Each Country", "question__title_slug": "weather-type-in-each-country", "question__hide": false, - "total_acs": 14664, - "total_submitted": 22313, + "total_acs": 14722, + "total_submitted": 22408, "total_column_articles": 131, "frontend_question_id": "1294", "is_new_question": false @@ -35145,9 +35796,9 @@ "question__title": "Maximum Candies You Can Get from Boxes", "question__title_slug": "maximum-candies-you-can-get-from-boxes", "question__hide": false, - "total_acs": 3780, - "total_submitted": 6330, - "total_column_articles": 118, + "total_acs": 3804, + "total_submitted": 6363, + "total_column_articles": 119, "frontend_question_id": "1298", "is_new_question": false }, @@ -35166,8 +35817,8 @@ "question__title": "Maximum Number of Occurrences of a Substring", "question__title_slug": "maximum-number-of-occurrences-of-a-substring", "question__hide": false, - "total_acs": 10057, - "total_submitted": 20952, + "total_acs": 10122, + "total_submitted": 21071, "total_column_articles": 126, "frontend_question_id": "1297", "is_new_question": false @@ -35187,8 +35838,8 @@ "question__title": "Divide Array in Sets of K Consecutive Numbers", "question__title_slug": "divide-array-in-sets-of-k-consecutive-numbers", "question__hide": false, - "total_acs": 12329, - "total_submitted": 25159, + "total_acs": 12376, + "total_submitted": 25249, "total_column_articles": 167, "frontend_question_id": "1296", "is_new_question": false @@ -35208,9 +35859,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": 58364, - "total_submitted": 72887, - "total_column_articles": 762, + "total_acs": 58506, + "total_submitted": 73054, + "total_column_articles": 764, "frontend_question_id": "1295", "is_new_question": false }, @@ -35229,8 +35880,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": 10702, - "total_submitted": 13142, + "total_acs": 10804, + "total_submitted": 13257, "total_column_articles": 111, "frontend_question_id": "1285", "is_new_question": false @@ -35250,8 +35901,8 @@ "question__title": "Make Array Non-decreasing or Non-increasing", "question__title_slug": "make-array-non-decreasing-or-non-increasing", "question__hide": false, - "total_acs": 247, - "total_submitted": 336, + "total_acs": 248, + "total_submitted": 339, "total_column_articles": 15, "frontend_question_id": "2263", "is_new_question": false @@ -35271,8 +35922,8 @@ "question__title": "Fair Distribution of Cookies", "question__title_slug": "fair-distribution-of-cookies", "question__hide": false, - "total_acs": 11442, - "total_submitted": 15836, + "total_acs": 11537, + "total_submitted": 15965, "total_column_articles": 131, "frontend_question_id": "2305", "is_new_question": false @@ -35292,8 +35943,8 @@ "question__title": "Check if an Array Is Consecutive", "question__title_slug": "check-if-an-array-is-consecutive", "question__hide": false, - "total_acs": 613, - "total_submitted": 883, + "total_acs": 624, + "total_submitted": 896, "total_column_articles": 28, "frontend_question_id": "2229", "is_new_question": false @@ -35313,9 +35964,9 @@ "question__title": "Students and Examinations", "question__title_slug": "students-and-examinations", "question__hide": false, - "total_acs": 16559, - "total_submitted": 33214, - "total_column_articles": 135, + "total_acs": 17390, + "total_submitted": 34877, + "total_column_articles": 139, "frontend_question_id": "1280", "is_new_question": false }, @@ -35334,8 +35985,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": 21709, - "total_submitted": 56743, + "total_acs": 21792, + "total_submitted": 56892, "total_column_articles": 194, "frontend_question_id": "1293", "is_new_question": false @@ -35355,8 +36006,8 @@ "question__title": "Maximum Side Length of a Square with Sum Less than or Equal to Threshold", "question__title_slug": "maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold", "question__hide": false, - "total_acs": 11109, - "total_submitted": 21981, + "total_acs": 11154, + "total_submitted": 22078, "total_column_articles": 158, "frontend_question_id": "1292", "is_new_question": false @@ -35376,9 +36027,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": 78960, - "total_submitted": 98027, - "total_column_articles": 979, + "total_acs": 79250, + "total_submitted": 98372, + "total_column_articles": 980, "frontend_question_id": "1290", "is_new_question": false }, @@ -35397,9 +36048,9 @@ "question__title": "Traffic Light Controlled Intersection", "question__title_slug": "traffic-light-controlled-intersection", "question__hide": false, - "total_acs": 2408, - "total_submitted": 4109, - "total_column_articles": 26, + "total_acs": 2423, + "total_submitted": 4178, + "total_column_articles": 27, "frontend_question_id": "1279", "is_new_question": false }, @@ -35418,8 +36069,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": 3895, - "total_submitted": 5724, + "total_acs": 3922, + "total_submitted": 5765, "total_column_articles": 97, "frontend_question_id": "1284", "is_new_question": false @@ -35439,8 +36090,8 @@ "question__title": "Find the Smallest Divisor Given a Threshold", "question__title_slug": "find-the-smallest-divisor-given-a-threshold", "question__hide": false, - "total_acs": 14029, - "total_submitted": 28768, + "total_acs": 14082, + "total_submitted": 28858, "total_column_articles": 184, "frontend_question_id": "1283", "is_new_question": false @@ -35460,9 +36111,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": 49173, - "total_submitted": 56848, - "total_column_articles": 799, + "total_acs": 49248, + "total_submitted": 56931, + "total_column_articles": 800, "frontend_question_id": "1282", "is_new_question": false }, @@ -35481,9 +36132,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": 71364, - "total_submitted": 85807, - "total_column_articles": 913, + "total_acs": 71703, + "total_submitted": 86200, + "total_column_articles": 920, "frontend_question_id": "1281", "is_new_question": false }, @@ -35502,8 +36153,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": 11748, - "total_submitted": 14674, + "total_acs": 11862, + "total_submitted": 14810, "total_column_articles": 131, "frontend_question_id": "1270", "is_new_question": false @@ -35523,8 +36174,8 @@ "question__title": "Print Immutable Linked List in Reverse", "question__title_slug": "print-immutable-linked-list-in-reverse", "question__hide": false, - "total_acs": 4718, - "total_submitted": 5210, + "total_acs": 4806, + "total_submitted": 5298, "total_column_articles": 98, "frontend_question_id": "1265", "is_new_question": false @@ -35544,8 +36195,8 @@ "question__title": "Palindrome Partitioning III", "question__title_slug": "palindrome-partitioning-iii", "question__hide": false, - "total_acs": 6040, - "total_submitted": 9749, + "total_acs": 6089, + "total_submitted": 9815, "total_column_articles": 96, "frontend_question_id": "1278", "is_new_question": false @@ -35565,8 +36216,8 @@ "question__title": "Count Square Submatrices with All Ones", "question__title_slug": "count-square-submatrices-with-all-ones", "question__hide": false, - "total_acs": 30103, - "total_submitted": 40996, + "total_acs": 30244, + "total_submitted": 41180, "total_column_articles": 341, "frontend_question_id": "1277", "is_new_question": false @@ -35586,8 +36237,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": 8757, - "total_submitted": 17421, + "total_acs": 8792, + "total_submitted": 17496, "total_column_articles": 132, "frontend_question_id": "1276", "is_new_question": false @@ -35607,9 +36258,9 @@ "question__title": "Find Winner on a Tic Tac Toe Game", "question__title_slug": "find-winner-on-a-tic-tac-toe-game", "question__hide": false, - "total_acs": 12182, - "total_submitted": 22120, - "total_column_articles": 237, + "total_acs": 12224, + "total_submitted": 22202, + "total_column_articles": 238, "frontend_question_id": "1275", "is_new_question": false }, @@ -35628,8 +36279,8 @@ "question__title": "Page Recommendations", "question__title_slug": "page-recommendations", "question__hide": false, - "total_acs": 12382, - "total_submitted": 21622, + "total_acs": 12485, + "total_submitted": 21813, "total_column_articles": 160, "frontend_question_id": "1264", "is_new_question": false @@ -35649,9 +36300,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": 32473, - "total_submitted": 66279, - "total_column_articles": 348, + "total_acs": 32499, + "total_submitted": 66330, + "total_column_articles": 349, "frontend_question_id": "1269", "is_new_question": false }, @@ -35670,9 +36321,9 @@ "question__title": "Search Suggestions System", "question__title_slug": "search-suggestions-system", "question__hide": false, - "total_acs": 14429, - "total_submitted": 24276, - "total_column_articles": 233, + "total_acs": 14607, + "total_submitted": 24565, + "total_column_articles": 236, "frontend_question_id": "1268", "is_new_question": false }, @@ -35691,9 +36342,9 @@ "question__title": "Count Servers that Communicate", "question__title_slug": "count-servers-that-communicate", "question__hide": false, - "total_acs": 13287, - "total_submitted": 21503, - "total_column_articles": 205, + "total_acs": 13345, + "total_submitted": 21593, + "total_column_articles": 206, "frontend_question_id": "1267", "is_new_question": false }, @@ -35712,9 +36363,9 @@ "question__title": "Minimum Time Visiting All Points", "question__title_slug": "minimum-time-visiting-all-points", "question__hide": false, - "total_acs": 35463, - "total_submitted": 42843, - "total_column_articles": 529, + "total_acs": 35561, + "total_submitted": 42967, + "total_column_articles": 531, "frontend_question_id": "1266", "is_new_question": false }, @@ -35733,8 +36384,8 @@ "question__title": "Minimum Path Cost in a Grid", "question__title_slug": "minimum-path-cost-in-a-grid", "question__hide": false, - "total_acs": 6924, - "total_submitted": 10811, + "total_acs": 6950, + "total_submitted": 10854, "total_column_articles": 125, "frontend_question_id": "2304", "is_new_question": false @@ -35754,9 +36405,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": 6107, - "total_submitted": 11125, - "total_column_articles": 92, + "total_acs": 6187, + "total_submitted": 11231, + "total_column_articles": 93, "frontend_question_id": "2218", "is_new_question": false }, @@ -35775,9 +36426,9 @@ "question__title": "Find the Difference of Two Arrays", "question__title_slug": "find-the-difference-of-two-arrays", "question__hide": false, - "total_acs": 14535, - "total_submitted": 21819, - "total_column_articles": 158, + "total_acs": 15009, + "total_submitted": 22495, + "total_column_articles": 161, "frontend_question_id": "2215", "is_new_question": false }, @@ -35796,9 +36447,9 @@ "question__title": "Counting Elements", "question__title_slug": "counting-elements", "question__hide": false, - "total_acs": 2517, - "total_submitted": 3596, - "total_column_articles": 79, + "total_acs": 2576, + "total_submitted": 3693, + "total_column_articles": 80, "frontend_question_id": "1426", "is_new_question": false }, @@ -35817,9 +36468,9 @@ "question__title": "Average Selling Price", "question__title_slug": "average-selling-price", "question__hide": false, - "total_acs": 20701, - "total_submitted": 27251, - "total_column_articles": 186, + "total_acs": 21474, + "total_submitted": 28335, + "total_column_articles": 189, "frontend_question_id": "1251", "is_new_question": false }, @@ -35838,9 +36489,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": 5319, - "total_submitted": 12100, - "total_column_articles": 94, + "total_acs": 14606, + "total_submitted": 26756, + "total_column_articles": 155, "frontend_question_id": "1263", "is_new_question": false }, @@ -35859,8 +36510,8 @@ "question__title": "Greatest Sum Divisible by Three", "question__title_slug": "greatest-sum-divisible-by-three", "question__hide": false, - "total_acs": 21202, - "total_submitted": 40189, + "total_acs": 21334, + "total_submitted": 40410, "total_column_articles": 288, "frontend_question_id": "1262", "is_new_question": false @@ -35880,8 +36531,8 @@ "question__title": "Find Elements in a Contaminated Binary Tree", "question__title_slug": "find-elements-in-a-contaminated-binary-tree", "question__hide": false, - "total_acs": 11910, - "total_submitted": 16238, + "total_acs": 11962, + "total_submitted": 16298, "total_column_articles": 166, "frontend_question_id": "1261", "is_new_question": false @@ -35901,8 +36552,8 @@ "question__title": "Shift 2D Grid", "question__title_slug": "shift-2d-grid", "question__hide": false, - "total_acs": 42784, - "total_submitted": 65406, + "total_acs": 42865, + "total_submitted": 65532, "total_column_articles": 662, "frontend_question_id": "1260", "is_new_question": false @@ -35922,8 +36573,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": 216, - "total_submitted": 337, + "total_acs": 217, + "total_submitted": 339, "total_column_articles": 15, "frontend_question_id": "2189", "is_new_question": false @@ -35943,8 +36594,8 @@ "question__title": "Maximum Font to Fit a Sentence in a Screen", "question__title_slug": "maximum-font-to-fit-a-sentence-in-a-screen", "question__hide": false, - "total_acs": 801, - "total_submitted": 1293, + "total_acs": 805, + "total_submitted": 1298, "total_column_articles": 27, "frontend_question_id": "1618", "is_new_question": false @@ -35985,8 +36636,8 @@ "question__title": "Calculate Amount Paid in Taxes", "question__title_slug": "calculate-amount-paid-in-taxes", "question__hide": false, - "total_acs": 23601, - "total_submitted": 33468, + "total_acs": 23653, + "total_submitted": 33541, "total_column_articles": 209, "frontend_question_id": "2303", "is_new_question": false @@ -36006,9 +36657,9 @@ "question__title": "Maximum Score Words Formed by Letters", "question__title_slug": "maximum-score-words-formed-by-letters", "question__hide": false, - "total_acs": 17561, - "total_submitted": 21956, - "total_column_articles": 243, + "total_acs": 17597, + "total_submitted": 21998, + "total_column_articles": 244, "frontend_question_id": "1255", "is_new_question": false }, @@ -36027,9 +36678,9 @@ "question__title": "Number of Closed Islands", "question__title_slug": "number-of-closed-islands", "question__hide": false, - "total_acs": 43222, - "total_submitted": 69392, - "total_column_articles": 709, + "total_acs": 43628, + "total_submitted": 70010, + "total_column_articles": 711, "frontend_question_id": "1254", "is_new_question": false }, @@ -36048,8 +36699,8 @@ "question__title": "Reconstruct a 2-Row Binary Matrix", "question__title_slug": "reconstruct-a-2-row-binary-matrix", "question__hide": false, - "total_acs": 7255, - "total_submitted": 17914, + "total_acs": 7301, + "total_submitted": 18000, "total_column_articles": 122, "frontend_question_id": "1253", "is_new_question": false @@ -36069,9 +36720,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": 50119, - "total_submitted": 62981, - "total_column_articles": 654, + "total_acs": 50198, + "total_submitted": 63085, + "total_column_articles": 656, "frontend_question_id": "1252", "is_new_question": false }, @@ -36090,8 +36741,8 @@ "question__title": "Number of Comments per Post", "question__title_slug": "number-of-comments-per-post", "question__hide": false, - "total_acs": 11092, - "total_submitted": 18575, + "total_acs": 11141, + "total_submitted": 18642, "total_column_articles": 94, "frontend_question_id": "1241", "is_new_question": false @@ -36111,8 +36762,8 @@ "question__title": "Selling Pieces of Wood", "question__title_slug": "selling-pieces-of-wood", "question__hide": false, - "total_acs": 4542, - "total_submitted": 8475, + "total_acs": 4557, + "total_submitted": 8509, "total_column_articles": 59, "frontend_question_id": "2312", "is_new_question": false @@ -36132,8 +36783,8 @@ "question__title": "Find Palindrome With Fixed Length", "question__title_slug": "find-palindrome-with-fixed-length", "question__hide": false, - "total_acs": 7178, - "total_submitted": 21392, + "total_acs": 7215, + "total_submitted": 21486, "total_column_articles": 153, "frontend_question_id": "2217", "is_new_question": false @@ -36153,8 +36804,8 @@ "question__title": "Leftmost Column with at Least a One", "question__title_slug": "leftmost-column-with-at-least-a-one", "question__hide": false, - "total_acs": 2264, - "total_submitted": 3694, + "total_acs": 2266, + "total_submitted": 3696, "total_column_articles": 38, "frontend_question_id": "1428", "is_new_question": false @@ -36174,8 +36825,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": 21079, - "total_submitted": 29681, + "total_acs": 21111, + "total_submitted": 29747, "total_column_articles": 153, "frontend_question_id": "1250", "is_new_question": false @@ -36195,9 +36846,9 @@ "question__title": "Minimum Remove to Make Valid Parentheses", "question__title_slug": "minimum-remove-to-make-valid-parentheses", "question__hide": false, - "total_acs": 42719, - "total_submitted": 71982, - "total_column_articles": 555, + "total_acs": 42861, + "total_submitted": 72186, + "total_column_articles": 558, "frontend_question_id": "1249", "is_new_question": false }, @@ -36216,9 +36867,9 @@ "question__title": "Count Number of Nice Subarrays", "question__title_slug": "count-number-of-nice-subarrays", "question__hide": false, - "total_acs": 50323, - "total_submitted": 86947, - "total_column_articles": 633, + "total_acs": 50526, + "total_submitted": 87247, + "total_column_articles": 636, "frontend_question_id": "1248", "is_new_question": false }, @@ -36237,9 +36888,9 @@ "question__title": "Minimum Swaps to Make Strings Equal", "question__title_slug": "minimum-swaps-to-make-strings-equal", "question__hide": false, - "total_acs": 31065, - "total_submitted": 44943, - "total_column_articles": 439, + "total_acs": 31142, + "total_submitted": 45048, + "total_column_articles": 441, "frontend_question_id": "1247", "is_new_question": false }, @@ -36258,8 +36909,8 @@ "question__title": "Web Crawler Multithreaded", "question__title_slug": "web-crawler-multithreaded", "question__hide": false, - "total_acs": 2158, - "total_submitted": 4462, + "total_acs": 2164, + "total_submitted": 4470, "total_column_articles": 27, "frontend_question_id": "1242", "is_new_question": false @@ -36279,8 +36930,8 @@ "question__title": "Maximum Height by Stacking Cuboids ", "question__title_slug": "maximum-height-by-stacking-cuboids", "question__hide": false, - "total_acs": 14820, - "total_submitted": 22793, + "total_acs": 14834, + "total_submitted": 22815, "total_column_articles": 176, "frontend_question_id": "1691", "is_new_question": false @@ -36300,9 +36951,9 @@ "question__title": "First Unique Number", "question__title_slug": "first-unique-number", "question__hide": false, - "total_acs": 2825, - "total_submitted": 5327, - "total_column_articles": 77, + "total_acs": 2901, + "total_submitted": 5457, + "total_column_articles": 82, "frontend_question_id": "1429", "is_new_question": false }, @@ -36321,9 +36972,9 @@ "question__title": "Tuple with Same Product", "question__title_slug": "tuple-with-same-product", "question__hide": false, - "total_acs": 7978, - "total_submitted": 15313, - "total_column_articles": 140, + "total_acs": 8025, + "total_submitted": 15412, + "total_column_articles": 142, "frontend_question_id": "1726", "is_new_question": false }, @@ -36342,9 +36993,9 @@ "question__title": "Greatest English Letter in Upper and Lower Case", "question__title_slug": "greatest-english-letter-in-upper-and-lower-case", "question__hide": false, - "total_acs": 28453, - "total_submitted": 39562, - "total_column_articles": 323, + "total_acs": 28546, + "total_submitted": 39736, + "total_column_articles": 325, "frontend_question_id": "2309", "is_new_question": false }, @@ -36363,8 +37014,8 @@ "question__title": "Airplane Seat Assignment Probability", "question__title_slug": "airplane-seat-assignment-probability", "question__hide": false, - "total_acs": 14040, - "total_submitted": 20968, + "total_acs": 14088, + "total_submitted": 21042, "total_column_articles": 191, "frontend_question_id": "1227", "is_new_question": false @@ -36384,8 +37035,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": 3899, - "total_submitted": 7484, + "total_acs": 3910, + "total_submitted": 7510, "total_column_articles": 58, "frontend_question_id": "1240", "is_new_question": false @@ -36405,8 +37056,8 @@ "question__title": "Maximum Length of a Concatenated String with Unique Characters", "question__title_slug": "maximum-length-of-a-concatenated-string-with-unique-characters", "question__hide": false, - "total_acs": 40511, - "total_submitted": 82484, + "total_acs": 40548, + "total_submitted": 82572, "total_column_articles": 450, "frontend_question_id": "1239", "is_new_question": false @@ -36426,8 +37077,8 @@ "question__title": "Circular Permutation in Binary Representation", "question__title_slug": "circular-permutation-in-binary-representation", "question__hide": false, - "total_acs": 21438, - "total_submitted": 27621, + "total_acs": 21464, + "total_submitted": 27671, "total_column_articles": 226, "frontend_question_id": "1238", "is_new_question": false @@ -36447,8 +37098,8 @@ "question__title": "Find Positive Integer Solution for a Given Equation", "question__title_slug": "find-positive-integer-solution-for-a-given-equation", "question__hide": false, - "total_acs": 31543, - "total_submitted": 40333, + "total_acs": 31588, + "total_submitted": 40391, "total_column_articles": 316, "frontend_question_id": "1237", "is_new_question": false @@ -36468,8 +37119,8 @@ "question__title": "Report Contiguous Dates", "question__title_slug": "report-contiguous-dates", "question__hide": false, - "total_acs": 7411, - "total_submitted": 13849, + "total_acs": 7508, + "total_submitted": 14007, "total_column_articles": 132, "frontend_question_id": "1225", "is_new_question": false @@ -36489,8 +37140,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": 3210, - "total_submitted": 6561, + "total_acs": 3225, + "total_submitted": 6587, "total_column_articles": 64, "frontend_question_id": "2193", "is_new_question": false @@ -36510,8 +37161,8 @@ "question__title": "Minimum Deletions to Make Array Beautiful", "question__title_slug": "minimum-deletions-to-make-array-beautiful", "question__hide": false, - "total_acs": 9351, - "total_submitted": 19267, + "total_acs": 9380, + "total_submitted": 19319, "total_column_articles": 171, "frontend_question_id": "2216", "is_new_question": false @@ -36531,8 +37182,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": 10517, - "total_submitted": 16690, + "total_acs": 10552, + "total_submitted": 16761, "total_column_articles": 116, "frontend_question_id": "2225", "is_new_question": false @@ -36552,9 +37203,9 @@ "question__title": "Find Resultant Array After Removing Anagrams", "question__title_slug": "find-resultant-array-after-removing-anagrams", "question__hide": false, - "total_acs": 11616, - "total_submitted": 19460, - "total_column_articles": 150, + "total_acs": 11681, + "total_submitted": 19565, + "total_column_articles": 153, "frontend_question_id": "2273", "is_new_question": false }, @@ -36573,8 +37224,8 @@ "question__title": "Maximum Profit in Job Scheduling", "question__title_slug": "maximum-profit-in-job-scheduling", "question__hide": false, - "total_acs": 31024, - "total_submitted": 53709, + "total_acs": 31148, + "total_submitted": 53907, "total_column_articles": 378, "frontend_question_id": "1235", "is_new_question": false @@ -36594,8 +37245,8 @@ "question__title": "Replace the Substring for Balanced String", "question__title_slug": "replace-the-substring-for-balanced-string", "question__hide": false, - "total_acs": 29470, - "total_submitted": 65858, + "total_acs": 29756, + "total_submitted": 66386, "total_column_articles": 317, "frontend_question_id": "1234", "is_new_question": false @@ -36615,8 +37266,8 @@ "question__title": "Remove Sub-Folders from the Filesystem", "question__title_slug": "remove-sub-folders-from-the-filesystem", "question__hide": false, - "total_acs": 36176, - "total_submitted": 58798, + "total_acs": 36229, + "total_submitted": 58887, "total_column_articles": 447, "frontend_question_id": "1233", "is_new_question": false @@ -36636,9 +37287,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": 47641, - "total_submitted": 104710, - "total_column_articles": 598, + "total_acs": 47812, + "total_submitted": 105099, + "total_column_articles": 600, "frontend_question_id": "1232", "is_new_question": false }, @@ -36657,8 +37308,8 @@ "question__title": "Maximum Score Of Spliced Array", "question__title_slug": "maximum-score-of-spliced-array", "question__hide": false, - "total_acs": 6374, - "total_submitted": 12505, + "total_acs": 6402, + "total_submitted": 12550, "total_column_articles": 105, "frontend_question_id": "2321", "is_new_question": false @@ -36678,8 +37329,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": 309, - "total_submitted": 405, + "total_acs": 312, + "total_submitted": 409, "total_column_articles": 18, "frontend_question_id": "2204", "is_new_question": false @@ -36699,8 +37350,8 @@ "question__title": "Maximize the Topmost Element After K Moves", "question__title_slug": "maximize-the-topmost-element-after-k-moves", "question__hide": false, - "total_acs": 9034, - "total_submitted": 41885, + "total_acs": 9102, + "total_submitted": 42129, "total_column_articles": 149, "frontend_question_id": "2202", "is_new_question": false @@ -36720,9 +37371,9 @@ "question__title": "Perform String Shifts", "question__title_slug": "perform-string-shifts", "question__hide": false, - "total_acs": 3563, - "total_submitted": 5848, - "total_column_articles": 108, + "total_acs": 3703, + "total_submitted": 6069, + "total_column_articles": 110, "frontend_question_id": "1427", "is_new_question": false }, @@ -36741,9 +37392,9 @@ "question__title": "Maximum Equal Frequency", "question__title_slug": "maximum-equal-frequency", "question__hide": false, - "total_acs": 26767, - "total_submitted": 61363, - "total_column_articles": 295, + "total_acs": 26809, + "total_submitted": 61472, + "total_column_articles": 296, "frontend_question_id": "1224", "is_new_question": false }, @@ -36762,8 +37413,8 @@ "question__title": "Dice Roll Simulation", "question__title_slug": "dice-roll-simulation", "question__hide": false, - "total_acs": 17624, - "total_submitted": 28482, + "total_acs": 17659, + "total_submitted": 28534, "total_column_articles": 186, "frontend_question_id": "1223", "is_new_question": false @@ -36783,8 +37434,8 @@ "question__title": "Queens That Can Attack the King", "question__title_slug": "queens-that-can-attack-the-king", "question__hide": false, - "total_acs": 8859, - "total_submitted": 12789, + "total_acs": 8921, + "total_submitted": 12866, "total_column_articles": 197, "frontend_question_id": "1222", "is_new_question": false @@ -36804,9 +37455,9 @@ "question__title": "Split a String in Balanced Strings", "question__title_slug": "split-a-string-in-balanced-strings", "question__hide": false, - "total_acs": 99202, - "total_submitted": 116760, - "total_column_articles": 1355, + "total_acs": 99569, + "total_submitted": 117188, + "total_column_articles": 1359, "frontend_question_id": "1221", "is_new_question": false }, @@ -36825,8 +37476,8 @@ "question__title": "The Dining Philosophers", "question__title_slug": "the-dining-philosophers", "question__hide": false, - "total_acs": 18114, - "total_submitted": 30456, + "total_acs": 18212, + "total_submitted": 30637, "total_column_articles": 180, "frontend_question_id": "1226", "is_new_question": false @@ -36846,9 +37497,9 @@ "question__title": "Team Scores in Football Tournament", "question__title_slug": "team-scores-in-football-tournament", "question__hide": false, - "total_acs": 9550, - "total_submitted": 18564, - "total_column_articles": 160, + "total_acs": 9677, + "total_submitted": 18810, + "total_column_articles": 162, "frontend_question_id": "1212", "is_new_question": false }, @@ -36867,9 +37518,9 @@ "question__title": "Queries Quality and Percentage", "question__title_slug": "queries-quality-and-percentage", "question__hide": false, - "total_acs": 18044, - "total_submitted": 26660, - "total_column_articles": 126, + "total_acs": 18721, + "total_submitted": 27697, + "total_column_articles": 129, "frontend_question_id": "1211", "is_new_question": false }, @@ -36888,9 +37539,9 @@ "question__title": "Design Skiplist", "question__title_slug": "design-skiplist", "question__hide": false, - "total_acs": 29174, - "total_submitted": 42603, - "total_column_articles": 250, + "total_acs": 29233, + "total_submitted": 42734, + "total_column_articles": 252, "frontend_question_id": "1206", "is_new_question": false }, @@ -36909,8 +37560,8 @@ "question__title": "Maximum Product of the Length of Two Palindromic Substrings", "question__title_slug": "maximum-product-of-the-length-of-two-palindromic-substrings", "question__hide": false, - "total_acs": 1167, - "total_submitted": 3625, + "total_acs": 1171, + "total_submitted": 3640, "total_column_articles": 37, "frontend_question_id": "1960", "is_new_question": false @@ -36930,8 +37581,8 @@ "question__title": "Maximum Candies Allocated to K Children", "question__title_slug": "maximum-candies-allocated-to-k-children", "question__hide": false, - "total_acs": 11210, - "total_submitted": 33019, + "total_acs": 11264, + "total_submitted": 33125, "total_column_articles": 179, "frontend_question_id": "2226", "is_new_question": false @@ -36951,8 +37602,8 @@ "question__title": "Sum of Numbers With Units Digit K", "question__title_slug": "sum-of-numbers-with-units-digit-k", "question__hide": false, - "total_acs": 8634, - "total_submitted": 31446, + "total_acs": 8673, + "total_submitted": 31548, "total_column_articles": 128, "frontend_question_id": "2310", "is_new_question": false @@ -36972,8 +37623,8 @@ "question__title": "Sort the Jumbled Numbers", "question__title_slug": "sort-the-jumbled-numbers", "question__hide": false, - "total_acs": 6838, - "total_submitted": 15757, + "total_acs": 6866, + "total_submitted": 15818, "total_column_articles": 111, "frontend_question_id": "2191", "is_new_question": false @@ -36993,9 +37644,9 @@ "question__title": "Count Vowels Permutation", "question__title_slug": "count-vowels-permutation", "question__hide": false, - "total_acs": 26529, - "total_submitted": 43715, - "total_column_articles": 374, + "total_acs": 26625, + "total_submitted": 43841, + "total_column_articles": 376, "frontend_question_id": "1220", "is_new_question": false }, @@ -37014,9 +37665,9 @@ "question__title": "Path with Maximum Gold", "question__title_slug": "path-with-maximum-gold", "question__hide": false, - "total_acs": 39917, - "total_submitted": 57728, - "total_column_articles": 521, + "total_acs": 40169, + "total_submitted": 58124, + "total_column_articles": 523, "frontend_question_id": "1219", "is_new_question": false }, @@ -37035,9 +37686,9 @@ "question__title": "Longest Arithmetic Subsequence of Given Difference", "question__title_slug": "longest-arithmetic-subsequence-of-given-difference", "question__hide": false, - "total_acs": 43334, - "total_submitted": 83727, - "total_column_articles": 415, + "total_acs": 43553, + "total_submitted": 84191, + "total_column_articles": 417, "frontend_question_id": "1218", "is_new_question": false }, @@ -37056,9 +37707,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": 57053, - "total_submitted": 76398, - "total_column_articles": 744, + "total_acs": 57268, + "total_submitted": 76688, + "total_column_articles": 749, "frontend_question_id": "1217", "is_new_question": false }, @@ -37077,8 +37728,8 @@ "question__title": "Monthly Transactions II", "question__title_slug": "monthly-transactions-ii", "question__hide": false, - "total_acs": 8901, - "total_submitted": 19452, + "total_acs": 8940, + "total_submitted": 19558, "total_column_articles": 109, "frontend_question_id": "1205", "is_new_question": false @@ -37098,9 +37749,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": 10636, - "total_submitted": 14366, - "total_column_articles": 121, + "total_acs": 11053, + "total_submitted": 14925, + "total_column_articles": 125, "frontend_question_id": "1204", "is_new_question": false }, @@ -37119,8 +37770,8 @@ "question__title": "Sum of Floored Pairs", "question__title_slug": "sum-of-floored-pairs", "question__hide": false, - "total_acs": 3674, - "total_submitted": 10757, + "total_acs": 3685, + "total_submitted": 10799, "total_column_articles": 65, "frontend_question_id": "1862", "is_new_question": false @@ -37140,9 +37791,9 @@ "question__title": "Path with Maximum Probability", "question__title_slug": "path-with-maximum-probability", "question__hide": false, - "total_acs": 18716, - "total_submitted": 46418, - "total_column_articles": 253, + "total_acs": 18996, + "total_submitted": 46931, + "total_column_articles": 256, "frontend_question_id": "1514", "is_new_question": false }, @@ -37161,8 +37812,8 @@ "question__title": "Where Will the Ball Fall", "question__title_slug": "where-will-the-ball-fall", "question__hide": false, - "total_acs": 39619, - "total_submitted": 57368, + "total_acs": 39675, + "total_submitted": 57442, "total_column_articles": 691, "frontend_question_id": "1706", "is_new_question": false @@ -37182,8 +37833,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": 15001, - "total_submitted": 23313, + "total_acs": 15031, + "total_submitted": 23357, "total_column_articles": 177, "frontend_question_id": "1210", "is_new_question": false @@ -37203,9 +37854,9 @@ "question__title": "Get Equal Substrings Within Budget", "question__title_slug": "get-equal-substrings-within-budget", "question__hide": false, - "total_acs": 67749, - "total_submitted": 135460, - "total_column_articles": 765, + "total_acs": 68052, + "total_submitted": 136125, + "total_column_articles": 766, "frontend_question_id": "1208", "is_new_question": false }, @@ -37224,8 +37875,8 @@ "question__title": "Remove All Adjacent Duplicates in String II", "question__title_slug": "remove-all-adjacent-duplicates-in-string-ii", "question__hide": false, - "total_acs": 19512, - "total_submitted": 38398, + "total_acs": 19616, + "total_submitted": 38637, "total_column_articles": 226, "frontend_question_id": "1209", "is_new_question": false @@ -37245,9 +37896,9 @@ "question__title": "Unique Number of Occurrences", "question__title_slug": "unique-number-of-occurrences", "question__hide": false, - "total_acs": 80071, - "total_submitted": 110088, - "total_column_articles": 1034, + "total_acs": 80840, + "total_submitted": 111142, + "total_column_articles": 1040, "frontend_question_id": "1207", "is_new_question": false }, @@ -37266,8 +37917,8 @@ "question__title": "Tournament Winners", "question__title_slug": "tournament-winners", "question__hide": false, - "total_acs": 6683, - "total_submitted": 13127, + "total_acs": 6744, + "total_submitted": 13228, "total_column_articles": 99, "frontend_question_id": "1194", "is_new_question": false @@ -37287,9 +37938,9 @@ "question__title": "Monthly Transactions I", "question__title_slug": "monthly-transactions-i", "question__hide": false, - "total_acs": 15739, - "total_submitted": 25857, - "total_column_articles": 144, + "total_acs": 16340, + "total_submitted": 26787, + "total_column_articles": 147, "frontend_question_id": "1193", "is_new_question": false }, @@ -37308,9 +37959,9 @@ "question__title": "Fizz Buzz Multithreaded", "question__title_slug": "fizz-buzz-multithreaded", "question__hide": false, - "total_acs": 20648, - "total_submitted": 31734, - "total_column_articles": 355, + "total_acs": 20772, + "total_submitted": 31925, + "total_column_articles": 357, "frontend_question_id": "1195", "is_new_question": false }, @@ -37329,9 +37980,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": 1912, - "total_submitted": 3438, - "total_column_articles": 31, + "total_acs": 1921, + "total_submitted": 3450, + "total_column_articles": 32, "frontend_question_id": "1916", "is_new_question": false }, @@ -37350,8 +38001,8 @@ "question__title": "Count Artifacts That Can Be Extracted", "question__title_slug": "count-artifacts-that-can-be-extracted", "question__hide": false, - "total_acs": 8445, - "total_submitted": 17150, + "total_acs": 8478, + "total_submitted": 17192, "total_column_articles": 137, "frontend_question_id": "2201", "is_new_question": false @@ -37371,9 +38022,9 @@ "question__title": "Largest Magic Square", "question__title_slug": "largest-magic-square", "question__hide": false, - "total_acs": 3102, - "total_submitted": 5540, - "total_column_articles": 60, + "total_acs": 3126, + "total_submitted": 5583, + "total_column_articles": 61, "frontend_question_id": "1895", "is_new_question": false }, @@ -37392,9 +38043,9 @@ "question__title": "Watering Plants", "question__title_slug": "watering-plants", "question__hide": false, - "total_acs": 8607, - "total_submitted": 11070, - "total_column_articles": 157, + "total_acs": 8646, + "total_submitted": 11120, + "total_column_articles": 159, "frontend_question_id": "2079", "is_new_question": false }, @@ -37413,8 +38064,8 @@ "question__title": "Sort Items by Groups Respecting Dependencies", "question__title_slug": "sort-items-by-groups-respecting-dependencies", "question__hide": false, - "total_acs": 14013, - "total_submitted": 23007, + "total_acs": 14054, + "total_submitted": 23092, "total_column_articles": 175, "frontend_question_id": "1203", "is_new_question": false @@ -37434,8 +38085,8 @@ "question__title": "Smallest String With Swaps", "question__title_slug": "smallest-string-with-swaps", "question__hide": false, - "total_acs": 31843, - "total_submitted": 62176, + "total_acs": 31895, + "total_submitted": 62250, "total_column_articles": 369, "frontend_question_id": "1202", "is_new_question": false @@ -37455,8 +38106,8 @@ "question__title": "Ugly Number III", "question__title_slug": "ugly-number-iii", "question__hide": false, - "total_acs": 11485, - "total_submitted": 40486, + "total_acs": 11562, + "total_submitted": 40721, "total_column_articles": 153, "frontend_question_id": "1201", "is_new_question": false @@ -37476,8 +38127,8 @@ "question__title": "Minimum Absolute Difference", "question__title_slug": "minimum-absolute-difference", "question__hide": false, - "total_acs": 57274, - "total_submitted": 78996, + "total_acs": 57418, + "total_submitted": 79195, "total_column_articles": 625, "frontend_question_id": "1200", "is_new_question": false @@ -37497,8 +38148,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": 5581, - "total_submitted": 8833, + "total_acs": 5638, + "total_submitted": 8908, "total_column_articles": 112, "frontend_question_id": "1944", "is_new_question": false @@ -37518,8 +38169,8 @@ "question__title": "Longest Happy String", "question__title_slug": "longest-happy-string", "question__hide": false, - "total_acs": 29659, - "total_submitted": 46674, + "total_acs": 29695, + "total_submitted": 46722, "total_column_articles": 521, "frontend_question_id": "1405", "is_new_question": false @@ -37539,8 +38190,8 @@ "question__title": "Minimum Moves to Reach Target Score", "question__title_slug": "minimum-moves-to-reach-target-score", "question__hide": false, - "total_acs": 8997, - "total_submitted": 17486, + "total_acs": 9027, + "total_submitted": 17538, "total_column_articles": 164, "frontend_question_id": "2139", "is_new_question": false @@ -37560,9 +38211,9 @@ "question__title": "Delete Characters to Make Fancy String", "question__title_slug": "delete-characters-to-make-fancy-string", "question__hide": false, - "total_acs": 10342, - "total_submitted": 17218, - "total_column_articles": 136, + "total_acs": 10425, + "total_submitted": 17349, + "total_column_articles": 138, "frontend_question_id": "1957", "is_new_question": false }, @@ -37581,8 +38232,8 @@ "question__title": "Reformat Department Table", "question__title_slug": "reformat-department-table", "question__hide": false, - "total_acs": 46052, - "total_submitted": 71190, + "total_acs": 46291, + "total_submitted": 71510, "total_column_articles": 265, "frontend_question_id": "1179", "is_new_question": false @@ -37602,9 +38253,9 @@ "question__title": "Critical Connections in a Network", "question__title_slug": "critical-connections-in-a-network", "question__hide": false, - "total_acs": 8084, - "total_submitted": 14933, - "total_column_articles": 107, + "total_acs": 8179, + "total_submitted": 15086, + "total_column_articles": 108, "frontend_question_id": "1192", "is_new_question": false }, @@ -37623,8 +38274,8 @@ "question__title": "K-Concatenation Maximum Sum", "question__title_slug": "k-concatenation-maximum-sum", "question__hide": false, - "total_acs": 8287, - "total_submitted": 30769, + "total_acs": 8329, + "total_submitted": 30895, "total_column_articles": 135, "frontend_question_id": "1191", "is_new_question": false @@ -37644,9 +38295,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": 59285, - "total_submitted": 91553, - "total_column_articles": 743, + "total_acs": 59461, + "total_submitted": 91841, + "total_column_articles": 744, "frontend_question_id": "1190", "is_new_question": false }, @@ -37665,9 +38316,9 @@ "question__title": "Maximum Number of Balloons", "question__title_slug": "maximum-number-of-balloons", "question__hide": false, - "total_acs": 58777, - "total_submitted": 86083, - "total_column_articles": 808, + "total_acs": 58951, + "total_submitted": 86318, + "total_column_articles": 809, "frontend_question_id": "1189", "is_new_question": false }, @@ -37686,9 +38337,9 @@ "question__title": "Kth Ancestor of a Tree Node", "question__title_slug": "kth-ancestor-of-a-tree-node", "question__hide": false, - "total_acs": 5544, - "total_submitted": 16328, - "total_column_articles": 103, + "total_acs": 5572, + "total_submitted": 16437, + "total_column_articles": 105, "frontend_question_id": "1483", "is_new_question": false }, @@ -37707,8 +38358,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": 6019, - "total_submitted": 12123, + "total_acs": 6043, + "total_submitted": 12172, "total_column_articles": 93, "frontend_question_id": "1954", "is_new_question": false @@ -37728,8 +38379,8 @@ "question__title": "Range Frequency Queries", "question__title_slug": "range-frequency-queries", "question__hide": false, - "total_acs": 8513, - "total_submitted": 27306, + "total_acs": 8564, + "total_submitted": 27419, "total_column_articles": 178, "frontend_question_id": "2080", "is_new_question": false @@ -37749,9 +38400,9 @@ "question__title": "Three Consecutive Odds", "question__title_slug": "three-consecutive-odds", "question__hide": false, - "total_acs": 28846, - "total_submitted": 44014, - "total_column_articles": 394, + "total_acs": 28968, + "total_submitted": 44191, + "total_column_articles": 397, "frontend_question_id": "1550", "is_new_question": false }, @@ -37770,9 +38421,9 @@ "question__title": "Immediate Food Delivery II", "question__title_slug": "immediate-food-delivery-ii", "question__hide": false, - "total_acs": 10267, - "total_submitted": 16333, - "total_column_articles": 101, + "total_acs": 10781, + "total_submitted": 17222, + "total_column_articles": 105, "frontend_question_id": "1174", "is_new_question": false }, @@ -37791,9 +38442,9 @@ "question__title": "Immediate Food Delivery I", "question__title_slug": "immediate-food-delivery-i", "question__hide": false, - "total_acs": 18731, - "total_submitted": 24457, - "total_column_articles": 137, + "total_acs": 18837, + "total_submitted": 24590, + "total_column_articles": 138, "frontend_question_id": "1173", "is_new_question": false }, @@ -37812,9 +38463,9 @@ "question__title": "Make Array Strictly Increasing", "question__title_slug": "make-array-strictly-increasing", "question__hide": false, - "total_acs": 13752, - "total_submitted": 22996, - "total_column_articles": 114, + "total_acs": 13813, + "total_submitted": 23085, + "total_column_articles": 115, "frontend_question_id": "1187", "is_new_question": false }, @@ -37833,9 +38484,9 @@ "question__title": "Day of the Week", "question__title_slug": "day-of-the-week", "question__hide": false, - "total_acs": 39030, - "total_submitted": 62698, - "total_column_articles": 530, + "total_acs": 39111, + "total_submitted": 62836, + "total_column_articles": 531, "frontend_question_id": "1185", "is_new_question": false }, @@ -37854,9 +38505,9 @@ "question__title": "Maximum Subarray Sum with One Deletion", "question__title_slug": "maximum-subarray-sum-with-one-deletion", "question__hide": false, - "total_acs": 12303, - "total_submitted": 28959, - "total_column_articles": 175, + "total_acs": 12369, + "total_submitted": 29076, + "total_column_articles": 176, "frontend_question_id": "1186", "is_new_question": false }, @@ -37875,9 +38526,9 @@ "question__title": "Distance Between Bus Stops", "question__title_slug": "distance-between-bus-stops", "question__hide": false, - "total_acs": 41403, - "total_submitted": 66950, - "total_column_articles": 617, + "total_acs": 41493, + "total_submitted": 67113, + "total_column_articles": 618, "frontend_question_id": "1184", "is_new_question": false }, @@ -37896,9 +38547,9 @@ "question__title": "Constrained Subsequence Sum", "question__title_slug": "constrained-subsequence-sum", "question__hide": false, - "total_acs": 6269, - "total_submitted": 13209, - "total_column_articles": 114, + "total_acs": 6332, + "total_submitted": 13346, + "total_column_articles": 115, "frontend_question_id": "1425", "is_new_question": false }, @@ -37917,9 +38568,9 @@ "question__title": "Balance a Binary Search Tree", "question__title_slug": "balance-a-binary-search-tree", "question__hide": false, - "total_acs": 22871, - "total_submitted": 31176, - "total_column_articles": 289, + "total_acs": 23164, + "total_submitted": 31566, + "total_column_articles": 290, "frontend_question_id": "1382", "is_new_question": false }, @@ -37938,8 +38589,8 @@ "question__title": "Four Divisors", "question__title_slug": "four-divisors", "question__hide": false, - "total_acs": 9133, - "total_submitted": 23683, + "total_acs": 9195, + "total_submitted": 23817, "total_column_articles": 144, "frontend_question_id": "1390", "is_new_question": false @@ -37959,9 +38610,9 @@ "question__title": "Reformat Date", "question__title_slug": "reformat-date", "question__hide": false, - "total_acs": 15018, - "total_submitted": 25524, - "total_column_articles": 208, + "total_acs": 15098, + "total_submitted": 25638, + "total_column_articles": 209, "frontend_question_id": "1507", "is_new_question": false }, @@ -37980,9 +38631,9 @@ "question__title": "Number of Valid Words for Each Puzzle", "question__title_slug": "number-of-valid-words-for-each-puzzle", "question__hide": false, - "total_acs": 20154, - "total_submitted": 43252, - "total_column_articles": 200, + "total_acs": 20223, + "total_submitted": 43353, + "total_column_articles": 201, "frontend_question_id": "1178", "is_new_question": false }, @@ -38001,8 +38652,8 @@ "question__title": "Can Make Palindrome from Substring", "question__title_slug": "can-make-palindrome-from-substring", "question__hide": false, - "total_acs": 8632, - "total_submitted": 28593, + "total_acs": 8672, + "total_submitted": 28661, "total_column_articles": 143, "frontend_question_id": "1177", "is_new_question": false @@ -38022,8 +38673,8 @@ "question__title": "Diet Plan Performance", "question__title_slug": "diet-plan-performance", "question__hide": false, - "total_acs": 5850, - "total_submitted": 12098, + "total_acs": 5873, + "total_submitted": 12125, "total_column_articles": 96, "frontend_question_id": "1176", "is_new_question": false @@ -38043,8 +38694,8 @@ "question__title": "Prime Arrangements", "question__title_slug": "prime-arrangements", "question__hide": false, - "total_acs": 32289, - "total_submitted": 57327, + "total_acs": 32360, + "total_submitted": 57439, "total_column_articles": 379, "frontend_question_id": "1175", "is_new_question": false @@ -38064,9 +38715,9 @@ "question__title": "Product Price at a Given Date", "question__title_slug": "product-price-at-a-given-date", "question__hide": false, - "total_acs": 14316, - "total_submitted": 24046, - "total_column_articles": 172, + "total_acs": 14818, + "total_submitted": 25033, + "total_column_articles": 176, "frontend_question_id": "1164", "is_new_question": false }, @@ -38085,9 +38736,9 @@ "question__title": "Largest Multiple of Three", "question__title_slug": "largest-multiple-of-three", "question__hide": false, - "total_acs": 7617, - "total_submitted": 21161, - "total_column_articles": 132, + "total_acs": 7655, + "total_submitted": 21264, + "total_column_articles": 133, "frontend_question_id": "1363", "is_new_question": false }, @@ -38106,8 +38757,8 @@ "question__title": "Closest Divisors", "question__title_slug": "closest-divisors", "question__hide": false, - "total_acs": 7840, - "total_submitted": 14360, + "total_acs": 7864, + "total_submitted": 14398, "total_column_articles": 97, "frontend_question_id": "1362", "is_new_question": false @@ -38127,9 +38778,9 @@ "question__title": "Validate Binary Tree Nodes", "question__title_slug": "validate-binary-tree-nodes", "question__hide": false, - "total_acs": 11984, - "total_submitted": 29980, - "total_column_articles": 299, + "total_acs": 12043, + "total_submitted": 30153, + "total_column_articles": 300, "frontend_question_id": "1361", "is_new_question": false }, @@ -38148,9 +38799,9 @@ "question__title": "Number of Days Between Two Dates", "question__title_slug": "number-of-days-between-two-dates", "question__hide": false, - "total_acs": 14970, - "total_submitted": 29319, - "total_column_articles": 232, + "total_acs": 15067, + "total_submitted": 29495, + "total_column_articles": 235, "frontend_question_id": "1360", "is_new_question": false }, @@ -38169,8 +38820,8 @@ "question__title": "Compare Strings by Frequency of the Smallest Character", "question__title_slug": "compare-strings-by-frequency-of-the-smallest-character", "question__hide": false, - "total_acs": 16741, - "total_submitted": 27120, + "total_acs": 16796, + "total_submitted": 27203, "total_column_articles": 286, "frontend_question_id": "1170", "is_new_question": false @@ -38190,8 +38841,8 @@ "question__title": "Invalid Transactions", "question__title_slug": "invalid-transactions", "question__hide": false, - "total_acs": 9240, - "total_submitted": 28005, + "total_acs": 9264, + "total_submitted": 28064, "total_column_articles": 110, "frontend_question_id": "1169", "is_new_question": false @@ -38211,8 +38862,8 @@ "question__title": "Web Crawler", "question__title_slug": "web-crawler", "question__hide": false, - "total_acs": 1725, - "total_submitted": 2990, + "total_acs": 1756, + "total_submitted": 3053, "total_column_articles": 42, "frontend_question_id": "1236", "is_new_question": false @@ -38232,9 +38883,9 @@ "question__title": "Dinner Plate Stacks", "question__title_slug": "dinner-plate-stacks", "question__hide": false, - "total_acs": 12885, - "total_submitted": 32192, - "total_column_articles": 158, + "total_acs": 13105, + "total_submitted": 32808, + "total_column_articles": 159, "frontend_question_id": "1172", "is_new_question": false }, @@ -38253,8 +38904,8 @@ "question__title": "Market Analysis II", "question__title_slug": "market-analysis-ii", "question__hide": false, - "total_acs": 7116, - "total_submitted": 14089, + "total_acs": 7155, + "total_submitted": 14155, "total_column_articles": 121, "frontend_question_id": "1159", "is_new_question": false @@ -38274,9 +38925,9 @@ "question__title": "Market Analysis I", "question__title_slug": "market-analysis-i", "question__hide": false, - "total_acs": 35947, - "total_submitted": 65672, - "total_column_articles": 263, + "total_acs": 36263, + "total_submitted": 66306, + "total_column_articles": 264, "frontend_question_id": "1158", "is_new_question": false }, @@ -38295,9 +38946,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": 20508, - "total_submitted": 42364, - "total_column_articles": 232, + "total_acs": 20616, + "total_submitted": 42552, + "total_column_articles": 233, "frontend_question_id": "1171", "is_new_question": false }, @@ -38316,9 +38967,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": 13226, - "total_submitted": 18620, - "total_column_articles": 229, + "total_acs": 13324, + "total_submitted": 18757, + "total_column_articles": 230, "frontend_question_id": "1935", "is_new_question": false }, @@ -38337,9 +38988,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": 18842, - "total_submitted": 37110, - "total_column_articles": 201, + "total_acs": 18930, + "total_submitted": 37271, + "total_column_articles": 202, "frontend_question_id": "1155", "is_new_question": false }, @@ -38358,9 +39009,9 @@ "question__title": "Online Majority Element In Subarray", "question__title_slug": "online-majority-element-in-subarray", "question__hide": false, - "total_acs": 13813, - "total_submitted": 29976, - "total_column_articles": 125, + "total_acs": 13866, + "total_submitted": 30092, + "total_column_articles": 127, "frontend_question_id": "1157", "is_new_question": false }, @@ -38379,9 +39030,9 @@ "question__title": "Swap For Longest Repeated Character Substring", "question__title_slug": "swap-for-longest-repeated-character-substring", "question__hide": false, - "total_acs": 8423, - "total_submitted": 19494, - "total_column_articles": 176, + "total_acs": 8512, + "total_submitted": 19712, + "total_column_articles": 177, "frontend_question_id": "1156", "is_new_question": false }, @@ -38400,9 +39051,9 @@ "question__title": "Day of the Year", "question__title_slug": "day-of-the-year", "question__hide": false, - "total_acs": 56046, - "total_submitted": 89547, - "total_column_articles": 639, + "total_acs": 56236, + "total_submitted": 89845, + "total_column_articles": 640, "frontend_question_id": "1154", "is_new_question": false }, @@ -38421,8 +39072,8 @@ "question__title": "Article Views II", "question__title_slug": "article-views-ii", "question__hide": false, - "total_acs": 10234, - "total_submitted": 23048, + "total_acs": 10273, + "total_submitted": 23131, "total_column_articles": 75, "frontend_question_id": "1149", "is_new_question": false @@ -38442,9 +39093,9 @@ "question__title": "Article Views I", "question__title_slug": "article-views-i", "question__hide": false, - "total_acs": 50807, - "total_submitted": 70921, - "total_column_articles": 169, + "total_acs": 52094, + "total_submitted": 72813, + "total_column_articles": 174, "frontend_question_id": "1148", "is_new_question": false }, @@ -38463,8 +39114,8 @@ "question__title": "Rank Transform of a Matrix", "question__title_slug": "rank-transform-of-a-matrix", "question__hide": false, - "total_acs": 10343, - "total_submitted": 17946, + "total_acs": 10358, + "total_submitted": 17988, "total_column_articles": 97, "frontend_question_id": "1632", "is_new_question": false @@ -38484,9 +39135,9 @@ "question__title": "Rank Transform of an Array", "question__title_slug": "rank-transform-of-an-array", "question__hide": false, - "total_acs": 45532, - "total_submitted": 75398, - "total_column_articles": 525, + "total_acs": 45669, + "total_submitted": 75614, + "total_column_articles": 526, "frontend_question_id": "1331", "is_new_question": false }, @@ -38505,9 +39156,9 @@ "question__title": "Reverse Subarray To Maximize Array Value", "question__title_slug": "reverse-subarray-to-maximize-array-value", "question__hide": false, - "total_acs": 2018, - "total_submitted": 4776, - "total_column_articles": 42, + "total_acs": 10418, + "total_submitted": 18017, + "total_column_articles": 79, "frontend_question_id": "1330", "is_new_question": false }, @@ -38526,8 +39177,8 @@ "question__title": "Deepest Leaves Sum", "question__title_slug": "deepest-leaves-sum", "question__hide": false, - "total_acs": 62696, - "total_submitted": 73318, + "total_acs": 62829, + "total_submitted": 73491, "total_column_articles": 768, "frontend_question_id": "1302", "is_new_question": false @@ -38547,9 +39198,9 @@ "question__title": "Sort the Matrix Diagonally", "question__title_slug": "sort-the-matrix-diagonally", "question__hide": false, - "total_acs": 11488, - "total_submitted": 14757, - "total_column_articles": 238, + "total_acs": 11545, + "total_submitted": 14818, + "total_column_articles": 239, "frontend_question_id": "1329", "is_new_question": false }, @@ -38568,8 +39219,8 @@ "question__title": "Break a Palindrome", "question__title_slug": "break-a-palindrome", "question__hide": false, - "total_acs": 9116, - "total_submitted": 19396, + "total_acs": 9158, + "total_submitted": 19470, "total_column_articles": 167, "frontend_question_id": "1328", "is_new_question": false @@ -38589,8 +39240,8 @@ "question__title": "Longest Chunked Palindrome Decomposition", "question__title_slug": "longest-chunked-palindrome-decomposition", "question__hide": false, - "total_acs": 22737, - "total_submitted": 38533, + "total_acs": 22791, + "total_submitted": 38625, "total_column_articles": 361, "frontend_question_id": "1147", "is_new_question": false @@ -38610,9 +39261,9 @@ "question__title": "Longest Common Subsequence", "question__title_slug": "longest-common-subsequence", "question__hide": false, - "total_acs": 332626, - "total_submitted": 512246, - "total_column_articles": 1837, + "total_acs": 335605, + "total_submitted": 516904, + "total_column_articles": 1846, "frontend_question_id": "1143", "is_new_question": false }, @@ -38631,8 +39282,8 @@ "question__title": "Snapshot Array", "question__title_slug": "snapshot-array", "question__hide": false, - "total_acs": 8955, - "total_submitted": 26920, + "total_acs": 9046, + "total_submitted": 27196, "total_column_articles": 114, "frontend_question_id": "1146", "is_new_question": false @@ -38652,8 +39303,8 @@ "question__title": "Binary Tree Coloring Game", "question__title_slug": "binary-tree-coloring-game", "question__hide": false, - "total_acs": 26302, - "total_submitted": 47483, + "total_acs": 26344, + "total_submitted": 47551, "total_column_articles": 382, "frontend_question_id": "1145", "is_new_question": false @@ -38673,8 +39324,8 @@ "question__title": "Decrease Elements To Make Array Zigzag", "question__title_slug": "decrease-elements-to-make-array-zigzag", "question__hide": false, - "total_acs": 32083, - "total_submitted": 63486, + "total_acs": 32131, + "total_submitted": 63561, "total_column_articles": 339, "frontend_question_id": "1144", "is_new_question": false @@ -38694,8 +39345,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": 12316, - "total_submitted": 33045, + "total_acs": 12352, + "total_submitted": 33157, "total_column_articles": 71, "frontend_question_id": "1142", "is_new_question": false @@ -38715,9 +39366,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": 50458, - "total_submitted": 111693, - "total_column_articles": 304, + "total_acs": 51223, + "total_submitted": 113468, + "total_column_articles": 305, "frontend_question_id": "1141", "is_new_question": false }, @@ -38736,9 +39387,9 @@ "question__title": "Distinct Echo Substrings", "question__title_slug": "distinct-echo-substrings", "question__hide": false, - "total_acs": 4803, - "total_submitted": 9989, - "total_column_articles": 86, + "total_acs": 4841, + "total_submitted": 10054, + "total_column_articles": 88, "frontend_question_id": "1316", "is_new_question": false }, @@ -38757,9 +39408,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": 17783, - "total_submitted": 21806, - "total_column_articles": 369, + "total_acs": 17852, + "total_submitted": 21891, + "total_column_articles": 371, "frontend_question_id": "1315", "is_new_question": false }, @@ -38778,9 +39429,9 @@ "question__title": "Matrix Block Sum", "question__title_slug": "matrix-block-sum", "question__hide": false, - "total_acs": 23528, - "total_submitted": 31103, - "total_column_articles": 367, + "total_acs": 23614, + "total_submitted": 31228, + "total_column_articles": 369, "frontend_question_id": "1314", "is_new_question": false }, @@ -38799,9 +39450,9 @@ "question__title": "Decompress Run-Length Encoded List", "question__title_slug": "decompress-run-length-encoded-list", "question__hide": false, - "total_acs": 42851, - "total_submitted": 51513, - "total_column_articles": 645, + "total_acs": 42963, + "total_submitted": 51637, + "total_column_articles": 646, "frontend_question_id": "1313", "is_new_question": false }, @@ -38820,8 +39471,8 @@ "question__title": "Stone Game II", "question__title_slug": "stone-game-ii", "question__hide": false, - "total_acs": 25031, - "total_submitted": 35521, + "total_acs": 25102, + "total_submitted": 35633, "total_column_articles": 221, "frontend_question_id": "1140", "is_new_question": false @@ -38841,9 +39492,9 @@ "question__title": "Largest 1-Bordered Square", "question__title_slug": "largest-1-bordered-square", "question__hide": false, - "total_acs": 30786, - "total_submitted": 54877, - "total_column_articles": 367, + "total_acs": 30860, + "total_submitted": 55003, + "total_column_articles": 370, "frontend_question_id": "1139", "is_new_question": false }, @@ -38862,8 +39513,8 @@ "question__title": "Alphabet Board Path", "question__title_slug": "alphabet-board-path", "question__hide": false, - "total_acs": 25896, - "total_submitted": 50017, + "total_acs": 25931, + "total_submitted": 50096, "total_column_articles": 439, "frontend_question_id": "1138", "is_new_question": false @@ -38883,8 +39534,8 @@ "question__title": "Reported Posts II", "question__title_slug": "reported-posts-ii", "question__hide": false, - "total_acs": 8909, - "total_submitted": 22988, + "total_acs": 8957, + "total_submitted": 23087, "total_column_articles": 79, "frontend_question_id": "1132", "is_new_question": false @@ -38904,9 +39555,9 @@ "question__title": "N-th Tribonacci Number", "question__title_slug": "n-th-tribonacci-number", "question__hide": false, - "total_acs": 151986, - "total_submitted": 249148, - "total_column_articles": 1403, + "total_acs": 152976, + "total_submitted": 250714, + "total_column_articles": 1406, "frontend_question_id": "1137", "is_new_question": false }, @@ -38925,9 +39576,9 @@ "question__title": "Number of Paths with Max Score", "question__title_slug": "number-of-paths-with-max-score", "question__hide": false, - "total_acs": 6701, - "total_submitted": 17827, - "total_column_articles": 143, + "total_acs": 6755, + "total_submitted": 17939, + "total_column_articles": 146, "frontend_question_id": "1301", "is_new_question": false }, @@ -38946,8 +39597,8 @@ "question__title": "Number of Ships in a Rectangle", "question__title_slug": "number-of-ships-in-a-rectangle", "question__hide": false, - "total_acs": 1568, - "total_submitted": 2422, + "total_acs": 1580, + "total_submitted": 2437, "total_column_articles": 36, "frontend_question_id": "1274", "is_new_question": false @@ -38967,8 +39618,8 @@ "question__title": "Sum of Mutated Array Closest to Target", "question__title_slug": "sum-of-mutated-array-closest-to-target", "question__hide": false, - "total_acs": 30556, - "total_submitted": 65431, + "total_acs": 30621, + "total_submitted": 65549, "total_column_articles": 447, "frontend_question_id": "1300", "is_new_question": false @@ -38988,9 +39639,9 @@ "question__title": "Replace Elements with Greatest Element on Right Side", "question__title_slug": "replace-elements-with-greatest-element-on-right-side", "question__hide": false, - "total_acs": 40329, - "total_submitted": 52176, - "total_column_articles": 556, + "total_acs": 40479, + "total_submitted": 52377, + "total_column_articles": 558, "frontend_question_id": "1299", "is_new_question": false }, @@ -39009,9 +39660,9 @@ "question__title": "Maximum of Absolute Value Expression", "question__title_slug": "maximum-of-absolute-value-expression", "question__hide": false, - "total_acs": 4459, - "total_submitted": 9413, - "total_column_articles": 68, + "total_acs": 4504, + "total_submitted": 9498, + "total_column_articles": 69, "frontend_question_id": "1131", "is_new_question": false }, @@ -39030,9 +39681,9 @@ "question__title": "Shortest Path with Alternating Colors", "question__title_slug": "shortest-path-with-alternating-colors", "question__hide": false, - "total_acs": 28156, - "total_submitted": 57732, - "total_column_articles": 395, + "total_acs": 28289, + "total_submitted": 58064, + "total_column_articles": 397, "frontend_question_id": "1129", "is_new_question": false }, @@ -39051,9 +39702,9 @@ "question__title": "Minimum Cost Tree From Leaf Values", "question__title_slug": "minimum-cost-tree-from-leaf-values", "question__hide": false, - "total_acs": 9049, - "total_submitted": 13950, - "total_column_articles": 150, + "total_acs": 9101, + "total_submitted": 14014, + "total_column_articles": 151, "frontend_question_id": "1130", "is_new_question": false }, @@ -39072,8 +39723,8 @@ "question__title": "Number of Equivalent Domino Pairs", "question__title_slug": "number-of-equivalent-domino-pairs", "question__hide": false, - "total_acs": 43541, - "total_submitted": 80478, + "total_acs": 43613, + "total_submitted": 80609, "total_column_articles": 546, "frontend_question_id": "1128", "is_new_question": false @@ -39093,8 +39744,8 @@ "question__title": "User Purchase Platform", "question__title_slug": "user-purchase-platform", "question__hide": false, - "total_acs": 7680, - "total_submitted": 17925, + "total_acs": 7721, + "total_submitted": 18006, "total_column_articles": 106, "frontend_question_id": "1127", "is_new_question": false @@ -39114,8 +39765,8 @@ "question__title": "Active Businesses", "question__title_slug": "active-businesses", "question__hide": false, - "total_acs": 13464, - "total_submitted": 19756, + "total_acs": 13549, + "total_submitted": 19877, "total_column_articles": 148, "frontend_question_id": "1126", "is_new_question": false @@ -39135,8 +39786,8 @@ "question__title": "Minimum Falling Path Sum II", "question__title_slug": "minimum-falling-path-sum-ii", "question__hide": false, - "total_acs": 14442, - "total_submitted": 24661, + "total_acs": 14564, + "total_submitted": 24853, "total_column_articles": 181, "frontend_question_id": "1289", "is_new_question": false @@ -39156,8 +39807,8 @@ "question__title": "Graph Connectivity With Threshold", "question__title_slug": "graph-connectivity-with-threshold", "question__hide": false, - "total_acs": 3990, - "total_submitted": 9502, + "total_acs": 4011, + "total_submitted": 9538, "total_column_articles": 62, "frontend_question_id": "1627", "is_new_question": false @@ -39177,9 +39828,9 @@ "question__title": "Remove Covered Intervals", "question__title_slug": "remove-covered-intervals", "question__hide": false, - "total_acs": 26860, - "total_submitted": 47952, - "total_column_articles": 285, + "total_acs": 27048, + "total_submitted": 48284, + "total_column_articles": 288, "frontend_question_id": "1288", "is_new_question": false }, @@ -39198,8 +39849,8 @@ "question__title": "Element Appearing More Than 25% In Sorted Array", "question__title_slug": "element-appearing-more-than-25-in-sorted-array", "question__hide": false, - "total_acs": 24152, - "total_submitted": 41059, + "total_acs": 24313, + "total_submitted": 41350, "total_column_articles": 343, "frontend_question_id": "1287", "is_new_question": false @@ -39219,8 +39870,8 @@ "question__title": "Smallest Sufficient Team", "question__title_slug": "smallest-sufficient-team", "question__hide": false, - "total_acs": 15576, - "total_submitted": 25459, + "total_acs": 15644, + "total_submitted": 25563, "total_column_articles": 146, "frontend_question_id": "1125", "is_new_question": false @@ -39240,9 +39891,9 @@ "question__title": "Longest Well-Performing Interval", "question__title_slug": "longest-well-performing-interval", "question__hide": false, - "total_acs": 42026, - "total_submitted": 107343, - "total_column_articles": 368, + "total_acs": 42143, + "total_submitted": 107594, + "total_column_articles": 370, "frontend_question_id": "1124", "is_new_question": false }, @@ -39261,8 +39912,8 @@ "question__title": "Lowest Common Ancestor of Deepest Leaves", "question__title_slug": "lowest-common-ancestor-of-deepest-leaves", "question__hide": false, - "total_acs": 12978, - "total_submitted": 18124, + "total_acs": 13061, + "total_submitted": 18227, "total_column_articles": 168, "frontend_question_id": "1123", "is_new_question": false @@ -39282,9 +39933,9 @@ "question__title": "Relative Sort Array", "question__title_slug": "relative-sort-array", "question__hide": false, - "total_acs": 85949, - "total_submitted": 121828, - "total_column_articles": 1111, + "total_acs": 86253, + "total_submitted": 122237, + "total_column_articles": 1113, "frontend_question_id": "1122", "is_new_question": false }, @@ -39303,9 +39954,9 @@ "question__title": "Print Zero Even Odd", "question__title_slug": "print-zero-even-odd", "question__hide": false, - "total_acs": 33251, - "total_submitted": 61409, - "total_column_articles": 452, + "total_acs": 33418, + "total_submitted": 61691, + "total_column_articles": 454, "frontend_question_id": "1116", "is_new_question": false }, @@ -39324,8 +39975,8 @@ "question__title": "Reported Posts", "question__title_slug": "reported-posts", "question__hide": false, - "total_acs": 12332, - "total_submitted": 23063, + "total_acs": 12377, + "total_submitted": 23170, "total_column_articles": 74, "frontend_question_id": "1113", "is_new_question": false @@ -39345,8 +39996,8 @@ "question__title": "Highest Grade For Each Student", "question__title_slug": "highest-grade-for-each-student", "question__hide": false, - "total_acs": 17692, - "total_submitted": 26829, + "total_acs": 17889, + "total_submitted": 27124, "total_column_articles": 164, "frontend_question_id": "1112", "is_new_question": false @@ -39366,9 +40017,9 @@ "question__title": "Handshakes That Don't Cross", "question__title_slug": "handshakes-that-dont-cross", "question__hide": false, - "total_acs": 3339, - "total_submitted": 6296, - "total_column_articles": 66, + "total_acs": 3379, + "total_submitted": 6351, + "total_column_articles": 67, "frontend_question_id": "1259", "is_new_question": false }, @@ -39387,8 +40038,8 @@ "question__title": "Sequential Digits", "question__title_slug": "sequential-digits", "question__hide": false, - "total_acs": 10502, - "total_submitted": 19676, + "total_acs": 10552, + "total_submitted": 19751, "total_column_articles": 219, "frontend_question_id": "1291", "is_new_question": false @@ -39408,8 +40059,8 @@ "question__title": "Iterator for Combination", "question__title_slug": "iterator-for-combination", "question__hide": false, - "total_acs": 6888, - "total_submitted": 10620, + "total_acs": 6916, + "total_submitted": 10657, "total_column_articles": 143, "frontend_question_id": "1286", "is_new_question": false @@ -39429,9 +40080,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": 44367, - "total_submitted": 61790, - "total_column_articles": 448, + "total_acs": 44435, + "total_submitted": 61891, + "total_column_articles": 449, "frontend_question_id": "1619", "is_new_question": false }, @@ -39450,8 +40101,8 @@ "question__title": "Design Bounded Blocking Queue", "question__title_slug": "design-bounded-blocking-queue", "question__hide": false, - "total_acs": 5106, - "total_submitted": 7294, + "total_acs": 5160, + "total_submitted": 7363, "total_column_articles": 88, "frontend_question_id": "1188", "is_new_question": false @@ -39471,8 +40122,8 @@ "question__title": "Maximum Nesting Depth of Two Valid Parentheses Strings", "question__title_slug": "maximum-nesting-depth-of-two-valid-parentheses-strings", "question__hide": false, - "total_acs": 27334, - "total_submitted": 35580, + "total_acs": 27394, + "total_submitted": 35657, "total_column_articles": 443, "frontend_question_id": "1111", "is_new_question": false @@ -39492,8 +40143,8 @@ "question__title": "Delete Nodes And Return Forest", "question__title_slug": "delete-nodes-and-return-forest", "question__hide": false, - "total_acs": 19796, - "total_submitted": 30512, + "total_acs": 19914, + "total_submitted": 30680, "total_column_articles": 338, "frontend_question_id": "1110", "is_new_question": false @@ -39513,9 +40164,9 @@ "question__title": "Corporate Flight Bookings", "question__title_slug": "corporate-flight-bookings", "question__hide": false, - "total_acs": 108289, - "total_submitted": 170640, - "total_column_articles": 1616, + "total_acs": 109025, + "total_submitted": 171696, + "total_column_articles": 1620, "frontend_question_id": "1109", "is_new_question": false }, @@ -39534,8 +40185,8 @@ "question__title": "Defanging an IP Address", "question__title_slug": "defanging-an-ip-address", "question__hide": false, - "total_acs": 111987, - "total_submitted": 131089, + "total_acs": 112287, + "total_submitted": 131459, "total_column_articles": 1007, "frontend_question_id": "1108", "is_new_question": false @@ -39555,8 +40206,8 @@ "question__title": "New Users Daily Count", "question__title_slug": "new-users-daily-count", "question__hide": false, - "total_acs": 12768, - "total_submitted": 31055, + "total_acs": 12823, + "total_submitted": 31160, "total_column_articles": 135, "frontend_question_id": "1107", "is_new_question": false @@ -39576,8 +40227,8 @@ "question__title": "Print in Order", "question__title_slug": "print-in-order", "question__hide": false, - "total_acs": 109102, - "total_submitted": 167497, + "total_acs": 109643, + "total_submitted": 168262, "total_column_articles": 738, "frontend_question_id": "1114", "is_new_question": false @@ -39597,9 +40248,9 @@ "question__title": "Palindrome Removal", "question__title_slug": "palindrome-removal", "question__hide": false, - "total_acs": 3960, - "total_submitted": 7888, - "total_column_articles": 60, + "total_acs": 3972, + "total_submitted": 7906, + "total_column_articles": 61, "frontend_question_id": "1246", "is_new_question": false }, @@ -39618,8 +40269,8 @@ "question__title": "Delete Tree Nodes", "question__title_slug": "delete-tree-nodes", "question__hide": false, - "total_acs": 2498, - "total_submitted": 4391, + "total_acs": 2515, + "total_submitted": 4418, "total_column_articles": 70, "frontend_question_id": "1273", "is_new_question": false @@ -39639,9 +40290,9 @@ "question__title": "Remove Interval", "question__title_slug": "remove-interval", "question__hide": false, - "total_acs": 2699, - "total_submitted": 4800, - "total_column_articles": 44, + "total_acs": 2761, + "total_submitted": 4912, + "total_column_articles": 45, "frontend_question_id": "1272", "is_new_question": false }, @@ -39660,8 +40311,8 @@ "question__title": "Hexspeak", "question__title_slug": "hexspeak", "question__hide": false, - "total_acs": 3186, - "total_submitted": 6109, + "total_acs": 3212, + "total_submitted": 6142, "total_column_articles": 65, "frontend_question_id": "1271", "is_new_question": false @@ -39681,9 +40332,9 @@ "question__title": "Unpopular Books", "question__title_slug": "unpopular-books", "question__hide": false, - "total_acs": 13402, - "total_submitted": 28359, - "total_column_articles": 134, + "total_acs": 13457, + "total_submitted": 28465, + "total_column_articles": 135, "frontend_question_id": "1098", "is_new_question": false }, @@ -39702,9 +40353,9 @@ "question__title": "Parsing A Boolean Expression", "question__title_slug": "parsing-a-boolean-expression", "question__hide": false, - "total_acs": 26733, - "total_submitted": 38963, - "total_column_articles": 569, + "total_acs": 26792, + "total_submitted": 39064, + "total_column_articles": 571, "frontend_question_id": "1106", "is_new_question": false }, @@ -39723,9 +40374,9 @@ "question__title": "Filling Bookcase Shelves", "question__title_slug": "filling-bookcase-shelves", "question__hide": false, - "total_acs": 21073, - "total_submitted": 31383, - "total_column_articles": 201, + "total_acs": 21197, + "total_submitted": 31541, + "total_column_articles": 203, "frontend_question_id": "1105", "is_new_question": false }, @@ -39744,8 +40395,8 @@ "question__title": "Distribute Candies to People", "question__title_slug": "distribute-candies-to-people", "question__hide": false, - "total_acs": 43723, - "total_submitted": 68659, + "total_acs": 43844, + "total_submitted": 68834, "total_column_articles": 1233, "frontend_question_id": "1103", "is_new_question": false @@ -39765,8 +40416,8 @@ "question__title": "Path In Zigzag Labelled Binary Tree", "question__title_slug": "path-in-zigzag-labelled-binary-tree", "question__hide": false, - "total_acs": 32483, - "total_submitted": 42831, + "total_acs": 32529, + "total_submitted": 42889, "total_column_articles": 770, "frontend_question_id": "1104", "is_new_question": false @@ -39786,8 +40437,8 @@ "question__title": "Game Play Analysis V", "question__title_slug": "game-play-analysis-v", "question__hide": false, - "total_acs": 11447, - "total_submitted": 21913, + "total_acs": 11510, + "total_submitted": 22002, "total_column_articles": 166, "frontend_question_id": "1097", "is_new_question": false @@ -39807,8 +40458,8 @@ "question__title": "Divide Chocolate", "question__title_slug": "divide-chocolate", "question__hide": false, - "total_acs": 7099, - "total_submitted": 12098, + "total_acs": 7139, + "total_submitted": 12154, "total_column_articles": 103, "frontend_question_id": "1231", "is_new_question": false @@ -39828,8 +40479,8 @@ "question__title": "Synonymous Sentences", "question__title_slug": "synonymous-sentences", "question__hide": false, - "total_acs": 2070, - "total_submitted": 3505, + "total_acs": 2074, + "total_submitted": 3509, "total_column_articles": 78, "frontend_question_id": "1258", "is_new_question": false @@ -39849,8 +40500,8 @@ "question__title": "Smallest Common Region", "question__title_slug": "smallest-common-region", "question__hide": false, - "total_acs": 2636, - "total_submitted": 4478, + "total_acs": 2656, + "total_submitted": 4502, "total_column_articles": 67, "frontend_question_id": "1257", "is_new_question": false @@ -39870,8 +40521,8 @@ "question__title": "Encode Number", "question__title_slug": "encode-number", "question__hide": false, - "total_acs": 2057, - "total_submitted": 2993, + "total_acs": 2063, + "total_submitted": 3000, "total_column_articles": 55, "frontend_question_id": "1256", "is_new_question": false @@ -39891,8 +40542,8 @@ "question__title": "Brace Expansion II", "question__title_slug": "brace-expansion-ii", "question__hide": false, - "total_acs": 15120, - "total_submitted": 20515, + "total_acs": 15153, + "total_submitted": 20566, "total_column_articles": 154, "frontend_question_id": "1096", "is_new_question": false @@ -39912,9 +40563,9 @@ "question__title": "Print FooBar Alternately", "question__title_slug": "print-foobar-alternately", "question__hide": false, - "total_acs": 63259, - "total_submitted": 111081, - "total_column_articles": 598, + "total_acs": 63605, + "total_submitted": 111614, + "total_column_articles": 600, "frontend_question_id": "1115", "is_new_question": false }, @@ -39933,8 +40584,8 @@ "question__title": "Building H2O", "question__title_slug": "building-h2o", "question__hide": false, - "total_acs": 25859, - "total_submitted": 48033, + "total_acs": 25989, + "total_submitted": 48233, "total_column_articles": 331, "frontend_question_id": "1117", "is_new_question": false @@ -39954,8 +40605,8 @@ "question__title": "Find in Mountain Array", "question__title_slug": "find-in-mountain-array", "question__hide": false, - "total_acs": 26632, - "total_submitted": 70635, + "total_acs": 26728, + "total_submitted": 70870, "total_column_articles": 470, "frontend_question_id": "1095", "is_new_question": false @@ -39975,9 +40626,9 @@ "question__title": "Car Pooling", "question__title_slug": "car-pooling", "question__hide": false, - "total_acs": 71578, - "total_submitted": 137611, - "total_column_articles": 1334, + "total_acs": 72292, + "total_submitted": 139174, + "total_column_articles": 1341, "frontend_question_id": "1094", "is_new_question": false }, @@ -39996,8 +40647,8 @@ "question__title": "Statistics from a Large Sample", "question__title_slug": "statistics-from-a-large-sample", "question__hide": false, - "total_acs": 5334, - "total_submitted": 14734, + "total_acs": 5367, + "total_submitted": 14836, "total_column_articles": 92, "frontend_question_id": "1093", "is_new_question": false @@ -40017,9 +40668,9 @@ "question__title": "Game Play Analysis IV", "question__title_slug": "game-play-analysis-iv", "question__hide": false, - "total_acs": 29042, - "total_submitted": 65665, - "total_column_articles": 313, + "total_acs": 29959, + "total_submitted": 67620, + "total_column_articles": 319, "frontend_question_id": "550", "is_new_question": false }, @@ -40038,9 +40689,9 @@ "question__title": "Game Play Analysis III", "question__title_slug": "game-play-analysis-iii", "question__hide": false, - "total_acs": 28384, - "total_submitted": 41245, - "total_column_articles": 198, + "total_acs": 28519, + "total_submitted": 41422, + "total_column_articles": 199, "frontend_question_id": "534", "is_new_question": false }, @@ -40059,9 +40710,9 @@ "question__title": "Game Play Analysis II", "question__title_slug": "game-play-analysis-ii", "question__hide": false, - "total_acs": 34905, - "total_submitted": 64489, - "total_column_articles": 228, + "total_acs": 35094, + "total_submitted": 64794, + "total_column_articles": 229, "frontend_question_id": "512", "is_new_question": false }, @@ -40080,9 +40731,9 @@ "question__title": "Game Play Analysis I", "question__title_slug": "game-play-analysis-i", "question__hide": false, - "total_acs": 84906, - "total_submitted": 119757, - "total_column_articles": 360, + "total_acs": 85955, + "total_submitted": 121271, + "total_column_articles": 364, "frontend_question_id": "511", "is_new_question": false }, @@ -40101,8 +40752,8 @@ "question__title": "Valid Palindrome III", "question__title_slug": "valid-palindrome-iii", "question__hide": false, - "total_acs": 2792, - "total_submitted": 4824, + "total_acs": 2810, + "total_submitted": 4850, "total_column_articles": 56, "frontend_question_id": "1216", "is_new_question": false @@ -40122,9 +40773,9 @@ "question__title": "Tree Diameter", "question__title_slug": "tree-diameter", "question__hide": false, - "total_acs": 6075, - "total_submitted": 11214, - "total_column_articles": 114, + "total_acs": 6126, + "total_submitted": 11283, + "total_column_articles": 115, "frontend_question_id": "1245", "is_new_question": false }, @@ -40143,8 +40794,8 @@ "question__title": "Design A Leaderboard", "question__title_slug": "design-a-leaderboard", "question__hide": false, - "total_acs": 4249, - "total_submitted": 6701, + "total_acs": 4277, + "total_submitted": 6737, "total_column_articles": 69, "frontend_question_id": "1244", "is_new_question": false @@ -40164,8 +40815,8 @@ "question__title": "Array Transformation", "question__title_slug": "array-transformation", "question__hide": false, - "total_acs": 3528, - "total_submitted": 6543, + "total_acs": 3541, + "total_submitted": 6582, "total_column_articles": 85, "frontend_question_id": "1243", "is_new_question": false @@ -40185,9 +40836,9 @@ "question__title": "Sales Analysis III", "question__title_slug": "sales-analysis-iii", "question__hide": false, - "total_acs": 47154, - "total_submitted": 89775, - "total_column_articles": 332, + "total_acs": 47951, + "total_submitted": 91293, + "total_column_articles": 335, "frontend_question_id": "1084", "is_new_question": false }, @@ -40206,9 +40857,9 @@ "question__title": "Sales Analysis II", "question__title_slug": "sales-analysis-ii", "question__hide": false, - "total_acs": 18011, - "total_submitted": 34008, - "total_column_articles": 154, + "total_acs": 18050, + "total_submitted": 34078, + "total_column_articles": 155, "frontend_question_id": "1083", "is_new_question": false }, @@ -40227,9 +40878,9 @@ "question__title": "Sales Analysis I", "question__title_slug": "sales-analysis-i", "question__hide": false, - "total_acs": 19161, - "total_submitted": 25032, - "total_column_articles": 137, + "total_acs": 19211, + "total_submitted": 25092, + "total_column_articles": 139, "frontend_question_id": "1082", "is_new_question": false }, @@ -40248,9 +40899,9 @@ "question__title": "Shortest Path in Binary Matrix", "question__title_slug": "shortest-path-in-binary-matrix", "question__hide": false, - "total_acs": 61877, - "total_submitted": 159774, - "total_column_articles": 603, + "total_acs": 62235, + "total_submitted": 160704, + "total_column_articles": 604, "frontend_question_id": "1091", "is_new_question": false }, @@ -40269,8 +40920,8 @@ "question__title": "Shortest Common Supersequence ", "question__title_slug": "shortest-common-supersequence", "question__hide": false, - "total_acs": 17634, - "total_submitted": 30131, + "total_acs": 17720, + "total_submitted": 30248, "total_column_articles": 169, "frontend_question_id": "1092", "is_new_question": false @@ -40290,8 +40941,8 @@ "question__title": "Largest Values From Labels", "question__title_slug": "largest-values-from-labels", "question__hide": false, - "total_acs": 6400, - "total_submitted": 10990, + "total_acs": 6457, + "total_submitted": 11070, "total_column_articles": 143, "frontend_question_id": "1090", "is_new_question": false @@ -40311,8 +40962,8 @@ "question__title": "Duplicate Zeros", "question__title_slug": "duplicate-zeros", "question__hide": false, - "total_acs": 57587, - "total_submitted": 95507, + "total_acs": 57761, + "total_submitted": 95806, "total_column_articles": 759, "frontend_question_id": "1089", "is_new_question": false @@ -40332,8 +40983,8 @@ "question__title": "Minimum Time to Build Blocks", "question__title_slug": "minimum-time-to-build-blocks", "question__hide": false, - "total_acs": 1065, - "total_submitted": 2255, + "total_acs": 1074, + "total_submitted": 2270, "total_column_articles": 30, "frontend_question_id": "1199", "is_new_question": false @@ -40353,9 +41004,9 @@ "question__title": "Toss Strange Coins", "question__title_slug": "toss-strange-coins", "question__hide": false, - "total_acs": 6308, - "total_submitted": 11644, - "total_column_articles": 113, + "total_acs": 6346, + "total_submitted": 11699, + "total_column_articles": 114, "frontend_question_id": "1230", "is_new_question": false }, @@ -40374,8 +41025,8 @@ "question__title": "Meeting Scheduler", "question__title_slug": "meeting-scheduler", "question__hide": false, - "total_acs": 6227, - "total_submitted": 13440, + "total_acs": 6270, + "total_submitted": 13511, "total_column_articles": 123, "frontend_question_id": "1229", "is_new_question": false @@ -40395,8 +41046,8 @@ "question__title": "Missing Number In Arithmetic Progression", "question__title_slug": "missing-number-in-arithmetic-progression", "question__hide": false, - "total_acs": 4184, - "total_submitted": 7774, + "total_acs": 4236, + "total_submitted": 7863, "total_column_articles": 78, "frontend_question_id": "1228", "is_new_question": false @@ -40416,8 +41067,8 @@ "question__title": "Project Employees III", "question__title_slug": "project-employees-iii", "question__hide": false, - "total_acs": 16665, - "total_submitted": 23036, + "total_acs": 16802, + "total_submitted": 23224, "total_column_articles": 144, "frontend_question_id": "1077", "is_new_question": false @@ -40437,8 +41088,8 @@ "question__title": "Project Employees II", "question__title_slug": "project-employees-ii", "question__hide": false, - "total_acs": 18017, - "total_submitted": 36512, + "total_acs": 18060, + "total_submitted": 36598, "total_column_articles": 132, "frontend_question_id": "1076", "is_new_question": false @@ -40458,9 +41109,9 @@ "question__title": "Project Employees I", "question__title_slug": "project-employees-i", "question__hide": false, - "total_acs": 18367, - "total_submitted": 26166, - "total_column_articles": 119, + "total_acs": 19155, + "total_submitted": 27284, + "total_column_articles": 122, "frontend_question_id": "1075", "is_new_question": false }, @@ -40479,8 +41130,8 @@ "question__title": "Letter Tile Possibilities", "question__title_slug": "letter-tile-possibilities", "question__hide": false, - "total_acs": 17133, - "total_submitted": 23200, + "total_acs": 17211, + "total_submitted": 23299, "total_column_articles": 282, "frontend_question_id": "1079", "is_new_question": false @@ -40500,8 +41151,8 @@ "question__title": "Smallest Subsequence of Distinct Characters", "question__title_slug": "smallest-subsequence-of-distinct-characters", "question__hide": false, - "total_acs": 25746, - "total_submitted": 44047, + "total_acs": 25885, + "total_submitted": 44295, "total_column_articles": 238, "frontend_question_id": "1081", "is_new_question": false @@ -40521,8 +41172,8 @@ "question__title": "Insufficient Nodes in Root to Leaf Paths", "question__title_slug": "insufficient-nodes-in-root-to-leaf-paths", "question__hide": false, - "total_acs": 7944, - "total_submitted": 15121, + "total_acs": 8011, + "total_submitted": 15252, "total_column_articles": 152, "frontend_question_id": "1080", "is_new_question": false @@ -40542,9 +41193,9 @@ "question__title": "Occurrences After Bigram", "question__title_slug": "occurrences-after-bigram", "question__hide": false, - "total_acs": 37123, - "total_submitted": 56918, - "total_column_articles": 516, + "total_acs": 37273, + "total_submitted": 57179, + "total_column_articles": 517, "frontend_question_id": "1078", "is_new_question": false }, @@ -40563,9 +41214,9 @@ "question__title": "Product Sales Analysis III", "question__title_slug": "product-sales-analysis-iii", "question__hide": false, - "total_acs": 14537, - "total_submitted": 30191, - "total_column_articles": 102, + "total_acs": 14807, + "total_submitted": 30724, + "total_column_articles": 104, "frontend_question_id": "1070", "is_new_question": false }, @@ -40584,8 +41235,8 @@ "question__title": "Product Sales Analysis II", "question__title_slug": "product-sales-analysis-ii", "question__hide": false, - "total_acs": 18122, - "total_submitted": 22179, + "total_acs": 18186, + "total_submitted": 22257, "total_column_articles": 85, "frontend_question_id": "1069", "is_new_question": false @@ -40605,9 +41256,9 @@ "question__title": "Product Sales Analysis I", "question__title_slug": "product-sales-analysis-i", "question__hide": false, - "total_acs": 24463, - "total_submitted": 28257, - "total_column_articles": 99, + "total_acs": 25830, + "total_submitted": 29813, + "total_column_articles": 103, "frontend_question_id": "1068", "is_new_question": false }, @@ -40626,8 +41277,8 @@ "question__title": "Maximum Number of Ones", "question__title_slug": "maximum-number-of-ones", "question__hide": false, - "total_acs": 957, - "total_submitted": 1541, + "total_acs": 976, + "total_submitted": 1566, "total_column_articles": 28, "frontend_question_id": "1183", "is_new_question": false @@ -40647,8 +41298,8 @@ "question__title": "Stepping Numbers", "question__title_slug": "stepping-numbers", "question__hide": false, - "total_acs": 2553, - "total_submitted": 5892, + "total_acs": 2579, + "total_submitted": 5954, "total_column_articles": 54, "frontend_question_id": "1215", "is_new_question": false @@ -40668,8 +41319,8 @@ "question__title": "Two Sum BSTs", "question__title_slug": "two-sum-bsts", "question__hide": false, - "total_acs": 5046, - "total_submitted": 7675, + "total_acs": 5095, + "total_submitted": 7748, "total_column_articles": 98, "frontend_question_id": "1214", "is_new_question": false @@ -40689,8 +41340,8 @@ "question__title": "Intersection of Three Sorted Arrays", "question__title_slug": "intersection-of-three-sorted-arrays", "question__hide": false, - "total_acs": 8701, - "total_submitted": 11124, + "total_acs": 8730, + "total_submitted": 11159, "total_column_articles": 184, "frontend_question_id": "1213", "is_new_question": false @@ -40710,8 +41361,8 @@ "question__title": "Adding Two Negabinary Numbers", "question__title_slug": "adding-two-negabinary-numbers", "question__hide": false, - "total_acs": 3776, - "total_submitted": 10660, + "total_acs": 3830, + "total_submitted": 10818, "total_column_articles": 75, "frontend_question_id": "1073", "is_new_question": false @@ -40731,9 +41382,9 @@ "question__title": "Flip Columns For Maximum Number of Equal Rows", "question__title_slug": "flip-columns-for-maximum-number-of-equal-rows", "question__hide": false, - "total_acs": 5321, - "total_submitted": 8543, - "total_column_articles": 85, + "total_acs": 15102, + "total_submitted": 21602, + "total_column_articles": 164, "frontend_question_id": "1072", "is_new_question": false }, @@ -40752,9 +41403,9 @@ "question__title": "Greatest Common Divisor of Strings", "question__title_slug": "greatest-common-divisor-of-strings", "question__hide": false, - "total_acs": 44659, - "total_submitted": 76310, - "total_column_articles": 780, + "total_acs": 45371, + "total_submitted": 77511, + "total_column_articles": 783, "frontend_question_id": "1071", "is_new_question": false }, @@ -40773,8 +41424,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": 21773, - "total_submitted": 32337, + "total_acs": 21820, + "total_submitted": 32391, "total_column_articles": 223, "frontend_question_id": "1074", "is_new_question": false @@ -40794,8 +41445,8 @@ "question__title": "Optimize Water Distribution in a Village", "question__title_slug": "optimize-water-distribution-in-a-village", "question__hide": false, - "total_acs": 2770, - "total_submitted": 4449, + "total_acs": 2802, + "total_submitted": 4495, "total_column_articles": 54, "frontend_question_id": "1168", "is_new_question": false @@ -40815,8 +41466,8 @@ "question__title": "Find Smallest Common Element in All Rows", "question__title_slug": "find-smallest-common-element-in-all-rows", "question__hide": false, - "total_acs": 5679, - "total_submitted": 7670, + "total_acs": 5769, + "total_submitted": 7778, "total_column_articles": 90, "frontend_question_id": "1198", "is_new_question": false @@ -40836,8 +41487,8 @@ "question__title": "Minimum Knight Moves", "question__title_slug": "minimum-knight-moves", "question__hide": false, - "total_acs": 7242, - "total_submitted": 18546, + "total_acs": 7290, + "total_submitted": 18644, "total_column_articles": 86, "frontend_question_id": "1197", "is_new_question": false @@ -40857,8 +41508,8 @@ "question__title": "How Many Apples Can You Put into the Basket", "question__title_slug": "how-many-apples-can-you-put-into-the-basket", "question__hide": false, - "total_acs": 4910, - "total_submitted": 7190, + "total_acs": 4932, + "total_submitted": 7227, "total_column_articles": 82, "frontend_question_id": "1196", "is_new_question": false @@ -40878,9 +41529,9 @@ "question__title": "Distant Barcodes", "question__title_slug": "distant-barcodes", "question__hide": false, - "total_acs": 11725, - "total_submitted": 29433, - "total_column_articles": 172, + "total_acs": 24051, + "total_submitted": 53740, + "total_column_articles": 295, "frontend_question_id": "1054", "is_new_question": false }, @@ -40899,8 +41550,8 @@ "question__title": "Previous Permutation With One Swap", "question__title_slug": "previous-permutation-with-one-swap", "question__hide": false, - "total_acs": 27695, - "total_submitted": 57300, + "total_acs": 27746, + "total_submitted": 57428, "total_column_articles": 302, "frontend_question_id": "1053", "is_new_question": false @@ -40920,9 +41571,9 @@ "question__title": "Grumpy Bookstore Owner", "question__title_slug": "grumpy-bookstore-owner", "question__hide": false, - "total_acs": 61896, - "total_submitted": 106729, - "total_column_articles": 906, + "total_acs": 62048, + "total_submitted": 106993, + "total_column_articles": 908, "frontend_question_id": "1052", "is_new_question": false }, @@ -40941,9 +41592,9 @@ "question__title": "Height Checker", "question__title_slug": "height-checker", "question__hide": false, - "total_acs": 68669, - "total_submitted": 85772, - "total_column_articles": 683, + "total_acs": 68898, + "total_submitted": 86038, + "total_column_articles": 684, "frontend_question_id": "1051", "is_new_question": false }, @@ -40962,9 +41613,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": 49670, - "total_submitted": 64454, - "total_column_articles": 198, + "total_acs": 50240, + "total_submitted": 65203, + "total_column_articles": 201, "frontend_question_id": "1050", "is_new_question": false }, @@ -40983,9 +41634,9 @@ "question__title": "Customers Who Bought All Products", "question__title_slug": "customers-who-bought-all-products", "question__hide": false, - "total_acs": 19371, - "total_submitted": 30988, - "total_column_articles": 188, + "total_acs": 20057, + "total_submitted": 32214, + "total_column_articles": 189, "frontend_question_id": "1045", "is_new_question": false }, @@ -41004,8 +41655,8 @@ "question__title": "Shortest Distance to Target Color", "question__title_slug": "shortest-distance-to-target-color", "question__hide": false, - "total_acs": 5490, - "total_submitted": 11541, + "total_acs": 5505, + "total_submitted": 11561, "total_column_articles": 99, "frontend_question_id": "1182", "is_new_question": false @@ -41025,8 +41676,8 @@ "question__title": "Last Substring in Lexicographical Order", "question__title_slug": "last-substring-in-lexicographical-order", "question__hide": false, - "total_acs": 21576, - "total_submitted": 61275, + "total_acs": 21689, + "total_submitted": 61524, "total_column_articles": 238, "frontend_question_id": "1163", "is_new_question": false @@ -41046,8 +41697,8 @@ "question__title": "Before and After Puzzle", "question__title_slug": "before-and-after-puzzle", "question__hide": false, - "total_acs": 1918, - "total_submitted": 4846, + "total_acs": 1924, + "total_submitted": 4855, "total_column_articles": 37, "frontend_question_id": "1181", "is_new_question": false @@ -41067,9 +41718,9 @@ "question__title": "Count Substrings with Only One Distinct Letter", "question__title_slug": "count-substrings-with-only-one-distinct-letter", "question__hide": false, - "total_acs": 4309, - "total_submitted": 5543, - "total_column_articles": 104, + "total_acs": 4360, + "total_submitted": 5606, + "total_column_articles": 106, "frontend_question_id": "1180", "is_new_question": false }, @@ -41088,9 +41739,9 @@ "question__title": "Last Stone Weight II", "question__title_slug": "last-stone-weight-ii", "question__hide": false, - "total_acs": 120898, - "total_submitted": 174944, - "total_column_articles": 801, + "total_acs": 122661, + "total_submitted": 177473, + "total_column_articles": 806, "frontend_question_id": "1049", "is_new_question": false }, @@ -41109,9 +41760,9 @@ "question__title": "Longest String Chain", "question__title_slug": "longest-string-chain", "question__hide": false, - "total_acs": 33975, - "total_submitted": 60874, - "total_column_articles": 397, + "total_acs": 34260, + "total_submitted": 61314, + "total_column_articles": 399, "frontend_question_id": "1048", "is_new_question": false }, @@ -41130,9 +41781,9 @@ "question__title": "Remove All Adjacent Duplicates In String", "question__title_slug": "remove-all-adjacent-duplicates-in-string", "question__hide": false, - "total_acs": 229788, - "total_submitted": 317360, - "total_column_articles": 1567, + "total_acs": 232231, + "total_submitted": 320714, + "total_column_articles": 1578, "frontend_question_id": "1047", "is_new_question": false }, @@ -41151,9 +41802,9 @@ "question__title": "Last Stone Weight", "question__title_slug": "last-stone-weight", "question__hide": false, - "total_acs": 91245, - "total_submitted": 138921, - "total_column_articles": 1203, + "total_acs": 91633, + "total_submitted": 139584, + "total_column_articles": 1206, "frontend_question_id": "1046", "is_new_question": false }, @@ -41172,9 +41823,9 @@ "question__title": "Minimum Cost to Connect Sticks", "question__title_slug": "minimum-cost-to-connect-sticks", "question__hide": false, - "total_acs": 3742, - "total_submitted": 7366, - "total_column_articles": 52, + "total_acs": 3769, + "total_submitted": 7399, + "total_column_articles": 53, "frontend_question_id": "1167", "is_new_question": false }, @@ -41193,8 +41844,8 @@ "question__title": "Design File System", "question__title_slug": "design-file-system", "question__hide": false, - "total_acs": 4705, - "total_submitted": 9481, + "total_acs": 4722, + "total_submitted": 9531, "total_column_articles": 86, "frontend_question_id": "1166", "is_new_question": false @@ -41214,8 +41865,8 @@ "question__title": "String Transforms Into Another String", "question__title_slug": "string-transforms-into-another-string", "question__hide": false, - "total_acs": 2286, - "total_submitted": 6051, + "total_acs": 2295, + "total_submitted": 6071, "total_column_articles": 30, "frontend_question_id": "1153", "is_new_question": false @@ -41235,8 +41886,8 @@ "question__title": "Single-Row Keyboard", "question__title_slug": "single-row-keyboard", "question__hide": false, - "total_acs": 9437, - "total_submitted": 11233, + "total_acs": 9516, + "total_submitted": 11323, "total_column_articles": 154, "frontend_question_id": "1165", "is_new_question": false @@ -41256,8 +41907,8 @@ "question__title": "Longest Duplicate Substring", "question__title_slug": "longest-duplicate-substring", "question__hide": false, - "total_acs": 27792, - "total_submitted": 78762, + "total_acs": 27946, + "total_submitted": 79050, "total_column_articles": 237, "frontend_question_id": "1044", "is_new_question": false @@ -41277,9 +41928,9 @@ "question__title": "Partition Array for Maximum Sum", "question__title_slug": "partition-array-for-maximum-sum", "question__hide": false, - "total_acs": 30086, - "total_submitted": 39839, - "total_column_articles": 295, + "total_acs": 30231, + "total_submitted": 40040, + "total_column_articles": 296, "frontend_question_id": "1043", "is_new_question": false }, @@ -41298,9 +41949,9 @@ "question__title": "Flower Planting With No Adjacent", "question__title_slug": "flower-planting-with-no-adjacent", "question__hide": false, - "total_acs": 31229, - "total_submitted": 51061, - "total_column_articles": 337, + "total_acs": 31296, + "total_submitted": 51160, + "total_column_articles": 339, "frontend_question_id": "1042", "is_new_question": false }, @@ -41319,8 +41970,8 @@ "question__title": "Robot Bounded In Circle", "question__title_slug": "robot-bounded-in-circle", "question__hide": false, - "total_acs": 31526, - "total_submitted": 55301, + "total_acs": 31578, + "total_submitted": 55386, "total_column_articles": 430, "frontend_question_id": "1041", "is_new_question": false @@ -41340,8 +41991,8 @@ "question__title": "Divide Array Into Increasing Sequences", "question__title_slug": "divide-array-into-increasing-sequences", "question__hide": false, - "total_acs": 1552, - "total_submitted": 2573, + "total_acs": 1562, + "total_submitted": 2584, "total_column_articles": 27, "frontend_question_id": "1121", "is_new_question": false @@ -41361,9 +42012,9 @@ "question__title": "As Far from Land as Possible", "question__title_slug": "as-far-from-land-as-possible", "question__hide": false, - "total_acs": 53498, - "total_submitted": 114462, - "total_column_articles": 664, + "total_acs": 53642, + "total_submitted": 114739, + "total_column_articles": 665, "frontend_question_id": "1162", "is_new_question": false }, @@ -41382,9 +42033,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": 35816, - "total_submitted": 54032, - "total_column_articles": 493, + "total_acs": 36105, + "total_submitted": 54512, + "total_column_articles": 494, "frontend_question_id": "1161", "is_new_question": false }, @@ -41403,8 +42054,8 @@ "question__title": "Valid Boomerang", "question__title_slug": "valid-boomerang", "question__hide": false, - "total_acs": 40955, - "total_submitted": 84191, + "total_acs": 41067, + "total_submitted": 84482, "total_column_articles": 422, "frontend_question_id": "1037", "is_new_question": false @@ -41424,8 +42075,8 @@ "question__title": "Binary Search Tree to Greater Sum Tree", "question__title_slug": "binary-search-tree-to-greater-sum-tree", "question__hide": false, - "total_acs": 43675, - "total_submitted": 53721, + "total_acs": 43906, + "total_submitted": 54010, "total_column_articles": 522, "frontend_question_id": "1038", "is_new_question": false @@ -41445,8 +42096,8 @@ "question__title": "Moving Stones Until Consecutive II", "question__title_slug": "moving-stones-until-consecutive-ii", "question__hide": false, - "total_acs": 14569, - "total_submitted": 22001, + "total_acs": 14597, + "total_submitted": 22040, "total_column_articles": 94, "frontend_question_id": "1040", "is_new_question": false @@ -41466,9 +42117,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": 74264, - "total_submitted": 108877, - "total_column_articles": 1057, + "total_acs": 74527, + "total_submitted": 109254, + "total_column_articles": 1058, "frontend_question_id": "1160", "is_new_question": false }, @@ -41487,9 +42138,9 @@ "question__title": "Minimum Score Triangulation of Polygon", "question__title_slug": "minimum-score-triangulation-of-polygon", "question__hide": false, - "total_acs": 21508, - "total_submitted": 33401, - "total_column_articles": 146, + "total_acs": 21648, + "total_submitted": 33593, + "total_column_articles": 148, "frontend_question_id": "1039", "is_new_question": false }, @@ -41508,8 +42159,8 @@ "question__title": "Analyze User Website Visit Pattern", "question__title_slug": "analyze-user-website-visit-pattern", "question__hide": false, - "total_acs": 2726, - "total_submitted": 6585, + "total_acs": 2736, + "total_submitted": 6603, "total_column_articles": 58, "frontend_question_id": "1152", "is_new_question": false @@ -41529,9 +42180,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": 9235, - "total_submitted": 17542, - "total_column_articles": 136, + "total_acs": 9289, + "total_submitted": 17611, + "total_column_articles": 137, "frontend_question_id": "1151", "is_new_question": false }, @@ -41550,8 +42201,8 @@ "question__title": "Escape a Large Maze", "question__title_slug": "escape-a-large-maze", "question__hide": false, - "total_acs": 20795, - "total_submitted": 44398, + "total_acs": 20839, + "total_submitted": 44504, "total_column_articles": 217, "frontend_question_id": "1036", "is_new_question": false @@ -41571,8 +42222,8 @@ "question__title": "Uncrossed Lines", "question__title_slug": "uncrossed-lines", "question__hide": false, - "total_acs": 77148, - "total_submitted": 110386, + "total_acs": 78181, + "total_submitted": 111691, "total_column_articles": 595, "frontend_question_id": "1035", "is_new_question": false @@ -41592,9 +42243,9 @@ "question__title": "Coloring A Border", "question__title_slug": "coloring-a-border", "question__hide": false, - "total_acs": 33475, - "total_submitted": 60659, - "total_column_articles": 533, + "total_acs": 33522, + "total_submitted": 60750, + "total_column_articles": 534, "frontend_question_id": "1034", "is_new_question": false }, @@ -41613,8 +42264,8 @@ "question__title": "Moving Stones Until Consecutive", "question__title_slug": "moving-stones-until-consecutive", "question__hide": false, - "total_acs": 24104, - "total_submitted": 49074, + "total_acs": 24450, + "total_submitted": 49627, "total_column_articles": 300, "frontend_question_id": "1033", "is_new_question": false @@ -41634,9 +42285,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": 7107, - "total_submitted": 11932, - "total_column_articles": 126, + "total_acs": 7151, + "total_submitted": 11994, + "total_column_articles": 127, "frontend_question_id": "1150", "is_new_question": false }, @@ -41655,8 +42306,8 @@ "question__title": "Parallel Courses", "question__title_slug": "parallel-courses", "question__hide": false, - "total_acs": 5987, - "total_submitted": 9923, + "total_acs": 6044, + "total_submitted": 10029, "total_column_articles": 101, "frontend_question_id": "1136", "is_new_question": false @@ -41676,8 +42327,8 @@ "question__title": "Connecting Cities With Minimum Cost", "question__title_slug": "connecting-cities-with-minimum-cost", "question__hide": false, - "total_acs": 12815, - "total_submitted": 22213, + "total_acs": 12934, + "total_submitted": 22396, "total_column_articles": 151, "frontend_question_id": "1135", "is_new_question": false @@ -41697,8 +42348,8 @@ "question__title": "Path With Maximum Minimum Value", "question__title_slug": "path-with-maximum-minimum-value", "question__hide": false, - "total_acs": 8441, - "total_submitted": 21031, + "total_acs": 8478, + "total_submitted": 21105, "total_column_articles": 110, "frontend_question_id": "1102", "is_new_question": false @@ -41718,8 +42369,8 @@ "question__title": "Largest Unique Number", "question__title_slug": "largest-unique-number", "question__hide": false, - "total_acs": 4602, - "total_submitted": 7055, + "total_acs": 4678, + "total_submitted": 7162, "total_column_articles": 101, "frontend_question_id": "1133", "is_new_question": false @@ -41739,9 +42390,9 @@ "question__title": "Stream of Characters", "question__title_slug": "stream-of-characters", "question__hide": false, - "total_acs": 18856, - "total_submitted": 33413, - "total_column_articles": 255, + "total_acs": 18979, + "total_submitted": 33589, + "total_column_articles": 256, "frontend_question_id": "1032", "is_new_question": false }, @@ -41760,9 +42411,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": 25430, - "total_submitted": 38801, - "total_column_articles": 304, + "total_acs": 25607, + "total_submitted": 39056, + "total_column_articles": 305, "frontend_question_id": "1031", "is_new_question": false }, @@ -41781,9 +42432,9 @@ "question__title": "Two City Scheduling", "question__title_slug": "two-city-scheduling", "question__hide": false, - "total_acs": 24326, - "total_submitted": 35551, - "total_column_articles": 274, + "total_acs": 24484, + "total_submitted": 35737, + "total_column_articles": 276, "frontend_question_id": "1029", "is_new_question": false }, @@ -41802,8 +42453,8 @@ "question__title": "Matrix Cells in Distance Order", "question__title_slug": "matrix-cells-in-distance-order", "question__hide": false, - "total_acs": 47379, - "total_submitted": 67124, + "total_acs": 47498, + "total_submitted": 67288, "total_column_articles": 522, "frontend_question_id": "1030", "is_new_question": false @@ -41823,9 +42474,9 @@ "question__title": "Recover a Tree From Preorder Traversal", "question__title_slug": "recover-a-tree-from-preorder-traversal", "question__hide": false, - "total_acs": 25137, - "total_submitted": 34511, - "total_column_articles": 532, + "total_acs": 25171, + "total_submitted": 34555, + "total_column_articles": 533, "frontend_question_id": "1028", "is_new_question": false }, @@ -41844,9 +42495,9 @@ "question__title": "Maximum Difference Between Node and Ancestor", "question__title_slug": "maximum-difference-between-node-and-ancestor", "question__hide": false, - "total_acs": 34622, - "total_submitted": 46083, - "total_column_articles": 475, + "total_acs": 34899, + "total_submitted": 46455, + "total_column_articles": 476, "frontend_question_id": "1026", "is_new_question": false }, @@ -41865,8 +42516,8 @@ "question__title": "Maximum Average Subtree", "question__title_slug": "maximum-average-subtree", "question__hide": false, - "total_acs": 3914, - "total_submitted": 6210, + "total_acs": 3968, + "total_submitted": 6288, "total_column_articles": 76, "frontend_question_id": "1120", "is_new_question": false @@ -41886,9 +42537,9 @@ "question__title": "Armstrong Number", "question__title_slug": "armstrong-number", "question__hide": false, - "total_acs": 4500, - "total_submitted": 5822, - "total_column_articles": 77, + "total_acs": 4552, + "total_submitted": 5888, + "total_column_articles": 78, "frontend_question_id": "1134", "is_new_question": false }, @@ -41907,8 +42558,8 @@ "question__title": "Remove Vowels from a String", "question__title_slug": "remove-vowels-from-a-string", "question__hide": false, - "total_acs": 10352, - "total_submitted": 11884, + "total_acs": 10375, + "total_submitted": 11908, "total_column_articles": 183, "frontend_question_id": "1119", "is_new_question": false @@ -41928,8 +42579,8 @@ "question__title": "Number of Days in a Month", "question__title_slug": "number-of-days-in-a-month", "question__hide": false, - "total_acs": 3729, - "total_submitted": 5733, + "total_acs": 3743, + "total_submitted": 5758, "total_column_articles": 68, "frontend_question_id": "1118", "is_new_question": false @@ -41949,9 +42600,9 @@ "question__title": "Longest Arithmetic Subsequence", "question__title_slug": "longest-arithmetic-subsequence", "question__hide": false, - "total_acs": 36964, - "total_submitted": 74936, - "total_column_articles": 311, + "total_acs": 37282, + "total_submitted": 75480, + "total_column_articles": 314, "frontend_question_id": "1027", "is_new_question": false }, @@ -41970,9 +42621,9 @@ "question__title": "Divisor Game", "question__title_slug": "divisor-game", "question__hide": false, - "total_acs": 96903, - "total_submitted": 137146, - "total_column_articles": 793, + "total_acs": 97131, + "total_submitted": 137447, + "total_column_articles": 794, "frontend_question_id": "1025", "is_new_question": false }, @@ -41991,8 +42642,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": 4149, - "total_submitted": 6049, + "total_acs": 4171, + "total_submitted": 6078, "total_column_articles": 105, "frontend_question_id": "1101", "is_new_question": false @@ -42012,9 +42663,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": 8874, - "total_submitted": 12626, - "total_column_articles": 171, + "total_acs": 8981, + "total_submitted": 12785, + "total_column_articles": 172, "frontend_question_id": "1100", "is_new_question": false }, @@ -42033,8 +42684,8 @@ "question__title": "Two Sum Less Than K", "question__title_slug": "two-sum-less-than-k", "question__hide": false, - "total_acs": 8753, - "total_submitted": 14637, + "total_acs": 8802, + "total_submitted": 14702, "total_column_articles": 145, "frontend_question_id": "1099", "is_new_question": false @@ -42054,8 +42705,8 @@ "question__title": "Sum of Digits in the Minimum Number", "question__title_slug": "sum-of-digits-in-the-minimum-number", "question__hide": false, - "total_acs": 4792, - "total_submitted": 6158, + "total_acs": 4807, + "total_submitted": 6175, "total_column_articles": 110, "frontend_question_id": "1085", "is_new_question": false @@ -42075,9 +42726,9 @@ "question__title": "Video Stitching", "question__title_slug": "video-stitching", "question__hide": false, - "total_acs": 46049, - "total_submitted": 86446, - "total_column_articles": 542, + "total_acs": 46213, + "total_submitted": 86801, + "total_column_articles": 545, "frontend_question_id": "1024", "is_new_question": false }, @@ -42096,8 +42747,8 @@ "question__title": "Camelcase Matching", "question__title_slug": "camelcase-matching", "question__hide": false, - "total_acs": 28729, - "total_submitted": 44489, + "total_acs": 28787, + "total_submitted": 44579, "total_column_articles": 474, "frontend_question_id": "1023", "is_new_question": false @@ -42117,8 +42768,8 @@ "question__title": "Sum of Root To Leaf Binary Numbers", "question__title_slug": "sum-of-root-to-leaf-binary-numbers", "question__hide": false, - "total_acs": 55461, - "total_submitted": 74129, + "total_acs": 55581, + "total_submitted": 74285, "total_column_articles": 652, "frontend_question_id": "1022", "is_new_question": false @@ -42138,8 +42789,8 @@ "question__title": "Remove Outermost Parentheses", "question__title_slug": "remove-outermost-parentheses", "question__hide": false, - "total_acs": 96690, - "total_submitted": 118770, + "total_acs": 96874, + "total_submitted": 118992, "total_column_articles": 1069, "frontend_question_id": "1021", "is_new_question": false @@ -42159,8 +42810,8 @@ "question__title": "Confusing Number II", "question__title_slug": "confusing-number-ii", "question__hide": false, - "total_acs": 1627, - "total_submitted": 3285, + "total_acs": 1634, + "total_submitted": 3292, "total_column_articles": 49, "frontend_question_id": "1088", "is_new_question": false @@ -42180,8 +42831,8 @@ "question__title": "Brace Expansion", "question__title_slug": "brace-expansion", "question__hide": false, - "total_acs": 3315, - "total_submitted": 5864, + "total_acs": 3335, + "total_submitted": 5893, "total_column_articles": 87, "frontend_question_id": "1087", "is_new_question": false @@ -42201,8 +42852,8 @@ "question__title": "Index Pairs of a String", "question__title_slug": "index-pairs-of-a-string", "question__hide": false, - "total_acs": 3545, - "total_submitted": 6281, + "total_acs": 3556, + "total_submitted": 6304, "total_column_articles": 106, "frontend_question_id": "1065", "is_new_question": false @@ -42222,8 +42873,8 @@ "question__title": "High Five", "question__title_slug": "high-five", "question__hide": false, - "total_acs": 6686, - "total_submitted": 9886, + "total_acs": 6736, + "total_submitted": 9948, "total_column_articles": 118, "frontend_question_id": "1086", "is_new_question": false @@ -42243,8 +42894,8 @@ "question__title": "Number of Enclaves", "question__title_slug": "number-of-enclaves", "question__hide": false, - "total_acs": 58301, - "total_submitted": 93509, + "total_acs": 58662, + "total_submitted": 94068, "total_column_articles": 819, "frontend_question_id": "1020", "is_new_question": false @@ -42264,8 +42915,8 @@ "question__title": "Next Greater Node In Linked List", "question__title_slug": "next-greater-node-in-linked-list", "question__hide": false, - "total_acs": 52875, - "total_submitted": 82250, + "total_acs": 53058, + "total_submitted": 82545, "total_column_articles": 647, "frontend_question_id": "1019", "is_new_question": false @@ -42285,9 +42936,9 @@ "question__title": "Binary Prefix Divisible By 5", "question__title_slug": "binary-prefix-divisible-by-5", "question__hide": false, - "total_acs": 50688, - "total_submitted": 100065, - "total_column_articles": 450, + "total_acs": 50824, + "total_submitted": 100346, + "total_column_articles": 451, "frontend_question_id": "1018", "is_new_question": false }, @@ -42306,9 +42957,9 @@ "question__title": "Convert to Base -2", "question__title_slug": "convert-to-base-2", "question__hide": false, - "total_acs": 22327, - "total_submitted": 34370, - "total_column_articles": 245, + "total_acs": 22420, + "total_submitted": 34517, + "total_column_articles": 246, "frontend_question_id": "1017", "is_new_question": false }, @@ -42327,9 +42978,9 @@ "question__title": "Confusing Number", "question__title_slug": "confusing-number", "question__hide": false, - "total_acs": 5355, - "total_submitted": 12325, - "total_column_articles": 107, + "total_acs": 5477, + "total_submitted": 12596, + "total_column_articles": 109, "frontend_question_id": "1056", "is_new_question": false }, @@ -42348,8 +42999,8 @@ "question__title": "Digit Count in Range", "question__title_slug": "digit-count-in-range", "question__hide": false, - "total_acs": 1779, - "total_submitted": 3726, + "total_acs": 1803, + "total_submitted": 3759, "total_column_articles": 50, "frontend_question_id": "1067", "is_new_question": false @@ -42369,8 +43020,8 @@ "question__title": "Campus Bikes II", "question__title_slug": "campus-bikes-ii", "question__hide": false, - "total_acs": 3214, - "total_submitted": 6296, + "total_acs": 3248, + "total_submitted": 6344, "total_column_articles": 71, "frontend_question_id": "1066", "is_new_question": false @@ -42390,8 +43041,8 @@ "question__title": "Fixed Point", "question__title_slug": "fixed-point", "question__hide": false, - "total_acs": 6306, - "total_submitted": 9743, + "total_acs": 6339, + "total_submitted": 9787, "total_column_articles": 103, "frontend_question_id": "1064", "is_new_question": false @@ -42411,9 +43062,9 @@ "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": 7604, - "total_submitted": 13041, - "total_column_articles": 114, + "total_acs": 25212, + "total_submitted": 39858, + "total_column_articles": 267, "frontend_question_id": "1016", "is_new_question": false }, @@ -42432,9 +43083,9 @@ "question__title": "Smallest Integer Divisible by K", "question__title_slug": "smallest-integer-divisible-by-k", "question__hide": false, - "total_acs": 7119, - "total_submitted": 19107, - "total_column_articles": 62, + "total_acs": 24869, + "total_submitted": 53278, + "total_column_articles": 165, "frontend_question_id": "1015", "is_new_question": false }, @@ -42453,9 +43104,9 @@ "question__title": "Best Sightseeing Pair", "question__title_slug": "best-sightseeing-pair", "question__hide": false, - "total_acs": 61514, - "total_submitted": 107733, - "total_column_articles": 716, + "total_acs": 61607, + "total_submitted": 107880, + "total_column_articles": 717, "frontend_question_id": "1014", "is_new_question": false }, @@ -42474,8 +43125,8 @@ "question__title": "Partition Array Into Three Parts With Equal Sum", "question__title_slug": "partition-array-into-three-parts-with-equal-sum", "question__hide": false, - "total_acs": 59398, - "total_submitted": 153880, + "total_acs": 59557, + "total_submitted": 154357, "total_column_articles": 1048, "frontend_question_id": "1013", "is_new_question": false @@ -42495,8 +43146,8 @@ "question__title": "Number of Valid Subarrays", "question__title_slug": "number-of-valid-subarrays", "question__hide": false, - "total_acs": 2943, - "total_submitted": 3992, + "total_acs": 2957, + "total_submitted": 4008, "total_column_articles": 61, "frontend_question_id": "1063", "is_new_question": false @@ -42516,8 +43167,8 @@ "question__title": "Longest Repeating Substring", "question__title_slug": "longest-repeating-substring", "question__hide": false, - "total_acs": 6340, - "total_submitted": 11127, + "total_acs": 6363, + "total_submitted": 11169, "total_column_articles": 86, "frontend_question_id": "1062", "is_new_question": false @@ -42537,8 +43188,8 @@ "question__title": "Missing Element in Sorted Array", "question__title_slug": "missing-element-in-sorted-array", "question__hide": false, - "total_acs": 11247, - "total_submitted": 20626, + "total_acs": 11306, + "total_submitted": 20726, "total_column_articles": 154, "frontend_question_id": "1060", "is_new_question": false @@ -42558,9 +43209,9 @@ "question__title": "Lexicographically Smallest Equivalent String", "question__title_slug": "lexicographically-smallest-equivalent-string", "question__hide": false, - "total_acs": 5043, - "total_submitted": 7811, - "total_column_articles": 114, + "total_acs": 5166, + "total_submitted": 7983, + "total_column_articles": 116, "frontend_question_id": "1061", "is_new_question": false }, @@ -42579,8 +43230,8 @@ "question__title": "Numbers With Repeated Digits", "question__title_slug": "numbers-with-repeated-digits", "question__hide": false, - "total_acs": 18784, - "total_submitted": 36156, + "total_acs": 18850, + "total_submitted": 36282, "total_column_articles": 186, "frontend_question_id": "1012", "is_new_question": false @@ -42600,9 +43251,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": 93423, - "total_submitted": 150490, - "total_column_articles": 853, + "total_acs": 93859, + "total_submitted": 151233, + "total_column_articles": 854, "frontend_question_id": "1011", "is_new_question": false }, @@ -42621,9 +43272,9 @@ "question__title": "Pairs of Songs With Total Durations Divisible by 60", "question__title_slug": "pairs-of-songs-with-total-durations-divisible-by-60", "question__hide": false, - "total_acs": 23452, - "total_submitted": 50746, - "total_column_articles": 299, + "total_acs": 41674, + "total_submitted": 83868, + "total_column_articles": 483, "frontend_question_id": "1010", "is_new_question": false }, @@ -42642,9 +43293,9 @@ "question__title": "Complement of Base 10 Integer", "question__title_slug": "complement-of-base-10-integer", "question__hide": false, - "total_acs": 23536, - "total_submitted": 40183, - "total_column_articles": 337, + "total_acs": 23629, + "total_submitted": 40334, + "total_column_articles": 339, "frontend_question_id": "1009", "is_new_question": false }, @@ -42663,8 +43314,8 @@ "question__title": "Minimize Rounding Error to Meet Target", "question__title_slug": "minimize-rounding-error-to-meet-target", "question__hide": false, - "total_acs": 1921, - "total_submitted": 5155, + "total_acs": 1929, + "total_submitted": 5170, "total_column_articles": 50, "frontend_question_id": "1058", "is_new_question": false @@ -42684,8 +43335,8 @@ "question__title": "Campus Bikes", "question__title_slug": "campus-bikes", "question__hide": false, - "total_acs": 4257, - "total_submitted": 8442, + "total_acs": 4290, + "total_submitted": 8485, "total_column_articles": 57, "frontend_question_id": "1057", "is_new_question": false @@ -42705,8 +43356,8 @@ "question__title": "Shortest Way to Form String", "question__title_slug": "shortest-way-to-form-string", "question__hide": false, - "total_acs": 9021, - "total_submitted": 14854, + "total_acs": 9143, + "total_submitted": 15045, "total_column_articles": 145, "frontend_question_id": "1055", "is_new_question": false @@ -42726,9 +43377,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": 29274, - "total_submitted": 40715, - "total_column_articles": 384, + "total_acs": 29464, + "total_submitted": 41005, + "total_column_articles": 387, "frontend_question_id": "1008", "is_new_question": false }, @@ -42747,8 +43398,8 @@ "question__title": "Minimum Domino Rotations For Equal Row", "question__title_slug": "minimum-domino-rotations-for-equal-row", "question__hide": false, - "total_acs": 8917, - "total_submitted": 18618, + "total_acs": 8953, + "total_submitted": 18725, "total_column_articles": 125, "frontend_question_id": "1007", "is_new_question": false @@ -42768,9 +43419,9 @@ "question__title": "Clumsy Factorial", "question__title_slug": "clumsy-factorial", "question__hide": false, - "total_acs": 47816, - "total_submitted": 76190, - "total_column_articles": 663, + "total_acs": 47851, + "total_submitted": 76245, + "total_column_articles": 664, "frontend_question_id": "1006", "is_new_question": false }, @@ -42789,9 +43440,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": 125551, - "total_submitted": 246364, - "total_column_articles": 1450, + "total_acs": 127023, + "total_submitted": 249429, + "total_column_articles": 1465, "frontend_question_id": "1005", "is_new_question": false }, @@ -42810,9 +43461,9 @@ "question__title": "Max Consecutive Ones III", "question__title_slug": "max-consecutive-ones-iii", "question__hide": false, - "total_acs": 119666, - "total_submitted": 200577, - "total_column_articles": 1062, + "total_acs": 120902, + "total_submitted": 202668, + "total_column_articles": 1071, "frontend_question_id": "1004", "is_new_question": false }, @@ -42831,9 +43482,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": 28502, - "total_submitted": 45566, - "total_column_articles": 407, + "total_acs": 34466, + "total_submitted": 54221, + "total_column_articles": 436, "frontend_question_id": "1003", "is_new_question": false }, @@ -42852,9 +43503,9 @@ "question__title": "Find Common Characters", "question__title_slug": "find-common-characters", "question__hide": false, - "total_acs": 83528, - "total_submitted": 117848, - "total_column_articles": 829, + "total_acs": 84087, + "total_submitted": 118682, + "total_column_articles": 832, "frontend_question_id": "1002", "is_new_question": false }, @@ -42873,8 +43524,8 @@ "question__title": "Grid Illumination", "question__title_slug": "grid-illumination", "question__hide": false, - "total_acs": 19265, - "total_submitted": 42910, + "total_acs": 19291, + "total_submitted": 42970, "total_column_articles": 281, "frontend_question_id": "1001", "is_new_question": false @@ -42894,9 +43545,9 @@ "question__title": "Minimum Cost to Merge Stones", "question__title_slug": "minimum-cost-to-merge-stones", "question__hide": false, - "total_acs": 18430, - "total_submitted": 34504, - "total_column_articles": 107, + "total_acs": 18555, + "total_submitted": 34685, + "total_column_articles": 109, "frontend_question_id": "1000", "is_new_question": false }, @@ -42915,8 +43566,8 @@ "question__title": "Available Captures for Rook", "question__title_slug": "available-captures-for-rook", "question__hide": false, - "total_acs": 34930, - "total_submitted": 50373, + "total_acs": 35010, + "total_submitted": 50480, "total_column_articles": 636, "frontend_question_id": "999", "is_new_question": false @@ -42936,9 +43587,9 @@ "question__title": "Maximum Binary Tree II", "question__title_slug": "maximum-binary-tree-ii", "question__hide": false, - "total_acs": 32520, - "total_submitted": 47310, - "total_column_articles": 435, + "total_acs": 32591, + "total_submitted": 47403, + "total_column_articles": 436, "frontend_question_id": "998", "is_new_question": false }, @@ -42957,9 +43608,9 @@ "question__title": "Find the Town Judge", "question__title_slug": "find-the-town-judge", "question__hide": false, - "total_acs": 87102, - "total_submitted": 167293, - "total_column_articles": 855, + "total_acs": 87472, + "total_submitted": 168177, + "total_column_articles": 856, "frontend_question_id": "997", "is_new_question": false }, @@ -42978,8 +43629,8 @@ "question__title": "Number of Squareful Arrays", "question__title_slug": "number-of-squareful-arrays", "question__hide": false, - "total_acs": 6766, - "total_submitted": 13548, + "total_acs": 6793, + "total_submitted": 13589, "total_column_articles": 132, "frontend_question_id": "996", "is_new_question": false @@ -42999,9 +43650,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": 25663, - "total_submitted": 47650, - "total_column_articles": 284, + "total_acs": 25710, + "total_submitted": 47723, + "total_column_articles": 286, "frontend_question_id": "995", "is_new_question": false }, @@ -43020,9 +43671,9 @@ "question__title": "Rotting Oranges", "question__title_slug": "rotting-oranges", "question__hide": false, - "total_acs": 110389, - "total_submitted": 216294, - "total_column_articles": 2069, + "total_acs": 111492, + "total_submitted": 218577, + "total_column_articles": 2079, "frontend_question_id": "994", "is_new_question": false }, @@ -43041,8 +43692,8 @@ "question__title": "Cousins in Binary Tree", "question__title_slug": "cousins-in-binary-tree", "question__hide": false, - "total_acs": 63730, - "total_submitted": 114286, + "total_acs": 63884, + "total_submitted": 114533, "total_column_articles": 1001, "frontend_question_id": "993", "is_new_question": false @@ -43062,8 +43713,8 @@ "question__title": "Subarrays with K Different Integers", "question__title_slug": "subarrays-with-k-different-integers", "question__hide": false, - "total_acs": 30661, - "total_submitted": 64685, + "total_acs": 30722, + "total_submitted": 64801, "total_column_articles": 335, "frontend_question_id": "992", "is_new_question": false @@ -43083,9 +43734,9 @@ "question__title": "Broken Calculator", "question__title_slug": "broken-calculator", "question__hide": false, - "total_acs": 12157, - "total_submitted": 23222, - "total_column_articles": 144, + "total_acs": 12220, + "total_submitted": 23350, + "total_column_articles": 145, "frontend_question_id": "991", "is_new_question": false }, @@ -43104,9 +43755,9 @@ "question__title": "Satisfiability of Equality Equations", "question__title_slug": "satisfiability-of-equality-equations", "question__hide": false, - "total_acs": 52122, - "total_submitted": 97609, - "total_column_articles": 892, + "total_acs": 52444, + "total_submitted": 98186, + "total_column_articles": 895, "frontend_question_id": "990", "is_new_question": false }, @@ -43125,9 +43776,9 @@ "question__title": "Add to Array-Form of Integer", "question__title_slug": "add-to-array-form-of-integer", "question__hide": false, - "total_acs": 70742, - "total_submitted": 153282, - "total_column_articles": 780, + "total_acs": 70975, + "total_submitted": 153892, + "total_column_articles": 786, "frontend_question_id": "989", "is_new_question": false }, @@ -43146,8 +43797,8 @@ "question__title": "Smallest String Starting From Leaf", "question__title_slug": "smallest-string-starting-from-leaf", "question__hide": false, - "total_acs": 15522, - "total_submitted": 30395, + "total_acs": 15606, + "total_submitted": 30531, "total_column_articles": 192, "frontend_question_id": "988", "is_new_question": false @@ -43167,8 +43818,8 @@ "question__title": "Vertical Order Traversal of a Binary Tree", "question__title_slug": "vertical-order-traversal-of-a-binary-tree", "question__hide": false, - "total_acs": 31589, - "total_submitted": 58877, + "total_acs": 31652, + "total_submitted": 58984, "total_column_articles": 507, "frontend_question_id": "987", "is_new_question": false @@ -43188,8 +43839,8 @@ "question__title": "Interval List Intersections", "question__title_slug": "interval-list-intersections", "question__hide": false, - "total_acs": 62051, - "total_submitted": 90671, + "total_acs": 62289, + "total_submitted": 91004, "total_column_articles": 583, "frontend_question_id": "986", "is_new_question": false @@ -43209,8 +43860,8 @@ "question__title": "Sum of Even Numbers After Queries", "question__title_slug": "sum-of-even-numbers-after-queries", "question__hide": false, - "total_acs": 19358, - "total_submitted": 31702, + "total_acs": 19411, + "total_submitted": 31789, "total_column_articles": 225, "frontend_question_id": "985", "is_new_question": false @@ -43230,9 +43881,9 @@ "question__title": "String Without AAA or BBB", "question__title_slug": "string-without-aaa-or-bbb", "question__hide": false, - "total_acs": 13032, - "total_submitted": 30093, - "total_column_articles": 216, + "total_acs": 13091, + "total_submitted": 30203, + "total_column_articles": 217, "frontend_question_id": "984", "is_new_question": false }, @@ -43251,9 +43902,9 @@ "question__title": "Minimum Cost For Tickets", "question__title_slug": "minimum-cost-for-tickets", "question__hide": false, - "total_acs": 41424, - "total_submitted": 65272, - "total_column_articles": 539, + "total_acs": 41591, + "total_submitted": 65513, + "total_column_articles": 543, "frontend_question_id": "983", "is_new_question": false }, @@ -43272,9 +43923,9 @@ "question__title": "Triples with Bitwise AND Equal To Zero", "question__title_slug": "triples-with-bitwise-and-equal-to-zero", "question__hide": false, - "total_acs": 20875, - "total_submitted": 31054, - "total_column_articles": 151, + "total_acs": 20911, + "total_submitted": 31104, + "total_column_articles": 152, "frontend_question_id": "982", "is_new_question": false }, @@ -43293,9 +43944,9 @@ "question__title": "Time Based Key-Value Store", "question__title_slug": "time-based-key-value-store", "question__hide": false, - "total_acs": 29956, - "total_submitted": 56556, - "total_column_articles": 385, + "total_acs": 30081, + "total_submitted": 56781, + "total_column_articles": 386, "frontend_question_id": "981", "is_new_question": false }, @@ -43314,9 +43965,9 @@ "question__title": "Unique Paths III", "question__title_slug": "unique-paths-iii", "question__hide": false, - "total_acs": 20694, - "total_submitted": 27940, - "total_column_articles": 304, + "total_acs": 20782, + "total_submitted": 28059, + "total_column_articles": 306, "frontend_question_id": "980", "is_new_question": false }, @@ -43335,8 +43986,8 @@ "question__title": "Distribute Coins in Binary Tree", "question__title_slug": "distribute-coins-in-binary-tree", "question__hide": false, - "total_acs": 13101, - "total_submitted": 18078, + "total_acs": 13164, + "total_submitted": 18160, "total_column_articles": 201, "frontend_question_id": "979", "is_new_question": false @@ -43356,9 +44007,9 @@ "question__title": "Longest Turbulent Subarray", "question__title_slug": "longest-turbulent-subarray", "question__hide": false, - "total_acs": 51067, - "total_submitted": 107567, - "total_column_articles": 686, + "total_acs": 51182, + "total_submitted": 107751, + "total_column_articles": 688, "frontend_question_id": "978", "is_new_question": false }, @@ -43377,9 +44028,9 @@ "question__title": "Squares of a Sorted Array", "question__title_slug": "squares-of-a-sorted-array", "question__hide": false, - "total_acs": 525917, - "total_submitted": 772668, - "total_column_articles": 3311, + "total_acs": 530231, + "total_submitted": 779320, + "total_column_articles": 3328, "frontend_question_id": "977", "is_new_question": false }, @@ -43398,9 +44049,9 @@ "question__title": "Largest Perimeter Triangle", "question__title_slug": "largest-perimeter-triangle", "question__hide": false, - "total_acs": 83916, - "total_submitted": 146013, - "total_column_articles": 837, + "total_acs": 84197, + "total_submitted": 146466, + "total_column_articles": 838, "frontend_question_id": "976", "is_new_question": false }, @@ -43419,9 +44070,9 @@ "question__title": "Odd Even Jump", "question__title_slug": "odd-even-jump", "question__hide": false, - "total_acs": 5408, - "total_submitted": 11320, - "total_column_articles": 89, + "total_acs": 5427, + "total_submitted": 11358, + "total_column_articles": 90, "frontend_question_id": "975", "is_new_question": false }, @@ -43440,8 +44091,8 @@ "question__title": "Subarray Sums Divisible by K", "question__title_slug": "subarray-sums-divisible-by-k", "question__hide": false, - "total_acs": 57471, - "total_submitted": 120100, + "total_acs": 57662, + "total_submitted": 120509, "total_column_articles": 536, "frontend_question_id": "974", "is_new_question": false @@ -43461,9 +44112,9 @@ "question__title": "K Closest Points to Origin", "question__title_slug": "k-closest-points-to-origin", "question__hide": false, - "total_acs": 94395, - "total_submitted": 144714, - "total_column_articles": 818, + "total_acs": 94621, + "total_submitted": 145025, + "total_column_articles": 819, "frontend_question_id": "973", "is_new_question": false }, @@ -43482,9 +44133,9 @@ "question__title": "Fibonacci Number", "question__title_slug": "fibonacci-number", "question__hide": false, - "total_acs": 544065, - "total_submitted": 820815, - "total_column_articles": 3071, + "total_acs": 548293, + "total_submitted": 827304, + "total_column_articles": 3085, "frontend_question_id": "509", "is_new_question": false }, @@ -43503,8 +44154,8 @@ "question__title": "Equal Rational Numbers", "question__title_slug": "equal-rational-numbers", "question__hide": false, - "total_acs": 2101, - "total_submitted": 5085, + "total_acs": 2119, + "total_submitted": 5120, "total_column_articles": 52, "frontend_question_id": "972", "is_new_question": false @@ -43524,9 +44175,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": 10367, - "total_submitted": 22879, - "total_column_articles": 160, + "total_acs": 10429, + "total_submitted": 22984, + "total_column_articles": 163, "frontend_question_id": "971", "is_new_question": false }, @@ -43545,9 +44196,9 @@ "question__title": "Powerful Integers", "question__title_slug": "powerful-integers", "question__hide": false, - "total_acs": 26390, - "total_submitted": 56540, - "total_column_articles": 285, + "total_acs": 28206, + "total_submitted": 60011, + "total_column_articles": 293, "frontend_question_id": "970", "is_new_question": false }, @@ -43566,9 +44217,9 @@ "question__title": "Pancake Sorting", "question__title_slug": "pancake-sorting", "question__hide": false, - "total_acs": 46862, - "total_submitted": 69378, - "total_column_articles": 682, + "total_acs": 46972, + "total_submitted": 69546, + "total_column_articles": 683, "frontend_question_id": "969", "is_new_question": false }, @@ -43587,9 +44238,9 @@ "question__title": "Binary Tree Cameras", "question__title_slug": "binary-tree-cameras", "question__hide": false, - "total_acs": 57747, - "total_submitted": 110662, - "total_column_articles": 587, + "total_acs": 58493, + "total_submitted": 112051, + "total_column_articles": 596, "frontend_question_id": "968", "is_new_question": false }, @@ -43608,9 +44259,9 @@ "question__title": "Numbers With Same Consecutive Differences", "question__title_slug": "numbers-with-same-consecutive-differences", "question__hide": false, - "total_acs": 12009, - "total_submitted": 23840, - "total_column_articles": 233, + "total_acs": 12044, + "total_submitted": 23917, + "total_column_articles": 235, "frontend_question_id": "967", "is_new_question": false }, @@ -43629,8 +44280,8 @@ "question__title": "Vowel Spellchecker", "question__title_slug": "vowel-spellchecker", "question__hide": false, - "total_acs": 4646, - "total_submitted": 10852, + "total_acs": 4672, + "total_submitted": 10902, "total_column_articles": 68, "frontend_question_id": "966", "is_new_question": false @@ -43650,9 +44301,9 @@ "question__title": "Univalued Binary Tree", "question__title_slug": "univalued-binary-tree", "question__hide": false, - "total_acs": 79775, - "total_submitted": 112526, - "total_column_articles": 866, + "total_acs": 80064, + "total_submitted": 113006, + "total_column_articles": 868, "frontend_question_id": "965", "is_new_question": false }, @@ -43671,8 +44322,8 @@ "question__title": "Least Operators to Express Number", "question__title_slug": "least-operators-to-express-number", "question__hide": false, - "total_acs": 2232, - "total_submitted": 4821, + "total_acs": 2241, + "total_submitted": 4833, "total_column_articles": 40, "frontend_question_id": "964", "is_new_question": false @@ -43692,8 +44343,8 @@ "question__title": "Minimum Area Rectangle II", "question__title_slug": "minimum-area-rectangle-ii", "question__hide": false, - "total_acs": 3670, - "total_submitted": 7180, + "total_acs": 3705, + "total_submitted": 7249, "total_column_articles": 53, "frontend_question_id": "963", "is_new_question": false @@ -43713,8 +44364,8 @@ "question__title": "Maximum Width Ramp", "question__title_slug": "maximum-width-ramp", "question__hide": false, - "total_acs": 23711, - "total_submitted": 50225, + "total_acs": 23831, + "total_submitted": 50429, "total_column_articles": 226, "frontend_question_id": "962", "is_new_question": false @@ -43734,8 +44385,8 @@ "question__title": "N-Repeated Element in Size 2N Array", "question__title_slug": "n-repeated-element-in-size-2n-array", "question__hide": false, - "total_acs": 79349, - "total_submitted": 113119, + "total_acs": 79555, + "total_submitted": 113386, "total_column_articles": 724, "frontend_question_id": "961", "is_new_question": false @@ -43755,8 +44406,8 @@ "question__title": "Delete Columns to Make Sorted III", "question__title_slug": "delete-columns-to-make-sorted-iii", "question__hide": false, - "total_acs": 3502, - "total_submitted": 5942, + "total_acs": 3531, + "total_submitted": 5985, "total_column_articles": 61, "frontend_question_id": "960", "is_new_question": false @@ -43776,8 +44427,8 @@ "question__title": "Regions Cut By Slashes", "question__title_slug": "regions-cut-by-slashes", "question__hide": false, - "total_acs": 22907, - "total_submitted": 30818, + "total_acs": 22953, + "total_submitted": 30877, "total_column_articles": 354, "frontend_question_id": "959", "is_new_question": false @@ -43797,9 +44448,9 @@ "question__title": "Check Completeness of a Binary Tree", "question__title_slug": "check-completeness-of-a-binary-tree", "question__hide": false, - "total_acs": 48770, - "total_submitted": 89433, - "total_column_articles": 450, + "total_acs": 49075, + "total_submitted": 90002, + "total_column_articles": 453, "frontend_question_id": "958", "is_new_question": false }, @@ -43818,8 +44469,8 @@ "question__title": "Prison Cells After N Days", "question__title_slug": "prison-cells-after-n-days", "question__hide": false, - "total_acs": 19138, - "total_submitted": 51879, + "total_acs": 19193, + "total_submitted": 51973, "total_column_articles": 187, "frontend_question_id": "957", "is_new_question": false @@ -43839,9 +44490,9 @@ "question__title": "Tallest Billboard", "question__title_slug": "tallest-billboard", "question__hide": false, - "total_acs": 6312, - "total_submitted": 13715, - "total_column_articles": 77, + "total_acs": 6369, + "total_submitted": 13805, + "total_column_articles": 78, "frontend_question_id": "956", "is_new_question": false }, @@ -43860,8 +44511,8 @@ "question__title": "Delete Columns to Make Sorted II", "question__title_slug": "delete-columns-to-make-sorted-ii", "question__hide": false, - "total_acs": 5369, - "total_submitted": 15173, + "total_acs": 5394, + "total_submitted": 15236, "total_column_articles": 90, "frontend_question_id": "955", "is_new_question": false @@ -43881,8 +44532,8 @@ "question__title": "Array of Doubled Pairs", "question__title_slug": "array-of-doubled-pairs", "question__hide": false, - "total_acs": 42611, - "total_submitted": 109084, + "total_acs": 42647, + "total_submitted": 109162, "total_column_articles": 478, "frontend_question_id": "954", "is_new_question": false @@ -43902,9 +44553,9 @@ "question__title": "Verifying an Alien Dictionary", "question__title_slug": "verifying-an-alien-dictionary", "question__hide": false, - "total_acs": 54562, - "total_submitted": 94457, - "total_column_articles": 691, + "total_acs": 54758, + "total_submitted": 94812, + "total_column_articles": 692, "frontend_question_id": "953", "is_new_question": false }, @@ -43923,9 +44574,9 @@ "question__title": "Largest Component Size by Common Factor", "question__title_slug": "largest-component-size-by-common-factor", "question__hide": false, - "total_acs": 18939, - "total_submitted": 37157, - "total_column_articles": 182, + "total_acs": 19006, + "total_submitted": 37253, + "total_column_articles": 183, "frontend_question_id": "952", "is_new_question": false }, @@ -43944,8 +44595,8 @@ "question__title": "Flip Equivalent Binary Trees", "question__title_slug": "flip-equivalent-binary-trees", "question__hide": false, - "total_acs": 17129, - "total_submitted": 25643, + "total_acs": 17205, + "total_submitted": 25752, "total_column_articles": 247, "frontend_question_id": "951", "is_new_question": false @@ -43965,9 +44616,9 @@ "question__title": "Reveal Cards In Increasing Order", "question__title_slug": "reveal-cards-in-increasing-order", "question__hide": false, - "total_acs": 14045, - "total_submitted": 17878, - "total_column_articles": 231, + "total_acs": 14109, + "total_submitted": 17960, + "total_column_articles": 232, "frontend_question_id": "950", "is_new_question": false }, @@ -43986,8 +44637,8 @@ "question__title": "Largest Time for Given Digits", "question__title_slug": "largest-time-for-given-digits", "question__hide": false, - "total_acs": 11496, - "total_submitted": 30366, + "total_acs": 11540, + "total_submitted": 30469, "total_column_articles": 183, "frontend_question_id": "949", "is_new_question": false @@ -44007,9 +44658,9 @@ "question__title": "Bag of Tokens", "question__title_slug": "bag-of-tokens", "question__hide": false, - "total_acs": 9965, - "total_submitted": 24634, - "total_column_articles": 155, + "total_acs": 10012, + "total_submitted": 24738, + "total_column_articles": 156, "frontend_question_id": "948", "is_new_question": false }, @@ -44028,9 +44679,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": 33715, - "total_submitted": 54781, - "total_column_articles": 426, + "total_acs": 33804, + "total_submitted": 54929, + "total_column_articles": 427, "frontend_question_id": "947", "is_new_question": false }, @@ -44049,9 +44700,9 @@ "question__title": "Validate Stack Sequences", "question__title_slug": "validate-stack-sequences", "question__hide": false, - "total_acs": 78367, - "total_submitted": 117651, - "total_column_articles": 841, + "total_acs": 78765, + "total_submitted": 118232, + "total_column_articles": 844, "frontend_question_id": "946", "is_new_question": false }, @@ -44070,9 +44721,9 @@ "question__title": "Minimum Increment to Make Array Unique", "question__title_slug": "minimum-increment-to-make-array-unique", "question__hide": false, - "total_acs": 42212, - "total_submitted": 88106, - "total_column_articles": 618, + "total_acs": 42285, + "total_submitted": 88245, + "total_column_articles": 620, "frontend_question_id": "945", "is_new_question": false }, @@ -44091,9 +44742,9 @@ "question__title": "Delete Columns to Make Sorted", "question__title_slug": "delete-columns-to-make-sorted", "question__hide": false, - "total_acs": 56584, - "total_submitted": 81975, - "total_column_articles": 499, + "total_acs": 56707, + "total_submitted": 82140, + "total_column_articles": 501, "frontend_question_id": "944", "is_new_question": false }, @@ -44112,8 +44763,8 @@ "question__title": "Find the Shortest Superstring", "question__title_slug": "find-the-shortest-superstring", "question__hide": false, - "total_acs": 3391, - "total_submitted": 7198, + "total_acs": 3404, + "total_submitted": 7234, "total_column_articles": 75, "frontend_question_id": "943", "is_new_question": false @@ -44133,9 +44784,9 @@ "question__title": "DI String Match", "question__title_slug": "di-string-match", "question__hide": false, - "total_acs": 65685, - "total_submitted": 85034, - "total_column_articles": 787, + "total_acs": 65843, + "total_submitted": 85238, + "total_column_articles": 788, "frontend_question_id": "942", "is_new_question": false }, @@ -44154,9 +44805,9 @@ "question__title": "Valid Mountain Array", "question__title_slug": "valid-mountain-array", "question__hide": false, - "total_acs": 83083, - "total_submitted": 210317, - "total_column_articles": 793, + "total_acs": 83571, + "total_submitted": 211569, + "total_column_articles": 794, "frontend_question_id": "941", "is_new_question": false }, @@ -44175,9 +44826,9 @@ "question__title": "Distinct Subsequences II", "question__title_slug": "distinct-subsequences-ii", "question__hide": false, - "total_acs": 30195, - "total_submitted": 56347, - "total_column_articles": 281, + "total_acs": 30251, + "total_submitted": 56468, + "total_column_articles": 282, "frontend_question_id": "940", "is_new_question": false }, @@ -44196,8 +44847,8 @@ "question__title": "Minimum Area Rectangle", "question__title_slug": "minimum-area-rectangle", "question__hide": false, - "total_acs": 8641, - "total_submitted": 17927, + "total_acs": 8680, + "total_submitted": 18009, "total_column_articles": 99, "frontend_question_id": "939", "is_new_question": false @@ -44217,8 +44868,8 @@ "question__title": "Range Sum of BST", "question__title_slug": "range-sum-of-bst", "question__hide": false, - "total_acs": 120162, - "total_submitted": 146376, + "total_acs": 120469, + "total_submitted": 146760, "total_column_articles": 991, "frontend_question_id": "938", "is_new_question": false @@ -44238,9 +44889,9 @@ "question__title": "Reorder Data in Log Files", "question__title_slug": "reorder-data-in-log-files", "question__hide": false, - "total_acs": 41568, - "total_submitted": 65478, - "total_column_articles": 501, + "total_acs": 41616, + "total_submitted": 65550, + "total_column_articles": 503, "frontend_question_id": "937", "is_new_question": false }, @@ -44259,8 +44910,8 @@ "question__title": "Stamping The Sequence", "question__title_slug": "stamping-the-sequence", "question__hide": false, - "total_acs": 2640, - "total_submitted": 6283, + "total_acs": 2665, + "total_submitted": 6336, "total_column_articles": 39, "frontend_question_id": "936", "is_new_question": false @@ -44280,9 +44931,9 @@ "question__title": "Knight Dialer", "question__title_slug": "knight-dialer", "question__hide": false, - "total_acs": 9634, - "total_submitted": 18805, - "total_column_articles": 129, + "total_acs": 9681, + "total_submitted": 18872, + "total_column_articles": 130, "frontend_question_id": "935", "is_new_question": false }, @@ -44301,9 +44952,9 @@ "question__title": "Shortest Bridge", "question__title_slug": "shortest-bridge", "question__hide": false, - "total_acs": 65870, - "total_submitted": 125417, - "total_column_articles": 722, + "total_acs": 66192, + "total_submitted": 126050, + "total_column_articles": 723, "frontend_question_id": "934", "is_new_question": false }, @@ -44322,9 +44973,9 @@ "question__title": "Number of Recent Calls", "question__title_slug": "number-of-recent-calls", "question__hide": false, - "total_acs": 95942, - "total_submitted": 124962, - "total_column_articles": 813, + "total_acs": 96517, + "total_submitted": 125702, + "total_column_articles": 817, "frontend_question_id": "933", "is_new_question": false }, @@ -44343,8 +44994,8 @@ "question__title": "Beautiful Array", "question__title_slug": "beautiful-array", "question__hide": false, - "total_acs": 13295, - "total_submitted": 20298, + "total_acs": 13350, + "total_submitted": 20379, "total_column_articles": 130, "frontend_question_id": "932", "is_new_question": false @@ -44364,9 +45015,9 @@ "question__title": "Minimum Falling Path Sum", "question__title_slug": "minimum-falling-path-sum", "question__hide": false, - "total_acs": 56620, - "total_submitted": 84363, - "total_column_articles": 1022, + "total_acs": 57246, + "total_submitted": 85253, + "total_column_articles": 1028, "frontend_question_id": "931", "is_new_question": false }, @@ -44385,9 +45036,9 @@ "question__title": "Binary Subarrays With Sum", "question__title_slug": "binary-subarrays-with-sum", "question__hide": false, - "total_acs": 44157, - "total_submitted": 80173, - "total_column_articles": 434, + "total_acs": 44270, + "total_submitted": 80335, + "total_column_articles": 436, "frontend_question_id": "930", "is_new_question": false }, @@ -44406,8 +45057,8 @@ "question__title": "Unique Email Addresses", "question__title_slug": "unique-email-addresses", "question__hide": false, - "total_acs": 55393, - "total_submitted": 80649, + "total_acs": 55498, + "total_submitted": 80809, "total_column_articles": 537, "frontend_question_id": "929", "is_new_question": false @@ -44427,8 +45078,8 @@ "question__title": "Minimize Malware Spread II", "question__title_slug": "minimize-malware-spread-ii", "question__hide": false, - "total_acs": 3990, - "total_submitted": 9126, + "total_acs": 4020, + "total_submitted": 9209, "total_column_articles": 74, "frontend_question_id": "928", "is_new_question": false @@ -44448,8 +45099,8 @@ "question__title": "Three Equal Parts", "question__title_slug": "three-equal-parts", "question__hide": false, - "total_acs": 23717, - "total_submitted": 54071, + "total_acs": 23748, + "total_submitted": 54131, "total_column_articles": 364, "frontend_question_id": "927", "is_new_question": false @@ -44469,9 +45120,9 @@ "question__title": "Flip String to Monotone Increasing", "question__title_slug": "flip-string-to-monotone-increasing", "question__hide": false, - "total_acs": 36581, - "total_submitted": 57570, - "total_column_articles": 513, + "total_acs": 36826, + "total_submitted": 58005, + "total_column_articles": 515, "frontend_question_id": "926", "is_new_question": false }, @@ -44490,9 +45141,9 @@ "question__title": "Long Pressed Name", "question__title_slug": "long-pressed-name", "question__hide": false, - "total_acs": 65155, - "total_submitted": 173479, - "total_column_articles": 822, + "total_acs": 65546, + "total_submitted": 174612, + "total_column_articles": 824, "frontend_question_id": "925", "is_new_question": false }, @@ -44511,8 +45162,8 @@ "question__title": "Minimize Malware Spread", "question__title_slug": "minimize-malware-spread", "question__hide": false, - "total_acs": 9943, - "total_submitted": 27763, + "total_acs": 9986, + "total_submitted": 27883, "total_column_articles": 148, "frontend_question_id": "924", "is_new_question": false @@ -44532,9 +45183,9 @@ "question__title": "3Sum With Multiplicity", "question__title_slug": "3sum-with-multiplicity", "question__hide": false, - "total_acs": 9816, - "total_submitted": 26620, - "total_column_articles": 115, + "total_acs": 9862, + "total_submitted": 26741, + "total_column_articles": 116, "frontend_question_id": "923", "is_new_question": false }, @@ -44553,9 +45204,9 @@ "question__title": "Sort Array By Parity II", "question__title_slug": "sort-array-by-parity-ii", "question__hide": false, - "total_acs": 114521, - "total_submitted": 160550, - "total_column_articles": 1058, + "total_acs": 114973, + "total_submitted": 161191, + "total_column_articles": 1060, "frontend_question_id": "922", "is_new_question": false }, @@ -44574,9 +45225,9 @@ "question__title": "Minimum Add to Make Parentheses Valid", "question__title_slug": "minimum-add-to-make-parentheses-valid", "question__hide": false, - "total_acs": 65605, - "total_submitted": 89830, - "total_column_articles": 909, + "total_acs": 65851, + "total_submitted": 90163, + "total_column_articles": 911, "frontend_question_id": "921", "is_new_question": false }, @@ -44595,9 +45246,9 @@ "question__title": "Number of Music Playlists", "question__title_slug": "number-of-music-playlists", "question__hide": false, - "total_acs": 3270, - "total_submitted": 6328, - "total_column_articles": 39, + "total_acs": 3290, + "total_submitted": 6366, + "total_column_articles": 40, "frontend_question_id": "920", "is_new_question": false }, @@ -44616,9 +45267,9 @@ "question__title": "Complete Binary Tree Inserter", "question__title_slug": "complete-binary-tree-inserter", "question__hide": false, - "total_acs": 31732, - "total_submitted": 47151, - "total_column_articles": 410, + "total_acs": 31797, + "total_submitted": 47346, + "total_column_articles": 411, "frontend_question_id": "919", "is_new_question": false }, @@ -44637,9 +45288,9 @@ "question__title": "Maximum Sum Circular Subarray", "question__title_slug": "maximum-sum-circular-subarray", "question__hide": false, - "total_acs": 52860, - "total_submitted": 140295, - "total_column_articles": 495, + "total_acs": 53114, + "total_submitted": 140916, + "total_column_articles": 497, "frontend_question_id": "918", "is_new_question": false }, @@ -44658,9 +45309,9 @@ "question__title": "Reverse Only Letters", "question__title_slug": "reverse-only-letters", "question__hide": false, - "total_acs": 76660, - "total_submitted": 128926, - "total_column_articles": 1054, + "total_acs": 76860, + "total_submitted": 129304, + "total_column_articles": 1058, "frontend_question_id": "917", "is_new_question": false }, @@ -44679,9 +45330,9 @@ "question__title": "Word Subsets", "question__title_slug": "word-subsets", "question__hide": false, - "total_acs": 9216, - "total_submitted": 19992, - "total_column_articles": 119, + "total_acs": 9250, + "total_submitted": 20072, + "total_column_articles": 118, "frontend_question_id": "916", "is_new_question": false }, @@ -44700,9 +45351,9 @@ "question__title": "Partition Array into Disjoint Intervals", "question__title_slug": "partition-array-into-disjoint-intervals", "question__hide": false, - "total_acs": 48089, - "total_submitted": 96036, - "total_column_articles": 557, + "total_acs": 48162, + "total_submitted": 96176, + "total_column_articles": 558, "frontend_question_id": "915", "is_new_question": false }, @@ -44721,9 +45372,9 @@ "question__title": "X of a Kind in a Deck of Cards", "question__title_slug": "x-of-a-kind-in-a-deck-of-cards", "question__hide": false, - "total_acs": 59183, - "total_submitted": 157539, - "total_column_articles": 737, + "total_acs": 59337, + "total_submitted": 157996, + "total_column_articles": 739, "frontend_question_id": "914", "is_new_question": false }, @@ -44742,8 +45393,8 @@ "question__title": "Cat and Mouse", "question__title_slug": "cat-and-mouse", "question__hide": false, - "total_acs": 17977, - "total_submitted": 33205, + "total_acs": 17988, + "total_submitted": 33239, "total_column_articles": 140, "frontend_question_id": "913", "is_new_question": false @@ -44763,9 +45414,9 @@ "question__title": "Sort an Array", "question__title_slug": "sort-an-array", "question__hide": false, - "total_acs": 528657, - "total_submitted": 1007735, - "total_column_articles": 2070, + "total_acs": 532154, + "total_submitted": 1017435, + "total_column_articles": 2082, "frontend_question_id": "912", "is_new_question": false }, @@ -44784,9 +45435,9 @@ "question__title": "Online Election", "question__title_slug": "online-election", "question__hide": false, - "total_acs": 31693, - "total_submitted": 58898, - "total_column_articles": 364, + "total_acs": 31767, + "total_submitted": 59020, + "total_column_articles": 365, "frontend_question_id": "911", "is_new_question": false }, @@ -44805,8 +45456,8 @@ "question__title": "Smallest Range II", "question__title_slug": "smallest-range-ii", "question__hide": false, - "total_acs": 11671, - "total_submitted": 32796, + "total_acs": 11719, + "total_submitted": 32922, "total_column_articles": 123, "frontend_question_id": "910", "is_new_question": false @@ -44826,8 +45477,8 @@ "question__title": "Snakes and Ladders", "question__title_slug": "snakes-and-ladders", "question__hide": false, - "total_acs": 19531, - "total_submitted": 42578, + "total_acs": 19638, + "total_submitted": 42830, "total_column_articles": 221, "frontend_question_id": "909", "is_new_question": false @@ -44847,9 +45498,9 @@ "question__title": "Smallest Range I", "question__title_slug": "smallest-range-i", "question__hide": false, - "total_acs": 55022, - "total_submitted": 73999, - "total_column_articles": 573, + "total_acs": 55173, + "total_submitted": 74180, + "total_column_articles": 576, "frontend_question_id": "908", "is_new_question": false }, @@ -44868,8 +45519,8 @@ "question__title": "Sum of Subarray Minimums", "question__title_slug": "sum-of-subarray-minimums", "question__hide": false, - "total_acs": 45675, - "total_submitted": 119536, + "total_acs": 45876, + "total_submitted": 119994, "total_column_articles": 435, "frontend_question_id": "907", "is_new_question": false @@ -44889,8 +45540,8 @@ "question__title": "Super Palindromes", "question__title_slug": "super-palindromes", "question__hide": false, - "total_acs": 4054, - "total_submitted": 12780, + "total_acs": 4099, + "total_submitted": 12894, "total_column_articles": 77, "frontend_question_id": "906", "is_new_question": false @@ -44910,9 +45561,9 @@ "question__title": "Sort Array By Parity", "question__title_slug": "sort-array-by-parity", "question__hide": false, - "total_acs": 119470, - "total_submitted": 168275, - "total_column_articles": 1434, + "total_acs": 119798, + "total_submitted": 168721, + "total_column_articles": 1435, "frontend_question_id": "905", "is_new_question": false }, @@ -44931,9 +45582,9 @@ "question__title": "Fruit Into Baskets", "question__title_slug": "fruit-into-baskets", "question__hide": false, - "total_acs": 125296, - "total_submitted": 278740, - "total_column_articles": 1408, + "total_acs": 126630, + "total_submitted": 281722, + "total_column_articles": 1420, "frontend_question_id": "904", "is_new_question": false }, @@ -44952,9 +45603,9 @@ "question__title": "Valid Permutations for DI Sequence", "question__title_slug": "valid-permutations-for-di-sequence", "question__hide": false, - "total_acs": 4232, - "total_submitted": 7506, - "total_column_articles": 63, + "total_acs": 4253, + "total_submitted": 7555, + "total_column_articles": 64, "frontend_question_id": "903", "is_new_question": false }, @@ -44973,9 +45624,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": 26526, - "total_submitted": 57692, - "total_column_articles": 395, + "total_acs": 26634, + "total_submitted": 57888, + "total_column_articles": 394, "frontend_question_id": "902", "is_new_question": false }, @@ -44994,9 +45645,9 @@ "question__title": "Online Stock Span", "question__title_slug": "online-stock-span", "question__hide": false, - "total_acs": 59006, - "total_submitted": 94704, - "total_column_articles": 653, + "total_acs": 59389, + "total_submitted": 95311, + "total_column_articles": 655, "frontend_question_id": "901", "is_new_question": false }, @@ -45015,9 +45666,9 @@ "question__title": "RLE Iterator", "question__title_slug": "rle-iterator", "question__hide": false, - "total_acs": 5498, - "total_submitted": 10734, - "total_column_articles": 84, + "total_acs": 5540, + "total_submitted": 10798, + "total_column_articles": 86, "frontend_question_id": "900", "is_new_question": false }, @@ -45036,8 +45687,8 @@ "question__title": "Orderly Queue", "question__title_slug": "orderly-queue", "question__hide": false, - "total_acs": 27842, - "total_submitted": 43281, + "total_acs": 27928, + "total_submitted": 43429, "total_column_articles": 275, "frontend_question_id": "899", "is_new_question": false @@ -45057,8 +45708,8 @@ "question__title": "Bitwise ORs of Subarrays", "question__title_slug": "bitwise-ors-of-subarrays", "question__hide": false, - "total_acs": 8656, - "total_submitted": 22346, + "total_acs": 8710, + "total_submitted": 22439, "total_column_articles": 62, "frontend_question_id": "898", "is_new_question": false @@ -45078,9 +45729,9 @@ "question__title": "Increasing Order Search Tree", "question__title_slug": "increasing-order-search-tree", "question__hide": false, - "total_acs": 77451, - "total_submitted": 104604, - "total_column_articles": 891, + "total_acs": 77648, + "total_submitted": 104882, + "total_column_articles": 893, "frontend_question_id": "897", "is_new_question": false }, @@ -45099,9 +45750,9 @@ "question__title": "Monotonic Array", "question__title_slug": "monotonic-array", "question__hide": false, - "total_acs": 82155, - "total_submitted": 144028, - "total_column_articles": 971, + "total_acs": 82409, + "total_submitted": 144458, + "total_column_articles": 975, "frontend_question_id": "896", "is_new_question": false }, @@ -45120,8 +45771,8 @@ "question__title": "Maximum Frequency Stack", "question__title_slug": "maximum-frequency-stack", "question__hide": false, - "total_acs": 31045, - "total_submitted": 48115, + "total_acs": 31187, + "total_submitted": 48348, "total_column_articles": 320, "frontend_question_id": "895", "is_new_question": false @@ -45141,8 +45792,8 @@ "question__title": "All Possible Full Binary Trees", "question__title_slug": "all-possible-full-binary-trees", "question__hide": false, - "total_acs": 18907, - "total_submitted": 24361, + "total_acs": 18980, + "total_submitted": 24447, "total_column_articles": 195, "frontend_question_id": "894", "is_new_question": false @@ -45162,8 +45813,8 @@ "question__title": "Groups of Special-Equivalent Strings", "question__title_slug": "groups-of-special-equivalent-strings", "question__hide": false, - "total_acs": 12886, - "total_submitted": 17675, + "total_acs": 12921, + "total_submitted": 17717, "total_column_articles": 142, "frontend_question_id": "893", "is_new_question": false @@ -45183,9 +45834,9 @@ "question__title": "Surface Area of 3D Shapes", "question__title_slug": "surface-area-of-3d-shapes", "question__hide": false, - "total_acs": 38207, - "total_submitted": 59349, - "total_column_articles": 772, + "total_acs": 38295, + "total_submitted": 59470, + "total_column_articles": 774, "frontend_question_id": "892", "is_new_question": false }, @@ -45204,9 +45855,9 @@ "question__title": "Sum of Subsequence Widths", "question__title_slug": "sum-of-subsequence-widths", "question__hide": false, - "total_acs": 20220, - "total_submitted": 43371, - "total_column_articles": 198, + "total_acs": 20252, + "total_submitted": 43457, + "total_column_articles": 199, "frontend_question_id": "891", "is_new_question": false }, @@ -45225,9 +45876,9 @@ "question__title": "Find and Replace Pattern", "question__title_slug": "find-and-replace-pattern", "question__hide": false, - "total_acs": 31394, - "total_submitted": 39906, - "total_column_articles": 467, + "total_acs": 31447, + "total_submitted": 39974, + "total_column_articles": 469, "frontend_question_id": "890", "is_new_question": false }, @@ -45246,9 +45897,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": 37580, - "total_submitted": 55289, - "total_column_articles": 357, + "total_acs": 37918, + "total_submitted": 55785, + "total_column_articles": 358, "frontend_question_id": "889", "is_new_question": false }, @@ -45267,8 +45918,8 @@ "question__title": "Fair Candy Swap", "question__title_slug": "fair-candy-swap", "question__hide": false, - "total_acs": 67479, - "total_submitted": 106025, + "total_acs": 67641, + "total_submitted": 106304, "total_column_articles": 594, "frontend_question_id": "888", "is_new_question": false @@ -45288,9 +45939,9 @@ "question__title": "Super Egg Drop", "question__title_slug": "super-egg-drop", "question__hide": false, - "total_acs": 76558, - "total_submitted": 250611, - "total_column_articles": 464, + "total_acs": 77088, + "total_submitted": 252047, + "total_column_articles": 467, "frontend_question_id": "887", "is_new_question": false }, @@ -45309,9 +45960,9 @@ "question__title": "Possible Bipartition", "question__title_slug": "possible-bipartition", "question__hide": false, - "total_acs": 47278, - "total_submitted": 91013, - "total_column_articles": 611, + "total_acs": 47540, + "total_submitted": 91437, + "total_column_articles": 612, "frontend_question_id": "886", "is_new_question": false }, @@ -45330,9 +45981,9 @@ "question__title": "Spiral Matrix III", "question__title_slug": "spiral-matrix-iii", "question__hide": false, - "total_acs": 8080, - "total_submitted": 11383, - "total_column_articles": 128, + "total_acs": 8128, + "total_submitted": 11448, + "total_column_articles": 131, "frontend_question_id": "885", "is_new_question": false }, @@ -45351,8 +46002,8 @@ "question__title": "Uncommon Words from Two Sentences", "question__title_slug": "uncommon-words-from-two-sentences", "question__hide": false, - "total_acs": 49553, - "total_submitted": 69525, + "total_acs": 49704, + "total_submitted": 69730, "total_column_articles": 635, "frontend_question_id": "884", "is_new_question": false @@ -45372,9 +46023,9 @@ "question__title": "Projection Area of 3D Shapes", "question__title_slug": "projection-area-of-3d-shapes", "question__hide": false, - "total_acs": 45208, - "total_submitted": 59160, - "total_column_articles": 563, + "total_acs": 45314, + "total_submitted": 59294, + "total_column_articles": 564, "frontend_question_id": "883", "is_new_question": false }, @@ -45393,8 +46044,8 @@ "question__title": "Reachable Nodes In Subdivided Graph", "question__title_slug": "reachable-nodes-in-subdivided-graph", "question__hide": false, - "total_acs": 15474, - "total_submitted": 24124, + "total_acs": 15533, + "total_submitted": 24214, "total_column_articles": 139, "frontend_question_id": "882", "is_new_question": false @@ -45414,9 +46065,9 @@ "question__title": "Boats to Save People", "question__title_slug": "boats-to-save-people", "question__hide": false, - "total_acs": 66273, - "total_submitted": 123354, - "total_column_articles": 741, + "total_acs": 66491, + "total_submitted": 123748, + "total_column_articles": 744, "frontend_question_id": "881", "is_new_question": false }, @@ -45435,8 +46086,8 @@ "question__title": "Decoded String at Index", "question__title_slug": "decoded-string-at-index", "question__hide": false, - "total_acs": 8501, - "total_submitted": 31691, + "total_acs": 8537, + "total_submitted": 31788, "total_column_articles": 113, "frontend_question_id": "880", "is_new_question": false @@ -45456,9 +46107,9 @@ "question__title": "Generate Random Point in a Circle", "question__title_slug": "generate-random-point-in-a-circle", "question__hide": false, - "total_acs": 29338, - "total_submitted": 60770, - "total_column_articles": 187, + "total_acs": 29398, + "total_submitted": 60883, + "total_column_articles": 188, "frontend_question_id": "478", "is_new_question": false }, @@ -45477,8 +46128,8 @@ "question__title": "Random Point in Non-overlapping Rectangles", "question__title_slug": "random-point-in-non-overlapping-rectangles", "question__hide": false, - "total_acs": 23919, - "total_submitted": 57140, + "total_acs": 23958, + "total_submitted": 57234, "total_column_articles": 213, "frontend_question_id": "497", "is_new_question": false @@ -45498,9 +46149,9 @@ "question__title": "Random Flip Matrix", "question__title_slug": "random-flip-matrix", "question__hide": false, - "total_acs": 21722, - "total_submitted": 46954, - "total_column_articles": 210, + "total_acs": 21769, + "total_submitted": 47043, + "total_column_articles": 212, "frontend_question_id": "519", "is_new_question": false }, @@ -45519,9 +46170,9 @@ "question__title": "Random Pick with Weight", "question__title_slug": "random-pick-with-weight", "question__hide": false, - "total_acs": 55802, - "total_submitted": 115401, - "total_column_articles": 486, + "total_acs": 56097, + "total_submitted": 116002, + "total_column_articles": 487, "frontend_question_id": "528", "is_new_question": false }, @@ -45540,9 +46191,9 @@ "question__title": "Profitable Schemes", "question__title_slug": "profitable-schemes", "question__hide": false, - "total_acs": 27163, - "total_submitted": 49575, - "total_column_articles": 230, + "total_acs": 27281, + "total_submitted": 49802, + "total_column_articles": 232, "frontend_question_id": "879", "is_new_question": false }, @@ -45561,8 +46212,8 @@ "question__title": "Nth Magical Number", "question__title_slug": "nth-magical-number", "question__hide": false, - "total_acs": 23738, - "total_submitted": 59319, + "total_acs": 23771, + "total_submitted": 59395, "total_column_articles": 226, "frontend_question_id": "878", "is_new_question": false @@ -45582,9 +46233,9 @@ "question__title": "Stone Game", "question__title_slug": "stone-game", "question__hide": false, - "total_acs": 94207, - "total_submitted": 123258, - "total_column_articles": 660, + "total_acs": 94468, + "total_submitted": 123587, + "total_column_articles": 663, "frontend_question_id": "877", "is_new_question": false }, @@ -45603,9 +46254,9 @@ "question__title": "Middle of the Linked List", "question__title_slug": "middle-of-the-linked-list", "question__hide": false, - "total_acs": 388801, - "total_submitted": 553806, - "total_column_articles": 3489, + "total_acs": 391362, + "total_submitted": 557575, + "total_column_articles": 3509, "frontend_question_id": "876", "is_new_question": false }, @@ -45624,9 +46275,9 @@ "question__title": "Koko Eating Bananas", "question__title_slug": "koko-eating-bananas", "question__hide": false, - "total_acs": 126480, - "total_submitted": 255265, - "total_column_articles": 948, + "total_acs": 127300, + "total_submitted": 257001, + "total_column_articles": 951, "frontend_question_id": "875", "is_new_question": false }, @@ -45645,8 +46296,8 @@ "question__title": "Walking Robot Simulation", "question__title_slug": "walking-robot-simulation", "question__hide": false, - "total_acs": 27136, - "total_submitted": 63097, + "total_acs": 27235, + "total_submitted": 63281, "total_column_articles": 339, "frontend_question_id": "874", "is_new_question": false @@ -45666,8 +46317,8 @@ "question__title": "Length of Longest Fibonacci Subsequence", "question__title_slug": "length-of-longest-fibonacci-subsequence", "question__hide": false, - "total_acs": 48839, - "total_submitted": 86871, + "total_acs": 48967, + "total_submitted": 87085, "total_column_articles": 382, "frontend_question_id": "873", "is_new_question": false @@ -45687,9 +46338,9 @@ "question__title": "Leaf-Similar Trees", "question__title_slug": "leaf-similar-trees", "question__hide": false, - "total_acs": 71873, - "total_submitted": 110408, - "total_column_articles": 864, + "total_acs": 72248, + "total_submitted": 111014, + "total_column_articles": 869, "frontend_question_id": "872", "is_new_question": false }, @@ -45708,8 +46359,8 @@ "question__title": "Implement Rand10() Using Rand7()", "question__title_slug": "implement-rand10-using-rand7", "question__hide": false, - "total_acs": 100112, - "total_submitted": 181210, + "total_acs": 100441, + "total_submitted": 181813, "total_column_articles": 461, "frontend_question_id": "470", "is_new_question": false @@ -45729,9 +46380,9 @@ "question__title": "Minimum Number of Refueling Stops", "question__title_slug": "minimum-number-of-refueling-stops", "question__hide": false, - "total_acs": 33679, - "total_submitted": 77855, - "total_column_articles": 361, + "total_acs": 33781, + "total_submitted": 78097, + "total_column_articles": 364, "frontend_question_id": "871", "is_new_question": false }, @@ -45750,9 +46401,9 @@ "question__title": "Advantage Shuffle", "question__title_slug": "advantage-shuffle", "question__hide": false, - "total_acs": 63840, - "total_submitted": 126947, - "total_column_articles": 752, + "total_acs": 64182, + "total_submitted": 127549, + "total_column_articles": 753, "frontend_question_id": "870", "is_new_question": false }, @@ -45771,8 +46422,8 @@ "question__title": "Reordered Power of 2", "question__title_slug": "reordered-power-of-2", "question__hide": false, - "total_acs": 36836, - "total_submitted": 57881, + "total_acs": 36888, + "total_submitted": 57993, "total_column_articles": 532, "frontend_question_id": "869", "is_new_question": false @@ -45792,9 +46443,9 @@ "question__title": "Binary Gap", "question__title_slug": "binary-gap", "question__hide": false, - "total_acs": 51445, - "total_submitted": 74177, - "total_column_articles": 690, + "total_acs": 51547, + "total_submitted": 74331, + "total_column_articles": 694, "frontend_question_id": "868", "is_new_question": false }, @@ -45813,9 +46464,9 @@ "question__title": "Transpose Matrix", "question__title_slug": "transpose-matrix", "question__hide": false, - "total_acs": 97146, - "total_submitted": 145553, - "total_column_articles": 863, + "total_acs": 97474, + "total_submitted": 146052, + "total_column_articles": 865, "frontend_question_id": "867", "is_new_question": false }, @@ -45834,8 +46485,8 @@ "question__title": "Prime Palindrome", "question__title_slug": "prime-palindrome", "question__hide": false, - "total_acs": 11016, - "total_submitted": 46404, + "total_acs": 11073, + "total_submitted": 46595, "total_column_articles": 126, "frontend_question_id": "866", "is_new_question": false @@ -45855,8 +46506,8 @@ "question__title": "Smallest Subtree with all the Deepest Nodes", "question__title_slug": "smallest-subtree-with-all-the-deepest-nodes", "question__hide": false, - "total_acs": 15229, - "total_submitted": 22151, + "total_acs": 15328, + "total_submitted": 22274, "total_column_articles": 222, "frontend_question_id": "865", "is_new_question": false @@ -45876,9 +46527,9 @@ "question__title": "Shortest Path to Get All Keys", "question__title_slug": "shortest-path-to-get-all-keys", "question__hide": false, - "total_acs": 20813, - "total_submitted": 34976, - "total_column_articles": 242, + "total_acs": 20876, + "total_submitted": 35091, + "total_column_articles": 243, "frontend_question_id": "864", "is_new_question": false }, @@ -45897,8 +46548,8 @@ "question__title": "Random Pick with Blacklist", "question__title_slug": "random-pick-with-blacklist", "question__hide": false, - "total_acs": 29255, - "total_submitted": 66949, + "total_acs": 29407, + "total_submitted": 67286, "total_column_articles": 433, "frontend_question_id": "710", "is_new_question": false @@ -45918,9 +46569,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": 51988, - "total_submitted": 84595, - "total_column_articles": 742, + "total_acs": 52239, + "total_submitted": 85001, + "total_column_articles": 746, "frontend_question_id": "863", "is_new_question": false }, @@ -45939,9 +46590,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": 47229, - "total_submitted": 178580, - "total_column_articles": 379, + "total_acs": 47423, + "total_submitted": 179089, + "total_column_articles": 380, "frontend_question_id": "862", "is_new_question": false }, @@ -45960,8 +46611,8 @@ "question__title": "Score After Flipping Matrix", "question__title_slug": "score-after-flipping-matrix", "question__hide": false, - "total_acs": 35584, - "total_submitted": 44066, + "total_acs": 35631, + "total_submitted": 44118, "total_column_articles": 516, "frontend_question_id": "861", "is_new_question": false @@ -45981,9 +46632,9 @@ "question__title": "Lemonade Change", "question__title_slug": "lemonade-change", "question__hide": false, - "total_acs": 166145, - "total_submitted": 283856, - "total_column_articles": 1271, + "total_acs": 167853, + "total_submitted": 286703, + "total_column_articles": 1284, "frontend_question_id": "860", "is_new_question": false }, @@ -46002,9 +46653,9 @@ "question__title": "Buddy Strings", "question__title_slug": "buddy-strings", "question__hide": false, - "total_acs": 69034, - "total_submitted": 200325, - "total_column_articles": 880, + "total_acs": 69260, + "total_submitted": 200877, + "total_column_articles": 882, "frontend_question_id": "859", "is_new_question": false }, @@ -46023,8 +46674,8 @@ "question__title": "Mirror Reflection", "question__title_slug": "mirror-reflection", "question__hide": false, - "total_acs": 4726, - "total_submitted": 8252, + "total_acs": 4752, + "total_submitted": 8296, "total_column_articles": 80, "frontend_question_id": "858", "is_new_question": false @@ -46044,9 +46695,9 @@ "question__title": "Minimum Cost to Hire K Workers", "question__title_slug": "minimum-cost-to-hire-k-workers", "question__hide": false, - "total_acs": 20075, - "total_submitted": 31590, - "total_column_articles": 214, + "total_acs": 20200, + "total_submitted": 31749, + "total_column_articles": 216, "frontend_question_id": "857", "is_new_question": false }, @@ -46065,9 +46716,9 @@ "question__title": "Score of Parentheses", "question__title_slug": "score-of-parentheses", "question__hide": false, - "total_acs": 53510, - "total_submitted": 78185, - "total_column_articles": 706, + "total_acs": 53620, + "total_submitted": 78329, + "total_column_articles": 707, "frontend_question_id": "856", "is_new_question": false }, @@ -46086,8 +46737,8 @@ "question__title": "Exam Room", "question__title_slug": "exam-room", "question__hide": false, - "total_acs": 21220, - "total_submitted": 44376, + "total_acs": 21276, + "total_submitted": 44527, "total_column_articles": 215, "frontend_question_id": "855", "is_new_question": false @@ -46107,8 +46758,8 @@ "question__title": "K-Similar Strings", "question__title_slug": "k-similar-strings", "question__hide": false, - "total_acs": 25792, - "total_submitted": 55187, + "total_acs": 25838, + "total_submitted": 55261, "total_column_articles": 248, "frontend_question_id": "854", "is_new_question": false @@ -46128,8 +46779,8 @@ "question__title": "Car Fleet", "question__title_slug": "car-fleet", "question__hide": false, - "total_acs": 17486, - "total_submitted": 42388, + "total_acs": 17606, + "total_submitted": 42583, "total_column_articles": 203, "frontend_question_id": "853", "is_new_question": false @@ -46149,9 +46800,9 @@ "question__title": "Peak Index in a Mountain Array", "question__title_slug": "peak-index-in-a-mountain-array", "question__hide": false, - "total_acs": 136942, - "total_submitted": 199374, - "total_column_articles": 1136, + "total_acs": 137440, + "total_submitted": 200128, + "total_column_articles": 1139, "frontend_question_id": "852", "is_new_question": false }, @@ -46170,8 +46821,8 @@ "question__title": "Loud and Rich", "question__title_slug": "loud-and-rich", "question__hide": false, - "total_acs": 30156, - "total_submitted": 47801, + "total_acs": 30268, + "total_submitted": 47959, "total_column_articles": 330, "frontend_question_id": "851", "is_new_question": false @@ -46191,9 +46842,9 @@ "question__title": "Rectangle Area II", "question__title_slug": "rectangle-area-ii", "question__hide": false, - "total_acs": 18815, - "total_submitted": 29854, - "total_column_articles": 178, + "total_acs": 18868, + "total_submitted": 29934, + "total_column_articles": 179, "frontend_question_id": "850", "is_new_question": false }, @@ -46212,9 +46863,9 @@ "question__title": "Maximize Distance to Closest Person", "question__title_slug": "maximize-distance-to-closest-person", "question__hide": false, - "total_acs": 21438, - "total_submitted": 48659, - "total_column_articles": 261, + "total_acs": 21557, + "total_submitted": 48843, + "total_column_articles": 264, "frontend_question_id": "849", "is_new_question": false }, @@ -46233,8 +46884,8 @@ "question__title": "Shifting Letters", "question__title_slug": "shifting-letters", "question__hide": false, - "total_acs": 13815, - "total_submitted": 29962, + "total_acs": 13889, + "total_submitted": 30133, "total_column_articles": 149, "frontend_question_id": "848", "is_new_question": false @@ -46254,8 +46905,8 @@ "question__title": "Shortest Path Visiting All Nodes", "question__title_slug": "shortest-path-visiting-all-nodes", "question__hide": false, - "total_acs": 26119, - "total_submitted": 38565, + "total_acs": 26190, + "total_submitted": 38679, "total_column_articles": 227, "frontend_question_id": "847", "is_new_question": false @@ -46275,8 +46926,8 @@ "question__title": "Hand of Straights", "question__title_slug": "hand-of-straights", "question__hide": false, - "total_acs": 40117, - "total_submitted": 70026, + "total_acs": 40201, + "total_submitted": 70186, "total_column_articles": 537, "frontend_question_id": "846", "is_new_question": false @@ -46296,9 +46947,9 @@ "question__title": "Longest Mountain in Array", "question__title_slug": "longest-mountain-in-array", "question__hide": false, - "total_acs": 48041, - "total_submitted": 113608, - "total_column_articles": 700, + "total_acs": 48207, + "total_submitted": 113967, + "total_column_articles": 704, "frontend_question_id": "845", "is_new_question": false }, @@ -46317,9 +46968,9 @@ "question__title": "Backspace String Compare", "question__title_slug": "backspace-string-compare", "question__hide": false, - "total_acs": 198314, - "total_submitted": 413285, - "total_column_articles": 1858, + "total_acs": 199801, + "total_submitted": 416550, + "total_column_articles": 1866, "frontend_question_id": "844", "is_new_question": false }, @@ -46338,8 +46989,8 @@ "question__title": "Guess the Word", "question__title_slug": "guess-the-word", "question__hide": false, - "total_acs": 4518, - "total_submitted": 12324, + "total_acs": 4537, + "total_submitted": 12362, "total_column_articles": 63, "frontend_question_id": "843", "is_new_question": false @@ -46359,8 +47010,8 @@ "question__title": "Split Array into Fibonacci Sequence", "question__title_slug": "split-array-into-fibonacci-sequence", "question__hide": false, - "total_acs": 33535, - "total_submitted": 69434, + "total_acs": 33583, + "total_submitted": 69542, "total_column_articles": 380, "frontend_question_id": "842", "is_new_question": false @@ -46380,9 +47031,9 @@ "question__title": "Keys and Rooms", "question__title_slug": "keys-and-rooms", "question__hide": false, - "total_acs": 85649, - "total_submitted": 126491, - "total_column_articles": 798, + "total_acs": 86627, + "total_submitted": 127816, + "total_column_articles": 801, "frontend_question_id": "841", "is_new_question": false }, @@ -46401,9 +47052,9 @@ "question__title": "Magic Squares In Grid", "question__title_slug": "magic-squares-in-grid", "question__hide": false, - "total_acs": 11329, - "total_submitted": 31005, - "total_column_articles": 145, + "total_acs": 11387, + "total_submitted": 31105, + "total_column_articles": 148, "frontend_question_id": "840", "is_new_question": false }, @@ -46422,9 +47073,9 @@ "question__title": "Similar String Groups", "question__title_slug": "similar-string-groups", "question__hide": false, - "total_acs": 24022, - "total_submitted": 40855, - "total_column_articles": 329, + "total_acs": 24115, + "total_submitted": 41003, + "total_column_articles": 330, "frontend_question_id": "839", "is_new_question": false }, @@ -46443,8 +47094,8 @@ "question__title": "Push Dominoes", "question__title_slug": "push-dominoes", "question__hide": false, - "total_acs": 39230, - "total_submitted": 70484, + "total_acs": 39280, + "total_submitted": 70569, "total_column_articles": 559, "frontend_question_id": "838", "is_new_question": false @@ -46464,9 +47115,9 @@ "question__title": "New 21 Game", "question__title_slug": "new-21-game", "question__hide": false, - "total_acs": 22198, - "total_submitted": 55950, - "total_column_articles": 271, + "total_acs": 22247, + "total_submitted": 56077, + "total_column_articles": 272, "frontend_question_id": "837", "is_new_question": false }, @@ -46485,8 +47136,8 @@ "question__title": "Rectangle Overlap", "question__title_slug": "rectangle-overlap", "question__hide": false, - "total_acs": 48621, - "total_submitted": 99413, + "total_acs": 48749, + "total_submitted": 99633, "total_column_articles": 774, "frontend_question_id": "836", "is_new_question": false @@ -46506,8 +47157,8 @@ "question__title": "Robot Room Cleaner", "question__title_slug": "robot-room-cleaner", "question__hide": false, - "total_acs": 3428, - "total_submitted": 4596, + "total_acs": 3441, + "total_submitted": 4610, "total_column_articles": 36, "frontend_question_id": "489", "is_new_question": false @@ -46527,9 +47178,9 @@ "question__title": "Image Overlap", "question__title_slug": "image-overlap", "question__hide": false, - "total_acs": 6265, - "total_submitted": 10752, - "total_column_articles": 68, + "total_acs": 6290, + "total_submitted": 10803, + "total_column_articles": 69, "frontend_question_id": "835", "is_new_question": false }, @@ -46548,8 +47199,8 @@ "question__title": "Sum of Distances in Tree", "question__title_slug": "sum-of-distances-in-tree", "question__hide": false, - "total_acs": 16908, - "total_submitted": 31083, + "total_acs": 16947, + "total_submitted": 31139, "total_column_articles": 176, "frontend_question_id": "834", "is_new_question": false @@ -46569,9 +47220,9 @@ "question__title": "Find And Replace in String", "question__title_slug": "find-and-replace-in-string", "question__hide": false, - "total_acs": 8057, - "total_submitted": 18336, - "total_column_articles": 130, + "total_acs": 8098, + "total_submitted": 18432, + "total_column_articles": 131, "frontend_question_id": "833", "is_new_question": false }, @@ -46590,9 +47241,9 @@ "question__title": "Flipping an Image", "question__title_slug": "flipping-an-image", "question__hide": false, - "total_acs": 99901, - "total_submitted": 125740, - "total_column_articles": 1118, + "total_acs": 100127, + "total_submitted": 126041, + "total_column_articles": 1119, "frontend_question_id": "832", "is_new_question": false }, @@ -46611,9 +47262,9 @@ "question__title": "Design Circular Queue", "question__title_slug": "design-circular-queue", "question__hide": false, - "total_acs": 128152, - "total_submitted": 270981, - "total_column_articles": 976, + "total_acs": 128622, + "total_submitted": 272051, + "total_column_articles": 983, "frontend_question_id": "622", "is_new_question": false }, @@ -46632,9 +47283,9 @@ "question__title": "Design Circular Deque", "question__title_slug": "design-circular-deque", "question__hide": false, - "total_acs": 58374, - "total_submitted": 102086, - "total_column_articles": 640, + "total_acs": 58682, + "total_submitted": 102677, + "total_column_articles": 645, "frontend_question_id": "641", "is_new_question": false }, @@ -46653,9 +47304,9 @@ "question__title": "Masking Personal Information", "question__title_slug": "masking-personal-information", "question__hide": false, - "total_acs": 27488, - "total_submitted": 51112, - "total_column_articles": 275, + "total_acs": 27548, + "total_submitted": 51227, + "total_column_articles": 276, "frontend_question_id": "831", "is_new_question": false }, @@ -46674,9 +47325,9 @@ "question__title": "Positions of Large Groups", "question__title_slug": "positions-of-large-groups", "question__hide": false, - "total_acs": 59627, - "total_submitted": 110111, - "total_column_articles": 696, + "total_acs": 59767, + "total_submitted": 110381, + "total_column_articles": 698, "frontend_question_id": "830", "is_new_question": false }, @@ -46695,8 +47346,8 @@ "question__title": "Consecutive Numbers Sum", "question__title_slug": "consecutive-numbers-sum", "question__hide": false, - "total_acs": 31427, - "total_submitted": 67839, + "total_acs": 31501, + "total_submitted": 67985, "total_column_articles": 377, "frontend_question_id": "829", "is_new_question": false @@ -46716,8 +47367,8 @@ "question__title": "Count Unique Characters of All Substrings of a Given String", "question__title_slug": "count-unique-characters-of-all-substrings-of-a-given-string", "question__hide": false, - "total_acs": 27851, - "total_submitted": 42466, + "total_acs": 27901, + "total_submitted": 42548, "total_column_articles": 309, "frontend_question_id": "828", "is_new_question": false @@ -46737,9 +47388,9 @@ "question__title": "Making A Large Island", "question__title_slug": "making-a-large-island", "question__hide": false, - "total_acs": 38664, - "total_submitted": 81775, - "total_column_articles": 529, + "total_acs": 38810, + "total_submitted": 82251, + "total_column_articles": 530, "frontend_question_id": "827", "is_new_question": false }, @@ -46758,8 +47409,8 @@ "question__title": "Most Profit Assigning Work", "question__title_slug": "most-profit-assigning-work", "question__hide": false, - "total_acs": 16018, - "total_submitted": 37787, + "total_acs": 16104, + "total_submitted": 37954, "total_column_articles": 226, "frontend_question_id": "826", "is_new_question": false @@ -46779,9 +47430,9 @@ "question__title": "Friends Of Appropriate Ages", "question__title_slug": "friends-of-appropriate-ages", "question__hide": false, - "total_acs": 36716, - "total_submitted": 80838, - "total_column_articles": 359, + "total_acs": 36770, + "total_submitted": 80957, + "total_column_articles": 360, "frontend_question_id": "825", "is_new_question": false }, @@ -46800,8 +47451,8 @@ "question__title": "Goat Latin", "question__title_slug": "goat-latin", "question__hide": false, - "total_acs": 54252, - "total_submitted": 83365, + "total_acs": 54361, + "total_submitted": 83533, "total_column_articles": 742, "frontend_question_id": "824", "is_new_question": false @@ -46821,9 +47472,9 @@ "question__title": "Insert into a Sorted Circular Linked List", "question__title_slug": "insert-into-a-sorted-circular-linked-list", "question__hide": false, - "total_acs": 4918, - "total_submitted": 12916, - "total_column_articles": 94, + "total_acs": 4987, + "total_submitted": 13129, + "total_column_articles": 95, "frontend_question_id": "708", "is_new_question": false }, @@ -46842,9 +47493,9 @@ "question__title": "Binary Trees With Factors", "question__title_slug": "binary-trees-with-factors", "question__hide": false, - "total_acs": 5635, - "total_submitted": 12983, - "total_column_articles": 81, + "total_acs": 5679, + "total_submitted": 13076, + "total_column_articles": 82, "frontend_question_id": "823", "is_new_question": false }, @@ -46863,9 +47514,9 @@ "question__title": "Card Flipping Game", "question__title_slug": "card-flipping-game", "question__hide": false, - "total_acs": 4807, - "total_submitted": 9338, - "total_column_articles": 67, + "total_acs": 4842, + "total_submitted": 9402, + "total_column_articles": 68, "frontend_question_id": "822", "is_new_question": false }, @@ -46884,9 +47535,9 @@ "question__title": "Shortest Distance to a Character", "question__title_slug": "shortest-distance-to-a-character", "question__hide": false, - "total_acs": 73583, - "total_submitted": 100973, - "total_column_articles": 991, + "total_acs": 73734, + "total_submitted": 101186, + "total_column_articles": 993, "frontend_question_id": "821", "is_new_question": false }, @@ -46905,9 +47556,9 @@ "question__title": "Short Encoding of Words", "question__title_slug": "short-encoding-of-words", "question__hide": false, - "total_acs": 69164, - "total_submitted": 133015, - "total_column_articles": 735, + "total_acs": 69425, + "total_submitted": 133424, + "total_column_articles": 736, "frontend_question_id": "820", "is_new_question": false }, @@ -46926,9 +47577,9 @@ "question__title": "Design Linked List", "question__title_slug": "design-linked-list", "question__hide": false, - "total_acs": 225691, - "total_submitted": 651010, - "total_column_articles": 1374, + "total_acs": 228525, + "total_submitted": 658758, + "total_column_articles": 1381, "frontend_question_id": "707", "is_new_question": false }, @@ -46947,9 +47598,9 @@ "question__title": "Most Common Word", "question__title_slug": "most-common-word", "question__hide": false, - "total_acs": 59413, - "total_submitted": 130080, - "total_column_articles": 713, + "total_acs": 59599, + "total_submitted": 130481, + "total_column_articles": 716, "frontend_question_id": "819", "is_new_question": false }, @@ -46968,8 +47619,8 @@ "question__title": "Race Car", "question__title_slug": "race-car", "question__hide": false, - "total_acs": 5879, - "total_submitted": 13114, + "total_acs": 5887, + "total_submitted": 13132, "total_column_articles": 68, "frontend_question_id": "818", "is_new_question": false @@ -46989,9 +47640,9 @@ "question__title": "Linked List Components", "question__title_slug": "linked-list-components", "question__hide": false, - "total_acs": 48840, - "total_submitted": 79480, - "total_column_articles": 582, + "total_acs": 48914, + "total_submitted": 79643, + "total_column_articles": 584, "frontend_question_id": "817", "is_new_question": false }, @@ -47010,8 +47661,8 @@ "question__title": "Ambiguous Coordinates", "question__title_slug": "ambiguous-coordinates", "question__hide": false, - "total_acs": 27312, - "total_submitted": 43629, + "total_acs": 27342, + "total_submitted": 43676, "total_column_articles": 391, "frontend_question_id": "816", "is_new_question": false @@ -47031,9 +47682,9 @@ "question__title": "Bus Routes", "question__title_slug": "bus-routes", "question__hide": false, - "total_acs": 37022, - "total_submitted": 83391, - "total_column_articles": 406, + "total_acs": 37173, + "total_submitted": 83674, + "total_column_articles": 408, "frontend_question_id": "815", "is_new_question": false }, @@ -47052,9 +47703,9 @@ "question__title": "Binary Tree Pruning", "question__title_slug": "binary-tree-pruning", "question__hide": false, - "total_acs": 58595, - "total_submitted": 80735, - "total_column_articles": 788, + "total_acs": 58727, + "total_submitted": 80904, + "total_column_articles": 791, "frontend_question_id": "814", "is_new_question": false }, @@ -47073,9 +47724,9 @@ "question__title": "Largest Sum of Averages", "question__title_slug": "largest-sum-of-averages", "question__hide": false, - "total_acs": 27611, - "total_submitted": 44689, - "total_column_articles": 265, + "total_acs": 27694, + "total_submitted": 44850, + "total_column_articles": 267, "frontend_question_id": "813", "is_new_question": false }, @@ -47094,9 +47745,9 @@ "question__title": "Largest Triangle Area", "question__title_slug": "largest-triangle-area", "question__hide": false, - "total_acs": 36233, - "total_submitted": 53073, - "total_column_articles": 322, + "total_acs": 36327, + "total_submitted": 53216, + "total_column_articles": 323, "frontend_question_id": "812", "is_new_question": false }, @@ -47115,9 +47766,9 @@ "question__title": "Subdomain Visit Count", "question__title_slug": "subdomain-visit-count", "question__hide": false, - "total_acs": 43876, - "total_submitted": 57268, - "total_column_articles": 562, + "total_acs": 43969, + "total_submitted": 57385, + "total_column_articles": 564, "frontend_question_id": "811", "is_new_question": false }, @@ -47136,8 +47787,8 @@ "question__title": "Chalkboard XOR Game", "question__title_slug": "chalkboard-xor-game", "question__hide": false, - "total_acs": 18880, - "total_submitted": 26030, + "total_acs": 18909, + "total_submitted": 26075, "total_column_articles": 154, "frontend_question_id": "810", "is_new_question": false @@ -47157,9 +47808,9 @@ "question__title": "Expressive Words", "question__title_slug": "expressive-words", "question__hide": false, - "total_acs": 25400, - "total_submitted": 51895, - "total_column_articles": 371, + "total_acs": 25450, + "total_submitted": 52013, + "total_column_articles": 370, "frontend_question_id": "809", "is_new_question": false }, @@ -47178,8 +47829,8 @@ "question__title": "Soup Servings", "question__title_slug": "soup-servings", "question__hide": false, - "total_acs": 22078, - "total_submitted": 37544, + "total_acs": 22114, + "total_submitted": 37622, "total_column_articles": 166, "frontend_question_id": "808", "is_new_question": false @@ -47199,9 +47850,9 @@ "question__title": "Max Increase to Keep City Skyline", "question__title_slug": "max-increase-to-keep-city-skyline", "question__hide": false, - "total_acs": 53791, - "total_submitted": 61029, - "total_column_articles": 756, + "total_acs": 53934, + "total_submitted": 61209, + "total_column_articles": 757, "frontend_question_id": "807", "is_new_question": false }, @@ -47220,9 +47871,9 @@ "question__title": "Number of Lines To Write String", "question__title_slug": "number-of-lines-to-write-string", "question__hide": false, - "total_acs": 52120, - "total_submitted": 76117, - "total_column_articles": 635, + "total_acs": 52243, + "total_submitted": 76299, + "total_column_articles": 636, "frontend_question_id": "806", "is_new_question": false }, @@ -47241,8 +47892,8 @@ "question__title": "Split Array With Same Average", "question__title_slug": "split-array-with-same-average", "question__hide": false, - "total_acs": 21684, - "total_submitted": 50377, + "total_acs": 21738, + "total_submitted": 50517, "total_column_articles": 190, "frontend_question_id": "805", "is_new_question": false @@ -47262,9 +47913,9 @@ "question__title": "Unique Morse Code Words", "question__title_slug": "unique-morse-code-words", "question__hide": false, - "total_acs": 78494, - "total_submitted": 95516, - "total_column_articles": 830, + "total_acs": 78694, + "total_submitted": 95739, + "total_column_articles": 835, "frontend_question_id": "804", "is_new_question": false }, @@ -47283,8 +47934,8 @@ "question__title": "Bricks Falling When Hit", "question__title_slug": "bricks-falling-when-hit", "question__hide": false, - "total_acs": 14506, - "total_submitted": 30816, + "total_acs": 14531, + "total_submitted": 30883, "total_column_articles": 152, "frontend_question_id": "803", "is_new_question": false @@ -47304,9 +47955,9 @@ "question__title": "Find Eventual Safe States", "question__title_slug": "find-eventual-safe-states", "question__hide": false, - "total_acs": 43865, - "total_submitted": 74081, - "total_column_articles": 459, + "total_acs": 44192, + "total_submitted": 74612, + "total_column_articles": 461, "frontend_question_id": "802", "is_new_question": false }, @@ -47325,9 +47976,9 @@ "question__title": "Minimum Swaps To Make Sequences Increasing", "question__title_slug": "minimum-swaps-to-make-sequences-increasing", "question__hide": false, - "total_acs": 30847, - "total_submitted": 60888, - "total_column_articles": 314, + "total_acs": 30886, + "total_submitted": 60952, + "total_column_articles": 315, "frontend_question_id": "801", "is_new_question": false }, @@ -47346,8 +47997,8 @@ "question__title": "Similar RGB Color", "question__title_slug": "similar-rgb-color", "question__hide": false, - "total_acs": 2365, - "total_submitted": 3362, + "total_acs": 2382, + "total_submitted": 3383, "total_column_articles": 56, "frontend_question_id": "800", "is_new_question": false @@ -47367,9 +48018,9 @@ "question__title": "Design HashMap", "question__title_slug": "design-hashmap", "question__hide": false, - "total_acs": 96541, - "total_submitted": 151752, - "total_column_articles": 593, + "total_acs": 96893, + "total_submitted": 152268, + "total_column_articles": 594, "frontend_question_id": "706", "is_new_question": false }, @@ -47388,9 +48039,9 @@ "question__title": "Design HashSet", "question__title_slug": "design-hashset", "question__hide": false, - "total_acs": 102480, - "total_submitted": 161762, - "total_column_articles": 612, + "total_acs": 102986, + "total_submitted": 162545, + "total_column_articles": 613, "frontend_question_id": "705", "is_new_question": false }, @@ -47409,9 +48060,9 @@ "question__title": "Champagne Tower", "question__title_slug": "champagne-tower", "question__hide": false, - "total_acs": 28510, - "total_submitted": 53710, - "total_column_articles": 308, + "total_acs": 28581, + "total_submitted": 53847, + "total_column_articles": 309, "frontend_question_id": "799", "is_new_question": false }, @@ -47430,8 +48081,8 @@ "question__title": "Smallest Rotation with Highest Score", "question__title_slug": "smallest-rotation-with-highest-score", "question__hide": false, - "total_acs": 21116, - "total_submitted": 34260, + "total_acs": 21132, + "total_submitted": 34287, "total_column_articles": 225, "frontend_question_id": "798", "is_new_question": false @@ -47451,9 +48102,9 @@ "question__title": "All Paths From Source to Target", "question__title_slug": "all-paths-from-source-to-target", "question__hide": false, - "total_acs": 100828, - "total_submitted": 127734, - "total_column_articles": 1841, + "total_acs": 101594, + "total_submitted": 128739, + "total_column_articles": 1844, "frontend_question_id": "797", "is_new_question": false }, @@ -47472,9 +48123,9 @@ "question__title": "Rotate String", "question__title_slug": "rotate-string", "question__hide": false, - "total_acs": 78967, - "total_submitted": 124894, - "total_column_articles": 888, + "total_acs": 79234, + "total_submitted": 125291, + "total_column_articles": 891, "frontend_question_id": "796", "is_new_question": false }, @@ -47493,9 +48144,9 @@ "question__title": "Number of Subarrays with Bounded Maximum", "question__title_slug": "number-of-subarrays-with-bounded-maximum", "question__hide": false, - "total_acs": 35253, - "total_submitted": 60992, - "total_column_articles": 345, + "total_acs": 35434, + "total_submitted": 61353, + "total_column_articles": 350, "frontend_question_id": "795", "is_new_question": false }, @@ -47514,9 +48165,9 @@ "question__title": "Valid Tic-Tac-Toe State", "question__title_slug": "valid-tic-tac-toe-state", "question__hide": false, - "total_acs": 31018, - "total_submitted": 80338, - "total_column_articles": 496, + "total_acs": 31067, + "total_submitted": 80457, + "total_column_articles": 497, "frontend_question_id": "794", "is_new_question": false }, @@ -47535,8 +48186,8 @@ "question__title": "Preimage Size of Factorial Zeroes Function", "question__title_slug": "preimage-size-of-factorial-zeroes-function", "question__hide": false, - "total_acs": 27079, - "total_submitted": 55602, + "total_acs": 27185, + "total_submitted": 55817, "total_column_articles": 286, "frontend_question_id": "793", "is_new_question": false @@ -47556,8 +48207,8 @@ "question__title": "Number of Matching Subsequences", "question__title_slug": "number-of-matching-subsequences", "question__hide": false, - "total_acs": 39989, - "total_submitted": 78390, + "total_acs": 40122, + "total_submitted": 78693, "total_column_articles": 446, "frontend_question_id": "792", "is_new_question": false @@ -47577,9 +48228,9 @@ "question__title": "Custom Sort String", "question__title_slug": "custom-sort-string", "question__hide": false, - "total_acs": 41000, - "total_submitted": 55242, - "total_column_articles": 594, + "total_acs": 41128, + "total_submitted": 55438, + "total_column_articles": 596, "frontend_question_id": "791", "is_new_question": false }, @@ -47598,9 +48249,9 @@ "question__title": "Domino and Tromino Tiling", "question__title_slug": "domino-and-tromino-tiling", "question__hide": false, - "total_acs": 25235, - "total_submitted": 44723, - "total_column_articles": 279, + "total_acs": 25451, + "total_submitted": 45144, + "total_column_articles": 280, "frontend_question_id": "790", "is_new_question": false }, @@ -47619,9 +48270,9 @@ "question__title": "Escape The Ghosts", "question__title_slug": "escape-the-ghosts", "question__hide": false, - "total_acs": 23144, - "total_submitted": 33792, - "total_column_articles": 323, + "total_acs": 23183, + "total_submitted": 33851, + "total_column_articles": 324, "frontend_question_id": "789", "is_new_question": false }, @@ -47640,9 +48291,9 @@ "question__title": "Rotated Digits", "question__title_slug": "rotated-digits", "question__hide": false, - "total_acs": 45195, - "total_submitted": 68253, - "total_column_articles": 516, + "total_acs": 45289, + "total_submitted": 68389, + "total_column_articles": 517, "frontend_question_id": "788", "is_new_question": false }, @@ -47661,9 +48312,9 @@ "question__title": "Cheapest Flights Within K Stops", "question__title_slug": "cheapest-flights-within-k-stops", "question__hide": false, - "total_acs": 65546, - "total_submitted": 165683, - "total_column_articles": 655, + "total_acs": 65968, + "total_submitted": 166584, + "total_column_articles": 661, "frontend_question_id": "787", "is_new_question": false }, @@ -47682,9 +48333,9 @@ "question__title": "K-th Smallest Prime Fraction", "question__title_slug": "k-th-smallest-prime-fraction", "question__hide": false, - "total_acs": 31881, - "total_submitted": 47137, - "total_column_articles": 313, + "total_acs": 31987, + "total_submitted": 47296, + "total_column_articles": 315, "frontend_question_id": "786", "is_new_question": false }, @@ -47703,9 +48354,9 @@ "question__title": "Is Graph Bipartite?", "question__title_slug": "is-graph-bipartite", "question__hide": false, - "total_acs": 76402, - "total_submitted": 140211, - "total_column_articles": 1458, + "total_acs": 77038, + "total_submitted": 141251, + "total_column_articles": 1463, "frontend_question_id": "785", "is_new_question": false }, @@ -47724,8 +48375,8 @@ "question__title": "Letter Case Permutation", "question__title_slug": "letter-case-permutation", "question__hide": false, - "total_acs": 105653, - "total_submitted": 145602, + "total_acs": 106006, + "total_submitted": 146091, "total_column_articles": 1173, "frontend_question_id": "784", "is_new_question": false @@ -47745,8 +48396,8 @@ "question__title": "Minimum Distance Between BST Nodes", "question__title_slug": "minimum-distance-between-bst-nodes", "question__hide": false, - "total_acs": 84957, - "total_submitted": 141364, + "total_acs": 85142, + "total_submitted": 141666, "total_column_articles": 826, "frontend_question_id": "783", "is_new_question": false @@ -47766,8 +48417,8 @@ "question__title": "Transform to Chessboard", "question__title_slug": "transform-to-chessboard", "question__hide": false, - "total_acs": 14161, - "total_submitted": 23732, + "total_acs": 14169, + "total_submitted": 23746, "total_column_articles": 149, "frontend_question_id": "782", "is_new_question": false @@ -47787,9 +48438,9 @@ "question__title": "Rabbits in Forest", "question__title_slug": "rabbits-in-forest", "question__hide": false, - "total_acs": 55040, - "total_submitted": 93419, - "total_column_articles": 788, + "total_acs": 55136, + "total_submitted": 93620, + "total_column_articles": 789, "frontend_question_id": "781", "is_new_question": false }, @@ -47808,8 +48459,8 @@ "question__title": "Reaching Points", "question__title_slug": "reaching-points", "question__hide": false, - "total_acs": 26380, - "total_submitted": 70020, + "total_acs": 26400, + "total_submitted": 70079, "total_column_articles": 264, "frontend_question_id": "780", "is_new_question": false @@ -47829,9 +48480,9 @@ "question__title": "K-th Symbol in Grammar", "question__title_slug": "k-th-symbol-in-grammar", "question__hide": false, - "total_acs": 51154, - "total_submitted": 102818, - "total_column_articles": 749, + "total_acs": 51229, + "total_submitted": 102955, + "total_column_articles": 750, "frontend_question_id": "779", "is_new_question": false }, @@ -47850,9 +48501,9 @@ "question__title": "Swim in Rising Water", "question__title_slug": "swim-in-rising-water", "question__hide": false, - "total_acs": 32384, - "total_submitted": 54873, - "total_column_articles": 432, + "total_acs": 32490, + "total_submitted": 55036, + "total_column_articles": 433, "frontend_question_id": "778", "is_new_question": false }, @@ -47871,8 +48522,8 @@ "question__title": "Swap Adjacent in LR String", "question__title_slug": "swap-adjacent-in-lr-string", "question__hide": false, - "total_acs": 28108, - "total_submitted": 73188, + "total_acs": 28145, + "total_submitted": 73274, "total_column_articles": 305, "frontend_question_id": "777", "is_new_question": false @@ -47892,9 +48543,9 @@ "question__title": "Binary Search", "question__title_slug": "binary-search", "question__hide": false, - "total_acs": 975324, - "total_submitted": 1792639, - "total_column_articles": 4847, + "total_acs": 982996, + "total_submitted": 1806292, + "total_column_articles": 4874, "frontend_question_id": "704", "is_new_question": false }, @@ -47913,8 +48564,8 @@ "question__title": "Split BST", "question__title_slug": "split-bst", "question__hide": false, - "total_acs": 2654, - "total_submitted": 4451, + "total_acs": 2665, + "total_submitted": 4463, "total_column_articles": 53, "frontend_question_id": "776", "is_new_question": false @@ -47934,9 +48585,9 @@ "question__title": "Global and Local Inversions", "question__title_slug": "global-and-local-inversions", "question__hide": false, - "total_acs": 32643, - "total_submitted": 66105, - "total_column_articles": 417, + "total_acs": 32692, + "total_submitted": 66194, + "total_column_articles": 418, "frontend_question_id": "775", "is_new_question": false }, @@ -47955,9 +48606,9 @@ "question__title": "Kth Largest Element in a Stream", "question__title_slug": "kth-largest-element-in-a-stream", "question__hide": false, - "total_acs": 87793, - "total_submitted": 167157, - "total_column_articles": 794, + "total_acs": 88167, + "total_submitted": 167899, + "total_column_articles": 796, "frontend_question_id": "703", "is_new_question": false }, @@ -47976,8 +48627,8 @@ "question__title": "Minimize Max Distance to Gas Station", "question__title_slug": "minimize-max-distance-to-gas-station", "question__hide": false, - "total_acs": 2254, - "total_submitted": 3541, + "total_acs": 2275, + "total_submitted": 3566, "total_column_articles": 39, "frontend_question_id": "774", "is_new_question": false @@ -47997,9 +48648,9 @@ "question__title": "Sliding Puzzle", "question__title_slug": "sliding-puzzle", "question__hide": false, - "total_acs": 34371, - "total_submitted": 48971, - "total_column_articles": 499, + "total_acs": 34463, + "total_submitted": 49108, + "total_column_articles": 500, "frontend_question_id": "773", "is_new_question": false }, @@ -48018,8 +48669,8 @@ "question__title": "Search in a Sorted Array of Unknown Size", "question__title_slug": "search-in-a-sorted-array-of-unknown-size", "question__hide": false, - "total_acs": 7881, - "total_submitted": 10547, + "total_acs": 7916, + "total_submitted": 10601, "total_column_articles": 121, "frontend_question_id": "702", "is_new_question": false @@ -48039,9 +48690,9 @@ "question__title": "Basic Calculator III", "question__title_slug": "basic-calculator-iii", "question__hide": false, - "total_acs": 12627, - "total_submitted": 23730, - "total_column_articles": 198, + "total_acs": 12728, + "total_submitted": 23940, + "total_column_articles": 199, "frontend_question_id": "772", "is_new_question": false }, @@ -48060,9 +48711,9 @@ "question__title": "Insert into a Binary Search Tree", "question__title_slug": "insert-into-a-binary-search-tree", "question__hide": false, - "total_acs": 187978, - "total_submitted": 265077, - "total_column_articles": 1326, + "total_acs": 189756, + "total_submitted": 267549, + "total_column_articles": 1340, "frontend_question_id": "701", "is_new_question": false }, @@ -48081,9 +48732,9 @@ "question__title": "Search in a Binary Search Tree", "question__title_slug": "search-in-a-binary-search-tree", "question__hide": false, - "total_acs": 249327, - "total_submitted": 321217, - "total_column_articles": 1807, + "total_acs": 251758, + "total_submitted": 324363, + "total_column_articles": 1818, "frontend_question_id": "700", "is_new_question": false }, @@ -48102,9 +48753,9 @@ "question__title": "Jewels and Stones", "question__title_slug": "jewels-and-stones", "question__hide": false, - "total_acs": 181300, - "total_submitted": 212967, - "total_column_articles": 1423, + "total_acs": 181711, + "total_submitted": 213487, + "total_column_articles": 1425, "frontend_question_id": "771", "is_new_question": false }, @@ -48123,8 +48774,8 @@ "question__title": "Basic Calculator IV", "question__title_slug": "basic-calculator-iv", "question__hide": false, - "total_acs": 1870, - "total_submitted": 3336, + "total_acs": 1876, + "total_submitted": 3345, "total_column_articles": 40, "frontend_question_id": "770", "is_new_question": false @@ -48144,9 +48795,9 @@ "question__title": "Max Chunks To Make Sorted", "question__title_slug": "max-chunks-to-make-sorted", "question__hide": false, - "total_acs": 53958, - "total_submitted": 91111, - "total_column_articles": 748, + "total_acs": 54099, + "total_submitted": 91340, + "total_column_articles": 749, "frontend_question_id": "769", "is_new_question": false }, @@ -48165,9 +48816,9 @@ "question__title": "Max Chunks To Make Sorted II", "question__title_slug": "max-chunks-to-make-sorted-ii", "question__hide": false, - "total_acs": 31777, - "total_submitted": 54088, - "total_column_articles": 379, + "total_acs": 31857, + "total_submitted": 54230, + "total_column_articles": 381, "frontend_question_id": "768", "is_new_question": false }, @@ -48186,9 +48837,9 @@ "question__title": "Reorganize String", "question__title_slug": "reorganize-string", "question__hide": false, - "total_acs": 51620, - "total_submitted": 106670, - "total_column_articles": 613, + "total_acs": 51899, + "total_submitted": 107164, + "total_column_articles": 617, "frontend_question_id": "767", "is_new_question": false }, @@ -48207,9 +48858,9 @@ "question__title": "Toeplitz Matrix", "question__title_slug": "toeplitz-matrix", "question__hide": false, - "total_acs": 67004, - "total_submitted": 95381, - "total_column_articles": 763, + "total_acs": 67202, + "total_submitted": 95674, + "total_column_articles": 766, "frontend_question_id": "766", "is_new_question": false }, @@ -48228,9 +48879,9 @@ "question__title": "N-ary Tree Postorder Traversal", "question__title_slug": "n-ary-tree-postorder-traversal", "question__hide": false, - "total_acs": 127440, - "total_submitted": 162135, - "total_column_articles": 912, + "total_acs": 128079, + "total_submitted": 162903, + "total_column_articles": 913, "frontend_question_id": "590", "is_new_question": false }, @@ -48249,9 +48900,9 @@ "question__title": "N-ary Tree Preorder Traversal", "question__title_slug": "n-ary-tree-preorder-traversal", "question__hide": false, - "total_acs": 184696, - "total_submitted": 241273, - "total_column_articles": 1130, + "total_acs": 185521, + "total_submitted": 242368, + "total_column_articles": 1132, "frontend_question_id": "589", "is_new_question": false }, @@ -48270,9 +48921,9 @@ "question__title": "Maximum Depth of N-ary Tree", "question__title_slug": "maximum-depth-of-n-ary-tree", "question__hide": false, - "total_acs": 142120, - "total_submitted": 189545, - "total_column_articles": 1057, + "total_acs": 143205, + "total_submitted": 190978, + "total_column_articles": 1061, "frontend_question_id": "559", "is_new_question": false }, @@ -48291,8 +48942,8 @@ "question__title": "Logical OR of Two Binary Grids Represented as Quad-Trees", "question__title_slug": "logical-or-of-two-binary-grids-represented-as-quad-trees", "question__hide": false, - "total_acs": 18039, - "total_submitted": 28697, + "total_acs": 18066, + "total_submitted": 28748, "total_column_articles": 164, "frontend_question_id": "558", "is_new_question": false @@ -48312,8 +48963,8 @@ "question__title": "Construct Quad Tree", "question__title_slug": "construct-quad-tree", "question__hide": false, - "total_acs": 25278, - "total_submitted": 35515, + "total_acs": 25402, + "total_submitted": 35692, "total_column_articles": 334, "frontend_question_id": "427", "is_new_question": false @@ -48333,8 +48984,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": 1927, - "total_submitted": 2577, + "total_acs": 1956, + "total_submitted": 2612, "total_column_articles": 46, "frontend_question_id": "431", "is_new_question": false @@ -48354,8 +49005,8 @@ "question__title": "Couples Holding Hands", "question__title_slug": "couples-holding-hands", "question__hide": false, - "total_acs": 37522, - "total_submitted": 56911, + "total_acs": 37620, + "total_submitted": 57067, "total_column_articles": 546, "frontend_question_id": "765", "is_new_question": false @@ -48375,9 +49026,9 @@ "question__title": "Largest Plus Sign", "question__title_slug": "largest-plus-sign", "question__hide": false, - "total_acs": 29081, - "total_submitted": 53602, - "total_column_articles": 344, + "total_acs": 29116, + "total_submitted": 53682, + "total_column_articles": 345, "frontend_question_id": "764", "is_new_question": false }, @@ -48396,9 +49047,9 @@ "question__title": "Partition Labels", "question__title_slug": "partition-labels", "question__hide": false, - "total_acs": 162086, - "total_submitted": 211233, - "total_column_articles": 1565, + "total_acs": 163958, + "total_submitted": 213686, + "total_column_articles": 1578, "frontend_question_id": "763", "is_new_question": false }, @@ -48417,8 +49068,8 @@ "question__title": "Prime Number of Set Bits in Binary Representation", "question__title_slug": "prime-number-of-set-bits-in-binary-representation", "question__hide": false, - "total_acs": 55963, - "total_submitted": 74222, + "total_acs": 56096, + "total_submitted": 74423, "total_column_articles": 497, "frontend_question_id": "762", "is_new_question": false @@ -48438,9 +49089,9 @@ "question__title": "Flatten a Multilevel Doubly Linked List", "question__title_slug": "flatten-a-multilevel-doubly-linked-list", "question__hide": false, - "total_acs": 61496, - "total_submitted": 103422, - "total_column_articles": 882, + "total_acs": 61736, + "total_submitted": 103787, + "total_column_articles": 885, "frontend_question_id": "430", "is_new_question": false }, @@ -48459,8 +49110,8 @@ "question__title": "Serialize and Deserialize N-ary Tree", "question__title_slug": "serialize-and-deserialize-n-ary-tree", "question__hide": false, - "total_acs": 5227, - "total_submitted": 7584, + "total_acs": 5241, + "total_submitted": 7613, "total_column_articles": 83, "frontend_question_id": "428", "is_new_question": false @@ -48480,9 +49131,9 @@ "question__title": "N-ary Tree Level Order Traversal", "question__title_slug": "n-ary-tree-level-order-traversal", "question__hide": false, - "total_acs": 151867, - "total_submitted": 208596, - "total_column_articles": 1153, + "total_acs": 152911, + "total_submitted": 209948, + "total_column_articles": 1157, "frontend_question_id": "429", "is_new_question": false }, @@ -48501,9 +49152,9 @@ "question__title": "Special Binary String", "question__title_slug": "special-binary-string", "question__hide": false, - "total_acs": 16852, - "total_submitted": 22357, - "total_column_articles": 149, + "total_acs": 16889, + "total_submitted": 22406, + "total_column_articles": 150, "frontend_question_id": "761", "is_new_question": false }, @@ -48522,8 +49173,8 @@ "question__title": "Find Anagram Mappings", "question__title_slug": "find-anagram-mappings", "question__hide": false, - "total_acs": 5622, - "total_submitted": 6670, + "total_acs": 5730, + "total_submitted": 6793, "total_column_articles": 128, "frontend_question_id": "760", "is_new_question": false @@ -48543,8 +49194,8 @@ "question__title": "Employee Free Time", "question__title_slug": "employee-free-time", "question__hide": false, - "total_acs": 4214, - "total_submitted": 6017, + "total_acs": 4238, + "total_submitted": 6048, "total_column_articles": 77, "frontend_question_id": "759", "is_new_question": false @@ -48564,8 +49215,8 @@ "question__title": "Bold Words in String", "question__title_slug": "bold-words-in-string", "question__hide": false, - "total_acs": 4358, - "total_submitted": 9010, + "total_acs": 4369, + "total_submitted": 9025, "total_column_articles": 85, "frontend_question_id": "758", "is_new_question": false @@ -48585,8 +49236,8 @@ "question__title": "Set Intersection Size At Least Two", "question__title_slug": "set-intersection-size-at-least-two", "question__hide": false, - "total_acs": 18283, - "total_submitted": 32608, + "total_acs": 18305, + "total_submitted": 32661, "total_column_articles": 196, "frontend_question_id": "757", "is_new_question": false @@ -48606,9 +49257,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": 13369, - "total_submitted": 19585, - "total_column_articles": 189, + "total_acs": 13406, + "total_submitted": 19656, + "total_column_articles": 190, "frontend_question_id": "426", "is_new_question": false }, @@ -48627,9 +49278,9 @@ "question__title": "Pyramid Transition Matrix", "question__title_slug": "pyramid-transition-matrix", "question__hide": false, - "total_acs": 6682, - "total_submitted": 12767, - "total_column_articles": 102, + "total_acs": 6726, + "total_submitted": 12857, + "total_column_articles": 103, "frontend_question_id": "756", "is_new_question": false }, @@ -48648,8 +49299,8 @@ "question__title": "Pour Water", "question__title_slug": "pour-water", "question__hide": false, - "total_acs": 1961, - "total_submitted": 4050, + "total_acs": 1972, + "total_submitted": 4076, "total_column_articles": 43, "frontend_question_id": "755", "is_new_question": false @@ -48669,8 +49320,8 @@ "question__title": "Reach a Number", "question__title_slug": "reach-a-number", "question__hide": false, - "total_acs": 36553, - "total_submitted": 71089, + "total_acs": 36596, + "total_submitted": 71173, "total_column_articles": 404, "frontend_question_id": "754", "is_new_question": false @@ -48690,8 +49341,8 @@ "question__title": "Cracking the Safe", "question__title_slug": "cracking-the-safe", "question__hide": false, - "total_acs": 16481, - "total_submitted": 21994, + "total_acs": 16508, + "total_submitted": 22031, "total_column_articles": 152, "frontend_question_id": "753", "is_new_question": false @@ -48711,9 +49362,9 @@ "question__title": "Open the Lock", "question__title_slug": "open-the-lock", "question__hide": false, - "total_acs": 117516, - "total_submitted": 222757, - "total_column_articles": 1208, + "total_acs": 118101, + "total_submitted": 223913, + "total_column_articles": 1210, "frontend_question_id": "752", "is_new_question": false }, @@ -48732,8 +49383,8 @@ "question__title": "IP to CIDR", "question__title_slug": "ip-to-cidr", "question__hide": false, - "total_acs": 1909, - "total_submitted": 3955, + "total_acs": 1916, + "total_submitted": 3968, "total_column_articles": 38, "frontend_question_id": "751", "is_new_question": false @@ -48753,8 +49404,8 @@ "question__title": "Number Of Corner Rectangles", "question__title_slug": "number-of-corner-rectangles", "question__hide": false, - "total_acs": 3309, - "total_submitted": 4535, + "total_acs": 3321, + "total_submitted": 4547, "total_column_articles": 60, "frontend_question_id": "750", "is_new_question": false @@ -48774,8 +49425,8 @@ "question__title": "Contain Virus", "question__title_slug": "contain-virus", "question__hide": false, - "total_acs": 13630, - "total_submitted": 19722, + "total_acs": 13639, + "total_submitted": 19736, "total_column_articles": 140, "frontend_question_id": "749", "is_new_question": false @@ -48795,8 +49446,8 @@ "question__title": "Shortest Completing Word", "question__title_slug": "shortest-completing-word", "question__hide": false, - "total_acs": 46476, - "total_submitted": 69574, + "total_acs": 46633, + "total_submitted": 69847, "total_column_articles": 569, "frontend_question_id": "748", "is_new_question": false @@ -48816,9 +49467,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": 92230, - "total_submitted": 199493, - "total_column_articles": 932, + "total_acs": 92459, + "total_submitted": 199919, + "total_column_articles": 933, "frontend_question_id": "747", "is_new_question": false }, @@ -48837,9 +49488,9 @@ "question__title": "Min Cost Climbing Stairs", "question__title_slug": "min-cost-climbing-stairs", "question__hide": false, - "total_acs": 306999, - "total_submitted": 475701, - "total_column_articles": 2344, + "total_acs": 309893, + "total_submitted": 479777, + "total_column_articles": 2360, "frontend_question_id": "746", "is_new_question": false }, @@ -48858,8 +49509,8 @@ "question__title": "Prefix and Suffix Search", "question__title_slug": "prefix-and-suffix-search", "question__hide": false, - "total_acs": 24771, - "total_submitted": 56351, + "total_acs": 24791, + "total_submitted": 56426, "total_column_articles": 255, "frontend_question_id": "745", "is_new_question": false @@ -48879,9 +49530,9 @@ "question__title": "Find Smallest Letter Greater Than Target", "question__title_slug": "find-smallest-letter-greater-than-target", "question__hide": false, - "total_acs": 111624, - "total_submitted": 231072, - "total_column_articles": 976, + "total_acs": 112165, + "total_submitted": 232126, + "total_column_articles": 979, "frontend_question_id": "744", "is_new_question": false }, @@ -48900,9 +49551,9 @@ "question__title": "Network Delay Time", "question__title_slug": "network-delay-time", "question__hide": false, - "total_acs": 104672, - "total_submitted": 188637, - "total_column_articles": 844, + "total_acs": 105702, + "total_submitted": 190410, + "total_column_articles": 853, "frontend_question_id": "743", "is_new_question": false }, @@ -48921,8 +49572,8 @@ "question__title": "Closest Leaf in a Binary Tree", "question__title_slug": "closest-leaf-in-a-binary-tree", "question__hide": false, - "total_acs": 2614, - "total_submitted": 5362, + "total_acs": 2624, + "total_submitted": 5372, "total_column_articles": 81, "frontend_question_id": "742", "is_new_question": false @@ -48942,9 +49593,9 @@ "question__title": "To Lower Case", "question__title_slug": "to-lower-case", "question__hide": false, - "total_acs": 122626, - "total_submitted": 159523, - "total_column_articles": 906, + "total_acs": 123091, + "total_submitted": 160146, + "total_column_articles": 910, "frontend_question_id": "709", "is_new_question": false }, @@ -48963,9 +49614,9 @@ "question__title": "Cherry Pickup", "question__title_slug": "cherry-pickup", "question__hide": false, - "total_acs": 19398, - "total_submitted": 38468, - "total_column_articles": 141, + "total_acs": 19468, + "total_submitted": 38589, + "total_column_articles": 143, "frontend_question_id": "741", "is_new_question": false }, @@ -48984,9 +49635,9 @@ "question__title": "Delete and Earn", "question__title_slug": "delete-and-earn", "question__hide": false, - "total_acs": 94024, - "total_submitted": 151159, - "total_column_articles": 949, + "total_acs": 94503, + "total_submitted": 151913, + "total_column_articles": 951, "frontend_question_id": "740", "is_new_question": false }, @@ -49005,9 +49656,9 @@ "question__title": "Daily Temperatures", "question__title_slug": "daily-temperatures", "question__hide": false, - "total_acs": 422100, - "total_submitted": 611853, - "total_column_articles": 2609, + "total_acs": 425758, + "total_submitted": 617330, + "total_column_articles": 2631, "frontend_question_id": "739", "is_new_question": false }, @@ -49026,9 +49677,9 @@ "question__title": "Monotone Increasing Digits", "question__title_slug": "monotone-increasing-digits", "question__hide": false, - "total_acs": 88498, - "total_submitted": 176060, - "total_column_articles": 932, + "total_acs": 89685, + "total_submitted": 178337, + "total_column_articles": 939, "frontend_question_id": "738", "is_new_question": false }, @@ -49047,8 +49698,8 @@ "question__title": "Sentence Similarity II", "question__title_slug": "sentence-similarity-ii", "question__hide": false, - "total_acs": 6149, - "total_submitted": 12705, + "total_acs": 6168, + "total_submitted": 12745, "total_column_articles": 110, "frontend_question_id": "737", "is_new_question": false @@ -49068,9 +49719,9 @@ "question__title": "Parse Lisp Expression", "question__title_slug": "parse-lisp-expression", "question__hide": false, - "total_acs": 13460, - "total_submitted": 20265, - "total_column_articles": 153, + "total_acs": 13490, + "total_submitted": 20318, + "total_column_articles": 154, "frontend_question_id": "736", "is_new_question": false }, @@ -49089,9 +49740,9 @@ "question__title": "Asteroid Collision", "question__title_slug": "asteroid-collision", "question__hide": false, - "total_acs": 71635, - "total_submitted": 165633, - "total_column_articles": 802, + "total_acs": 72233, + "total_submitted": 167207, + "total_column_articles": 806, "frontend_question_id": "735", "is_new_question": false }, @@ -49110,9 +49761,9 @@ "question__title": "Sentence Similarity", "question__title_slug": "sentence-similarity", "question__hide": false, - "total_acs": 3531, - "total_submitted": 7475, - "total_column_articles": 71, + "total_acs": 3594, + "total_submitted": 7612, + "total_column_articles": 73, "frontend_question_id": "734", "is_new_question": false }, @@ -49131,9 +49782,9 @@ "question__title": "Flood Fill", "question__title_slug": "flood-fill", "question__hide": false, - "total_acs": 158431, - "total_submitted": 270136, - "total_column_articles": 1283, + "total_acs": 158892, + "total_submitted": 270909, + "total_column_articles": 1286, "frontend_question_id": "733", "is_new_question": false }, @@ -49152,9 +49803,9 @@ "question__title": "My Calendar III", "question__title_slug": "my-calendar-iii", "question__hide": false, - "total_acs": 24297, - "total_submitted": 33887, - "total_column_articles": 239, + "total_acs": 24374, + "total_submitted": 34056, + "total_column_articles": 240, "frontend_question_id": "732", "is_new_question": false }, @@ -49173,9 +49824,9 @@ "question__title": "My Calendar II", "question__title_slug": "my-calendar-ii", "question__hide": false, - "total_acs": 28035, - "total_submitted": 44620, - "total_column_articles": 239, + "total_acs": 28111, + "total_submitted": 44754, + "total_column_articles": 240, "frontend_question_id": "731", "is_new_question": false }, @@ -49194,9 +49845,9 @@ "question__title": "Count Different Palindromic Subsequences", "question__title_slug": "count-different-palindromic-subsequences", "question__hide": false, - "total_acs": 17873, - "total_submitted": 27830, - "total_column_articles": 124, + "total_acs": 17911, + "total_submitted": 27899, + "total_column_articles": 126, "frontend_question_id": "730", "is_new_question": false }, @@ -49215,9 +49866,9 @@ "question__title": "My Calendar I", "question__title_slug": "my-calendar-i", "question__hide": false, - "total_acs": 50980, - "total_submitted": 87305, - "total_column_articles": 434, + "total_acs": 51184, + "total_submitted": 87673, + "total_column_articles": 437, "frontend_question_id": "729", "is_new_question": false }, @@ -49236,9 +49887,9 @@ "question__title": "Self Dividing Numbers", "question__title_slug": "self-dividing-numbers", "question__hide": false, - "total_acs": 78450, - "total_submitted": 101627, - "total_column_articles": 741, + "total_acs": 78636, + "total_submitted": 101887, + "total_column_articles": 744, "frontend_question_id": "728", "is_new_question": false }, @@ -49257,8 +49908,8 @@ "question__title": "Minimum Window Subsequence", "question__title_slug": "minimum-window-subsequence", "question__hide": false, - "total_acs": 5792, - "total_submitted": 13683, + "total_acs": 5812, + "total_submitted": 13730, "total_column_articles": 81, "frontend_question_id": "727", "is_new_question": false @@ -49278,8 +49929,8 @@ "question__title": "Number of Atoms", "question__title_slug": "number-of-atoms", "question__hide": false, - "total_acs": 26888, - "total_submitted": 48776, + "total_acs": 26921, + "total_submitted": 48838, "total_column_articles": 476, "frontend_question_id": "726", "is_new_question": false @@ -49299,8 +49950,8 @@ "question__title": "Split Linked List in Parts", "question__title_slug": "split-linked-list-in-parts", "question__hide": false, - "total_acs": 60171, - "total_submitted": 99453, + "total_acs": 60291, + "total_submitted": 99695, "total_column_articles": 744, "frontend_question_id": "725", "is_new_question": false @@ -49320,9 +49971,9 @@ "question__title": "Find Pivot Index", "question__title_slug": "find-pivot-index", "question__hide": false, - "total_acs": 274129, - "total_submitted": 534652, - "total_column_articles": 1506, + "total_acs": 275927, + "total_submitted": 537655, + "total_column_articles": 1515, "frontend_question_id": "724", "is_new_question": false }, @@ -49341,9 +49992,9 @@ "question__title": "Candy Crush", "question__title_slug": "candy-crush", "question__hide": false, - "total_acs": 2326, - "total_submitted": 3158, - "total_column_articles": 58, + "total_acs": 2359, + "total_submitted": 3193, + "total_column_articles": 59, "frontend_question_id": "723", "is_new_question": false }, @@ -49362,9 +50013,9 @@ "question__title": "Remove Comments", "question__title_slug": "remove-comments", "question__hide": false, - "total_acs": 8015, - "total_submitted": 23622, - "total_column_articles": 102, + "total_acs": 8064, + "total_submitted": 23705, + "total_column_articles": 103, "frontend_question_id": "722", "is_new_question": false }, @@ -49383,9 +50034,9 @@ "question__title": "Accounts Merge", "question__title_slug": "accounts-merge", "question__hide": false, - "total_acs": 38856, - "total_submitted": 80699, - "total_column_articles": 431, + "total_acs": 38996, + "total_submitted": 80950, + "total_column_articles": 435, "frontend_question_id": "721", "is_new_question": false }, @@ -49404,9 +50055,9 @@ "question__title": "Longest Word in Dictionary", "question__title_slug": "longest-word-in-dictionary", "question__hide": false, - "total_acs": 65750, - "total_submitted": 126722, - "total_column_articles": 710, + "total_acs": 65881, + "total_submitted": 126984, + "total_column_articles": 711, "frontend_question_id": "720", "is_new_question": false }, @@ -49425,8 +50076,8 @@ "question__title": "Find K-th Smallest Pair Distance", "question__title_slug": "find-k-th-smallest-pair-distance", "question__hide": false, - "total_acs": 33549, - "total_submitted": 71941, + "total_acs": 33608, + "total_submitted": 72085, "total_column_articles": 272, "frontend_question_id": "719", "is_new_question": false @@ -49446,9 +50097,9 @@ "question__title": "Maximum Length of Repeated Subarray", "question__title_slug": "maximum-length-of-repeated-subarray", "question__hide": false, - "total_acs": 186457, - "total_submitted": 327388, - "total_column_articles": 1028, + "total_acs": 188312, + "total_submitted": 330673, + "total_column_articles": 1032, "frontend_question_id": "718", "is_new_question": false }, @@ -49467,8 +50118,8 @@ "question__title": "1-bit and 2-bit Characters", "question__title_slug": "1-bit-and-2-bit-characters", "question__hide": false, - "total_acs": 68122, - "total_submitted": 123202, + "total_acs": 68278, + "total_submitted": 123525, "total_column_articles": 822, "frontend_question_id": "717", "is_new_question": false @@ -49488,8 +50139,8 @@ "question__title": "Max Stack", "question__title_slug": "max-stack", "question__hide": false, - "total_acs": 7007, - "total_submitted": 15674, + "total_acs": 7028, + "total_submitted": 15741, "total_column_articles": 107, "frontend_question_id": "716", "is_new_question": false @@ -49509,8 +50160,8 @@ "question__title": "Range Module", "question__title_slug": "range-module", "question__hide": false, - "total_acs": 19359, - "total_submitted": 36552, + "total_acs": 19396, + "total_submitted": 36638, "total_column_articles": 206, "frontend_question_id": "715", "is_new_question": false @@ -49530,9 +50181,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": 210610, - "total_submitted": 280394, - "total_column_articles": 1230, + "total_acs": 212114, + "total_submitted": 282315, + "total_column_articles": 1241, "frontend_question_id": "714", "is_new_question": false }, @@ -49551,9 +50202,9 @@ "question__title": "Subarray Product Less Than K", "question__title_slug": "subarray-product-less-than-k", "question__hide": false, - "total_acs": 99887, - "total_submitted": 202013, - "total_column_articles": 884, + "total_acs": 100511, + "total_submitted": 203116, + "total_column_articles": 887, "frontend_question_id": "713", "is_new_question": false }, @@ -49572,9 +50223,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": 30592, - "total_submitted": 44476, - "total_column_articles": 326, + "total_acs": 30961, + "total_submitted": 44979, + "total_column_articles": 327, "frontend_question_id": "712", "is_new_question": false }, @@ -49593,9 +50244,9 @@ "question__title": "Number of Distinct Islands II", "question__title_slug": "number-of-distinct-islands-ii", "question__hide": false, - "total_acs": 1426, - "total_submitted": 2546, - "total_column_articles": 44, + "total_acs": 1433, + "total_submitted": 2561, + "total_column_articles": 46, "frontend_question_id": "711", "is_new_question": false }, @@ -49614,9 +50265,9 @@ "question__title": "Falling Squares", "question__title_slug": "falling-squares", "question__hide": false, - "total_acs": 22439, - "total_submitted": 40934, - "total_column_articles": 235, + "total_acs": 22504, + "total_submitted": 41029, + "total_column_articles": 236, "frontend_question_id": "699", "is_new_question": false }, @@ -49635,8 +50286,8 @@ "question__title": "Partition to K Equal Sum Subsets", "question__title_slug": "partition-to-k-equal-sum-subsets", "question__hide": false, - "total_acs": 100597, - "total_submitted": 238125, + "total_acs": 101220, + "total_submitted": 239904, "total_column_articles": 1392, "frontend_question_id": "698", "is_new_question": false @@ -49656,9 +50307,9 @@ "question__title": "Degree of an Array", "question__title_slug": "degree-of-an-array", "question__hide": false, - "total_acs": 90013, - "total_submitted": 151545, - "total_column_articles": 1112, + "total_acs": 90391, + "total_submitted": 152254, + "total_column_articles": 1120, "frontend_question_id": "697", "is_new_question": false }, @@ -49677,8 +50328,8 @@ "question__title": "Count Binary Substrings", "question__title_slug": "count-binary-substrings", "question__hide": false, - "total_acs": 69814, - "total_submitted": 109427, + "total_acs": 70177, + "total_submitted": 110025, "total_column_articles": 623, "frontend_question_id": "696", "is_new_question": false @@ -49698,9 +50349,9 @@ "question__title": "Max Area of Island", "question__title_slug": "max-area-of-island", "question__hide": false, - "total_acs": 279545, - "total_submitted": 410960, - "total_column_articles": 2500, + "total_acs": 281246, + "total_submitted": 413406, + "total_column_articles": 2506, "frontend_question_id": "695", "is_new_question": false }, @@ -49719,9 +50370,9 @@ "question__title": "Number of Distinct Islands", "question__title_slug": "number-of-distinct-islands", "question__hide": false, - "total_acs": 10329, - "total_submitted": 17977, - "total_column_articles": 170, + "total_acs": 10405, + "total_submitted": 18090, + "total_column_articles": 171, "frontend_question_id": "694", "is_new_question": false }, @@ -49740,9 +50391,9 @@ "question__title": "Binary Number with Alternating Bits", "question__title_slug": "binary-number-with-alternating-bits", "question__hide": false, - "total_acs": 76903, - "total_submitted": 118062, - "total_column_articles": 829, + "total_acs": 77149, + "total_submitted": 118403, + "total_column_articles": 833, "frontend_question_id": "693", "is_new_question": false }, @@ -49761,9 +50412,9 @@ "question__title": "Top K Frequent Words", "question__title_slug": "top-k-frequent-words", "question__hide": false, - "total_acs": 103782, - "total_submitted": 183958, - "total_column_articles": 1053, + "total_acs": 104308, + "total_submitted": 184957, + "total_column_articles": 1057, "frontend_question_id": "692", "is_new_question": false }, @@ -49782,9 +50433,9 @@ "question__title": "Stickers to Spell Word", "question__title_slug": "stickers-to-spell-word", "question__hide": false, - "total_acs": 23755, - "total_submitted": 40122, - "total_column_articles": 206, + "total_acs": 23844, + "total_submitted": 40369, + "total_column_articles": 207, "frontend_question_id": "691", "is_new_question": false }, @@ -49803,8 +50454,8 @@ "question__title": "Employee Importance", "question__title_slug": "employee-importance", "question__hide": false, - "total_acs": 65342, - "total_submitted": 99501, + "total_acs": 65503, + "total_submitted": 99720, "total_column_articles": 665, "frontend_question_id": "690", "is_new_question": false @@ -49824,8 +50475,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": 22546, - "total_submitted": 40147, + "total_acs": 22594, + "total_submitted": 40213, "total_column_articles": 292, "frontend_question_id": "689", "is_new_question": false @@ -49845,9 +50496,9 @@ "question__title": "Knight Probability in Chessboard", "question__title_slug": "knight-probability-in-chessboard", "question__hide": false, - "total_acs": 35642, - "total_submitted": 61353, - "total_column_articles": 387, + "total_acs": 35702, + "total_submitted": 61457, + "total_column_articles": 388, "frontend_question_id": "688", "is_new_question": false }, @@ -49866,9 +50517,9 @@ "question__title": "Longest Univalue Path", "question__title_slug": "longest-univalue-path", "question__hide": false, - "total_acs": 81223, - "total_submitted": 170492, - "total_column_articles": 665, + "total_acs": 81425, + "total_submitted": 170922, + "total_column_articles": 666, "frontend_question_id": "687", "is_new_question": false }, @@ -49887,9 +50538,9 @@ "question__title": "Repeated String Match", "question__title_slug": "repeated-string-match", "question__hide": false, - "total_acs": 50087, - "total_submitted": 125686, - "total_column_articles": 637, + "total_acs": 50269, + "total_submitted": 126075, + "total_column_articles": 639, "frontend_question_id": "686", "is_new_question": false }, @@ -49908,8 +50559,8 @@ "question__title": "Redundant Connection II", "question__title_slug": "redundant-connection-ii", "question__hide": false, - "total_acs": 28701, - "total_submitted": 67947, + "total_acs": 28876, + "total_submitted": 68428, "total_column_articles": 351, "frontend_question_id": "685", "is_new_question": false @@ -49929,9 +50580,9 @@ "question__title": "Redundant Connection", "question__title_slug": "redundant-connection", "question__hide": false, - "total_acs": 95911, - "total_submitted": 142064, - "total_column_articles": 921, + "total_acs": 96538, + "total_submitted": 142989, + "total_column_articles": 924, "frontend_question_id": "684", "is_new_question": false }, @@ -49950,8 +50601,8 @@ "question__title": "K Empty Slots", "question__title_slug": "k-empty-slots", "question__hide": false, - "total_acs": 3996, - "total_submitted": 8747, + "total_acs": 4023, + "total_submitted": 8789, "total_column_articles": 77, "frontend_question_id": "683", "is_new_question": false @@ -49971,8 +50622,8 @@ "question__title": "Baseball Game", "question__title_slug": "baseball-game", "question__hide": false, - "total_acs": 92684, - "total_submitted": 129839, + "total_acs": 93048, + "total_submitted": 130448, "total_column_articles": 975, "frontend_question_id": "682", "is_new_question": false @@ -49992,9 +50643,9 @@ "question__title": "Next Closest Time", "question__title_slug": "next-closest-time", "question__hide": false, - "total_acs": 4353, - "total_submitted": 8733, - "total_column_articles": 92, + "total_acs": 4370, + "total_submitted": 8761, + "total_column_articles": 93, "frontend_question_id": "681", "is_new_question": false }, @@ -50013,9 +50664,9 @@ "question__title": "Valid Palindrome II", "question__title_slug": "valid-palindrome-ii", "question__hide": false, - "total_acs": 132757, - "total_submitted": 331959, - "total_column_articles": 1177, + "total_acs": 133364, + "total_submitted": 333496, + "total_column_articles": 1180, "frontend_question_id": "680", "is_new_question": false }, @@ -50034,9 +50685,9 @@ "question__title": "24 Game", "question__title_slug": "24-game", "question__hide": false, - "total_acs": 39616, - "total_submitted": 73599, - "total_column_articles": 359, + "total_acs": 39726, + "total_submitted": 73807, + "total_column_articles": 360, "frontend_question_id": "679", "is_new_question": false }, @@ -50055,9 +50706,9 @@ "question__title": "Valid Parenthesis String", "question__title_slug": "valid-parenthesis-string", "question__hide": false, - "total_acs": 66846, - "total_submitted": 170322, - "total_column_articles": 664, + "total_acs": 67088, + "total_submitted": 170946, + "total_column_articles": 665, "frontend_question_id": "678", "is_new_question": false }, @@ -50076,8 +50727,8 @@ "question__title": "Map Sum Pairs", "question__title_slug": "map-sum-pairs", "question__hide": false, - "total_acs": 47854, - "total_submitted": 72830, + "total_acs": 47998, + "total_submitted": 73047, "total_column_articles": 701, "frontend_question_id": "677", "is_new_question": false @@ -50097,8 +50748,8 @@ "question__title": "Implement Magic Dictionary", "question__title_slug": "implement-magic-dictionary", "question__hide": false, - "total_acs": 38971, - "total_submitted": 59656, + "total_acs": 39076, + "total_submitted": 59800, "total_column_articles": 470, "frontend_question_id": "676", "is_new_question": false @@ -50118,8 +50769,8 @@ "question__title": "Cut Off Trees for Golf Event", "question__title_slug": "cut-off-trees-for-golf-event", "question__hide": false, - "total_acs": 21498, - "total_submitted": 40907, + "total_acs": 21523, + "total_submitted": 40972, "total_column_articles": 219, "frontend_question_id": "675", "is_new_question": false @@ -50139,9 +50790,9 @@ "question__title": "Longest Continuous Increasing Subsequence", "question__title_slug": "longest-continuous-increasing-subsequence", "question__hide": false, - "total_acs": 188249, - "total_submitted": 340062, - "total_column_articles": 1267, + "total_acs": 190138, + "total_submitted": 343067, + "total_column_articles": 1274, "frontend_question_id": "674", "is_new_question": false }, @@ -50160,9 +50811,9 @@ "question__title": "Number of Longest Increasing Subsequence", "question__title_slug": "number-of-longest-increasing-subsequence", "question__hide": false, - "total_acs": 84547, - "total_submitted": 189441, - "total_column_articles": 635, + "total_acs": 85080, + "total_submitted": 190594, + "total_column_articles": 639, "frontend_question_id": "673", "is_new_question": false }, @@ -50181,8 +50832,8 @@ "question__title": "Bulb Switcher II", "question__title_slug": "bulb-switcher-ii", "question__hide": false, - "total_acs": 26432, - "total_submitted": 43415, + "total_acs": 26456, + "total_submitted": 43460, "total_column_articles": 260, "frontend_question_id": "672", "is_new_question": false @@ -50202,9 +50853,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": 69082, - "total_submitted": 143896, - "total_column_articles": 854, + "total_acs": 69274, + "total_submitted": 144352, + "total_column_articles": 856, "frontend_question_id": "671", "is_new_question": false }, @@ -50223,8 +50874,8 @@ "question__title": "Maximum Swap", "question__title_slug": "maximum-swap", "question__hide": false, - "total_acs": 66691, - "total_submitted": 139279, + "total_acs": 66820, + "total_submitted": 139549, "total_column_articles": 934, "frontend_question_id": "670", "is_new_question": false @@ -50244,9 +50895,9 @@ "question__title": "Trim a Binary Search Tree", "question__title_slug": "trim-a-binary-search-tree", "question__hide": false, - "total_acs": 122370, - "total_submitted": 180842, - "total_column_articles": 899, + "total_acs": 123676, + "total_submitted": 182806, + "total_column_articles": 907, "frontend_question_id": "669", "is_new_question": false }, @@ -50265,9 +50916,9 @@ "question__title": "Kth Smallest Number in Multiplication Table", "question__title_slug": "kth-smallest-number-in-multiplication-table", "question__hide": false, - "total_acs": 30123, - "total_submitted": 51388, - "total_column_articles": 275, + "total_acs": 30171, + "total_submitted": 51492, + "total_column_articles": 276, "frontend_question_id": "668", "is_new_question": false }, @@ -50286,9 +50937,9 @@ "question__title": "Beautiful Arrangement II", "question__title_slug": "beautiful-arrangement-ii", "question__hide": false, - "total_acs": 35543, - "total_submitted": 53287, - "total_column_articles": 517, + "total_acs": 35582, + "total_submitted": 53334, + "total_column_articles": 518, "frontend_question_id": "667", "is_new_question": false }, @@ -50307,8 +50958,8 @@ "question__title": "Path Sum IV", "question__title_slug": "path-sum-iv", "question__hide": false, - "total_acs": 3460, - "total_submitted": 5513, + "total_acs": 3465, + "total_submitted": 5528, "total_column_articles": 109, "frontend_question_id": "666", "is_new_question": false @@ -50328,9 +50979,9 @@ "question__title": "Non-decreasing Array", "question__title_slug": "non-decreasing-array", "question__hide": false, - "total_acs": 98858, - "total_submitted": 357473, - "total_column_articles": 1177, + "total_acs": 99192, + "total_submitted": 358617, + "total_column_articles": 1180, "frontend_question_id": "665", "is_new_question": false }, @@ -50349,9 +51000,9 @@ "question__title": "Strange Printer", "question__title_slug": "strange-printer", "question__hide": false, - "total_acs": 26974, - "total_submitted": 41274, - "total_column_articles": 231, + "total_acs": 27036, + "total_submitted": 41364, + "total_column_articles": 232, "frontend_question_id": "664", "is_new_question": false }, @@ -50370,8 +51021,8 @@ "question__title": "Equal Tree Partition", "question__title_slug": "equal-tree-partition", "question__hide": false, - "total_acs": 2820, - "total_submitted": 6142, + "total_acs": 2837, + "total_submitted": 6182, "total_column_articles": 59, "frontend_question_id": "663", "is_new_question": false @@ -50391,9 +51042,9 @@ "question__title": "Maximum Width of Binary Tree", "question__title_slug": "maximum-width-of-binary-tree", "question__hide": false, - "total_acs": 87599, - "total_submitted": 200598, - "total_column_articles": 799, + "total_acs": 88212, + "total_submitted": 201986, + "total_column_articles": 807, "frontend_question_id": "662", "is_new_question": false }, @@ -50412,9 +51063,9 @@ "question__title": "Image Smoother", "question__title_slug": "image-smoother", "question__hide": false, - "total_acs": 53168, - "total_submitted": 82608, - "total_column_articles": 563, + "total_acs": 53375, + "total_submitted": 82972, + "total_column_articles": 566, "frontend_question_id": "661", "is_new_question": false }, @@ -50433,8 +51084,8 @@ "question__title": "Remove 9", "question__title_slug": "remove-9", "question__hide": false, - "total_acs": 1360, - "total_submitted": 2093, + "total_acs": 1363, + "total_submitted": 2097, "total_column_articles": 39, "frontend_question_id": "660", "is_new_question": false @@ -50454,9 +51105,9 @@ "question__title": "Split Array into Consecutive Subsequences", "question__title_slug": "split-array-into-consecutive-subsequences", "question__hide": false, - "total_acs": 36301, - "total_submitted": 66417, - "total_column_articles": 384, + "total_acs": 36403, + "total_submitted": 66603, + "total_column_articles": 387, "frontend_question_id": "659", "is_new_question": false }, @@ -50475,9 +51126,9 @@ "question__title": "Find K Closest Elements", "question__title_slug": "find-k-closest-elements", "question__hide": false, - "total_acs": 88409, - "total_submitted": 184264, - "total_column_articles": 818, + "total_acs": 88758, + "total_submitted": 184962, + "total_column_articles": 819, "frontend_question_id": "658", "is_new_question": false }, @@ -50496,9 +51147,9 @@ "question__title": "Robot Return to Origin", "question__title_slug": "robot-return-to-origin", "question__hide": false, - "total_acs": 103625, - "total_submitted": 131319, - "total_column_articles": 824, + "total_acs": 104065, + "total_submitted": 131869, + "total_column_articles": 826, "frontend_question_id": "657", "is_new_question": false }, @@ -50517,8 +51168,8 @@ "question__title": "Coin Path", "question__title_slug": "coin-path", "question__hide": false, - "total_acs": 1442, - "total_submitted": 4243, + "total_acs": 1450, + "total_submitted": 4262, "total_column_articles": 35, "frontend_question_id": "656", "is_new_question": false @@ -50538,8 +51189,8 @@ "question__title": "Print Binary Tree", "question__title_slug": "print-binary-tree", "question__hide": false, - "total_acs": 35547, - "total_submitted": 51099, + "total_acs": 35617, + "total_submitted": 51180, "total_column_articles": 508, "frontend_question_id": "655", "is_new_question": false @@ -50559,9 +51210,9 @@ "question__title": "Maximum Binary Tree", "question__title_slug": "maximum-binary-tree", "question__hide": false, - "total_acs": 193553, - "total_submitted": 234227, - "total_column_articles": 1567, + "total_acs": 195556, + "total_submitted": 236614, + "total_column_articles": 1576, "frontend_question_id": "654", "is_new_question": false }, @@ -50580,9 +51231,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": 112183, - "total_submitted": 176612, - "total_column_articles": 973, + "total_acs": 112530, + "total_submitted": 177185, + "total_column_articles": 975, "frontend_question_id": "653", "is_new_question": false }, @@ -50601,9 +51252,9 @@ "question__title": "Find Duplicate Subtrees", "question__title_slug": "find-duplicate-subtrees", "question__hide": false, - "total_acs": 94659, - "total_submitted": 154494, - "total_column_articles": 638, + "total_acs": 95016, + "total_submitted": 155029, + "total_column_articles": 641, "frontend_question_id": "652", "is_new_question": false }, @@ -50622,9 +51273,9 @@ "question__title": "4 Keys Keyboard", "question__title_slug": "4-keys-keyboard", "question__hide": false, - "total_acs": 6388, - "total_submitted": 10681, - "total_column_articles": 94, + "total_acs": 6466, + "total_submitted": 10799, + "total_column_articles": 95, "frontend_question_id": "651", "is_new_question": false }, @@ -50643,9 +51294,9 @@ "question__title": "2 Keys Keyboard", "question__title_slug": "2-keys-keyboard", "question__hide": false, - "total_acs": 65321, - "total_submitted": 113314, - "total_column_articles": 784, + "total_acs": 65540, + "total_submitted": 113667, + "total_column_articles": 786, "frontend_question_id": "650", "is_new_question": false }, @@ -50664,9 +51315,9 @@ "question__title": "Dota2 Senate", "question__title_slug": "dota2-senate", "question__hide": false, - "total_acs": 38878, - "total_submitted": 80789, - "total_column_articles": 389, + "total_acs": 39438, + "total_submitted": 81813, + "total_column_articles": 394, "frontend_question_id": "649", "is_new_question": false }, @@ -50685,9 +51336,9 @@ "question__title": "Replace Words", "question__title_slug": "replace-words", "question__hide": false, - "total_acs": 67242, - "total_submitted": 104535, - "total_column_articles": 805, + "total_acs": 67906, + "total_submitted": 105586, + "total_column_articles": 811, "frontend_question_id": "648", "is_new_question": false }, @@ -50706,9 +51357,9 @@ "question__title": "Palindromic Substrings", "question__title_slug": "palindromic-substrings", "question__hide": false, - "total_acs": 272939, - "total_submitted": 408379, - "total_column_articles": 1682, + "total_acs": 275349, + "total_submitted": 411916, + "total_column_articles": 1694, "frontend_question_id": "647", "is_new_question": false }, @@ -50727,9 +51378,9 @@ "question__title": "Maximum Length of Pair Chain", "question__title_slug": "maximum-length-of-pair-chain", "question__hide": false, - "total_acs": 65582, - "total_submitted": 105497, - "total_column_articles": 640, + "total_acs": 65931, + "total_submitted": 106024, + "total_column_articles": 641, "frontend_question_id": "646", "is_new_question": false }, @@ -50748,9 +51399,9 @@ "question__title": "Set Mismatch", "question__title_slug": "set-mismatch", "question__hide": false, - "total_acs": 104128, - "total_submitted": 261326, - "total_column_articles": 1025, + "total_acs": 104659, + "total_submitted": 262864, + "total_column_articles": 1030, "frontend_question_id": "645", "is_new_question": false }, @@ -50769,9 +51420,9 @@ "question__title": "Maximum Average Subarray II", "question__title_slug": "maximum-average-subarray-ii", "question__hide": false, - "total_acs": 2251, - "total_submitted": 5060, - "total_column_articles": 39, + "total_acs": 2273, + "total_submitted": 5139, + "total_column_articles": 40, "frontend_question_id": "644", "is_new_question": false }, @@ -50790,9 +51441,9 @@ "question__title": "Maximum Average Subarray I", "question__title_slug": "maximum-average-subarray-i", "question__hide": false, - "total_acs": 101564, - "total_submitted": 233262, - "total_column_articles": 887, + "total_acs": 102418, + "total_submitted": 235364, + "total_column_articles": 893, "frontend_question_id": "643", "is_new_question": false }, @@ -50811,8 +51462,8 @@ "question__title": "Design Search Autocomplete System", "question__title_slug": "design-search-autocomplete-system", "question__hide": false, - "total_acs": 5197, - "total_submitted": 9289, + "total_acs": 5209, + "total_submitted": 9308, "total_column_articles": 91, "frontend_question_id": "642", "is_new_question": false @@ -50832,8 +51483,8 @@ "question__title": "Solve the Equation", "question__title_slug": "solve-the-equation", "question__hide": false, - "total_acs": 36782, - "total_submitted": 82358, + "total_acs": 36864, + "total_submitted": 82544, "total_column_articles": 706, "frontend_question_id": "640", "is_new_question": false @@ -50853,9 +51504,9 @@ "question__title": "Decode Ways II", "question__title_slug": "decode-ways-ii", "question__hide": false, - "total_acs": 23376, - "total_submitted": 62468, - "total_column_articles": 321, + "total_acs": 23456, + "total_submitted": 62678, + "total_column_articles": 322, "frontend_question_id": "639", "is_new_question": false }, @@ -50874,9 +51525,9 @@ "question__title": "Shopping Offers", "question__title_slug": "shopping-offers", "question__hide": false, - "total_acs": 35061, - "total_submitted": 55587, - "total_column_articles": 333, + "total_acs": 35156, + "total_submitted": 55800, + "total_column_articles": 335, "frontend_question_id": "638", "is_new_question": false }, @@ -50895,9 +51546,9 @@ "question__title": "Average of Levels in Binary Tree", "question__title_slug": "average-of-levels-in-binary-tree", "question__hide": false, - "total_acs": 137661, - "total_submitted": 197039, - "total_column_articles": 1038, + "total_acs": 138943, + "total_submitted": 198910, + "total_column_articles": 1043, "frontend_question_id": "637", "is_new_question": false }, @@ -50916,8 +51567,8 @@ "question__title": "Exclusive Time of Functions", "question__title_slug": "exclusive-time-of-functions", "question__hide": false, - "total_acs": 34965, - "total_submitted": 53012, + "total_acs": 35046, + "total_submitted": 53125, "total_column_articles": 348, "frontend_question_id": "636", "is_new_question": false @@ -50937,8 +51588,8 @@ "question__title": "Design Log Storage System", "question__title_slug": "design-log-storage-system", "question__hide": false, - "total_acs": 6144, - "total_submitted": 10875, + "total_acs": 6157, + "total_submitted": 10905, "total_column_articles": 106, "frontend_question_id": "635", "is_new_question": false @@ -50958,8 +51609,8 @@ "question__title": "Find the Derangement of An Array", "question__title_slug": "find-the-derangement-of-an-array", "question__hide": false, - "total_acs": 2312, - "total_submitted": 4879, + "total_acs": 2319, + "total_submitted": 4889, "total_column_articles": 35, "frontend_question_id": "634", "is_new_question": false @@ -50979,9 +51630,9 @@ "question__title": "Sum of Square Numbers", "question__title_slug": "sum-of-square-numbers", "question__hide": false, - "total_acs": 130326, - "total_submitted": 340039, - "total_column_articles": 1025, + "total_acs": 130684, + "total_submitted": 341094, + "total_column_articles": 1028, "frontend_question_id": "633", "is_new_question": false }, @@ -51000,9 +51651,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": 25262, - "total_submitted": 41585, - "total_column_articles": 311, + "total_acs": 25391, + "total_submitted": 41762, + "total_column_articles": 312, "frontend_question_id": "632", "is_new_question": false }, @@ -51021,8 +51672,8 @@ "question__title": "Design Excel Sum Formula", "question__title_slug": "design-excel-sum-formula", "question__hide": false, - "total_acs": 1698, - "total_submitted": 5095, + "total_acs": 1700, + "total_submitted": 5099, "total_column_articles": 48, "frontend_question_id": "631", "is_new_question": false @@ -51042,8 +51693,8 @@ "question__title": "Course Schedule III", "question__title_slug": "course-schedule-iii", "question__hide": false, - "total_acs": 29357, - "total_submitted": 63422, + "total_acs": 29440, + "total_submitted": 63618, "total_column_articles": 264, "frontend_question_id": "630", "is_new_question": false @@ -51063,9 +51714,9 @@ "question__title": "K Inverse Pairs Array", "question__title_slug": "k-inverse-pairs-array", "question__hide": false, - "total_acs": 22260, - "total_submitted": 43508, - "total_column_articles": 209, + "total_acs": 22323, + "total_submitted": 43619, + "total_column_articles": 210, "frontend_question_id": "629", "is_new_question": false }, @@ -51084,8 +51735,8 @@ "question__title": "Maximum Product of Three Numbers", "question__title_slug": "maximum-product-of-three-numbers", "question__hide": false, - "total_acs": 116919, - "total_submitted": 224783, + "total_acs": 117426, + "total_submitted": 225758, "total_column_articles": 1071, "frontend_question_id": "628", "is_new_question": false @@ -51105,9 +51756,9 @@ "question__title": "Swap Salary", "question__title_slug": "swap-salary", "question__hide": false, - "total_acs": 175097, - "total_submitted": 213238, - "total_column_articles": 639, + "total_acs": 175660, + "total_submitted": 213912, + "total_column_articles": 641, "frontend_question_id": "627", "is_new_question": false }, @@ -51126,9 +51777,9 @@ "question__title": "Exchange Seats", "question__title_slug": "exchange-seats", "question__hide": false, - "total_acs": 71977, - "total_submitted": 104759, - "total_column_articles": 589, + "total_acs": 72575, + "total_submitted": 105686, + "total_column_articles": 591, "frontend_question_id": "626", "is_new_question": false }, @@ -51147,9 +51798,9 @@ "question__title": "Minimum Factorization", "question__title_slug": "minimum-factorization", "question__hide": false, - "total_acs": 3385, - "total_submitted": 9776, - "total_column_articles": 68, + "total_acs": 3392, + "total_submitted": 9793, + "total_column_articles": 69, "frontend_question_id": "625", "is_new_question": false }, @@ -51168,9 +51819,9 @@ "question__title": "Maximum Distance in Arrays", "question__title_slug": "maximum-distance-in-arrays", "question__hide": false, - "total_acs": 3931, - "total_submitted": 9191, - "total_column_articles": 83, + "total_acs": 4092, + "total_submitted": 9648, + "total_column_articles": 84, "frontend_question_id": "624", "is_new_question": false }, @@ -51189,9 +51840,9 @@ "question__title": "Add One Row to Tree", "question__title_slug": "add-one-row-to-tree", "question__hide": false, - "total_acs": 44775, - "total_submitted": 74414, - "total_column_articles": 648, + "total_acs": 44919, + "total_submitted": 74676, + "total_column_articles": 650, "frontend_question_id": "623", "is_new_question": false }, @@ -51210,9 +51861,9 @@ "question__title": "Task Scheduler", "question__title_slug": "task-scheduler", "question__hide": false, - "total_acs": 137000, - "total_submitted": 229691, - "total_column_articles": 832, + "total_acs": 137835, + "total_submitted": 230994, + "total_column_articles": 835, "frontend_question_id": "621", "is_new_question": false }, @@ -51231,9 +51882,9 @@ "question__title": "Not Boring Movies", "question__title_slug": "not-boring-movies", "question__hide": false, - "total_acs": 128938, - "total_submitted": 167012, - "total_column_articles": 446, + "total_acs": 129867, + "total_submitted": 168232, + "total_column_articles": 449, "frontend_question_id": "620", "is_new_question": false }, @@ -51252,9 +51903,9 @@ "question__title": "Biggest Single Number", "question__title_slug": "biggest-single-number", "question__hide": false, - "total_acs": 26656, - "total_submitted": 55753, - "total_column_articles": 169, + "total_acs": 27640, + "total_submitted": 57630, + "total_column_articles": 171, "frontend_question_id": "619", "is_new_question": false }, @@ -51273,9 +51924,9 @@ "question__title": "Students Report By Geography", "question__title_slug": "students-report-by-geography", "question__hide": false, - "total_acs": 9507, - "total_submitted": 15242, - "total_column_articles": 86, + "total_acs": 9567, + "total_submitted": 15333, + "total_column_articles": 87, "frontend_question_id": "618", "is_new_question": false }, @@ -51294,9 +51945,9 @@ "question__title": "Merge Two Binary Trees", "question__title_slug": "merge-two-binary-trees", "question__hide": false, - "total_acs": 397710, - "total_submitted": 502522, - "total_column_articles": 2331, + "total_acs": 400366, + "total_submitted": 505909, + "total_column_articles": 2341, "frontend_question_id": "617", "is_new_question": false }, @@ -51315,9 +51966,9 @@ "question__title": "Add Bold Tag in String", "question__title_slug": "add-bold-tag-in-string", "question__hide": false, - "total_acs": 5457, - "total_submitted": 11090, - "total_column_articles": 88, + "total_acs": 5517, + "total_submitted": 11211, + "total_column_articles": 91, "frontend_question_id": "616", "is_new_question": false }, @@ -51336,8 +51987,8 @@ "question__title": "Average Salary: Departments VS Company", "question__title_slug": "average-salary-departments-vs-company", "question__hide": false, - "total_acs": 10165, - "total_submitted": 24084, + "total_acs": 10222, + "total_submitted": 24183, "total_column_articles": 147, "frontend_question_id": "615", "is_new_question": false @@ -51357,8 +52008,8 @@ "question__title": "Second Degree Follower", "question__title_slug": "second-degree-follower", "question__hide": false, - "total_acs": 15209, - "total_submitted": 40872, + "total_acs": 15281, + "total_submitted": 41048, "total_column_articles": 106, "frontend_question_id": "614", "is_new_question": false @@ -51378,8 +52029,8 @@ "question__title": "Shortest Distance in a Line", "question__title_slug": "shortest-distance-in-a-line", "question__hide": false, - "total_acs": 19362, - "total_submitted": 24321, + "total_acs": 19449, + "total_submitted": 24419, "total_column_articles": 119, "frontend_question_id": "613", "is_new_question": false @@ -51399,9 +52050,9 @@ "question__title": "Shortest Distance in a Plane", "question__title_slug": "shortest-distance-in-a-plane", "question__hide": false, - "total_acs": 13523, - "total_submitted": 20785, - "total_column_articles": 101, + "total_acs": 13581, + "total_submitted": 20873, + "total_column_articles": 102, "frontend_question_id": "612", "is_new_question": false }, @@ -51420,8 +52071,8 @@ "question__title": "Valid Triangle Number", "question__title_slug": "valid-triangle-number", "question__hide": false, - "total_acs": 87530, - "total_submitted": 162895, + "total_acs": 87955, + "total_submitted": 163665, "total_column_articles": 634, "frontend_question_id": "611", "is_new_question": false @@ -51441,9 +52092,9 @@ "question__title": "Triangle Judgement", "question__title_slug": "triangle-judgement", "question__hide": false, - "total_acs": 20168, - "total_submitted": 31540, - "total_column_articles": 115, + "total_acs": 20942, + "total_submitted": 32643, + "total_column_articles": 117, "frontend_question_id": "610", "is_new_question": false }, @@ -51462,9 +52113,9 @@ "question__title": "Find Duplicate File in System", "question__title_slug": "find-duplicate-file-in-system", "question__hide": false, - "total_acs": 10130, - "total_submitted": 19394, - "total_column_articles": 157, + "total_acs": 10184, + "total_submitted": 19472, + "total_column_articles": 158, "frontend_question_id": "609", "is_new_question": false }, @@ -51483,8 +52134,8 @@ "question__title": "Tree Node", "question__title_slug": "tree-node", "question__hide": false, - "total_acs": 54804, - "total_submitted": 89808, + "total_acs": 55281, + "total_submitted": 90539, "total_column_articles": 390, "frontend_question_id": "608", "is_new_question": false @@ -51504,9 +52155,9 @@ "question__title": "Sales Person", "question__title_slug": "sales-person", "question__hide": false, - "total_acs": 65403, - "total_submitted": 95564, - "total_column_articles": 381, + "total_acs": 66196, + "total_submitted": 96711, + "total_column_articles": 383, "frontend_question_id": "607", "is_new_question": false }, @@ -51525,9 +52176,9 @@ "question__title": "Construct String from Binary Tree", "question__title_slug": "construct-string-from-binary-tree", "question__hide": false, - "total_acs": 72214, - "total_submitted": 115864, - "total_column_articles": 721, + "total_acs": 72518, + "total_submitted": 116428, + "total_column_articles": 722, "frontend_question_id": "606", "is_new_question": false }, @@ -51546,9 +52197,9 @@ "question__title": "Can Place Flowers", "question__title_slug": "can-place-flowers", "question__hide": false, - "total_acs": 162953, - "total_submitted": 502500, - "total_column_articles": 1799, + "total_acs": 164088, + "total_submitted": 506222, + "total_column_articles": 1808, "frontend_question_id": "605", "is_new_question": false }, @@ -51567,9 +52218,9 @@ "question__title": "Design Compressed String Iterator", "question__title_slug": "design-compressed-string-iterator", "question__hide": false, - "total_acs": 3810, - "total_submitted": 9867, - "total_column_articles": 91, + "total_acs": 3850, + "total_submitted": 9931, + "total_column_articles": 92, "frontend_question_id": "604", "is_new_question": false }, @@ -51588,9 +52239,9 @@ "question__title": "Consecutive Available Seats", "question__title_slug": "consecutive-available-seats", "question__hide": false, - "total_acs": 26000, - "total_submitted": 40600, - "total_column_articles": 232, + "total_acs": 26133, + "total_submitted": 40804, + "total_column_articles": 233, "frontend_question_id": "603", "is_new_question": false }, @@ -51609,9 +52260,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": 16803, - "total_submitted": 27631, - "total_column_articles": 153, + "total_acs": 17276, + "total_submitted": 28362, + "total_column_articles": 155, "frontend_question_id": "602", "is_new_question": false }, @@ -51630,9 +52281,9 @@ "question__title": "Human Traffic of Stadium", "question__title_slug": "human-traffic-of-stadium", "question__hide": false, - "total_acs": 48546, - "total_submitted": 101080, - "total_column_articles": 563, + "total_acs": 48851, + "total_submitted": 101675, + "total_column_articles": 569, "frontend_question_id": "601", "is_new_question": false }, @@ -51651,8 +52302,8 @@ "question__title": "Non-negative Integers without Consecutive Ones", "question__title_slug": "non-negative-integers-without-consecutive-ones", "question__hide": false, - "total_acs": 24571, - "total_submitted": 49817, + "total_acs": 24635, + "total_submitted": 49924, "total_column_articles": 309, "frontend_question_id": "600", "is_new_question": false @@ -51672,9 +52323,9 @@ "question__title": "Minimum Index Sum of Two Lists", "question__title_slug": "minimum-index-sum-of-two-lists", "question__hide": false, - "total_acs": 87036, - "total_submitted": 153692, - "total_column_articles": 733, + "total_acs": 87305, + "total_submitted": 154145, + "total_column_articles": 734, "frontend_question_id": "599", "is_new_question": false }, @@ -51693,9 +52344,9 @@ "question__title": "Range Addition II", "question__title_slug": "range-addition-ii", "question__hide": false, - "total_acs": 53383, - "total_submitted": 92441, - "total_column_articles": 617, + "total_acs": 53602, + "total_submitted": 92813, + "total_column_articles": 618, "frontend_question_id": "598", "is_new_question": false }, @@ -51714,8 +52365,8 @@ "question__title": "Friend Requests I: Overall Acceptance Rate", "question__title_slug": "friend-requests-i-overall-acceptance-rate", "question__hide": false, - "total_acs": 18692, - "total_submitted": 43229, + "total_acs": 18740, + "total_submitted": 43336, "total_column_articles": 126, "frontend_question_id": "597", "is_new_question": false @@ -51735,9 +52386,9 @@ "question__title": "Classes More Than 5 Students", "question__title_slug": "classes-more-than-5-students", "question__hide": false, - "total_acs": 148713, - "total_submitted": 295549, - "total_column_articles": 468, + "total_acs": 149558, + "total_submitted": 296650, + "total_column_articles": 469, "frontend_question_id": "596", "is_new_question": false }, @@ -51756,9 +52407,9 @@ "question__title": "Big Countries", "question__title_slug": "big-countries", "question__hide": false, - "total_acs": 274789, - "total_submitted": 410874, - "total_column_articles": 581, + "total_acs": 276351, + "total_submitted": 413278, + "total_column_articles": 586, "frontend_question_id": "595", "is_new_question": false }, @@ -51777,9 +52428,9 @@ "question__title": "Longest Harmonious Subsequence", "question__title_slug": "longest-harmonious-subsequence", "question__hide": false, - "total_acs": 81182, - "total_submitted": 144734, - "total_column_articles": 695, + "total_acs": 81568, + "total_submitted": 145425, + "total_column_articles": 698, "frontend_question_id": "594", "is_new_question": false }, @@ -51798,8 +52449,8 @@ "question__title": "Valid Square", "question__title_slug": "valid-square", "question__hide": false, - "total_acs": 35591, - "total_submitted": 75576, + "total_acs": 35654, + "total_submitted": 75699, "total_column_articles": 587, "frontend_question_id": "593", "is_new_question": false @@ -51819,8 +52470,8 @@ "question__title": "Fraction Addition and Subtraction", "question__title_slug": "fraction-addition-and-subtraction", "question__hide": false, - "total_acs": 26261, - "total_submitted": 43879, + "total_acs": 26343, + "total_submitted": 44023, "total_column_articles": 477, "frontend_question_id": "592", "is_new_question": false @@ -51840,8 +52491,8 @@ "question__title": "Tag Validator", "question__title_slug": "tag-validator", "question__hide": false, - "total_acs": 17681, - "total_submitted": 33908, + "total_acs": 17695, + "total_submitted": 33955, "total_column_articles": 196, "frontend_question_id": "591", "is_new_question": false @@ -51861,8 +52512,8 @@ "question__title": "Design In-Memory File System", "question__title_slug": "design-in-memory-file-system", "question__hide": false, - "total_acs": 3116, - "total_submitted": 7186, + "total_acs": 3139, + "total_submitted": 7246, "total_column_articles": 56, "frontend_question_id": "588", "is_new_question": false @@ -51882,8 +52533,8 @@ "question__title": "Erect the Fence", "question__title_slug": "erect-the-fence", "question__hide": false, - "total_acs": 17567, - "total_submitted": 28817, + "total_acs": 17595, + "total_submitted": 28887, "total_column_articles": 138, "frontend_question_id": "587", "is_new_question": false @@ -51903,9 +52554,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": 72716, - "total_submitted": 103866, - "total_column_articles": 341, + "total_acs": 73609, + "total_submitted": 105282, + "total_column_articles": 344, "frontend_question_id": "586", "is_new_question": false }, @@ -51924,9 +52575,9 @@ "question__title": "Investments in 2016", "question__title_slug": "investments-in-2016", "question__hide": false, - "total_acs": 16809, - "total_submitted": 34751, - "total_column_articles": 176, + "total_acs": 17356, + "total_submitted": 35943, + "total_column_articles": 177, "frontend_question_id": "585", "is_new_question": false }, @@ -51945,9 +52596,9 @@ "question__title": "Find Customer Referee", "question__title_slug": "find-customer-referee", "question__hide": false, - "total_acs": 144540, - "total_submitted": 221537, - "total_column_articles": 423, + "total_acs": 146400, + "total_submitted": 224174, + "total_column_articles": 431, "frontend_question_id": "584", "is_new_question": false }, @@ -51966,9 +52617,9 @@ "question__title": "Delete Operation for Two Strings", "question__title_slug": "delete-operation-for-two-strings", "question__hide": false, - "total_acs": 120919, - "total_submitted": 181837, - "total_column_articles": 898, + "total_acs": 122258, + "total_submitted": 183755, + "total_column_articles": 901, "frontend_question_id": "583", "is_new_question": false }, @@ -51987,8 +52638,8 @@ "question__title": "Kill Process", "question__title_slug": "kill-process", "question__hide": false, - "total_acs": 12287, - "total_submitted": 26978, + "total_acs": 12328, + "total_submitted": 27035, "total_column_articles": 185, "frontend_question_id": "582", "is_new_question": false @@ -52008,9 +52659,9 @@ "question__title": "Shortest Unsorted Continuous Subarray", "question__title_slug": "shortest-unsorted-continuous-subarray", "question__hide": false, - "total_acs": 176832, - "total_submitted": 423642, - "total_column_articles": 1339, + "total_acs": 177873, + "total_submitted": 425943, + "total_column_articles": 1341, "frontend_question_id": "581", "is_new_question": false }, @@ -52029,8 +52680,8 @@ "question__title": "Count Student Number in Departments", "question__title_slug": "count-student-number-in-departments", "question__hide": false, - "total_acs": 22659, - "total_submitted": 42317, + "total_acs": 22737, + "total_submitted": 42439, "total_column_articles": 154, "frontend_question_id": "580", "is_new_question": false @@ -52050,9 +52701,9 @@ "question__title": "Find Cumulative Salary of an Employee", "question__title_slug": "find-cumulative-salary-of-an-employee", "question__hide": false, - "total_acs": 14005, - "total_submitted": 31883, - "total_column_articles": 186, + "total_acs": 14058, + "total_submitted": 31967, + "total_column_articles": 187, "frontend_question_id": "579", "is_new_question": false }, @@ -52071,8 +52722,8 @@ "question__title": "Get Highest Answer Rate Question", "question__title_slug": "get-highest-answer-rate-question", "question__hide": false, - "total_acs": 19053, - "total_submitted": 44918, + "total_acs": 19114, + "total_submitted": 45083, "total_column_articles": 189, "frontend_question_id": "578", "is_new_question": false @@ -52092,9 +52743,9 @@ "question__title": "Employee Bonus", "question__title_slug": "employee-bonus", "question__hide": false, - "total_acs": 32210, - "total_submitted": 46435, - "total_column_articles": 148, + "total_acs": 33504, + "total_submitted": 48295, + "total_column_articles": 150, "frontend_question_id": "577", "is_new_question": false }, @@ -52113,9 +52764,9 @@ "question__title": "Out of Boundary Paths", "question__title_slug": "out-of-boundary-paths", "question__hide": false, - "total_acs": 35483, - "total_submitted": 75321, - "total_column_articles": 379, + "total_acs": 35606, + "total_submitted": 75625, + "total_column_articles": 380, "frontend_question_id": "576", "is_new_question": false }, @@ -52134,9 +52785,9 @@ "question__title": "Distribute Candies", "question__title_slug": "distribute-candies", "question__hide": false, - "total_acs": 111560, - "total_submitted": 158336, - "total_column_articles": 1060, + "total_acs": 111918, + "total_submitted": 158868, + "total_column_articles": 1062, "frontend_question_id": "575", "is_new_question": false }, @@ -52155,8 +52806,8 @@ "question__title": "Winning Candidate", "question__title_slug": "winning-candidate", "question__hide": false, - "total_acs": 23211, - "total_submitted": 34995, + "total_acs": 23290, + "total_submitted": 35109, "total_column_articles": 161, "frontend_question_id": "574", "is_new_question": false @@ -52176,8 +52827,8 @@ "question__title": "Squirrel Simulation", "question__title_slug": "squirrel-simulation", "question__hide": false, - "total_acs": 1694, - "total_submitted": 2602, + "total_acs": 1705, + "total_submitted": 2616, "total_column_articles": 49, "frontend_question_id": "573", "is_new_question": false @@ -52197,9 +52848,9 @@ "question__title": "Subtree of Another Tree", "question__title_slug": "subtree-of-another-tree", "question__hide": false, - "total_acs": 171581, - "total_submitted": 360913, - "total_column_articles": 1297, + "total_acs": 172744, + "total_submitted": 363408, + "total_column_articles": 1302, "frontend_question_id": "572", "is_new_question": false }, @@ -52218,9 +52869,9 @@ "question__title": "Find Median Given Frequency of Numbers", "question__title_slug": "find-median-given-frequency-of-numbers", "question__hide": false, - "total_acs": 13374, - "total_submitted": 28459, - "total_column_articles": 145, + "total_acs": 13453, + "total_submitted": 28602, + "total_column_articles": 147, "frontend_question_id": "571", "is_new_question": false }, @@ -52239,9 +52890,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": 31390, - "total_submitted": 48124, - "total_column_articles": 208, + "total_acs": 32573, + "total_submitted": 49999, + "total_column_articles": 211, "frontend_question_id": "570", "is_new_question": false }, @@ -52260,9 +52911,9 @@ "question__title": "Median Employee Salary", "question__title_slug": "median-employee-salary", "question__hide": false, - "total_acs": 19796, - "total_submitted": 34552, - "total_column_articles": 263, + "total_acs": 19881, + "total_submitted": 34676, + "total_column_articles": 265, "frontend_question_id": "569", "is_new_question": false }, @@ -52281,8 +52932,8 @@ "question__title": "Maximum Vacation Days", "question__title_slug": "maximum-vacation-days", "question__hide": false, - "total_acs": 2069, - "total_submitted": 3857, + "total_acs": 2074, + "total_submitted": 3864, "total_column_articles": 42, "frontend_question_id": "568", "is_new_question": false @@ -52302,9 +52953,9 @@ "question__title": "Permutation in String", "question__title_slug": "permutation-in-string", "question__hide": false, - "total_acs": 259139, - "total_submitted": 583633, - "total_column_articles": 2303, + "total_acs": 260353, + "total_submitted": 586040, + "total_column_articles": 2306, "frontend_question_id": "567", "is_new_question": false }, @@ -52323,9 +52974,9 @@ "question__title": "Reshape the Matrix", "question__title_slug": "reshape-the-matrix", "question__hide": false, - "total_acs": 145774, - "total_submitted": 224660, - "total_column_articles": 1321, + "total_acs": 146163, + "total_submitted": 225297, + "total_column_articles": 1324, "frontend_question_id": "566", "is_new_question": false }, @@ -52344,9 +52995,9 @@ "question__title": "Array Nesting", "question__title_slug": "array-nesting", "question__hide": false, - "total_acs": 47718, - "total_submitted": 76513, - "total_column_articles": 451, + "total_acs": 47812, + "total_submitted": 76653, + "total_column_articles": 452, "frontend_question_id": "565", "is_new_question": false }, @@ -52365,8 +53016,8 @@ "question__title": "Find the Closest Palindrome", "question__title_slug": "find-the-closest-palindrome", "question__hide": false, - "total_acs": 24623, - "total_submitted": 80856, + "total_acs": 24645, + "total_submitted": 80905, "total_column_articles": 260, "frontend_question_id": "564", "is_new_question": false @@ -52386,8 +53037,8 @@ "question__title": "Binary Tree Tilt", "question__title_slug": "binary-tree-tilt", "question__hide": false, - "total_acs": 74620, - "total_submitted": 113287, + "total_acs": 74836, + "total_submitted": 113621, "total_column_articles": 757, "frontend_question_id": "563", "is_new_question": false @@ -52407,8 +53058,8 @@ "question__title": "Longest Line of Consecutive One in Matrix", "question__title_slug": "longest-line-of-consecutive-one-in-matrix", "question__hide": false, - "total_acs": 5960, - "total_submitted": 12011, + "total_acs": 5977, + "total_submitted": 12038, "total_column_articles": 101, "frontend_question_id": "562", "is_new_question": false @@ -52428,9 +53079,9 @@ "question__title": "Array Partition", "question__title_slug": "array-partition", "question__hide": false, - "total_acs": 133454, - "total_submitted": 170028, - "total_column_articles": 1108, + "total_acs": 134094, + "total_submitted": 170822, + "total_column_articles": 1115, "frontend_question_id": "561", "is_new_question": false }, @@ -52449,9 +53100,9 @@ "question__title": "Subarray Sum Equals K", "question__title_slug": "subarray-sum-equals-k", "question__hide": false, - "total_acs": 314461, - "total_submitted": 696257, - "total_column_articles": 1821, + "total_acs": 317717, + "total_submitted": 704323, + "total_column_articles": 1838, "frontend_question_id": "560", "is_new_question": false }, @@ -52470,9 +53121,9 @@ "question__title": "Reverse Words in a String III", "question__title_slug": "reverse-words-in-a-string-iii", "question__hide": false, - "total_acs": 303711, - "total_submitted": 411466, - "total_column_articles": 2538, + "total_acs": 304508, + "total_submitted": 412513, + "total_column_articles": 2543, "frontend_question_id": "557", "is_new_question": false }, @@ -52491,9 +53142,9 @@ "question__title": "Next Greater Element III", "question__title_slug": "next-greater-element-iii", "question__hide": false, - "total_acs": 45547, - "total_submitted": 123523, - "total_column_articles": 565, + "total_acs": 45665, + "total_submitted": 123792, + "total_column_articles": 566, "frontend_question_id": "556", "is_new_question": false }, @@ -52512,8 +53163,8 @@ "question__title": "Split Concatenated Strings", "question__title_slug": "split-concatenated-strings", "question__hide": false, - "total_acs": 1696, - "total_submitted": 4521, + "total_acs": 1703, + "total_submitted": 4540, "total_column_articles": 32, "frontend_question_id": "555", "is_new_question": false @@ -52533,9 +53184,9 @@ "question__title": "Brick Wall", "question__title_slug": "brick-wall", "question__hide": false, - "total_acs": 62083, - "total_submitted": 120707, - "total_column_articles": 598, + "total_acs": 62390, + "total_submitted": 121351, + "total_column_articles": 600, "frontend_question_id": "554", "is_new_question": false }, @@ -52554,8 +53205,8 @@ "question__title": "Optimal Division", "question__title_slug": "optimal-division", "question__hide": false, - "total_acs": 31590, - "total_submitted": 48714, + "total_acs": 31679, + "total_submitted": 48869, "total_column_articles": 381, "frontend_question_id": "553", "is_new_question": false @@ -52575,9 +53226,9 @@ "question__title": "Student Attendance Record II", "question__title_slug": "student-attendance-record-ii", "question__hide": false, - "total_acs": 28417, - "total_submitted": 49193, - "total_column_articles": 340, + "total_acs": 28462, + "total_submitted": 49262, + "total_column_articles": 342, "frontend_question_id": "552", "is_new_question": false }, @@ -52596,8 +53247,8 @@ "question__title": "Student Attendance Record I", "question__title_slug": "student-attendance-record-i", "question__hide": false, - "total_acs": 78053, - "total_submitted": 137647, + "total_acs": 78437, + "total_submitted": 138303, "total_column_articles": 982, "frontend_question_id": "551", "is_new_question": false @@ -52617,9 +53268,9 @@ "question__title": "Shortest Path to Get Food", "question__title_slug": "shortest-path-to-get-food", "question__hide": false, - "total_acs": 1700, - "total_submitted": 3217, - "total_column_articles": 40, + "total_acs": 1709, + "total_submitted": 3229, + "total_column_articles": 41, "frontend_question_id": "1730", "is_new_question": false }, @@ -52638,8 +53289,8 @@ "question__title": "Binary Tree Longest Consecutive Sequence II", "question__title_slug": "binary-tree-longest-consecutive-sequence-ii", "question__hide": false, - "total_acs": 4147, - "total_submitted": 8151, + "total_acs": 4213, + "total_submitted": 8304, "total_column_articles": 80, "frontend_question_id": "549", "is_new_question": false @@ -52659,8 +53310,8 @@ "question__title": "Split Array with Equal Sum", "question__title_slug": "split-array-with-equal-sum", "question__hide": false, - "total_acs": 2389, - "total_submitted": 6151, + "total_acs": 2390, + "total_submitted": 6153, "total_column_articles": 54, "frontend_question_id": "548", "is_new_question": false @@ -52680,9 +53331,9 @@ "question__title": "Number of Provinces", "question__title_slug": "number-of-provinces", "question__hide": false, - "total_acs": 267242, - "total_submitted": 429528, - "total_column_articles": 1823, + "total_acs": 268934, + "total_submitted": 432391, + "total_column_articles": 1832, "frontend_question_id": "547", "is_new_question": false }, @@ -52701,9 +53352,9 @@ "question__title": "Remove Boxes", "question__title_slug": "remove-boxes", "question__hide": false, - "total_acs": 18194, - "total_submitted": 29814, - "total_column_articles": 145, + "total_acs": 18231, + "total_submitted": 29903, + "total_column_articles": 147, "frontend_question_id": "546", "is_new_question": false }, @@ -52722,8 +53373,8 @@ "question__title": "Boundary of Binary Tree", "question__title_slug": "boundary-of-binary-tree", "question__hide": false, - "total_acs": 5437, - "total_submitted": 12214, + "total_acs": 5488, + "total_submitted": 12306, "total_column_articles": 99, "frontend_question_id": "545", "is_new_question": false @@ -52743,8 +53394,8 @@ "question__title": "Output Contest Matches", "question__title_slug": "output-contest-matches", "question__hide": false, - "total_acs": 3391, - "total_submitted": 4694, + "total_acs": 3396, + "total_submitted": 4701, "total_column_articles": 72, "frontend_question_id": "544", "is_new_question": false @@ -52764,9 +53415,9 @@ "question__title": "Diameter of Binary Tree", "question__title_slug": "diameter-of-binary-tree", "question__hide": false, - "total_acs": 313894, - "total_submitted": 537384, - "total_column_articles": 2230, + "total_acs": 316591, + "total_submitted": 541672, + "total_column_articles": 2241, "frontend_question_id": "543", "is_new_question": false }, @@ -52785,8 +53436,8 @@ "question__title": "01 Matrix", "question__title_slug": "01-matrix", "question__hide": false, - "total_acs": 132395, - "total_submitted": 284434, + "total_acs": 132847, + "total_submitted": 285378, "total_column_articles": 1103, "frontend_question_id": "542", "is_new_question": false @@ -52806,9 +53457,9 @@ "question__title": "Reverse String II", "question__title_slug": "reverse-string-ii", "question__hide": false, - "total_acs": 195921, - "total_submitted": 336159, - "total_column_articles": 1507, + "total_acs": 198616, + "total_submitted": 340979, + "total_column_articles": 1521, "frontend_question_id": "541", "is_new_question": false }, @@ -52827,9 +53478,9 @@ "question__title": "Single Element in a Sorted Array", "question__title_slug": "single-element-in-a-sorted-array", "question__hide": false, - "total_acs": 115034, - "total_submitted": 190014, - "total_column_articles": 1061, + "total_acs": 115527, + "total_submitted": 190817, + "total_column_articles": 1066, "frontend_question_id": "540", "is_new_question": false }, @@ -52848,8 +53499,8 @@ "question__title": "Minimum Time Difference", "question__title_slug": "minimum-time-difference", "question__hide": false, - "total_acs": 62563, - "total_submitted": 94816, + "total_acs": 62835, + "total_submitted": 95237, "total_column_articles": 670, "frontend_question_id": "539", "is_new_question": false @@ -52869,9 +53520,9 @@ "question__title": "Convert BST to Greater Tree", "question__title_slug": "convert-bst-to-greater-tree", "question__hide": false, - "total_acs": 229092, - "total_submitted": 299895, - "total_column_articles": 1505, + "total_acs": 231072, + "total_submitted": 302219, + "total_column_articles": 1516, "frontend_question_id": "538", "is_new_question": false }, @@ -52890,9 +53541,9 @@ "question__title": "Complex Number Multiplication", "question__title_slug": "complex-number-multiplication", "question__hide": false, - "total_acs": 43975, - "total_submitted": 58968, - "total_column_articles": 661, + "total_acs": 44108, + "total_submitted": 59154, + "total_column_articles": 662, "frontend_question_id": "537", "is_new_question": false }, @@ -52911,8 +53562,8 @@ "question__title": "Construct Binary Tree from String", "question__title_slug": "construct-binary-tree-from-string", "question__hide": false, - "total_acs": 5679, - "total_submitted": 10279, + "total_acs": 5686, + "total_submitted": 10299, "total_column_articles": 97, "frontend_question_id": "536", "is_new_question": false @@ -52932,8 +53583,8 @@ "question__title": "Encode and Decode TinyURL", "question__title_slug": "encode-and-decode-tinyurl", "question__hide": false, - "total_acs": 43866, - "total_submitted": 50123, + "total_acs": 44011, + "total_submitted": 50296, "total_column_articles": 275, "frontend_question_id": "535", "is_new_question": false @@ -52953,8 +53604,8 @@ "question__title": "Lonely Pixel II", "question__title_slug": "lonely-pixel-ii", "question__hide": false, - "total_acs": 2639, - "total_submitted": 4976, + "total_acs": 2650, + "total_submitted": 5005, "total_column_articles": 47, "frontend_question_id": "533", "is_new_question": false @@ -52974,9 +53625,9 @@ "question__title": "K-diff Pairs in an Array", "question__title_slug": "k-diff-pairs-in-an-array", "question__hide": false, - "total_acs": 62105, - "total_submitted": 136444, - "total_column_articles": 704, + "total_acs": 62289, + "total_submitted": 136764, + "total_column_articles": 705, "frontend_question_id": "532", "is_new_question": false }, @@ -52995,8 +53646,8 @@ "question__title": "Lonely Pixel I", "question__title_slug": "lonely-pixel-i", "question__hide": false, - "total_acs": 6083, - "total_submitted": 9465, + "total_acs": 6191, + "total_submitted": 9615, "total_column_articles": 115, "frontend_question_id": "531", "is_new_question": false @@ -53016,9 +53667,9 @@ "question__title": "Minimum Absolute Difference in BST", "question__title_slug": "minimum-absolute-difference-in-bst", "question__hide": false, - "total_acs": 172685, - "total_submitted": 272257, - "total_column_articles": 1132, + "total_acs": 174731, + "total_submitted": 275454, + "total_column_articles": 1141, "frontend_question_id": "530", "is_new_question": false }, @@ -53037,8 +53688,8 @@ "question__title": "Minesweeper", "question__title_slug": "minesweeper", "question__hide": false, - "total_acs": 50611, - "total_submitted": 79121, + "total_acs": 50749, + "total_submitted": 79343, "total_column_articles": 596, "frontend_question_id": "529", "is_new_question": false @@ -53058,9 +53709,9 @@ "question__title": "Swapping Nodes in a Linked List", "question__title_slug": "swapping-nodes-in-a-linked-list", "question__hide": false, - "total_acs": 19210, - "total_submitted": 30095, - "total_column_articles": 289, + "total_acs": 19381, + "total_submitted": 30358, + "total_column_articles": 291, "frontend_question_id": "1721", "is_new_question": false }, @@ -53079,9 +53730,9 @@ "question__title": "Word Abbreviation", "question__title_slug": "word-abbreviation", "question__hide": false, - "total_acs": 2754, - "total_submitted": 4592, - "total_column_articles": 41, + "total_acs": 2759, + "total_submitted": 4598, + "total_column_articles": 42, "frontend_question_id": "527", "is_new_question": false }, @@ -53100,9 +53751,9 @@ "question__title": "Beautiful Arrangement", "question__title_slug": "beautiful-arrangement", "question__hide": false, - "total_acs": 47035, - "total_submitted": 64204, - "total_column_articles": 508, + "total_acs": 47211, + "total_submitted": 64420, + "total_column_articles": 511, "frontend_question_id": "526", "is_new_question": false }, @@ -53121,8 +53772,8 @@ "question__title": "Contiguous Array", "question__title_slug": "contiguous-array", "question__hide": false, - "total_acs": 67649, - "total_submitted": 123776, + "total_acs": 67899, + "total_submitted": 124232, "total_column_articles": 697, "frontend_question_id": "525", "is_new_question": false @@ -53142,9 +53793,9 @@ "question__title": "Longest Word in Dictionary through Deleting", "question__title_slug": "longest-word-in-dictionary-through-deleting", "question__hide": false, - "total_acs": 99724, - "total_submitted": 199285, - "total_column_articles": 968, + "total_acs": 100025, + "total_submitted": 199895, + "total_column_articles": 971, "frontend_question_id": "524", "is_new_question": false }, @@ -53163,9 +53814,9 @@ "question__title": "Continuous Subarray Sum", "question__title_slug": "continuous-subarray-sum", "question__hide": false, - "total_acs": 95452, - "total_submitted": 334857, - "total_column_articles": 775, + "total_acs": 95758, + "total_submitted": 335950, + "total_column_articles": 776, "frontend_question_id": "523", "is_new_question": false }, @@ -53184,8 +53835,8 @@ "question__title": "Longest Uncommon Subsequence II", "question__title_slug": "longest-uncommon-subsequence-ii", "question__hide": false, - "total_acs": 31882, - "total_submitted": 65213, + "total_acs": 31971, + "total_submitted": 65394, "total_column_articles": 362, "frontend_question_id": "522", "is_new_question": false @@ -53205,8 +53856,8 @@ "question__title": "Longest Uncommon Subsequence I", "question__title_slug": "longest-uncommon-subsequence-i", "question__hide": false, - "total_acs": 62896, - "total_submitted": 85359, + "total_acs": 63061, + "total_submitted": 85590, "total_column_articles": 565, "frontend_question_id": "521", "is_new_question": false @@ -53226,9 +53877,9 @@ "question__title": "Detect Capital", "question__title_slug": "detect-capital", "question__hide": false, - "total_acs": 87103, - "total_submitted": 153157, - "total_column_articles": 1311, + "total_acs": 87455, + "total_submitted": 153823, + "total_column_articles": 1315, "frontend_question_id": "520", "is_new_question": false }, @@ -53247,8 +53898,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": 326, - "total_submitted": 698, + "total_acs": 330, + "total_submitted": 704, "total_column_articles": 13, "frontend_question_id": "1983", "is_new_question": false @@ -53268,9 +53919,9 @@ "question__title": "Coin Change II", "question__title_slug": "coin-change-ii", "question__hide": false, - "total_acs": 236648, - "total_submitted": 336212, - "total_column_articles": 1248, + "total_acs": 238794, + "total_submitted": 339090, + "total_column_articles": 1256, "frontend_question_id": "518", "is_new_question": false }, @@ -53289,8 +53940,8 @@ "question__title": "Super Washing Machines", "question__title_slug": "super-washing-machines", "question__hide": false, - "total_acs": 23809, - "total_submitted": 46599, + "total_acs": 23861, + "total_submitted": 46702, "total_column_articles": 185, "frontend_question_id": "517", "is_new_question": false @@ -53310,9 +53961,9 @@ "question__title": "Longest Palindromic Subsequence", "question__title_slug": "longest-palindromic-subsequence", "question__hide": false, - "total_acs": 178070, - "total_submitted": 265210, - "total_column_articles": 1087, + "total_acs": 179887, + "total_submitted": 267816, + "total_column_articles": 1095, "frontend_question_id": "516", "is_new_question": false }, @@ -53331,9 +53982,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": 118640, - "total_submitted": 178720, - "total_column_articles": 1096, + "total_acs": 119626, + "total_submitted": 180150, + "total_column_articles": 1101, "frontend_question_id": "515", "is_new_question": false }, @@ -53352,8 +54003,8 @@ "question__title": "Freedom Trail", "question__title_slug": "freedom-trail", "question__hide": false, - "total_acs": 27432, - "total_submitted": 53347, + "total_acs": 27554, + "total_submitted": 53552, "total_column_articles": 346, "frontend_question_id": "514", "is_new_question": false @@ -53373,9 +54024,9 @@ "question__title": "Find Bottom Left Tree Value", "question__title_slug": "find-bottom-left-tree-value", "question__hide": false, - "total_acs": 182233, - "total_submitted": 247275, - "total_column_articles": 1499, + "total_acs": 184555, + "total_submitted": 250462, + "total_column_articles": 1511, "frontend_question_id": "513", "is_new_question": false }, @@ -53394,8 +54045,8 @@ "question__title": "Maximum Alternating Subarray Sum", "question__title_slug": "maximum-alternating-subarray-sum", "question__hide": false, - "total_acs": 430, - "total_submitted": 1008, + "total_acs": 432, + "total_submitted": 1011, "total_column_articles": 19, "frontend_question_id": "2036", "is_new_question": false @@ -53415,8 +54066,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": 3571, - "total_submitted": 9899, + "total_acs": 3602, + "total_submitted": 10011, "total_column_articles": 55, "frontend_question_id": "1059", "is_new_question": false @@ -53436,8 +54087,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": 666, - "total_submitted": 1229, + "total_acs": 678, + "total_submitted": 1245, "total_column_articles": 21, "frontend_question_id": "2031", "is_new_question": false @@ -53457,8 +54108,8 @@ "question__title": "Inorder Successor in BST II", "question__title_slug": "inorder-successor-in-bst-ii", "question__hide": false, - "total_acs": 5631, - "total_submitted": 9310, + "total_acs": 5650, + "total_submitted": 9343, "total_column_articles": 74, "frontend_question_id": "510", "is_new_question": false @@ -53478,8 +54129,8 @@ "question__title": "Most Frequent Subtree Sum", "question__title_slug": "most-frequent-subtree-sum", "question__hide": false, - "total_acs": 43785, - "total_submitted": 58030, + "total_acs": 43893, + "total_submitted": 58167, "total_column_articles": 564, "frontend_question_id": "508", "is_new_question": false @@ -53499,8 +54150,8 @@ "question__title": "Perfect Number", "question__title_slug": "perfect-number", "question__hide": false, - "total_acs": 75848, - "total_submitted": 154531, + "total_acs": 76168, + "total_submitted": 155181, "total_column_articles": 562, "frontend_question_id": "507", "is_new_question": false @@ -53520,9 +54171,9 @@ "question__title": "Relative Ranks", "question__title_slug": "relative-ranks", "question__hide": false, - "total_acs": 77040, - "total_submitted": 118219, - "total_column_articles": 962, + "total_acs": 77476, + "total_submitted": 119037, + "total_column_articles": 965, "frontend_question_id": "506", "is_new_question": false }, @@ -53541,8 +54192,8 @@ "question__title": "The Maze II", "question__title_slug": "the-maze-ii", "question__hide": false, - "total_acs": 9527, - "total_submitted": 18511, + "total_acs": 9624, + "total_submitted": 18665, "total_column_articles": 114, "frontend_question_id": "505", "is_new_question": false @@ -53562,9 +54213,9 @@ "question__title": "Base 7", "question__title_slug": "base-7", "question__hide": false, - "total_acs": 86127, - "total_submitted": 166267, - "total_column_articles": 834, + "total_acs": 86444, + "total_submitted": 166943, + "total_column_articles": 836, "frontend_question_id": "504", "is_new_question": false }, @@ -53583,9 +54234,9 @@ "question__title": "Next Greater Element II", "question__title_slug": "next-greater-element-ii", "question__hide": false, - "total_acs": 195985, - "total_submitted": 293760, - "total_column_articles": 1580, + "total_acs": 197563, + "total_submitted": 296007, + "total_column_articles": 1587, "frontend_question_id": "503", "is_new_question": false }, @@ -53604,8 +54255,8 @@ "question__title": "IPO", "question__title_slug": "ipo", "question__hide": false, - "total_acs": 35217, - "total_submitted": 78402, + "total_acs": 35462, + "total_submitted": 79196, "total_column_articles": 424, "frontend_question_id": "502", "is_new_question": false @@ -53625,9 +54276,9 @@ "question__title": "Find Mode in Binary Search Tree", "question__title_slug": "find-mode-in-binary-search-tree", "question__hide": false, - "total_acs": 154731, - "total_submitted": 283919, - "total_column_articles": 1052, + "total_acs": 156637, + "total_submitted": 287123, + "total_column_articles": 1064, "frontend_question_id": "501", "is_new_question": false }, @@ -53646,9 +54297,9 @@ "question__title": "Keyboard Row", "question__title_slug": "keyboard-row", "question__hide": false, - "total_acs": 69565, - "total_submitted": 93790, - "total_column_articles": 1018, + "total_acs": 69870, + "total_submitted": 94284, + "total_column_articles": 1021, "frontend_question_id": "500", "is_new_question": false }, @@ -53667,9 +54318,9 @@ "question__title": "The Maze III", "question__title_slug": "the-maze-iii", "question__hide": false, - "total_acs": 4490, - "total_submitted": 10533, - "total_column_articles": 86, + "total_acs": 4541, + "total_submitted": 10620, + "total_column_articles": 87, "frontend_question_id": "499", "is_new_question": false }, @@ -53688,9 +54339,9 @@ "question__title": "Diagonal Traverse", "question__title_slug": "diagonal-traverse", "question__hide": false, - "total_acs": 106043, - "total_submitted": 190038, - "total_column_articles": 1106, + "total_acs": 106533, + "total_submitted": 190811, + "total_column_articles": 1112, "frontend_question_id": "498", "is_new_question": false }, @@ -53709,9 +54360,9 @@ "question__title": "Next Greater Element I", "question__title_slug": "next-greater-element-i", "question__hide": false, - "total_acs": 257958, - "total_submitted": 359409, - "total_column_articles": 2333, + "total_acs": 259944, + "total_submitted": 362177, + "total_column_articles": 2342, "frontend_question_id": "496", "is_new_question": false }, @@ -53730,9 +54381,9 @@ "question__title": "Teemo Attacking", "question__title_slug": "teemo-attacking", "question__hide": false, - "total_acs": 92587, - "total_submitted": 155682, - "total_column_articles": 1262, + "total_acs": 93100, + "total_submitted": 156574, + "total_column_articles": 1267, "frontend_question_id": "495", "is_new_question": false }, @@ -53751,9 +54402,9 @@ "question__title": "Target Sum", "question__title_slug": "target-sum", "question__hide": false, - "total_acs": 344152, - "total_submitted": 706542, - "total_column_articles": 1932, + "total_acs": 347548, + "total_submitted": 713595, + "total_column_articles": 1945, "frontend_question_id": "494", "is_new_question": false }, @@ -53772,9 +54423,9 @@ "question__title": "Reverse Pairs", "question__title_slug": "reverse-pairs", "question__hide": false, - "total_acs": 39725, - "total_submitted": 108977, - "total_column_articles": 393, + "total_acs": 39958, + "total_submitted": 109556, + "total_column_articles": 394, "frontend_question_id": "493", "is_new_question": false }, @@ -53793,9 +54444,9 @@ "question__title": "Construct the Rectangle", "question__title_slug": "construct-the-rectangle", "question__hide": false, - "total_acs": 56674, - "total_submitted": 92641, - "total_column_articles": 529, + "total_acs": 56866, + "total_submitted": 92942, + "total_column_articles": 530, "frontend_question_id": "492", "is_new_question": false }, @@ -53814,9 +54465,9 @@ "question__title": "Non-decreasing Subsequences", "question__title_slug": "non-decreasing-subsequences", "question__hide": false, - "total_acs": 131889, - "total_submitted": 252561, - "total_column_articles": 870, + "total_acs": 133615, + "total_submitted": 256042, + "total_column_articles": 875, "frontend_question_id": "491", "is_new_question": false }, @@ -53835,8 +54486,8 @@ "question__title": "The Maze", "question__title_slug": "the-maze", "question__hide": false, - "total_acs": 11469, - "total_submitted": 22910, + "total_acs": 11531, + "total_submitted": 23005, "total_column_articles": 135, "frontend_question_id": "490", "is_new_question": false @@ -53856,8 +54507,8 @@ "question__title": "Kth Smallest Instructions", "question__title_slug": "kth-smallest-instructions", "question__hide": false, - "total_acs": 3298, - "total_submitted": 6895, + "total_acs": 3312, + "total_submitted": 6925, "total_column_articles": 74, "frontend_question_id": "1643", "is_new_question": false @@ -53877,8 +54528,8 @@ "question__title": "Zuma Game", "question__title_slug": "zuma-game", "question__hide": false, - "total_acs": 20105, - "total_submitted": 41255, + "total_acs": 20131, + "total_submitted": 41382, "total_column_articles": 187, "frontend_question_id": "488", "is_new_question": false @@ -53898,9 +54549,9 @@ "question__title": "Max Consecutive Ones II", "question__title_slug": "max-consecutive-ones-ii", "question__hide": false, - "total_acs": 13326, - "total_submitted": 22987, - "total_column_articles": 227, + "total_acs": 13452, + "total_submitted": 23220, + "total_column_articles": 228, "frontend_question_id": "487", "is_new_question": false }, @@ -53919,8 +54570,8 @@ "question__title": "Predict the Winner", "question__title_slug": "predict-the-winner", "question__hide": false, - "total_acs": 67604, - "total_submitted": 113717, + "total_acs": 67869, + "total_submitted": 114151, "total_column_articles": 558, "frontend_question_id": "486", "is_new_question": false @@ -53940,9 +54591,9 @@ "question__title": "Max Consecutive Ones", "question__title_slug": "max-consecutive-ones", "question__hide": false, - "total_acs": 198608, - "total_submitted": 325083, - "total_column_articles": 1576, + "total_acs": 199629, + "total_submitted": 326769, + "total_column_articles": 1583, "frontend_question_id": "485", "is_new_question": false }, @@ -53961,9 +54612,9 @@ "question__title": "Find Permutation", "question__title_slug": "find-permutation", "question__hide": false, - "total_acs": 2622, - "total_submitted": 4337, - "total_column_articles": 52, + "total_acs": 2668, + "total_submitted": 4410, + "total_column_articles": 55, "frontend_question_id": "484", "is_new_question": false }, @@ -53982,8 +54633,8 @@ "question__title": "Smallest Good Base", "question__title_slug": "smallest-good-base", "question__hide": false, - "total_acs": 19109, - "total_submitted": 32289, + "total_acs": 19139, + "total_submitted": 32361, "total_column_articles": 144, "frontend_question_id": "483", "is_new_question": false @@ -54003,9 +54654,9 @@ "question__title": "License Key Formatting", "question__title_slug": "license-key-formatting", "question__hide": false, - "total_acs": 55882, - "total_submitted": 119490, - "total_column_articles": 585, + "total_acs": 56172, + "total_submitted": 120209, + "total_column_articles": 589, "frontend_question_id": "482", "is_new_question": false }, @@ -54024,8 +54675,8 @@ "question__title": "Magical String", "question__title_slug": "magical-string", "question__hide": false, - "total_acs": 35225, - "total_submitted": 54886, + "total_acs": 35305, + "total_submitted": 55016, "total_column_articles": 470, "frontend_question_id": "481", "is_new_question": false @@ -54045,8 +54696,8 @@ "question__title": "Sliding Window Median", "question__title_slug": "sliding-window-median", "question__hide": false, - "total_acs": 39066, - "total_submitted": 88240, + "total_acs": 39173, + "total_submitted": 88575, "total_column_articles": 517, "frontend_question_id": "480", "is_new_question": false @@ -54066,8 +54717,8 @@ "question__title": "Largest Palindrome Product", "question__title_slug": "largest-palindrome-product", "question__hide": false, - "total_acs": 23026, - "total_submitted": 36820, + "total_acs": 23069, + "total_submitted": 36890, "total_column_articles": 172, "frontend_question_id": "479", "is_new_question": false @@ -54087,9 +54738,9 @@ "question__title": "Total Hamming Distance", "question__title_slug": "total-hamming-distance", "question__hide": false, - "total_acs": 45700, - "total_submitted": 75381, - "total_column_articles": 386, + "total_acs": 45800, + "total_submitted": 75536, + "total_column_articles": 388, "frontend_question_id": "477", "is_new_question": false }, @@ -54108,9 +54759,9 @@ "question__title": "Number Complement", "question__title_slug": "number-complement", "question__hide": false, - "total_acs": 81107, - "total_submitted": 116415, - "total_column_articles": 1081, + "total_acs": 81389, + "total_submitted": 116824, + "total_column_articles": 1085, "frontend_question_id": "476", "is_new_question": false }, @@ -54129,9 +54780,9 @@ "question__title": "Heaters", "question__title_slug": "heaters", "question__hide": false, - "total_acs": 69431, - "total_submitted": 169373, - "total_column_articles": 700, + "total_acs": 69618, + "total_submitted": 169776, + "total_column_articles": 703, "frontend_question_id": "475", "is_new_question": false }, @@ -54150,9 +54801,9 @@ "question__title": "Ones and Zeroes", "question__title_slug": "ones-and-zeroes", "question__hide": false, - "total_acs": 156038, - "total_submitted": 240240, - "total_column_articles": 1045, + "total_acs": 157718, + "total_submitted": 242504, + "total_column_articles": 1051, "frontend_question_id": "474", "is_new_question": false }, @@ -54171,9 +54822,9 @@ "question__title": "Matchsticks to Square", "question__title_slug": "matchsticks-to-square", "question__hide": false, - "total_acs": 70209, - "total_submitted": 150555, - "total_column_articles": 523, + "total_acs": 70445, + "total_submitted": 151062, + "total_column_articles": 524, "frontend_question_id": "473", "is_new_question": false }, @@ -54192,8 +54843,8 @@ "question__title": "Concatenated Words", "question__title_slug": "concatenated-words", "question__hide": false, - "total_acs": 26944, - "total_submitted": 51803, + "total_acs": 27004, + "total_submitted": 51931, "total_column_articles": 265, "frontend_question_id": "472", "is_new_question": false @@ -54213,8 +54864,8 @@ "question__title": "Encode String with Shortest Length", "question__title_slug": "encode-string-with-shortest-length", "question__hide": false, - "total_acs": 2565, - "total_submitted": 4300, + "total_acs": 2571, + "total_submitted": 4318, "total_column_articles": 43, "frontend_question_id": "471", "is_new_question": false @@ -54234,8 +54885,8 @@ "question__title": "Convex Polygon", "question__title_slug": "convex-polygon", "question__hide": false, - "total_acs": 2553, - "total_submitted": 5930, + "total_acs": 2559, + "total_submitted": 5947, "total_column_articles": 36, "frontend_question_id": "469", "is_new_question": false @@ -54255,9 +54906,9 @@ "question__title": "Validate IP Address", "question__title_slug": "validate-ip-address", "question__hide": false, - "total_acs": 62323, - "total_submitted": 221358, - "total_column_articles": 714, + "total_acs": 62545, + "total_submitted": 222268, + "total_column_articles": 716, "frontend_question_id": "468", "is_new_question": false }, @@ -54276,8 +54927,8 @@ "question__title": "Unique Substrings in Wraparound String", "question__title_slug": "unique-substrings-in-wraparound-string", "question__hide": false, - "total_acs": 36850, - "total_submitted": 71171, + "total_acs": 36983, + "total_submitted": 71400, "total_column_articles": 371, "frontend_question_id": "467", "is_new_question": false @@ -54297,8 +54948,8 @@ "question__title": "Count The Repetitions", "question__title_slug": "count-the-repetitions", "question__hide": false, - "total_acs": 13685, - "total_submitted": 36390, + "total_acs": 13720, + "total_submitted": 36490, "total_column_articles": 204, "frontend_question_id": "466", "is_new_question": false @@ -54318,8 +54969,8 @@ "question__title": "Optimal Account Balancing", "question__title_slug": "optimal-account-balancing", "question__hide": false, - "total_acs": 2663, - "total_submitted": 4898, + "total_acs": 2668, + "total_submitted": 4907, "total_column_articles": 42, "frontend_question_id": "465", "is_new_question": false @@ -54339,8 +54990,8 @@ "question__title": "Can I Win", "question__title_slug": "can-i-win", "question__hide": false, - "total_acs": 37860, - "total_submitted": 91709, + "total_acs": 37992, + "total_submitted": 92085, "total_column_articles": 289, "frontend_question_id": "464", "is_new_question": false @@ -54360,9 +55011,9 @@ "question__title": "Island Perimeter", "question__title_slug": "island-perimeter", "question__hide": false, - "total_acs": 128154, - "total_submitted": 182914, - "total_column_articles": 1400, + "total_acs": 129023, + "total_submitted": 184249, + "total_column_articles": 1405, "frontend_question_id": "463", "is_new_question": false }, @@ -54381,9 +55032,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": 51783, - "total_submitted": 82982, - "total_column_articles": 524, + "total_acs": 51912, + "total_submitted": 83178, + "total_column_articles": 525, "frontend_question_id": "462", "is_new_question": false }, @@ -54402,9 +55053,9 @@ "question__title": "Hamming Distance", "question__title_slug": "hamming-distance", "question__hide": false, - "total_acs": 276129, - "total_submitted": 337270, - "total_column_articles": 2054, + "total_acs": 277372, + "total_submitted": 338804, + "total_column_articles": 2061, "frontend_question_id": "461", "is_new_question": false }, @@ -54423,9 +55074,9 @@ "question__title": "LFU Cache", "question__title_slug": "lfu-cache", "question__hide": false, - "total_acs": 63089, - "total_submitted": 141168, - "total_column_articles": 635, + "total_acs": 63472, + "total_submitted": 141874, + "total_column_articles": 637, "frontend_question_id": "460", "is_new_question": false }, @@ -54444,9 +55095,9 @@ "question__title": "Repeated Substring Pattern", "question__title_slug": "repeated-substring-pattern", "question__hide": false, - "total_acs": 184253, - "total_submitted": 360229, - "total_column_articles": 1274, + "total_acs": 186303, + "total_submitted": 364025, + "total_column_articles": 1279, "frontend_question_id": "459", "is_new_question": false }, @@ -54465,8 +55116,8 @@ "question__title": "Poor Pigs", "question__title_slug": "poor-pigs", "question__hide": false, - "total_acs": 26870, - "total_submitted": 39600, + "total_acs": 26917, + "total_submitted": 39699, "total_column_articles": 243, "frontend_question_id": "458", "is_new_question": false @@ -54486,9 +55137,9 @@ "question__title": "Circular Array Loop", "question__title_slug": "circular-array-loop", "question__hide": false, - "total_acs": 35245, - "total_submitted": 81217, - "total_column_articles": 370, + "total_acs": 35340, + "total_submitted": 81434, + "total_column_articles": 372, "frontend_question_id": "457", "is_new_question": false }, @@ -54507,9 +55158,9 @@ "question__title": "132 Pattern", "question__title_slug": "132-pattern", "question__hide": false, - "total_acs": 75262, - "total_submitted": 206683, - "total_column_articles": 611, + "total_acs": 75426, + "total_submitted": 207136, + "total_column_articles": 613, "frontend_question_id": "456", "is_new_question": false }, @@ -54528,9 +55179,9 @@ "question__title": "Assign Cookies", "question__title_slug": "assign-cookies", "question__hide": false, - "total_acs": 313185, - "total_submitted": 554229, - "total_column_articles": 2233, + "total_acs": 316231, + "total_submitted": 559856, + "total_column_articles": 2255, "frontend_question_id": "455", "is_new_question": false }, @@ -54549,9 +55200,9 @@ "question__title": "4Sum II", "question__title_slug": "4sum-ii", "question__hide": false, - "total_acs": 196642, - "total_submitted": 306595, - "total_column_articles": 1150, + "total_acs": 198861, + "total_submitted": 309976, + "total_column_articles": 1168, "frontend_question_id": "454", "is_new_question": false }, @@ -54570,9 +55221,9 @@ "question__title": "Minimum Moves to Equal Array Elements", "question__title_slug": "minimum-moves-to-equal-array-elements", "question__hide": false, - "total_acs": 75003, - "total_submitted": 122298, - "total_column_articles": 861, + "total_acs": 75281, + "total_submitted": 122672, + "total_column_articles": 862, "frontend_question_id": "453", "is_new_question": false }, @@ -54591,9 +55242,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": 197899, - "total_submitted": 390293, - "total_column_articles": 1470, + "total_acs": 200346, + "total_submitted": 395144, + "total_column_articles": 1487, "frontend_question_id": "452", "is_new_question": false }, @@ -54612,9 +55263,9 @@ "question__title": "Sort Characters By Frequency", "question__title_slug": "sort-characters-by-frequency", "question__hide": false, - "total_acs": 124425, - "total_submitted": 172687, - "total_column_articles": 1314, + "total_acs": 125123, + "total_submitted": 173666, + "total_column_articles": 1319, "frontend_question_id": "451", "is_new_question": false }, @@ -54633,9 +55284,9 @@ "question__title": "Delete Node in a BST", "question__title_slug": "delete-node-in-a-bst", "question__hide": false, - "total_acs": 200620, - "total_submitted": 383036, - "total_column_articles": 1903, + "total_acs": 202604, + "total_submitted": 386831, + "total_column_articles": 1919, "frontend_question_id": "450", "is_new_question": false }, @@ -54654,8 +55305,8 @@ "question__title": "Serialize and Deserialize BST", "question__title_slug": "serialize-and-deserialize-bst", "question__hide": false, - "total_acs": 48325, - "total_submitted": 79849, + "total_acs": 48451, + "total_submitted": 80070, "total_column_articles": 432, "frontend_question_id": "449", "is_new_question": false @@ -54675,9 +55326,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": 276607, - "total_submitted": 419795, - "total_column_articles": 1919, + "total_acs": 278195, + "total_submitted": 422201, + "total_column_articles": 1921, "frontend_question_id": "448", "is_new_question": false }, @@ -54696,8 +55347,8 @@ "question__title": "Number of Boomerangs", "question__title_slug": "number-of-boomerangs", "question__hide": false, - "total_acs": 55404, - "total_submitted": 83037, + "total_acs": 55479, + "total_submitted": 83161, "total_column_articles": 431, "frontend_question_id": "447", "is_new_question": false @@ -54717,9 +55368,9 @@ "question__title": "Arithmetic Slices II - Subsequence", "question__title_slug": "arithmetic-slices-ii-subsequence", "question__hide": false, - "total_acs": 23661, - "total_submitted": 43117, - "total_column_articles": 205, + "total_acs": 23721, + "total_submitted": 43208, + "total_column_articles": 206, "frontend_question_id": "446", "is_new_question": false }, @@ -54738,8 +55389,8 @@ "question__title": "Add Two Numbers II", "question__title_slug": "add-two-numbers-ii", "question__hide": false, - "total_acs": 121185, - "total_submitted": 201265, + "total_acs": 121738, + "total_submitted": 202159, "total_column_articles": 1291, "frontend_question_id": "445", "is_new_question": false @@ -54759,8 +55410,8 @@ "question__title": "Sequence Reconstruction", "question__title_slug": "sequence-reconstruction", "question__hide": false, - "total_acs": 5753, - "total_submitted": 18449, + "total_acs": 5788, + "total_submitted": 18530, "total_column_articles": 86, "frontend_question_id": "444", "is_new_question": false @@ -54780,9 +55431,9 @@ "question__title": "String Compression", "question__title_slug": "string-compression", "question__hide": false, - "total_acs": 77966, - "total_submitted": 162600, - "total_column_articles": 868, + "total_acs": 78553, + "total_submitted": 163817, + "total_column_articles": 872, "frontend_question_id": "443", "is_new_question": false }, @@ -54801,9 +55452,9 @@ "question__title": "Find All Duplicates in an Array", "question__title_slug": "find-all-duplicates-in-an-array", "question__hide": false, - "total_acs": 108119, - "total_submitted": 143933, - "total_column_articles": 1012, + "total_acs": 108501, + "total_submitted": 144435, + "total_column_articles": 1013, "frontend_question_id": "442", "is_new_question": false }, @@ -54822,9 +55473,9 @@ "question__title": "Arranging Coins", "question__title_slug": "arranging-coins", "question__hide": false, - "total_acs": 118729, - "total_submitted": 262255, - "total_column_articles": 1109, + "total_acs": 119224, + "total_submitted": 263404, + "total_column_articles": 1112, "frontend_question_id": "441", "is_new_question": false }, @@ -54843,8 +55494,8 @@ "question__title": "K-th Smallest in Lexicographical Order", "question__title_slug": "k-th-smallest-in-lexicographical-order", "question__hide": false, - "total_acs": 48164, - "total_submitted": 113133, + "total_acs": 48256, + "total_submitted": 113391, "total_column_articles": 302, "frontend_question_id": "440", "is_new_question": false @@ -54864,9 +55515,9 @@ "question__title": "Ternary Expression Parser", "question__title_slug": "ternary-expression-parser", "question__hide": false, - "total_acs": 4101, - "total_submitted": 6768, - "total_column_articles": 98, + "total_acs": 4162, + "total_submitted": 6851, + "total_column_articles": 99, "frontend_question_id": "439", "is_new_question": false }, @@ -54885,9 +55536,9 @@ "question__title": "Find All Anagrams in a String", "question__title_slug": "find-all-anagrams-in-a-string", "question__hide": false, - "total_acs": 281298, - "total_submitted": 513222, - "total_column_articles": 2104, + "total_acs": 285332, + "total_submitted": 521187, + "total_column_articles": 2122, "frontend_question_id": "438", "is_new_question": false }, @@ -54906,9 +55557,9 @@ "question__title": "Path Sum III", "question__title_slug": "path-sum-iii", "question__hide": false, - "total_acs": 222986, - "total_submitted": 440204, - "total_column_articles": 1494, + "total_acs": 224881, + "total_submitted": 444784, + "total_column_articles": 1500, "frontend_question_id": "437", "is_new_question": false }, @@ -54927,9 +55578,9 @@ "question__title": "Find Right Interval", "question__title_slug": "find-right-interval", "question__hide": false, - "total_acs": 43979, - "total_submitted": 77291, - "total_column_articles": 566, + "total_acs": 44214, + "total_submitted": 77704, + "total_column_articles": 567, "frontend_question_id": "436", "is_new_question": false }, @@ -54948,9 +55599,9 @@ "question__title": "Non-overlapping Intervals", "question__title_slug": "non-overlapping-intervals", "question__hide": false, - "total_acs": 215534, - "total_submitted": 421603, - "total_column_articles": 1587, + "total_acs": 217835, + "total_submitted": 426091, + "total_column_articles": 1607, "frontend_question_id": "435", "is_new_question": false }, @@ -54969,9 +55620,9 @@ "question__title": "Number of Segments in a String", "question__title_slug": "number-of-segments-in-a-string", "question__hide": false, - "total_acs": 89558, - "total_submitted": 231265, - "total_column_articles": 1137, + "total_acs": 90084, + "total_submitted": 232819, + "total_column_articles": 1141, "frontend_question_id": "434", "is_new_question": false }, @@ -54990,9 +55641,9 @@ "question__title": "Minimum Genetic Mutation", "question__title_slug": "minimum-genetic-mutation", "question__hide": false, - "total_acs": 50940, - "total_submitted": 92711, - "total_column_articles": 728, + "total_acs": 51242, + "total_submitted": 93343, + "total_column_articles": 731, "frontend_question_id": "433", "is_new_question": false }, @@ -55011,9 +55662,9 @@ "question__title": "All O`one Data Structure", "question__title_slug": "all-oone-data-structure", "question__hide": false, - "total_acs": 28423, - "total_submitted": 60622, - "total_column_articles": 299, + "total_acs": 28581, + "total_submitted": 60909, + "total_column_articles": 301, "frontend_question_id": "432", "is_new_question": false }, @@ -55032,8 +55683,8 @@ "question__title": "Word Squares", "question__title_slug": "word-squares", "question__hide": false, - "total_acs": 2402, - "total_submitted": 3840, + "total_acs": 2408, + "total_submitted": 3846, "total_column_articles": 48, "frontend_question_id": "425", "is_new_question": false @@ -55053,9 +55704,9 @@ "question__title": "Longest Repeating Character Replacement", "question__title_slug": "longest-repeating-character-replacement", "question__hide": false, - "total_acs": 86637, - "total_submitted": 158450, - "total_column_articles": 738, + "total_acs": 86972, + "total_submitted": 159109, + "total_column_articles": 739, "frontend_question_id": "424", "is_new_question": false }, @@ -55074,9 +55725,9 @@ "question__title": "Reconstruct Original Digits from English", "question__title_slug": "reconstruct-original-digits-from-english", "question__hide": false, - "total_acs": 38918, - "total_submitted": 64022, - "total_column_articles": 452, + "total_acs": 39040, + "total_submitted": 64236, + "total_column_articles": 453, "frontend_question_id": "423", "is_new_question": false }, @@ -55095,9 +55746,9 @@ "question__title": "Valid Word Square", "question__title_slug": "valid-word-square", "question__hide": false, - "total_acs": 3625, - "total_submitted": 8289, - "total_column_articles": 90, + "total_acs": 3701, + "total_submitted": 8457, + "total_column_articles": 92, "frontend_question_id": "422", "is_new_question": false }, @@ -55116,8 +55767,8 @@ "question__title": "Maximum XOR of Two Numbers in an Array", "question__title_slug": "maximum-xor-of-two-numbers-in-an-array", "question__hide": false, - "total_acs": 44492, - "total_submitted": 72598, + "total_acs": 44630, + "total_submitted": 72883, "total_column_articles": 417, "frontend_question_id": "421", "is_new_question": false @@ -55137,9 +55788,9 @@ "question__title": "Strong Password Checker", "question__title_slug": "strong-password-checker", "question__hide": false, - "total_acs": 18258, - "total_submitted": 46548, - "total_column_articles": 163, + "total_acs": 18298, + "total_submitted": 46693, + "total_column_articles": 162, "frontend_question_id": "420", "is_new_question": false }, @@ -55158,9 +55809,9 @@ "question__title": "Battleships in a Board", "question__title_slug": "battleships-in-a-board", "question__hide": false, - "total_acs": 43883, - "total_submitted": 56188, - "total_column_articles": 554, + "total_acs": 44089, + "total_submitted": 56475, + "total_column_articles": 556, "frontend_question_id": "419", "is_new_question": false }, @@ -55179,8 +55830,8 @@ "question__title": "Sentence Screen Fitting", "question__title_slug": "sentence-screen-fitting", "question__hide": false, - "total_acs": 3852, - "total_submitted": 9870, + "total_acs": 3866, + "total_submitted": 9903, "total_column_articles": 58, "frontend_question_id": "418", "is_new_question": false @@ -55200,9 +55851,9 @@ "question__title": "Pacific Atlantic Water Flow", "question__title_slug": "pacific-atlantic-water-flow", "question__hide": false, - "total_acs": 81524, - "total_submitted": 145276, - "total_column_articles": 827, + "total_acs": 81937, + "total_submitted": 145908, + "total_column_articles": 834, "frontend_question_id": "417", "is_new_question": false }, @@ -55221,9 +55872,9 @@ "question__title": "Partition Equal Subset Sum", "question__title_slug": "partition-equal-subset-sum", "question__hide": false, - "total_acs": 406804, - "total_submitted": 780218, - "total_column_articles": 2026, + "total_acs": 410839, + "total_submitted": 787772, + "total_column_articles": 2037, "frontend_question_id": "416", "is_new_question": false }, @@ -55242,9 +55893,9 @@ "question__title": "Add Strings", "question__title_slug": "add-strings", "question__hide": false, - "total_acs": 262372, - "total_submitted": 479349, - "total_column_articles": 1703, + "total_acs": 263782, + "total_submitted": 482100, + "total_column_articles": 1707, "frontend_question_id": "415", "is_new_question": false }, @@ -55263,9 +55914,9 @@ "question__title": "Third Maximum Number", "question__title_slug": "third-maximum-number", "question__hide": false, - "total_acs": 140062, - "total_submitted": 352980, - "total_column_articles": 1665, + "total_acs": 140875, + "total_submitted": 355019, + "total_column_articles": 1667, "frontend_question_id": "414", "is_new_question": false }, @@ -55284,9 +55935,9 @@ "question__title": "Arithmetic Slices", "question__title_slug": "arithmetic-slices", "question__hide": false, - "total_acs": 118686, - "total_submitted": 170693, - "total_column_articles": 1459, + "total_acs": 119068, + "total_submitted": 171258, + "total_column_articles": 1464, "frontend_question_id": "413", "is_new_question": false }, @@ -55305,9 +55956,9 @@ "question__title": "Fizz Buzz", "question__title_slug": "fizz-buzz", "question__hide": false, - "total_acs": 193381, - "total_submitted": 280806, - "total_column_articles": 1215, + "total_acs": 194955, + "total_submitted": 283016, + "total_column_articles": 1226, "frontend_question_id": "412", "is_new_question": false }, @@ -55326,8 +55977,8 @@ "question__title": "Minimum Unique Word Abbreviation", "question__title_slug": "minimum-unique-word-abbreviation", "question__hide": false, - "total_acs": 1522, - "total_submitted": 3073, + "total_acs": 1525, + "total_submitted": 3078, "total_column_articles": 33, "frontend_question_id": "411", "is_new_question": false @@ -55347,9 +55998,9 @@ "question__title": "Split Array Largest Sum", "question__title_slug": "split-array-largest-sum", "question__hide": false, - "total_acs": 66177, - "total_submitted": 111842, - "total_column_articles": 524, + "total_acs": 66531, + "total_submitted": 112432, + "total_column_articles": 526, "frontend_question_id": "410", "is_new_question": false }, @@ -55368,9 +56019,9 @@ "question__title": "Longest Palindrome", "question__title_slug": "longest-palindrome", "question__hide": false, - "total_acs": 171983, - "total_submitted": 308342, - "total_column_articles": 2035, + "total_acs": 172838, + "total_submitted": 309855, + "total_column_articles": 2040, "frontend_question_id": "409", "is_new_question": false }, @@ -55389,8 +56040,8 @@ "question__title": "Valid Word Abbreviation", "question__title_slug": "valid-word-abbreviation", "question__hide": false, - "total_acs": 6242, - "total_submitted": 17719, + "total_acs": 6296, + "total_submitted": 17820, "total_column_articles": 123, "frontend_question_id": "408", "is_new_question": false @@ -55410,9 +56061,9 @@ "question__title": "Trapping Rain Water II", "question__title_slug": "trapping-rain-water-ii", "question__hide": false, - "total_acs": 33867, - "total_submitted": 58607, - "total_column_articles": 305, + "total_acs": 33998, + "total_submitted": 58830, + "total_column_articles": 306, "frontend_question_id": "407", "is_new_question": false }, @@ -55431,9 +56082,9 @@ "question__title": "Queue Reconstruction by Height", "question__title_slug": "queue-reconstruction-by-height", "question__hide": false, - "total_acs": 241633, - "total_submitted": 316993, - "total_column_articles": 1395, + "total_acs": 243936, + "total_submitted": 319812, + "total_column_articles": 1413, "frontend_question_id": "406", "is_new_question": false }, @@ -55452,9 +56103,9 @@ "question__title": "Convert a Number to Hexadecimal", "question__title_slug": "convert-a-number-to-hexadecimal", "question__hide": false, - "total_acs": 64498, - "total_submitted": 117821, - "total_column_articles": 628, + "total_acs": 64757, + "total_submitted": 118384, + "total_column_articles": 631, "frontend_question_id": "405", "is_new_question": false }, @@ -55473,9 +56124,9 @@ "question__title": "Sum of Left Leaves", "question__title_slug": "sum-of-left-leaves", "question__hide": false, - "total_acs": 231729, - "total_submitted": 372204, - "total_column_articles": 2024, + "total_acs": 234270, + "total_submitted": 376082, + "total_column_articles": 2037, "frontend_question_id": "404", "is_new_question": false }, @@ -55494,9 +56145,9 @@ "question__title": "Frog Jump", "question__title_slug": "frog-jump", "question__hide": false, - "total_acs": 60988, - "total_submitted": 132509, - "total_column_articles": 569, + "total_acs": 61157, + "total_submitted": 132854, + "total_column_articles": 572, "frontend_question_id": "403", "is_new_question": false }, @@ -55515,9 +56166,9 @@ "question__title": "Remove K Digits", "question__title_slug": "remove-k-digits", "question__hide": false, - "total_acs": 133731, - "total_submitted": 419906, - "total_column_articles": 932, + "total_acs": 134496, + "total_submitted": 422753, + "total_column_articles": 936, "frontend_question_id": "402", "is_new_question": false }, @@ -55536,9 +56187,9 @@ "question__title": "Binary Watch", "question__title_slug": "binary-watch", "question__hide": false, - "total_acs": 71437, - "total_submitted": 114242, - "total_column_articles": 875, + "total_acs": 71689, + "total_submitted": 114625, + "total_column_articles": 876, "frontend_question_id": "401", "is_new_question": false }, @@ -55557,9 +56208,9 @@ "question__title": "Nth Digit", "question__title_slug": "nth-digit", "question__hide": false, - "total_acs": 57270, - "total_submitted": 125533, - "total_column_articles": 624, + "total_acs": 57529, + "total_submitted": 126116, + "total_column_articles": 627, "frontend_question_id": "400", "is_new_question": false }, @@ -55578,9 +56229,9 @@ "question__title": "Evaluate Division", "question__title_slug": "evaluate-division", "question__hide": false, - "total_acs": 75545, - "total_submitted": 127556, - "total_column_articles": 861, + "total_acs": 76148, + "total_submitted": 128508, + "total_column_articles": 868, "frontend_question_id": "399", "is_new_question": false }, @@ -55599,9 +56250,9 @@ "question__title": "Random Pick Index", "question__title_slug": "random-pick-index", "question__hide": false, - "total_acs": 57106, - "total_submitted": 81521, - "total_column_articles": 472, + "total_acs": 57236, + "total_submitted": 81798, + "total_column_articles": 474, "frontend_question_id": "398", "is_new_question": false }, @@ -55620,9 +56271,9 @@ "question__title": "Integer Replacement", "question__title_slug": "integer-replacement", "question__hide": false, - "total_acs": 65942, - "total_submitted": 155356, - "total_column_articles": 692, + "total_acs": 66273, + "total_submitted": 156129, + "total_column_articles": 696, "frontend_question_id": "397", "is_new_question": false }, @@ -55641,8 +56292,8 @@ "question__title": "Rotate Function", "question__title_slug": "rotate-function", "question__hide": false, - "total_acs": 49481, - "total_submitted": 92781, + "total_acs": 49640, + "total_submitted": 93140, "total_column_articles": 602, "frontend_question_id": "396", "is_new_question": false @@ -55662,8 +56313,8 @@ "question__title": "Longest Substring with At Least K Repeating Characters", "question__title_slug": "longest-substring-with-at-least-k-repeating-characters", "question__hide": false, - "total_acs": 83144, - "total_submitted": 158297, + "total_acs": 83501, + "total_submitted": 159002, "total_column_articles": 654, "frontend_question_id": "395", "is_new_question": false @@ -55683,9 +56334,9 @@ "question__title": "Decode String", "question__title_slug": "decode-string", "question__hide": false, - "total_acs": 236340, - "total_submitted": 417143, - "total_column_articles": 2171, + "total_acs": 238339, + "total_submitted": 420378, + "total_column_articles": 2190, "frontend_question_id": "394", "is_new_question": false }, @@ -55704,9 +56355,9 @@ "question__title": "UTF-8 Validation", "question__title_slug": "utf-8-validation", "question__hide": false, - "total_acs": 38577, - "total_submitted": 88378, - "total_column_articles": 486, + "total_acs": 38747, + "total_submitted": 88668, + "total_column_articles": 487, "frontend_question_id": "393", "is_new_question": false }, @@ -55725,9 +56376,9 @@ "question__title": "Is Subsequence", "question__title_slug": "is-subsequence", "question__hide": false, - "total_acs": 293128, - "total_submitted": 559021, - "total_column_articles": 2681, + "total_acs": 296413, + "total_submitted": 565091, + "total_column_articles": 2698, "frontend_question_id": "392", "is_new_question": false }, @@ -55746,9 +56397,9 @@ "question__title": "Perfect Rectangle", "question__title_slug": "perfect-rectangle", "question__hide": false, - "total_acs": 26687, - "total_submitted": 57875, - "total_column_articles": 319, + "total_acs": 26747, + "total_submitted": 58041, + "total_column_articles": 320, "frontend_question_id": "391", "is_new_question": false }, @@ -55767,9 +56418,9 @@ "question__title": "Elimination Game", "question__title_slug": "elimination-game", "question__hide": false, - "total_acs": 36694, - "total_submitted": 60936, - "total_column_articles": 466, + "total_acs": 36812, + "total_submitted": 61160, + "total_column_articles": 468, "frontend_question_id": "390", "is_new_question": false }, @@ -55788,9 +56439,9 @@ "question__title": "Find the Difference", "question__title_slug": "find-the-difference", "question__hide": false, - "total_acs": 162054, - "total_submitted": 242060, - "total_column_articles": 1606, + "total_acs": 163015, + "total_submitted": 243683, + "total_column_articles": 1612, "frontend_question_id": "389", "is_new_question": false }, @@ -55809,9 +56460,9 @@ "question__title": "Longest Absolute File Path", "question__title_slug": "longest-absolute-file-path", "question__hide": false, - "total_acs": 34101, - "total_submitted": 53449, - "total_column_articles": 525, + "total_acs": 34201, + "total_submitted": 53623, + "total_column_articles": 526, "frontend_question_id": "388", "is_new_question": false }, @@ -55830,9 +56481,9 @@ "question__title": "First Unique Character in a String", "question__title_slug": "first-unique-character-in-a-string", "question__hide": false, - "total_acs": 381824, - "total_submitted": 683420, - "total_column_articles": 2121, + "total_acs": 383658, + "total_submitted": 686547, + "total_column_articles": 2131, "frontend_question_id": "387", "is_new_question": false }, @@ -55851,9 +56502,9 @@ "question__title": "Lexicographical Numbers", "question__title_slug": "lexicographical-numbers", "question__hide": false, - "total_acs": 70414, - "total_submitted": 94144, - "total_column_articles": 666, + "total_acs": 70619, + "total_submitted": 94425, + "total_column_articles": 667, "frontend_question_id": "386", "is_new_question": false }, @@ -55872,9 +56523,9 @@ "question__title": "Mini Parser", "question__title_slug": "mini-parser", "question__hide": false, - "total_acs": 31362, - "total_submitted": 57213, - "total_column_articles": 300, + "total_acs": 31453, + "total_submitted": 57396, + "total_column_articles": 302, "frontend_question_id": "385", "is_new_question": false }, @@ -55893,9 +56544,9 @@ "question__title": "Shuffle an Array", "question__title_slug": "shuffle-an-array", "question__hide": false, - "total_acs": 122387, - "total_submitted": 198814, - "total_column_articles": 589, + "total_acs": 122899, + "total_submitted": 199607, + "total_column_articles": 597, "frontend_question_id": "384", "is_new_question": false }, @@ -55914,9 +56565,9 @@ "question__title": "Ransom Note", "question__title_slug": "ransom-note", "question__hide": false, - "total_acs": 329944, - "total_submitted": 545802, - "total_column_articles": 2895, + "total_acs": 333870, + "total_submitted": 551898, + "total_column_articles": 2921, "frontend_question_id": "383", "is_new_question": false }, @@ -55935,9 +56586,9 @@ "question__title": "Linked List Random Node", "question__title_slug": "linked-list-random-node", "question__hide": false, - "total_acs": 61076, - "total_submitted": 83887, - "total_column_articles": 452, + "total_acs": 61376, + "total_submitted": 84285, + "total_column_articles": 453, "frontend_question_id": "382", "is_new_question": false }, @@ -55956,8 +56607,8 @@ "question__title": "Insert Delete GetRandom O(1) - Duplicates allowed", "question__title_slug": "insert-delete-getrandom-o1-duplicates-allowed", "question__hide": false, - "total_acs": 26162, - "total_submitted": 61685, + "total_acs": 26219, + "total_submitted": 61851, "total_column_articles": 238, "frontend_question_id": "381", "is_new_question": false @@ -55977,9 +56628,9 @@ "question__title": "Insert Delete GetRandom O(1)", "question__title_slug": "insert-delete-getrandom-o1", "question__hide": false, - "total_acs": 103261, - "total_submitted": 196056, - "total_column_articles": 1646, + "total_acs": 104544, + "total_submitted": 198428, + "total_column_articles": 1654, "frontend_question_id": "380", "is_new_question": false }, @@ -55998,9 +56649,9 @@ "question__title": "Design Phone Directory", "question__title_slug": "design-phone-directory", "question__hide": false, - "total_acs": 5609, - "total_submitted": 9144, - "total_column_articles": 114, + "total_acs": 5633, + "total_submitted": 9184, + "total_column_articles": 115, "frontend_question_id": "379", "is_new_question": false }, @@ -56019,9 +56670,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": 120589, - "total_submitted": 189744, - "total_column_articles": 827, + "total_acs": 121013, + "total_submitted": 190418, + "total_column_articles": 831, "frontend_question_id": "378", "is_new_question": false }, @@ -56040,9 +56691,9 @@ "question__title": "Combination Sum IV", "question__title_slug": "combination-sum-iv", "question__hide": false, - "total_acs": 140705, - "total_submitted": 265912, - "total_column_articles": 936, + "total_acs": 142229, + "total_submitted": 268789, + "total_column_articles": 949, "frontend_question_id": "377", "is_new_question": false }, @@ -56061,9 +56712,9 @@ "question__title": "Wiggle Subsequence", "question__title_slug": "wiggle-subsequence", "question__hide": false, - "total_acs": 177761, - "total_submitted": 378727, - "total_column_articles": 1518, + "total_acs": 179917, + "total_submitted": 383655, + "total_column_articles": 1537, "frontend_question_id": "376", "is_new_question": false }, @@ -56082,9 +56733,9 @@ "question__title": "Guess Number Higher or Lower II", "question__title_slug": "guess-number-higher-or-lower-ii", "question__hide": false, - "total_acs": 44795, - "total_submitted": 71875, - "total_column_articles": 342, + "total_acs": 44951, + "total_submitted": 72081, + "total_column_articles": 347, "frontend_question_id": "375", "is_new_question": false }, @@ -56103,9 +56754,9 @@ "question__title": "Guess Number Higher or Lower", "question__title_slug": "guess-number-higher-or-lower", "question__hide": false, - "total_acs": 157055, - "total_submitted": 301203, - "total_column_articles": 996, + "total_acs": 158041, + "total_submitted": 303096, + "total_column_articles": 1001, "frontend_question_id": "374", "is_new_question": false }, @@ -56124,9 +56775,9 @@ "question__title": "Find K Pairs with Smallest Sums", "question__title_slug": "find-k-pairs-with-smallest-sums", "question__hide": false, - "total_acs": 57698, - "total_submitted": 141820, - "total_column_articles": 531, + "total_acs": 58063, + "total_submitted": 142723, + "total_column_articles": 533, "frontend_question_id": "373", "is_new_question": false }, @@ -56145,9 +56796,9 @@ "question__title": "Super Pow", "question__title_slug": "super-pow", "question__hide": false, - "total_acs": 45636, - "total_submitted": 79752, - "total_column_articles": 504, + "total_acs": 45783, + "total_submitted": 80031, + "total_column_articles": 506, "frontend_question_id": "372", "is_new_question": false }, @@ -56166,9 +56817,9 @@ "question__title": "Sum of Two Integers", "question__title_slug": "sum-of-two-integers", "question__hide": false, - "total_acs": 107015, - "total_submitted": 173926, - "total_column_articles": 680, + "total_acs": 107423, + "total_submitted": 174568, + "total_column_articles": 682, "frontend_question_id": "371", "is_new_question": false }, @@ -56187,8 +56838,8 @@ "question__title": "Range Addition", "question__title_slug": "range-addition", "question__hide": false, - "total_acs": 12007, - "total_submitted": 15662, + "total_acs": 12089, + "total_submitted": 15775, "total_column_articles": 273, "frontend_question_id": "370", "is_new_question": false @@ -56208,9 +56859,9 @@ "question__title": "Plus One Linked List", "question__title_slug": "plus-one-linked-list", "question__hide": false, - "total_acs": 8099, - "total_submitted": 12766, - "total_column_articles": 219, + "total_acs": 8200, + "total_submitted": 12906, + "total_column_articles": 222, "frontend_question_id": "369", "is_new_question": false }, @@ -56229,9 +56880,9 @@ "question__title": "Largest Divisible Subset", "question__title_slug": "largest-divisible-subset", "question__hide": false, - "total_acs": 56125, - "total_submitted": 122214, - "total_column_articles": 585, + "total_acs": 56311, + "total_submitted": 122628, + "total_column_articles": 587, "frontend_question_id": "368", "is_new_question": false }, @@ -56250,9 +56901,9 @@ "question__title": "Valid Perfect Square", "question__title_slug": "valid-perfect-square", "question__hide": false, - "total_acs": 221719, - "total_submitted": 495102, - "total_column_articles": 1654, + "total_acs": 223179, + "total_submitted": 498245, + "total_column_articles": 1656, "frontend_question_id": "367", "is_new_question": false }, @@ -56271,8 +56922,8 @@ "question__title": "Find Leaves of Binary Tree", "question__title_slug": "find-leaves-of-binary-tree", "question__hide": false, - "total_acs": 9027, - "total_submitted": 11310, + "total_acs": 9103, + "total_submitted": 11395, "total_column_articles": 210, "frontend_question_id": "366", "is_new_question": false @@ -56292,8 +56943,8 @@ "question__title": "Water and Jug Problem", "question__title_slug": "water-and-jug-problem", "question__hide": false, - "total_acs": 47210, - "total_submitted": 118794, + "total_acs": 47373, + "total_submitted": 119103, "total_column_articles": 605, "frontend_question_id": "365", "is_new_question": false @@ -56313,8 +56964,8 @@ "question__title": "Nested List Weight Sum II", "question__title_slug": "nested-list-weight-sum-ii", "question__hide": false, - "total_acs": 3234, - "total_submitted": 4785, + "total_acs": 3248, + "total_submitted": 4809, "total_column_articles": 76, "frontend_question_id": "364", "is_new_question": false @@ -56334,9 +56985,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": 41023, - "total_submitted": 85134, - "total_column_articles": 265, + "total_acs": 41111, + "total_submitted": 85339, + "total_column_articles": 266, "frontend_question_id": "363", "is_new_question": false }, @@ -56355,9 +57006,9 @@ "question__title": "Design Hit Counter", "question__title_slug": "design-hit-counter", "question__hide": false, - "total_acs": 6650, - "total_submitted": 9666, - "total_column_articles": 122, + "total_acs": 6683, + "total_submitted": 9707, + "total_column_articles": 124, "frontend_question_id": "362", "is_new_question": false }, @@ -56376,8 +57027,8 @@ "question__title": "Bomb Enemy", "question__title_slug": "bomb-enemy", "question__hide": false, - "total_acs": 5848, - "total_submitted": 9813, + "total_acs": 5883, + "total_submitted": 9868, "total_column_articles": 106, "frontend_question_id": "361", "is_new_question": false @@ -56397,8 +57048,8 @@ "question__title": "Sort Transformed Array", "question__title_slug": "sort-transformed-array", "question__hide": false, - "total_acs": 5017, - "total_submitted": 8050, + "total_acs": 5051, + "total_submitted": 8101, "total_column_articles": 90, "frontend_question_id": "360", "is_new_question": false @@ -56418,9 +57069,9 @@ "question__title": "Logger Rate Limiter", "question__title_slug": "logger-rate-limiter", "question__hide": false, - "total_acs": 8292, - "total_submitted": 11118, - "total_column_articles": 101, + "total_acs": 8334, + "total_submitted": 11166, + "total_column_articles": 102, "frontend_question_id": "359", "is_new_question": false }, @@ -56439,8 +57090,8 @@ "question__title": "Rearrange String k Distance Apart", "question__title_slug": "rearrange-string-k-distance-apart", "question__hide": false, - "total_acs": 6682, - "total_submitted": 18279, + "total_acs": 6713, + "total_submitted": 18338, "total_column_articles": 90, "frontend_question_id": "358", "is_new_question": false @@ -56460,9 +57111,9 @@ "question__title": "Count Numbers with Unique Digits", "question__title_slug": "count-numbers-with-unique-digits", "question__hide": false, - "total_acs": 67799, - "total_submitted": 112177, - "total_column_articles": 930, + "total_acs": 67980, + "total_submitted": 112452, + "total_column_articles": 932, "frontend_question_id": "357", "is_new_question": false }, @@ -56481,8 +57132,8 @@ "question__title": "Line Reflection", "question__title_slug": "line-reflection", "question__hide": false, - "total_acs": 2555, - "total_submitted": 6943, + "total_acs": 2566, + "total_submitted": 6965, "total_column_articles": 61, "frontend_question_id": "356", "is_new_question": false @@ -56502,9 +57153,9 @@ "question__title": "Design Twitter", "question__title_slug": "design-twitter", "question__hide": false, - "total_acs": 42018, - "total_submitted": 102254, - "total_column_articles": 693, + "total_acs": 42199, + "total_submitted": 102669, + "total_column_articles": 694, "frontend_question_id": "355", "is_new_question": false }, @@ -56523,9 +57174,9 @@ "question__title": "Russian Doll Envelopes", "question__title_slug": "russian-doll-envelopes", "question__hide": false, - "total_acs": 101282, - "total_submitted": 266565, - "total_column_articles": 827, + "total_acs": 101758, + "total_submitted": 268502, + "total_column_articles": 829, "frontend_question_id": "354", "is_new_question": false }, @@ -56544,9 +57195,9 @@ "question__title": "Design Snake Game", "question__title_slug": "design-snake-game", "question__hide": false, - "total_acs": 4183, - "total_submitted": 9596, - "total_column_articles": 82, + "total_acs": 4207, + "total_submitted": 9662, + "total_column_articles": 83, "frontend_question_id": "353", "is_new_question": false }, @@ -56565,8 +57216,8 @@ "question__title": "Data Stream as Disjoint Intervals", "question__title_slug": "data-stream-as-disjoint-intervals", "question__hide": false, - "total_acs": 25159, - "total_submitted": 37370, + "total_acs": 25193, + "total_submitted": 37423, "total_column_articles": 410, "frontend_question_id": "352", "is_new_question": false @@ -56586,8 +57237,8 @@ "question__title": "Android Unlock Patterns", "question__title_slug": "android-unlock-patterns", "question__hide": false, - "total_acs": 7375, - "total_submitted": 12033, + "total_acs": 7393, + "total_submitted": 12058, "total_column_articles": 133, "frontend_question_id": "351", "is_new_question": false @@ -56607,9 +57258,9 @@ "question__title": "Intersection of Two Arrays II", "question__title_slug": "intersection-of-two-arrays-ii", "question__hide": false, - "total_acs": 472225, - "total_submitted": 829553, - "total_column_articles": 2778, + "total_acs": 474467, + "total_submitted": 833271, + "total_column_articles": 2788, "frontend_question_id": "350", "is_new_question": false }, @@ -56628,9 +57279,9 @@ "question__title": "Intersection of Two Arrays", "question__title_slug": "intersection-of-two-arrays", "question__hide": false, - "total_acs": 434156, - "total_submitted": 584543, - "total_column_articles": 2828, + "total_acs": 438251, + "total_submitted": 589920, + "total_column_articles": 2851, "frontend_question_id": "349", "is_new_question": false }, @@ -56649,9 +57300,9 @@ "question__title": "Design Tic-Tac-Toe", "question__title_slug": "design-tic-tac-toe", "question__hide": false, - "total_acs": 9225, - "total_submitted": 15518, - "total_column_articles": 132, + "total_acs": 9270, + "total_submitted": 15590, + "total_column_articles": 133, "frontend_question_id": "348", "is_new_question": false }, @@ -56670,9 +57321,9 @@ "question__title": "Top K Frequent Elements", "question__title_slug": "top-k-frequent-elements", "question__hide": false, - "total_acs": 422230, - "total_submitted": 664866, - "total_column_articles": 2841, + "total_acs": 426172, + "total_submitted": 670944, + "total_column_articles": 2867, "frontend_question_id": "347", "is_new_question": false }, @@ -56691,9 +57342,9 @@ "question__title": "Moving Average from Data Stream", "question__title_slug": "moving-average-from-data-stream", "question__hide": false, - "total_acs": 19355, - "total_submitted": 26857, - "total_column_articles": 202, + "total_acs": 19468, + "total_submitted": 26986, + "total_column_articles": 206, "frontend_question_id": "346", "is_new_question": false }, @@ -56712,9 +57363,9 @@ "question__title": "Reverse Vowels of a String", "question__title_slug": "reverse-vowels-of-a-string", "question__hide": false, - "total_acs": 157237, - "total_submitted": 288994, - "total_column_articles": 1398, + "total_acs": 158286, + "total_submitted": 290840, + "total_column_articles": 1406, "frontend_question_id": "345", "is_new_question": false }, @@ -56733,9 +57384,9 @@ "question__title": "Reverse String", "question__title_slug": "reverse-string", "question__hide": false, - "total_acs": 735783, - "total_submitted": 924058, - "total_column_articles": 3638, + "total_acs": 740736, + "total_submitted": 930022, + "total_column_articles": 3654, "frontend_question_id": "344", "is_new_question": false }, @@ -56754,9 +57405,9 @@ "question__title": "Integer Break", "question__title_slug": "integer-break", "question__hide": false, - "total_acs": 254389, - "total_submitted": 408921, - "total_column_articles": 1882, + "total_acs": 256857, + "total_submitted": 412834, + "total_column_articles": 1894, "frontend_question_id": "343", "is_new_question": false }, @@ -56775,9 +57426,9 @@ "question__title": "Power of Four", "question__title_slug": "power-of-four", "question__hide": false, - "total_acs": 128764, - "total_submitted": 243797, - "total_column_articles": 1076, + "total_acs": 129409, + "total_submitted": 244948, + "total_column_articles": 1081, "frontend_question_id": "342", "is_new_question": false }, @@ -56796,9 +57447,9 @@ "question__title": "Flatten Nested List Iterator", "question__title_slug": "flatten-nested-list-iterator", "question__hide": false, - "total_acs": 74213, - "total_submitted": 101985, - "total_column_articles": 659, + "total_acs": 74488, + "total_submitted": 102361, + "total_column_articles": 660, "frontend_question_id": "341", "is_new_question": false }, @@ -56817,8 +57468,8 @@ "question__title": "Longest Substring with At Most K Distinct Characters", "question__title_slug": "longest-substring-with-at-most-k-distinct-characters", "question__hide": false, - "total_acs": 24630, - "total_submitted": 48277, + "total_acs": 24799, + "total_submitted": 48594, "total_column_articles": 302, "frontend_question_id": "340", "is_new_question": false @@ -56838,8 +57489,8 @@ "question__title": "Nested List Weight Sum", "question__title_slug": "nested-list-weight-sum", "question__hide": false, - "total_acs": 6044, - "total_submitted": 7272, + "total_acs": 6062, + "total_submitted": 7291, "total_column_articles": 82, "frontend_question_id": "339", "is_new_question": false @@ -56859,9 +57510,9 @@ "question__title": "Counting Bits", "question__title_slug": "counting-bits", "question__hide": false, - "total_acs": 290349, - "total_submitted": 369144, - "total_column_articles": 2186, + "total_acs": 292148, + "total_submitted": 371431, + "total_column_articles": 2194, "frontend_question_id": "338", "is_new_question": false }, @@ -56880,9 +57531,9 @@ "question__title": "House Robber III", "question__title_slug": "house-robber-iii", "question__hide": false, - "total_acs": 268954, - "total_submitted": 440444, - "total_column_articles": 1707, + "total_acs": 271209, + "total_submitted": 444077, + "total_column_articles": 1716, "frontend_question_id": "337", "is_new_question": false }, @@ -56901,9 +57552,9 @@ "question__title": "Palindrome Pairs", "question__title_slug": "palindrome-pairs", "question__hide": false, - "total_acs": 27205, - "total_submitted": 71176, - "total_column_articles": 240, + "total_acs": 27272, + "total_submitted": 71348, + "total_column_articles": 241, "frontend_question_id": "336", "is_new_question": false }, @@ -56922,8 +57573,8 @@ "question__title": "Self Crossing", "question__title_slug": "self-crossing", "question__hide": false, - "total_acs": 18445, - "total_submitted": 43423, + "total_acs": 18482, + "total_submitted": 43528, "total_column_articles": 165, "frontend_question_id": "335", "is_new_question": false @@ -56943,9 +57594,9 @@ "question__title": "Increasing Triplet Subsequence", "question__title_slug": "increasing-triplet-subsequence", "question__hide": false, - "total_acs": 121484, - "total_submitted": 280854, - "total_column_articles": 797, + "total_acs": 122297, + "total_submitted": 282729, + "total_column_articles": 801, "frontend_question_id": "334", "is_new_question": false }, @@ -56964,8 +57615,8 @@ "question__title": "Largest BST Subtree", "question__title_slug": "largest-bst-subtree", "question__hide": false, - "total_acs": 8753, - "total_submitted": 17988, + "total_acs": 8810, + "total_submitted": 18092, "total_column_articles": 143, "frontend_question_id": "333", "is_new_question": false @@ -56985,9 +57636,9 @@ "question__title": "Reconstruct Itinerary", "question__title_slug": "reconstruct-itinerary", "question__hide": false, - "total_acs": 84578, - "total_submitted": 177347, - "total_column_articles": 591, + "total_acs": 85564, + "total_submitted": 179247, + "total_column_articles": 595, "frontend_question_id": "332", "is_new_question": false }, @@ -57006,9 +57657,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": 59321, - "total_submitted": 123182, - "total_column_articles": 642, + "total_acs": 59476, + "total_submitted": 123513, + "total_column_articles": 643, "frontend_question_id": "331", "is_new_question": false }, @@ -57027,8 +57678,8 @@ "question__title": "Patching Array", "question__title_slug": "patching-array", "question__hide": false, - "total_acs": 23106, - "total_submitted": 43717, + "total_acs": 23169, + "total_submitted": 43824, "total_column_articles": 190, "frontend_question_id": "330", "is_new_question": false @@ -57048,9 +57699,9 @@ "question__title": "Longest Increasing Path in a Matrix", "question__title_slug": "longest-increasing-path-in-a-matrix", "question__hide": false, - "total_acs": 95692, - "total_submitted": 185075, - "total_column_articles": 830, + "total_acs": 96140, + "total_submitted": 185931, + "total_column_articles": 832, "frontend_question_id": "329", "is_new_question": false }, @@ -57069,9 +57720,9 @@ "question__title": "Odd Even Linked List", "question__title_slug": "odd-even-linked-list", "question__hide": false, - "total_acs": 202828, - "total_submitted": 311721, - "total_column_articles": 1562, + "total_acs": 203950, + "total_submitted": 313497, + "total_column_articles": 1567, "frontend_question_id": "328", "is_new_question": false }, @@ -57090,9 +57741,9 @@ "question__title": "Count of Range Sum", "question__title_slug": "count-of-range-sum", "question__hide": false, - "total_acs": 40361, - "total_submitted": 98735, - "total_column_articles": 345, + "total_acs": 40615, + "total_submitted": 99444, + "total_column_articles": 346, "frontend_question_id": "327", "is_new_question": false }, @@ -57111,9 +57762,9 @@ "question__title": "Power of Three", "question__title_slug": "power-of-three", "question__hide": false, - "total_acs": 204695, - "total_submitted": 402223, - "total_column_articles": 903, + "total_acs": 205832, + "total_submitted": 404365, + "total_column_articles": 905, "frontend_question_id": "326", "is_new_question": false }, @@ -57132,8 +57783,8 @@ "question__title": "Maximum Size Subarray Sum Equals k", "question__title_slug": "maximum-size-subarray-sum-equals-k", "question__hide": false, - "total_acs": 16858, - "total_submitted": 32602, + "total_acs": 16903, + "total_submitted": 32702, "total_column_articles": 188, "frontend_question_id": "325", "is_new_question": false @@ -57153,9 +57804,9 @@ "question__title": "Wiggle Sort II", "question__title_slug": "wiggle-sort-ii", "question__hide": false, - "total_acs": 61657, - "total_submitted": 150600, - "total_column_articles": 390, + "total_acs": 61887, + "total_submitted": 151242, + "total_column_articles": 393, "frontend_question_id": "324", "is_new_question": false }, @@ -57174,8 +57825,8 @@ "question__title": "Number of Connected Components in an Undirected Graph", "question__title_slug": "number-of-connected-components-in-an-undirected-graph", "question__hide": false, - "total_acs": 22813, - "total_submitted": 34808, + "total_acs": 22927, + "total_submitted": 34976, "total_column_articles": 332, "frontend_question_id": "323", "is_new_question": false @@ -57195,9 +57846,9 @@ "question__title": "Coin Change", "question__title_slug": "coin-change", "question__hide": false, - "total_acs": 620184, - "total_submitted": 1337450, - "total_column_articles": 3556, + "total_acs": 625131, + "total_submitted": 1347544, + "total_column_articles": 3566, "frontend_question_id": "322", "is_new_question": false }, @@ -57216,8 +57867,8 @@ "question__title": "Create Maximum Number", "question__title_slug": "create-maximum-number", "question__hide": false, - "total_acs": 35624, - "total_submitted": 84745, + "total_acs": 35724, + "total_submitted": 85033, "total_column_articles": 297, "frontend_question_id": "321", "is_new_question": false @@ -57237,8 +57888,8 @@ "question__title": "Generalized Abbreviation", "question__title_slug": "generalized-abbreviation", "question__hide": false, - "total_acs": 4645, - "total_submitted": 6633, + "total_acs": 4656, + "total_submitted": 6647, "total_column_articles": 81, "frontend_question_id": "320", "is_new_question": false @@ -57258,9 +57909,9 @@ "question__title": "Bulb Switcher", "question__title_slug": "bulb-switcher", "question__hide": false, - "total_acs": 60321, - "total_submitted": 104586, - "total_column_articles": 535, + "total_acs": 60515, + "total_submitted": 104925, + "total_column_articles": 536, "frontend_question_id": "319", "is_new_question": false }, @@ -57279,8 +57930,8 @@ "question__title": "Maximum Product of Word Lengths", "question__title_slug": "maximum-product-of-word-lengths", "question__hide": false, - "total_acs": 66744, - "total_submitted": 91697, + "total_acs": 66975, + "total_submitted": 92095, "total_column_articles": 612, "frontend_question_id": "318", "is_new_question": false @@ -57300,8 +57951,8 @@ "question__title": "Shortest Distance from All Buildings", "question__title_slug": "shortest-distance-from-all-buildings", "question__hide": false, - "total_acs": 7199, - "total_submitted": 15089, + "total_acs": 7219, + "total_submitted": 15150, "total_column_articles": 94, "frontend_question_id": "317", "is_new_question": false @@ -57321,8 +57972,8 @@ "question__title": "Remove Duplicate Letters", "question__title_slug": "remove-duplicate-letters", "question__hide": false, - "total_acs": 115670, - "total_submitted": 239510, + "total_acs": 116400, + "total_submitted": 241015, "total_column_articles": 879, "frontend_question_id": "316", "is_new_question": false @@ -57342,9 +57993,9 @@ "question__title": "Count of Smaller Numbers After Self", "question__title_slug": "count-of-smaller-numbers-after-self", "question__hide": false, - "total_acs": 81570, - "total_submitted": 188076, - "total_column_articles": 795, + "total_acs": 82009, + "total_submitted": 189091, + "total_column_articles": 798, "frontend_question_id": "315", "is_new_question": false }, @@ -57363,8 +58014,8 @@ "question__title": "Binary Tree Vertical Order Traversal", "question__title_slug": "binary-tree-vertical-order-traversal", "question__hide": false, - "total_acs": 10091, - "total_submitted": 18146, + "total_acs": 10168, + "total_submitted": 18289, "total_column_articles": 165, "frontend_question_id": "314", "is_new_question": false @@ -57384,9 +58035,9 @@ "question__title": "Super Ugly Number", "question__title_slug": "super-ugly-number", "question__hide": false, - "total_acs": 57968, - "total_submitted": 101766, - "total_column_articles": 500, + "total_acs": 58164, + "total_submitted": 102231, + "total_column_articles": 501, "frontend_question_id": "313", "is_new_question": false }, @@ -57405,9 +58056,9 @@ "question__title": "Burst Balloons", "question__title_slug": "burst-balloons", "question__hide": false, - "total_acs": 103075, - "total_submitted": 147411, - "total_column_articles": 650, + "total_acs": 103693, + "total_submitted": 148286, + "total_column_articles": 654, "frontend_question_id": "312", "is_new_question": false }, @@ -57426,8 +58077,8 @@ "question__title": "Sparse Matrix Multiplication", "question__title_slug": "sparse-matrix-multiplication", "question__hide": false, - "total_acs": 6625, - "total_submitted": 8719, + "total_acs": 6731, + "total_submitted": 8861, "total_column_articles": 82, "frontend_question_id": "311", "is_new_question": false @@ -57447,9 +58098,9 @@ "question__title": "Minimum Height Trees", "question__title_slug": "minimum-height-trees", "question__hide": false, - "total_acs": 58967, - "total_submitted": 138085, - "total_column_articles": 471, + "total_acs": 59191, + "total_submitted": 138788, + "total_column_articles": 473, "frontend_question_id": "310", "is_new_question": false }, @@ -57468,9 +58119,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": 251844, - "total_submitted": 392662, - "total_column_articles": 1867, + "total_acs": 253912, + "total_submitted": 395786, + "total_column_articles": 1879, "frontend_question_id": "309", "is_new_question": false }, @@ -57489,8 +58140,8 @@ "question__title": "Range Sum Query 2D - Mutable", "question__title_slug": "range-sum-query-2d-mutable", "question__hide": false, - "total_acs": 4061, - "total_submitted": 6334, + "total_acs": 4075, + "total_submitted": 6353, "total_column_articles": 82, "frontend_question_id": "308", "is_new_question": false @@ -57510,9 +58161,9 @@ "question__title": "Range Sum Query - Mutable", "question__title_slug": "range-sum-query-mutable", "question__hide": false, - "total_acs": 65913, - "total_submitted": 126785, - "total_column_articles": 592, + "total_acs": 66119, + "total_submitted": 127123, + "total_column_articles": 593, "frontend_question_id": "307", "is_new_question": false }, @@ -57531,9 +58182,9 @@ "question__title": "Additive Number", "question__title_slug": "additive-number", "question__hide": false, - "total_acs": 48004, - "total_submitted": 126935, - "total_column_articles": 680, + "total_acs": 48174, + "total_submitted": 127404, + "total_column_articles": 682, "frontend_question_id": "306", "is_new_question": false }, @@ -57552,8 +58203,8 @@ "question__title": "Number of Islands II", "question__title_slug": "number-of-islands-ii", "question__hide": false, - "total_acs": 9095, - "total_submitted": 21624, + "total_acs": 9138, + "total_submitted": 21719, "total_column_articles": 126, "frontend_question_id": "305", "is_new_question": false @@ -57573,9 +58224,9 @@ "question__title": "Range Sum Query 2D - Immutable", "question__title_slug": "range-sum-query-2d-immutable", "question__hide": false, - "total_acs": 123657, - "total_submitted": 201400, - "total_column_articles": 1335, + "total_acs": 124324, + "total_submitted": 202382, + "total_column_articles": 1338, "frontend_question_id": "304", "is_new_question": false }, @@ -57594,9 +58245,9 @@ "question__title": "Range Sum Query - Immutable", "question__title_slug": "range-sum-query-immutable", "question__hide": false, - "total_acs": 215282, - "total_submitted": 280761, - "total_column_articles": 2124, + "total_acs": 216459, + "total_submitted": 282180, + "total_column_articles": 2133, "frontend_question_id": "303", "is_new_question": false }, @@ -57615,8 +58266,8 @@ "question__title": "Smallest Rectangle Enclosing Black Pixels", "question__title_slug": "smallest-rectangle-enclosing-black-pixels", "question__hide": false, - "total_acs": 3773, - "total_submitted": 5563, + "total_acs": 3786, + "total_submitted": 5604, "total_column_articles": 65, "frontend_question_id": "302", "is_new_question": false @@ -57636,9 +58287,9 @@ "question__title": "Remove Invalid Parentheses", "question__title_slug": "remove-invalid-parentheses", "question__hide": false, - "total_acs": 95895, - "total_submitted": 173526, - "total_column_articles": 581, + "total_acs": 96465, + "total_submitted": 174569, + "total_column_articles": 585, "frontend_question_id": "301", "is_new_question": false }, @@ -57657,9 +58308,9 @@ "question__title": "Longest Increasing Subsequence", "question__title_slug": "longest-increasing-subsequence", "question__hide": false, - "total_acs": 724541, - "total_submitted": 1324246, - "total_column_articles": 4279, + "total_acs": 730001, + "total_submitted": 1333815, + "total_column_articles": 4297, "frontend_question_id": "300", "is_new_question": false }, @@ -57678,9 +58329,9 @@ "question__title": "Bulls and Cows", "question__title_slug": "bulls-and-cows", "question__hide": false, - "total_acs": 81927, - "total_submitted": 142808, - "total_column_articles": 894, + "total_acs": 82236, + "total_submitted": 143378, + "total_column_articles": 895, "frontend_question_id": "299", "is_new_question": false }, @@ -57699,9 +58350,9 @@ "question__title": "Binary Tree Longest Consecutive Sequence", "question__title_slug": "binary-tree-longest-consecutive-sequence", "question__hide": false, - "total_acs": 9409, - "total_submitted": 15645, - "total_column_articles": 140, + "total_acs": 9488, + "total_submitted": 15781, + "total_column_articles": 141, "frontend_question_id": "298", "is_new_question": false }, @@ -57720,9 +58371,9 @@ "question__title": "Serialize and Deserialize Binary Tree", "question__title_slug": "serialize-and-deserialize-binary-tree", "question__hide": false, - "total_acs": 211961, - "total_submitted": 360209, - "total_column_articles": 1334, + "total_acs": 213223, + "total_submitted": 362146, + "total_column_articles": 1340, "frontend_question_id": "297", "is_new_question": false }, @@ -57741,9 +58392,9 @@ "question__title": "Best Meeting Point", "question__title_slug": "best-meeting-point", "question__hide": false, - "total_acs": 4234, - "total_submitted": 6921, - "total_column_articles": 66, + "total_acs": 4249, + "total_submitted": 6941, + "total_column_articles": 67, "frontend_question_id": "296", "is_new_question": false }, @@ -57762,9 +58413,9 @@ "question__title": "Find Median from Data Stream", "question__title_slug": "find-median-from-data-stream", "question__hide": false, - "total_acs": 105936, - "total_submitted": 198639, - "total_column_articles": 759, + "total_acs": 106650, + "total_submitted": 199989, + "total_column_articles": 761, "frontend_question_id": "295", "is_new_question": false }, @@ -57783,8 +58434,8 @@ "question__title": "Flip Game II", "question__title_slug": "flip-game-ii", "question__hide": false, - "total_acs": 6367, - "total_submitted": 10662, + "total_acs": 6393, + "total_submitted": 10731, "total_column_articles": 87, "frontend_question_id": "294", "is_new_question": false @@ -57804,9 +58455,9 @@ "question__title": "Flip Game", "question__title_slug": "flip-game", "question__hide": false, - "total_acs": 7891, - "total_submitted": 10851, - "total_column_articles": 122, + "total_acs": 7912, + "total_submitted": 10896, + "total_column_articles": 123, "frontend_question_id": "293", "is_new_question": false }, @@ -57825,9 +58476,9 @@ "question__title": "Nim Game", "question__title_slug": "nim-game", "question__hide": false, - "total_acs": 157704, - "total_submitted": 223828, - "total_column_articles": 1069, + "total_acs": 158245, + "total_submitted": 224608, + "total_column_articles": 1070, "frontend_question_id": "292", "is_new_question": false }, @@ -57846,9 +58497,9 @@ "question__title": "Word Pattern II", "question__title_slug": "word-pattern-ii", "question__hide": false, - "total_acs": 4879, - "total_submitted": 9367, - "total_column_articles": 101, + "total_acs": 4897, + "total_submitted": 9404, + "total_column_articles": 102, "frontend_question_id": "291", "is_new_question": false }, @@ -57867,9 +58518,9 @@ "question__title": "Word Pattern", "question__title_slug": "word-pattern", "question__hide": false, - "total_acs": 130560, - "total_submitted": 292280, - "total_column_articles": 1658, + "total_acs": 131612, + "total_submitted": 294801, + "total_column_articles": 1668, "frontend_question_id": "290", "is_new_question": false }, @@ -57888,9 +58539,9 @@ "question__title": "Game of Life", "question__title_slug": "game-of-life", "question__hide": false, - "total_acs": 75793, - "total_submitted": 100199, - "total_column_articles": 1113, + "total_acs": 76390, + "total_submitted": 100975, + "total_column_articles": 1116, "frontend_question_id": "289", "is_new_question": false }, @@ -57909,9 +58560,9 @@ "question__title": "Unique Word Abbreviation", "question__title_slug": "unique-word-abbreviation", "question__hide": false, - "total_acs": 6212, - "total_submitted": 12688, - "total_column_articles": 85, + "total_acs": 6247, + "total_submitted": 12729, + "total_column_articles": 86, "frontend_question_id": "288", "is_new_question": false }, @@ -57930,9 +58581,9 @@ "question__title": "Find the Duplicate Number", "question__title_slug": "find-the-duplicate-number", "question__hide": false, - "total_acs": 313178, - "total_submitted": 487251, - "total_column_articles": 1968, + "total_acs": 315076, + "total_submitted": 490249, + "total_column_articles": 1978, "frontend_question_id": "287", "is_new_question": false }, @@ -57951,8 +58602,8 @@ "question__title": "Walls and Gates", "question__title_slug": "walls-and-gates", "question__hide": false, - "total_acs": 19041, - "total_submitted": 34700, + "total_acs": 19113, + "total_submitted": 34814, "total_column_articles": 237, "frontend_question_id": "286", "is_new_question": false @@ -57972,8 +58623,8 @@ "question__title": "Inorder Successor in BST", "question__title_slug": "inorder-successor-in-bst", "question__hide": false, - "total_acs": 15434, - "total_submitted": 23967, + "total_acs": 15492, + "total_submitted": 24069, "total_column_articles": 176, "frontend_question_id": "285", "is_new_question": false @@ -57993,9 +58644,9 @@ "question__title": "Peeking Iterator", "question__title_slug": "peeking-iterator", "question__hide": false, - "total_acs": 31883, - "total_submitted": 41671, - "total_column_articles": 252, + "total_acs": 31987, + "total_submitted": 41811, + "total_column_articles": 253, "frontend_question_id": "284", "is_new_question": false }, @@ -58014,9 +58665,9 @@ "question__title": "Move Zeroes", "question__title_slug": "move-zeroes", "question__hide": false, - "total_acs": 1037871, - "total_submitted": 1626433, - "total_column_articles": 6307, + "total_acs": 1046626, + "total_submitted": 1640451, + "total_column_articles": 6357, "frontend_question_id": "283", "is_new_question": false }, @@ -58035,9 +58686,9 @@ "question__title": "Expression Add Operators", "question__title_slug": "expression-add-operators", "question__hide": false, - "total_acs": 26153, - "total_submitted": 55813, - "total_column_articles": 211, + "total_acs": 26224, + "total_submitted": 55992, + "total_column_articles": 212, "frontend_question_id": "282", "is_new_question": false }, @@ -58056,8 +58707,8 @@ "question__title": "Zigzag Iterator", "question__title_slug": "zigzag-iterator", "question__hide": false, - "total_acs": 5623, - "total_submitted": 7343, + "total_acs": 5673, + "total_submitted": 7401, "total_column_articles": 126, "frontend_question_id": "281", "is_new_question": false @@ -58077,9 +58728,9 @@ "question__title": "Wiggle Sort", "question__title_slug": "wiggle-sort", "question__hide": false, - "total_acs": 10243, - "total_submitted": 14759, - "total_column_articles": 113, + "total_acs": 10394, + "total_submitted": 14989, + "total_column_articles": 114, "frontend_question_id": "280", "is_new_question": false }, @@ -58098,9 +58749,9 @@ "question__title": "Perfect Squares", "question__title_slug": "perfect-squares", "question__hide": false, - "total_acs": 397500, - "total_submitted": 601485, - "total_column_articles": 1997, + "total_acs": 400686, + "total_submitted": 606080, + "total_column_articles": 2009, "frontend_question_id": "279", "is_new_question": false }, @@ -58119,9 +58770,9 @@ "question__title": "First Bad Version", "question__title_slug": "first-bad-version", "question__hide": false, - "total_acs": 465436, - "total_submitted": 1027182, - "total_column_articles": 2507, + "total_acs": 466676, + "total_submitted": 1029750, + "total_column_articles": 2513, "frontend_question_id": "278", "is_new_question": false }, @@ -58140,8 +58791,8 @@ "question__title": "Find the Celebrity", "question__title_slug": "find-the-celebrity", "question__hide": false, - "total_acs": 14086, - "total_submitted": 24301, + "total_acs": 14185, + "total_submitted": 24495, "total_column_articles": 140, "frontend_question_id": "277", "is_new_question": false @@ -58161,9 +58812,9 @@ "question__title": "Paint Fence", "question__title_slug": "paint-fence", "question__hide": false, - "total_acs": 10601, - "total_submitted": 19945, - "total_column_articles": 185, + "total_acs": 10685, + "total_submitted": 20066, + "total_column_articles": 186, "frontend_question_id": "276", "is_new_question": false }, @@ -58182,9 +58833,9 @@ "question__title": "H-Index II", "question__title_slug": "h-index-ii", "question__hide": false, - "total_acs": 68335, - "total_submitted": 151235, - "total_column_articles": 546, + "total_acs": 68634, + "total_submitted": 151927, + "total_column_articles": 547, "frontend_question_id": "275", "is_new_question": false }, @@ -58203,9 +58854,9 @@ "question__title": "H-Index", "question__title_slug": "h-index", "question__hide": false, - "total_acs": 76815, - "total_submitted": 173001, - "total_column_articles": 762, + "total_acs": 78218, + "total_submitted": 176297, + "total_column_articles": 771, "frontend_question_id": "274", "is_new_question": false }, @@ -58224,8 +58875,8 @@ "question__title": "Integer to English Words", "question__title_slug": "integer-to-english-words", "question__hide": false, - "total_acs": 37589, - "total_submitted": 103118, + "total_acs": 37695, + "total_submitted": 103367, "total_column_articles": 440, "frontend_question_id": "273", "is_new_question": false @@ -58245,8 +58896,8 @@ "question__title": "Closest Binary Search Tree Value II", "question__title_slug": "closest-binary-search-tree-value-ii", "question__hide": false, - "total_acs": 6272, - "total_submitted": 9486, + "total_acs": 6321, + "total_submitted": 9555, "total_column_articles": 126, "frontend_question_id": "272", "is_new_question": false @@ -58266,8 +58917,8 @@ "question__title": "Encode and Decode Strings", "question__title_slug": "encode-and-decode-strings", "question__hide": false, - "total_acs": 5068, - "total_submitted": 8799, + "total_acs": 5114, + "total_submitted": 8870, "total_column_articles": 71, "frontend_question_id": "271", "is_new_question": false @@ -58287,9 +58938,9 @@ "question__title": "Closest Binary Search Tree Value", "question__title_slug": "closest-binary-search-tree-value", "question__hide": false, - "total_acs": 17617, - "total_submitted": 30292, - "total_column_articles": 201, + "total_acs": 17686, + "total_submitted": 30528, + "total_column_articles": 200, "frontend_question_id": "270", "is_new_question": false }, @@ -58308,9 +58959,9 @@ "question__title": "Alien Dictionary", "question__title_slug": "alien-dictionary", "question__hide": false, - "total_acs": 12188, - "total_submitted": 33303, - "total_column_articles": 175, + "total_acs": 12260, + "total_submitted": 33476, + "total_column_articles": 176, "frontend_question_id": "269", "is_new_question": false }, @@ -58329,9 +58980,9 @@ "question__title": "Missing Number", "question__title_slug": "missing-number", "question__hide": false, - "total_acs": 301974, - "total_submitted": 455430, - "total_column_articles": 2254, + "total_acs": 303593, + "total_submitted": 457809, + "total_column_articles": 2274, "frontend_question_id": "268", "is_new_question": false }, @@ -58350,8 +59001,8 @@ "question__title": "Palindrome Permutation II", "question__title_slug": "palindrome-permutation-ii", "question__hide": false, - "total_acs": 6160, - "total_submitted": 13059, + "total_acs": 6178, + "total_submitted": 13088, "total_column_articles": 128, "frontend_question_id": "267", "is_new_question": false @@ -58371,9 +59022,9 @@ "question__title": "Palindrome Permutation", "question__title_slug": "palindrome-permutation", "question__hide": false, - "total_acs": 11769, - "total_submitted": 16836, - "total_column_articles": 176, + "total_acs": 11879, + "total_submitted": 16984, + "total_column_articles": 177, "frontend_question_id": "266", "is_new_question": false }, @@ -58392,9 +59043,9 @@ "question__title": "Paint House II", "question__title_slug": "paint-house-ii", "question__hide": false, - "total_acs": 13186, - "total_submitted": 20839, - "total_column_articles": 263, + "total_acs": 13296, + "total_submitted": 20980, + "total_column_articles": 264, "frontend_question_id": "265", "is_new_question": false }, @@ -58413,9 +59064,9 @@ "question__title": "Ugly Number II", "question__title_slug": "ugly-number-ii", "question__hide": false, - "total_acs": 155863, - "total_submitted": 265724, - "total_column_articles": 941, + "total_acs": 156478, + "total_submitted": 266876, + "total_column_articles": 942, "frontend_question_id": "264", "is_new_question": false }, @@ -58434,9 +59085,9 @@ "question__title": "Ugly Number", "question__title_slug": "ugly-number", "question__hide": false, - "total_acs": 153251, - "total_submitted": 302849, - "total_column_articles": 1133, + "total_acs": 154051, + "total_submitted": 304541, + "total_column_articles": 1138, "frontend_question_id": "263", "is_new_question": false }, @@ -58455,9 +59106,9 @@ "question__title": "Trips and Users", "question__title_slug": "trips-and-users", "question__hide": false, - "total_acs": 64775, - "total_submitted": 155057, - "total_column_articles": 607, + "total_acs": 65266, + "total_submitted": 156337, + "total_column_articles": 612, "frontend_question_id": "262", "is_new_question": false }, @@ -58476,9 +59127,9 @@ "question__title": "Graph Valid Tree", "question__title_slug": "graph-valid-tree", "question__hide": false, - "total_acs": 17655, - "total_submitted": 34648, - "total_column_articles": 233, + "total_acs": 17754, + "total_submitted": 34858, + "total_column_articles": 234, "frontend_question_id": "261", "is_new_question": false }, @@ -58497,9 +59148,9 @@ "question__title": "Single Number III", "question__title_slug": "single-number-iii", "question__hide": false, - "total_acs": 110662, - "total_submitted": 153338, - "total_column_articles": 936, + "total_acs": 111194, + "total_submitted": 154092, + "total_column_articles": 940, "frontend_question_id": "260", "is_new_question": false }, @@ -58518,8 +59169,8 @@ "question__title": "3Sum Smaller", "question__title_slug": "3sum-smaller", "question__hide": false, - "total_acs": 12590, - "total_submitted": 22836, + "total_acs": 12621, + "total_submitted": 22913, "total_column_articles": 141, "frontend_question_id": "259", "is_new_question": false @@ -58539,9 +59190,9 @@ "question__title": "Add Digits", "question__title_slug": "add-digits", "question__hide": false, - "total_acs": 162255, - "total_submitted": 228413, - "total_column_articles": 1366, + "total_acs": 163150, + "total_submitted": 229683, + "total_column_articles": 1375, "frontend_question_id": "258", "is_new_question": false }, @@ -58560,9 +59211,9 @@ "question__title": "Binary Tree Paths", "question__title_slug": "binary-tree-paths", "question__hide": false, - "total_acs": 306981, - "total_submitted": 434403, - "total_column_articles": 1921, + "total_acs": 310073, + "total_submitted": 438745, + "total_column_articles": 1944, "frontend_question_id": "257", "is_new_question": false }, @@ -58581,9 +59232,9 @@ "question__title": "Paint House", "question__title_slug": "paint-house", "question__hide": false, - "total_acs": 20779, - "total_submitted": 29886, - "total_column_articles": 302, + "total_acs": 20931, + "total_submitted": 30064, + "total_column_articles": 306, "frontend_question_id": "256", "is_new_question": false }, @@ -58602,8 +59253,8 @@ "question__title": "Verify Preorder Sequence in Binary Search Tree", "question__title_slug": "verify-preorder-sequence-in-binary-search-tree", "question__hide": false, - "total_acs": 9391, - "total_submitted": 18958, + "total_acs": 9464, + "total_submitted": 19096, "total_column_articles": 108, "frontend_question_id": "255", "is_new_question": false @@ -58623,8 +59274,8 @@ "question__title": "Factor Combinations", "question__title_slug": "factor-combinations", "question__hide": false, - "total_acs": 10315, - "total_submitted": 18101, + "total_acs": 10366, + "total_submitted": 18193, "total_column_articles": 139, "frontend_question_id": "254", "is_new_question": false @@ -58644,9 +59295,9 @@ "question__title": "Meeting Rooms II", "question__title_slug": "meeting-rooms-ii", "question__hide": false, - "total_acs": 63658, - "total_submitted": 121949, - "total_column_articles": 578, + "total_acs": 63955, + "total_submitted": 122572, + "total_column_articles": 579, "frontend_question_id": "253", "is_new_question": false }, @@ -58665,8 +59316,8 @@ "question__title": "Meeting Rooms", "question__title_slug": "meeting-rooms", "question__hide": false, - "total_acs": 23271, - "total_submitted": 40248, + "total_acs": 23404, + "total_submitted": 40500, "total_column_articles": 237, "frontend_question_id": "252", "is_new_question": false @@ -58686,8 +59337,8 @@ "question__title": "Flatten 2D Vector", "question__title_slug": "flatten-2d-vector", "question__hide": false, - "total_acs": 7048, - "total_submitted": 12840, + "total_acs": 7079, + "total_submitted": 12896, "total_column_articles": 111, "frontend_question_id": "251", "is_new_question": false @@ -58707,9 +59358,9 @@ "question__title": "Count Univalue Subtrees", "question__title_slug": "count-univalue-subtrees", "question__hide": false, - "total_acs": 7933, - "total_submitted": 12522, - "total_column_articles": 151, + "total_acs": 7997, + "total_submitted": 12626, + "total_column_articles": 155, "frontend_question_id": "250", "is_new_question": false }, @@ -58728,9 +59379,9 @@ "question__title": "Group Shifted Strings", "question__title_slug": "group-shifted-strings", "question__hide": false, - "total_acs": 10321, - "total_submitted": 15921, - "total_column_articles": 169, + "total_acs": 10426, + "total_submitted": 16068, + "total_column_articles": 172, "frontend_question_id": "249", "is_new_question": false }, @@ -58749,8 +59400,8 @@ "question__title": "Strobogrammatic Number III", "question__title_slug": "strobogrammatic-number-iii", "question__hide": false, - "total_acs": 4346, - "total_submitted": 8872, + "total_acs": 4356, + "total_submitted": 8887, "total_column_articles": 83, "frontend_question_id": "248", "is_new_question": false @@ -58770,9 +59421,9 @@ "question__title": "Strobogrammatic Number II", "question__title_slug": "strobogrammatic-number-ii", "question__hide": false, - "total_acs": 8438, - "total_submitted": 15508, - "total_column_articles": 130, + "total_acs": 8490, + "total_submitted": 15598, + "total_column_articles": 131, "frontend_question_id": "247", "is_new_question": false }, @@ -58791,8 +59442,8 @@ "question__title": "Strobogrammatic Number", "question__title_slug": "strobogrammatic-number", "question__hide": false, - "total_acs": 10448, - "total_submitted": 21995, + "total_acs": 10486, + "total_submitted": 22070, "total_column_articles": 173, "frontend_question_id": "246", "is_new_question": false @@ -58812,8 +59463,8 @@ "question__title": "Shortest Word Distance III", "question__title_slug": "shortest-word-distance-iii", "question__hide": false, - "total_acs": 7450, - "total_submitted": 13022, + "total_acs": 7471, + "total_submitted": 13070, "total_column_articles": 89, "frontend_question_id": "245", "is_new_question": false @@ -58833,9 +59484,9 @@ "question__title": "Shortest Word Distance II", "question__title_slug": "shortest-word-distance-ii", "question__hide": false, - "total_acs": 9647, - "total_submitted": 16189, - "total_column_articles": 106, + "total_acs": 9695, + "total_submitted": 16263, + "total_column_articles": 107, "frontend_question_id": "244", "is_new_question": false }, @@ -58854,9 +59505,9 @@ "question__title": "Shortest Word Distance", "question__title_slug": "shortest-word-distance", "question__hide": false, - "total_acs": 15526, - "total_submitted": 23252, - "total_column_articles": 182, + "total_acs": 15590, + "total_submitted": 23339, + "total_column_articles": 183, "frontend_question_id": "243", "is_new_question": false }, @@ -58875,9 +59526,9 @@ "question__title": "Valid Anagram", "question__title_slug": "valid-anagram", "question__hide": false, - "total_acs": 596898, - "total_submitted": 906645, - "total_column_articles": 3332, + "total_acs": 601847, + "total_submitted": 914093, + "total_column_articles": 3363, "frontend_question_id": "242", "is_new_question": false }, @@ -58896,9 +59547,9 @@ "question__title": "Different Ways to Add Parentheses", "question__title_slug": "different-ways-to-add-parentheses", "question__hide": false, - "total_acs": 75977, - "total_submitted": 100487, - "total_column_articles": 747, + "total_acs": 76276, + "total_submitted": 100905, + "total_column_articles": 748, "frontend_question_id": "241", "is_new_question": false }, @@ -58917,9 +59568,9 @@ "question__title": "Search a 2D Matrix II", "question__title_slug": "search-a-2d-matrix-ii", "question__hide": false, - "total_acs": 363996, - "total_submitted": 691035, - "total_column_articles": 1724, + "total_acs": 366787, + "total_submitted": 695673, + "total_column_articles": 1737, "frontend_question_id": "240", "is_new_question": false }, @@ -58938,9 +59589,9 @@ "question__title": "Sliding Window Maximum", "question__title_slug": "sliding-window-maximum", "question__hide": false, - "total_acs": 434857, - "total_submitted": 874388, - "total_column_articles": 3213, + "total_acs": 439300, + "total_submitted": 883587, + "total_column_articles": 3240, "frontend_question_id": "239", "is_new_question": false }, @@ -58959,9 +59610,9 @@ "question__title": "Product of Array Except Self", "question__title_slug": "product-of-array-except-self", "question__hide": false, - "total_acs": 263838, - "total_submitted": 353033, - "total_column_articles": 1620, + "total_acs": 267403, + "total_submitted": 357549, + "total_column_articles": 1652, "frontend_question_id": "238", "is_new_question": false }, @@ -58980,9 +59631,9 @@ "question__title": "Delete Node in a Linked List", "question__title_slug": "delete-node-in-a-linked-list", "question__hide": false, - "total_acs": 340395, - "total_submitted": 395435, - "total_column_articles": 1725, + "total_acs": 341628, + "total_submitted": 396872, + "total_column_articles": 1733, "frontend_question_id": "237", "is_new_question": false }, @@ -59001,9 +59652,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": 533385, - "total_submitted": 765415, - "total_column_articles": 2697, + "total_acs": 537750, + "total_submitted": 771489, + "total_column_articles": 2720, "frontend_question_id": "236", "is_new_question": false }, @@ -59022,9 +59673,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": 337405, - "total_submitted": 494442, - "total_column_articles": 1817, + "total_acs": 339829, + "total_submitted": 497749, + "total_column_articles": 1834, "frontend_question_id": "235", "is_new_question": false }, @@ -59043,9 +59694,9 @@ "question__title": "Palindrome Linked List", "question__title_slug": "palindrome-linked-list", "question__hide": false, - "total_acs": 584850, - "total_submitted": 1100808, - "total_column_articles": 3447, + "total_acs": 589352, + "total_submitted": 1108349, + "total_column_articles": 3469, "frontend_question_id": "234", "is_new_question": false }, @@ -59064,9 +59715,9 @@ "question__title": "Number of Digit One", "question__title_slug": "number-of-digit-one", "question__hide": false, - "total_acs": 54014, - "total_submitted": 110355, - "total_column_articles": 611, + "total_acs": 54319, + "total_submitted": 110947, + "total_column_articles": 613, "frontend_question_id": "233", "is_new_question": false }, @@ -59085,9 +59736,9 @@ "question__title": "Implement Queue using Stacks", "question__title_slug": "implement-queue-using-stacks", "question__hide": false, - "total_acs": 348494, - "total_submitted": 508650, - "total_column_articles": 2316, + "total_acs": 351427, + "total_submitted": 513177, + "total_column_articles": 2332, "frontend_question_id": "232", "is_new_question": false }, @@ -59106,9 +59757,9 @@ "question__title": "Power of Two", "question__title_slug": "power-of-two", "question__hide": false, - "total_acs": 288718, - "total_submitted": 575496, - "total_column_articles": 2063, + "total_acs": 290084, + "total_submitted": 578369, + "total_column_articles": 2075, "frontend_question_id": "231", "is_new_question": false }, @@ -59127,9 +59778,9 @@ "question__title": "Kth Smallest Element in a BST", "question__title_slug": "kth-smallest-element-in-a-bst", "question__hide": false, - "total_acs": 263889, - "total_submitted": 347372, - "total_column_articles": 1779, + "total_acs": 265865, + "total_submitted": 349841, + "total_column_articles": 1792, "frontend_question_id": "230", "is_new_question": false }, @@ -59148,9 +59799,9 @@ "question__title": "Majority Element II", "question__title_slug": "majority-element-ii", "question__hide": false, - "total_acs": 94947, - "total_submitted": 175830, - "total_column_articles": 845, + "total_acs": 95388, + "total_submitted": 176636, + "total_column_articles": 848, "frontend_question_id": "229", "is_new_question": false }, @@ -59169,9 +59820,9 @@ "question__title": "Summary Ranges", "question__title_slug": "summary-ranges", "question__hide": false, - "total_acs": 91557, - "total_submitted": 167213, - "total_column_articles": 1032, + "total_acs": 92572, + "total_submitted": 169172, + "total_column_articles": 1034, "frontend_question_id": "228", "is_new_question": false }, @@ -59190,9 +59841,9 @@ "question__title": "Basic Calculator II", "question__title_slug": "basic-calculator-ii", "question__hide": false, - "total_acs": 147033, - "total_submitted": 330740, - "total_column_articles": 1093, + "total_acs": 147861, + "total_submitted": 332619, + "total_column_articles": 1099, "frontend_question_id": "227", "is_new_question": false }, @@ -59211,9 +59862,9 @@ "question__title": "Invert Binary Tree", "question__title_slug": "invert-binary-tree", "question__hide": false, - "total_acs": 658916, - "total_submitted": 828728, - "total_column_articles": 4161, + "total_acs": 665134, + "total_submitted": 836391, + "total_column_articles": 4179, "frontend_question_id": "226", "is_new_question": false }, @@ -59232,9 +59883,9 @@ "question__title": "Implement Stack using Queues", "question__title_slug": "implement-stack-using-queues", "question__hide": false, - "total_acs": 280108, - "total_submitted": 421927, - "total_column_articles": 5509, + "total_acs": 282792, + "total_submitted": 426247, + "total_column_articles": 5519, "frontend_question_id": "225", "is_new_question": false }, @@ -59253,9 +59904,9 @@ "question__title": "Basic Calculator", "question__title_slug": "basic-calculator", "question__hide": false, - "total_acs": 115556, - "total_submitted": 272567, - "total_column_articles": 1003, + "total_acs": 116142, + "total_submitted": 273861, + "total_column_articles": 1005, "frontend_question_id": "224", "is_new_question": false }, @@ -59274,9 +59925,9 @@ "question__title": "Rectangle Area", "question__title_slug": "rectangle-area", "question__hide": false, - "total_acs": 56854, - "total_submitted": 105947, - "total_column_articles": 636, + "total_acs": 57106, + "total_submitted": 106352, + "total_column_articles": 639, "frontend_question_id": "223", "is_new_question": false }, @@ -59295,9 +59946,9 @@ "question__title": "Count Complete Tree Nodes", "question__title_slug": "count-complete-tree-nodes", "question__hide": false, - "total_acs": 280693, - "total_submitted": 347010, - "total_column_articles": 1710, + "total_acs": 284100, + "total_submitted": 351024, + "total_column_articles": 1732, "frontend_question_id": "222", "is_new_question": false }, @@ -59316,9 +59967,9 @@ "question__title": "Maximal Square", "question__title_slug": "maximal-square", "question__hide": false, - "total_acs": 266953, - "total_submitted": 538162, - "total_column_articles": 1652, + "total_acs": 268693, + "total_submitted": 541542, + "total_column_articles": 1661, "frontend_question_id": "221", "is_new_question": false }, @@ -59337,9 +59988,9 @@ "question__title": "Contains Duplicate III", "question__title_slug": "contains-duplicate-iii", "question__hide": false, - "total_acs": 93420, - "total_submitted": 312385, - "total_column_articles": 621, + "total_acs": 93722, + "total_submitted": 313047, + "total_column_articles": 622, "frontend_question_id": "220", "is_new_question": false }, @@ -59358,9 +60009,9 @@ "question__title": "Contains Duplicate II", "question__title_slug": "contains-duplicate-ii", "question__hide": false, - "total_acs": 229296, - "total_submitted": 518626, - "total_column_articles": 1793, + "total_acs": 230834, + "total_submitted": 521807, + "total_column_articles": 1798, "frontend_question_id": "219", "is_new_question": false }, @@ -59379,9 +60030,9 @@ "question__title": "The Skyline Problem", "question__title_slug": "the-skyline-problem", "question__hide": false, - "total_acs": 48735, - "total_submitted": 88330, - "total_column_articles": 428, + "total_acs": 48920, + "total_submitted": 88673, + "total_column_articles": 429, "frontend_question_id": "218", "is_new_question": false }, @@ -59400,9 +60051,9 @@ "question__title": "Contains Duplicate", "question__title_slug": "contains-duplicate", "question__hide": false, - "total_acs": 789927, - "total_submitted": 1442299, - "total_column_articles": 3701, + "total_acs": 793242, + "total_submitted": 1448088, + "total_column_articles": 3712, "frontend_question_id": "217", "is_new_question": false }, @@ -59421,9 +60072,9 @@ "question__title": "Combination Sum III", "question__title_slug": "combination-sum-iii", "question__hide": false, - "total_acs": 260367, - "total_submitted": 363355, - "total_column_articles": 1886, + "total_acs": 263719, + "total_submitted": 368176, + "total_column_articles": 1905, "frontend_question_id": "216", "is_new_question": false }, @@ -59442,9 +60093,9 @@ "question__title": "Kth Largest Element in an Array", "question__title_slug": "kth-largest-element-in-an-array", "question__hide": false, - "total_acs": 853867, - "total_submitted": 1339497, - "total_column_articles": 3977, + "total_acs": 859505, + "total_submitted": 1348726, + "total_column_articles": 3993, "frontend_question_id": "215", "is_new_question": false }, @@ -59463,9 +60114,9 @@ "question__title": "Shortest Palindrome", "question__title_slug": "shortest-palindrome", "question__hide": false, - "total_acs": 45414, - "total_submitted": 114245, - "total_column_articles": 456, + "total_acs": 45733, + "total_submitted": 114739, + "total_column_articles": 457, "frontend_question_id": "214", "is_new_question": false }, @@ -59484,9 +60135,9 @@ "question__title": "House Robber II", "question__title_slug": "house-robber-ii", "question__hide": false, - "total_acs": 333953, - "total_submitted": 756796, - "total_column_articles": 2671, + "total_acs": 336390, + "total_submitted": 762348, + "total_column_articles": 2679, "frontend_question_id": "213", "is_new_question": false }, @@ -59505,9 +60156,9 @@ "question__title": "Word Search II", "question__title_slug": "word-search-ii", "question__hide": false, - "total_acs": 90247, - "total_submitted": 204817, - "total_column_articles": 741, + "total_acs": 90581, + "total_submitted": 205696, + "total_column_articles": 743, "frontend_question_id": "212", "is_new_question": false }, @@ -59526,9 +60177,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": 71773, - "total_submitted": 144675, - "total_column_articles": 732, + "total_acs": 72105, + "total_submitted": 145338, + "total_column_articles": 740, "frontend_question_id": "211", "is_new_question": false }, @@ -59547,9 +60198,9 @@ "question__title": "Course Schedule II", "question__title_slug": "course-schedule-ii", "question__hide": false, - "total_acs": 175359, - "total_submitted": 309931, - "total_column_articles": 1309, + "total_acs": 176863, + "total_submitted": 312448, + "total_column_articles": 1317, "frontend_question_id": "210", "is_new_question": false }, @@ -59568,9 +60219,9 @@ "question__title": "Minimum Size Subarray Sum", "question__title_slug": "minimum-size-subarray-sum", "question__hide": false, - "total_acs": 533060, - "total_submitted": 1136454, - "total_column_articles": 3307, + "total_acs": 539440, + "total_submitted": 1151067, + "total_column_articles": 3341, "frontend_question_id": "209", "is_new_question": false }, @@ -59589,9 +60240,9 @@ "question__title": "Implement Trie (Prefix Tree)", "question__title_slug": "implement-trie-prefix-tree", "question__hide": false, - "total_acs": 260937, - "total_submitted": 362820, - "total_column_articles": 1612, + "total_acs": 262835, + "total_submitted": 365404, + "total_column_articles": 1627, "frontend_question_id": "208", "is_new_question": false }, @@ -59610,9 +60261,9 @@ "question__title": "Course Schedule", "question__title_slug": "course-schedule", "question__hide": false, - "total_acs": 294970, - "total_submitted": 550593, - "total_column_articles": 2133, + "total_acs": 297755, + "total_submitted": 555793, + "total_column_articles": 2145, "frontend_question_id": "207", "is_new_question": false }, @@ -59631,9 +60282,9 @@ "question__title": "Reverse Linked List", "question__title_slug": "reverse-linked-list", "question__hide": false, - "total_acs": 1463411, - "total_submitted": 1991635, - "total_column_articles": 11339, + "total_acs": 1475098, + "total_submitted": 2007297, + "total_column_articles": 11384, "frontend_question_id": "206", "is_new_question": false }, @@ -59652,9 +60303,9 @@ "question__title": "Isomorphic Strings", "question__title_slug": "isomorphic-strings", "question__hide": false, - "total_acs": 199457, - "total_submitted": 402124, - "total_column_articles": 1502, + "total_acs": 201222, + "total_submitted": 405520, + "total_column_articles": 1512, "frontend_question_id": "205", "is_new_question": false }, @@ -59673,9 +60324,9 @@ "question__title": "Count Primes", "question__title_slug": "count-primes", "question__hide": false, - "total_acs": 248721, - "total_submitted": 666490, - "total_column_articles": 1090, + "total_acs": 249755, + "total_submitted": 669284, + "total_column_articles": 1096, "frontend_question_id": "204", "is_new_question": false }, @@ -59694,9 +60345,9 @@ "question__title": "Remove Linked List Elements", "question__title_slug": "remove-linked-list-elements", "question__hide": false, - "total_acs": 549109, - "total_submitted": 1001838, - "total_column_articles": 3180, + "total_acs": 554874, + "total_submitted": 1011978, + "total_column_articles": 3196, "frontend_question_id": "203", "is_new_question": false }, @@ -59715,9 +60366,9 @@ "question__title": "Happy Number", "question__title_slug": "happy-number", "question__hide": false, - "total_acs": 376867, - "total_submitted": 595325, - "total_column_articles": 2716, + "total_acs": 380338, + "total_submitted": 600672, + "total_column_articles": 2741, "frontend_question_id": "202", "is_new_question": false }, @@ -59736,9 +60387,9 @@ "question__title": "Bitwise AND of Numbers Range", "question__title_slug": "bitwise-and-of-numbers-range", "question__hide": false, - "total_acs": 74211, - "total_submitted": 137473, - "total_column_articles": 506, + "total_acs": 74658, + "total_submitted": 138238, + "total_column_articles": 512, "frontend_question_id": "201", "is_new_question": false }, @@ -59757,9 +60408,9 @@ "question__title": "Number of Islands", "question__title_slug": "number-of-islands", "question__hide": false, - "total_acs": 645794, - "total_submitted": 1091253, - "total_column_articles": 3935, + "total_acs": 650192, + "total_submitted": 1098060, + "total_column_articles": 3954, "frontend_question_id": "200", "is_new_question": false }, @@ -59778,9 +60429,9 @@ "question__title": "Binary Tree Right Side View", "question__title_slug": "binary-tree-right-side-view", "question__hide": false, - "total_acs": 281766, - "total_submitted": 427822, - "total_column_articles": 2656, + "total_acs": 284527, + "total_submitted": 431981, + "total_column_articles": 2676, "frontend_question_id": "199", "is_new_question": false }, @@ -59799,9 +60450,9 @@ "question__title": "House Robber", "question__title_slug": "house-robber", "question__hide": false, - "total_acs": 738752, - "total_submitted": 1360321, - "total_column_articles": 4594, + "total_acs": 744203, + "total_submitted": 1369941, + "total_column_articles": 4625, "frontend_question_id": "198", "is_new_question": false }, @@ -59820,9 +60471,9 @@ "question__title": "Rising Temperature", "question__title_slug": "rising-temperature", "question__hide": false, - "total_acs": 175299, - "total_submitted": 323051, - "total_column_articles": 977, + "total_acs": 176971, + "total_submitted": 326060, + "total_column_articles": 984, "frontend_question_id": "197", "is_new_question": false }, @@ -59841,9 +60492,9 @@ "question__title": "Delete Duplicate Emails", "question__title_slug": "delete-duplicate-emails", "question__hide": false, - "total_acs": 210768, - "total_submitted": 306794, - "total_column_articles": 781, + "total_acs": 212020, + "total_submitted": 308629, + "total_column_articles": 785, "frontend_question_id": "196", "is_new_question": false }, @@ -59862,9 +60513,9 @@ "question__title": "Tenth Line", "question__title_slug": "tenth-line", "question__hide": false, - "total_acs": 51310, - "total_submitted": 116752, - "total_column_articles": 199, + "total_acs": 51552, + "total_submitted": 117307, + "total_column_articles": 204, "frontend_question_id": "195", "is_new_question": false }, @@ -59883,9 +60534,9 @@ "question__title": "Transpose File", "question__title_slug": "transpose-file", "question__hide": false, - "total_acs": 15083, - "total_submitted": 43945, - "total_column_articles": 101, + "total_acs": 15159, + "total_submitted": 44148, + "total_column_articles": 102, "frontend_question_id": "194", "is_new_question": false }, @@ -59904,9 +60555,9 @@ "question__title": "Valid Phone Numbers", "question__title_slug": "valid-phone-numbers", "question__hide": false, - "total_acs": 38294, - "total_submitted": 114634, - "total_column_articles": 193, + "total_acs": 38481, + "total_submitted": 115231, + "total_column_articles": 196, "frontend_question_id": "193", "is_new_question": false }, @@ -59925,9 +60576,9 @@ "question__title": "Word Frequency", "question__title_slug": "word-frequency", "question__hide": false, - "total_acs": 30484, - "total_submitted": 85303, - "total_column_articles": 226, + "total_acs": 30608, + "total_submitted": 85706, + "total_column_articles": 229, "frontend_question_id": "192", "is_new_question": false }, @@ -59946,9 +60597,9 @@ "question__title": "Number of 1 Bits", "question__title_slug": "number-of-1-bits", "question__hide": false, - "total_acs": 327238, - "total_submitted": 427981, - "total_column_articles": 2042, + "total_acs": 328761, + "total_submitted": 429944, + "total_column_articles": 2054, "frontend_question_id": "191", "is_new_question": false }, @@ -59967,9 +60618,9 @@ "question__title": "Reverse Bits", "question__title_slug": "reverse-bits", "question__hide": false, - "total_acs": 209808, - "total_submitted": 292410, - "total_column_articles": 1289, + "total_acs": 210794, + "total_submitted": 293733, + "total_column_articles": 1298, "frontend_question_id": "190", "is_new_question": false }, @@ -59988,9 +60639,9 @@ "question__title": "Rotate Array", "question__title_slug": "rotate-array", "question__hide": false, - "total_acs": 645730, - "total_submitted": 1463568, - "total_column_articles": 3227, + "total_acs": 651380, + "total_submitted": 1476170, + "total_column_articles": 3259, "frontend_question_id": "189", "is_new_question": false }, @@ -60009,9 +60660,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": 183802, - "total_submitted": 407987, - "total_column_articles": 1306, + "total_acs": 185568, + "total_submitted": 410783, + "total_column_articles": 1315, "frontend_question_id": "188", "is_new_question": false }, @@ -60030,9 +60681,9 @@ "question__title": "Repeated DNA Sequences", "question__title_slug": "repeated-dna-sequences", "question__hide": false, - "total_acs": 135139, - "total_submitted": 253449, - "total_column_articles": 989, + "total_acs": 136001, + "total_submitted": 254896, + "total_column_articles": 994, "frontend_question_id": "187", "is_new_question": false }, @@ -60051,8 +60702,8 @@ "question__title": "Reverse Words in a String II", "question__title_slug": "reverse-words-in-a-string-ii", "question__hide": false, - "total_acs": 12769, - "total_submitted": 16773, + "total_acs": 12930, + "total_submitted": 16979, "total_column_articles": 180, "frontend_question_id": "186", "is_new_question": false @@ -60072,9 +60723,9 @@ "question__title": "Department Top Three Salaries", "question__title_slug": "department-top-three-salaries", "question__hide": false, - "total_acs": 118687, - "total_submitted": 224393, - "total_column_articles": 987, + "total_acs": 119546, + "total_submitted": 225909, + "total_column_articles": 991, "frontend_question_id": "185", "is_new_question": false }, @@ -60093,9 +60744,9 @@ "question__title": "Department Highest Salary", "question__title_slug": "department-highest-salary", "question__hide": false, - "total_acs": 169151, - "total_submitted": 330543, - "total_column_articles": 1090, + "total_acs": 170224, + "total_submitted": 332349, + "total_column_articles": 1097, "frontend_question_id": "184", "is_new_question": false }, @@ -60114,9 +60765,9 @@ "question__title": "Customers Who Never Order", "question__title_slug": "customers-who-never-order", "question__hide": false, - "total_acs": 328129, - "total_submitted": 494928, - "total_column_articles": 1091, + "total_acs": 329963, + "total_submitted": 497677, + "total_column_articles": 1095, "frontend_question_id": "183", "is_new_question": false }, @@ -60135,9 +60786,9 @@ "question__title": "Duplicate Emails", "question__title_slug": "duplicate-emails", "question__hide": false, - "total_acs": 292201, - "total_submitted": 369450, - "total_column_articles": 988, + "total_acs": 293964, + "total_submitted": 371757, + "total_column_articles": 995, "frontend_question_id": "182", "is_new_question": false }, @@ -60156,9 +60807,9 @@ "question__title": "Employees Earning More Than Their Managers", "question__title_slug": "employees-earning-more-than-their-managers", "question__hide": false, - "total_acs": 269760, - "total_submitted": 392040, - "total_column_articles": 1086, + "total_acs": 271524, + "total_submitted": 394734, + "total_column_articles": 1093, "frontend_question_id": "181", "is_new_question": false }, @@ -60177,9 +60828,9 @@ "question__title": "Consecutive Numbers", "question__title_slug": "consecutive-numbers", "question__hide": false, - "total_acs": 146618, - "total_submitted": 306551, - "total_column_articles": 856, + "total_acs": 147759, + "total_submitted": 309058, + "total_column_articles": 860, "frontend_question_id": "180", "is_new_question": false }, @@ -60198,9 +60849,9 @@ "question__title": "Largest Number", "question__title_slug": "largest-number", "question__hide": false, - "total_acs": 196405, - "total_submitted": 477488, - "total_column_articles": 1431, + "total_acs": 197579, + "total_submitted": 480491, + "total_column_articles": 1439, "frontend_question_id": "179", "is_new_question": false }, @@ -60219,9 +60870,9 @@ "question__title": "Rank Scores", "question__title_slug": "rank-scores", "question__hide": false, - "total_acs": 196577, - "total_submitted": 321497, - "total_column_articles": 992, + "total_acs": 197935, + "total_submitted": 323836, + "total_column_articles": 996, "frontend_question_id": "178", "is_new_question": false }, @@ -60240,9 +60891,9 @@ "question__title": "Nth Highest Salary", "question__title_slug": "nth-highest-salary", "question__hide": false, - "total_acs": 203624, - "total_submitted": 435238, - "total_column_articles": 794, + "total_acs": 204934, + "total_submitted": 438140, + "total_column_articles": 796, "frontend_question_id": "177", "is_new_question": false }, @@ -60261,9 +60912,9 @@ "question__title": "Second Highest Salary", "question__title_slug": "second-highest-salary", "question__hide": false, - "total_acs": 405684, - "total_submitted": 1111334, - "total_column_articles": 1640, + "total_acs": 408040, + "total_submitted": 1117436, + "total_column_articles": 1642, "frontend_question_id": "176", "is_new_question": false }, @@ -60282,9 +60933,9 @@ "question__title": "Combine Two Tables", "question__title_slug": "combine-two-tables", "question__hide": false, - "total_acs": 488064, - "total_submitted": 657317, - "total_column_articles": 2117, + "total_acs": 491000, + "total_submitted": 661440, + "total_column_articles": 2123, "frontend_question_id": "175", "is_new_question": false }, @@ -60303,9 +60954,9 @@ "question__title": "Dungeon Game", "question__title_slug": "dungeon-game", "question__hide": false, - "total_acs": 62234, - "total_submitted": 127653, - "total_column_articles": 1395, + "total_acs": 62606, + "total_submitted": 128444, + "total_column_articles": 1396, "frontend_question_id": "174", "is_new_question": false }, @@ -60324,9 +60975,9 @@ "question__title": "Binary Search Tree Iterator", "question__title_slug": "binary-search-tree-iterator", "question__hide": false, - "total_acs": 113345, - "total_submitted": 139043, - "total_column_articles": 885, + "total_acs": 113870, + "total_submitted": 139681, + "total_column_articles": 888, "frontend_question_id": "173", "is_new_question": false }, @@ -60345,9 +60996,9 @@ "question__title": "Factorial Trailing Zeroes", "question__title_slug": "factorial-trailing-zeroes", "question__hide": false, - "total_acs": 168016, - "total_submitted": 336707, - "total_column_articles": 1111, + "total_acs": 168698, + "total_submitted": 337991, + "total_column_articles": 1114, "frontend_question_id": "172", "is_new_question": false }, @@ -60366,9 +61017,9 @@ "question__title": "Excel Sheet Column Number", "question__title_slug": "excel-sheet-column-number", "question__hide": false, - "total_acs": 162032, - "total_submitted": 227145, - "total_column_articles": 1318, + "total_acs": 162803, + "total_submitted": 228191, + "total_column_articles": 1328, "frontend_question_id": "171", "is_new_question": false }, @@ -60387,8 +61038,8 @@ "question__title": "Two Sum III - Data structure design", "question__title_slug": "two-sum-iii-data-structure-design", "question__hide": false, - "total_acs": 16105, - "total_submitted": 37780, + "total_acs": 16178, + "total_submitted": 37923, "total_column_articles": 156, "frontend_question_id": "170", "is_new_question": false @@ -60408,9 +61059,9 @@ "question__title": "Majority Element", "question__title_slug": "majority-element", "question__hide": false, - "total_acs": 686736, - "total_submitted": 1028379, - "total_column_articles": 3656, + "total_acs": 692038, + "total_submitted": 1036236, + "total_column_articles": 3678, "frontend_question_id": "169", "is_new_question": false }, @@ -60429,9 +61080,9 @@ "question__title": "Excel Sheet Column Title", "question__title_slug": "excel-sheet-column-title", "question__hide": false, - "total_acs": 134685, - "total_submitted": 307310, - "total_column_articles": 1130, + "total_acs": 135398, + "total_submitted": 308837, + "total_column_articles": 1134, "frontend_question_id": "168", "is_new_question": false }, @@ -60450,9 +61101,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": 558044, - "total_submitted": 941643, - "total_column_articles": 3634, + "total_acs": 560722, + "total_submitted": 945759, + "total_column_articles": 3652, "frontend_question_id": "167", "is_new_question": false }, @@ -60471,9 +61122,9 @@ "question__title": "Fraction to Recurring Decimal", "question__title_slug": "fraction-to-recurring-decimal", "question__hide": false, - "total_acs": 62669, - "total_submitted": 187420, - "total_column_articles": 522, + "total_acs": 63006, + "total_submitted": 188318, + "total_column_articles": 526, "frontend_question_id": "166", "is_new_question": false }, @@ -60492,9 +61143,9 @@ "question__title": "Compare Version Numbers", "question__title_slug": "compare-version-numbers", "question__hide": false, - "total_acs": 147730, - "total_submitted": 284866, - "total_column_articles": 1297, + "total_acs": 148703, + "total_submitted": 286736, + "total_column_articles": 1300, "frontend_question_id": "165", "is_new_question": false }, @@ -60513,9 +61164,9 @@ "question__title": "Maximum Gap", "question__title_slug": "maximum-gap", "question__hide": false, - "total_acs": 81758, - "total_submitted": 135625, - "total_column_articles": 654, + "total_acs": 82148, + "total_submitted": 136312, + "total_column_articles": 656, "frontend_question_id": "164", "is_new_question": false }, @@ -60534,9 +61185,9 @@ "question__title": "Missing Ranges", "question__title_slug": "missing-ranges", "question__hide": false, - "total_acs": 18306, - "total_submitted": 51502, - "total_column_articles": 252, + "total_acs": 18403, + "total_submitted": 51750, + "total_column_articles": 254, "frontend_question_id": "163", "is_new_question": false }, @@ -60555,9 +61206,9 @@ "question__title": "Find Peak Element", "question__title_slug": "find-peak-element", "question__hide": false, - "total_acs": 298977, - "total_submitted": 606341, - "total_column_articles": 1911, + "total_acs": 300850, + "total_submitted": 610093, + "total_column_articles": 1921, "frontend_question_id": "162", "is_new_question": false }, @@ -60576,9 +61227,9 @@ "question__title": "One Edit Distance", "question__title_slug": "one-edit-distance", "question__hide": false, - "total_acs": 13256, - "total_submitted": 38991, - "total_column_articles": 169, + "total_acs": 13466, + "total_submitted": 39470, + "total_column_articles": 173, "frontend_question_id": "161", "is_new_question": false }, @@ -60597,9 +61248,9 @@ "question__title": "Intersection of Two Linked Lists", "question__title_slug": "intersection-of-two-linked-lists", "question__hide": false, - "total_acs": 655108, - "total_submitted": 1030123, - "total_column_articles": 3665, + "total_acs": 660494, + "total_submitted": 1038392, + "total_column_articles": 3682, "frontend_question_id": "160", "is_new_question": false }, @@ -60618,9 +61269,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": 30259, - "total_submitted": 54206, - "total_column_articles": 340, + "total_acs": 30517, + "total_submitted": 54681, + "total_column_articles": 342, "frontend_question_id": "159", "is_new_question": false }, @@ -60639,9 +61290,9 @@ "question__title": "Read N Characters Given read4 II - Call Multiple Times", "question__title_slug": "read-n-characters-given-read4-ii-call-multiple-times", "question__hide": false, - "total_acs": 4945, - "total_submitted": 8252, - "total_column_articles": 102, + "total_acs": 4957, + "total_submitted": 8271, + "total_column_articles": 103, "frontend_question_id": "158", "is_new_question": false }, @@ -60660,8 +61311,8 @@ "question__title": "Read N Characters Given Read4", "question__title_slug": "read-n-characters-given-read4", "question__hide": false, - "total_acs": 9978, - "total_submitted": 18359, + "total_acs": 10019, + "total_submitted": 18423, "total_column_articles": 135, "frontend_question_id": "157", "is_new_question": false @@ -60681,9 +61332,9 @@ "question__title": "Binary Tree Upside Down", "question__title_slug": "binary-tree-upside-down", "question__hide": false, - "total_acs": 13432, - "total_submitted": 18592, - "total_column_articles": 230, + "total_acs": 13508, + "total_submitted": 18686, + "total_column_articles": 233, "frontend_question_id": "156", "is_new_question": false }, @@ -60702,9 +61353,9 @@ "question__title": "Min Stack", "question__title_slug": "min-stack", "question__hide": false, - "total_acs": 475517, - "total_submitted": 806817, - "total_column_articles": 2510, + "total_acs": 478164, + "total_submitted": 811051, + "total_column_articles": 2521, "frontend_question_id": "155", "is_new_question": false }, @@ -60723,9 +61374,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": 170546, - "total_submitted": 324570, - "total_column_articles": 1268, + "total_acs": 171324, + "total_submitted": 326125, + "total_column_articles": 1274, "frontend_question_id": "154", "is_new_question": false }, @@ -60744,9 +61395,9 @@ "question__title": "Find Minimum in Rotated Sorted Array", "question__title_slug": "find-minimum-in-rotated-sorted-array", "question__hide": false, - "total_acs": 366198, - "total_submitted": 642245, - "total_column_articles": 2421, + "total_acs": 368208, + "total_submitted": 645799, + "total_column_articles": 2435, "frontend_question_id": "153", "is_new_question": false }, @@ -60765,9 +61416,9 @@ "question__title": "Maximum Product Subarray", "question__title_slug": "maximum-product-subarray", "question__hide": false, - "total_acs": 355001, - "total_submitted": 823429, - "total_column_articles": 2113, + "total_acs": 357099, + "total_submitted": 828056, + "total_column_articles": 2120, "frontend_question_id": "152", "is_new_question": false }, @@ -60786,9 +61437,9 @@ "question__title": "Reverse Words in a String", "question__title_slug": "reverse-words-in-a-string", "question__hide": false, - "total_acs": 379862, - "total_submitted": 735069, - "total_column_articles": 2900, + "total_acs": 384461, + "total_submitted": 743355, + "total_column_articles": 2934, "frontend_question_id": "151", "is_new_question": false }, @@ -60807,9 +61458,9 @@ "question__title": "Evaluate Reverse Polish Notation", "question__title_slug": "evaluate-reverse-polish-notation", "question__hide": false, - "total_acs": 271175, - "total_submitted": 514873, - "total_column_articles": 1905, + "total_acs": 273825, + "total_submitted": 519806, + "total_column_articles": 1917, "frontend_question_id": "150", "is_new_question": false }, @@ -60828,9 +61479,9 @@ "question__title": "Max Points on a Line", "question__title_slug": "max-points-on-a-line", "question__hide": false, - "total_acs": 78269, - "total_submitted": 200014, - "total_column_articles": 779, + "total_acs": 78588, + "total_submitted": 200710, + "total_column_articles": 781, "frontend_question_id": "149", "is_new_question": false }, @@ -60849,9 +61500,9 @@ "question__title": "Sort List", "question__title_slug": "sort-list", "question__hide": false, - "total_acs": 397712, - "total_submitted": 604639, - "total_column_articles": 2158, + "total_acs": 400477, + "total_submitted": 608883, + "total_column_articles": 2171, "frontend_question_id": "148", "is_new_question": false }, @@ -60870,9 +61521,9 @@ "question__title": "Insertion Sort List", "question__title_slug": "insertion-sort-list", "question__hide": false, - "total_acs": 146662, - "total_submitted": 211156, - "total_column_articles": 1090, + "total_acs": 147257, + "total_submitted": 211979, + "total_column_articles": 1096, "frontend_question_id": "147", "is_new_question": false }, @@ -60891,9 +61542,9 @@ "question__title": "LRU Cache", "question__title_slug": "lru-cache", "question__hide": false, - "total_acs": 477291, - "total_submitted": 892864, - "total_column_articles": 3541, + "total_acs": 481390, + "total_submitted": 900251, + "total_column_articles": 3558, "frontend_question_id": "146", "is_new_question": false }, @@ -60912,9 +61563,9 @@ "question__title": "Binary Tree Postorder Traversal", "question__title_slug": "binary-tree-postorder-traversal", "question__hide": false, - "total_acs": 617195, - "total_submitted": 808680, - "total_column_articles": 2658, + "total_acs": 622405, + "total_submitted": 815548, + "total_column_articles": 2669, "frontend_question_id": "145", "is_new_question": false }, @@ -60933,9 +61584,9 @@ "question__title": "Binary Tree Preorder Traversal", "question__title_slug": "binary-tree-preorder-traversal", "question__hide": false, - "total_acs": 850367, - "total_submitted": 1192820, - "total_column_articles": 3485, + "total_acs": 857354, + "total_submitted": 1202537, + "total_column_articles": 3499, "frontend_question_id": "144", "is_new_question": false }, @@ -60954,9 +61605,9 @@ "question__title": "Reorder List", "question__title_slug": "reorder-list", "question__hide": false, - "total_acs": 247613, - "total_submitted": 381970, - "total_column_articles": 1819, + "total_acs": 249219, + "total_submitted": 384360, + "total_column_articles": 1825, "frontend_question_id": "143", "is_new_question": false }, @@ -60975,9 +61626,9 @@ "question__title": "Linked List Cycle II", "question__title_slug": "linked-list-cycle-ii", "question__hide": false, - "total_acs": 656909, - "total_submitted": 1153388, - "total_column_articles": 3688, + "total_acs": 663157, + "total_submitted": 1163890, + "total_column_articles": 3719, "frontend_question_id": "142", "is_new_question": false }, @@ -60996,9 +61647,9 @@ "question__title": "Linked List Cycle", "question__title_slug": "linked-list-cycle", "question__hide": false, - "total_acs": 980042, - "total_submitted": 1901034, - "total_column_articles": 4907, + "total_acs": 986634, + "total_submitted": 1913788, + "total_column_articles": 4938, "frontend_question_id": "141", "is_new_question": false }, @@ -61017,9 +61668,9 @@ "question__title": "Word Break II", "question__title_slug": "word-break-ii", "question__hide": false, - "total_acs": 87390, - "total_submitted": 153735, - "total_column_articles": 979, + "total_acs": 87875, + "total_submitted": 154345, + "total_column_articles": 984, "frontend_question_id": "140", "is_new_question": false }, @@ -61038,9 +61689,9 @@ "question__title": "Word Break", "question__title_slug": "word-break", "question__hide": false, - "total_acs": 434370, - "total_submitted": 802969, - "total_column_articles": 2419, + "total_acs": 438327, + "total_submitted": 809909, + "total_column_articles": 2444, "frontend_question_id": "139", "is_new_question": false }, @@ -61059,9 +61710,9 @@ "question__title": "Copy List with Random Pointer", "question__title_slug": "copy-list-with-random-pointer", "question__hide": false, - "total_acs": 193508, - "total_submitted": 292561, - "total_column_articles": 1362, + "total_acs": 195609, + "total_submitted": 296166, + "total_column_articles": 1381, "frontend_question_id": "138", "is_new_question": false }, @@ -61080,9 +61731,9 @@ "question__title": "Single Number II", "question__title_slug": "single-number-ii", "question__hide": false, - "total_acs": 150038, - "total_submitted": 208669, - "total_column_articles": 1076, + "total_acs": 150823, + "total_submitted": 209830, + "total_column_articles": 1079, "frontend_question_id": "137", "is_new_question": false }, @@ -61101,9 +61752,9 @@ "question__title": "Single Number", "question__title_slug": "single-number", "question__hide": false, - "total_acs": 897061, - "total_submitted": 1241707, - "total_column_articles": 3997, + "total_acs": 902059, + "total_submitted": 1248396, + "total_column_articles": 4026, "frontend_question_id": "136", "is_new_question": false }, @@ -61122,9 +61773,9 @@ "question__title": "Candy", "question__title_slug": "candy", "question__hide": false, - "total_acs": 215233, - "total_submitted": 428777, - "total_column_articles": 1500, + "total_acs": 221258, + "total_submitted": 437587, + "total_column_articles": 1518, "frontend_question_id": "135", "is_new_question": false }, @@ -61143,9 +61794,9 @@ "question__title": "Gas Station", "question__title_slug": "gas-station", "question__hide": false, - "total_acs": 246347, - "total_submitted": 476993, - "total_column_articles": 1669, + "total_acs": 249212, + "total_submitted": 483504, + "total_column_articles": 1692, "frontend_question_id": "134", "is_new_question": false }, @@ -61164,9 +61815,9 @@ "question__title": "Clone Graph", "question__title_slug": "clone-graph", "question__hide": false, - "total_acs": 114596, - "total_submitted": 166378, - "total_column_articles": 788, + "total_acs": 115350, + "total_submitted": 167447, + "total_column_articles": 794, "frontend_question_id": "133", "is_new_question": false }, @@ -61185,9 +61836,9 @@ "question__title": "Palindrome Partitioning II", "question__title_slug": "palindrome-partitioning-ii", "question__hide": false, - "total_acs": 75728, - "total_submitted": 151779, - "total_column_articles": 612, + "total_acs": 76152, + "total_submitted": 152733, + "total_column_articles": 614, "frontend_question_id": "132", "is_new_question": false }, @@ -61206,9 +61857,9 @@ "question__title": "Palindrome Partitioning", "question__title_slug": "palindrome-partitioning", "question__hide": false, - "total_acs": 286925, - "total_submitted": 390948, - "total_column_articles": 1672, + "total_acs": 290014, + "total_submitted": 395125, + "total_column_articles": 1690, "frontend_question_id": "131", "is_new_question": false }, @@ -61227,9 +61878,9 @@ "question__title": "Surrounded Regions", "question__title_slug": "surrounded-regions", "question__hide": false, - "total_acs": 225515, - "total_submitted": 488011, - "total_column_articles": 2180, + "total_acs": 226948, + "total_submitted": 491258, + "total_column_articles": 2191, "frontend_question_id": "130", "is_new_question": false }, @@ -61248,9 +61899,9 @@ "question__title": "Sum Root to Leaf Numbers", "question__title_slug": "sum-root-to-leaf-numbers", "question__hide": false, - "total_acs": 209009, - "total_submitted": 298472, - "total_column_articles": 1737, + "total_acs": 210444, + "total_submitted": 300521, + "total_column_articles": 1744, "frontend_question_id": "129", "is_new_question": false }, @@ -61269,9 +61920,9 @@ "question__title": "Longest Consecutive Sequence", "question__title_slug": "longest-consecutive-sequence", "question__hide": false, - "total_acs": 380400, - "total_submitted": 692377, - "total_column_articles": 2252, + "total_acs": 386297, + "total_submitted": 704106, + "total_column_articles": 2292, "frontend_question_id": "128", "is_new_question": false }, @@ -61290,9 +61941,9 @@ "question__title": "Word Ladder", "question__title_slug": "word-ladder", "question__hide": false, - "total_acs": 182879, - "total_submitted": 379595, - "total_column_articles": 987, + "total_acs": 183801, + "total_submitted": 381402, + "total_column_articles": 993, "frontend_question_id": "127", "is_new_question": false }, @@ -61311,9 +61962,9 @@ "question__title": "Word Ladder II", "question__title_slug": "word-ladder-ii", "question__hide": false, - "total_acs": 53903, - "total_submitted": 141587, - "total_column_articles": 488, + "total_acs": 54063, + "total_submitted": 142237, + "total_column_articles": 491, "frontend_question_id": "126", "is_new_question": false }, @@ -61332,9 +61983,9 @@ "question__title": "Valid Palindrome", "question__title_slug": "valid-palindrome", "question__hide": false, - "total_acs": 464304, - "total_submitted": 999783, - "total_column_articles": 2909, + "total_acs": 467782, + "total_submitted": 1007307, + "total_column_articles": 2935, "frontend_question_id": "125", "is_new_question": false }, @@ -61353,9 +62004,9 @@ "question__title": "Binary Tree Maximum Path Sum", "question__title_slug": "binary-tree-maximum-path-sum", "question__hide": false, - "total_acs": 317305, - "total_submitted": 700894, - "total_column_articles": 1917, + "total_acs": 319617, + "total_submitted": 705816, + "total_column_articles": 1929, "frontend_question_id": "124", "is_new_question": false }, @@ -61374,9 +62025,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": 252533, - "total_submitted": 430870, - "total_column_articles": 1440, + "total_acs": 254705, + "total_submitted": 434340, + "total_column_articles": 1449, "frontend_question_id": "123", "is_new_question": false }, @@ -61395,9 +62046,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": 851678, - "total_submitted": 1186520, - "total_column_articles": 4515, + "total_acs": 859143, + "total_submitted": 1196316, + "total_column_articles": 4549, "frontend_question_id": "122", "is_new_question": false }, @@ -61416,9 +62067,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": 1086355, - "total_submitted": 1876026, - "total_column_articles": 6054, + "total_acs": 1097227, + "total_submitted": 1892367, + "total_column_articles": 6086, "frontend_question_id": "121", "is_new_question": false }, @@ -61437,9 +62088,9 @@ "question__title": "Triangle", "question__title_slug": "triangle", "question__hide": false, - "total_acs": 289181, - "total_submitted": 421133, - "total_column_articles": 2388, + "total_acs": 290587, + "total_submitted": 423176, + "total_column_articles": 2394, "frontend_question_id": "120", "is_new_question": false }, @@ -61458,9 +62109,9 @@ "question__title": "Pascal's Triangle II", "question__title_slug": "pascals-triangle-ii", "question__hide": false, - "total_acs": 266968, - "total_submitted": 387402, - "total_column_articles": 2041, + "total_acs": 268294, + "total_submitted": 389338, + "total_column_articles": 2049, "frontend_question_id": "119", "is_new_question": false }, @@ -61479,9 +62130,9 @@ "question__title": "Pascal's Triangle", "question__title_slug": "pascals-triangle", "question__hide": false, - "total_acs": 410499, - "total_submitted": 543657, - "total_column_articles": 3149, + "total_acs": 413029, + "total_submitted": 547085, + "total_column_articles": 3159, "frontend_question_id": "118", "is_new_question": false }, @@ -61500,9 +62151,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": 182850, - "total_submitted": 278907, - "total_column_articles": 1351, + "total_acs": 184199, + "total_submitted": 280701, + "total_column_articles": 1356, "frontend_question_id": "117", "is_new_question": false }, @@ -61521,9 +62172,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": 345832, - "total_submitted": 476700, - "total_column_articles": 2621, + "total_acs": 348005, + "total_submitted": 479637, + "total_column_articles": 2628, "frontend_question_id": "116", "is_new_question": false }, @@ -61542,9 +62193,9 @@ "question__title": "Distinct Subsequences", "question__title_slug": "distinct-subsequences", "question__hide": false, - "total_acs": 134012, - "total_submitted": 256556, - "total_column_articles": 1215, + "total_acs": 135567, + "total_submitted": 259644, + "total_column_articles": 1218, "frontend_question_id": "115", "is_new_question": false }, @@ -61563,9 +62214,9 @@ "question__title": "Flatten Binary Tree to Linked List", "question__title_slug": "flatten-binary-tree-to-linked-list", "question__hide": false, - "total_acs": 353708, - "total_submitted": 484662, - "total_column_articles": 2871, + "total_acs": 356485, + "total_submitted": 488443, + "total_column_articles": 2887, "frontend_question_id": "114", "is_new_question": false }, @@ -61584,9 +62235,9 @@ "question__title": "Path Sum II", "question__title_slug": "path-sum-ii", "question__hide": false, - "total_acs": 341774, - "total_submitted": 541068, - "total_column_articles": 2186, + "total_acs": 344121, + "total_submitted": 544693, + "total_column_articles": 2200, "frontend_question_id": "113", "is_new_question": false }, @@ -61605,9 +62256,9 @@ "question__title": "Path Sum", "question__title_slug": "path-sum", "question__hide": false, - "total_acs": 537422, - "total_submitted": 1004011, - "total_column_articles": 3048, + "total_acs": 541757, + "total_submitted": 1011987, + "total_column_articles": 3072, "frontend_question_id": "112", "is_new_question": false }, @@ -61626,9 +62277,9 @@ "question__title": "Minimum Depth of Binary Tree", "question__title_slug": "minimum-depth-of-binary-tree", "question__hide": false, - "total_acs": 547935, - "total_submitted": 1053305, - "total_column_articles": 3788, + "total_acs": 552570, + "total_submitted": 1061277, + "total_column_articles": 3807, "frontend_question_id": "111", "is_new_question": false }, @@ -61647,9 +62298,9 @@ "question__title": "Balanced Binary Tree", "question__title_slug": "balanced-binary-tree", "question__hide": false, - "total_acs": 495232, - "total_submitted": 860959, - "total_column_articles": 2526, + "total_acs": 499031, + "total_submitted": 867424, + "total_column_articles": 2542, "frontend_question_id": "110", "is_new_question": false }, @@ -61668,9 +62319,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": 144401, - "total_submitted": 188880, - "total_column_articles": 1103, + "total_acs": 145008, + "total_submitted": 189661, + "total_column_articles": 1107, "frontend_question_id": "109", "is_new_question": false }, @@ -61689,9 +62340,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": 352418, - "total_submitted": 455363, - "total_column_articles": 2022, + "total_acs": 355465, + "total_submitted": 459276, + "total_column_articles": 2043, "frontend_question_id": "108", "is_new_question": false }, @@ -61710,9 +62361,9 @@ "question__title": "Binary Tree Level Order Traversal II", "question__title_slug": "binary-tree-level-order-traversal-ii", "question__hide": false, - "total_acs": 268815, - "total_submitted": 371116, - "total_column_articles": 1939, + "total_acs": 270579, + "total_submitted": 373399, + "total_column_articles": 1944, "frontend_question_id": "107", "is_new_question": false }, @@ -61731,9 +62382,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": 277833, - "total_submitted": 384990, - "total_column_articles": 1684, + "total_acs": 280483, + "total_submitted": 388657, + "total_column_articles": 1697, "frontend_question_id": "106", "is_new_question": false }, @@ -61752,9 +62403,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": 489812, - "total_submitted": 687092, - "total_column_articles": 2567, + "total_acs": 493415, + "total_submitted": 692117, + "total_column_articles": 2583, "frontend_question_id": "105", "is_new_question": false }, @@ -61773,9 +62424,9 @@ "question__title": "Maximum Depth of Binary Tree", "question__title_slug": "maximum-depth-of-binary-tree", "question__hide": false, - "total_acs": 1004027, - "total_submitted": 1301975, - "total_column_articles": 5055, + "total_acs": 1012534, + "total_submitted": 1312970, + "total_column_articles": 5083, "frontend_question_id": "104", "is_new_question": false }, @@ -61794,9 +62445,9 @@ "question__title": "Binary Tree Zigzag Level Order Traversal", "question__title_slug": "binary-tree-zigzag-level-order-traversal", "question__hide": false, - "total_acs": 300616, - "total_submitted": 522679, - "total_column_articles": 2446, + "total_acs": 302355, + "total_submitted": 525688, + "total_column_articles": 2455, "frontend_question_id": "103", "is_new_question": false }, @@ -61815,9 +62466,9 @@ "question__title": "Binary Tree Level Order Traversal", "question__title_slug": "binary-tree-level-order-traversal", "question__hide": false, - "total_acs": 802137, - "total_submitted": 1223339, - "total_column_articles": 4425, + "total_acs": 809082, + "total_submitted": 1233625, + "total_column_articles": 4449, "frontend_question_id": "102", "is_new_question": false }, @@ -61836,9 +62487,9 @@ "question__title": "Symmetric Tree", "question__title_slug": "symmetric-tree", "question__hide": false, - "total_acs": 820972, - "total_submitted": 1397911, - "total_column_articles": 4186, + "total_acs": 827815, + "total_submitted": 1408932, + "total_column_articles": 4218, "frontend_question_id": "101", "is_new_question": false }, @@ -61857,9 +62508,9 @@ "question__title": "Same Tree", "question__title_slug": "same-tree", "question__hide": false, - "total_acs": 450851, - "total_submitted": 752675, - "total_column_articles": 3084, + "total_acs": 454309, + "total_submitted": 758126, + "total_column_articles": 3093, "frontend_question_id": "100", "is_new_question": false }, @@ -61878,9 +62529,9 @@ "question__title": "Recover Binary Search Tree", "question__title_slug": "recover-binary-search-tree", "question__hide": false, - "total_acs": 133502, - "total_submitted": 221626, - "total_column_articles": 1063, + "total_acs": 134218, + "total_submitted": 222866, + "total_column_articles": 1072, "frontend_question_id": "99", "is_new_question": false }, @@ -61899,9 +62550,9 @@ "question__title": "Validate Binary Search Tree", "question__title_slug": "validate-binary-search-tree", "question__hide": false, - "total_acs": 711252, - "total_submitted": 1926424, - "total_column_articles": 3959, + "total_acs": 716715, + "total_submitted": 1940244, + "total_column_articles": 3982, "frontend_question_id": "98", "is_new_question": false }, @@ -61920,9 +62571,9 @@ "question__title": "Interleaving String", "question__title_slug": "interleaving-string", "question__hide": false, - "total_acs": 113583, - "total_submitted": 253840, - "total_column_articles": 871, + "total_acs": 114446, + "total_submitted": 255909, + "total_column_articles": 876, "frontend_question_id": "97", "is_new_question": false }, @@ -61941,9 +62592,9 @@ "question__title": "Unique Binary Search Trees", "question__title_slug": "unique-binary-search-trees", "question__hide": false, - "total_acs": 361309, - "total_submitted": 509828, - "total_column_articles": 2444, + "total_acs": 364221, + "total_submitted": 514026, + "total_column_articles": 2462, "frontend_question_id": "96", "is_new_question": false }, @@ -61962,9 +62613,9 @@ "question__title": "Unique Binary Search Trees II", "question__title_slug": "unique-binary-search-trees-ii", "question__hide": false, - "total_acs": 165984, - "total_submitted": 226587, - "total_column_articles": 1031, + "total_acs": 166856, + "total_submitted": 227685, + "total_column_articles": 1037, "frontend_question_id": "95", "is_new_question": false }, @@ -61983,9 +62634,9 @@ "question__title": "Binary Tree Inorder Traversal", "question__title_slug": "binary-tree-inorder-traversal", "question__hide": false, - "total_acs": 1140179, - "total_submitted": 1496242, - "total_column_articles": 4181, + "total_acs": 1149147, + "total_submitted": 1507991, + "total_column_articles": 4205, "frontend_question_id": "94", "is_new_question": false }, @@ -62004,9 +62655,9 @@ "question__title": "Restore IP Addresses", "question__title_slug": "restore-ip-addresses", "question__hide": false, - "total_acs": 330497, - "total_submitted": 569734, - "total_column_articles": 2417, + "total_acs": 333649, + "total_submitted": 574915, + "total_column_articles": 2437, "frontend_question_id": "93", "is_new_question": false }, @@ -62025,9 +62676,9 @@ "question__title": "Reverse Linked List II", "question__title_slug": "reverse-linked-list-ii", "question__hide": false, - "total_acs": 393495, - "total_submitted": 707188, - "total_column_articles": 3649, + "total_acs": 396553, + "total_submitted": 712532, + "total_column_articles": 3673, "frontend_question_id": "92", "is_new_question": false }, @@ -62046,9 +62697,9 @@ "question__title": "Decode Ways", "question__title_slug": "decode-ways", "question__hide": false, - "total_acs": 267566, - "total_submitted": 810014, - "total_column_articles": 2275, + "total_acs": 269029, + "total_submitted": 813260, + "total_column_articles": 2279, "frontend_question_id": "91", "is_new_question": false }, @@ -62067,9 +62718,9 @@ "question__title": "Subsets II", "question__title_slug": "subsets-ii", "question__hide": false, - "total_acs": 294806, - "total_submitted": 463459, - "total_column_articles": 2208, + "total_acs": 297378, + "total_submitted": 467517, + "total_column_articles": 2223, "frontend_question_id": "90", "is_new_question": false }, @@ -62088,9 +62739,9 @@ "question__title": "Gray Code", "question__title_slug": "gray-code", "question__hide": false, - "total_acs": 117233, - "total_submitted": 155307, - "total_column_articles": 897, + "total_acs": 117649, + "total_submitted": 155830, + "total_column_articles": 898, "frontend_question_id": "89", "is_new_question": false }, @@ -62109,9 +62760,9 @@ "question__title": "Merge Sorted Array", "question__title_slug": "merge-sorted-array", "question__hide": false, - "total_acs": 891104, - "total_submitted": 1698380, - "total_column_articles": 5867, + "total_acs": 898663, + "total_submitted": 1712578, + "total_column_articles": 5933, "frontend_question_id": "88", "is_new_question": false }, @@ -62130,9 +62781,9 @@ "question__title": "Scramble String", "question__title_slug": "scramble-string", "question__hide": false, - "total_acs": 57037, - "total_submitted": 120224, - "total_column_articles": 433, + "total_acs": 57243, + "total_submitted": 120771, + "total_column_articles": 436, "frontend_question_id": "87", "is_new_question": false }, @@ -62151,9 +62802,9 @@ "question__title": "Partition List", "question__title_slug": "partition-list", "question__hide": false, - "total_acs": 211926, - "total_submitted": 330374, - "total_column_articles": 2049, + "total_acs": 213766, + "total_submitted": 333205, + "total_column_articles": 2061, "frontend_question_id": "86", "is_new_question": false }, @@ -62172,9 +62823,9 @@ "question__title": "Maximal Rectangle", "question__title_slug": "maximal-rectangle", "question__hide": false, - "total_acs": 173684, - "total_submitted": 318203, - "total_column_articles": 1173, + "total_acs": 174626, + "total_submitted": 319777, + "total_column_articles": 1178, "frontend_question_id": "85", "is_new_question": false }, @@ -62193,9 +62844,9 @@ "question__title": "Largest Rectangle in Histogram", "question__title_slug": "largest-rectangle-in-histogram", "question__hide": false, - "total_acs": 337856, - "total_submitted": 751897, - "total_column_articles": 1938, + "total_acs": 340226, + "total_submitted": 756776, + "total_column_articles": 1950, "frontend_question_id": "84", "is_new_question": false }, @@ -62214,9 +62865,9 @@ "question__title": "Remove Duplicates from Sorted List", "question__title_slug": "remove-duplicates-from-sorted-list", "question__hide": false, - "total_acs": 570406, - "total_submitted": 1073807, - "total_column_articles": 3548, + "total_acs": 573971, + "total_submitted": 1080774, + "total_column_articles": 3566, "frontend_question_id": "83", "is_new_question": false }, @@ -62235,9 +62886,9 @@ "question__title": "Remove Duplicates from Sorted List II", "question__title_slug": "remove-duplicates-from-sorted-list-ii", "question__hide": false, - "total_acs": 335876, - "total_submitted": 627255, - "total_column_articles": 2747, + "total_acs": 337906, + "total_submitted": 631150, + "total_column_articles": 2754, "frontend_question_id": "82", "is_new_question": false }, @@ -62256,9 +62907,9 @@ "question__title": "Search in Rotated Sorted Array II", "question__title_slug": "search-in-rotated-sorted-array-ii", "question__hide": false, - "total_acs": 194715, - "total_submitted": 474639, - "total_column_articles": 1445, + "total_acs": 195550, + "total_submitted": 476800, + "total_column_articles": 1449, "frontend_question_id": "81", "is_new_question": false }, @@ -62277,9 +62928,9 @@ "question__title": "Remove Duplicates from Sorted Array II", "question__title_slug": "remove-duplicates-from-sorted-array-ii", "question__hide": false, - "total_acs": 230320, - "total_submitted": 373049, - "total_column_articles": 1925, + "total_acs": 233507, + "total_submitted": 378249, + "total_column_articles": 1936, "frontend_question_id": "80", "is_new_question": false }, @@ -62298,9 +62949,9 @@ "question__title": "Word Search", "question__title_slug": "word-search", "question__hide": false, - "total_acs": 423415, - "total_submitted": 914452, - "total_column_articles": 2551, + "total_acs": 426051, + "total_submitted": 920322, + "total_column_articles": 2565, "frontend_question_id": "79", "is_new_question": false }, @@ -62319,9 +62970,9 @@ "question__title": "Subsets", "question__title_slug": "subsets", "question__hide": false, - "total_acs": 619413, - "total_submitted": 763948, - "total_column_articles": 4225, + "total_acs": 624201, + "total_submitted": 769727, + "total_column_articles": 4247, "frontend_question_id": "78", "is_new_question": false }, @@ -62340,9 +62991,9 @@ "question__title": "Combinations", "question__title_slug": "combinations", "question__hide": false, - "total_acs": 529405, - "total_submitted": 686200, - "total_column_articles": 2826, + "total_acs": 534576, + "total_submitted": 692992, + "total_column_articles": 2845, "frontend_question_id": "77", "is_new_question": false }, @@ -62361,9 +63012,9 @@ "question__title": "Minimum Window Substring", "question__title_slug": "minimum-window-substring", "question__hide": false, - "total_acs": 416820, - "total_submitted": 922872, - "total_column_articles": 3332, + "total_acs": 420779, + "total_submitted": 931653, + "total_column_articles": 3352, "frontend_question_id": "76", "is_new_question": false }, @@ -62382,9 +63033,9 @@ "question__title": "Sort Colors", "question__title_slug": "sort-colors", "question__hide": false, - "total_acs": 530912, - "total_submitted": 879290, - "total_column_articles": 3528, + "total_acs": 534192, + "total_submitted": 884538, + "total_column_articles": 3547, "frontend_question_id": "75", "is_new_question": false }, @@ -62403,9 +63054,9 @@ "question__title": "Search a 2D Matrix", "question__title_slug": "search-a-2d-matrix", "question__hide": false, - "total_acs": 307595, - "total_submitted": 632798, - "total_column_articles": 2913, + "total_acs": 309445, + "total_submitted": 636404, + "total_column_articles": 2920, "frontend_question_id": "74", "is_new_question": false }, @@ -62424,9 +63075,9 @@ "question__title": "Set Matrix Zeroes", "question__title_slug": "set-matrix-zeroes", "question__hide": false, - "total_acs": 247711, - "total_submitted": 393220, - "total_column_articles": 1796, + "total_acs": 250016, + "total_submitted": 396494, + "total_column_articles": 1808, "frontend_question_id": "73", "is_new_question": false }, @@ -62445,9 +63096,9 @@ "question__title": "Edit Distance", "question__title_slug": "edit-distance", "question__hide": false, - "total_acs": 363593, - "total_submitted": 579189, - "total_column_articles": 3074, + "total_acs": 366503, + "total_submitted": 583782, + "total_column_articles": 3090, "frontend_question_id": "72", "is_new_question": false }, @@ -62466,9 +63117,9 @@ "question__title": "Simplify Path", "question__title_slug": "simplify-path", "question__hide": false, - "total_acs": 180141, - "total_submitted": 407691, - "total_column_articles": 1627, + "total_acs": 181338, + "total_submitted": 410248, + "total_column_articles": 1634, "frontend_question_id": "71", "is_new_question": false }, @@ -62487,9 +63138,9 @@ "question__title": "Climbing Stairs", "question__title_slug": "climbing-stairs", "question__hide": false, - "total_acs": 1138269, - "total_submitted": 2106176, - "total_column_articles": 6168, + "total_acs": 1146304, + "total_submitted": 2121063, + "total_column_articles": 6204, "frontend_question_id": "70", "is_new_question": false }, @@ -62508,9 +63159,9 @@ "question__title": "Sqrt(x)", "question__title_slug": "sqrtx", "question__hide": false, - "total_acs": 730349, - "total_submitted": 1897641, - "total_column_articles": 3673, + "total_acs": 735084, + "total_submitted": 1910824, + "total_column_articles": 3697, "frontend_question_id": "69", "is_new_question": false }, @@ -62529,9 +63180,9 @@ "question__title": "Text Justification", "question__title_slug": "text-justification", "question__hide": false, - "total_acs": 53509, - "total_submitted": 102473, - "total_column_articles": 789, + "total_acs": 53972, + "total_submitted": 103320, + "total_column_articles": 790, "frontend_question_id": "68", "is_new_question": false }, @@ -62550,9 +63201,9 @@ "question__title": "Add Binary", "question__title_slug": "add-binary", "question__hide": false, - "total_acs": 320073, - "total_submitted": 603654, - "total_column_articles": 2872, + "total_acs": 322223, + "total_submitted": 607858, + "total_column_articles": 2884, "frontend_question_id": "67", "is_new_question": false }, @@ -62571,9 +63222,9 @@ "question__title": "Plus One", "question__title_slug": "plus-one", "question__hide": false, - "total_acs": 625199, - "total_submitted": 1383872, - "total_column_articles": 5549, + "total_acs": 629037, + "total_submitted": 1392955, + "total_column_articles": 5574, "frontend_question_id": "66", "is_new_question": false }, @@ -62592,9 +63243,9 @@ "question__title": "Valid Number", "question__title_slug": "valid-number", "question__hide": false, - "total_acs": 64609, - "total_submitted": 234250, - "total_column_articles": 909, + "total_acs": 64865, + "total_submitted": 235192, + "total_column_articles": 914, "frontend_question_id": "65", "is_new_question": false }, @@ -62613,9 +63264,9 @@ "question__title": "Minimum Path Sum", "question__title_slug": "minimum-path-sum", "question__hide": false, - "total_acs": 479523, - "total_submitted": 690065, - "total_column_articles": 3341, + "total_acs": 482421, + "total_submitted": 694226, + "total_column_articles": 3356, "frontend_question_id": "64", "is_new_question": false }, @@ -62634,9 +63285,9 @@ "question__title": "Unique Paths II", "question__title_slug": "unique-paths-ii", "question__hide": false, - "total_acs": 367140, - "total_submitted": 895191, - "total_column_articles": 2928, + "total_acs": 370571, + "total_submitted": 903118, + "total_column_articles": 2948, "frontend_question_id": "63", "is_new_question": false }, @@ -62655,9 +63306,9 @@ "question__title": "Unique Paths", "question__title_slug": "unique-paths", "question__hide": false, - "total_acs": 613360, - "total_submitted": 905789, - "total_column_articles": 4133, + "total_acs": 618061, + "total_submitted": 912599, + "total_column_articles": 4154, "frontend_question_id": "62", "is_new_question": false }, @@ -62676,9 +63327,9 @@ "question__title": "Rotate List", "question__title_slug": "rotate-list", "question__hide": false, - "total_acs": 311625, - "total_submitted": 751350, - "total_column_articles": 3000, + "total_acs": 313357, + "total_submitted": 755812, + "total_column_articles": 3015, "frontend_question_id": "61", "is_new_question": false }, @@ -62697,9 +63348,9 @@ "question__title": "Permutation Sequence", "question__title_slug": "permutation-sequence", "question__hide": false, - "total_acs": 127169, - "total_submitted": 238176, - "total_column_articles": 1415, + "total_acs": 127682, + "total_submitted": 239031, + "total_column_articles": 1418, "frontend_question_id": "60", "is_new_question": false }, @@ -62718,9 +63369,9 @@ "question__title": "Spiral Matrix II", "question__title_slug": "spiral-matrix-ii", "question__hide": false, - "total_acs": 312134, - "total_submitted": 426281, - "total_column_articles": 3369, + "total_acs": 315653, + "total_submitted": 431641, + "total_column_articles": 3382, "frontend_question_id": "59", "is_new_question": false }, @@ -62739,9 +63390,9 @@ "question__title": "Length of Last Word", "question__title_slug": "length-of-last-word", "question__hide": false, - "total_acs": 425817, - "total_submitted": 1001915, - "total_column_articles": 4506, + "total_acs": 429322, + "total_submitted": 1008438, + "total_column_articles": 4540, "frontend_question_id": "58", "is_new_question": false }, @@ -62760,9 +63411,9 @@ "question__title": "Insert Interval", "question__title_slug": "insert-interval", "question__hide": false, - "total_acs": 142730, - "total_submitted": 340443, - "total_column_articles": 1387, + "total_acs": 143762, + "total_submitted": 342861, + "total_column_articles": 1395, "frontend_question_id": "57", "is_new_question": false }, @@ -62781,9 +63432,9 @@ "question__title": "Merge Intervals", "question__title_slug": "merge-intervals", "question__hide": false, - "total_acs": 626114, - "total_submitted": 1269237, - "total_column_articles": 4101, + "total_acs": 631358, + "total_submitted": 1279378, + "total_column_articles": 4130, "frontend_question_id": "56", "is_new_question": false }, @@ -62802,9 +63453,9 @@ "question__title": "Jump Game", "question__title_slug": "jump-game", "question__hide": false, - "total_acs": 701552, - "total_submitted": 1608710, - "total_column_articles": 4820, + "total_acs": 707751, + "total_submitted": 1623379, + "total_column_articles": 4851, "frontend_question_id": "55", "is_new_question": false }, @@ -62823,9 +63474,9 @@ "question__title": "Spiral Matrix", "question__title_slug": "spiral-matrix", "question__hide": false, - "total_acs": 363865, - "total_submitted": 738336, - "total_column_articles": 3794, + "total_acs": 367348, + "total_submitted": 745331, + "total_column_articles": 3815, "frontend_question_id": "54", "is_new_question": false }, @@ -62844,9 +63495,9 @@ "question__title": "Maximum Subarray", "question__title_slug": "maximum-subarray", "question__hide": false, - "total_acs": 1386612, - "total_submitted": 2532615, - "total_column_articles": 6772, + "total_acs": 1394759, + "total_submitted": 2546901, + "total_column_articles": 6809, "frontend_question_id": "53", "is_new_question": false }, @@ -62865,9 +63516,9 @@ "question__title": "N-Queens II", "question__title_slug": "n-queens-ii", "question__hide": false, - "total_acs": 118324, - "total_submitted": 143540, - "total_column_articles": 913, + "total_acs": 119203, + "total_submitted": 144640, + "total_column_articles": 918, "frontend_question_id": "52", "is_new_question": false }, @@ -62886,9 +63537,9 @@ "question__title": "N-Queens", "question__title_slug": "n-queens", "question__hide": false, - "total_acs": 301605, - "total_submitted": 406881, - "total_column_articles": 2959, + "total_acs": 304520, + "total_submitted": 410754, + "total_column_articles": 2972, "frontend_question_id": "51", "is_new_question": false }, @@ -62907,9 +63558,9 @@ "question__title": "Pow(x, n)", "question__title_slug": "powx-n", "question__hide": false, - "total_acs": 372050, - "total_submitted": 978737, - "total_column_articles": 2094, + "total_acs": 374156, + "total_submitted": 984249, + "total_column_articles": 2099, "frontend_question_id": "50", "is_new_question": false }, @@ -62928,9 +63579,9 @@ "question__title": "Group Anagrams", "question__title_slug": "group-anagrams", "question__hide": false, - "total_acs": 455397, - "total_submitted": 671786, - "total_column_articles": 2494, + "total_acs": 461478, + "total_submitted": 680822, + "total_column_articles": 2524, "frontend_question_id": "49", "is_new_question": false }, @@ -62949,9 +63600,9 @@ "question__title": "Rotate Image", "question__title_slug": "rotate-image", "question__hide": false, - "total_acs": 447134, - "total_submitted": 598623, - "total_column_articles": 4377, + "total_acs": 450490, + "total_submitted": 603071, + "total_column_articles": 4400, "frontend_question_id": "48", "is_new_question": false }, @@ -62970,9 +63621,9 @@ "question__title": "Permutations II", "question__title_slug": "permutations-ii", "question__hide": false, - "total_acs": 449791, - "total_submitted": 686788, - "total_column_articles": 2801, + "total_acs": 453383, + "total_submitted": 692184, + "total_column_articles": 2816, "frontend_question_id": "47", "is_new_question": false }, @@ -62991,9 +63642,9 @@ "question__title": "Permutations", "question__title_slug": "permutations", "question__hide": false, - "total_acs": 854630, - "total_submitted": 1083645, - "total_column_articles": 5683, + "total_acs": 860973, + "total_submitted": 1091693, + "total_column_articles": 5709, "frontend_question_id": "46", "is_new_question": false }, @@ -63012,9 +63663,9 @@ "question__title": "Jump Game II", "question__title_slug": "jump-game-ii", "question__hide": false, - "total_acs": 485715, - "total_submitted": 1074731, - "total_column_articles": 3278, + "total_acs": 491545, + "total_submitted": 1088010, + "total_column_articles": 3308, "frontend_question_id": "45", "is_new_question": false }, @@ -63033,9 +63684,9 @@ "question__title": "Wildcard Matching", "question__title_slug": "wildcard-matching", "question__hide": false, - "total_acs": 136293, - "total_submitted": 403139, - "total_column_articles": 892, + "total_acs": 136947, + "total_submitted": 405173, + "total_column_articles": 899, "frontend_question_id": "44", "is_new_question": false }, @@ -63054,9 +63705,9 @@ "question__title": "Multiply Strings", "question__title_slug": "multiply-strings", "question__hide": false, - "total_acs": 295963, - "total_submitted": 665415, - "total_column_articles": 2021, + "total_acs": 297619, + "total_submitted": 669293, + "total_column_articles": 2029, "frontend_question_id": "43", "is_new_question": false }, @@ -63075,9 +63726,9 @@ "question__title": "Trapping Rain Water", "question__title_slug": "trapping-rain-water", "question__hide": false, - "total_acs": 678077, - "total_submitted": 1082603, - "total_column_articles": 4270, + "total_acs": 684391, + "total_submitted": 1092273, + "total_column_articles": 4314, "frontend_question_id": "42", "is_new_question": false }, @@ -63096,9 +63747,9 @@ "question__title": "First Missing Positive", "question__title_slug": "first-missing-positive", "question__hide": false, - "total_acs": 290273, - "total_submitted": 675666, - "total_column_articles": 2169, + "total_acs": 292546, + "total_submitted": 680441, + "total_column_articles": 2185, "frontend_question_id": "41", "is_new_question": false }, @@ -63117,9 +63768,9 @@ "question__title": "Combination Sum II", "question__title_slug": "combination-sum-ii", "question__hide": false, - "total_acs": 422740, - "total_submitted": 706077, - "total_column_articles": 2662, + "total_acs": 426127, + "total_submitted": 712060, + "total_column_articles": 2683, "frontend_question_id": "40", "is_new_question": false }, @@ -63138,9 +63789,9 @@ "question__title": "Combination Sum", "question__title_slug": "combination-sum", "question__hide": false, - "total_acs": 725972, - "total_submitted": 1002653, - "total_column_articles": 3827, + "total_acs": 731713, + "total_submitted": 1010690, + "total_column_articles": 3843, "frontend_question_id": "39", "is_new_question": false }, @@ -63159,9 +63810,9 @@ "question__title": "Count and Say", "question__title_slug": "count-and-say", "question__hide": false, - "total_acs": 336866, - "total_submitted": 558277, - "total_column_articles": 3239, + "total_acs": 338176, + "total_submitted": 560389, + "total_column_articles": 3250, "frontend_question_id": "38", "is_new_question": false }, @@ -63180,9 +63831,9 @@ "question__title": "Sudoku Solver", "question__title_slug": "sudoku-solver", "question__hide": false, - "total_acs": 202099, - "total_submitted": 299114, - "total_column_articles": 1565, + "total_acs": 203657, + "total_submitted": 301373, + "total_column_articles": 1574, "frontend_question_id": "37", "is_new_question": false }, @@ -63201,9 +63852,9 @@ "question__title": "Valid Sudoku", "question__title_slug": "valid-sudoku", "question__hide": false, - "total_acs": 369922, - "total_submitted": 586447, - "total_column_articles": 2612, + "total_acs": 372041, + "total_submitted": 590013, + "total_column_articles": 2621, "frontend_question_id": "36", "is_new_question": false }, @@ -63222,9 +63873,9 @@ "question__title": "Search Insert Position", "question__title_slug": "search-insert-position", "question__hide": false, - "total_acs": 1136797, - "total_submitted": 2525886, - "total_column_articles": 7434, + "total_acs": 1144625, + "total_submitted": 2542902, + "total_column_articles": 7467, "frontend_question_id": "35", "is_new_question": false }, @@ -63243,9 +63894,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": 782071, - "total_submitted": 1846501, - "total_column_articles": 7294, + "total_acs": 787804, + "total_submitted": 1859761, + "total_column_articles": 7327, "frontend_question_id": "34", "is_new_question": false }, @@ -63264,9 +63915,9 @@ "question__title": "Search in Rotated Sorted Array", "question__title_slug": "search-in-rotated-sorted-array", "question__hide": false, - "total_acs": 726141, - "total_submitted": 1658601, - "total_column_articles": 4553, + "total_acs": 730253, + "total_submitted": 1667809, + "total_column_articles": 4572, "frontend_question_id": "33", "is_new_question": false }, @@ -63285,9 +63936,9 @@ "question__title": "Longest Valid Parentheses", "question__title_slug": "longest-valid-parentheses", "question__hide": false, - "total_acs": 368265, - "total_submitted": 991721, - "total_column_articles": 2268, + "total_acs": 370420, + "total_submitted": 997188, + "total_column_articles": 2278, "frontend_question_id": "32", "is_new_question": false }, @@ -63306,9 +63957,9 @@ "question__title": "Next Permutation", "question__title_slug": "next-permutation", "question__hide": false, - "total_acs": 426537, - "total_submitted": 1114989, - "total_column_articles": 3168, + "total_acs": 428962, + "total_submitted": 1120887, + "total_column_articles": 3179, "frontend_question_id": "31", "is_new_question": false }, @@ -63327,9 +63978,9 @@ "question__title": "Substring with Concatenation of All Words", "question__title_slug": "substring-with-concatenation-of-all-words", "question__hide": false, - "total_acs": 160038, - "total_submitted": 404244, - "total_column_articles": 1277, + "total_acs": 161053, + "total_submitted": 406838, + "total_column_articles": 1281, "frontend_question_id": "30", "is_new_question": false }, @@ -63348,9 +63999,9 @@ "question__title": "Divide Two Integers", "question__title_slug": "divide-two-integers", "question__hide": false, - "total_acs": 206885, - "total_submitted": 932891, - "total_column_articles": 1555, + "total_acs": 208002, + "total_submitted": 937534, + "total_column_articles": 1562, "frontend_question_id": "29", "is_new_question": false }, @@ -63369,9 +64020,9 @@ "question__title": "Find the Index of the First Occurrence in a String", "question__title_slug": "find-the-index-of-the-first-occurrence-in-a-string", "question__hide": false, - "total_acs": 838102, - "total_submitted": 1980356, - "total_column_articles": 5697, + "total_acs": 843340, + "total_submitted": 1990723, + "total_column_articles": 5730, "frontend_question_id": "28", "is_new_question": false }, @@ -63390,9 +64041,9 @@ "question__title": "Remove Element", "question__title_slug": "remove-element", "question__hide": false, - "total_acs": 1038576, - "total_submitted": 1753366, - "total_column_articles": 7634, + "total_acs": 1050312, + "total_submitted": 1773697, + "total_column_articles": 7700, "frontend_question_id": "27", "is_new_question": false }, @@ -63411,9 +64062,9 @@ "question__title": "Remove Duplicates from Sorted Array", "question__title_slug": "remove-duplicates-from-sorted-array", "question__hide": false, - "total_acs": 1471151, - "total_submitted": 2688907, - "total_column_articles": 8263, + "total_acs": 1482288, + "total_submitted": 2708615, + "total_column_articles": 8315, "frontend_question_id": "26", "is_new_question": false }, @@ -63432,9 +64083,9 @@ "question__title": "Reverse Nodes in k-Group", "question__title_slug": "reverse-nodes-in-k-group", "question__hide": false, - "total_acs": 458310, - "total_submitted": 677166, - "total_column_articles": 3836, + "total_acs": 461602, + "total_submitted": 682129, + "total_column_articles": 3861, "frontend_question_id": "25", "is_new_question": false }, @@ -63453,9 +64104,9 @@ "question__title": "Swap Nodes in Pairs", "question__title_slug": "swap-nodes-in-pairs", "question__hide": false, - "total_acs": 620899, - "total_submitted": 870949, - "total_column_articles": 4458, + "total_acs": 626622, + "total_submitted": 878875, + "total_column_articles": 4498, "frontend_question_id": "24", "is_new_question": false }, @@ -63474,9 +64125,9 @@ "question__title": "Merge k Sorted Lists", "question__title_slug": "merge-k-sorted-lists", "question__hide": false, - "total_acs": 638094, - "total_submitted": 1105351, - "total_column_articles": 4173, + "total_acs": 642147, + "total_submitted": 1111987, + "total_column_articles": 4196, "frontend_question_id": "23", "is_new_question": false }, @@ -63495,9 +64146,9 @@ "question__title": "Generate Parentheses", "question__title_slug": "generate-parentheses", "question__hide": false, - "total_acs": 691315, - "total_submitted": 892189, - "total_column_articles": 4673, + "total_acs": 695704, + "total_submitted": 897884, + "total_column_articles": 4697, "frontend_question_id": "22", "is_new_question": false }, @@ -63516,9 +64167,9 @@ "question__title": "Merge Two Sorted Lists", "question__title_slug": "merge-two-sorted-lists", "question__hide": false, - "total_acs": 1370005, - "total_submitted": 2067433, - "total_column_articles": 7093, + "total_acs": 1378518, + "total_submitted": 2081099, + "total_column_articles": 7132, "frontend_question_id": "21", "is_new_question": false }, @@ -63537,9 +64188,9 @@ "question__title": "Valid Parentheses", "question__title_slug": "valid-parentheses", "question__hide": false, - "total_acs": 1465801, - "total_submitted": 3323619, - "total_column_articles": 9512, + "total_acs": 1475344, + "total_submitted": 3346514, + "total_column_articles": 9563, "frontend_question_id": "20", "is_new_question": false }, @@ -63558,9 +64209,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": 1113861, - "total_submitted": 2449776, - "total_column_articles": 7777, + "total_acs": 1122402, + "total_submitted": 2466284, + "total_column_articles": 7814, "frontend_question_id": "19", "is_new_question": false }, @@ -63579,9 +64230,9 @@ "question__title": "4Sum", "question__title_slug": "4sum", "question__hide": false, - "total_acs": 448421, - "total_submitted": 1211715, - "total_column_articles": 2791, + "total_acs": 451981, + "total_submitted": 1222686, + "total_column_articles": 2821, "frontend_question_id": "18", "is_new_question": false }, @@ -63600,9 +64251,9 @@ "question__title": "Letter Combinations of a Phone Number", "question__title_slug": "letter-combinations-of-a-phone-number", "question__hide": false, - "total_acs": 685326, - "total_submitted": 1180537, - "total_column_articles": 5433, + "total_acs": 690698, + "total_submitted": 1189640, + "total_column_articles": 5459, "frontend_question_id": "17", "is_new_question": false }, @@ -63621,9 +64272,9 @@ "question__title": "3Sum Closest", "question__title_slug": "3sum-closest", "question__hide": false, - "total_acs": 462683, - "total_submitted": 1030184, - "total_column_articles": 2407, + "total_acs": 465404, + "total_submitted": 1036496, + "total_column_articles": 2417, "frontend_question_id": "16", "is_new_question": false }, @@ -63642,9 +64293,9 @@ "question__title": "3Sum", "question__title_slug": "3sum", "question__hide": false, - "total_acs": 1351264, - "total_submitted": 3658984, - "total_column_articles": 5778, + "total_acs": 1361887, + "total_submitted": 3685298, + "total_column_articles": 5816, "frontend_question_id": "15", "is_new_question": false }, @@ -63663,9 +64314,9 @@ "question__title": "Longest Common Prefix", "question__title_slug": "longest-common-prefix", "question__hide": false, - "total_acs": 1078424, - "total_submitted": 2492216, - "total_column_articles": 6575, + "total_acs": 1084978, + "total_submitted": 2505849, + "total_column_articles": 6612, "frontend_question_id": "14", "is_new_question": false }, @@ -63684,9 +64335,9 @@ "question__title": "Roman to Integer", "question__title_slug": "roman-to-integer", "question__hide": false, - "total_acs": 817967, - "total_submitted": 1317501, - "total_column_articles": 6528, + "total_acs": 823256, + "total_submitted": 1326364, + "total_column_articles": 6560, "frontend_question_id": "13", "is_new_question": false }, @@ -63705,9 +64356,9 @@ "question__title": "Integer to Roman", "question__title_slug": "integer-to-roman", "question__hide": false, - "total_acs": 380055, - "total_submitted": 574627, - "total_column_articles": 2935, + "total_acs": 382751, + "total_submitted": 578748, + "total_column_articles": 2953, "frontend_question_id": "12", "is_new_question": false }, @@ -63726,9 +64377,9 @@ "question__title": "Container With Most Water", "question__title_slug": "container-with-most-water", "question__hide": false, - "total_acs": 973399, - "total_submitted": 1613678, - "total_column_articles": 5393, + "total_acs": 981156, + "total_submitted": 1626991, + "total_column_articles": 5427, "frontend_question_id": "11", "is_new_question": false }, @@ -63747,9 +64398,9 @@ "question__title": "Regular Expression Matching", "question__title_slug": "regular-expression-matching", "question__hide": false, - "total_acs": 365563, - "total_submitted": 1186196, - "total_column_articles": 2159, + "total_acs": 367542, + "total_submitted": 1193577, + "total_column_articles": 2165, "frontend_question_id": "10", "is_new_question": false }, @@ -63768,9 +64419,9 @@ "question__title": "Palindrome Number", "question__title_slug": "palindrome-number", "question__hide": false, - "total_acs": 1350778, - "total_submitted": 2409910, - "total_column_articles": 8227, + "total_acs": 1359069, + "total_submitted": 2425766, + "total_column_articles": 8263, "frontend_question_id": "9", "is_new_question": false }, @@ -63789,9 +64440,9 @@ "question__title": "String to Integer (atoi)", "question__title_slug": "string-to-integer-atoi", "question__hide": false, - "total_acs": 568051, - "total_submitted": 2669480, - "total_column_articles": 4215, + "total_acs": 570838, + "total_submitted": 2684285, + "total_column_articles": 4226, "frontend_question_id": "8", "is_new_question": false }, @@ -63810,9 +64461,9 @@ "question__title": "Reverse Integer", "question__title_slug": "reverse-integer", "question__hide": false, - "total_acs": 1186825, - "total_submitted": 3354074, - "total_column_articles": 7170, + "total_acs": 1191128, + "total_submitted": 3366448, + "total_column_articles": 7185, "frontend_question_id": "7", "is_new_question": false }, @@ -63831,9 +64482,9 @@ "question__title": "Zigzag Conversion", "question__title_slug": "zigzag-conversion", "question__hide": false, - "total_acs": 557629, - "total_submitted": 1071261, - "total_column_articles": 4544, + "total_acs": 561076, + "total_submitted": 1077809, + "total_column_articles": 4570, "frontend_question_id": "6", "is_new_question": false }, @@ -63852,9 +64503,9 @@ "question__title": "Longest Palindromic Substring", "question__title_slug": "longest-palindromic-substring", "question__hide": false, - "total_acs": 1405531, - "total_submitted": 3745779, - "total_column_articles": 7505, + "total_acs": 1414378, + "total_submitted": 3767556, + "total_column_articles": 7547, "frontend_question_id": "5", "is_new_question": false }, @@ -63873,9 +64524,9 @@ "question__title": "Median of Two Sorted Arrays", "question__title_slug": "median-of-two-sorted-arrays", "question__hide": false, - "total_acs": 942234, - "total_submitted": 2267313, - "total_column_articles": 6834, + "total_acs": 947581, + "total_submitted": 2283297, + "total_column_articles": 6865, "frontend_question_id": "4", "is_new_question": false }, @@ -63894,9 +64545,9 @@ "question__title": "Longest Substring Without Repeating Characters", "question__title_slug": "longest-substring-without-repeating-characters", "question__hide": false, - "total_acs": 2311143, - "total_submitted": 5911501, - "total_column_articles": 13482, + "total_acs": 2326606, + "total_submitted": 5949390, + "total_column_articles": 13552, "frontend_question_id": "3", "is_new_question": false }, @@ -63915,9 +64566,9 @@ "question__title": "Add Two Numbers", "question__title_slug": "add-two-numbers", "question__hide": false, - "total_acs": 1729425, - "total_submitted": 4081407, - "total_column_articles": 11946, + "total_acs": 1739515, + "total_submitted": 4103598, + "total_column_articles": 12000, "frontend_question_id": "2", "is_new_question": false }, @@ -63936,9 +64587,9 @@ "question__title": "Two Sum", "question__title_slug": "two-sum", "question__hide": false, - "total_acs": 4439860, - "total_submitted": 8397251, - "total_column_articles": 21567, + "total_acs": 4468090, + "total_submitted": 8449437, + "total_column_articles": 21658, "frontend_question_id": "1", "is_new_question": false }, diff --git a/leetcode-cn/originData/Nsibyl.json b/leetcode-cn/originData/Nsibyl.json new file mode 100644 index 00000000..c30f34e7 --- /dev/null +++ b/leetcode-cn/originData/Nsibyl.json @@ -0,0 +1,161 @@ +{ + "data": { + "question": { + "questionId": "1000566", + "questionFrontendId": "LCP 78", + "categoryTitle": "Algorithms", + "boundTopicId": 2258735, + "title": "城墙防线", + "titleSlug": "Nsibyl", + "content": "", + "translatedTitle": "城墙防线", + "translatedContent": "在探险营地间,小扣意外发现了一片城墙遗迹,在探索期间,却不巧遇到迁徙中的兽群向他迎面冲来。情急之下小扣吹响了他的苍蓝笛,随着笛声响起,遗迹中的城墙逐渐发生了横向膨胀。\n已知 `rampart[i] = [x,y]` 表示第 `i` 段城墙的初始所在区间。当城墙发生膨胀时,将遵循以下规则:\n- 所有的城墙会同时膨胀相等的长度;\n- 每个城墙可以向左、向右或向两个方向膨胀。\n\n小扣为了确保自身的安全,需要在所有城墙均无重叠的情况下,让城墙尽可能的膨胀。请返回城墙可以膨胀的 **最大值** 。\n\n**注意:**\n- 初始情况下,所有城墙均不重叠,且 `rampart` 中的元素升序排列;\n- 两侧的城墙可以向外无限膨胀。\n\n**示例 1:**\n>输入:`rampart = [[0,3],[4,5],[7,9]]`\n>\n>输出:`3`\n>\n>解释:如下图所示:\n>`rampart[0]` 向左侧膨胀 3 个单位;\n>`rampart[2]` 向右侧膨胀 3 个单位;\n>`rampart[1]` 向左侧膨胀 1 个单位,向右膨胀 2 个单位。\n>不存在膨胀更多的方案,返回 3。\n![image.png](https://pic.leetcode.cn/1681717918-tWywrp-image.png){:width=750px}\n\n**示例 2:**\n>输入:`rampart = [[1,2],[5,8],[11,15],[18,25]]`\n>\n>输出:`4`\n\n**提示:**\n- `3 <= rampart.length <= 10^4`\n- `rampart[i].length == 2`\n- `0 <= rampart[i][0] < rampart[i][1] <= rampart[i+1][0] <= 10^8`", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 6, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": false, \"java\": true, \"python\": true, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int rampartDefensiveLine(vector>& rampart) {\n\n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int rampartDefensiveLine(int[][] rampart) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def rampartDefensiveLine(self, rampart):\n \"\"\"\n :type rampart: List[List[int]]\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def rampartDefensiveLine(self, rampart: List[List[int]]) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int rampartDefensiveLine(int** rampart, int rampartSize, int* rampartColSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int RampartDefensiveLine(int[][] rampart) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[][]} rampart\n * @return {number}\n */\nvar rampartDefensiveLine = function(rampart) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[][]} rampart\n# @return {Integer}\ndef rampart_defensive_line(rampart)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func rampartDefensiveLine(_ rampart: [[Int]]) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func rampartDefensiveLine(rampart [][]int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def rampartDefensiveLine(rampart: Array[Array[Int]]): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun rampartDefensiveLine(rampart: Array): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn rampart_defensive_line(rampart: Vec>) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[][] $rampart\n * @return Integer\n */\n function rampartDefensiveLine($rampart) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function rampartDefensiveLine(rampart: number[][]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (rampart-defensive-line rampart)\n (-> (listof (listof exact-integer?)) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec rampart_defensive_line(Rampart :: [[integer()]]) -> integer().\nrampart_defensive_line(Rampart) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec rampart_defensive_line(rampart :: [[integer]]) :: integer\n def rampart_defensive_line(rampart) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int rampartDefensiveLine(List> rampart) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"1.3K\", \"totalSubmission\": \"3K\", \"totalAcceptedRaw\": 1312, \"totalSubmissionRaw\": 2959, \"acRate\": \"44.3%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "[[0,3],[4,5],[7,9]]", + "metaData": "{\"name\": \"rampartDefensiveLine\", \"params\": [{\"name\": \"rampart\", \"type\": \"integer[][]\"}], \"return\": {\"type\": \"integer\"}}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n

\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"

\\u7248\\u672c\\uff1aSwift 5.5.2<\\/code><\\/p>\\r\\n\\r\\n

\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"

\\u7248\\u672c\\uff1aGo 1.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/code><\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"

\\u7248\\u672c\\uff1aScala 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/p>\\r\\n\\r\\n

\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n

\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"],\"dart\":[\"Dart\",\"

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "MARKDOWN", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[[0,3],[4,5],[7,9]]\n[[1,2],[5,8],[11,15],[18,25]]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/W2ZX4X.json b/leetcode-cn/originData/W2ZX4X.json new file mode 100644 index 00000000..6c60eb2a --- /dev/null +++ b/leetcode-cn/originData/W2ZX4X.json @@ -0,0 +1,161 @@ +{ + "data": { + "question": { + "questionId": "1000565", + "questionFrontendId": "LCP 77", + "categoryTitle": "Algorithms", + "boundTopicId": 2260464, + "title": "符文储备", + "titleSlug": "W2ZX4X", + "content": "", + "translatedTitle": "符文储备", + "translatedContent": "远征队在出发前需要携带一些「符文」,作为后续的冒险储备。`runes[i]` 表示第 `i` 枚符文的魔力值。\n\n他们将从中选取若干符文进行携带,并对这些符文进行重新排列,以确保任意相邻的两块符文之间的魔力值相差不超过 `1`。\n\n请返回他们能够携带的符文 **最大数量**。\n\n**示例 1:**\n>输入:`runes = [1,3,5,4,1,7]`\n>\n>输出:`3`\n>\n>解释:最佳的选择方案为[3,5,4]\n>将其排列为 [3,4,5] 后,任意相邻的两块符文魔力值均不超过 `1`,携带数量为 `3`\n>其他满足条件的方案为 [1,1] 和 [7],数量均小于 3。\n>因此返回可携带的最大数量 `3`。\n\n**示例 2:**\n>输入:`runes = [1,1,3,3,2,4]`\n>\n>输出:`6`\n>\n>解释:排列为 [1,1,2,3,3,4],可携带所有的符文\n\n**提示:**\n- `1 <= runes.length <= 10^4`\n- `0 <= runes[i] <= 10^4`\n", + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 2, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int runeReserve(vector& runes) {\n\n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int runeReserve(int[] runes) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def runeReserve(self, runes):\n \"\"\"\n :type runes: List[int]\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def runeReserve(self, runes: List[int]) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int runeReserve(int* runes, int runesSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int RuneReserve(int[] runes) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} runes\n * @return {number}\n */\nvar runeReserve = function(runes) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} runes\n# @return {Integer}\ndef rune_reserve(runes)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func runeReserve(_ runes: [Int]) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func runeReserve(runes []int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def runeReserve(runes: Array[Int]): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun runeReserve(runes: IntArray): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn rune_reserve(runes: Vec) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $runes\n * @return Integer\n */\n function runeReserve($runes) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function runeReserve(runes: number[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (rune-reserve runes)\n (-> (listof exact-integer?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec rune_reserve(Runes :: [integer()]) -> integer().\nrune_reserve(Runes) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec rune_reserve(runes :: [integer]) :: integer\n def rune_reserve(runes) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int runeReserve(List runes) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"1.8K\", \"totalSubmission\": \"2.5K\", \"totalAcceptedRaw\": 1821, \"totalSubmissionRaw\": 2475, \"acRate\": \"73.6%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "[1,3,5,4,1,7]", + "metaData": "{\"name\": \"runeReserve\", \"params\": [{\"name\": \"runes\", \"type\": \"integer[]\"}], \"return\": {\"type\": \"integer\"}}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n

\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"

\\u7248\\u672c\\uff1aSwift 5.5.2<\\/code><\\/p>\\r\\n\\r\\n

\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"

\\u7248\\u672c\\uff1aGo 1.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/code><\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"

\\u7248\\u672c\\uff1aScala 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/p>\\r\\n\\r\\n

\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n

\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"],\"dart\":[\"Dart\",\"

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "MARKDOWN", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[1,3,5,4,1,7]\n[1,1,3,3,2,4]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/[no content]bikes-last-time-used.json b/leetcode-cn/originData/[no content]bikes-last-time-used.json new file mode 100644 index 00000000..3dcee4e8 --- /dev/null +++ b/leetcode-cn/originData/[no content]bikes-last-time-used.json @@ -0,0 +1,55 @@ +{ + "data": { + "question": { + "questionId": "2841", + "questionFrontendId": "2687", + "categoryTitle": "Database", + "boundTopicId": 2269584, + "title": "Bikes Last Time Used ", + "titleSlug": "bikes-last-time-used", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Easy", + "likes": 0, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": null, + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"21\", \"totalSubmission\": \"21\", \"totalAcceptedRaw\": 21, \"totalSubmissionRaw\": 21, \"acRate\": \"100.0%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\":{\"Bikes\":[\"ride_id\",\"bike_number\",\"start_time\",\"end_time\"]},\"rows\":{\"Bikes\":[[1,\"W00576\",\"2012-03-25 11:30:00\",\"2012-03-25 12:40:00\"],[2,\"W00300\",\"2012-03-25 10:30:00\",\"2012-03-25 10:50:00\"],[3,\"W00455\",\"2012-03-26 14:30:00\",\"2012-03-26 17:40:00\"],[4,\"W00455\",\"2012-03-25 12:30:00\",\"2012-03-25 13:40:00\"],[5,\"W00576\",\"2012-03-25 08:10:00\",\"2012-03-25 09:10:00\"],[6,\"W00576\",\"2012-03-28 02:30:00\",\"2012-03-28 02:50:00\"]]}}", + "metaData": "{\n \"mysql\": [\n \"Create table If Not Exists Bikes (ride_id int,bike_number varchar(100), start_time datetime,end_time datetime)\"\n ],\n \"mssql\": [\n \"Create table Bikes (ride_id int,bike_number varchar(100), start_time datetime,end_time datetime)\"\n ],\n \"oraclesql\": [\n \"Create table Bikes (ride_id int,bike_number varchar(100), start_time date,end_time date)\",\n \"ALTER SESSION SET nls_date_format='YYYY-MM-DD HH24:MI:SS'\"\n ],\n \"database\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "Create table If Not Exists Bikes (ride_id int,bike_number varchar(100), start_time datetime,end_time datetime)", + "Truncate table Bikes", + "insert into Bikes (ride_id, bike_number, start_time, end_time) values ('1', 'W00576', '2012-03-25 11:30:00', '2012-03-25 12:40:00')", + "insert into Bikes (ride_id, bike_number, start_time, end_time) values ('2', 'W00300', '2012-03-25 10:30:00', '2012-03-25 10:50:00')", + "insert into Bikes (ride_id, bike_number, start_time, end_time) values ('3', 'W00455', '2012-03-26 14:30:00', '2012-03-26 17:40:00')", + "insert into Bikes (ride_id, bike_number, start_time, end_time) values ('4', 'W00455', '2012-03-25 12:30:00', '2012-03-25 13:40:00')", + "insert into Bikes (ride_id, bike_number, start_time, end_time) values ('5', 'W00576', '2012-03-25 08:10:00', '2012-03-25 09:10:00')", + "insert into Bikes (ride_id, bike_number, start_time, end_time) values ('6', 'W00576', '2012-03-28 02:30:00', '2012-03-28 02:50:00')" + ], + "enableRunCode": true, + "envInfo": "{\"mysql\":[\"MySQL\",\"

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

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

Oracle Sql 11.2.<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "{\"headers\":{\"Bikes\":[\"ride_id\",\"bike_number\",\"start_time\",\"end_time\"]},\"rows\":{\"Bikes\":[[1,\"W00576\",\"2012-03-25 11:30:00\",\"2012-03-25 12:40:00\"],[2,\"W00300\",\"2012-03-25 10:30:00\",\"2012-03-25 10:50:00\"],[3,\"W00455\",\"2012-03-26 14:30:00\",\"2012-03-26 17:40:00\"],[4,\"W00455\",\"2012-03-25 12:30:00\",\"2012-03-25 13:40:00\"],[5,\"W00576\",\"2012-03-25 08:10:00\",\"2012-03-25 09:10:00\"],[6,\"W00576\",\"2012-03-28 02:30:00\",\"2012-03-28 02:50:00\"]]}}", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/[no content]count-artist-occurrences-on-spotify-ranking-list.json b/leetcode-cn/originData/[no content]count-artist-occurrences-on-spotify-ranking-list.json new file mode 100644 index 00000000..6c34e12f --- /dev/null +++ b/leetcode-cn/originData/[no content]count-artist-occurrences-on-spotify-ranking-list.json @@ -0,0 +1,61 @@ +{ + "data": { + "question": { + "questionId": "2830", + "questionFrontendId": "2669", + "categoryTitle": "Database", + "boundTopicId": 2259120, + "title": "Count Artist Occurrences On Spotify Ranking List", + "titleSlug": "count-artist-occurrences-on-spotify-ranking-list", + "content": null, + "translatedTitle": "统计 Spotify 排行榜上艺术家出现次数", + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Easy", + "likes": 0, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": null, + "topicTags": [ + { + "name": "Database", + "slug": "database", + "translatedName": "数据库", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"71\", \"totalSubmission\": \"90\", \"totalAcceptedRaw\": 71, \"totalSubmissionRaw\": 90, \"acRate\": \"78.9%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\":{\"Spotify\":[\"id\",\"track_name\",\"artist\"]},\"rows\":{\"Spotify\":[[303651,\"Heart Won't Forget\",\"Ed Sheeran\"],[1046089,\"Shape of you\",\"Sia\"],[33445,\"I'm the one\",\"DJ Khalid\"],[811266,\"Young Dumb & Broke\",\"DJ Khalid\"],[505727,\"Happier\",\"Ed Sheeran\"]]}}", + "metaData": "{\n \"mysql\": [\n \"Create table If Not Exists Spotify (id int,track_name varchar(100),artist varchar(100))\"\n ],\n \"mssql\": [\n \"Create table Spotify (id int,track_name varchar(100),artist varchar(100))\"\n ],\n \"oraclesql\": [\n \"Create table Spotify (id int,track_name varchar(100),artist varchar(100))\"\n ],\n \"database\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "Create table If Not Exists Spotify (id int,track_name varchar(100),artist varchar(100))", + "Truncate table Spotify", + "insert into Spotify (id, track_name, artist) values ('303651', 'Heart Won't Forget', 'Ed Sheeran')", + "insert into Spotify (id, track_name, artist) values ('1046089', 'Shape of you', 'Sia')", + "insert into Spotify (id, track_name, artist) values ('33445', 'I'm the one', 'DJ Khalid')", + "insert into Spotify (id, track_name, artist) values ('811266', 'Young Dumb & Broke', 'DJ Khalid')", + "insert into Spotify (id, track_name, artist) values ('505727', 'Happier', 'Ed Sheeran')" + ], + "enableRunCode": true, + "envInfo": "{\"mysql\":[\"MySQL\",\"

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

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

Oracle Sql 11.2.<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "{\"headers\":{\"Spotify\":[\"id\",\"track_name\",\"artist\"]},\"rows\":{\"Spotify\":[[303651,\"Heart Won't Forget\",\"Ed Sheeran\"],[1046089,\"Shape of you\",\"Sia\"],[33445,\"I'm the one\",\"DJ Khalid\"],[811266,\"Young Dumb & Broke\",\"DJ Khalid\"],[505727,\"Happier\",\"Ed Sheeran\"]]}}", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/[no content]find-active-users.json b/leetcode-cn/originData/[no content]find-active-users.json new file mode 100644 index 00000000..e871f89d --- /dev/null +++ b/leetcode-cn/originData/[no content]find-active-users.json @@ -0,0 +1,55 @@ +{ + "data": { + "question": { + "questionId": "2842", + "questionFrontendId": "2688", + "categoryTitle": "Database", + "boundTopicId": 2269585, + "title": "Find Active Users", + "titleSlug": "find-active-users", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 0, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": null, + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"14\", \"totalSubmission\": \"22\", \"totalAcceptedRaw\": 14, \"totalSubmissionRaw\": 22, \"acRate\": \"63.6%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\":{\"Users\":[\"user_id\",\"item\",\"created_at\",\"amount\"]},\"rows\":{\"Users\":[[5,\"Smart Crock Pot\",\"2021-09-18\",698882],[6,\"Smart Lock\",\"2021-09-14\",11487],[6,\"Smart Thermostat\",\"2021-09-10\",674762],[8,\"Smart Light Strip\",\"2021-09-29\",630773],[4,\"Smart Cat Feeder\",\"2021-09-02\",693545],[4,\"Smart Bed\",\"2021-09-13\",170249]]}}", + "metaData": "{\n \"mysql\": [\n \"Create table If Not Exists Users (user_id int, item varchar(100),created_at date,amount int)\"\n ],\n \"mssql\": [\n \"Create table Users (user_id int, item varchar(100),created_at date,amount int)\"\n ],\n \"oraclesql\": [\n \"Create table Users (user_id int, item varchar(100),created_at date,amount int)\",\n \"ALTER SESSION SET nls_date_format='YYYY-MM-DD'\"\n ],\n \"database\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "Create table If Not Exists Users (user_id int, item varchar(100),created_at date,amount int)", + "Truncate table Users", + "insert into Users (user_id, item, created_at, amount) values ('5', 'Smart Crock Pot', '2021-09-18', '698882')", + "insert into Users (user_id, item, created_at, amount) values ('6', 'Smart Lock', '2021-09-14', '11487')", + "insert into Users (user_id, item, created_at, amount) values ('6', 'Smart Thermostat', '2021-09-10', '674762')", + "insert into Users (user_id, item, created_at, amount) values ('8', 'Smart Light Strip', '2021-09-29', '630773')", + "insert into Users (user_id, item, created_at, amount) values ('4', 'Smart Cat Feeder', '2021-09-02', '693545')", + "insert into Users (user_id, item, created_at, amount) values ('4', 'Smart Bed', '2021-09-13', '170249')" + ], + "enableRunCode": true, + "envInfo": "{\"mysql\":[\"MySQL\",\"

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

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

Oracle Sql 11.2.<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "{\"headers\":{\"Users\":[\"user_id\",\"item\",\"created_at\",\"amount\"]},\"rows\":{\"Users\":[[5,\"Smart Crock Pot\",\"2021-09-18\",698882],[6,\"Smart Lock\",\"2021-09-14\",11487],[6,\"Smart Thermostat\",\"2021-09-10\",674762],[8,\"Smart Light Strip\",\"2021-09-29\",630773],[4,\"Smart Cat Feeder\",\"2021-09-02\",693545],[4,\"Smart Bed\",\"2021-09-13\",170249]]}}", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/[no content]find-latest-salaries.json b/leetcode-cn/originData/[no content]find-latest-salaries.json new file mode 100644 index 00000000..a23c537c --- /dev/null +++ b/leetcode-cn/originData/[no content]find-latest-salaries.json @@ -0,0 +1,66 @@ +{ + "data": { + "question": { + "questionId": "2829", + "questionFrontendId": "2668", + "categoryTitle": "Database", + "boundTopicId": 2257550, + "title": "Find Latest Salaries", + "titleSlug": "find-latest-salaries", + "content": null, + "translatedTitle": "查询员工当前薪水", + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Easy", + "likes": 0, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": null, + "topicTags": [ + { + "name": "Database", + "slug": "database", + "translatedName": "数据库", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"79\", \"totalSubmission\": \"109\", \"totalAcceptedRaw\": 79, \"totalSubmissionRaw\": 109, \"acRate\": \"72.5%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\":{\"Salary\":[\"emp_id\",\"firstname\",\"lastname\",\"salary\",\"department_id\"]},\"rows\":{\"Salary\":[[1,\"Todd\",\"Wilson\",110000,\"D1006\"],[1,\"Todd\",\"Wilson\",106119,\"D1006\"],[2,\"Justin\",\"Simon\",128922,\"D1005\"],[2,\"Justin\",\"Simon\",130000,\"D1005\"],[3,\"Kelly\",\"Rosario\",42689,\"D1002\"],[4,\"Patricia\",\"Powell\",162825,\"D1004\"],[4,\"Patricia\",\"Powell\",170000,\"D1004\"],[5,\"Sherry\",\"Golden\",44101,\"D1002\"],[6,\"Natasha\",\"Swanson\",79632,\"D1005\"],[6,\"Natasha\",\"Swanson\",90000,\"D1005\"]]}}", + "metaData": "{\n \"mysql\": [\n \"Create table If Not Exists Salary (emp_id int,firstname varchar(100),lastname varchar(100),salary int, department_id varchar(100))\"\n ],\n \"mssql\": [\n \"Create table Salary (emp_id int,firstname varchar(100),lastname varchar(100),salary int, department_id varchar(100))\"\n ],\n \"oraclesql\": [\n \"Create table Salary (emp_id int,firstname varchar(100),lastname varchar(100),salary int, department_id varchar(100))\"\n ],\n \"database\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "Create table If Not Exists Salary (emp_id int,firstname varchar(100),lastname varchar(100),salary int, department_id varchar(100))", + "Truncate table Salary", + "insert into Salary (emp_id, firstname, lastname, salary, department_id) values ('1', 'Todd', 'Wilson', '110000', 'D1006')", + "insert into Salary (emp_id, firstname, lastname, salary, department_id) values ('1', 'Todd', 'Wilson', '106119', 'D1006')", + "insert into Salary (emp_id, firstname, lastname, salary, department_id) values ('2', 'Justin', 'Simon', '128922', 'D1005')", + "insert into Salary (emp_id, firstname, lastname, salary, department_id) values ('2', 'Justin', 'Simon', '130000', 'D1005')", + "insert into Salary (emp_id, firstname, lastname, salary, department_id) values ('3', 'Kelly', 'Rosario', '42689', 'D1002')", + "insert into Salary (emp_id, firstname, lastname, salary, department_id) values ('4', 'Patricia', 'Powell', '162825', 'D1004')", + "insert into Salary (emp_id, firstname, lastname, salary, department_id) values ('4', 'Patricia', 'Powell', '170000', 'D1004')", + "insert into Salary (emp_id, firstname, lastname, salary, department_id) values ('5', 'Sherry', 'Golden', '44101', 'D1002')", + "insert into Salary (emp_id, firstname, lastname, salary, department_id) values ('6', 'Natasha', 'Swanson', '79632', 'D1005')", + "insert into Salary (emp_id, firstname, lastname, salary, department_id) values ('6', 'Natasha', 'Swanson', '90000', 'D1005')" + ], + "enableRunCode": true, + "envInfo": "{\"mysql\":[\"MySQL\",\"

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

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

Oracle Sql 11.2.<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "{\"headers\":{\"Salary\":[\"emp_id\",\"firstname\",\"lastname\",\"salary\",\"department_id\"]},\"rows\":{\"Salary\":[[1,\"Todd\",\"Wilson\",110000,\"D1006\"],[1,\"Todd\",\"Wilson\",106119,\"D1006\"],[2,\"Justin\",\"Simon\",128922,\"D1005\"],[2,\"Justin\",\"Simon\",130000,\"D1005\"],[3,\"Kelly\",\"Rosario\",42689,\"D1002\"],[4,\"Patricia\",\"Powell\",162825,\"D1004\"],[4,\"Patricia\",\"Powell\",170000,\"D1004\"],[5,\"Sherry\",\"Golden\",44101,\"D1002\"],[6,\"Natasha\",\"Swanson\",79632,\"D1005\"],[6,\"Natasha\",\"Swanson\",90000,\"D1005\"]]}}", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/[no content]immediate-food-delivery-iii.json b/leetcode-cn/originData/[no content]immediate-food-delivery-iii.json new file mode 100644 index 00000000..2c12cc89 --- /dev/null +++ b/leetcode-cn/originData/[no content]immediate-food-delivery-iii.json @@ -0,0 +1,59 @@ +{ + "data": { + "question": { + "questionId": "2840", + "questionFrontendId": "2686", + "categoryTitle": "Database", + "boundTopicId": 2269586, + "title": "Immediate Food Delivery III", + "titleSlug": "immediate-food-delivery-iii", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 0, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": null, + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"18\", \"totalSubmission\": \"21\", \"totalAcceptedRaw\": 18, \"totalSubmissionRaw\": 21, \"acRate\": \"85.7%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\":{\"Delivery\":[\"delivery_id\",\"customer_id\",\"order_date\",\"customer_pref_delivery_date\"]},\"rows\":{\"Delivery\":[[1,1,\"2019-08-01\",\"2019-08-02\"],[2,2,\"2019-08-01\",\"2019-08-01\"],[3,1,\"2019-08-01\",\"2019-08-01\"],[4,3,\"2019-08-02\",\"2019-08-13\"],[5,3,\"2019-08-02\",\"2019-08-02\"],[6,2,\"2019-08-02\",\"2019-08-02\"],[7,4,\"2019-08-03\",\"2019-08-03\"],[8,1,\"2019-08-03\",\"2019-08-03\"],[9,5,\"2019-08-04\",\"2019-08-18\"],[10,2,\"2019-08-04\",\"2019-08-18\"]]}}", + "metaData": "{\n \"mysql\": [\n \"Create table If Not Exists Delivery (delivery_id int, customer_id int, order_date date, customer_pref_delivery_date date)\"\n ],\n \"mssql\": [\n \"Create table Delivery (delivery_id int, customer_id int, order_date date, customer_pref_delivery_date date)\"\n ],\n \"oraclesql\": [\n \"Create table Delivery (delivery_id int, customer_id int, order_date date, customer_pref_delivery_date date)\",\n \"ALTER SESSION SET nls_date_format='YYYY-MM-DD'\"\n ],\n \"database\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "Create table If Not Exists Delivery (delivery_id int, customer_id int, order_date date, customer_pref_delivery_date date)", + "Truncate table Delivery", + "insert into Delivery (delivery_id, customer_id, order_date, customer_pref_delivery_date) values ('1', '1', '2019-08-01', '2019-08-02')", + "insert into Delivery (delivery_id, customer_id, order_date, customer_pref_delivery_date) values ('2', '2', '2019-08-01', '2019-08-01')", + "insert into Delivery (delivery_id, customer_id, order_date, customer_pref_delivery_date) values ('3', '1', '2019-08-01', '2019-08-01')", + "insert into Delivery (delivery_id, customer_id, order_date, customer_pref_delivery_date) values ('4', '3', '2019-08-02', '2019-08-13')", + "insert into Delivery (delivery_id, customer_id, order_date, customer_pref_delivery_date) values ('5', '3', '2019-08-02', '2019-08-02')", + "insert into Delivery (delivery_id, customer_id, order_date, customer_pref_delivery_date) values ('6', '2', '2019-08-02', '2019-08-02')", + "insert into Delivery (delivery_id, customer_id, order_date, customer_pref_delivery_date) values ('7', '4', '2019-08-03', '2019-08-03')", + "insert into Delivery (delivery_id, customer_id, order_date, customer_pref_delivery_date) values ('8', '1', '2019-08-03', '2019-08-03')", + "insert into Delivery (delivery_id, customer_id, order_date, customer_pref_delivery_date) values ('9', '5', '2019-08-04', '2019-08-18')", + "insert into Delivery (delivery_id, customer_id, order_date, customer_pref_delivery_date) values ('10', '2', '2019-08-04', '2019-08-18')" + ], + "enableRunCode": true, + "envInfo": "{\"mysql\":[\"MySQL\",\"

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

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

Oracle Sql 11.2.<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "{\"headers\":{\"Delivery\":[\"delivery_id\",\"customer_id\",\"order_date\",\"customer_pref_delivery_date\"]},\"rows\":{\"Delivery\":[[1,1,\"2019-08-01\",\"2019-08-02\"],[2,2,\"2019-08-01\",\"2019-08-01\"],[3,1,\"2019-08-01\",\"2019-08-01\"],[4,3,\"2019-08-02\",\"2019-08-13\"],[5,3,\"2019-08-02\",\"2019-08-02\"],[6,2,\"2019-08-02\",\"2019-08-02\"],[7,4,\"2019-08-03\",\"2019-08-03\"],[8,1,\"2019-08-03\",\"2019-08-03\"],[9,5,\"2019-08-04\",\"2019-08-18\"],[10,2,\"2019-08-04\",\"2019-08-18\"]]}}", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/[no content]split-a-circular-linked-list.json b/leetcode-cn/originData/[no content]split-a-circular-linked-list.json new file mode 100644 index 00000000..e7cd047b --- /dev/null +++ b/leetcode-cn/originData/[no content]split-a-circular-linked-list.json @@ -0,0 +1,51 @@ +{ + "data": { + "question": { + "questionId": "2835", + "questionFrontendId": "2674", + "categoryTitle": "Algorithms", + "boundTopicId": 2265847, + "title": "Split a Circular Linked List", + "titleSlug": "split-a-circular-linked-list", + "content": null, + "translatedTitle": "拆分循环链表", + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 0, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": null, + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"36\", \"totalSubmission\": \"37\", \"totalAcceptedRaw\": 36, \"totalSubmissionRaw\": 37, \"acRate\": \"97.3%\"}", + "hints": [ + "Do a while loop to calculate the size of the linked list.", + "Determine the size of the first half and create a new linked list in its size.", + "Do not forget that this half itself should be circular!", + "Use the previous hints for the second half." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,5,7]", + "metaData": "{\n \"name\": \"splitCircularLinkedList\",\n \"params\": [\n {\n \"name\": \"list\",\n \"type\": \"ListNode\"\n }\n ],\n \"return\": {\n \"type\": \"ListNode[]\"\n },\n \"manual\": true,\n \"languages\": [\n \"cpp\",\n \"java\",\n \"python\",\n \"c\",\n \"csharp\",\n \"javascript\",\n \"ruby\",\n \"swift\",\n \"golang\",\n \"python3\",\n \"scala\",\n \"kotlin\",\n \"php\",\n \"typescript\",\n \"dart\"\n ]\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n

\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"

\\u7248\\u672c\\uff1aSwift 5.5.2<\\/code><\\/p>\\r\\n\\r\\n

\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"

\\u7248\\u672c\\uff1aGo 1.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/code><\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"

\\u7248\\u672c\\uff1aScala 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"dart\":[\"Dart\",\"

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[1,5,7]\n[2,6,1,5]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/[no content]the-knights-tour.json b/leetcode-cn/originData/[no content]the-knights-tour.json new file mode 100644 index 00000000..1f0411a7 --- /dev/null +++ b/leetcode-cn/originData/[no content]the-knights-tour.json @@ -0,0 +1,65 @@ +{ + "data": { + "question": { + "questionId": "2823", + "questionFrontendId": "2664", + "categoryTitle": "Algorithms", + "boundTopicId": 2254929, + "title": "The Knight’s Tour", + "titleSlug": "the-knights-tour", + "content": null, + "translatedTitle": "巡逻的骑士", + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 2, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": null, + "topicTags": [ + { + "name": "Recursion", + "slug": "recursion", + "translatedName": "递归", + "__typename": "TopicTagNode" + }, + { + "name": "Array", + "slug": "array", + "translatedName": "数组", + "__typename": "TopicTagNode" + }, + { + "name": "Matrix", + "slug": "matrix", + "translatedName": "矩阵", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"45\", \"totalSubmission\": \"69\", \"totalAcceptedRaw\": 45, \"totalSubmissionRaw\": 69, \"acRate\": \"65.2%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "1\n1\n0\n0", + "metaData": "{\n \"name\": \"tourOfKnight\",\n \"params\": [\n {\n \"name\": \"m\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"n\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"r\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"c\"\n }\n ],\n \"return\": {\n \"type\": \"integer[][]\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n

\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"

\\u7248\\u672c\\uff1aSwift 5.5.2<\\/code><\\/p>\\r\\n\\r\\n

\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"

\\u7248\\u672c\\uff1aGo 1.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/code><\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"

\\u7248\\u672c\\uff1aScala 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/p>\\r\\n\\r\\n

\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n

\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"],\"dart\":[\"Dart\",\"

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "1\n1\n0\n0\n3\n4\n0\n0", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/allow-one-function-call.json b/leetcode-cn/originData/allow-one-function-call.json new file mode 100644 index 00000000..a90c05aa --- /dev/null +++ b/leetcode-cn/originData/allow-one-function-call.json @@ -0,0 +1,59 @@ +{ + "data": { + "question": { + "questionId": "2796", + "questionFrontendId": "2666", + "categoryTitle": "JavaScript", + "boundTopicId": 2262650, + "title": "Allow One Function Call", + "titleSlug": "allow-one-function-call", + "content": "

Given a function fn, return a new function that is identical to the original function except that it ensures fn is called at most once.

\n\n
    \n\t
  • The first time the returned function is called, it should return the same result as fn.
  • \n\t
  • Every subsequent time it is called, it should return undefined.
  • \n
\n\n

 

\n

Example 1:

\n\n
\nInput: fn = (a,b,c) => (a + b + c), calls = [[1,2,3],[2,3,6]]\nOutput: [{"calls":1,"value":6}]\nExplanation:\nconst onceFn = once(fn);\nonceFn(1, 2, 3); // 6\nonceFn(2, 3, 6); // undefined, fn was not called\n
\n\n

Example 2:

\n\n
\nInput: fn = (a,b,c) => (a * b * c), calls = [[5,7,4],[2,3,6],[4,6,8]]\nOutput: [{"calls":1,"value":140}]\nExplanation:\nconst onceFn = once(fn);\nonceFn(5, 7, 4); // 140\nonceFn(2, 3, 6); // undefined, fn was not called\nonceFn(4, 6, 8); // undefined, fn was not called\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= calls.length <= 10
  • \n\t
  • 1 <= calls[i].length <= 100
  • \n\t
  • 2 <= JSON.stringify(calls).length <= 1000
  • \n
\n", + "translatedTitle": "只允许一次函数调用", + "translatedContent": "

给定一个函数 fn ,它返回一个新的函数,返回的函数与原始函数完全相同,只不过它确保 fn 最多被调用一次。

\n\n
    \n\t
  • 第一次调用返回的函数时,它应该返回与 fn 相同的结果。
  • \n\t
  • 第一次后的每次调用,它应该返回 undefined
  • \n
\n\n

 

\n\n

示例 1:

\n\n
\n输入:fn = (a,b,c) => (a + b + c), calls = [[1,2,3],[2,3,6]]\n输出:[{\"calls\":1,\"value\":6}]\n解释:\nconst onceFn = once(fn);\nonceFn(1, 2, 3); // 6\nonceFn(2, 3, 6); // undefined, fn 没有被调用\n
\n\n

示例 2:

\n\n
\n输入:fn = (a,b,c) => (a * b * c), calls = [[5,7,4],[2,3,6],[4,6,8]]\n输出:[{\"calls\":1,\"value\":140}]\n解释:\nconst onceFn = once(fn);\nonceFn(5, 7, 4); // 140\nonceFn(2, 3, 6); // undefined, fn 没有被调用\nonceFn(4, 6, 8); // undefined, fn 没有被调用\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= calls.length <= 10
  • \n\t
  • 1 <= calls[i].length <= 100
  • \n\t
  • 2 <= JSON.stringify(calls).length <= 1000
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 0, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {Function} fn\n * @return {Function}\n */\nvar once = function(fn) {\n return function(...args){\n \n }\n};\n\n/**\n * let fn = (a,b,c) => (a + b + c)\n * let onceFn = once(fn)\n *\n * onceFn(1,2,3); // 6\n * onceFn(2,3,6); // returns undefined without calling fn\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function once any>(fn: T): \n ((...args: Parameters) => ReturnType | undefined) {\n return function (...args) {\n\n };\n}\n\n/**\n * let fn = (a,b,c) => (a + b + c)\n * let onceFn = once(fn)\n *\n * onceFn(1,2,3); // 6\n * onceFn(2,3,6); // returns undefined without calling fn\n */", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"326\", \"totalSubmission\": \"394\", \"totalAcceptedRaw\": 326, \"totalSubmissionRaw\": 394, \"acRate\": \"82.7%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "(a,b,c) => (a + b + c)\n[[1,2,3],[2,3,6]]", + "metaData": "{\n \"name\": \"once\",\n \"params\": [\n {\n \"name\": \"fn\",\n \"type\": \"string\"\n },\n {\n \"type\": \"string\",\n \"name\": \"calls\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n },\n \"languages\": [\n \"javascript\",\n \"typescript\"\n ],\n \"manual\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"javascript\":[\"JavaScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "(a,b,c) => (a + b + c)\n[[1,2,3],[2,3,6]]\n(a,b,c) => (a * b * c)\n[[5,7,4],[2,3,6],[4,6,8]]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/array-of-objects-to-matrix.json b/leetcode-cn/originData/array-of-objects-to-matrix.json new file mode 100644 index 00000000..97ef92c7 --- /dev/null +++ b/leetcode-cn/originData/array-of-objects-to-matrix.json @@ -0,0 +1,63 @@ +{ + "data": { + "question": { + "questionId": "2769", + "questionFrontendId": "2675", + "categoryTitle": "JavaScript", + "boundTopicId": 2267107, + "title": "Array of Objects to Matrix", + "titleSlug": "array-of-objects-to-matrix", + "content": "

Write a function that converts an array of objects arr into a matrix m.

\n\n

arr is an array of objects or arrays. Each item in the array can be deeply nested with child arrays and child objects. It can also contain numbers, strings, booleans, and null values.

\n\n

The first row m should be the column names. If there is no nesting, the column names are the unique keys within the objects. If there is nesting, the column names are the respective paths in the object separated by ".".

\n\n

Each of the remaining rows corresponds to an object in arr. Each value in the matrix corresponds to a value in an object. If a given object doesn't contain a value for a given column, the cell should contain an empty string "".

\n\n

The colums in the matrix should be in lexographically ascending order.

\n\n

 

\n

Example 1:

\n\n
\nInput: \narr = [\n  {"b": 1, "a": 2},\n  {"b": 3, "a": 4}\n]\nOutput: \n[\n  ["a", "b"],\n  [2, 1],\n  [4, 3]\n]\n\nExplanation:\nThere are two unique column names in the two objects: "a" and "b".\n"a" corresponds with [2, 4].\n"b" coresponds with [1, 3].\n
\n\n

Example 2:

\n\n
\nInput: \narr = [\n  {"a": 1, "b": 2},\n  {"c": 3, "d": 4},\n  {}\n]\nOutput: \n[\n  ["a", "b", "c", "d"],\n  [1, 2, "", ""],\n  ["", "", 3, 4],\n  ["", "", "", ""]\n]\n\nExplanation:\nThere are 4 unique column names: "a", "b", "c", "d".\nThe first object has values associated with "a" and "b".\nThe second object has values associated with "c" and "d".\nThe third object has no keys, so it is just a row of empty strings.\n
\n\n

Example 3:

\n\n
\nInput: \narr = [\n  {"a": {"b": 1, "c": 2}},\n  {"a": {"b": 3, "d": 4}}\n]\nOutput: \n[\n  ["a.b", "a.c", "a.d"],\n  [1, 2, ""],\n  [3, "", 4]\n]\n\nExplanation:\nIn this example, the objects are nested. The keys represent the full path to each value separated by periods.\nThere are three paths: "a.b", "a.c", "a.d".\n
\n\n

Example 4:

\n\n
\nInput: \narr = [\n  [{"a": null}],\n  [{"b": true}],\n  [{"c": "x"}]\n]\nOutput: \n[\n  ["0.a", "0.b", "0.c"],\n  [null, "", ""],\n  ["", true, ""],\n  ["", "", "x"]\n]\n\nExplanation:\nArrays are also considered objects with their keys being their indices.\nEach array has one element so the keys are "0.a", "0.b", and "0.c".\n
\n\n

Example 5:

\n\n
\nInput: \narr = [\n  {},\n  {},\n  {},\n]\nOutput: \n[\n  [],\n  [],\n  [],\n  []\n]\n\nExplanation:\nThere are no keys so every row is an empty array.
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= arr.length <= 1000
  • \n\t
  • unique keys <= 1000
  • \n
\n", + "translatedTitle": "将对象数组转换为矩阵", + "translatedContent": "

编写一个函数,将对象数组 arr 转换为矩阵 m 。

\n\n

arr 是一个由对象组成的数组或一个数组。数组中的每个项都可以包含深层嵌套的子数组和子对象。它还可以包含数字、字符串、布尔值和空值。

\n\n

矩阵 m 的第一行应该是列名。如果没有嵌套,列名是对象中的唯一键。如果存在嵌套,列名是对象中相应路径,以点号 \".\" 分隔。

\n\n

剩余的每一行对应 arr 中的一个对象。矩阵中的每个值对应对象中的一个值。如果给定对象在给定列中没有值,则应该包含空字符串 \"\"

\n\n

矩阵中的列应按 字典升序 排列。

\n\n

 

\n\n

示例 1:

\n\n
\n输入:\narr = [\n  {\"b\": 1, \"a\": 2},\n  {\"b\": 3, \"a\": 4}\n]\n输出:\n[\n  [\"a\", \"b\"],\n  [2, 1],\n  [4, 3]\n]\n\n解释:\n两个对象中有两个唯一的列名:\"a\"和\"b\"。 \n\"a\"对应[2, 4]。 \n\"b\"对应[1, 3]。\n
\n\n

示例 2:

\n\n
\n输入:\narr = [\n  {\"a\": 1, \"b\": 2},\n  {\"c\": 3, \"d\": 4},\n  {}\n]\n输出:\n[\n  [\"a\", \"b\", \"c\", \"d\"],\n  [1, 2, \"\", \"\"],\n  [\"\", \"\", 3, 4],\n  [\"\", \"\", \"\", \"\"]\n]\n\n解释:\n有四个唯一的列名:\"a\"、\"b\"、\"c\"、\"d\"。 \n 第一个对象具有与\"a\"和\"b\"关联的值。 \n第二个对象具有与\"c\"和\"d\"关联的值。 \n第三个对象没有键,因此只是一行空字符串。\n
\n\n

示例 3:

\n\n
\n输入:\narr = [\n  {\"a\": {\"b\": 1, \"c\": 2}},\n  {\"a\": {\"b\": 3, \"d\": 4}}\n]\n输出:\n[\n  [\"a.b\", \"a.c\", \"a.d\"],\n  [1, 2, \"\"],\n  [3, \"\", 4]\n]\n\n解释:\n在这个例子中,对象是嵌套的。键表示每个值的完整路径,路径之间用句点分隔。 \n有三个路径:\"a.b\"、\"a.c\"、\"a.d\"。\n
\n\n

示例 4:

\n\n
\n输入:\narr = [\n  [{\"a\": null}],\n  [{\"b\": true}],\n  [{\"c\": \"x\"}]\n]\n输出: \n[\n  [\"0.a\", \"0.b\", \"0.c\"],\n  [null, \"\", \"\"],\n  [\"\", true, \"\"],\n  [\"\", \"\", \"x\"]\n]\n\n解释:\n数组也被视为具有索引为键的对象。 \n每个数组只有一个元素,所以键是\"0.a\"、\"0.b\"和\"0.c\"。\n
\n\n

示例 5:

\n\n
\n输入:\narr = [\n  {},\n  {},\n  {},\n]\n输出:\n[\n  [],\n  [],\n  [],\n  []\n]\n\n解释:\n没有键,所以每一行都是一个空数组。
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= arr.length <= 1000
  • \n\t
  • unique keys <= 1000
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 0, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {Array} arr\n * @return {Matrix}\n */\nvar jsonToMatrix = function(arr) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function jsonToMatrix(arr: any[]): (string | number | boolean | null)[] {\n\n};", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"54\", \"totalSubmission\": \"86\", \"totalAcceptedRaw\": 54, \"totalSubmissionRaw\": 86, \"acRate\": \"62.8%\"}", + "hints": [ + "How could you split the problem up into sub-problems?", + "1.) Write a function that converts a single object into a dictionary that maps the path name to values. You can solve this recursively by keeping track of current path list.", + "2.) Write a function that converts a list of dictionaries into a matrix. Start by creating a list of all possible paths in any of the dictionaries. This will represent the columns." + ], + "solution": null, + "status": null, + "sampleTestCase": "[{\"b\":1,\"a\":2},{\"b\":3,\"a\":4}]", + "metaData": "{\n \"name\": \"jsonToMatrix\",\n \"params\": [\n {\n \"name\": \"arr\",\n \"type\": \"string\"\n }\n ],\n \"return\": {\n \"type\": \"string\"\n },\n \"languages\": [\n \"typescript\",\n \"javascript\"\n ],\n \"manual\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"javascript\":[\"JavaScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[{\"b\":1,\"a\":2},{\"b\":3,\"a\":4}]\n[{\"a\":1,\"b\":2},{\"c\":3,\"d\":4},{}]\n[{\"a\":{\"b\":1,\"c\":2}},{\"a\":{\"b\":3,\"d\":4}}]\n[[{\"a\":null}],[{\"b\":true}],[{\"c\":\"x\"}]]\n[{},{},{}]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/binary-number-to-string-lcci.json b/leetcode-cn/originData/binary-number-to-string-lcci.json new file mode 100644 index 00000000..ea34bc38 --- /dev/null +++ b/leetcode-cn/originData/binary-number-to-string-lcci.json @@ -0,0 +1,197 @@ +{ + "data": { + "question": { + "questionId": "100203", + "questionFrontendId": "面试题 05.02", + "categoryTitle": "LCCI", + "boundTopicId": 49299, + "title": "Binary Number to String LCCI", + "titleSlug": "binary-number-to-string-lcci", + "content": "

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".

\r\n\r\n

Example1:

\r\n\r\n
\r\n Input: 0.625\r\n Output: "0.101"\r\n
\r\n\r\n

Example2:

\r\n\r\n
\r\n Input: 0.1\r\n Output: "ERROR"\r\n Note: 0.1 cannot be represented accurately in binary.\r\n
\r\n\r\n

Note:

\r\n\r\n
    \r\n\t
  • This two charaters "0." should be counted into 32 characters.
  • \r\n\t
  • The number of decimal places for num is at most 6 digits
  • \r\n
\r\n", + "translatedTitle": "二进制数转字符串", + "translatedContent": "

二进制数转字符串。给定一个介于0和1之间的实数(如0.72),类型为double,打印它的二进制表达式。如果该数字无法精确地用32位以内的二进制表示,则打印“ERROR”。

\n\n

示例1:

\n\n
\n 输入:0.625\n 输出:\"0.101\"\n
\n\n

示例2:

\n\n
\n 输入:0.1\n 输出:\"ERROR\"\n 提示:0.1无法被二进制准确表示\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 32位包括输出中的 \"0.\" 这两位。
  • \n\t
  • 题目保证输入用例的小数位数最多只有 6
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 140, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": false, \"java\": true, \"python\": true, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [ + { + "name": "Bit Manipulation", + "slug": "bit-manipulation", + "translatedName": "位运算", + "__typename": "TopicTagNode" + }, + { + "name": "Math", + "slug": "math", + "translatedName": "数学", + "__typename": "TopicTagNode" + }, + { + "name": "String", + "slug": "string", + "translatedName": "字符串", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n string printBin(double num) {\n\n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public String printBin(double num) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def printBin(self, num):\n \"\"\"\n :type num: float\n :rtype: str\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def printBin(self, num: float) -> str:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nchar* printBin(double num){\n\n}\n", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public string PrintBin(double num) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} num\n * @return {string}\n */\nvar printBin = function(num) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Float} num\n# @return {String}\ndef print_bin(num)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func printBin(_ num: Double) -> String {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func printBin(num float64) string {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def printBin(num: Double): String = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun printBin(num: Double): String {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn print_bin(num: f64) -> String {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Float $num\n * @return String\n */\n function printBin($num) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function printBin(num: number): string {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (print-bin num)\n (-> flonum? string?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec print_bin(Num :: float()) -> unicode:unicode_binary().\nprint_bin(Num) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec print_bin(num :: float) :: String.t\n def print_bin(num) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n String printBin(double num) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"37.2K\", \"totalSubmission\": \"48.5K\", \"totalAcceptedRaw\": 37234, \"totalSubmissionRaw\": 48474, \"acRate\": \"76.8%\"}", + "hints": [ + "为了解决这个问题,试着想想如何用它来处理整数。", + "像0.893这样的数字(以10为底),每个数字代表什么?那么以2为底的0.10 010中的每个数字代表什么?", + "一个数字如0.893(以10为底)表示8×101 + 9×102 + 3×103。将此系统转换为以2为底。", + "你将如何获得0.893中的第一个数字?如果乘以10,那么你会改变值得到8.93。如果乘以2,结果会是什么?", + "想想那些不能用二进制精确表示的值会发生什么。" + ], + "solution": null, + "status": null, + "sampleTestCase": "0.625", + "metaData": "{\"name\": \"printBin\", \"params\": [{\"name\": \"num\", \"type\": \"double\"}], \"return\": {\"type\": \"string\"}}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n

\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"

\\u7248\\u672c\\uff1aSwift 5.5.2<\\/code><\\/p>\\r\\n\\r\\n

\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"

\\u7248\\u672c\\uff1aGo 1.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/code><\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"

\\u7248\\u672c\\uff1aScala 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/p>\\r\\n\\r\\n

\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n

\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"],\"dart\":[\"Dart\",\"

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": { + "id": "2", + "bookName": "《程序员面试金典(第 6 版)》", + "pressName": "图灵公司", + "source": "《程序员面试金典(第 6 版)》独家授权", + "shortDescription": "英文版:Cracking the Coding Interview,源自硅谷程序员的面试红宝书", + "fullDescription": "本书是原谷歌资深面试官的经验之作,帮助了许多想要加入脸书、苹果、谷歌等 IT 名企的求职者拿到 Dream offer。本专题的 100+ 编程面试题是在原书基础上精心挑选出来的,帮助你轻松应战 IT 名企技术面试。", + "bookImgUrl": "https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/09/30/book_2.jpg", + "pressImgUrl": "https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/02/11/logo20190828-02.png", + "productUrl": "", + "__typename": "CategoryInfoNode" + }, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/chunk-array.json b/leetcode-cn/originData/chunk-array.json new file mode 100644 index 00000000..a0376065 --- /dev/null +++ b/leetcode-cn/originData/chunk-array.json @@ -0,0 +1,59 @@ +{ + "data": { + "question": { + "questionId": "2798", + "questionFrontendId": "2677", + "categoryTitle": "JavaScript", + "boundTopicId": 2267105, + "title": "Chunk Array", + "titleSlug": "chunk-array", + "content": "

Given an array arr and a chunk size size, return a chunked array. A chunked array contains the original elements in arr, but consists of subarrays each of length size. The length of the last subarray may be less than size if arr.length is not evenly divisible by size.

\n\n

You may assume the array is the output of JSON.parse. In other words, it is valid JSON.

\n\n

Please solve it without using lodash's _.chunk function.

\n\n

 

\n

Example 1:

\n\n
\nInput: arr = [1,2,3,4,5], size = 1\nOutput: [[1],[2],[3],[4],[5]]\nExplanation: The arr has been split into subarrays each with 1 element.\n
\n\n

Example 2:

\n\n
\nInput: arr = [1,9,6,3,2], size = 3\nOutput: [[1,9,6],[3,2]]\nExplanation: The arr has been split into subarrays with 3 elements. However, only two elements are left for the 2nd subarray.\n
\n\n

Example 3:

\n\n
\nInput: arr = [8,5,3,2,6], size = 6\nOutput: [[8,5,3,2,6]]\nExplanation: Size is greater than arr.length thus all elements are in the first subarray.\n
\n\n

Example 4:

\n\n
\nInput: arr = [], size = 1\nOutput: []\nExplanation: There are no elements to be chunked so an empty array is returned.
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • arr is a valid JSON array
  • \n\t
  • 2 <= JSON.stringify(arr).length <= 105
  • \n\t
  • 1 <= size <= arr.length + 1
  • \n
\n", + "translatedTitle": "分块数组", + "translatedContent": "

给定一个数组 arr 和一个块大小 size ,返回一个 分块 的数组。分块 的数组包含了 arr 中的原始元素,但是每个子数组的长度都是 size 。如果 arr.length 不能被 size 整除,那么最后一个子数组的长度可能小于 size 。

\n\n

你可以假设该数组是 JSON.parse 的输出结果。换句话说,它是有效的JSON。

\n\n

请你在不使用 lodash 的函数 _.chunk 的情况下解决这个问题。

\n\n

 

\n\n

示例 1:

\n\n
\n输入:arr = [1,2,3,4,5], size = 1\n输出:[[1],[2],[3],[4],[5]]\n解释:数组 arr 被分割成了每个只有一个元素的子数组。\n
\n\n

示例 2:

\n\n
\n输入:arr = [1,9,6,3,2], size = 3\n输出:[[1,9,6],[3,2]]\n解释:数组 arr 被分割成了每个有三个元素的子数组。然而,第二个子数组只有两个元素。\n
\n\n

示例 3:

\n\n
\n输入:arr = [8,5,3,2,6], size = 6\n输出:[[8,5,3,2,6]]\n解释:size 大于 arr.length ,因此所有元素都在第一个子数组中。\n
\n\n

示例 4:

\n\n
\n输入:arr = [], size = 1\n输出:[]\n解释:没有元素需要分块,因此返回一个空数组。
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • arr is a valid JSON array
  • \n\t
  • 2 <= JSON.stringify(arr).length <= 105
  • \n\t
  • 1 <= size <= arr.length + 1
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 0, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {Array} arr\n * @param {number} size\n * @return {Array[]}\n */\nvar chunk = function(arr, size) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function chunk(arr: any[], size: number): any[][] {\n\n};", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"153\", \"totalSubmission\": \"206\", \"totalAcceptedRaw\": 153, \"totalSubmissionRaw\": 206, \"acRate\": \"74.3%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "[1,2,3,4,5]\n1", + "metaData": "{\n \"name\": \"chunkify\",\n \"params\": [\n {\n \"name\": \"arr\",\n \"type\": \"string\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"size\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n },\n \"languages\": [\n \"javascript\",\n \"typescript\"\n ],\n \"manual\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"javascript\":[\"JavaScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[1,2,3,4,5]\n1\n[1,9,6,3,2]\n3\n[8,5,3,2,6]\n6\n[]\n1", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/cnHoX6.json b/leetcode-cn/originData/cnHoX6.json new file mode 100644 index 00000000..85a6e176 --- /dev/null +++ b/leetcode-cn/originData/cnHoX6.json @@ -0,0 +1,161 @@ +{ + "data": { + "question": { + "questionId": "1000570", + "questionFrontendId": "LCP 82", + "categoryTitle": "Algorithms", + "boundTopicId": 2258739, + "title": "万灵之树", + "titleSlug": "cnHoX6", + "content": "", + "translatedTitle": "万灵之树", + "translatedContent": "探险家小扣终于来到了万灵之树前,挑战最后的谜题。\n已知小扣拥有足够数量的链接节点和 `n` 颗幻境宝石,`gem[i]` 表示第 `i` 颗宝石的数值。现在小扣需要使用这些链接节点和宝石组合成一颗二叉树,其组装规则为:\n- 链接节点将作为二叉树中的非叶子节点,且每个链接节点必须拥有 `2` 个子节点;\n- 幻境宝石将作为二叉树中的叶子节点,所有的幻境宝石都必须被使用。\n\n能量首先进入根节点,而后将按如下规则进行移动和记录:\n- 若能量首次到达该节点时:\n - 记录数字 `1`;\n - 若该节点为叶节点,将额外记录该叶节点的数值;\n- 若存在未到达的子节点,则选取未到达的一个子节点(优先选取左子节点)进入;\n- 若无子节点或所有子节点均到达过,此时记录 `9`,并回到当前节点的父节点(若存在)。\n\n如果最终记下的数依序连接成一个整数 `num`,满足 $num \\mod~p=target$,则视为解开谜题。\n请问有多少种二叉树的组装方案,可以使得最终记录下的数字可以解开谜题\n\n**注意:**\n- 两棵结构不同的二叉树,作为不同的组装方案\n- 两棵结构相同的二叉树且存在某个相同位置处的宝石编号不同,也作为不同的组装方案\n- 可能存在数值相同的两颗宝石\n\n**示例 1:**\n> 输入:`gem = [2,3]`\n> `p = 100000007`\n> `target = 11391299`\n>\n> 输出:`1`\n>\n> 解释:\n> 包含 `2` 个叶节点的结构只有一种。\n> 假设 B、C 节点的值分别为 3、2,对应 target 为 11391299,如下图所示。\n> 11391299 % 100000007 = 11391299,满足条件;\n> 假设 B、C 节点的值分别为 2、3,对应 target 为 11291399;\n> 11291399 % 100000007 = 11291399,不满足条件;\n> 因此只存在 1 种方案,返回 1\n![万灵 (1).gif](https://pic.leetcode.cn/1682397079-evMssw-%E4%B8%87%E7%81%B5%20\\(1\\).gif){:height=300px}\n\n\n**示例 2:**\n> 输入:`gem = [3,21,3]`\n> `p = 7`\n> `target = 5`\n>\n> 输出:`4`\n>\n> 解释:\n包含 `3` 个叶节点树结构有两种,列举如下:\n满足条件的组合有四种情况:\n> 当结构为下图(1)时:叶子节点的值为 [3,3,21] 或 [3,3,21],得到的整数为 `11139139912199`。\n> 当结构为下图(2)时:叶子节点的值为 [21,3,3] 或 [21,3,3],得到的整数为 `11219113913999`。\n![image.png](https://pic.leetcode.cn/1682322894-vfqJIV-image.png){:width=500px}\n\n\n**提示:**\n- `1 <= gem.length <= 9`\n- `0 <= gem[i] <= 10^9`\n- `1 <= p <= 10^9`,保证 $p$ 为素数。\n- `0 <= target < p`\n- 存在 2 组 `gem.length == 9` 的用例", + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 5, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int treeOfInfiniteSouls(vector& gem, int p, int target) {\n\n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int treeOfInfiniteSouls(int[] gem, int p, int target) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def treeOfInfiniteSouls(self, gem, p, target):\n \"\"\"\n :type gem: List[int]\n :type p: int\n :type target: int\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def treeOfInfiniteSouls(self, gem: List[int], p: int, target: int) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int treeOfInfiniteSouls(int* gem, int gemSize, int p, int target){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int TreeOfInfiniteSouls(int[] gem, int p, int target) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} gem\n * @param {number} p\n * @param {number} target\n * @return {number}\n */\nvar treeOfInfiniteSouls = function(gem, p, target) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} gem\n# @param {Integer} p\n# @param {Integer} target\n# @return {Integer}\ndef tree_of_infinite_souls(gem, p, target)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func treeOfInfiniteSouls(_ gem: [Int], _ p: Int, _ target: Int) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func treeOfInfiniteSouls(gem []int, p int, target int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def treeOfInfiniteSouls(gem: Array[Int], p: Int, target: Int): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun treeOfInfiniteSouls(gem: IntArray, p: Int, target: Int): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn tree_of_infinite_souls(gem: Vec, p: i32, target: i32) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $gem\n * @param Integer $p\n * @param Integer $target\n * @return Integer\n */\n function treeOfInfiniteSouls($gem, $p, $target) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function treeOfInfiniteSouls(gem: number[], p: number, target: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (tree-of-infinite-souls gem p target)\n (-> (listof exact-integer?) exact-integer? exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec tree_of_infinite_souls(Gem :: [integer()], P :: integer(), Target :: integer()) -> integer().\ntree_of_infinite_souls(Gem, P, Target) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec tree_of_infinite_souls(gem :: [integer], p :: integer, target :: integer) :: integer\n def tree_of_infinite_souls(gem, p, target) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int treeOfInfiniteSouls(List gem, int p, int target) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"123\", \"totalSubmission\": \"854\", \"totalAcceptedRaw\": 123, \"totalSubmissionRaw\": 854, \"acRate\": \"14.4%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "[2,3]\n100000007\n11391299", + "metaData": "{\"name\": \"treeOfInfiniteSouls\", \"params\": [{\"name\": \"gem\", \"type\": \"integer[]\"}, {\"name\": \"p\", \"type\": \"integer\"}, {\"name\": \"target\", \"type\": \"integer\"}], \"return\": {\"type\": \"integer\"}}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n

\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"

\\u7248\\u672c\\uff1aSwift 5.5.2<\\/code><\\/p>\\r\\n\\r\\n

\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"

\\u7248\\u672c\\uff1aGo 1.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/code><\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"

\\u7248\\u672c\\uff1aScala 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/p>\\r\\n\\r\\n

\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n

\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"],\"dart\":[\"Dart\",\"

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "MARKDOWN", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[2,3]\n100000007\n11391299\n[3,21,3]\n7\n5", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/count-the-number-of-complete-components.json b/leetcode-cn/originData/count-the-number-of-complete-components.json new file mode 100644 index 00000000..ffc97a32 --- /dev/null +++ b/leetcode-cn/originData/count-the-number-of-complete-components.json @@ -0,0 +1,165 @@ +{ + "data": { + "question": { + "questionId": "2793", + "questionFrontendId": "2685", + "categoryTitle": "Algorithms", + "boundTopicId": 2265989, + "title": "Count the Number of Complete Components", + "titleSlug": "count-the-number-of-complete-components", + "content": "

You are given an integer n. There is an undirected graph with n vertices, numbered from 0 to n - 1. You are given a 2D integer array edges where edges[i] = [ai, bi] denotes that there exists an undirected edge connecting vertices ai and bi.

\n\n

Return the number of complete connected components of the graph.

\n\n

A connected component is a subgraph of a graph in which there exists a path between any two vertices, and no vertex of the subgraph shares an edge with a vertex outside of the subgraph.

\n\n

A connected component is said to be complete if there exists an edge between every pair of its vertices.

\n\n

 

\n

Example 1:

\n\n

\"\"

\n\n
\nInput: n = 6, edges = [[0,1],[0,2],[1,2],[3,4]]\nOutput: 3\nExplanation: From the picture above, one can see that all of the components of this graph are complete.\n
\n\n

Example 2:

\n\n

\"\"

\n\n
\nInput: n = 6, edges = [[0,1],[0,2],[1,2],[3,4],[3,5]]\nOutput: 1\nExplanation: The component containing vertices 0, 1, and 2 is complete since there is an edge between every pair of two vertices. On the other hand, the component containing vertices 3, 4, and 5 is not complete since there is no edge between vertices 4 and 5. Thus, the number of complete components in this graph is 1.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= n <= 50
  • \n\t
  • 0 <= edges.length <= n * (n - 1) / 2
  • \n\t
  • edges[i].length == 2
  • \n\t
  • 0 <= ai, bi <= n - 1
  • \n\t
  • ai != bi
  • \n\t
  • There are no repeated edges.
  • \n
\n", + "translatedTitle": "统计完全连通分量的数量", + "translatedContent": "

给你一个整数 n 。现有一个包含 n 个顶点的 无向 图,顶点按从 0n - 1 编号。给你一个二维整数数组 edges 其中 edges[i] = [ai, bi] 表示顶点 aibi 之间存在一条 无向 边。

\n\n

返回图中 完全连通分量 的数量。

\n\n

如果在子图中任意两个顶点之间都存在路径,并且子图中没有任何一个顶点与子图外部的顶点共享边,则称其为 连通分量

\n\n

如果连通分量中每对节点之间都存在一条边,则称其为 完全连通分量

\n\n

 

\n\n

示例 1:

\n\n

\"\"

\n\n
\n输入:n = 6, edges = [[0,1],[0,2],[1,2],[3,4]]\n输出:3\n解释:如上图所示,可以看到此图所有分量都是完全连通分量。\n
\n\n

示例 2:

\n\n

\"\"

\n\n
\n输入:n = 6, edges = [[0,1],[0,2],[1,2],[3,4],[3,5]]\n输出:1\n解释:包含节点 0、1 和 2 的分量是完全连通分量,因为每对节点之间都存在一条边。\n包含节点 3 、4 和 5 的分量不是完全连通分量,因为节点 4 和 5 之间不存在边。\n因此,在图中完全连接分量的数量是 1 。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= n <= 50
  • \n\t
  • 0 <= edges.length <= n * (n - 1) / 2
  • \n\t
  • edges[i].length == 2
  • \n\t
  • 0 <= ai, bi <= n - 1
  • \n\t
  • ai != bi
  • \n\t
  • 不存在重复的边
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 8, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": false, \"java\": true, \"python\": true, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int countCompleteComponents(int n, vector>& edges) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int countCompleteComponents(int n, int[][] edges) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def countCompleteComponents(self, n, edges):\n \"\"\"\n :type n: int\n :type edges: List[List[int]]\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def countCompleteComponents(self, n: int, edges: List[List[int]]) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int countCompleteComponents(int n, int** edges, int edgesSize, int* edgesColSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int CountCompleteComponents(int n, int[][] edges) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @param {number[][]} edges\n * @return {number}\n */\nvar countCompleteComponents = function(n, edges) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @param {Integer[][]} edges\n# @return {Integer}\ndef count_complete_components(n, edges)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func countCompleteComponents(_ n: Int, _ edges: [[Int]]) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func countCompleteComponents(n int, edges [][]int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def countCompleteComponents(n: Int, edges: Array[Array[Int]]): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun countCompleteComponents(n: Int, edges: Array): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn count_complete_components(n: i32, edges: Vec>) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer[][] $edges\n * @return Integer\n */\n function countCompleteComponents($n, $edges) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function countCompleteComponents(n: number, edges: number[][]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (count-complete-components n edges)\n (-> exact-integer? (listof (listof exact-integer?)) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec count_complete_components(N :: integer(), Edges :: [[integer()]]) -> integer().\ncount_complete_components(N, Edges) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec count_complete_components(n :: integer, edges :: [[integer]]) :: integer\n def count_complete_components(n, edges) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int countCompleteComponents(int n, List> edges) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"3.1K\", \"totalSubmission\": \"4.6K\", \"totalAcceptedRaw\": 3076, \"totalSubmissionRaw\": 4615, \"acRate\": \"66.7%\"}", + "hints": [ + "Find the connected components of an undirected graph using depth-first search (DFS) or breadth-first search (BFS).", + "For each connected component, count the number of nodes and edges in the component.", + "A connected component is complete if and only if the number of edges in the component is equal to m*(m-1)/2, where m is the number of nodes in the component." + ], + "solution": null, + "status": null, + "sampleTestCase": "6\n[[0,1],[0,2],[1,2],[3,4]]", + "metaData": "{\n \"name\": \"countCompleteComponents\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer[][]\",\n \"name\": \"edges\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n

\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"

\\u7248\\u672c\\uff1aSwift 5.5.2<\\/code><\\/p>\\r\\n\\r\\n

\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"

\\u7248\\u672c\\uff1aGo 1.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/code><\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"

\\u7248\\u672c\\uff1aScala 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/p>\\r\\n\\r\\n

\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n

\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"],\"dart\":[\"Dart\",\"

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "6\n[[0,1],[0,2],[1,2],[3,4]]\n6\n[[0,1],[0,2],[1,2],[3,4],[3,5]]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/counter-ii.json b/leetcode-cn/originData/counter-ii.json new file mode 100644 index 00000000..e21f8122 --- /dev/null +++ b/leetcode-cn/originData/counter-ii.json @@ -0,0 +1,62 @@ +{ + "data": { + "question": { + "questionId": "2789", + "questionFrontendId": "2665", + "categoryTitle": "JavaScript", + "boundTopicId": 2258605, + "title": "Counter II", + "titleSlug": "counter-ii", + "content": "

Write a function createCounter. It should accept an initial integer init. It should return an object with three functions.

\n\n

The three functions are:

\n\n
    \n\t
  • increment() increases the current value by 1 and then returns it.
  • \n\t
  • decrement() reduces the current value by 1 and then returns it.
  • \n\t
  • reset() sets the current value to init and then returns it.
  • \n
\n\n

 

\n

Example 1:

\n\n
\nInput: init = 5, calls = ["increment","reset","decrement"]\nOutput: [6,5,4]\nExplanation:\nconst counter = createCounter(5);\ncounter.increment(); // 6\ncounter.reset(); // 5\ncounter.decrement(); // 4\n
\n\n

Example 2:

\n\n
\nInput: init = 0, calls = ["increment","increment","decrement","reset","reset"]\nOutput: [1,2,1,0,0]\nExplanation:\nconst counter = createCounter(0);\ncounter.increment(); // 1\ncounter.increment(); // 2\ncounter.decrement(); // 1\ncounter.reset(); // 0\ncounter.reset(); // 0\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • -1000 <= init <= 1000
  • \n\t
  • total calls not to exceed 1000
  • \n
\n", + "translatedTitle": "计数器 II", + "translatedContent": "

请你写一个函数 createCounter. 这个函数接收一个初始的整数值 init  并返回一个包含三个函数的对象。

\n\n

这三个函数是:

\n\n
    \n\t
  • increment() 将当前值加 1 并返回。
  • \n\t
  • decrement() 将当前值减 1 并返回。
  • \n\t
  • reset() 将当前值设置为 init 并返回。
  • \n
\n\n

 

\n\n

示例 1:

\n\n
\n输入:init = 5, calls = [\"increment\",\"reset\",\"decrement\"]\n输出:[6,5,4]\n解释:\nconst counter = createCounter(5);\ncounter.increment(); // 6\ncounter.reset(); // 5\ncounter.decrement(); // 4\n
\n\n

示例 2:

\n\n
\n输入:init = 0, calls = [\"increment\",\"increment\",\"decrement\",\"reset\",\"reset\"]\n输出:[1,2,1,0,0]\n解释:\nconst counter = createCounter(0);\ncounter.increment(); // 1\ncounter.increment(); // 2\ncounter.decrement(); // 1\ncounter.reset(); // 0\ncounter.reset(); // 0\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • -1000 <= init <= 1000
  • \n\t
  • 总调用次数不会超过 1000
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 0, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": false, \"java\": true, \"python\": true, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {integer} init\n * @return { increment: Function, decrement: Function, reset: Function }\n */\nvar createCounter = function(init) {\n \n};\n\n/**\n * const counter = createCounter(5)\n * counter.increment(); // 6\n * counter.reset(); // 5\n * counter.decrement(); // 4\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "type ReturnObj = {\n increment: () => number,\n decrement: () => number,\n reset: () => number,\n}\n\nfunction createCounter(init: number): ReturnObj {\n\n};\n\n/**\n * const counter = createCounter(5)\n * counter.increment(); // 6\n * counter.reset(); // 5\n * counter.decrement(); // 4\n */", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"402\", \"totalSubmission\": \"512\", \"totalAcceptedRaw\": 402, \"totalSubmissionRaw\": 512, \"acRate\": \"78.5%\"}", + "hints": [ + "You can return an object with methods.", + "Initialize a variable for currentCount. Inside these methods, add the appropriate logic which mutates currentCount." + ], + "solution": null, + "status": null, + "sampleTestCase": "5\n[\"increment\",\"reset\",\"decrement\"]", + "metaData": "{\n \"name\": \"createCounter\",\n \"params\": [\n {\n \"name\": \"init\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"string[]\",\n \"name\": \"calls\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n },\n \"languages\": [\n \"javascript\",\n \"typescript\"\n ],\n \"manual\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"javascript\":[\"JavaScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "5\n[\"increment\",\"reset\",\"decrement\"]\n0\n[\"increment\",\"increment\",\"decrement\",\"reset\",\"reset\"]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/create-hello-world-function.json b/leetcode-cn/originData/create-hello-world-function.json new file mode 100644 index 00000000..abd179fa --- /dev/null +++ b/leetcode-cn/originData/create-hello-world-function.json @@ -0,0 +1,59 @@ +{ + "data": { + "question": { + "questionId": "2809", + "questionFrontendId": "2667", + "categoryTitle": "JavaScript", + "boundTopicId": 2255550, + "title": "Create Hello World Function", + "titleSlug": "create-hello-world-function", + "content": "Write a function createHelloWorld. It should return a new function that always returns "Hello World".\n

 

\n

Example 1:

\n\n
\nInput: args = []\nOutput: "Hello World"\nExplanation:\nconst f = createHelloWorld();\nf(); // "Hello World"\n\nThe function returned by createHelloWorld should always return "Hello World".\n
\n\n

Example 2:

\n\n
\nInput: args = [{},null,42]\nOutput: "Hello World"\nExplanation:\nconst f = createHelloWorld();\nf({}, null, 42); // "Hello World"\n\nAny arguments could be passed to the function but it should still always return "Hello World".\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 0 <= args.length <= 10
  • \n
\n", + "translatedTitle": "创建 Hello World 函数", + "translatedContent": "请你编写一个名为 createHelloWorld 的函数。它应该返回一个新的函数,该函数总是返回 \"Hello World\" 。\n

 

\n\n

示例 1:

\n\n
\n输入:args = []\n输出:\"Hello World\"\n解释:\nconst f = createHelloWorld();\nf(); // \"Hello World\"\n\ncreateHelloWorld 返回的函数应始终返回 \"Hello World\"。\n
\n\n

示例 2:

\n\n
\n输入:args = [{},null,42]\n输出:\"Hello World\"\n解释:\nconst f = createHelloWorld();\nf({}, null, 42); // \"Hello World\"\n\n可以传递任何参数给函数,但它应始终返回 \"Hello World\"。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 0 <= args.length <= 10
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 1, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @return {Function}\n */\nvar createHelloWorld = function() {\n return function(...args) {\n \n }\n};\n\n/**\n * const f = createHelloWorld();\n * f(); // \"Hello World\"\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function createHelloWorld() {\n\treturn function(...args): string {\n \n };\n};\n\n/**\n * const f = createHelloWorld();\n * f(); // \"Hello World\"\n */", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"520\", \"totalSubmission\": \"584\", \"totalAcceptedRaw\": 520, \"totalSubmissionRaw\": 584, \"acRate\": \"89.0%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "[]", + "metaData": "{\n \"name\": \"createHelloWorld\",\n \"params\": [\n {\n \"name\": \"args\",\n \"type\": \"string\"\n }\n ],\n \"return\": {\n \"type\": \"string\"\n },\n \"languages\": [\n \"javascript\",\n \"typescript\"\n ],\n \"manual\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"javascript\":[\"JavaScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[]\n[{},null,42]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/find-the-distinct-difference-array.json b/leetcode-cn/originData/find-the-distinct-difference-array.json new file mode 100644 index 00000000..90b0281d --- /dev/null +++ b/leetcode-cn/originData/find-the-distinct-difference-array.json @@ -0,0 +1,177 @@ +{ + "data": { + "question": { + "questionId": "2777", + "questionFrontendId": "2670", + "categoryTitle": "Algorithms", + "boundTopicId": 2256128, + "title": "Find the Distinct Difference Array", + "titleSlug": "find-the-distinct-difference-array", + "content": "

You are given a 0-indexed array nums of length n.

\n\n

The distinct difference array of nums is an array diff of length n such that diff[i] is equal to the number of distinct elements in the suffix nums[i + 1, ..., n - 1] subtracted from the number of distinct elements in the prefix nums[0, ..., i].

\n\n

Return the distinct difference array of nums.

\n\n

Note that nums[i, ..., j] denotes the subarray of nums starting at index i and ending at index j inclusive. Particularly, if i > j then nums[i, ..., j] denotes an empty subarray.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [1,2,3,4,5]\nOutput: [-3,-1,1,3,5]\nExplanation: For index i = 0, there is 1 element in the prefix and 4 distinct elements in the suffix. Thus, diff[0] = 1 - 4 = -3.\nFor index i = 1, there are 2 distinct elements in the prefix and 3 distinct elements in the suffix. Thus, diff[1] = 2 - 3 = -1.\nFor index i = 2, there are 3 distinct elements in the prefix and 2 distinct elements in the suffix. Thus, diff[2] = 3 - 2 = 1.\nFor index i = 3, there are 4 distinct elements in the prefix and 1 distinct element in the suffix. Thus, diff[3] = 4 - 1 = 3.\nFor index i = 4, there are 5 distinct elements in the prefix and no elements in the suffix. Thus, diff[4] = 5 - 0 = 5.\n
\n\n

Example 2:

\n\n
\nInput: nums = [3,2,3,4,2]\nOutput: [-2,-1,0,2,3]\nExplanation: For index i = 0, there is 1 element in the prefix and 3 distinct elements in the suffix. Thus, diff[0] = 1 - 3 = -2.\nFor index i = 1, there are 2 distinct elements in the prefix and 3 distinct elements in the suffix. Thus, diff[1] = 2 - 3 = -1.\nFor index i = 2, there are 2 distinct elements in the prefix and 2 distinct elements in the suffix. Thus, diff[2] = 2 - 2 = 0.\nFor index i = 3, there are 3 distinct elements in the prefix and 1 distinct element in the suffix. Thus, diff[3] = 3 - 1 = 2.\nFor index i = 4, there are 3 distinct elements in the prefix and no elements in the suffix. Thus, diff[4] = 3 - 0 = 3.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= n == nums.length <= 50
  • \n\t
  • 1 <= nums[i] <= 50
  • \n
\n", + "translatedTitle": "找出不同元素数目差数组", + "translatedContent": "

给你一个下标从 0 开始的数组 nums ,数组长度为 n

\n\n

nums不同元素数目差 数组可以用一个长度为 n 的数组 diff 表示,其中 diff[i] 等于前缀 nums[0, ..., i] 中不同元素的数目 减去 后缀 nums[i + 1, ..., n - 1] 中不同元素的数目。

\n\n

返回 nums不同元素数目差 数组。

\n\n

注意 nums[i, ..., j] 表示 nums 的一个从下标 i 开始到下标 j 结束的子数组(包含下标 ij 对应元素)。特别需要说明的是,如果 i > j ,则 nums[i, ..., j] 表示一个空子数组。

\n\n

 

\n\n

示例 1:

\n\n
\n输入:nums = [1,2,3,4,5]\n输出:[-3,-1,1,3,5]\n解释:\n对于 i = 0,前缀中有 1 个不同的元素,而在后缀中有 4 个不同的元素。因此,diff[0] = 1 - 4 = -3 。\n对于 i = 1,前缀中有 2 个不同的元素,而在后缀中有 3 个不同的元素。因此,diff[1] = 2 - 3 = -1 。\n对于 i = 2,前缀中有 3 个不同的元素,而在后缀中有 2 个不同的元素。因此,diff[2] = 3 - 2 = 1 。\n对于 i = 3,前缀中有 4 个不同的元素,而在后缀中有 1 个不同的元素。因此,diff[3] = 4 - 1 = 3 。\n对于 i = 4,前缀中有 5 个不同的元素,而在后缀中有 0 个不同的元素。因此,diff[4] = 5 - 0 = 5 。\n
\n\n

示例 2:

\n\n
\n输入:nums = [3,2,3,4,2]\n输出:[-2,-1,0,2,3]\n解释:\n对于 i = 0,前缀中有 1 个不同的元素,而在后缀中有 3 个不同的元素。因此,diff[0] = 1 - 3 = -2 。\n对于 i = 1,前缀中有 2 个不同的元素,而在后缀中有 3 个不同的元素。因此,diff[1] = 2 - 3 = -1 。\n对于 i = 2,前缀中有 2 个不同的元素,而在后缀中有 2 个不同的元素。因此,diff[2] = 2 - 2 = 0 。\n对于 i = 3,前缀中有 3 个不同的元素,而在后缀中有 1 个不同的元素。因此,diff[3] = 3 - 1 = 2 。\n对于 i = 4,前缀中有 3 个不同的元素,而在后缀中有 0 个不同的元素。因此,diff[4] = 3 - 0 = 3 。 \n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= n == nums.length <= 50
  • \n\t
  • 1 <= nums[i] <= 50
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 5, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": "数组", + "__typename": "TopicTagNode" + }, + { + "name": "Hash Table", + "slug": "hash-table", + "translatedName": "哈希表", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n vector distinctDifferenceArray(vector& nums) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int[] distinctDifferenceArray(int[] nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def distinctDifferenceArray(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: List[int]\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def distinctDifferenceArray(self, nums: List[int]) -> List[int]:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "/**\n * Note: The returned array must be malloced, assume caller calls free().\n */\nint* distinctDifferenceArray(int* nums, int numsSize, int* returnSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int[] DistinctDifferenceArray(int[] nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @return {number[]}\n */\nvar distinctDifferenceArray = function(nums) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @return {Integer[]}\ndef distinct_difference_array(nums)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func distinctDifferenceArray(_ nums: [Int]) -> [Int] {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func distinctDifferenceArray(nums []int) []int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def distinctDifferenceArray(nums: Array[Int]): Array[Int] = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun distinctDifferenceArray(nums: IntArray): IntArray {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn distinct_difference_array(nums: Vec) -> Vec {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums\n * @return Integer[]\n */\n function distinctDifferenceArray($nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function distinctDifferenceArray(nums: number[]): number[] {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (distinct-difference-array nums)\n (-> (listof exact-integer?) (listof exact-integer?))\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec distinct_difference_array(Nums :: [integer()]) -> [integer()].\ndistinct_difference_array(Nums) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec distinct_difference_array(nums :: [integer]) :: [integer]\n def distinct_difference_array(nums) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n List distinctDifferenceArray(List nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"7.4K\", \"totalAcceptedRaw\": 5723, \"totalSubmissionRaw\": 7357, \"acRate\": \"77.8%\"}", + "hints": [ + "Which data structure will help you maintain distinct elements?", + "Iterate over all possible prefix sizes. Then, use a nested loop to add the elements of the prefix to a set, and another nested loop to add the elements of the suffix to another set." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,2,3,4,5]", + "metaData": "{\n \"name\": \"distinctDifferenceArray\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n }\n ],\n \"return\": {\n \"type\": \"integer[]\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n

\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"

\\u7248\\u672c\\uff1aSwift 5.5.2<\\/code><\\/p>\\r\\n\\r\\n

\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"

\\u7248\\u672c\\uff1aGo 1.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/code><\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"

\\u7248\\u672c\\uff1aScala 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/p>\\r\\n\\r\\n

\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n

\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"],\"dart\":[\"Dart\",\"

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[1,2,3,4,5]\n[3,2,3,4,2]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/find-the-losers-of-the-circular-game.json b/leetcode-cn/originData/find-the-losers-of-the-circular-game.json new file mode 100644 index 00000000..596b0a6f --- /dev/null +++ b/leetcode-cn/originData/find-the-losers-of-the-circular-game.json @@ -0,0 +1,163 @@ +{ + "data": { + "question": { + "questionId": "2791", + "questionFrontendId": "2682", + "categoryTitle": "Algorithms", + "boundTopicId": 2265992, + "title": "Find the Losers of the Circular Game", + "titleSlug": "find-the-losers-of-the-circular-game", + "content": "

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.

\n\n

The rules of the game are as follows:

\n\n

1st friend receives the ball.

\n\n
    \n\t
  • After that, 1st friend passes it to the friend who is k steps away from them in the clockwise direction.
  • \n\t
  • After that, the friend who receives the ball should pass it to the friend who is 2 * k steps away from them in the clockwise direction.
  • \n\t
  • After that, the friend who receives the ball should pass it to the friend who is 3 * k steps away from them in the clockwise direction, and so on and so forth.
  • \n
\n\n

In other words, on the ith turn, the friend holding the ball should pass it to the friend who is i * k steps away from them in the clockwise direction.

\n\n

The game is finished when some friend receives the ball for the second time.

\n\n

The losers of the game are friends who did not receive the ball in the entire game.

\n\n

Given the number of friends, n, and an integer k, return the array answer, which contains the losers of the game in the ascending order.

\n\n

 

\n

Example 1:

\n\n
\nInput: n = 5, k = 2\nOutput: [4,5]\nExplanation: The game goes as follows:\n1) Start at 1st friend and pass the ball to the friend who is 2 steps away from them - 3rd friend.\n2) 3rd friend passes the ball to the friend who is 4 steps away from them - 2nd friend.\n3) 2nd friend passes the ball to the friend who is 6 steps away from them  - 3rd friend.\n4) The game ends as 3rd friend receives the ball for the second time.\n
\n\n

Example 2:

\n\n
\nInput: n = 4, k = 4\nOutput: [2,3,4]\nExplanation: The game goes as follows:\n1) Start at the 1st friend and pass the ball to the friend who is 4 steps away from them - 1st friend.\n2) The game ends as 1st friend receives the ball for the second time.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= k <= n <= 50
  • \n
\n", + "translatedTitle": "找出转圈游戏输家", + "translatedContent": "

n 个朋友在玩游戏。这些朋友坐成一个圈,按 顺时针方向1n 编号。从第 i 个朋友的位置开始顺时针移动 1 步会到达第 (i + 1) 个朋友的位置(1 <= i < n),而从第 n 个朋友的位置开始顺时针移动 1 步会回到第 1 个朋友的位置。

\n\n

游戏规则如下:

\n\n

1 个朋友接球。

\n\n
    \n\t
  • 接着,第 1 个朋友将球传给距离他顺时针方向 k 步的朋友。
  • \n\t
  • 然后,接球的朋友应该把球传给距离他顺时针方向 2 * k 步的朋友。
  • \n\t
  • 接着,接球的朋友应该把球传给距离他顺时针方向 3 * k 步的朋友,以此类推。
  • \n
\n\n

换句话说,在第 i 轮中持有球的那位朋友需要将球传递给距离他顺时针方向 i * k 步的朋友。

\n\n

当某个朋友第 2 次接到球时,游戏结束。

\n\n

在整场游戏中没有接到过球的朋友是 输家

\n\n

给你参与游戏的朋友数量 n 和一个整数 k ,请按升序排列返回包含所有输家编号的数组 answer 作为答案。

\n\n

 

\n\n

示例 1:

\n\n
\n输入:n = 5, k = 2\n输出:[4,5]\n解释:以下为游戏进行情况:\n1)第 1 个朋友接球,第 1 个朋友将球传给距离他顺时针方向 2 步的玩家 —— 第 3 个朋友。\n2)第 3 个朋友将球传给距离他顺时针方向 4 步的玩家 —— 第 2 个朋友。\n3)第 2 个朋友将球传给距离他顺时针方向 6 步的玩家 —— 第 3 个朋友。\n4)第 3 个朋友接到两次球,游戏结束。\n
\n\n

示例 2:

\n\n
\n输入:n = 4, k = 4\n输出:[2,3,4]\n解释:以下为游戏进行情况:\n1)第 1 个朋友接球,第 1 个朋友将球传给距离他顺时针方向 4 步的玩家 —— 第 1 个朋友。\n2)第 1 个朋友接到两次球,游戏结束。
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= k <= n <= 50
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 2, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n vector circularGameLosers(int n, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int[] circularGameLosers(int n, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def circularGameLosers(self, n, k):\n \"\"\"\n :type n: int\n :type k: int\n :rtype: List[int]\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def circularGameLosers(self, n: int, k: int) -> List[int]:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "/**\n * Note: The returned array must be malloced, assume caller calls free().\n */\nint* circularGameLosers(int n, int k, int* returnSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int[] CircularGameLosers(int n, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @param {number} k\n * @return {number[]}\n */\nvar circularGameLosers = function(n, k) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @param {Integer} k\n# @return {Integer[]}\ndef circular_game_losers(n, k)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func circularGameLosers(_ n: Int, _ k: Int) -> [Int] {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func circularGameLosers(n int, k int) []int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def circularGameLosers(n: Int, k: Int): Array[Int] = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun circularGameLosers(n: Int, k: Int): IntArray {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn circular_game_losers(n: i32, k: i32) -> Vec {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer $k\n * @return Integer[]\n */\n function circularGameLosers($n, $k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function circularGameLosers(n: number, k: number): number[] {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (circular-game-losers n k)\n (-> exact-integer? exact-integer? (listof exact-integer?))\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec circular_game_losers(N :: integer(), K :: integer()) -> [integer()].\ncircular_game_losers(N, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec circular_game_losers(n :: integer, k :: integer) :: [integer]\n def circular_game_losers(n, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n List circularGameLosers(int n, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"4.6K\", \"totalSubmission\": \"8.4K\", \"totalAcceptedRaw\": 4576, \"totalSubmissionRaw\": 8351, \"acRate\": \"54.8%\"}", + "hints": [ + "Simulate the whole game until a player receives the ball for the second time." + ], + "solution": null, + "status": null, + "sampleTestCase": "5\n2", + "metaData": "{\n \"name\": \"circularGameLosers\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n }\n ],\n \"return\": {\n \"type\": \"integer[]\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n

\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"

\\u7248\\u672c\\uff1aSwift 5.5.2<\\/code><\\/p>\\r\\n\\r\\n

\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"

\\u7248\\u672c\\uff1aGo 1.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/code><\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"

\\u7248\\u672c\\uff1aScala 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/p>\\r\\n\\r\\n

\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n

\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"],\"dart\":[\"Dart\",\"

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "5\n2\n4\n4", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/frequency-tracker.json b/leetcode-cn/originData/frequency-tracker.json new file mode 100644 index 00000000..1819b533 --- /dev/null +++ b/leetcode-cn/originData/frequency-tracker.json @@ -0,0 +1,178 @@ +{ + "data": { + "question": { + "questionId": "2778", + "questionFrontendId": "2671", + "categoryTitle": "Algorithms", + "boundTopicId": 2256129, + "title": "Frequency Tracker", + "titleSlug": "frequency-tracker", + "content": "

Design a data structure that keeps track of the values in it and answers some queries regarding their frequencies.

\n\n

Implement the FrequencyTracker class.

\n\n
    \n\t
  • FrequencyTracker(): Initializes the FrequencyTracker object with an empty array initially.
  • \n\t
  • void add(int number): Adds number to the data structure.
  • \n\t
  • void deleteOne(int number): Deletes one occurence of number from the data structure. The data structure may not contain number, and in this case nothing is deleted.
  • \n\t
  • bool hasFrequency(int frequency): Returns true if there is a number in the data structure that occurs frequency number of times, otherwise, it returns false.
  • \n
\n\n

 

\n

Example 1:

\n\n
\nInput\n["FrequencyTracker", "add", "add", "hasFrequency"]\n[[], [3], [3], [2]]\nOutput\n[null, null, null, true]\n\nExplanation\nFrequencyTracker frequencyTracker = new FrequencyTracker();\nfrequencyTracker.add(3); // The data structure now contains [3]\nfrequencyTracker.add(3); // The data structure now contains [3, 3]\nfrequencyTracker.hasFrequency(2); // Returns true, because 3 occurs twice\n\n
\n\n

Example 2:

\n\n
\nInput\n["FrequencyTracker", "add", "deleteOne", "hasFrequency"]\n[[], [1], [1], [1]]\nOutput\n[null, null, null, false]\n\nExplanation\nFrequencyTracker frequencyTracker = new FrequencyTracker();\nfrequencyTracker.add(1); // The data structure now contains [1]\nfrequencyTracker.deleteOne(1); // The data structure becomes empty []\nfrequencyTracker.hasFrequency(1); // Returns false, because the data structure is empty\n\n
\n\n

Example 3:

\n\n
\nInput\n["FrequencyTracker", "hasFrequency", "add", "hasFrequency"]\n[[], [2], [3], [1]]\nOutput\n[null, false, null, true]\n\nExplanation\nFrequencyTracker frequencyTracker = new FrequencyTracker();\nfrequencyTracker.hasFrequency(2); // Returns false, because the data structure is empty\nfrequencyTracker.add(3); // The data structure now contains [3]\nfrequencyTracker.hasFrequency(1); // Returns true, because 3 occurs once\n\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= number <= 105
  • \n\t
  • 1 <= frequency <= 105
  • \n\t
  • At most, 2 * 105 calls will be made to add, deleteOne, and hasFrequency in total.
  • \n
\n", + "translatedTitle": "频率跟踪器", + "translatedContent": "

请你设计并实现一个能够对其中的值进行跟踪的数据结构,并支持对频率相关查询进行应答。

\n\n

实现 FrequencyTracker 类:

\n\n
    \n\t
  • FrequencyTracker():使用一个空数组初始化 FrequencyTracker 对象。
  • \n\t
  • void add(int number):添加一个 number 到数据结构中。
  • \n\t
  • void deleteOne(int number):从数据结构中删除一个 number 。数据结构 可能不包含 number ,在这种情况下不删除任何内容。
  • \n\t
  • bool hasFrequency(int frequency): 如果数据结构中存在出现 frequency 次的数字,则返回 true,否则返回 false
  • \n
\n\n

 

\n\n

示例 1:

\n\n
\n输入\n[\"FrequencyTracker\", \"add\", \"add\", \"hasFrequency\"]\n[[], [3], [3], [2]]\n输出\n[null, null, null, true]\n\n解释\nFrequencyTracker frequencyTracker = new FrequencyTracker();\nfrequencyTracker.add(3); // 数据结构现在包含 [3]\nfrequencyTracker.add(3); // 数据结构现在包含 [3, 3]\nfrequencyTracker.hasFrequency(2); // 返回 true ,因为 3 出现 2 次\n
\n\n

示例 2:

\n\n
\n输入\n[\"FrequencyTracker\", \"add\", \"deleteOne\", \"hasFrequency\"]\n[[], [1], [1], [1]]\n输出\n[null, null, null, false]\n\n解释\nFrequencyTracker frequencyTracker = new FrequencyTracker();\nfrequencyTracker.add(1); // 数据结构现在包含 [1]\nfrequencyTracker.deleteOne(1); // 数据结构现在为空 []\nfrequencyTracker.hasFrequency(1); // 返回 false ,因为数据结构为空\n
\n\n

示例 3:

\n\n
\n输入\n[\"FrequencyTracker\", \"hasFrequency\", \"add\", \"hasFrequency\"]\n[[], [2], [3], [1]]\n输出\n[null, false, null, true]\n\n解释\nFrequencyTracker frequencyTracker = new FrequencyTracker();\nfrequencyTracker.hasFrequency(2); // 返回 false ,因为数据结构为空\nfrequencyTracker.add(3); // 数据结构现在包含 [3]\nfrequencyTracker.hasFrequency(1); // 返回 true ,因为 3 出现 1 次\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= number <= 105
  • \n\t
  • 1 <= frequency <= 105
  • \n\t
  • 最多调用 adddeleteOnehasFrequency 共计 2 * 105
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 4, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": false, \"java\": false, \"python\": false, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [ + { + "name": "Design", + "slug": "design", + "translatedName": "设计", + "__typename": "TopicTagNode" + }, + { + "name": "Hash Table", + "slug": "hash-table", + "translatedName": "哈希表", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class FrequencyTracker {\npublic:\n FrequencyTracker() {\n\n }\n \n void add(int number) {\n\n }\n \n void deleteOne(int number) {\n\n }\n \n bool hasFrequency(int frequency) {\n\n }\n};\n\n/**\n * Your FrequencyTracker object will be instantiated and called as such:\n * FrequencyTracker* obj = new FrequencyTracker();\n * obj->add(number);\n * obj->deleteOne(number);\n * bool param_3 = obj->hasFrequency(frequency);\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class FrequencyTracker {\n\n public FrequencyTracker() {\n\n }\n \n public void add(int number) {\n\n }\n \n public void deleteOne(int number) {\n\n }\n \n public boolean hasFrequency(int frequency) {\n\n }\n}\n\n/**\n * Your FrequencyTracker object will be instantiated and called as such:\n * FrequencyTracker obj = new FrequencyTracker();\n * obj.add(number);\n * obj.deleteOne(number);\n * boolean param_3 = obj.hasFrequency(frequency);\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class FrequencyTracker(object):\n\n def __init__(self):\n\n\n def add(self, number):\n \"\"\"\n :type number: int\n :rtype: None\n \"\"\"\n\n\n def deleteOne(self, number):\n \"\"\"\n :type number: int\n :rtype: None\n \"\"\"\n\n\n def hasFrequency(self, frequency):\n \"\"\"\n :type frequency: int\n :rtype: bool\n \"\"\"\n\n\n\n# Your FrequencyTracker object will be instantiated and called as such:\n# obj = FrequencyTracker()\n# obj.add(number)\n# obj.deleteOne(number)\n# param_3 = obj.hasFrequency(frequency)", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class FrequencyTracker:\n\n def __init__(self):\n\n\n def add(self, number: int) -> None:\n\n\n def deleteOne(self, number: int) -> None:\n\n\n def hasFrequency(self, frequency: int) -> bool:\n\n\n\n# Your FrequencyTracker object will be instantiated and called as such:\n# obj = FrequencyTracker()\n# obj.add(number)\n# obj.deleteOne(number)\n# param_3 = obj.hasFrequency(frequency)", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\n\ntypedef struct {\n\n} FrequencyTracker;\n\n\nFrequencyTracker* frequencyTrackerCreate() {\n\n}\n\nvoid frequencyTrackerAdd(FrequencyTracker* obj, int number) {\n\n}\n\nvoid frequencyTrackerDeleteOne(FrequencyTracker* obj, int number) {\n\n}\n\nbool frequencyTrackerHasFrequency(FrequencyTracker* obj, int frequency) {\n\n}\n\nvoid frequencyTrackerFree(FrequencyTracker* obj) {\n\n}\n\n/**\n * Your FrequencyTracker struct will be instantiated and called as such:\n * FrequencyTracker* obj = frequencyTrackerCreate();\n * frequencyTrackerAdd(obj, number);\n \n * frequencyTrackerDeleteOne(obj, number);\n \n * bool param_3 = frequencyTrackerHasFrequency(obj, frequency);\n \n * frequencyTrackerFree(obj);\n*/", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class FrequencyTracker {\n\n public FrequencyTracker() {\n\n }\n \n public void Add(int number) {\n\n }\n \n public void DeleteOne(int number) {\n\n }\n \n public bool HasFrequency(int frequency) {\n\n }\n}\n\n/**\n * Your FrequencyTracker object will be instantiated and called as such:\n * FrequencyTracker obj = new FrequencyTracker();\n * obj.Add(number);\n * obj.DeleteOne(number);\n * bool param_3 = obj.HasFrequency(frequency);\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "\nvar FrequencyTracker = function() {\n\n};\n\n/** \n * @param {number} number\n * @return {void}\n */\nFrequencyTracker.prototype.add = function(number) {\n\n};\n\n/** \n * @param {number} number\n * @return {void}\n */\nFrequencyTracker.prototype.deleteOne = function(number) {\n\n};\n\n/** \n * @param {number} frequency\n * @return {boolean}\n */\nFrequencyTracker.prototype.hasFrequency = function(frequency) {\n\n};\n\n/**\n * Your FrequencyTracker object will be instantiated and called as such:\n * var obj = new FrequencyTracker()\n * obj.add(number)\n * obj.deleteOne(number)\n * var param_3 = obj.hasFrequency(frequency)\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "class FrequencyTracker\n def initialize()\n\n end\n\n\n=begin\n :type number: Integer\n :rtype: Void\n=end\n def add(number)\n\n end\n\n\n=begin\n :type number: Integer\n :rtype: Void\n=end\n def delete_one(number)\n\n end\n\n\n=begin\n :type frequency: Integer\n :rtype: Boolean\n=end\n def has_frequency(frequency)\n\n end\n\n\nend\n\n# Your FrequencyTracker object will be instantiated and called as such:\n# obj = FrequencyTracker.new()\n# obj.add(number)\n# obj.delete_one(number)\n# param_3 = obj.has_frequency(frequency)", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "\nclass FrequencyTracker {\n\n init() {\n\n }\n \n func add(_ number: Int) {\n\n }\n \n func deleteOne(_ number: Int) {\n\n }\n \n func hasFrequency(_ frequency: Int) -> Bool {\n\n }\n}\n\n/**\n * Your FrequencyTracker object will be instantiated and called as such:\n * let obj = FrequencyTracker()\n * obj.add(number)\n * obj.deleteOne(number)\n * let ret_3: Bool = obj.hasFrequency(frequency)\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "type FrequencyTracker struct {\n\n}\n\n\nfunc Constructor() FrequencyTracker {\n\n}\n\n\nfunc (this *FrequencyTracker) Add(number int) {\n\n}\n\n\nfunc (this *FrequencyTracker) DeleteOne(number int) {\n\n}\n\n\nfunc (this *FrequencyTracker) HasFrequency(frequency int) bool {\n\n}\n\n\n/**\n * Your FrequencyTracker object will be instantiated and called as such:\n * obj := Constructor();\n * obj.Add(number);\n * obj.DeleteOne(number);\n * param_3 := obj.HasFrequency(frequency);\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "class FrequencyTracker() {\n\n def add(number: Int) {\n\n }\n\n def deleteOne(number: Int) {\n\n }\n\n def hasFrequency(frequency: Int): Boolean = {\n\n }\n\n}\n\n/**\n * Your FrequencyTracker object will be instantiated and called as such:\n * var obj = new FrequencyTracker()\n * obj.add(number)\n * obj.deleteOne(number)\n * var param_3 = obj.hasFrequency(frequency)\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class FrequencyTracker() {\n\n fun add(number: Int) {\n\n }\n\n fun deleteOne(number: Int) {\n\n }\n\n fun hasFrequency(frequency: Int): Boolean {\n\n }\n\n}\n\n/**\n * Your FrequencyTracker object will be instantiated and called as such:\n * var obj = FrequencyTracker()\n * obj.add(number)\n * obj.deleteOne(number)\n * var param_3 = obj.hasFrequency(frequency)\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "struct FrequencyTracker {\n\n}\n\n\n/**\n * `&self` means the method takes an immutable reference.\n * If you need a mutable reference, change it to `&mut self` instead.\n */\nimpl FrequencyTracker {\n\n fn new() -> Self {\n\n }\n \n fn add(&self, number: i32) {\n\n }\n \n fn delete_one(&self, number: i32) {\n\n }\n \n fn has_frequency(&self, frequency: i32) -> bool {\n\n }\n}\n\n/**\n * Your FrequencyTracker object will be instantiated and called as such:\n * let obj = FrequencyTracker::new();\n * obj.add(number);\n * obj.delete_one(number);\n * let ret_3: bool = obj.has_frequency(frequency);\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class FrequencyTracker {\n /**\n */\n function __construct() {\n\n }\n\n /**\n * @param Integer $number\n * @return NULL\n */\n function add($number) {\n\n }\n\n /**\n * @param Integer $number\n * @return NULL\n */\n function deleteOne($number) {\n\n }\n\n /**\n * @param Integer $frequency\n * @return Boolean\n */\n function hasFrequency($frequency) {\n\n }\n}\n\n/**\n * Your FrequencyTracker object will be instantiated and called as such:\n * $obj = FrequencyTracker();\n * $obj->add($number);\n * $obj->deleteOne($number);\n * $ret_3 = $obj->hasFrequency($frequency);\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "class FrequencyTracker {\n constructor() {\n\n }\n\n add(number: number): void {\n\n }\n\n deleteOne(number: number): void {\n\n }\n\n hasFrequency(frequency: number): boolean {\n\n }\n}\n\n/**\n * Your FrequencyTracker object will be instantiated and called as such:\n * var obj = new FrequencyTracker()\n * obj.add(number)\n * obj.deleteOne(number)\n * var param_3 = obj.hasFrequency(frequency)\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define frequency-tracker%\n (class object%\n (super-new)\n \n (init-field)\n \n ; add : exact-integer? -> void?\n (define/public (add number)\n\n )\n ; delete-one : exact-integer? -> void?\n (define/public (delete-one number)\n\n )\n ; has-frequency : exact-integer? -> boolean?\n (define/public (has-frequency frequency)\n\n )))\n\n;; Your frequency-tracker% object will be instantiated and called as such:\n;; (define obj (new frequency-tracker%))\n;; (send obj add number)\n;; (send obj delete-one number)\n;; (define param_3 (send obj has-frequency frequency))", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec frequency_tracker_init_() -> any().\nfrequency_tracker_init_() ->\n .\n\n-spec frequency_tracker_add(Number :: integer()) -> any().\nfrequency_tracker_add(Number) ->\n .\n\n-spec frequency_tracker_delete_one(Number :: integer()) -> any().\nfrequency_tracker_delete_one(Number) ->\n .\n\n-spec frequency_tracker_has_frequency(Frequency :: integer()) -> boolean().\nfrequency_tracker_has_frequency(Frequency) ->\n .\n\n\n%% Your functions will be called as such:\n%% frequency_tracker_init_(),\n%% frequency_tracker_add(Number),\n%% frequency_tracker_delete_one(Number),\n%% Param_3 = frequency_tracker_has_frequency(Frequency),\n\n%% frequency_tracker_init_ will be called before every test case, in which you can do some necessary initializations.", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule FrequencyTracker do\n @spec init_() :: any\n def init_() do\n\n end\n\n @spec add(number :: integer) :: any\n def add(number) do\n\n end\n\n @spec delete_one(number :: integer) :: any\n def delete_one(number) do\n\n end\n\n @spec has_frequency(frequency :: integer) :: boolean\n def has_frequency(frequency) do\n\n end\nend\n\n# Your functions will be called as such:\n# FrequencyTracker.init_()\n# FrequencyTracker.add(number)\n# FrequencyTracker.delete_one(number)\n# param_3 = FrequencyTracker.has_frequency(frequency)\n\n# FrequencyTracker.init_ will be called before every test case, in which you can do some necessary initializations.", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class FrequencyTracker {\n\n FrequencyTracker() {\n\n }\n \n void add(int number) {\n\n }\n \n void deleteOne(int number) {\n\n }\n \n bool hasFrequency(int frequency) {\n\n }\n}\n\n/**\n * Your FrequencyTracker object will be instantiated and called as such:\n * FrequencyTracker obj = FrequencyTracker();\n * obj.add(number);\n * obj.deleteOne(number);\n * bool param3 = obj.hasFrequency(frequency);\n */", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"4.9K\", \"totalSubmission\": \"15.4K\", \"totalAcceptedRaw\": 4948, \"totalSubmissionRaw\": 15435, \"acRate\": \"32.1%\"}", + "hints": [ + "Put all the numbers in a hash map (or just an integer array given the number range is small) to maintain each number’s frequency dynamically.", + "Put each frequency in another hash map (or just an integer array given the range is small, note there are only 200000 calls in total) to maintain each kind of frequency dynamically.", + "Keep the 2 hash maps in sync." + ], + "solution": null, + "status": null, + "sampleTestCase": "[\"FrequencyTracker\",\"add\",\"add\",\"hasFrequency\"]\n[[],[3],[3],[2]]", + "metaData": "{\n \"classname\": \"FrequencyTracker\",\n \"constructor\": {\n \"params\": []\n },\n \"methods\": [\n {\n \"params\": [\n {\n \"type\": \"integer\",\n \"name\": \"number\"\n }\n ],\n \"name\": \"add\",\n \"return\": {\n \"type\": \"void\"\n }\n },\n {\n \"params\": [\n {\n \"type\": \"integer\",\n \"name\": \"number\"\n }\n ],\n \"name\": \"deleteOne\",\n \"return\": {\n \"type\": \"void\"\n }\n },\n {\n \"params\": [\n {\n \"type\": \"integer\",\n \"name\": \"frequency\"\n }\n ],\n \"name\": \"hasFrequency\",\n \"return\": {\n \"type\": \"boolean\"\n }\n }\n ],\n \"return\": {\n \"type\": \"boolean\"\n },\n \"systemdesign\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n

\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"

\\u7248\\u672c\\uff1aSwift 5.5.2<\\/code><\\/p>\\r\\n\\r\\n

\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"

\\u7248\\u672c\\uff1aGo 1.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/code><\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"

\\u7248\\u672c\\uff1aScala 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/p>\\r\\n\\r\\n

\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n

\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"],\"dart\":[\"Dart\",\"

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[\"FrequencyTracker\",\"add\",\"add\",\"hasFrequency\"]\n[[],[3],[3],[2]]\n[\"FrequencyTracker\",\"add\",\"deleteOne\",\"hasFrequency\"]\n[[],[1],[1],[1]]\n[\"FrequencyTracker\",\"hasFrequency\",\"add\",\"hasFrequency\"]\n[[],[2],[3],[1]]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/kjpLFZ.json b/leetcode-cn/originData/kjpLFZ.json new file mode 100644 index 00000000..0790ff45 --- /dev/null +++ b/leetcode-cn/originData/kjpLFZ.json @@ -0,0 +1,168 @@ +{ + "data": { + "question": { + "questionId": "1000567", + "questionFrontendId": "LCP 79", + "categoryTitle": "Algorithms", + "boundTopicId": 2258740, + "title": "提取咒文", + "titleSlug": "kjpLFZ", + "content": "", + "translatedTitle": "提取咒文", + "translatedContent": "随着兽群逐渐远去,一座大升降机缓缓的从地下升到了远征队面前。借由这台升降机,他们将能够到达地底的永恒至森。\n在升降机的操作台上,是一个由魔法符号组成的矩阵,为了便于辨识,我们用小写字母来表示。 `matrix[i][j]` 表示矩阵第 `i` 行 `j` 列的字母。该矩阵上有一个提取装置,可以对所在位置的字母提取。\n提取装置初始位于矩阵的左上角 `[0,0]`,可以通过每次操作移动到上、下、左、右相邻的 1 格位置中。提取装置每次移动或每次提取均记为一次操作。\n\n远征队需要按照顺序,从矩阵中逐一取出字母以组成 `mantra`,才能够成功的启动升降机。请返回他们 **最少** 需要消耗的操作次数。如果无法完成提取,返回 `-1`。\n\n**注意:**\n- 提取装置可对同一位置的字母重复提取,每次提取一个\n- 提取字母时,需按词语顺序依次提取\n\n**示例 1:**\n>输入:`matrix = [\"sd\",\"ep\"], mantra = \"speed\"`\n>\n>输出:`10`\n>\n>解释:如下图所示\n![矩阵 (2).gif](https://pic.leetcode-cn.com/1646288670-OTlvAl-%E7%9F%A9%E9%98%B5%20\\(2\\).gif)\n\n**示例 2:**\n>输入:`matrix = [\"abc\",\"daf\",\"geg\"], mantra = \"sad\"`\n>\n>输出:`-1`\n>\n>解释:矩阵中不存在 `s` ,无法提取词语\n\n**提示:**\n- `0 < matrix.length, matrix[i].length <= 100`\n- `0 < mantra.length <= 100`\n- `matrix 和 mantra` 仅由小写字母组成", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 4, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [ + { + "username": "UBTZEJGEPp", + "profileUrl": "/u/UBTZEJGEPp", + "avatarUrl": "https://assets.leetcode.cn/aliyun-lc-upload/default_avatar.png", + "__typename": "ContributorNode" + } + ], + "langToValidPlayground": "{\"cpp\": false, \"java\": true, \"python\": true, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int extractMantra(vector& matrix, string mantra) {\n\n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int extractMantra(String[] matrix, String mantra) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def extractMantra(self, matrix, mantra):\n \"\"\"\n :type matrix: List[str]\n :type mantra: str\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def extractMantra(self, matrix: List[str], mantra: str) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int extractMantra(char** matrix, int matrixSize, char* mantra){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int ExtractMantra(string[] matrix, string mantra) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {string[]} matrix\n * @param {string} mantra\n * @return {number}\n */\nvar extractMantra = function(matrix, mantra) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {String[]} matrix\n# @param {String} mantra\n# @return {Integer}\ndef extract_mantra(matrix, mantra)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func extractMantra(_ matrix: [String], _ mantra: String) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func extractMantra(matrix []string, mantra string) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def extractMantra(matrix: Array[String], mantra: String): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun extractMantra(matrix: Array, mantra: String): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn extract_mantra(matrix: Vec, mantra: String) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param String[] $matrix\n * @param String $mantra\n * @return Integer\n */\n function extractMantra($matrix, $mantra) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function extractMantra(matrix: string[], mantra: string): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (extract-mantra matrix mantra)\n (-> (listof string?) string? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec extract_mantra(Matrix :: [unicode:unicode_binary()], Mantra :: unicode:unicode_binary()) -> integer().\nextract_mantra(Matrix, Mantra) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec extract_mantra(matrix :: [String.t], mantra :: String.t) :: integer\n def extract_mantra(matrix, mantra) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int extractMantra(List matrix, String mantra) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"1.2K\", \"totalSubmission\": \"4.6K\", \"totalAcceptedRaw\": 1212, \"totalSubmissionRaw\": 4607, \"acRate\": \"26.3%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "[\"sd\",\"ep\"]\n\"speed\"", + "metaData": "{\"name\": \"extractMantra\", \"params\": [{\"name\": \"matrix\", \"type\": \"string[]\"}, {\"name\": \"mantra\", \"type\": \"string\"}], \"return\": {\"type\": \"integer\"}}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n

\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"

\\u7248\\u672c\\uff1aSwift 5.5.2<\\/code><\\/p>\\r\\n\\r\\n

\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"

\\u7248\\u672c\\uff1aGo 1.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/code><\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"

\\u7248\\u672c\\uff1aScala 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/p>\\r\\n\\r\\n

\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n

\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"],\"dart\":[\"Dart\",\"

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "MARKDOWN", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[\"sd\",\"ep\"]\n\"speed\"\n[\"abc\",\"daf\",\"geg\"]\n\"sad\"", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/make-costs-of-paths-equal-in-a-binary-tree.json b/leetcode-cn/originData/make-costs-of-paths-equal-in-a-binary-tree.json new file mode 100644 index 00000000..3d769ca1 --- /dev/null +++ b/leetcode-cn/originData/make-costs-of-paths-equal-in-a-binary-tree.json @@ -0,0 +1,195 @@ +{ + "data": { + "question": { + "questionId": "2780", + "questionFrontendId": "2673", + "categoryTitle": "Algorithms", + "boundTopicId": 2254957, + "title": "Make Costs of Paths Equal in a Binary Tree", + "titleSlug": "make-costs-of-paths-equal-in-a-binary-tree", + "content": "

You are given an integer n representing the number of nodes in a perfect binary tree consisting of nodes numbered from 1 to n. The root of the tree is node 1 and each node i in the tree has two children where the left child is the node 2 * i and the right child is 2 * i + 1.

\n\n

Each node in the tree also has a cost represented by a given 0-indexed integer array cost of size n where cost[i] is the cost of node i + 1. You are allowed to increment the cost of any node by 1 any number of times.

\n\n

Return the minimum number of increments you need to make the cost of paths from the root to each leaf node equal.

\n\n

Note:

\n\n
    \n\t
  • A perfect binary tree is a tree where each node, except the leaf nodes, has exactly 2 children.
  • \n\t
  • The cost of a path is the sum of costs of nodes in the path.
  • \n
\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: n = 7, cost = [1,5,2,2,3,3,1]\nOutput: 6\nExplanation: We can do the following increments:\n- Increase the cost of node 4 one time.\n- Increase the cost of node 3 three times.\n- Increase the cost of node 7 two times.\nEach path from the root to a leaf will have a total cost of 9.\nThe total increments we did is 1 + 3 + 2 = 6.\nIt can be shown that this is the minimum answer we can achieve.\n
\n\n

Example 2:

\n\"\"\n
\nInput: n = 3, cost = [5,3,3]\nOutput: 0\nExplanation: The two paths already have equal total costs, so no increments are needed.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 3 <= n <= 105
  • \n\t
  • n + 1 is a power of 2
  • \n\t
  • cost.length == n
  • \n\t
  • 1 <= cost[i] <= 104
  • \n
\n", + "translatedTitle": "使二叉树所有路径值相等的最小代价", + "translatedContent": "

给你一个整数 n 表示一棵 满二叉树 里面节点的数目,节点编号从 1 到 n 。根节点编号为 1 ,树中每个非叶子节点 i 都有两个孩子,分别是左孩子 2 * i 和右孩子 2 * i + 1 。

\n\n

树中每个节点都有一个值,用下标从 0 开始、长度为 n 的整数数组 cost 表示,其中 cost[i] 是第 i + 1 个节点的值。每次操作,你可以将树中 任意 节点的值 增加 1 。你可以执行操作 任意 次。

\n\n

你的目标是让根到每一个 叶子结点 的路径值相等。请你返回 最少 需要执行增加操作多少次。

\n\n

注意:

\n\n
    \n\t
  • 满二叉树 指的是一棵树,它满足树中除了叶子节点外每个节点都恰好有 2 个节点,且所有叶子节点距离根节点距离相同。
  • \n\t
  • 路径值 指的是路径上所有节点的值之和。
  • \n
\n\n

 

\n\n

示例 1:

\n\n

\"\"

\n\n
\n输入:n = 7, cost = [1,5,2,2,3,3,1]\n输出:6\n解释:我们执行以下的增加操作:\n- 将节点 4 的值增加一次。\n- 将节点 3 的值增加三次。\n- 将节点 7 的值增加两次。\n从根到叶子的每一条路径值都为 9 。\n总共增加次数为 1 + 3 + 2 = 6 。\n这是最小的答案。\n
\n\n

示例 2:

\n\n

\"\"

\n\n
\n输入:n = 3, cost = [5,3,3]\n输出:0\n解释:两条路径已经有相等的路径值,所以不需要执行任何增加操作。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 3 <= n <= 105
  • \n\t
  • n + 1 是 2 的幂
  • \n\t
  • cost.length == n
  • \n\t
  • 1 <= cost[i] <= 104
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 14, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [ + { + "name": "Greedy", + "slug": "greedy", + "translatedName": "贪心", + "__typename": "TopicTagNode" + }, + { + "name": "Tree", + "slug": "tree", + "translatedName": "树", + "__typename": "TopicTagNode" + }, + { + "name": "Array", + "slug": "array", + "translatedName": "数组", + "__typename": "TopicTagNode" + }, + { + "name": "Dynamic Programming", + "slug": "dynamic-programming", + "translatedName": "动态规划", + "__typename": "TopicTagNode" + }, + { + "name": "Binary Tree", + "slug": "binary-tree", + "translatedName": "二叉树", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int minIncrements(int n, vector& cost) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int minIncrements(int n, int[] cost) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def minIncrements(self, n, cost):\n \"\"\"\n :type n: int\n :type cost: List[int]\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def minIncrements(self, n: int, cost: List[int]) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int minIncrements(int n, int* cost, int costSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MinIncrements(int n, int[] cost) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @param {number[]} cost\n * @return {number}\n */\nvar minIncrements = function(n, cost) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @param {Integer[]} cost\n# @return {Integer}\ndef min_increments(n, cost)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func minIncrements(_ n: Int, _ cost: [Int]) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func minIncrements(n int, cost []int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def minIncrements(n: Int, cost: Array[Int]): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun minIncrements(n: Int, cost: IntArray): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn min_increments(n: i32, cost: Vec) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer[] $cost\n * @return Integer\n */\n function minIncrements($n, $cost) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function minIncrements(n: number, cost: number[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (min-increments n cost)\n (-> exact-integer? (listof exact-integer?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec min_increments(N :: integer(), Cost :: [integer()]) -> integer().\nmin_increments(N, Cost) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec min_increments(n :: integer, cost :: [integer]) :: integer\n def min_increments(n, cost) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int minIncrements(int n, List cost) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"3.7K\", \"totalSubmission\": \"5.5K\", \"totalAcceptedRaw\": 3654, \"totalSubmissionRaw\": 5523, \"acRate\": \"66.2%\"}", + "hints": [ + "The path from the root to a leaf that has the maximum cost should not be modified.", + "The optimal way is to increase all other paths to make their costs equal to the path with maximum cost." + ], + "solution": null, + "status": null, + "sampleTestCase": "7\n[1,5,2,2,3,3,1]", + "metaData": "{\n \"name\": \"minIncrements\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"cost\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n

\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"

\\u7248\\u672c\\uff1aSwift 5.5.2<\\/code><\\/p>\\r\\n\\r\\n

\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"

\\u7248\\u672c\\uff1aGo 1.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/code><\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"

\\u7248\\u672c\\uff1aScala 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/p>\\r\\n\\r\\n

\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n

\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"],\"dart\":[\"Dart\",\"

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "7\n[1,5,2,2,3,3,1]\n3\n[5,3,3]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/maximum-number-of-moves-in-a-grid.json b/leetcode-cn/originData/maximum-number-of-moves-in-a-grid.json new file mode 100644 index 00000000..ae8404c6 --- /dev/null +++ b/leetcode-cn/originData/maximum-number-of-moves-in-a-grid.json @@ -0,0 +1,164 @@ +{ + "data": { + "question": { + "questionId": "2794", + "questionFrontendId": "2684", + "categoryTitle": "Algorithms", + "boundTopicId": 2265990, + "title": "Maximum Number of Moves in a Grid", + "titleSlug": "maximum-number-of-moves-in-a-grid", + "content": "

You are given a 0-indexed m x n matrix grid consisting of positive integers.

\n\n

You can start at any cell in the first column of the matrix, and traverse the grid in the following way:

\n\n
    \n\t
  • From a cell (row, col), you can move to any of the cells: (row - 1, col + 1), (row, col + 1) and (row + 1, col + 1) such that the value of the cell you move to, should be strictly bigger than the value of the current cell.
  • \n
\n\n

Return the maximum number of moves that you can perform.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: grid = [[2,4,3,5],[5,4,9,3],[3,4,2,11],[10,9,13,15]]\nOutput: 3\nExplanation: We can start at the cell (0, 0) and make the following moves:\n- (0, 0) -> (0, 1).\n- (0, 1) -> (1, 2).\n- (1, 2) -> (2, 3).\nIt can be shown that it is the maximum number of moves that can be made.
\n\n

Example 2:

\n\n
\n\"\"\nInput: grid = [[3,2,4],[2,1,9],[1,1,7]]\nOutput: 0\nExplanation: Starting from any cell in the first column we cannot perform any moves.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • m == grid.length
  • \n\t
  • n == grid[i].length
  • \n\t
  • 2 <= m, n <= 1000
  • \n\t
  • 4 <= m * n <= 105
  • \n\t
  • 1 <= grid[i][j] <= 106
  • \n
\n", + "translatedTitle": "矩阵中移动的最大次数", + "translatedContent": "

给你一个下标从 0 开始、大小为 m x n 的矩阵 grid ,矩阵由若干 整数组成。

\n\n

你可以从矩阵第一列中的 任一 单元格出发,按以下方式遍历 grid

\n\n
    \n\t
  • 从单元格 (row, col) 可以移动到 (row - 1, col + 1)(row, col + 1)(row + 1, col + 1) 三个单元格中任一满足值 严格 大于当前单元格的单元格。
  • \n
\n\n

返回你在矩阵中能够 移动最大 次数。

\n\n

 

\n\n

示例 1:

\n\"\"\n
输入:grid = [[2,4,3,5],[5,4,9,3],[3,4,2,11],[10,9,13,15]]\n输出:3\n解释:可以从单元格 (0, 0) 开始并且按下面的路径移动:\n- (0, 0) -> (0, 1).\n- (0, 1) -> (1, 2).\n- (1, 2) -> (2, 3).\n可以证明这是能够移动的最大次数。
\n\n

示例 2:

\n\n
\"\"\n输入:grid = [[3,2,4],[2,1,9],[1,1,7]]\n输出:0\n解释:从第一列的任一单元格开始都无法移动。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • m == grid.length
  • \n\t
  • n == grid[i].length
  • \n\t
  • 2 <= m, n <= 1000
  • \n\t
  • 4 <= m * n <= 105
  • \n\t
  • 1 <= grid[i][j] <= 106
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 6, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": false, \"java\": true, \"python\": true, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int maxMoves(vector>& grid) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int maxMoves(int[][] grid) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def maxMoves(self, grid):\n \"\"\"\n :type grid: List[List[int]]\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def maxMoves(self, grid: List[List[int]]) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int maxMoves(int** grid, int gridSize, int* gridColSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MaxMoves(int[][] grid) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[][]} grid\n * @return {number}\n */\nvar maxMoves = function(grid) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[][]} grid\n# @return {Integer}\ndef max_moves(grid)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func maxMoves(_ grid: [[Int]]) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func maxMoves(grid [][]int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def maxMoves(grid: Array[Array[Int]]): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun maxMoves(grid: Array): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn max_moves(grid: Vec>) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[][] $grid\n * @return Integer\n */\n function maxMoves($grid) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function maxMoves(grid: number[][]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (max-moves grid)\n (-> (listof (listof exact-integer?)) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec max_moves(Grid :: [[integer()]]) -> integer().\nmax_moves(Grid) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec max_moves(grid :: [[integer]]) :: integer\n def max_moves(grid) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int maxMoves(List> grid) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"4.1K\", \"totalSubmission\": \"10.2K\", \"totalAcceptedRaw\": 4054, \"totalSubmissionRaw\": 10211, \"acRate\": \"39.7%\"}", + "hints": [ + "Consider using dynamic programming to find the maximum number of moves that can be made from each cell.", + "The final answer will be the maximum value in cells of the first column." + ], + "solution": null, + "status": null, + "sampleTestCase": "[[2,4,3,5],[5,4,9,3],[3,4,2,11],[10,9,13,15]]", + "metaData": "{\n \"name\": \"maxMoves\",\n \"params\": [\n {\n \"name\": \"grid\",\n \"type\": \"integer[][]\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n

\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"

\\u7248\\u672c\\uff1aSwift 5.5.2<\\/code><\\/p>\\r\\n\\r\\n

\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"

\\u7248\\u672c\\uff1aGo 1.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/code><\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"

\\u7248\\u672c\\uff1aScala 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/p>\\r\\n\\r\\n

\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n

\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"],\"dart\":[\"Dart\",\"

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[[2,4,3,5],[5,4,9,3],[3,4,2,11],[10,9,13,15]]\n[[3,2,4],[2,1,9],[1,1,7]]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/maximum-or.json b/leetcode-cn/originData/maximum-or.json new file mode 100644 index 00000000..e52d86e1 --- /dev/null +++ b/leetcode-cn/originData/maximum-or.json @@ -0,0 +1,164 @@ +{ + "data": { + "question": { + "questionId": "2730", + "questionFrontendId": "2680", + "categoryTitle": "Algorithms", + "boundTopicId": 2266664, + "title": "Maximum OR", + "titleSlug": "maximum-or", + "content": "

You are given a 0-indexed integer array nums of length n and an integer k. In an operation, you can choose an element and multiply it by 2.

\n\n

Return the maximum possible value of nums[0] | nums[1] | ... | nums[n - 1] that can be obtained after applying the operation on nums at most k times.

\n\n

Note that a | b denotes the bitwise or between two integers a and b.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [12,9], k = 1\nOutput: 30\nExplanation: If we apply the operation to index 1, our new array nums will be equal to [12,18]. Thus, we return the bitwise or of 12 and 18, which is 30.\n
\n\n

Example 2:

\n\n
\nInput: nums = [8,1,2], k = 2\nOutput: 35\nExplanation: If we apply the operation twice on index 0, we yield a new array of [32,1,2]. Thus, we return 32|1|2 = 35.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 105
  • \n\t
  • 1 <= nums[i] <= 109
  • \n\t
  • 1 <= k <= 15
  • \n
\n", + "translatedTitle": "最大或值", + "translatedContent": "

给你一个下标从 0 开始长度为 n 的整数数组 nums 和一个整数 k 。每一次操作中,你可以选择一个数并将它乘 2 。

\n\n

你最多可以进行 k 次操作,请你返回 nums[0] | nums[1] | ... | nums[n - 1] 的最大值。

\n\n

a | b 表示两个整数 a 和 b 的 按位或 运算。

\n\n

 

\n\n

示例 1:

\n\n
\n输入:nums = [12,9], k = 1\n输出:30\n解释:如果我们对下标为 1 的元素进行操作,新的数组为 [12,18] 。此时得到最优答案为 12 和 18 的按位或运算的结果,也就是 30 。\n
\n\n

示例 2:

\n\n
\n输入:nums = [8,1,2], k = 2\n输出:35\n解释:如果我们对下标 0 处的元素进行操作,得到新数组 [32,1,2] 。此时得到最优答案为 32|1|2 = 35 。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= nums.length <= 105
  • \n\t
  • 1 <= nums[i] <= 109
  • \n\t
  • 1 <= k <= 15
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 9, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": false, \"java\": false, \"python\": false, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n long long maximumOr(vector& nums, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public long maximumOr(int[] nums, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def maximumOr(self, nums, k):\n \"\"\"\n :type nums: List[int]\n :type k: int\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def maximumOr(self, nums: List[int], k: int) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "long long maximumOr(int* nums, int numsSize, int k){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public long MaximumOr(int[] nums, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @param {number} k\n * @return {number}\n */\nvar maximumOr = function(nums, k) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @param {Integer} k\n# @return {Integer}\ndef maximum_or(nums, k)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func maximumOr(_ nums: [Int], _ k: Int) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func maximumOr(nums []int, k int) int64 {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def maximumOr(nums: Array[Int], k: Int): Long = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun maximumOr(nums: IntArray, k: Int): Long {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn maximum_or(nums: Vec, k: i32) -> i64 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums\n * @param Integer $k\n * @return Integer\n */\n function maximumOr($nums, $k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function maximumOr(nums: number[], k: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (maximum-or nums k)\n (-> (listof exact-integer?) exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec maximum_or(Nums :: [integer()], K :: integer()) -> integer().\nmaximum_or(Nums, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec maximum_or(nums :: [integer], k :: integer) :: integer\n def maximum_or(nums, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int maximumOr(List nums, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"2K\", \"totalSubmission\": \"4.7K\", \"totalAcceptedRaw\": 1975, \"totalSubmissionRaw\": 4674, \"acRate\": \"42.3%\"}", + "hints": [ + "The optimal solution should apply all the k operations on a single number.", + "Calculate the prefix or and the suffix or and perform k operations over each element, and maximize the answer." + ], + "solution": null, + "status": null, + "sampleTestCase": "[12,9]\n1", + "metaData": "{\n \"name\": \"maximumOr\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n }\n ],\n \"return\": {\n \"type\": \"long\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n

\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"

\\u7248\\u672c\\uff1aSwift 5.5.2<\\/code><\\/p>\\r\\n\\r\\n

\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"

\\u7248\\u672c\\uff1aGo 1.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/code><\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"

\\u7248\\u672c\\uff1aScala 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/p>\\r\\n\\r\\n

\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n

\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"],\"dart\":[\"Dart\",\"

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[12,9]\n1\n[8,1,2]\n2", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/neighboring-bitwise-xor.json b/leetcode-cn/originData/neighboring-bitwise-xor.json new file mode 100644 index 00000000..a87067f3 --- /dev/null +++ b/leetcode-cn/originData/neighboring-bitwise-xor.json @@ -0,0 +1,164 @@ +{ + "data": { + "question": { + "questionId": "2792", + "questionFrontendId": "2683", + "categoryTitle": "Algorithms", + "boundTopicId": 2265988, + "title": "Neighboring Bitwise XOR", + "titleSlug": "neighboring-bitwise-xor", + "content": "

A 0-indexed array derived with length n is derived by computing the bitwise XOR (⊕) of adjacent values in a binary array original of length n.

\n\n

Specifically, for each index i in the range [0, n - 1]:

\n\n
    \n\t
  • If i = n - 1, then derived[i] = original[i] ⊕ original[0].
  • \n\t
  • Otherwise, derived[i] = original[i] ⊕ original[i + 1].
  • \n
\n\n

Given an array derived, your task is to determine whether there exists a valid binary array original that could have formed derived.

\n\n

Return true if such an array exists or false otherwise.

\n\n
    \n\t
  • A binary array is an array containing only 0's and 1's
  • \n
\n\n

 

\n

Example 1:

\n\n
\nInput: derived = [1,1,0]\nOutput: true\nExplanation: A valid original array that gives derived is [0,1,0].\nderived[0] = original[0] ⊕ original[1] = 0 ⊕ 1 = 1 \nderived[1] = original[1] ⊕ original[2] = 1 ⊕ 0 = 1\nderived[2] = original[2] ⊕ original[0] = 0 ⊕ 0 = 0\n
\n\n

Example 2:

\n\n
\nInput: derived = [1,1]\nOutput: true\nExplanation: A valid original array that gives derived is [0,1].\nderived[0] = original[0] ⊕ original[1] = 1\nderived[1] = original[1] ⊕ original[0] = 1\n
\n\n

Example 3:

\n\n
\nInput: derived = [1,0]\nOutput: false\nExplanation: There is no valid original array that gives derived.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • n == derived.length
  • \n\t
  • 1 <= n <= 105
  • \n\t
  • The values in derived are either 0's or 1's
  • \n
\n", + "translatedTitle": "相邻值的按位异或", + "translatedContent": "

下标从 0 开始、长度为 n 的数组 derived 是由同样长度为 n 的原始 二进制数组 original 通过计算相邻值的 按位异或(⊕)派生而来。

\n\n

特别地,对于范围 [0, n - 1] 内的每个下标 i

\n\n
    \n\t
  • 如果 i = n - 1 ,那么 derived[i] = original[i] ⊕ original[0]
  • \n\t
  • 否则 derived[i] = original[i] ⊕ original[i + 1]
  • \n
\n\n

给你一个数组 derived ,请判断是否存在一个能够派生得到 derived有效原始二进制数组 original

\n\n

如果存在满足要求的原始二进制数组,返回 true ;否则,返回 false

\n\n
    \n\t
  • 二进制数组是仅由 01 组成的数组。
  • \n
\n\n

 

\n\n

示例 1:

\n\n
输入:derived = [1,1,0]\n输出:true\n解释:能够派生得到 [1,1,0] 的有效原始二进制数组是 [0,1,0] :\nderived[0] = original[0] ⊕ original[1] = 0 ⊕ 1 = 1 \nderived[1] = original[1] ⊕ original[2] = 1 ⊕ 0 = 1\nderived[2] = original[2] ⊕ original[0] = 0 ⊕ 0 = 0\n
\n\n

示例 2:

\n\n
输入:derived = [1,1]\n输出:true\n解释:能够派生得到 [1,1] 的有效原始二进制数组是 [0,1] :\nderived[0] = original[0] ⊕ original[1] = 1\nderived[1] = original[1] ⊕ original[0] = 1\n
\n\n

示例 3:

\n\n
输入:derived = [1,0]\n输出:false\n解释:不存在能够派生得到 [1,0] 的有效原始二进制数组。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • n == derived.length
  • \n\t
  • 1 <= n <= 105
  • \n\t
  • derived 中的值不是 0 就是 1
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 4, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n bool doesValidArrayExist(vector& derived) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public boolean doesValidArrayExist(int[] derived) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def doesValidArrayExist(self, derived):\n \"\"\"\n :type derived: List[int]\n :rtype: bool\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def doesValidArrayExist(self, derived: List[int]) -> bool:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "bool doesValidArrayExist(int* derived, int derivedSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public bool DoesValidArrayExist(int[] derived) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} derived\n * @return {boolean}\n */\nvar doesValidArrayExist = function(derived) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} derived\n# @return {Boolean}\ndef does_valid_array_exist(derived)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func doesValidArrayExist(_ derived: [Int]) -> Bool {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func doesValidArrayExist(derived []int) bool {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def doesValidArrayExist(derived: Array[Int]): Boolean = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun doesValidArrayExist(derived: IntArray): Boolean {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn does_valid_array_exist(derived: Vec) -> bool {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $derived\n * @return Boolean\n */\n function doesValidArrayExist($derived) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function doesValidArrayExist(derived: number[]): boolean {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (does-valid-array-exist derived)\n (-> (listof exact-integer?) boolean?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec does_valid_array_exist(Derived :: [integer()]) -> boolean().\ndoes_valid_array_exist(Derived) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec does_valid_array_exist(derived :: [integer]) :: boolean\n def does_valid_array_exist(derived) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n bool doesValidArrayExist(List derived) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"4.2K\", \"totalSubmission\": \"6.2K\", \"totalAcceptedRaw\": 4214, \"totalSubmissionRaw\": 6246, \"acRate\": \"67.5%\"}", + "hints": [ + "Understand that from the original element, we are using each element twice to construct the derived array", + "The xor-sum of the derived array should be 0 since there is always a duplicate occurrence of each element." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,1,0]", + "metaData": "{\n \"name\": \"doesValidArrayExist\",\n \"params\": [\n {\n \"name\": \"derived\",\n \"type\": \"integer[]\"\n }\n ],\n \"return\": {\n \"type\": \"boolean\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n

\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"

\\u7248\\u672c\\uff1aSwift 5.5.2<\\/code><\\/p>\\r\\n\\r\\n

\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"

\\u7248\\u672c\\uff1aGo 1.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/code><\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"

\\u7248\\u672c\\uff1aScala 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/p>\\r\\n\\r\\n

\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n

\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"],\"dart\":[\"Dart\",\"

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[1,1,0]\n[1,1]\n[1,0]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/number-of-adjacent-elements-with-the-same-color.json b/leetcode-cn/originData/number-of-adjacent-elements-with-the-same-color.json new file mode 100644 index 00000000..05029fdd --- /dev/null +++ b/leetcode-cn/originData/number-of-adjacent-elements-with-the-same-color.json @@ -0,0 +1,172 @@ +{ + "data": { + "question": { + "questionId": "2779", + "questionFrontendId": "2672", + "categoryTitle": "Algorithms", + "boundTopicId": 2254952, + "title": "Number of Adjacent Elements With the Same Color", + "titleSlug": "number-of-adjacent-elements-with-the-same-color", + "content": "

There is a 0-indexed array nums of length n. Initially, all elements are uncolored (has a value of 0).

\n\n

You are given a 2D integer array queries where queries[i] = [indexi, colori].

\n\n

For each query, you color the index indexi with the color colori in the array nums.

\n\n

Return an array answer of the same length as queries where answer[i] is the number of adjacent elements with the same color after the ith query.

\n\n

More formally, answer[i] is the number of indices j, such that 0 <= j < n - 1 and nums[j] == nums[j + 1] and nums[j] != 0 after the ith query.

\n\n

 

\n

Example 1:

\n\n
\nInput: n = 4, queries = [[0,2],[1,2],[3,1],[1,1],[2,1]]\nOutput: [0,1,1,0,2]\nExplanation: Initially array nums = [0,0,0,0], where 0 denotes uncolored elements of the array.\n- After the 1st query nums = [2,0,0,0]. The count of adjacent elements with the same color is 0.\n- After the 2nd query nums = [2,2,0,0]. The count of adjacent elements with the same color is 1.\n- After the 3rd query nums = [2,2,0,1]. The count of adjacent elements with the same color is 1.\n- After the 4th query nums = [2,1,0,1]. The count of adjacent elements with the same color is 0.\n- After the 5th query nums = [2,1,1,1]. The count of adjacent elements with the same color is 2.\n
\n\n

Example 2:

\n\n
\nInput: n = 1, queries = [[0,100000]]\nOutput: [0]\nExplanation: Initially array nums = [0], where 0 denotes uncolored elements of the array.\n- After the 1st query nums = [100000]. The count of adjacent elements with the same color is 0.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= n <= 105
  • \n\t
  • 1 <= queries.length <= 105
  • \n\t
  • queries[i].length == 2
  • \n\t
  • 0 <= indexi <= n - 1
  • \n\t
  • 1 <=  colori <= 105
  • \n
\n", + "translatedTitle": "有相同颜色的相邻元素数目", + "translatedContent": "

给你一个下标从 0 开始、长度为 n 的数组 nums 。一开始,所有元素都是 未染色 (值为 0 )的。

\n\n

给你一个二维整数数组 queries ,其中 queries[i] = [indexi, colori] 。

\n\n

对于每个操作,你需要将数组 nums 中下标为 indexi 的格子染色为 colori 。

\n\n

请你返回一个长度与 queries 相等的数组 answer ,其中 answer[i]是前 i 个操作 之后 ,相邻元素颜色相同的数目。

\n\n

更正式的,answer[i] 是执行完前 i 个操作后,0 <= j < n - 1 的下标 j 中,满足 nums[j] == nums[j + 1] 且 nums[j] != 0 的数目。

\n\n

 

\n\n

示例 1:

\n\n
\n输入:n = 4, queries = [[0,2],[1,2],[3,1],[1,1],[2,1]]\n输出:[0,1,1,0,2]\n解释:一开始数组 nums = [0,0,0,0] ,0 表示数组中还没染色的元素。\n- 第 1 个操作后,nums = [2,0,0,0] 。相邻元素颜色相同的数目为 0 。\n- 第 2 个操作后,nums = [2,2,0,0] 。相邻元素颜色相同的数目为 1 。\n- 第 3 个操作后,nums = [2,2,0,1] 。相邻元素颜色相同的数目为 1 。\n- 第 4 个操作后,nums = [2,1,0,1] 。相邻元素颜色相同的数目为 0 。\n- 第 5 个操作后,nums = [2,1,1,1] 。相邻元素颜色相同的数目为 2 。\n
\n\n

示例 2:

\n\n
\n输入:n = 1, queries = [[0,100000]]\n输出:[0]\n解释:一开始数组 nums = [0] ,0 表示数组中还没染色的元素。\n- 第 1 个操作后,nums = [100000] 。相邻元素颜色相同的数目为 0 。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= n <= 105
  • \n\t
  • 1 <= queries.length <= 105
  • \n\t
  • queries[i].length == 2
  • \n\t
  • 0 <= indexi <= n - 1
  • \n\t
  • 1 <=  colori <= 105
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 4, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": false, \"java\": true, \"python\": true, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": "数组", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n vector colorTheArray(int n, vector>& queries) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int[] colorTheArray(int n, int[][] queries) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def colorTheArray(self, n, queries):\n \"\"\"\n :type n: int\n :type queries: List[List[int]]\n :rtype: List[int]\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def colorTheArray(self, n: int, queries: List[List[int]]) -> List[int]:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "/**\n * Note: The returned array must be malloced, assume caller calls free().\n */\nint* colorTheArray(int n, int** queries, int queriesSize, int* queriesColSize, int* returnSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int[] ColorTheArray(int n, int[][] queries) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @param {number[][]} queries\n * @return {number[]}\n */\nvar colorTheArray = function(n, queries) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @param {Integer[][]} queries\n# @return {Integer[]}\ndef color_the_array(n, queries)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func colorTheArray(_ n: Int, _ queries: [[Int]]) -> [Int] {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func colorTheArray(n int, queries [][]int) []int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def colorTheArray(n: Int, queries: Array[Array[Int]]): Array[Int] = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun colorTheArray(n: Int, queries: Array): IntArray {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn color_the_array(n: i32, queries: Vec>) -> Vec {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer[][] $queries\n * @return Integer[]\n */\n function colorTheArray($n, $queries) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function colorTheArray(n: number, queries: number[][]): number[] {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (color-the-array n queries)\n (-> exact-integer? (listof (listof exact-integer?)) (listof exact-integer?))\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec color_the_array(N :: integer(), Queries :: [[integer()]]) -> [integer()].\ncolor_the_array(N, Queries) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec color_the_array(n :: integer, queries :: [[integer]]) :: [integer]\n def color_the_array(n, queries) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n List colorTheArray(int n, List> queries) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"7.3K\", \"totalAcceptedRaw\": 4265, \"totalSubmissionRaw\": 7308, \"acRate\": \"58.4%\"}", + "hints": [ + "Since at each query, only one element is being recolored, we just need to focus on its neighbors.", + "If an element that is changed on the i-th query had the same color as its right element answer decreases by 1. Similarly contributes its left element too.", + "After changing the color, if the element has the same color as its right element answer increases by 1. Similarly contributes its left element too." + ], + "solution": null, + "status": null, + "sampleTestCase": "4\n[[0,2],[1,2],[3,1],[1,1],[2,1]]", + "metaData": "{\n \"name\": \"colorTheArray\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer[][]\",\n \"name\": \"queries\"\n }\n ],\n \"return\": {\n \"type\": \"integer[]\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n

\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"

\\u7248\\u672c\\uff1aSwift 5.5.2<\\/code><\\/p>\\r\\n\\r\\n

\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"

\\u7248\\u672c\\uff1aGo 1.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/code><\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"

\\u7248\\u672c\\uff1aScala 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/p>\\r\\n\\r\\n

\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n

\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"],\"dart\":[\"Dart\",\"

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "4\n[[0,2],[1,2],[3,1],[1,1],[2,1]]\n1\n[[0,100000]]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/number-of-senior-citizens.json b/leetcode-cn/originData/number-of-senior-citizens.json new file mode 100644 index 00000000..e2a552c3 --- /dev/null +++ b/leetcode-cn/originData/number-of-senior-citizens.json @@ -0,0 +1,164 @@ +{ + "data": { + "question": { + "questionId": "2727", + "questionFrontendId": "2678", + "categoryTitle": "Algorithms", + "boundTopicId": 2266115, + "title": "Number of Senior Citizens", + "titleSlug": "number-of-senior-citizens", + "content": "

You are given a 0-indexed array of strings details. Each element of details provides information about a given passenger compressed into a string of length 15. The system is such that:

\n\n
    \n\t
  • The first ten characters consist of the phone number of passengers.
  • \n\t
  • The next character denotes the gender of the person.
  • \n\t
  • The following two characters are used to indicate the age of the person.
  • \n\t
  • The last two characters determine the seat allotted to that person.
  • \n
\n\n

Return the number of passengers who are strictly more than 60 years old.

\n\n

 

\n

Example 1:

\n\n
\nInput: details = ["7868190130M7522","5303914400F9211","9273338290F4010"]\nOutput: 2\nExplanation: The passengers at indices 0, 1, and 2 have ages 75, 92, and 40. Thus, there are 2 people who are over 60 years old.\n
\n\n

Example 2:

\n\n
\nInput: details = ["1313579440F2036","2921522980M5644"]\nOutput: 0\nExplanation: None of the passengers are older than 60.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= details.length <= 100
  • \n\t
  • details[i].length == 15
  • \n\t
  • details[i] consists of digits from '0' to '9'.
  • \n\t
  • details[i][10] is either 'M' or 'F' or 'O'.
  • \n\t
  • The phone numbers and seat numbers of the passengers are distinct.
  • \n
\n", + "translatedTitle": "老人的数目", + "translatedContent": "

给你一个下标从 0 开始的字符串 details 。details 中每个元素都是一位乘客的信息,信息用长度为 15 的字符串表示,表示方式如下:

\n\n
    \n\t
  • 前十个字符是乘客的手机号码。
  • \n\t
  • 接下来的一个字符是乘客的性别。
  • \n\t
  • 接下来两个字符是乘客的年龄。
  • \n\t
  • 最后两个字符是乘客的座位号。
  • \n
\n\n

请你返回乘客中年龄 严格大于 60 岁 的人数。

\n\n

 

\n\n

示例 1:

\n\n
\n输入:details = [\"7868190130M7522\",\"5303914400F9211\",\"9273338290F4010\"]\n输出:2\n解释:下标为 0 ,1 和 2 的乘客年龄分别为 75 ,92 和 40 。所以有 2 人年龄大于 60 岁。\n
\n\n

示例 2:

\n\n
\n输入:details = [\"1313579440F2036\",\"2921522980M5644\"]\n输出:0\n解释:没有乘客的年龄大于 60 岁。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= details.length <= 100
  • \n\t
  • details[i].length == 15
  • \n\t
  • details[i] 中的数字只包含 '0' 到 '9' 。
  • \n\t
  • details[i][10] 是 'M' ,'F' 或者 'O' 之一。
  • \n\t
  • 所有乘客的手机号码和座位号互不相同。
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 2, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": false, \"java\": true, \"python\": true, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int countSeniors(vector& details) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int countSeniors(String[] details) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def countSeniors(self, details):\n \"\"\"\n :type details: List[str]\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def countSeniors(self, details: List[str]) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int countSeniors(char ** details, int detailsSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int CountSeniors(string[] details) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {string[]} details\n * @return {number}\n */\nvar countSeniors = function(details) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {String[]} details\n# @return {Integer}\ndef count_seniors(details)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func countSeniors(_ details: [String]) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func countSeniors(details []string) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def countSeniors(details: Array[String]): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun countSeniors(details: Array): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn count_seniors(details: Vec) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param String[] $details\n * @return Integer\n */\n function countSeniors($details) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function countSeniors(details: string[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (count-seniors details)\n (-> (listof string?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec count_seniors(Details :: [unicode:unicode_binary()]) -> integer().\ncount_seniors(Details) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec count_seniors(details :: [String.t]) :: integer\n def count_seniors(details) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int countSeniors(List details) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"2.8K\", \"totalSubmission\": \"3.3K\", \"totalAcceptedRaw\": 2814, \"totalSubmissionRaw\": 3269, \"acRate\": \"86.1%\"}", + "hints": [ + "Convert the value at index 11 and 12 to a numerical value.", + "The age of the person at index i is equal to details[i][11]*10+details[i][12]." + ], + "solution": null, + "status": null, + "sampleTestCase": "[\"7868190130M7522\",\"5303914400F9211\",\"9273338290F4010\"]", + "metaData": "{\n \"name\": \"countSeniors\",\n \"params\": [\n {\n \"name\": \"details\",\n \"type\": \"string[]\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n

\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"

\\u7248\\u672c\\uff1aSwift 5.5.2<\\/code><\\/p>\\r\\n\\r\\n

\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"

\\u7248\\u672c\\uff1aGo 1.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/code><\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"

\\u7248\\u672c\\uff1aScala 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/p>\\r\\n\\r\\n

\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n

\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"],\"dart\":[\"Dart\",\"

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[\"7868190130M7522\",\"5303914400F9211\",\"9273338290F4010\"]\n[\"1313579440F2036\",\"2921522980M5644\"]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/power-of-heroes.json b/leetcode-cn/originData/power-of-heroes.json new file mode 100644 index 00000000..fc9e98ab --- /dev/null +++ b/leetcode-cn/originData/power-of-heroes.json @@ -0,0 +1,166 @@ +{ + "data": { + "question": { + "questionId": "2784", + "questionFrontendId": "2681", + "categoryTitle": "Algorithms", + "boundTopicId": 2266665, + "title": "Power of Heroes", + "titleSlug": "power-of-heroes", + "content": "

You are given a 0-indexed integer array nums representing the strength of some heroes. The power of a group of heroes is defined as follows:

\n\n
    \n\t
  • Let i0, i1, ... ,ik be the indices of the heroes in a group. Then, the power of this group is max(nums[i0], nums[i1], ... ,nums[ik])2 * min(nums[i0], nums[i1], ... ,nums[ik]).
  • \n
\n\n

Return the sum of the power of all non-empty groups of heroes possible. Since the sum could be very large, return it modulo 109 + 7.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [2,1,4]\nOutput: 141\nExplanation: \n1st group: [2] has power = 22 * 2 = 8.\n2nd group: [1] has power = 12 * 1 = 1. \n3rd group: [4] has power = 42 * 4 = 64. \n4th group: [2,1] has power = 22 * 1 = 4. \n5th group: [2,4] has power = 42 * 2 = 32. \n6th group: [1,4] has power = 42 * 1 = 16. \n​​​​​​​7th group: [2,1,4] has power = 42​​​​​​​ * 1 = 16. \nThe sum of powers of all groups is 8 + 1 + 64 + 4 + 32 + 16 + 16 = 141.\n\n
\n\n

Example 2:

\n\n
\nInput: nums = [1,1,1]\nOutput: 7\nExplanation: A total of 7 groups are possible, and the power of each group will be 1. Therefore, the sum of the powers of all groups is 7.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 105
  • \n\t
  • 1 <= nums[i] <= 109
  • \n
\n", + "translatedTitle": "英雄的力量", + "translatedContent": "

给你一个下标从 0 开始的整数数组 nums ,它表示英雄的能力值。如果我们选出一部分英雄,这组英雄的 力量 定义为:

\n\n
    \n\t
  • i0 ,i1 ,... ik 表示这组英雄在数组中的下标。那么这组英雄的力量为 max(nums[i0],nums[i1] ... nums[ik])2 * min(nums[i0],nums[i1] ... nums[ik])
  • \n
\n\n

请你返回所有可能的 非空 英雄组的 力量 之和。由于答案可能非常大,请你将结果对 109 + 7 取余。

\n\n

 

\n\n

示例 1:

\n\n
\n输入:nums = [2,1,4]\n输出:141\n解释:\n第 1 组:[2] 的力量为 22 * 2 = 8 。\n第 2 组:[1] 的力量为 12 * 1 = 1 。\n第 3 组:[4] 的力量为 42 * 4 = 64 。\n第 4 组:[2,1] 的力量为 22 * 1 = 4 。\n第 5 组:[2,4] 的力量为 42 * 2 = 32 。\n第 6 组:[1,4] 的力量为 42 * 1 = 16 。\n第​ ​​​​​​7 组:[2,1,4] 的力量为 42​​​​​​​ * 1 = 16 。\n所有英雄组的力量之和为 8 + 1 + 64 + 4 + 32 + 16 + 16 = 141 。\n
\n\n

示例 2:

\n\n
\n输入:nums = [1,1,1]\n输出:7\n解释:总共有 7 个英雄组,每一组的力量都是 1 。所以所有英雄组的力量之和为 7 。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= nums.length <= 105
  • \n\t
  • 1 <= nums[i] <= 109
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 4, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int sumOfPower(vector& nums) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int sumOfPower(int[] nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def sumOfPower(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def sumOfPower(self, nums: List[int]) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int sumOfPower(int* nums, int numsSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int SumOfPower(int[] nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @return {number}\n */\nvar sumOfPower = function(nums) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @return {Integer}\ndef sum_of_power(nums)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func sumOfPower(_ nums: [Int]) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func sumOfPower(nums []int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def sumOfPower(nums: Array[Int]): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun sumOfPower(nums: IntArray): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn sum_of_power(nums: Vec) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums\n * @return Integer\n */\n function sumOfPower($nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function sumOfPower(nums: number[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (sum-of-power nums)\n (-> (listof exact-integer?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec sum_of_power(Nums :: [integer()]) -> integer().\nsum_of_power(Nums) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec sum_of_power(nums :: [integer]) :: integer\n def sum_of_power(nums) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int sumOfPower(List nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"1.6K\", \"totalSubmission\": \"4.7K\", \"totalAcceptedRaw\": 1584, \"totalSubmissionRaw\": 4712, \"acRate\": \"33.6%\"}", + "hints": [ + "Try something with sorting the array.", + "For a pair of array elements nums[i] and nums[j] (i < j), the power would be nums[i]*nums[j]^2 regardless of how many elements in between are included.", + "The number of subsets with the above as power will correspond to 2^(j-i-1).", + "Try collecting the terms for nums[0], nums[1], …, nums[j-1] when computing the power of heroes ending at index j to get the power in a single pass." + ], + "solution": null, + "status": null, + "sampleTestCase": "[2,1,4]", + "metaData": "{\n \"name\": \"sumOfPower\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n

\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"

\\u7248\\u672c\\uff1aSwift 5.5.2<\\/code><\\/p>\\r\\n\\r\\n

\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"

\\u7248\\u672c\\uff1aGo 1.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/code><\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"

\\u7248\\u672c\\uff1aScala 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/p>\\r\\n\\r\\n

\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n

\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"],\"dart\":[\"Dart\",\"

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[2,1,4]\n[1,1,1]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/qoQAMX.json b/leetcode-cn/originData/qoQAMX.json new file mode 100644 index 00000000..7a3064e3 --- /dev/null +++ b/leetcode-cn/originData/qoQAMX.json @@ -0,0 +1,161 @@ +{ + "data": { + "question": { + "questionId": "1000568", + "questionFrontendId": "LCP 80", + "categoryTitle": "Algorithms", + "boundTopicId": 2258736, + "title": "生物进化录", + "titleSlug": "qoQAMX", + "content": "", + "translatedTitle": "生物进化录", + "translatedContent": "在永恒之森中,存在着一本生物进化录,以 **一个树形结构** 记载了所有生物的演化过程。经过观察并整理了各节点间的关系,`parents[i]` 表示编号 `i` 节点的父节点编号(根节点的父节点为 `-1`)。\n\n为了探索和记录其中的演化规律,队伍中的炼金术师提出了一种方法,可以以字符串的形式将其复刻下来,规则如下:\n- 初始只有一个根节点,表示演化的起点,依次记录 `01` 字符串中的字符,\n- 如果记录 `0`,则在当前节点下添加一个子节点,并将指针指向新添加的子节点;\n- 如果记录 `1`,则将指针回退到当前节点的父节点处。\n\n现在需要应用上述的记录方法,复刻下它的演化过程。请返回能够复刻演化过程的字符串中, **字典序最小** 的 `01` 字符串。\n\n**注意:**\n- 节点指针最终可以停在任何节点上,不一定要回到根节点。\n\n**示例 1:**\n> 输入:`parents = [-1,0,0,2]`\n>\n> 输出:`\"00110\"`\n>\n>解释:树结构如下图所示,共存在 2 种记录方案:\n>第 1 种方案为:0(记录编号 1 的节点) -> 1(回退至节点 0) -> 0(记录编号 2 的节点) -> 0((记录编号 3 的节点))\n>第 2 种方案为:0(记录编号 2 的节点) -> 0(记录编号 3 的节点) -> 1(回退至节点 2) -> 1(回退至节点 0) -> 0(记录编号 1 的节点)\n>返回字典序更小的 `\"00110\"`\n![image.png](https://pic.leetcode.cn/1682319485-cRVudI-image.png){:width=120px}![进化 (3).gif](https://pic.leetcode.cn/1682412701-waHdnm-%E8%BF%9B%E5%8C%96%20\\(3\\).gif){:width=320px}\n\n\n\n**示例 2:**\n> 输入:`parents = [-1,0,0,1,2,2]`\n>\n> 输出:`\"00101100\"`\n\n**提示:**\n\n- `1 <= parents.length <= 10^4`\n- `-1 <= parents[i] < i` (即父节点编号小于子节点)", + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 4, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n string evolutionaryRecord(vector& parents) {\n\n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public String evolutionaryRecord(int[] parents) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def evolutionaryRecord(self, parents):\n \"\"\"\n :type parents: List[int]\n :rtype: str\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def evolutionaryRecord(self, parents: List[int]) -> str:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "char* evolutionaryRecord(int* parents, int parentsSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public string EvolutionaryRecord(int[] parents) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} parents\n * @return {string}\n */\nvar evolutionaryRecord = function(parents) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} parents\n# @return {String}\ndef evolutionary_record(parents)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func evolutionaryRecord(_ parents: [Int]) -> String {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func evolutionaryRecord(parents []int) string {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def evolutionaryRecord(parents: Array[Int]): String = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun evolutionaryRecord(parents: IntArray): String {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn evolutionary_record(parents: Vec) -> String {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $parents\n * @return String\n */\n function evolutionaryRecord($parents) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function evolutionaryRecord(parents: number[]): string {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (evolutionary-record parents)\n (-> (listof exact-integer?) string?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec evolutionary_record(Parents :: [integer()]) -> unicode:unicode_binary().\nevolutionary_record(Parents) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec evolutionary_record(parents :: [integer]) :: String.t\n def evolutionary_record(parents) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n String evolutionaryRecord(List parents) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"776\", \"totalSubmission\": \"1.6K\", \"totalAcceptedRaw\": 776, \"totalSubmissionRaw\": 1594, \"acRate\": \"48.7%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "[-1,0,0,2]", + "metaData": "{\"name\": \"evolutionaryRecord\", \"params\": [{\"name\": \"parents\", \"type\": \"integer[]\"}], \"return\": {\"type\": \"string\"}}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n

\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"

\\u7248\\u672c\\uff1aSwift 5.5.2<\\/code><\\/p>\\r\\n\\r\\n

\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"

\\u7248\\u672c\\uff1aGo 1.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/code><\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"

\\u7248\\u672c\\uff1aScala 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/p>\\r\\n\\r\\n

\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n

\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"],\"dart\":[\"Dart\",\"

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "MARKDOWN", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[-1,0,0,2]\n[-1,0,0,1,2,2]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/ryfUiz.json b/leetcode-cn/originData/ryfUiz.json new file mode 100644 index 00000000..ce0e4acf --- /dev/null +++ b/leetcode-cn/originData/ryfUiz.json @@ -0,0 +1,161 @@ +{ + "data": { + "question": { + "questionId": "1000569", + "questionFrontendId": "LCP 81", + "categoryTitle": "Algorithms", + "boundTopicId": 2258738, + "title": "与非的谜题", + "titleSlug": "ryfUiz", + "content": "", + "translatedTitle": "与非的谜题", + "translatedContent": "在永恒之森中,封存着有关万灵之树线索的卷轴,只要探险队通过最后的考验,便可以获取前往万灵之树的线索。\n\n探险队需要从一段不断变化的谜题数组中找到最终的密码,初始的谜题为长度为 `n` 的数组 `arr`(下标从 0 开始),数组中的数字代表了 `k` 位二进制数。\n破解谜题的过程中,需要使用 `与非(NAND)` 运算方式,`operations[i] = [type,x,y]` 表示第 `i` 次进行的谜题操作信息:\n- 若 `type = 0`,表示修改操作,将谜题数组中下标 `x` 的数字变化为 `y`;\n- 若 `type = 1`,表示运算操作,将数字 `y` 进行 `x*n` 次「与非」操作,第 `i` 次与非操作为 `y = y NAND arr[i%n]`;\n > 运算操作结果即:`y NAND arr[0%n] NAND arr[1%n] NAND arr[2%n] ... NAND arr[(x*n-1)%n]`\n\n最后,将所有运算操作的结果按顺序逐一进行 `异或(XOR)`运算,从而得到最终解开封印的密码。请返回最终解开封印的密码。\n\n**注意:**\n- 「与非」(NAND)的操作为:先进行 `与` 操作,后进行 `非` 操作。\n > 例如:两个三位二进制数`2`和`3`,其与非结果为 `NOT ((010) AND (011)) = (101) = 5`\n\n**示例 1:**\n> 输入: \n> `k = 3`\n> `arr = [1,2]`\n> `operations = [[1,2,3],[0,0,3],[1,2,2]]`\n>\n> 输出: `2`\n>\n> 解释:\n> 初始的谜题数组为 [1,2],二进制位数为 3,\n> 第 0 次进行运算操作,将数字 3(011) 进行 2\\*2 次「与非」运算,\n> 运算操作结果为 `3 NAND 1 NAND 2 NAND 1 NAND 2 = 5`\n> 第 1 次进行修改操作,谜题数组的第 `0` 个数字变化为 `3`,谜题变成 `[3,2]`\n> 第 2 次进行运算操作,将数字 2(010) 进行 2\\*2 次「与非」运算,\n> 运算操作结果为 `2 NAND 3 NAND 2 NAND 3 NAND 2 = 7`\n> 所有运算操作结果进行「异或」运算为 `5 XOR 7 = 2`\n> 因此得到的最终密码为 `2`。\n\n**示例 2:**\n> 输入:\n> `k = 4`\n> `arr = [4,6,4,7,10,9,11]`\n> `operations = [[1,5,7],[1,7,14],[0,6,7],[1,6,5]]`\n> 输出: `9`\n> 解释: \n> 初始的谜题数组为 [4,6,4,7,10,9,11],\n> 第 0 次进行运算操作,运算操作结果为 5;\n> 第 1 次进行运算操作,运算操作结果为 5;\n> 第 2 次进行修改操作,修改后谜题数组为 [4, 6, 4, 7, 10, 9, 7];\n> 第 3 次进行运算操作,运算操作结果为 9;\n> 所有运算操作结果进行「异或」运算为 `5 XOR 5 XOR 9 = 9`;\n> 因此得到的最终密码为 `9`。\n\n**提示:**\n- `1 <= arr.length, operations.length <= 10^4`\n- `1 <= k <= 30`\n- `0 <= arr[i] < 2^k`\n- 若 `type = 0`,`0 <= x < arr.length` 且 `0 <= y < 2^k`\n- 若 `type = 1`,`1 <= x < 10^9` 且 `0 <= y < 2^k`\n- 保证存在 `type = 1` 的操作\n", + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 4, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": false, \"java\": true, \"python\": true, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int getNandResult(int k, vector& arr, vector>& operations) {\n\n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int getNandResult(int k, int[] arr, int[][] operations) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def getNandResult(self, k, arr, operations):\n \"\"\"\n :type k: int\n :type arr: List[int]\n :type operations: List[List[int]]\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def getNandResult(self, k: int, arr: List[int], operations: List[List[int]]) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int getNandResult(int k, int* arr, int arrSize, int** operations, int operationsSize, int* operationsColSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int GetNandResult(int k, int[] arr, int[][] operations) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} k\n * @param {number[]} arr\n * @param {number[][]} operations\n * @return {number}\n */\nvar getNandResult = function(k, arr, operations) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} k\n# @param {Integer[]} arr\n# @param {Integer[][]} operations\n# @return {Integer}\ndef get_nand_result(k, arr, operations)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func getNandResult(_ k: Int, _ arr: [Int], _ operations: [[Int]]) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func getNandResult(k int, arr []int, operations [][]int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def getNandResult(k: Int, arr: Array[Int], operations: Array[Array[Int]]): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun getNandResult(k: Int, arr: IntArray, operations: Array): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn get_nand_result(k: i32, arr: Vec, operations: Vec>) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $k\n * @param Integer[] $arr\n * @param Integer[][] $operations\n * @return Integer\n */\n function getNandResult($k, $arr, $operations) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function getNandResult(k: number, arr: number[], operations: number[][]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (get-nand-result k arr operations)\n (-> exact-integer? (listof exact-integer?) (listof (listof exact-integer?)) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec get_nand_result(K :: integer(), Arr :: [integer()], Operations :: [[integer()]]) -> integer().\nget_nand_result(K, Arr, Operations) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec get_nand_result(k :: integer, arr :: [integer], operations :: [[integer]]) :: integer\n def get_nand_result(k, arr, operations) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int getNandResult(int k, List arr, List> operations) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"383\", \"totalSubmission\": \"931\", \"totalAcceptedRaw\": 383, \"totalSubmissionRaw\": 931, \"acRate\": \"41.1%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "3\n[1,2]\n[[1,2,3],[0,0,3],[1,2,2]]", + "metaData": "{\"name\": \"getNandResult\", \"params\": [{\"name\": \"k\", \"type\": \"integer\"}, {\"name\": \"arr\", \"type\": \"integer[]\"}, {\"name\": \"operations\", \"type\": \"integer[][]\"}], \"return\": {\"type\": \"integer\"}}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n

\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"

\\u7248\\u672c\\uff1aSwift 5.5.2<\\/code><\\/p>\\r\\n\\r\\n

\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"

\\u7248\\u672c\\uff1aGo 1.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/code><\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"

\\u7248\\u672c\\uff1aScala 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/p>\\r\\n\\r\\n

\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n

\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"],\"dart\":[\"Dart\",\"

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "MARKDOWN", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "3\n[1,2]\n[[1,2,3],[0,0,3],[1,2,2]]\n4\n[4,6,4,7,10,9,11]\n[[1,5,7],[1,7,14],[0,6,7],[1,6,5]]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/sum-in-a-matrix.json b/leetcode-cn/originData/sum-in-a-matrix.json new file mode 100644 index 00000000..00cb3ccb --- /dev/null +++ b/leetcode-cn/originData/sum-in-a-matrix.json @@ -0,0 +1,164 @@ +{ + "data": { + "question": { + "questionId": "2728", + "questionFrontendId": "2679", + "categoryTitle": "Algorithms", + "boundTopicId": 2266663, + "title": "Sum in a Matrix", + "titleSlug": "sum-in-a-matrix", + "content": "

You are given a 0-indexed 2D integer array nums. Initially, your score is 0. Perform the following operations until the matrix becomes empty:

\n\n
    \n\t
  1. From each row in the matrix, select the largest number and remove it. In the case of a tie, it does not matter which number is chosen.
  2. \n\t
  3. Identify the highest number amongst all those removed in step 1. Add that number to your score.
  4. \n
\n\n

Return the final score.

\n

 

\n

Example 1:

\n\n
\nInput: nums = [[7,2,1],[6,4,2],[6,5,3],[3,2,1]]\nOutput: 15\nExplanation: In the first operation, we remove 7, 6, 6, and 3. We then add 7 to our score. Next, we remove 2, 4, 5, and 2. We add 5 to our score. Lastly, we remove 1, 2, 3, and 1. We add 3 to our score. Thus, our final score is 7 + 5 + 3 = 15.\n
\n\n

Example 2:

\n\n
\nInput: nums = [[1]]\nOutput: 1\nExplanation: We remove 1 and add it to the answer. We return 1.
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 300
  • \n\t
  • 1 <= nums[i].length <= 500
  • \n\t
  • 0 <= nums[i][j] <= 103
  • \n
\n", + "translatedTitle": "矩阵中的和", + "translatedContent": "

给你一个下标从 0 开始的二维整数数组 nums 。一开始你的分数为 0 。你需要执行以下操作直到矩阵变为空:

\n\n
    \n\t
  1. 矩阵中每一行选取最大的一个数,并删除它。如果一行中有多个最大的数,选择任意一个并删除。
  2. \n\t
  3. 在步骤 1 删除的所有数字中找到最大的一个数字,将它添加到你的 分数 中。
  4. \n
\n\n

请你返回最后的 分数 。

\n\n

 

\n\n

示例 1:

\n\n
\n输入:nums = [[7,2,1],[6,4,2],[6,5,3],[3,2,1]]\n输出:15\n解释:第一步操作中,我们删除 7 ,6 ,6 和 3 ,将分数增加 7 。下一步操作中,删除 2 ,4 ,5 和 2 ,将分数增加 5 。最后删除 1 ,2 ,3 和 1 ,将分数增加 3 。所以总得分为 7 + 5 + 3 = 15 。\n
\n\n

示例 2:

\n\n
\n输入:nums = [[1]]\n输出:1\n解释:我们删除 1 并将分数增加 1 ,所以返回 1 。
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= nums.length <= 300
  • \n\t
  • 1 <= nums[i].length <= 500
  • \n\t
  • 0 <= nums[i][j] <= 103
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 3, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": false, \"java\": true, \"python\": true, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int matrixSum(vector>& nums) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int matrixSum(int[][] nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def matrixSum(self, nums):\n \"\"\"\n :type nums: List[List[int]]\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def matrixSum(self, nums: List[List[int]]) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int matrixSum(int** nums, int numsSize, int* numsColSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MatrixSum(int[][] nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[][]} nums\n * @return {number}\n */\nvar matrixSum = function(nums) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[][]} nums\n# @return {Integer}\ndef matrix_sum(nums)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func matrixSum(_ nums: [[Int]]) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func matrixSum(nums [][]int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def matrixSum(nums: Array[Array[Int]]): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun matrixSum(nums: Array): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn matrix_sum(nums: Vec>) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[][] $nums\n * @return Integer\n */\n function matrixSum($nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function matrixSum(nums: number[][]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (matrix-sum nums)\n (-> (listof (listof exact-integer?)) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec matrix_sum(Nums :: [[integer()]]) -> integer().\nmatrix_sum(Nums) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec matrix_sum(nums :: [[integer]]) :: integer\n def matrix_sum(nums) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int matrixSum(List> nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"2.7K\", \"totalSubmission\": \"3.6K\", \"totalAcceptedRaw\": 2657, \"totalSubmissionRaw\": 3569, \"acRate\": \"74.4%\"}", + "hints": [ + "Sort the numbers in each row in decreasing order.", + "The answer is the summation of the max number in every column after sorting the rows." + ], + "solution": null, + "status": null, + "sampleTestCase": "[[7,2,1],[6,4,2],[6,5,3],[3,2,1]]", + "metaData": "{\n \"name\": \"matrixSum\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[][]\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n

\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"

\\u7248\\u672c\\uff1aSwift 5.5.2<\\/code><\\/p>\\r\\n\\r\\n

\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"

\\u7248\\u672c\\uff1aGo 1.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/code><\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"

\\u7248\\u672c\\uff1aScala 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/p>\\r\\n\\r\\n

\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n

\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"],\"dart\":[\"Dart\",\"

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

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[[7,2,1],[6,4,2],[6,5,3],[3,2,1]]\n[[1]]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/throttle.json b/leetcode-cn/originData/throttle.json new file mode 100644 index 00000000..a1256905 --- /dev/null +++ b/leetcode-cn/originData/throttle.json @@ -0,0 +1,63 @@ +{ + "data": { + "question": { + "questionId": "2771", + "questionFrontendId": "2676", + "categoryTitle": "JavaScript", + "boundTopicId": 2267103, + "title": "Throttle", + "titleSlug": "throttle", + "content": "

Given a function fn and a time in milliseconds t, return a throttled version of that function.

\n\n

A throttled function is first called without delay and then, for a time interval of t milliseconds, can't be executed but should store the latest function arguments provided to call fn with them after the end of the delay.

\n\n

For instance, t = 50ms, and the function was called at 30ms, 40ms, and 60ms. The first function call would block calling functions for the following t milliseconds. The second function call would save arguments, and the third call arguments should overwrite currently stored arguments from the second call because the second and third calls are called before 80ms. Once the delay has passed, the throttled function should be called with the latest arguments provided during the delay period, and it should also create another delay period of 80ms + t.

\n\n

\"ThrottleThe above diagram shows how throttle will transform events. Each rectangle represents 100ms and the throttle time is 400ms. Each color represents a different set of inputs.

\n\n

 

\n

Example 1:

\n\n
\nInput: t = 100, calls = [{"t":20,"inputs":[1]}]\nOutput: [{"t":20,"inputs":[1]}]\nExplanation: The 1st call is always called without delay\n
\n\n

Example 2:

\n\n
\nInput: t = 50, calls = [{"t":50,"inputs":[1]},{"t":75,"inputs":[2]}]\nOutput: [{"t":50,"inputs":[1]},{"t":100,"inputs":[2]}]\nExplanation: \nThe 1st is called a function with arguments (1) without delay.\nThe 2nd is called at 75ms, within the delay period because 50ms + 50ms = 100ms, so the next call can be reached at 100ms. Therefore, we save arguments from the 2nd call to use them at the callback of the 1st call.\n
\n\n

Example 3:

\n\n
\nInput: t = 70, calls = [{"t":50,"inputs":[1]},{"t":75,"inputs":[2]},{"t":90,"inputs":[8]},{"t": 140, "inputs":[5,7]},{"t": 300, "inputs": [9,4]}]\nOutput: [{"t":50,"inputs":[1]},{"t":120,"inputs":[8]},{"t":190,"inputs":[5,7]},{"t":300,"inputs":[9,4]}]\nExplanation: \nThe 1st is called a function with arguments (1) without delay.\nThe 2nd is called at 75ms within the delay period because 50ms + 70ms = 120ms, so it should only save arguments. \nThe 3rd is also called within the delay period, and because we need just the latest function arguments, we overwrite previous ones. After the delay period, we do a callback at 120ms with saved arguments. That callback makes another delay period of 120ms + 70ms = 190ms so that the next function can be called at 190ms.\nThe 4th is called at 140ms in the delay period, so it should be called as a callback at 190ms. That will create another delay period of 190ms + 70ms = 260ms.\nThe 5th is called at 300ms, but it is after 260ms, so it should be called immediately and should create another delay period of 300ms + 70ms = 370ms.
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 0 <= t <= 1000
  • \n\t
  • 1 <= calls.length <= 10
  • \n\t
  • 0 <= calls[i].t <= 1000
  • \n\t
  • 0 <= calls[i].inputs[i], calls[i].inputs.length <= 10
  • \n
\n", + "translatedTitle": "节流", + "translatedContent": "

现给定一个函数 fn 和一个以毫秒为单位的时间 t ,请你返回该函数的 节流 版本。

\n\n

节流 函数首先立即被调用,然后在 t 毫秒的时间间隔内不能再次执行,但应该存储最新的函数参数,以便在延迟结束后使用这些参数调用 fn

\n\n

例如,t = 50ms ,并且函数在 30ms40ms60ms 时被调用。第一次函数调用会在接下来的 t 毫秒内阻止调用函数。第二次函数调用会保存参数,而第三次调用的参数应该覆盖当前保存的第二次调用的参数,因为第二次和第三次调用发生在 80ms 之前。一旦延迟时间过去,节流函数应该使用延迟期间提供的最新参数进行调用,并且还应创建另一个延迟期间,时长为 80ms + t

\n\n

\"Throttle上面的图示展示了节流如何转换事件。每个矩形代表100毫秒,节流时间为400毫秒。每种颜色代表不同的输入集合。

\n\n

 

\n\n

示例 1:

\n\n
\n输入:t = 100, calls = [{\"t\":20,\"inputs\":[1]}]\n输出:[{\"t\":20,\"inputs\":[1]}]\n解释:第一次调用总是立即执行,没有延迟。\n
\n\n

示例 2:

\n\n
\n输入:t = 50, calls = [{\"t\":50,\"inputs\":[1]},{\"t\":75,\"inputs\":[2]}]\n输出:[{\"t\":50,\"inputs\":[1]},{\"t\":100,\"inputs\":[2]}]\n解释:\n第一次调用立即执行带有参数 (1) 的函数。 \n第二次调用发生在 75毫秒 时,在延迟期间内,因为 50毫秒 + 50毫秒 = 100毫秒,所以下一次调用可以在 100毫秒 时执行。因此,我们保存第二次调用的参数,以便在第一次调用的回调函数中使用。\n
\n\n

示例 3:

\n\n
\n输入:t = 70, calls = [{\"t\":50,\"inputs\":[1]},{\"t\":75,\"inputs\":[2]},{\"t\":90,\"inputs\":[8]},{\"t\": 140, \"inputs\":[5,7]},{\"t\": 300, \"inputs\": [9,4]}]\n输出:[{\"t\":50,\"inputs\":[1]},{\"t\":120,\"inputs\":[8]},{\"t\":190,\"inputs\":[5,7]},{\"t\":300,\"inputs\":[9,4]}]\n解释:\n第一次调用立即执行带有参数 (1) 的函数。 \n第二次调用发生在 75毫秒 时,在延迟期间内,因为 50毫秒 + 70毫秒 = 120毫秒,所以它只应保存参数。 \n第三次调用也在延迟期间内,因为我们只需要最新的函数参数,所以覆盖之前的参数。延迟期过后,在 120毫秒时进行回调,并使用保存的参数进行调用。该回调会创建另一个延迟期间,时长为 120毫秒 + 70毫秒 = 190毫秒,以便下一个函数可以在 190毫秒时调用。 \n第四次调用发生在 140毫秒,在延迟期间内,因此应在190毫秒时作为回调进行调用。这将创建另一个延迟期间,时长为 190毫秒 + 70毫秒 = 260毫秒。 \n第五次调用发生在 300毫秒,但它是在 260毫秒 之后,所以应立即调用,并创建另一个延迟期间,时长为 300毫秒 + 70毫秒 = 370毫秒。
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 0 <= t <= 1000
  • \n\t
  • 1 <= calls.length <= 10
  • \n\t
  • 0 <= calls[i].t <= 1000
  • \n\t
  • 0 <= calls[i].inputs[i], calls[i].inputs.length <= 10
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 0, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {Function} fn\n * @param {number} t\n * @return {Function}\n */\nvar throttle = function(fn, t) {\n return function(...args) {\n\n }\n};\n\n/**\n * const throttled = throttle(console.log, 100);\n * throttled(\"log\"); // logged immediately.\n * throttled(\"log\"); // logged at t=100ms.\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "type F = (...args: any[]) => void\n\nfunction throttle(fn: F, t: number): F {\n return function (...args) {\n\n }\n};\n\n/**\n * const throttled = throttle(console.log, 100);\n * throttled(\"log\"); // logged immediately.\n * throttled(\"log\"); // logged at t=100ms.\n */", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"86\", \"totalSubmission\": \"182\", \"totalAcceptedRaw\": 86, \"totalSubmissionRaw\": 182, \"acRate\": \"47.3%\"}", + "hints": [ + "Store a variable for currArguments.", + "If no timeout is in progress, immediately execute the function and create a timeout. If a timeout is in progress, set the currArguments to the new arguments.", + "When the timeout is done: if currArguments is null, do nothing. Otherwise, execute the function with currArguments and create another timeout." + ], + "solution": null, + "status": null, + "sampleTestCase": "100\n[{\"t\":20,\"inputs\":[1]}]", + "metaData": "{\n \"name\": \"throttle\",\n \"params\": [\n {\n \"name\": \"fn\",\n \"type\": \"string\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"t\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n },\n \"languages\": [\n \"javascript\",\n \"typescript\"\n ],\n \"manual\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"javascript\":[\"JavaScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"typescript\":[\"TypeScript\",\"

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

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

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "100\n[{\"t\":20,\"inputs\":[1]}]\n50\n[{\"t\":50,\"inputs\":[1]},{\"t\":75,\"inputs\":[2]}]\n70\n[{\"t\":50,\"inputs\":[1]},{\"t\":75,\"inputs\":[2]},{\"t\":90,\"inputs\":[8]},{\"t\": 140, \"inputs\":[5,7]},{\"t\": 300, \"inputs\": [9,4]}]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/problem (Chinese)/万灵之树 [cnHoX6].md b/leetcode-cn/problem (Chinese)/万灵之树 [cnHoX6].md new file mode 100644 index 00000000..e863da42 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/万灵之树 [cnHoX6].md @@ -0,0 +1,58 @@ +探险家小扣终于来到了万灵之树前,挑战最后的谜题。 +已知小扣拥有足够数量的链接节点和 `n` 颗幻境宝石,`gem[i]` 表示第 `i` 颗宝石的数值。现在小扣需要使用这些链接节点和宝石组合成一颗二叉树,其组装规则为: +- 链接节点将作为二叉树中的非叶子节点,且每个链接节点必须拥有 `2` 个子节点; +- 幻境宝石将作为二叉树中的叶子节点,所有的幻境宝石都必须被使用。 + +能量首先进入根节点,而后将按如下规则进行移动和记录: +- 若能量首次到达该节点时: + - 记录数字 `1`; + - 若该节点为叶节点,将额外记录该叶节点的数值; +- 若存在未到达的子节点,则选取未到达的一个子节点(优先选取左子节点)进入; +- 若无子节点或所有子节点均到达过,此时记录 `9`,并回到当前节点的父节点(若存在)。 + +如果最终记下的数依序连接成一个整数 `num`,满足 $num \mod~p=target$,则视为解开谜题。 +请问有多少种二叉树的组装方案,可以使得最终记录下的数字可以解开谜题 + +**注意:** +- 两棵结构不同的二叉树,作为不同的组装方案 +- 两棵结构相同的二叉树且存在某个相同位置处的宝石编号不同,也作为不同的组装方案 +- 可能存在数值相同的两颗宝石 + +**示例 1:** +> 输入:`gem = [2,3]` +> `p = 100000007` +> `target = 11391299` +> +> 输出:`1` +> +> 解释: +> 包含 `2` 个叶节点的结构只有一种。 +> 假设 B、C 节点的值分别为 3、2,对应 target 为 11391299,如下图所示。 +> 11391299 % 100000007 = 11391299,满足条件; +> 假设 B、C 节点的值分别为 2、3,对应 target 为 11291399; +> 11291399 % 100000007 = 11291399,不满足条件; +> 因此只存在 1 种方案,返回 1 +![万灵 (1).gif](https://pic.leetcode.cn/1682397079-evMssw-%E4%B8%87%E7%81%B5%20\(1\).gif){:height=300px} + + +**示例 2:** +> 输入:`gem = [3,21,3]` +> `p = 7` +> `target = 5` +> +> 输出:`4` +> +> 解释: +包含 `3` 个叶节点树结构有两种,列举如下: +满足条件的组合有四种情况: +> 当结构为下图(1)时:叶子节点的值为 [3,3,21] 或 [3,3,21],得到的整数为 `11139139912199`。 +> 当结构为下图(2)时:叶子节点的值为 [21,3,3] 或 [21,3,3],得到的整数为 `11219113913999`。 +![image.png](https://pic.leetcode.cn/1682322894-vfqJIV-image.png){:width=500px} + + +**提示:** +- `1 <= gem.length <= 9` +- `0 <= gem[i] <= 10^9` +- `1 <= p <= 10^9`,保证 $p$ 为素数。 +- `0 <= target < p` +- 存在 2 组 `gem.length == 9` 的用例 \ No newline at end of file diff --git a/leetcode-cn/problem (Chinese)/与非的谜题 [ryfUiz].md b/leetcode-cn/problem (Chinese)/与非的谜题 [ryfUiz].md new file mode 100644 index 00000000..cf2aa525 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/与非的谜题 [ryfUiz].md @@ -0,0 +1,54 @@ +在永恒之森中,封存着有关万灵之树线索的卷轴,只要探险队通过最后的考验,便可以获取前往万灵之树的线索。 + +探险队需要从一段不断变化的谜题数组中找到最终的密码,初始的谜题为长度为 `n` 的数组 `arr`(下标从 0 开始),数组中的数字代表了 `k` 位二进制数。 +破解谜题的过程中,需要使用 `与非(NAND)` 运算方式,`operations[i] = [type,x,y]` 表示第 `i` 次进行的谜题操作信息: +- 若 `type = 0`,表示修改操作,将谜题数组中下标 `x` 的数字变化为 `y`; +- 若 `type = 1`,表示运算操作,将数字 `y` 进行 `x*n` 次「与非」操作,第 `i` 次与非操作为 `y = y NAND arr[i%n]`; + > 运算操作结果即:`y NAND arr[0%n] NAND arr[1%n] NAND arr[2%n] ... NAND arr[(x*n-1)%n]` + +最后,将所有运算操作的结果按顺序逐一进行 `异或(XOR)`运算,从而得到最终解开封印的密码。请返回最终解开封印的密码。 + +**注意:** +- 「与非」(NAND)的操作为:先进行 `与` 操作,后进行 `非` 操作。 + > 例如:两个三位二进制数`2`和`3`,其与非结果为 `NOT ((010) AND (011)) = (101) = 5` + +**示例 1:** +> 输入: +> `k = 3` +> `arr = [1,2]` +> `operations = [[1,2,3],[0,0,3],[1,2,2]]` +> +> 输出: `2` +> +> 解释: +> 初始的谜题数组为 [1,2],二进制位数为 3, +> 第 0 次进行运算操作,将数字 3(011) 进行 2\*2 次「与非」运算, +> 运算操作结果为 `3 NAND 1 NAND 2 NAND 1 NAND 2 = 5` +> 第 1 次进行修改操作,谜题数组的第 `0` 个数字变化为 `3`,谜题变成 `[3,2]` +> 第 2 次进行运算操作,将数字 2(010) 进行 2\*2 次「与非」运算, +> 运算操作结果为 `2 NAND 3 NAND 2 NAND 3 NAND 2 = 7` +> 所有运算操作结果进行「异或」运算为 `5 XOR 7 = 2` +> 因此得到的最终密码为 `2`。 + +**示例 2:** +> 输入: +> `k = 4` +> `arr = [4,6,4,7,10,9,11]` +> `operations = [[1,5,7],[1,7,14],[0,6,7],[1,6,5]]` +> 输出: `9` +> 解释: +> 初始的谜题数组为 [4,6,4,7,10,9,11], +> 第 0 次进行运算操作,运算操作结果为 5; +> 第 1 次进行运算操作,运算操作结果为 5; +> 第 2 次进行修改操作,修改后谜题数组为 [4, 6, 4, 7, 10, 9, 7]; +> 第 3 次进行运算操作,运算操作结果为 9; +> 所有运算操作结果进行「异或」运算为 `5 XOR 5 XOR 9 = 9`; +> 因此得到的最终密码为 `9`。 + +**提示:** +- `1 <= arr.length, operations.length <= 10^4` +- `1 <= k <= 30` +- `0 <= arr[i] < 2^k` +- 若 `type = 0`,`0 <= x < arr.length` 且 `0 <= y < 2^k` +- 若 `type = 1`,`1 <= x < 10^9` 且 `0 <= y < 2^k` +- 保证存在 `type = 1` 的操作 diff --git a/leetcode-cn/problem (Chinese)/二进制数转字符串 [binary-number-to-string-lcci].html b/leetcode-cn/problem (Chinese)/二进制数转字符串 [binary-number-to-string-lcci].html new file mode 100644 index 00000000..a4171ab9 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/二进制数转字符串 [binary-number-to-string-lcci].html @@ -0,0 +1,25 @@ +

二进制数转字符串。给定一个介于0和1之间的实数(如0.72),类型为double,打印它的二进制表达式。如果该数字无法精确地用32位以内的二进制表示,则打印“ERROR”。

+ +

示例1:

+ +
+ 输入:0.625
+ 输出:"0.101"
+
+ +

示例2:

+ +
+ 输入:0.1
+ 输出:"ERROR"
+ 提示:0.1无法被二进制准确表示
+
+ +

 

+ +

提示:

+ +
    +
  • 32位包括输出中的 "0." 这两位。
  • +
  • 题目保证输入用例的小数位数最多只有 6
  • +
diff --git a/leetcode-cn/problem (Chinese)/使二叉树所有路径值相等的最小代价 [make-costs-of-paths-equal-in-a-binary-tree].html b/leetcode-cn/problem (Chinese)/使二叉树所有路径值相等的最小代价 [make-costs-of-paths-equal-in-a-binary-tree].html new file mode 100644 index 00000000..b75ef595 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/使二叉树所有路径值相等的最小代价 [make-costs-of-paths-equal-in-a-binary-tree].html @@ -0,0 +1,51 @@ +

给你一个整数 n 表示一棵 满二叉树 里面节点的数目,节点编号从 1 到 n 。根节点编号为 1 ,树中每个非叶子节点 i 都有两个孩子,分别是左孩子 2 * i 和右孩子 2 * i + 1 。

+ +

树中每个节点都有一个值,用下标从 0 开始、长度为 n 的整数数组 cost 表示,其中 cost[i] 是第 i + 1 个节点的值。每次操作,你可以将树中 任意 节点的值 增加 1 。你可以执行操作 任意 次。

+ +

你的目标是让根到每一个 叶子结点 的路径值相等。请你返回 最少 需要执行增加操作多少次。

+ +

注意:

+ +
    +
  • 满二叉树 指的是一棵树,它满足树中除了叶子节点外每个节点都恰好有 2 个节点,且所有叶子节点距离根节点距离相同。
  • +
  • 路径值 指的是路径上所有节点的值之和。
  • +
+ +

 

+ +

示例 1:

+ +

+ +
+输入:n = 7, cost = [1,5,2,2,3,3,1]
+输出:6
+解释:我们执行以下的增加操作:
+- 将节点 4 的值增加一次。
+- 将节点 3 的值增加三次。
+- 将节点 7 的值增加两次。
+从根到叶子的每一条路径值都为 9 。
+总共增加次数为 1 + 3 + 2 = 6 。
+这是最小的答案。
+
+ +

示例 2:

+ +

+ +
+输入:n = 3, cost = [5,3,3]
+输出:0
+解释:两条路径已经有相等的路径值,所以不需要执行任何增加操作。
+
+ +

 

+ +

提示:

+ +
    +
  • 3 <= n <= 105
  • +
  • n + 1 是 2 的幂
  • +
  • cost.length == n
  • +
  • 1 <= cost[i] <= 104
  • +
diff --git a/leetcode-cn/problem (Chinese)/分块数组 [chunk-array].html b/leetcode-cn/problem (Chinese)/分块数组 [chunk-array].html new file mode 100644 index 00000000..302918b4 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/分块数组 [chunk-array].html @@ -0,0 +1,48 @@ +

给定一个数组 arr 和一个块大小 size ,返回一个 分块 的数组。分块 的数组包含了 arr 中的原始元素,但是每个子数组的长度都是 size 。如果 arr.length 不能被 size 整除,那么最后一个子数组的长度可能小于 size 。

+ +

你可以假设该数组是 JSON.parse 的输出结果。换句话说,它是有效的JSON。

+ +

请你在不使用 lodash 的函数 _.chunk 的情况下解决这个问题。

+ +

 

+ +

示例 1:

+ +
+输入:arr = [1,2,3,4,5], size = 1
+输出:[[1],[2],[3],[4],[5]]
+解释:数组 arr 被分割成了每个只有一个元素的子数组。
+
+ +

示例 2:

+ +
+输入:arr = [1,9,6,3,2], size = 3
+输出:[[1,9,6],[3,2]]
+解释:数组 arr 被分割成了每个有三个元素的子数组。然而,第二个子数组只有两个元素。
+
+ +

示例 3:

+ +
+输入:arr = [8,5,3,2,6], size = 6
+输出:[[8,5,3,2,6]]
+解释:size 大于 arr.length ,因此所有元素都在第一个子数组中。
+
+ +

示例 4:

+ +
+输入:arr = [], size = 1
+输出:[]
+解释:没有元素需要分块,因此返回一个空数组。
+ +

 

+ +

提示:

+ +
    +
  • arr is a valid JSON array
  • +
  • 2 <= JSON.stringify(arr).length <= 105
  • +
  • 1 <= size <= arr.length + 1
  • +
diff --git a/leetcode-cn/problem (Chinese)/创建 Hello World 函数 [create-hello-world-function].html b/leetcode-cn/problem (Chinese)/创建 Hello World 函数 [create-hello-world-function].html new file mode 100644 index 00000000..ce1a14a1 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/创建 Hello World 函数 [create-hello-world-function].html @@ -0,0 +1,34 @@ +请你编写一个名为 createHelloWorld 的函数。它应该返回一个新的函数,该函数总是返回 "Hello World" 。 +

 

+ +

示例 1:

+ +
+输入:args = []
+输出:"Hello World"
+解释:
+const f = createHelloWorld();
+f(); // "Hello World"
+
+createHelloWorld 返回的函数应始终返回 "Hello World"。
+
+ +

示例 2:

+ +
+输入:args = [{},null,42]
+输出:"Hello World"
+解释:
+const f = createHelloWorld();
+f({}, null, 42); // "Hello World"
+
+可以传递任何参数给函数,但它应始终返回 "Hello World"。
+
+ +

 

+ +

提示:

+ +
    +
  • 0 <= args.length <= 10
  • +
diff --git a/leetcode-cn/problem (Chinese)/只允许一次函数调用 [allow-one-function-call].html b/leetcode-cn/problem (Chinese)/只允许一次函数调用 [allow-one-function-call].html new file mode 100644 index 00000000..eb73c5f9 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/只允许一次函数调用 [allow-one-function-call].html @@ -0,0 +1,41 @@ +

给定一个函数 fn ,它返回一个新的函数,返回的函数与原始函数完全相同,只不过它确保 fn 最多被调用一次。

+ +
    +
  • 第一次调用返回的函数时,它应该返回与 fn 相同的结果。
  • +
  • 第一次后的每次调用,它应该返回 undefined
  • +
+ +

 

+ +

示例 1:

+ +
+输入:fn = (a,b,c) => (a + b + c), calls = [[1,2,3],[2,3,6]]
+输出:[{"calls":1,"value":6}]
+解释:
+const onceFn = once(fn);
+onceFn(1, 2, 3); // 6
+onceFn(2, 3, 6); // undefined, fn 没有被调用
+
+ +

示例 2:

+ +
+输入:fn = (a,b,c) => (a * b * c), calls = [[5,7,4],[2,3,6],[4,6,8]]
+输出:[{"calls":1,"value":140}]
+解释:
+const onceFn = once(fn);
+onceFn(5, 7, 4); // 140
+onceFn(2, 3, 6); // undefined, fn 没有被调用
+onceFn(4, 6, 8); // undefined, fn 没有被调用
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= calls.length <= 10
  • +
  • 1 <= calls[i].length <= 100
  • +
  • 2 <= JSON.stringify(calls).length <= 1000
  • +
diff --git a/leetcode-cn/problem (Chinese)/城墙防线 [Nsibyl].md b/leetcode-cn/problem (Chinese)/城墙防线 [Nsibyl].md new file mode 100644 index 00000000..daab3636 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/城墙防线 [Nsibyl].md @@ -0,0 +1,32 @@ +在探险营地间,小扣意外发现了一片城墙遗迹,在探索期间,却不巧遇到迁徙中的兽群向他迎面冲来。情急之下小扣吹响了他的苍蓝笛,随着笛声响起,遗迹中的城墙逐渐发生了横向膨胀。 +已知 `rampart[i] = [x,y]` 表示第 `i` 段城墙的初始所在区间。当城墙发生膨胀时,将遵循以下规则: +- 所有的城墙会同时膨胀相等的长度; +- 每个城墙可以向左、向右或向两个方向膨胀。 + +小扣为了确保自身的安全,需要在所有城墙均无重叠的情况下,让城墙尽可能的膨胀。请返回城墙可以膨胀的 **最大值** 。 + +**注意:** +- 初始情况下,所有城墙均不重叠,且 `rampart` 中的元素升序排列; +- 两侧的城墙可以向外无限膨胀。 + +**示例 1:** +>输入:`rampart = [[0,3],[4,5],[7,9]]` +> +>输出:`3` +> +>解释:如下图所示: +>`rampart[0]` 向左侧膨胀 3 个单位; +>`rampart[2]` 向右侧膨胀 3 个单位; +>`rampart[1]` 向左侧膨胀 1 个单位,向右膨胀 2 个单位。 +>不存在膨胀更多的方案,返回 3。 +![image.png](https://pic.leetcode.cn/1681717918-tWywrp-image.png){:width=750px} + +**示例 2:** +>输入:`rampart = [[1,2],[5,8],[11,15],[18,25]]` +> +>输出:`4` + +**提示:** +- `3 <= rampart.length <= 10^4` +- `rampart[i].length == 2` +- `0 <= rampart[i][0] < rampart[i][1] <= rampart[i+1][0] <= 10^8` \ No newline at end of file diff --git a/leetcode-cn/problem (Chinese)/将对象数组转换为矩阵 [array-of-objects-to-matrix].html b/leetcode-cn/problem (Chinese)/将对象数组转换为矩阵 [array-of-objects-to-matrix].html new file mode 100644 index 00000000..e370fe49 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/将对象数组转换为矩阵 [array-of-objects-to-matrix].html @@ -0,0 +1,127 @@ +

编写一个函数,将对象数组 arr 转换为矩阵 m 。

+ +

arr 是一个由对象组成的数组或一个数组。数组中的每个项都可以包含深层嵌套的子数组和子对象。它还可以包含数字、字符串、布尔值和空值。

+ +

矩阵 m 的第一行应该是列名。如果没有嵌套,列名是对象中的唯一键。如果存在嵌套,列名是对象中相应路径,以点号 "." 分隔。

+ +

剩余的每一行对应 arr 中的一个对象。矩阵中的每个值对应对象中的一个值。如果给定对象在给定列中没有值,则应该包含空字符串 ""

+ +

矩阵中的列应按 字典升序 排列。

+ +

 

+ +

示例 1:

+ +
+输入:
+arr = [
+  {"b": 1, "a": 2},
+  {"b": 3, "a": 4}
+]
+输出:
+[
+  ["a", "b"],
+  [2, 1],
+  [4, 3]
+]
+
+解释:
+两个对象中有两个唯一的列名:"a"和"b"。 
+"a"对应[2, 4]。 
+"b"对应[1, 3]。
+
+ +

示例 2:

+ +
+输入:
+arr = [
+  {"a": 1, "b": 2},
+  {"c": 3, "d": 4},
+  {}
+]
+输出:
+[
+  ["a", "b", "c", "d"],
+  [1, 2, "", ""],
+  ["", "", 3, 4],
+  ["", "", "", ""]
+]
+
+解释:
+有四个唯一的列名:"a"、"b"、"c"、"d"。 
+ 第一个对象具有与"a"和"b"关联的值。 
+第二个对象具有与"c"和"d"关联的值。 
+第三个对象没有键,因此只是一行空字符串。
+
+ +

示例 3:

+ +
+输入:
+arr = [
+  {"a": {"b": 1, "c": 2}},
+  {"a": {"b": 3, "d": 4}}
+]
+输出:
+[
+  ["a.b", "a.c", "a.d"],
+  [1, 2, ""],
+  [3, "", 4]
+]
+
+解释:
+在这个例子中,对象是嵌套的。键表示每个值的完整路径,路径之间用句点分隔。 
+有三个路径:"a.b"、"a.c"、"a.d"。
+
+ +

示例 4:

+ +
+输入:
+arr = [
+  [{"a": null}],
+  [{"b": true}],
+  [{"c": "x"}]
+]
+输出: 
+[
+  ["0.a", "0.b", "0.c"],
+  [null, "", ""],
+  ["", true, ""],
+  ["", "", "x"]
+]
+
+解释:
+数组也被视为具有索引为键的对象。 
+每个数组只有一个元素,所以键是"0.a"、"0.b"和"0.c"。
+
+ +

示例 5:

+ +
+输入:
+arr = [
+  {},
+  {},
+  {},
+]
+输出:
+[
+  [],
+  [],
+  [],
+  []
+]
+
+解释:
+没有键,所以每一行都是一个空数组。
+ +

 

+ +

提示:

+ +
    +
  • 1 <= arr.length <= 1000
  • +
  • unique keys <= 1000
  • +
diff --git a/leetcode-cn/problem (Chinese)/找出不同元素数目差数组 [find-the-distinct-difference-array].html b/leetcode-cn/problem (Chinese)/找出不同元素数目差数组 [find-the-distinct-difference-array].html new file mode 100644 index 00000000..9e46f9fa --- /dev/null +++ b/leetcode-cn/problem (Chinese)/找出不同元素数目差数组 [find-the-distinct-difference-array].html @@ -0,0 +1,44 @@ +

给你一个下标从 0 开始的数组 nums ,数组长度为 n

+ +

nums不同元素数目差 数组可以用一个长度为 n 的数组 diff 表示,其中 diff[i] 等于前缀 nums[0, ..., i] 中不同元素的数目 减去 后缀 nums[i + 1, ..., n - 1] 中不同元素的数目。

+ +

返回 nums不同元素数目差 数组。

+ +

注意 nums[i, ..., j] 表示 nums 的一个从下标 i 开始到下标 j 结束的子数组(包含下标 ij 对应元素)。特别需要说明的是,如果 i > j ,则 nums[i, ..., j] 表示一个空子数组。

+ +

 

+ +

示例 1:

+ +
+输入:nums = [1,2,3,4,5]
+输出:[-3,-1,1,3,5]
+解释:
+对于 i = 0,前缀中有 1 个不同的元素,而在后缀中有 4 个不同的元素。因此,diff[0] = 1 - 4 = -3 。
+对于 i = 1,前缀中有 2 个不同的元素,而在后缀中有 3 个不同的元素。因此,diff[1] = 2 - 3 = -1 。
+对于 i = 2,前缀中有 3 个不同的元素,而在后缀中有 2 个不同的元素。因此,diff[2] = 3 - 2 = 1 。
+对于 i = 3,前缀中有 4 个不同的元素,而在后缀中有 1 个不同的元素。因此,diff[3] = 4 - 1 = 3 。
+对于 i = 4,前缀中有 5 个不同的元素,而在后缀中有 0 个不同的元素。因此,diff[4] = 5 - 0 = 5 。
+
+ +

示例 2:

+ +
+输入:nums = [3,2,3,4,2]
+输出:[-2,-1,0,2,3]
+解释:
+对于 i = 0,前缀中有 1 个不同的元素,而在后缀中有 3 个不同的元素。因此,diff[0] = 1 - 3 = -2 。
+对于 i = 1,前缀中有 2 个不同的元素,而在后缀中有 3 个不同的元素。因此,diff[1] = 2 - 3 = -1 。
+对于 i = 2,前缀中有 2 个不同的元素,而在后缀中有 2 个不同的元素。因此,diff[2] = 2 - 2 = 0 。
+对于 i = 3,前缀中有 3 个不同的元素,而在后缀中有 1 个不同的元素。因此,diff[3] = 3 - 1 = 2 。
+对于 i = 4,前缀中有 3 个不同的元素,而在后缀中有 0 个不同的元素。因此,diff[4] = 3 - 0 = 3 。 
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= n == nums.length <= 50
  • +
  • 1 <= nums[i] <= 50
  • +
diff --git a/leetcode-cn/problem (Chinese)/找出转圈游戏输家 [find-the-losers-of-the-circular-game].html b/leetcode-cn/problem (Chinese)/找出转圈游戏输家 [find-the-losers-of-the-circular-game].html new file mode 100644 index 00000000..42fa3f9d --- /dev/null +++ b/leetcode-cn/problem (Chinese)/找出转圈游戏输家 [find-the-losers-of-the-circular-game].html @@ -0,0 +1,50 @@ +

n 个朋友在玩游戏。这些朋友坐成一个圈,按 顺时针方向1n 编号。从第 i 个朋友的位置开始顺时针移动 1 步会到达第 (i + 1) 个朋友的位置(1 <= i < n),而从第 n 个朋友的位置开始顺时针移动 1 步会回到第 1 个朋友的位置。

+ +

游戏规则如下:

+ +

1 个朋友接球。

+ +
    +
  • 接着,第 1 个朋友将球传给距离他顺时针方向 k 步的朋友。
  • +
  • 然后,接球的朋友应该把球传给距离他顺时针方向 2 * k 步的朋友。
  • +
  • 接着,接球的朋友应该把球传给距离他顺时针方向 3 * k 步的朋友,以此类推。
  • +
+ +

换句话说,在第 i 轮中持有球的那位朋友需要将球传递给距离他顺时针方向 i * k 步的朋友。

+ +

当某个朋友第 2 次接到球时,游戏结束。

+ +

在整场游戏中没有接到过球的朋友是 输家

+ +

给你参与游戏的朋友数量 n 和一个整数 k ,请按升序排列返回包含所有输家编号的数组 answer 作为答案。

+ +

 

+ +

示例 1:

+ +
+输入:n = 5, k = 2
+输出:[4,5]
+解释:以下为游戏进行情况:
+1)第 1 个朋友接球,第 1 个朋友将球传给距离他顺时针方向 2 步的玩家 —— 第 3 个朋友。
+2)第 3 个朋友将球传给距离他顺时针方向 4 步的玩家 —— 第 2 个朋友。
+3)第 2 个朋友将球传给距离他顺时针方向 6 步的玩家 —— 第 3 个朋友。
+4)第 3 个朋友接到两次球,游戏结束。
+
+ +

示例 2:

+ +
+输入:n = 4, k = 4
+输出:[2,3,4]
+解释:以下为游戏进行情况:
+1)第 1 个朋友接球,第 1 个朋友将球传给距离他顺时针方向 4 步的玩家 —— 第 1 个朋友。
+2)第 1 个朋友接到两次球,游戏结束。
+ +

 

+ +

提示:

+ +
    +
  • 1 <= k <= n <= 50
  • +
diff --git a/leetcode-cn/problem (Chinese)/提取咒文 [kjpLFZ].md b/leetcode-cn/problem (Chinese)/提取咒文 [kjpLFZ].md new file mode 100644 index 00000000..66c608eb --- /dev/null +++ b/leetcode-cn/problem (Chinese)/提取咒文 [kjpLFZ].md @@ -0,0 +1,29 @@ +随着兽群逐渐远去,一座大升降机缓缓的从地下升到了远征队面前。借由这台升降机,他们将能够到达地底的永恒至森。 +在升降机的操作台上,是一个由魔法符号组成的矩阵,为了便于辨识,我们用小写字母来表示。 `matrix[i][j]` 表示矩阵第 `i` 行 `j` 列的字母。该矩阵上有一个提取装置,可以对所在位置的字母提取。 +提取装置初始位于矩阵的左上角 `[0,0]`,可以通过每次操作移动到上、下、左、右相邻的 1 格位置中。提取装置每次移动或每次提取均记为一次操作。 + +远征队需要按照顺序,从矩阵中逐一取出字母以组成 `mantra`,才能够成功的启动升降机。请返回他们 **最少** 需要消耗的操作次数。如果无法完成提取,返回 `-1`。 + +**注意:** +- 提取装置可对同一位置的字母重复提取,每次提取一个 +- 提取字母时,需按词语顺序依次提取 + +**示例 1:** +>输入:`matrix = ["sd","ep"], mantra = "speed"` +> +>输出:`10` +> +>解释:如下图所示 +![矩阵 (2).gif](https://pic.leetcode-cn.com/1646288670-OTlvAl-%E7%9F%A9%E9%98%B5%20\(2\).gif) + +**示例 2:** +>输入:`matrix = ["abc","daf","geg"], mantra = "sad"` +> +>输出:`-1` +> +>解释:矩阵中不存在 `s` ,无法提取词语 + +**提示:** +- `0 < matrix.length, matrix[i].length <= 100` +- `0 < mantra.length <= 100` +- `matrix 和 mantra` 仅由小写字母组成 \ No newline at end of file diff --git a/leetcode-cn/problem (Chinese)/最大或值 [maximum-or].html b/leetcode-cn/problem (Chinese)/最大或值 [maximum-or].html new file mode 100644 index 00000000..47b47911 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/最大或值 [maximum-or].html @@ -0,0 +1,33 @@ +

给你一个下标从 0 开始长度为 n 的整数数组 nums 和一个整数 k 。每一次操作中,你可以选择一个数并将它乘 2 。

+ +

你最多可以进行 k 次操作,请你返回 nums[0] | nums[1] | ... | nums[n - 1] 的最大值。

+ +

a | b 表示两个整数 a 和 b 的 按位或 运算。

+ +

 

+ +

示例 1:

+ +
+输入:nums = [12,9], k = 1
+输出:30
+解释:如果我们对下标为 1 的元素进行操作,新的数组为 [12,18] 。此时得到最优答案为 12 和 18 的按位或运算的结果,也就是 30 。
+
+ +

示例 2:

+ +
+输入:nums = [8,1,2], k = 2
+输出:35
+解释:如果我们对下标 0 处的元素进行操作,得到新数组 [32,1,2] 。此时得到最优答案为 32|1|2 = 35 。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= nums.length <= 105
  • +
  • 1 <= nums[i] <= 109
  • +
  • 1 <= k <= 15
  • +
diff --git a/leetcode-cn/problem (Chinese)/有相同颜色的相邻元素数目 [number-of-adjacent-elements-with-the-same-color].html b/leetcode-cn/problem (Chinese)/有相同颜色的相邻元素数目 [number-of-adjacent-elements-with-the-same-color].html new file mode 100644 index 00000000..10e52001 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/有相同颜色的相邻元素数目 [number-of-adjacent-elements-with-the-same-color].html @@ -0,0 +1,45 @@ +

给你一个下标从 0 开始、长度为 n 的数组 nums 。一开始,所有元素都是 未染色 (值为 0 )的。

+ +

给你一个二维整数数组 queries ,其中 queries[i] = [indexi, colori] 。

+ +

对于每个操作,你需要将数组 nums 中下标为 indexi 的格子染色为 colori 。

+ +

请你返回一个长度与 queries 相等的数组 answer ,其中 answer[i]是前 i 个操作 之后 ,相邻元素颜色相同的数目。

+ +

更正式的,answer[i] 是执行完前 i 个操作后,0 <= j < n - 1 的下标 j 中,满足 nums[j] == nums[j + 1] 且 nums[j] != 0 的数目。

+ +

 

+ +

示例 1:

+ +
+输入:n = 4, queries = [[0,2],[1,2],[3,1],[1,1],[2,1]]
+输出:[0,1,1,0,2]
+解释:一开始数组 nums = [0,0,0,0] ,0 表示数组中还没染色的元素。
+- 第 1 个操作后,nums = [2,0,0,0] 。相邻元素颜色相同的数目为 0 。
+- 第 2 个操作后,nums = [2,2,0,0] 。相邻元素颜色相同的数目为 1 。
+- 第 3 个操作后,nums = [2,2,0,1] 。相邻元素颜色相同的数目为 1 。
+- 第 4 个操作后,nums = [2,1,0,1] 。相邻元素颜色相同的数目为 0 。
+- 第 5 个操作后,nums = [2,1,1,1] 。相邻元素颜色相同的数目为 2 。
+
+ +

示例 2:

+ +
+输入:n = 1, queries = [[0,100000]]
+输出:[0]
+解释:一开始数组 nums = [0] ,0 表示数组中还没染色的元素。
+- 第 1 个操作后,nums = [100000] 。相邻元素颜色相同的数目为 0 。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= n <= 105
  • +
  • 1 <= queries.length <= 105
  • +
  • queries[i].length == 2
  • +
  • 0 <= indexi <= n - 1
  • +
  • 1 <=  colori <= 105
  • +
diff --git a/leetcode-cn/problem (Chinese)/生物进化录 [qoQAMX].md b/leetcode-cn/problem (Chinese)/生物进化录 [qoQAMX].md new file mode 100644 index 00000000..bd9f4813 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/生物进化录 [qoQAMX].md @@ -0,0 +1,34 @@ +在永恒之森中,存在着一本生物进化录,以 **一个树形结构** 记载了所有生物的演化过程。经过观察并整理了各节点间的关系,`parents[i]` 表示编号 `i` 节点的父节点编号(根节点的父节点为 `-1`)。 + +为了探索和记录其中的演化规律,队伍中的炼金术师提出了一种方法,可以以字符串的形式将其复刻下来,规则如下: +- 初始只有一个根节点,表示演化的起点,依次记录 `01` 字符串中的字符, +- 如果记录 `0`,则在当前节点下添加一个子节点,并将指针指向新添加的子节点; +- 如果记录 `1`,则将指针回退到当前节点的父节点处。 + +现在需要应用上述的记录方法,复刻下它的演化过程。请返回能够复刻演化过程的字符串中, **字典序最小** 的 `01` 字符串。 + +**注意:** +- 节点指针最终可以停在任何节点上,不一定要回到根节点。 + +**示例 1:** +> 输入:`parents = [-1,0,0,2]` +> +> 输出:`"00110"` +> +>解释:树结构如下图所示,共存在 2 种记录方案: +>第 1 种方案为:0(记录编号 1 的节点) -> 1(回退至节点 0) -> 0(记录编号 2 的节点) -> 0((记录编号 3 的节点)) +>第 2 种方案为:0(记录编号 2 的节点) -> 0(记录编号 3 的节点) -> 1(回退至节点 2) -> 1(回退至节点 0) -> 0(记录编号 1 的节点) +>返回字典序更小的 `"00110"` +![image.png](https://pic.leetcode.cn/1682319485-cRVudI-image.png){:width=120px}![进化 (3).gif](https://pic.leetcode.cn/1682412701-waHdnm-%E8%BF%9B%E5%8C%96%20\(3\).gif){:width=320px} + + + +**示例 2:** +> 输入:`parents = [-1,0,0,1,2,2]` +> +> 输出:`"00101100"` + +**提示:** + +- `1 <= parents.length <= 10^4` +- `-1 <= parents[i] < i` (即父节点编号小于子节点) \ No newline at end of file diff --git a/leetcode-cn/problem (Chinese)/相邻值的按位异或 [neighboring-bitwise-xor].html b/leetcode-cn/problem (Chinese)/相邻值的按位异或 [neighboring-bitwise-xor].html new file mode 100644 index 00000000..a67f3738 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/相邻值的按位异或 [neighboring-bitwise-xor].html @@ -0,0 +1,54 @@ +

下标从 0 开始、长度为 n 的数组 derived 是由同样长度为 n 的原始 二进制数组 original 通过计算相邻值的 按位异或(⊕)派生而来。

+ +

特别地,对于范围 [0, n - 1] 内的每个下标 i

+ +
    +
  • 如果 i = n - 1 ,那么 derived[i] = original[i] ⊕ original[0]
  • +
  • 否则 derived[i] = original[i] ⊕ original[i + 1]
  • +
+ +

给你一个数组 derived ,请判断是否存在一个能够派生得到 derived有效原始二进制数组 original

+ +

如果存在满足要求的原始二进制数组,返回 true ;否则,返回 false

+ +
    +
  • 二进制数组是仅由 01 组成的数组。
  • +
+ +

 

+ +

示例 1:

+ +
输入:derived = [1,1,0]
+输出:true
+解释:能够派生得到 [1,1,0] 的有效原始二进制数组是 [0,1,0] :
+derived[0] = original[0] ⊕ original[1] = 0 ⊕ 1 = 1 
+derived[1] = original[1] ⊕ original[2] = 1 ⊕ 0 = 1
+derived[2] = original[2] ⊕ original[0] = 0 ⊕ 0 = 0
+
+ +

示例 2:

+ +
输入:derived = [1,1]
+输出:true
+解释:能够派生得到 [1,1] 的有效原始二进制数组是 [0,1] :
+derived[0] = original[0] ⊕ original[1] = 1
+derived[1] = original[1] ⊕ original[0] = 1
+
+ +

示例 3:

+ +
输入:derived = [1,0]
+输出:false
+解释:不存在能够派生得到 [1,0] 的有效原始二进制数组。
+
+ +

 

+ +

提示:

+ +
    +
  • n == derived.length
  • +
  • 1 <= n <= 105
  • +
  • derived 中的值不是 0 就是 1
  • +
diff --git a/leetcode-cn/problem (Chinese)/矩阵中的和 [sum-in-a-matrix].html b/leetcode-cn/problem (Chinese)/矩阵中的和 [sum-in-a-matrix].html new file mode 100644 index 00000000..d8c22a30 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/矩阵中的和 [sum-in-a-matrix].html @@ -0,0 +1,35 @@ +

给你一个下标从 0 开始的二维整数数组 nums 。一开始你的分数为 0 。你需要执行以下操作直到矩阵变为空:

+ +
    +
  1. 矩阵中每一行选取最大的一个数,并删除它。如果一行中有多个最大的数,选择任意一个并删除。
  2. +
  3. 在步骤 1 删除的所有数字中找到最大的一个数字,将它添加到你的 分数 中。
  4. +
+ +

请你返回最后的 分数 。

+ +

 

+ +

示例 1:

+ +
+输入:nums = [[7,2,1],[6,4,2],[6,5,3],[3,2,1]]
+输出:15
+解释:第一步操作中,我们删除 7 ,6 ,6 和 3 ,将分数增加 7 。下一步操作中,删除 2 ,4 ,5 和 2 ,将分数增加 5 。最后删除 1 ,2 ,3 和 1 ,将分数增加 3 。所以总得分为 7 + 5 + 3 = 15 。
+
+ +

示例 2:

+ +
+输入:nums = [[1]]
+输出:1
+解释:我们删除 1 并将分数增加 1 ,所以返回 1 。
+ +

 

+ +

提示:

+ +
    +
  • 1 <= nums.length <= 300
  • +
  • 1 <= nums[i].length <= 500
  • +
  • 0 <= nums[i][j] <= 103
  • +
diff --git a/leetcode-cn/problem (Chinese)/矩阵中移动的最大次数 [maximum-number-of-moves-in-a-grid].html b/leetcode-cn/problem (Chinese)/矩阵中移动的最大次数 [maximum-number-of-moves-in-a-grid].html new file mode 100644 index 00000000..9c1fa8ce --- /dev/null +++ b/leetcode-cn/problem (Chinese)/矩阵中移动的最大次数 [maximum-number-of-moves-in-a-grid].html @@ -0,0 +1,41 @@ +

给你一个下标从 0 开始、大小为 m x n 的矩阵 grid ,矩阵由若干 整数组成。

+ +

你可以从矩阵第一列中的 任一 单元格出发,按以下方式遍历 grid

+ +
    +
  • 从单元格 (row, col) 可以移动到 (row - 1, col + 1)(row, col + 1)(row + 1, col + 1) 三个单元格中任一满足值 严格 大于当前单元格的单元格。
  • +
+ +

返回你在矩阵中能够 移动最大 次数。

+ +

 

+ +

示例 1:

+ +
输入:grid = [[2,4,3,5],[5,4,9,3],[3,4,2,11],[10,9,13,15]]
+输出:3
+解释:可以从单元格 (0, 0) 开始并且按下面的路径移动:
+- (0, 0) -> (0, 1).
+- (0, 1) -> (1, 2).
+- (1, 2) -> (2, 3).
+可以证明这是能够移动的最大次数。
+ +

示例 2:

+ +

+输入:grid = [[3,2,4],[2,1,9],[1,1,7]]
+输出:0
+解释:从第一列的任一单元格开始都无法移动。
+
+ +

 

+ +

提示:

+ +
    +
  • m == grid.length
  • +
  • n == grid[i].length
  • +
  • 2 <= m, n <= 1000
  • +
  • 4 <= m * n <= 105
  • +
  • 1 <= grid[i][j] <= 106
  • +
diff --git a/leetcode-cn/problem (Chinese)/符文储备 [W2ZX4X].md b/leetcode-cn/problem (Chinese)/符文储备 [W2ZX4X].md new file mode 100644 index 00000000..bcc8c65b --- /dev/null +++ b/leetcode-cn/problem (Chinese)/符文储备 [W2ZX4X].md @@ -0,0 +1,26 @@ +远征队在出发前需要携带一些「符文」,作为后续的冒险储备。`runes[i]` 表示第 `i` 枚符文的魔力值。 + +他们将从中选取若干符文进行携带,并对这些符文进行重新排列,以确保任意相邻的两块符文之间的魔力值相差不超过 `1`。 + +请返回他们能够携带的符文 **最大数量**。 + +**示例 1:** +>输入:`runes = [1,3,5,4,1,7]` +> +>输出:`3` +> +>解释:最佳的选择方案为[3,5,4] +>将其排列为 [3,4,5] 后,任意相邻的两块符文魔力值均不超过 `1`,携带数量为 `3` +>其他满足条件的方案为 [1,1] 和 [7],数量均小于 3。 +>因此返回可携带的最大数量 `3`。 + +**示例 2:** +>输入:`runes = [1,1,3,3,2,4]` +> +>输出:`6` +> +>解释:排列为 [1,1,2,3,3,4],可携带所有的符文 + +**提示:** +- `1 <= runes.length <= 10^4` +- `0 <= runes[i] <= 10^4` diff --git a/leetcode-cn/problem (Chinese)/统计完全连通分量的数量 [count-the-number-of-complete-components].html b/leetcode-cn/problem (Chinese)/统计完全连通分量的数量 [count-the-number-of-complete-components].html new file mode 100644 index 00000000..e750955f --- /dev/null +++ b/leetcode-cn/problem (Chinese)/统计完全连通分量的数量 [count-the-number-of-complete-components].html @@ -0,0 +1,44 @@ +

给你一个整数 n 。现有一个包含 n 个顶点的 无向 图,顶点按从 0n - 1 编号。给你一个二维整数数组 edges 其中 edges[i] = [ai, bi] 表示顶点 aibi 之间存在一条 无向 边。

+ +

返回图中 完全连通分量 的数量。

+ +

如果在子图中任意两个顶点之间都存在路径,并且子图中没有任何一个顶点与子图外部的顶点共享边,则称其为 连通分量

+ +

如果连通分量中每对节点之间都存在一条边,则称其为 完全连通分量

+ +

 

+ +

示例 1:

+ +

+ +
+输入:n = 6, edges = [[0,1],[0,2],[1,2],[3,4]]
+输出:3
+解释:如上图所示,可以看到此图所有分量都是完全连通分量。
+
+ +

示例 2:

+ +

+ +
+输入:n = 6, edges = [[0,1],[0,2],[1,2],[3,4],[3,5]]
+输出:1
+解释:包含节点 0、1 和 2 的分量是完全连通分量,因为每对节点之间都存在一条边。
+包含节点 3 、4 和 5 的分量不是完全连通分量,因为节点 4 和 5 之间不存在边。
+因此,在图中完全连接分量的数量是 1 。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= n <= 50
  • +
  • 0 <= edges.length <= n * (n - 1) / 2
  • +
  • edges[i].length == 2
  • +
  • 0 <= ai, bi <= n - 1
  • +
  • ai != bi
  • +
  • 不存在重复的边
  • +
diff --git a/leetcode-cn/problem (Chinese)/老人的数目 [number-of-senior-citizens].html b/leetcode-cn/problem (Chinese)/老人的数目 [number-of-senior-citizens].html new file mode 100644 index 00000000..fd0d966a --- /dev/null +++ b/leetcode-cn/problem (Chinese)/老人的数目 [number-of-senior-citizens].html @@ -0,0 +1,40 @@ +

给你一个下标从 0 开始的字符串 details 。details 中每个元素都是一位乘客的信息,信息用长度为 15 的字符串表示,表示方式如下:

+ +
    +
  • 前十个字符是乘客的手机号码。
  • +
  • 接下来的一个字符是乘客的性别。
  • +
  • 接下来两个字符是乘客的年龄。
  • +
  • 最后两个字符是乘客的座位号。
  • +
+ +

请你返回乘客中年龄 严格大于 60 岁 的人数。

+ +

 

+ +

示例 1:

+ +
+输入:details = ["7868190130M7522","5303914400F9211","9273338290F4010"]
+输出:2
+解释:下标为 0 ,1 和 2 的乘客年龄分别为 75 ,92 和 40 。所以有 2 人年龄大于 60 岁。
+
+ +

示例 2:

+ +
+输入:details = ["1313579440F2036","2921522980M5644"]
+输出:0
+解释:没有乘客的年龄大于 60 岁。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= details.length <= 100
  • +
  • details[i].length == 15
  • +
  • details[i] 中的数字只包含 '0' 到 '9' 。
  • +
  • details[i][10] 是 'M' ,'F' 或者 'O' 之一。
  • +
  • 所有乘客的手机号码和座位号互不相同。
  • +
diff --git a/leetcode-cn/problem (Chinese)/节流 [throttle].html b/leetcode-cn/problem (Chinese)/节流 [throttle].html new file mode 100644 index 00000000..be151bfb --- /dev/null +++ b/leetcode-cn/problem (Chinese)/节流 [throttle].html @@ -0,0 +1,50 @@ +

现给定一个函数 fn 和一个以毫秒为单位的时间 t ,请你返回该函数的 节流 版本。

+ +

节流 函数首先立即被调用,然后在 t 毫秒的时间间隔内不能再次执行,但应该存储最新的函数参数,以便在延迟结束后使用这些参数调用 fn

+ +

例如,t = 50ms ,并且函数在 30ms40ms60ms 时被调用。第一次函数调用会在接下来的 t 毫秒内阻止调用函数。第二次函数调用会保存参数,而第三次调用的参数应该覆盖当前保存的第二次调用的参数,因为第二次和第三次调用发生在 80ms 之前。一旦延迟时间过去,节流函数应该使用延迟期间提供的最新参数进行调用,并且还应创建另一个延迟期间,时长为 80ms + t

+ +

Throttle Diagram上面的图示展示了节流如何转换事件。每个矩形代表100毫秒,节流时间为400毫秒。每种颜色代表不同的输入集合。

+ +

 

+ +

示例 1:

+ +
+输入:t = 100, calls = [{"t":20,"inputs":[1]}]
+输出:[{"t":20,"inputs":[1]}]
+解释:第一次调用总是立即执行,没有延迟。
+
+ +

示例 2:

+ +
+输入:t = 50, calls = [{"t":50,"inputs":[1]},{"t":75,"inputs":[2]}]
+输出:[{"t":50,"inputs":[1]},{"t":100,"inputs":[2]}]
+解释:
+第一次调用立即执行带有参数 (1) 的函数。 
+第二次调用发生在 75毫秒 时,在延迟期间内,因为 50毫秒 + 50毫秒 = 100毫秒,所以下一次调用可以在 100毫秒 时执行。因此,我们保存第二次调用的参数,以便在第一次调用的回调函数中使用。
+
+ +

示例 3:

+ +
+输入:t = 70, calls = [{"t":50,"inputs":[1]},{"t":75,"inputs":[2]},{"t":90,"inputs":[8]},{"t": 140, "inputs":[5,7]},{"t": 300, "inputs": [9,4]}]
+输出:[{"t":50,"inputs":[1]},{"t":120,"inputs":[8]},{"t":190,"inputs":[5,7]},{"t":300,"inputs":[9,4]}]
+解释:
+第一次调用立即执行带有参数 (1) 的函数。 
+第二次调用发生在 75毫秒 时,在延迟期间内,因为 50毫秒 + 70毫秒 = 120毫秒,所以它只应保存参数。 
+第三次调用也在延迟期间内,因为我们只需要最新的函数参数,所以覆盖之前的参数。延迟期过后,在 120毫秒时进行回调,并使用保存的参数进行调用。该回调会创建另一个延迟期间,时长为 120毫秒 + 70毫秒 = 190毫秒,以便下一个函数可以在 190毫秒时调用。 
+第四次调用发生在 140毫秒,在延迟期间内,因此应在190毫秒时作为回调进行调用。这将创建另一个延迟期间,时长为 190毫秒 + 70毫秒 = 260毫秒。 
+第五次调用发生在 300毫秒,但它是在 260毫秒 之后,所以应立即调用,并创建另一个延迟期间,时长为 300毫秒 + 70毫秒 = 370毫秒。
+ +

 

+ +

提示:

+ +
    +
  • 0 <= t <= 1000
  • +
  • 1 <= calls.length <= 10
  • +
  • 0 <= calls[i].t <= 1000
  • +
  • 0 <= calls[i].inputs[i], calls[i].inputs.length <= 10
  • +
diff --git a/leetcode-cn/problem (Chinese)/英雄的力量 [power-of-heroes].html b/leetcode-cn/problem (Chinese)/英雄的力量 [power-of-heroes].html new file mode 100644 index 00000000..16a634a8 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/英雄的力量 [power-of-heroes].html @@ -0,0 +1,42 @@ +

给你一个下标从 0 开始的整数数组 nums ,它表示英雄的能力值。如果我们选出一部分英雄,这组英雄的 力量 定义为:

+ +
    +
  • i0 ,i1 ,... ik 表示这组英雄在数组中的下标。那么这组英雄的力量为 max(nums[i0],nums[i1] ... nums[ik])2 * min(nums[i0],nums[i1] ... nums[ik])
  • +
+ +

请你返回所有可能的 非空 英雄组的 力量 之和。由于答案可能非常大,请你将结果对 109 + 7 取余。

+ +

 

+ +

示例 1:

+ +
+输入:nums = [2,1,4]
+输出:141
+解释:
+第 1 组:[2] 的力量为 22 * 2 = 8 。
+第 2 组:[1] 的力量为 12 * 1 = 1 。
+第 3 组:[4] 的力量为 42 * 4 = 64 。
+第 4 组:[2,1] 的力量为 22 * 1 = 4 。
+第 5 组:[2,4] 的力量为 42 * 2 = 32 。
+第 6 组:[1,4] 的力量为 42 * 1 = 16 。
+第​ ​​​​​​7 组:[2,1,4] 的力量为 42​​​​​​​ * 1 = 16 。
+所有英雄组的力量之和为 8 + 1 + 64 + 4 + 32 + 16 + 16 = 141 。
+
+ +

示例 2:

+ +
+输入:nums = [1,1,1]
+输出:7
+解释:总共有 7 个英雄组,每一组的力量都是 1 。所以所有英雄组的力量之和为 7 。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= nums.length <= 105
  • +
  • 1 <= nums[i] <= 109
  • +
diff --git a/leetcode-cn/problem (Chinese)/计数器 II [counter-ii].html b/leetcode-cn/problem (Chinese)/计数器 II [counter-ii].html new file mode 100644 index 00000000..5fa7d76a --- /dev/null +++ b/leetcode-cn/problem (Chinese)/计数器 II [counter-ii].html @@ -0,0 +1,46 @@ +

请你写一个函数 createCounter. 这个函数接收一个初始的整数值 init  并返回一个包含三个函数的对象。

+ +

这三个函数是:

+ +
    +
  • increment() 将当前值加 1 并返回。
  • +
  • decrement() 将当前值减 1 并返回。
  • +
  • reset() 将当前值设置为 init 并返回。
  • +
+ +

 

+ +

示例 1:

+ +
+输入:init = 5, calls = ["increment","reset","decrement"]
+输出:[6,5,4]
+解释:
+const counter = createCounter(5);
+counter.increment(); // 6
+counter.reset(); // 5
+counter.decrement(); // 4
+
+ +

示例 2:

+ +
+输入:init = 0, calls = ["increment","increment","decrement","reset","reset"]
+输出:[1,2,1,0,0]
+解释:
+const counter = createCounter(0);
+counter.increment(); // 1
+counter.increment(); // 2
+counter.decrement(); // 1
+counter.reset(); // 0
+counter.reset(); // 0
+
+ +

 

+ +

提示:

+ +
    +
  • -1000 <= init <= 1000
  • +
  • 总调用次数不会超过 1000
  • +
diff --git a/leetcode-cn/problem (Chinese)/频率跟踪器 [frequency-tracker].html b/leetcode-cn/problem (Chinese)/频率跟踪器 [frequency-tracker].html new file mode 100644 index 00000000..f49b3344 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/频率跟踪器 [frequency-tracker].html @@ -0,0 +1,70 @@ +

请你设计并实现一个能够对其中的值进行跟踪的数据结构,并支持对频率相关查询进行应答。

+ +

实现 FrequencyTracker 类:

+ +
    +
  • FrequencyTracker():使用一个空数组初始化 FrequencyTracker 对象。
  • +
  • void add(int number):添加一个 number 到数据结构中。
  • +
  • void deleteOne(int number):从数据结构中删除一个 number 。数据结构 可能不包含 number ,在这种情况下不删除任何内容。
  • +
  • bool hasFrequency(int frequency): 如果数据结构中存在出现 frequency 次的数字,则返回 true,否则返回 false
  • +
+ +

 

+ +

示例 1:

+ +
+输入
+["FrequencyTracker", "add", "add", "hasFrequency"]
+[[], [3], [3], [2]]
+输出
+[null, null, null, true]
+
+解释
+FrequencyTracker frequencyTracker = new FrequencyTracker();
+frequencyTracker.add(3); // 数据结构现在包含 [3]
+frequencyTracker.add(3); // 数据结构现在包含 [3, 3]
+frequencyTracker.hasFrequency(2); // 返回 true ,因为 3 出现 2 次
+
+ +

示例 2:

+ +
+输入
+["FrequencyTracker", "add", "deleteOne", "hasFrequency"]
+[[], [1], [1], [1]]
+输出
+[null, null, null, false]
+
+解释
+FrequencyTracker frequencyTracker = new FrequencyTracker();
+frequencyTracker.add(1); // 数据结构现在包含 [1]
+frequencyTracker.deleteOne(1); // 数据结构现在为空 []
+frequencyTracker.hasFrequency(1); // 返回 false ,因为数据结构为空
+
+ +

示例 3:

+ +
+输入
+["FrequencyTracker", "hasFrequency", "add", "hasFrequency"]
+[[], [2], [3], [1]]
+输出
+[null, false, null, true]
+
+解释
+FrequencyTracker frequencyTracker = new FrequencyTracker();
+frequencyTracker.hasFrequency(2); // 返回 false ,因为数据结构为空
+frequencyTracker.add(3); // 数据结构现在包含 [3]
+frequencyTracker.hasFrequency(1); // 返回 true ,因为 3 出现 1 次
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= number <= 105
  • +
  • 1 <= frequency <= 105
  • +
  • 最多调用 adddeleteOnehasFrequency 共计 2 * 105
  • +
diff --git a/leetcode-cn/problem (English)/二进制数转字符串(English) [binary-number-to-string-lcci].html b/leetcode-cn/problem (English)/二进制数转字符串(English) [binary-number-to-string-lcci].html new file mode 100644 index 00000000..975363d4 --- /dev/null +++ b/leetcode-cn/problem (English)/二进制数转字符串(English) [binary-number-to-string-lcci].html @@ -0,0 +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:

+ +
    +
  • This two charaters "0." should be counted into 32 characters.
  • +
  • The number of decimal places for num is at most 6 digits
  • +
diff --git a/leetcode-cn/problem (English)/使二叉树所有路径值相等的最小代价(English) [make-costs-of-paths-equal-in-a-binary-tree].html b/leetcode-cn/problem (English)/使二叉树所有路径值相等的最小代价(English) [make-costs-of-paths-equal-in-a-binary-tree].html new file mode 100644 index 00000000..91fec0eb --- /dev/null +++ b/leetcode-cn/problem (English)/使二叉树所有路径值相等的最小代价(English) [make-costs-of-paths-equal-in-a-binary-tree].html @@ -0,0 +1,45 @@ +

You are given an integer n representing the number of nodes in a perfect binary tree consisting of nodes numbered from 1 to n. The root of the tree is node 1 and each node i in the tree has two children where the left child is the node 2 * i and the right child is 2 * i + 1.

+ +

Each node in the tree also has a cost represented by a given 0-indexed integer array cost of size n where cost[i] is the cost of node i + 1. You are allowed to increment the cost of any node by 1 any number of times.

+ +

Return the minimum number of increments you need to make the cost of paths from the root to each leaf node equal.

+ +

Note:

+ +
    +
  • A perfect binary tree is a tree where each node, except the leaf nodes, has exactly 2 children.
  • +
  • The cost of a path is the sum of costs of nodes in the path.
  • +
+ +

 

+

Example 1:

+ +
+Input: n = 7, cost = [1,5,2,2,3,3,1]
+Output: 6
+Explanation: We can do the following increments:
+- Increase the cost of node 4 one time.
+- Increase the cost of node 3 three times.
+- Increase the cost of node 7 two times.
+Each path from the root to a leaf will have a total cost of 9.
+The total increments we did is 1 + 3 + 2 = 6.
+It can be shown that this is the minimum answer we can achieve.
+
+ +

Example 2:

+ +
+Input: n = 3, cost = [5,3,3]
+Output: 0
+Explanation: The two paths already have equal total costs, so no increments are needed.
+
+ +

 

+

Constraints:

+ +
    +
  • 3 <= n <= 105
  • +
  • n + 1 is a power of 2
  • +
  • cost.length == n
  • +
  • 1 <= cost[i] <= 104
  • +
diff --git a/leetcode-cn/problem (English)/分块数组(English) [chunk-array].html b/leetcode-cn/problem (English)/分块数组(English) [chunk-array].html new file mode 100644 index 00000000..799bc437 --- /dev/null +++ b/leetcode-cn/problem (English)/分块数组(English) [chunk-array].html @@ -0,0 +1,46 @@ +

Given an array arr and a chunk size size, return a chunked array. A chunked array contains the original elements in arr, but consists of subarrays each of length size. The length of the last subarray may be less than size if arr.length is not evenly divisible by size.

+ +

You may assume the array is the output of JSON.parse. In other words, it is valid JSON.

+ +

Please solve it without using lodash's _.chunk function.

+ +

 

+

Example 1:

+ +
+Input: arr = [1,2,3,4,5], size = 1
+Output: [[1],[2],[3],[4],[5]]
+Explanation: The arr has been split into subarrays each with 1 element.
+
+ +

Example 2:

+ +
+Input: arr = [1,9,6,3,2], size = 3
+Output: [[1,9,6],[3,2]]
+Explanation: The arr has been split into subarrays with 3 elements. However, only two elements are left for the 2nd subarray.
+
+ +

Example 3:

+ +
+Input: arr = [8,5,3,2,6], size = 6
+Output: [[8,5,3,2,6]]
+Explanation: Size is greater than arr.length thus all elements are in the first subarray.
+
+ +

Example 4:

+ +
+Input: arr = [], size = 1
+Output: []
+Explanation: There are no elements to be chunked so an empty array is returned.
+ +

 

+

Constraints:

+ +
    +
  • arr is a valid JSON array
  • +
  • 2 <= JSON.stringify(arr).length <= 105
  • +
  • 1 <= size <= arr.length + 1
  • +
diff --git a/leetcode-cn/problem (English)/创建 Hello World 函数(English) [create-hello-world-function].html b/leetcode-cn/problem (English)/创建 Hello World 函数(English) [create-hello-world-function].html new file mode 100644 index 00000000..e0b31568 --- /dev/null +++ b/leetcode-cn/problem (English)/创建 Hello World 函数(English) [create-hello-world-function].html @@ -0,0 +1,32 @@ +Write a function createHelloWorld. It should return a new function that always returns "Hello World". +

 

+

Example 1:

+ +
+Input: args = []
+Output: "Hello World"
+Explanation:
+const f = createHelloWorld();
+f(); // "Hello World"
+
+The function returned by createHelloWorld should always return "Hello World".
+
+ +

Example 2:

+ +
+Input: args = [{},null,42]
+Output: "Hello World"
+Explanation:
+const f = createHelloWorld();
+f({}, null, 42); // "Hello World"
+
+Any arguments could be passed to the function but it should still always return "Hello World".
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= args.length <= 10
  • +
diff --git a/leetcode-cn/problem (English)/只允许一次函数调用(English) [allow-one-function-call].html b/leetcode-cn/problem (English)/只允许一次函数调用(English) [allow-one-function-call].html new file mode 100644 index 00000000..3381571a --- /dev/null +++ b/leetcode-cn/problem (English)/只允许一次函数调用(English) [allow-one-function-call].html @@ -0,0 +1,39 @@ +

Given a function fn, return a new function that is identical to the original function except that it ensures fn is called at most once.

+ +
    +
  • The first time the returned function is called, it should return the same result as fn.
  • +
  • Every subsequent time it is called, it should return undefined.
  • +
+ +

 

+

Example 1:

+ +
+Input: fn = (a,b,c) => (a + b + c), calls = [[1,2,3],[2,3,6]]
+Output: [{"calls":1,"value":6}]
+Explanation:
+const onceFn = once(fn);
+onceFn(1, 2, 3); // 6
+onceFn(2, 3, 6); // undefined, fn was not called
+
+ +

Example 2:

+ +
+Input: fn = (a,b,c) => (a * b * c), calls = [[5,7,4],[2,3,6],[4,6,8]]
+Output: [{"calls":1,"value":140}]
+Explanation:
+const onceFn = once(fn);
+onceFn(5, 7, 4); // 140
+onceFn(2, 3, 6); // undefined, fn was not called
+onceFn(4, 6, 8); // undefined, fn was not called
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= calls.length <= 10
  • +
  • 1 <= calls[i].length <= 100
  • +
  • 2 <= JSON.stringify(calls).length <= 1000
  • +
diff --git a/leetcode-cn/problem (English)/将对象数组转换为矩阵(English) [array-of-objects-to-matrix].html b/leetcode-cn/problem (English)/将对象数组转换为矩阵(English) [array-of-objects-to-matrix].html new file mode 100644 index 00000000..6aae27b9 --- /dev/null +++ b/leetcode-cn/problem (English)/将对象数组转换为矩阵(English) [array-of-objects-to-matrix].html @@ -0,0 +1,125 @@ +

Write a function that converts an array of objects arr into a matrix m.

+ +

arr is an array of objects or arrays. Each item in the array can be deeply nested with child arrays and child objects. It can also contain numbers, strings, booleans, and null values.

+ +

The first row m should be the column names. If there is no nesting, the column names are the unique keys within the objects. If there is nesting, the column names are the respective paths in the object separated by ".".

+ +

Each of the remaining rows corresponds to an object in arr. Each value in the matrix corresponds to a value in an object. If a given object doesn't contain a value for a given column, the cell should contain an empty string "".

+ +

The colums in the matrix should be in lexographically ascending order.

+ +

 

+

Example 1:

+ +
+Input: 
+arr = [
+  {"b": 1, "a": 2},
+  {"b": 3, "a": 4}
+]
+Output: 
+[
+  ["a", "b"],
+  [2, 1],
+  [4, 3]
+]
+
+Explanation:
+There are two unique column names in the two objects: "a" and "b".
+"a" corresponds with [2, 4].
+"b" coresponds with [1, 3].
+
+ +

Example 2:

+ +
+Input: 
+arr = [
+  {"a": 1, "b": 2},
+  {"c": 3, "d": 4},
+  {}
+]
+Output: 
+[
+  ["a", "b", "c", "d"],
+  [1, 2, "", ""],
+  ["", "", 3, 4],
+  ["", "", "", ""]
+]
+
+Explanation:
+There are 4 unique column names: "a", "b", "c", "d".
+The first object has values associated with "a" and "b".
+The second object has values associated with "c" and "d".
+The third object has no keys, so it is just a row of empty strings.
+
+ +

Example 3:

+ +
+Input: 
+arr = [
+  {"a": {"b": 1, "c": 2}},
+  {"a": {"b": 3, "d": 4}}
+]
+Output: 
+[
+  ["a.b", "a.c", "a.d"],
+  [1, 2, ""],
+  [3, "", 4]
+]
+
+Explanation:
+In this example, the objects are nested. The keys represent the full path to each value separated by periods.
+There are three paths: "a.b", "a.c", "a.d".
+
+ +

Example 4:

+ +
+Input: 
+arr = [
+  [{"a": null}],
+  [{"b": true}],
+  [{"c": "x"}]
+]
+Output: 
+[
+  ["0.a", "0.b", "0.c"],
+  [null, "", ""],
+  ["", true, ""],
+  ["", "", "x"]
+]
+
+Explanation:
+Arrays are also considered objects with their keys being their indices.
+Each array has one element so the keys are "0.a", "0.b", and "0.c".
+
+ +

Example 5:

+ +
+Input: 
+arr = [
+  {},
+  {},
+  {},
+]
+Output: 
+[
+  [],
+  [],
+  [],
+  []
+]
+
+Explanation:
+There are no keys so every row is an empty array.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= arr.length <= 1000
  • +
  • unique keys <= 1000
  • +
diff --git a/leetcode-cn/problem (English)/找出不同元素数目差数组(English) [find-the-distinct-difference-array].html b/leetcode-cn/problem (English)/找出不同元素数目差数组(English) [find-the-distinct-difference-array].html new file mode 100644 index 00000000..ce81c325 --- /dev/null +++ b/leetcode-cn/problem (English)/找出不同元素数目差数组(English) [find-the-distinct-difference-array].html @@ -0,0 +1,40 @@ +

You are given a 0-indexed array nums of length n.

+ +

The distinct difference array of nums is an array diff of length n such that diff[i] is equal to the number of distinct elements in the suffix nums[i + 1, ..., n - 1] subtracted from the number of distinct elements in the prefix nums[0, ..., i].

+ +

Return the distinct difference array of nums.

+ +

Note that nums[i, ..., j] denotes the subarray of nums starting at index i and ending at index j inclusive. Particularly, if i > j then nums[i, ..., j] denotes an empty subarray.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3,4,5]
+Output: [-3,-1,1,3,5]
+Explanation: For index i = 0, there is 1 element in the prefix and 4 distinct elements in the suffix. Thus, diff[0] = 1 - 4 = -3.
+For index i = 1, there are 2 distinct elements in the prefix and 3 distinct elements in the suffix. Thus, diff[1] = 2 - 3 = -1.
+For index i = 2, there are 3 distinct elements in the prefix and 2 distinct elements in the suffix. Thus, diff[2] = 3 - 2 = 1.
+For index i = 3, there are 4 distinct elements in the prefix and 1 distinct element in the suffix. Thus, diff[3] = 4 - 1 = 3.
+For index i = 4, there are 5 distinct elements in the prefix and no elements in the suffix. Thus, diff[4] = 5 - 0 = 5.
+
+ +

Example 2:

+ +
+Input: nums = [3,2,3,4,2]
+Output: [-2,-1,0,2,3]
+Explanation: For index i = 0, there is 1 element in the prefix and 3 distinct elements in the suffix. Thus, diff[0] = 1 - 3 = -2.
+For index i = 1, there are 2 distinct elements in the prefix and 3 distinct elements in the suffix. Thus, diff[1] = 2 - 3 = -1.
+For index i = 2, there are 2 distinct elements in the prefix and 2 distinct elements in the suffix. Thus, diff[2] = 2 - 2 = 0.
+For index i = 3, there are 3 distinct elements in the prefix and 1 distinct element in the suffix. Thus, diff[3] = 3 - 1 = 2.
+For index i = 4, there are 3 distinct elements in the prefix and no elements in the suffix. Thus, diff[4] = 3 - 0 = 3.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n == nums.length <= 50
  • +
  • 1 <= nums[i] <= 50
  • +
diff --git a/leetcode-cn/problem (English)/找出转圈游戏输家(English) [find-the-losers-of-the-circular-game].html b/leetcode-cn/problem (English)/找出转圈游戏输家(English) [find-the-losers-of-the-circular-game].html new file mode 100644 index 00000000..86f6d28e --- /dev/null +++ b/leetcode-cn/problem (English)/找出转圈游戏输家(English) [find-the-losers-of-the-circular-game].html @@ -0,0 +1,49 @@ +

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 receives the ball.

+ +
    +
  • After that, 1st friend passes it to the friend who is k steps away from them in the clockwise direction.
  • +
  • After that, the friend who receives the ball should pass it to the friend who is 2 * k steps away from them in the clockwise direction.
  • +
  • After that, the friend who receives the ball should pass it to the friend who is 3 * k steps away from them in the clockwise direction, and so on and so forth.
  • +
+ +

In other words, on the ith turn, the friend holding the ball should pass it to the friend who is i * k steps away from them in the clockwise direction.

+ +

The game is finished when some friend receives the ball for the second time.

+ +

The losers of the game are friends who did not receive the ball in the entire game.

+ +

Given the number of friends, n, and an integer k, return the array answer, which contains the losers of the game in the ascending order.

+ +

 

+

Example 1:

+ +
+Input: n = 5, k = 2
+Output: [4,5]
+Explanation: The game goes as follows:
+1) Start at 1st friend and pass the ball to the friend who is 2 steps away from them - 3rd friend.
+2) 3rd friend passes the ball to the friend who is 4 steps away from them - 2nd friend.
+3) 2nd friend passes the ball to the friend who is 6 steps away from them  - 3rd friend.
+4) The game ends as 3rd friend receives the ball for the second time.
+
+ +

Example 2:

+ +
+Input: n = 4, k = 4
+Output: [2,3,4]
+Explanation: The game goes as follows:
+1) Start at the 1st friend and pass the ball to the friend who is 4 steps away from them - 1st friend.
+2) The game ends as 1st friend receives the ball for the second time.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= n <= 50
  • +
diff --git a/leetcode-cn/problem (English)/最大或值(English) [maximum-or].html b/leetcode-cn/problem (English)/最大或值(English) [maximum-or].html new file mode 100644 index 00000000..0dc99823 --- /dev/null +++ b/leetcode-cn/problem (English)/最大或值(English) [maximum-or].html @@ -0,0 +1,31 @@ +

You are given a 0-indexed integer array nums of length n and an integer k. In an operation, you can choose an element and multiply it by 2.

+ +

Return the maximum possible value of nums[0] | nums[1] | ... | nums[n - 1] that can be obtained after applying the operation on nums at most k times.

+ +

Note that a | b denotes the bitwise or between two integers a and b.

+ +

 

+

Example 1:

+ +
+Input: nums = [12,9], k = 1
+Output: 30
+Explanation: If we apply the operation to index 1, our new array nums will be equal to [12,18]. Thus, we return the bitwise or of 12 and 18, which is 30.
+
+ +

Example 2:

+ +
+Input: nums = [8,1,2], k = 2
+Output: 35
+Explanation: If we apply the operation twice on index 0, we yield a new array of [32,1,2]. Thus, we return 32|1|2 = 35.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
  • +
  • 1 <= nums[i] <= 109
  • +
  • 1 <= k <= 15
  • +
diff --git a/leetcode-cn/problem (English)/有相同颜色的相邻元素数目(English) [number-of-adjacent-elements-with-the-same-color].html b/leetcode-cn/problem (English)/有相同颜色的相邻元素数目(English) [number-of-adjacent-elements-with-the-same-color].html new file mode 100644 index 00000000..d038d0dc --- /dev/null +++ b/leetcode-cn/problem (English)/有相同颜色的相邻元素数目(English) [number-of-adjacent-elements-with-the-same-color].html @@ -0,0 +1,43 @@ +

There is a 0-indexed array nums of length n. Initially, all elements are uncolored (has a value of 0).

+ +

You are given a 2D integer array queries where queries[i] = [indexi, colori].

+ +

For each query, you color the index indexi with the color colori in the array nums.

+ +

Return an array answer of the same length as queries where answer[i] is the number of adjacent elements with the same color after the ith query.

+ +

More formally, answer[i] is the number of indices j, such that 0 <= j < n - 1 and nums[j] == nums[j + 1] and nums[j] != 0 after the ith query.

+ +

 

+

Example 1:

+ +
+Input: n = 4, queries = [[0,2],[1,2],[3,1],[1,1],[2,1]]
+Output: [0,1,1,0,2]
+Explanation: Initially array nums = [0,0,0,0], where 0 denotes uncolored elements of the array.
+- After the 1st query nums = [2,0,0,0]. The count of adjacent elements with the same color is 0.
+- After the 2nd query nums = [2,2,0,0]. The count of adjacent elements with the same color is 1.
+- After the 3rd query nums = [2,2,0,1]. The count of adjacent elements with the same color is 1.
+- After the 4th query nums = [2,1,0,1]. The count of adjacent elements with the same color is 0.
+- After the 5th query nums = [2,1,1,1]. The count of adjacent elements with the same color is 2.
+
+ +

Example 2:

+ +
+Input: n = 1, queries = [[0,100000]]
+Output: [0]
+Explanation: Initially array nums = [0], where 0 denotes uncolored elements of the array.
+- After the 1st query nums = [100000]. The count of adjacent elements with the same color is 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 105
  • +
  • 1 <= queries.length <= 105
  • +
  • queries[i].length == 2
  • +
  • 0 <= indexi <= n - 1
  • +
  • 1 <=  colori <= 105
  • +
diff --git a/leetcode-cn/problem (English)/相邻值的按位异或(English) [neighboring-bitwise-xor].html b/leetcode-cn/problem (English)/相邻值的按位异或(English) [neighboring-bitwise-xor].html new file mode 100644 index 00000000..9bbece66 --- /dev/null +++ b/leetcode-cn/problem (English)/相邻值的按位异或(English) [neighboring-bitwise-xor].html @@ -0,0 +1,55 @@ +

A 0-indexed array derived with length n is derived by computing the bitwise XOR (⊕) of adjacent values in a binary array original of length n.

+ +

Specifically, for each index i in the range [0, n - 1]:

+ +
    +
  • If i = n - 1, then derived[i] = original[i] ⊕ original[0].
  • +
  • Otherwise, derived[i] = original[i] ⊕ original[i + 1].
  • +
+ +

Given an array derived, your task is to determine whether there exists a valid binary array original that could have formed derived.

+ +

Return true if such an array exists or false otherwise.

+ +
    +
  • A binary array is an array containing only 0's and 1's
  • +
+ +

 

+

Example 1:

+ +
+Input: derived = [1,1,0]
+Output: true
+Explanation: A valid original array that gives derived is [0,1,0].
+derived[0] = original[0] ⊕ original[1] = 0 ⊕ 1 = 1 
+derived[1] = original[1] ⊕ original[2] = 1 ⊕ 0 = 1
+derived[2] = original[2] ⊕ original[0] = 0 ⊕ 0 = 0
+
+ +

Example 2:

+ +
+Input: derived = [1,1]
+Output: true
+Explanation: A valid original array that gives derived is [0,1].
+derived[0] = original[0] ⊕ original[1] = 1
+derived[1] = original[1] ⊕ original[0] = 1
+
+ +

Example 3:

+ +
+Input: derived = [1,0]
+Output: false
+Explanation: There is no valid original array that gives derived.
+
+ +

 

+

Constraints:

+ +
    +
  • n == derived.length
  • +
  • 1 <= n <= 105
  • +
  • The values in derived are either 0's or 1's
  • +
diff --git a/leetcode-cn/problem (English)/矩阵中的和(English) [sum-in-a-matrix].html b/leetcode-cn/problem (English)/矩阵中的和(English) [sum-in-a-matrix].html new file mode 100644 index 00000000..d5b08397 --- /dev/null +++ b/leetcode-cn/problem (English)/矩阵中的和(English) [sum-in-a-matrix].html @@ -0,0 +1,32 @@ +

You are given a 0-indexed 2D integer array nums. Initially, your score is 0. Perform the following operations until the matrix becomes empty:

+ +
    +
  1. From each row in the matrix, select the largest number and remove it. In the case of a tie, it does not matter which number is chosen.
  2. +
  3. Identify the highest number amongst all those removed in step 1. Add that number to your score.
  4. +
+ +

Return the final score.

+

 

+

Example 1:

+ +
+Input: nums = [[7,2,1],[6,4,2],[6,5,3],[3,2,1]]
+Output: 15
+Explanation: In the first operation, we remove 7, 6, 6, and 3. We then add 7 to our score. Next, we remove 2, 4, 5, and 2. We add 5 to our score. Lastly, we remove 1, 2, 3, and 1. We add 3 to our score. Thus, our final score is 7 + 5 + 3 = 15.
+
+ +

Example 2:

+ +
+Input: nums = [[1]]
+Output: 1
+Explanation: We remove 1 and add it to the answer. We return 1.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 300
  • +
  • 1 <= nums[i].length <= 500
  • +
  • 0 <= nums[i][j] <= 103
  • +
diff --git a/leetcode-cn/problem (English)/矩阵中移动的最大次数(English) [maximum-number-of-moves-in-a-grid].html b/leetcode-cn/problem (English)/矩阵中移动的最大次数(English) [maximum-number-of-moves-in-a-grid].html new file mode 100644 index 00000000..ebc65fee --- /dev/null +++ b/leetcode-cn/problem (English)/矩阵中移动的最大次数(English) [maximum-number-of-moves-in-a-grid].html @@ -0,0 +1,41 @@ +

You are given a 0-indexed m x n matrix grid consisting of positive integers.

+ +

You can start at any cell in the first column of the matrix, and traverse the grid in the following way:

+ +
    +
  • From a cell (row, col), you can move to any of the cells: (row - 1, col + 1), (row, col + 1) and (row + 1, col + 1) such that the value of the cell you move to, should be strictly bigger than the value of the current cell.
  • +
+ +

Return the maximum number of moves that you can perform.

+ +

 

+

Example 1:

+ +
+Input: grid = [[2,4,3,5],[5,4,9,3],[3,4,2,11],[10,9,13,15]]
+Output: 3
+Explanation: We can start at the cell (0, 0) and make the following moves:
+- (0, 0) -> (0, 1).
+- (0, 1) -> (1, 2).
+- (1, 2) -> (2, 3).
+It can be shown that it is the maximum number of moves that can be made.
+ +

Example 2:

+ +
+
+Input: grid = [[3,2,4],[2,1,9],[1,1,7]]
+Output: 0
+Explanation: Starting from any cell in the first column we cannot perform any moves.
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
  • +
  • n == grid[i].length
  • +
  • 2 <= m, n <= 1000
  • +
  • 4 <= m * n <= 105
  • +
  • 1 <= grid[i][j] <= 106
  • +
diff --git a/leetcode-cn/problem (English)/统计完全连通分量的数量(English) [count-the-number-of-complete-components].html b/leetcode-cn/problem (English)/统计完全连通分量的数量(English) [count-the-number-of-complete-components].html new file mode 100644 index 00000000..8a79984b --- /dev/null +++ b/leetcode-cn/problem (English)/统计完全连通分量的数量(English) [count-the-number-of-complete-components].html @@ -0,0 +1,40 @@ +

You are given an integer n. There is an undirected graph with n vertices, numbered from 0 to n - 1. You are given a 2D integer array edges where edges[i] = [ai, bi] denotes that there exists an undirected edge connecting vertices ai and bi.

+ +

Return the number of complete connected components of the graph.

+ +

A connected component is a subgraph of a graph in which there exists a path between any two vertices, and no vertex of the subgraph shares an edge with a vertex outside of the subgraph.

+ +

A connected component is said to be complete if there exists an edge between every pair of its vertices.

+ +

 

+

Example 1:

+ +

+ +
+Input: n = 6, edges = [[0,1],[0,2],[1,2],[3,4]]
+Output: 3
+Explanation: From the picture above, one can see that all of the components of this graph are complete.
+
+ +

Example 2:

+ +

+ +
+Input: n = 6, edges = [[0,1],[0,2],[1,2],[3,4],[3,5]]
+Output: 1
+Explanation: The component containing vertices 0, 1, and 2 is complete since there is an edge between every pair of two vertices. On the other hand, the component containing vertices 3, 4, and 5 is not complete since there is no edge between vertices 4 and 5. Thus, the number of complete components in this graph is 1.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 50
  • +
  • 0 <= edges.length <= n * (n - 1) / 2
  • +
  • edges[i].length == 2
  • +
  • 0 <= ai, bi <= n - 1
  • +
  • ai != bi
  • +
  • There are no repeated edges.
  • +
diff --git a/leetcode-cn/problem (English)/老人的数目(English) [number-of-senior-citizens].html b/leetcode-cn/problem (English)/老人的数目(English) [number-of-senior-citizens].html new file mode 100644 index 00000000..3a229307 --- /dev/null +++ b/leetcode-cn/problem (English)/老人的数目(English) [number-of-senior-citizens].html @@ -0,0 +1,38 @@ +

You are given a 0-indexed array of strings details. Each element of details provides information about a given passenger compressed into a string of length 15. The system is such that:

+ +
    +
  • The first ten characters consist of the phone number of passengers.
  • +
  • The next character denotes the gender of the person.
  • +
  • The following two characters are used to indicate the age of the person.
  • +
  • The last two characters determine the seat allotted to that person.
  • +
+ +

Return the number of passengers who are strictly more than 60 years old.

+ +

 

+

Example 1:

+ +
+Input: details = ["7868190130M7522","5303914400F9211","9273338290F4010"]
+Output: 2
+Explanation: The passengers at indices 0, 1, and 2 have ages 75, 92, and 40. Thus, there are 2 people who are over 60 years old.
+
+ +

Example 2:

+ +
+Input: details = ["1313579440F2036","2921522980M5644"]
+Output: 0
+Explanation: None of the passengers are older than 60.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= details.length <= 100
  • +
  • details[i].length == 15
  • +
  • details[i] consists of digits from '0' to '9'.
  • +
  • details[i][10] is either 'M' or 'F' or 'O'.
  • +
  • The phone numbers and seat numbers of the passengers are distinct.
  • +
diff --git a/leetcode-cn/problem (English)/节流(English) [throttle].html b/leetcode-cn/problem (English)/节流(English) [throttle].html new file mode 100644 index 00000000..11d47426 --- /dev/null +++ b/leetcode-cn/problem (English)/节流(English) [throttle].html @@ -0,0 +1,48 @@ +

Given a function fn and a time in milliseconds t, return a throttled version of that function.

+ +

A throttled function is first called without delay and then, for a time interval of t milliseconds, can't be executed but should store the latest function arguments provided to call fn with them after the end of the delay.

+ +

For instance, t = 50ms, and the function was called at 30ms, 40ms, and 60ms. The first function call would block calling functions for the following t milliseconds. The second function call would save arguments, and the third call arguments should overwrite currently stored arguments from the second call because the second and third calls are called before 80ms. Once the delay has passed, the throttled function should be called with the latest arguments provided during the delay period, and it should also create another delay period of 80ms + t.

+ +

Throttle DiagramThe above diagram shows how throttle will transform events. Each rectangle represents 100ms and the throttle time is 400ms. Each color represents a different set of inputs.

+ +

 

+

Example 1:

+ +
+Input: t = 100, calls = [{"t":20,"inputs":[1]}]
+Output: [{"t":20,"inputs":[1]}]
+Explanation: The 1st call is always called without delay
+
+ +

Example 2:

+ +
+Input: t = 50, calls = [{"t":50,"inputs":[1]},{"t":75,"inputs":[2]}]
+Output: [{"t":50,"inputs":[1]},{"t":100,"inputs":[2]}]
+Explanation: 
+The 1st is called a function with arguments (1) without delay.
+The 2nd is called at 75ms, within the delay period because 50ms + 50ms = 100ms, so the next call can be reached at 100ms. Therefore, we save arguments from the 2nd call to use them at the callback of the 1st call.
+
+ +

Example 3:

+ +
+Input: t = 70, calls = [{"t":50,"inputs":[1]},{"t":75,"inputs":[2]},{"t":90,"inputs":[8]},{"t": 140, "inputs":[5,7]},{"t": 300, "inputs": [9,4]}]
+Output: [{"t":50,"inputs":[1]},{"t":120,"inputs":[8]},{"t":190,"inputs":[5,7]},{"t":300,"inputs":[9,4]}]
+Explanation: 
+The 1st is called a function with arguments (1) without delay.
+The 2nd is called at 75ms within the delay period because 50ms + 70ms = 120ms, so it should only save arguments. 
+The 3rd is also called within the delay period, and because we need just the latest function arguments, we overwrite previous ones. After the delay period, we do a callback at 120ms with saved arguments. That callback makes another delay period of 120ms + 70ms = 190ms so that the next function can be called at 190ms.
+The 4th is called at 140ms in the delay period, so it should be called as a callback at 190ms. That will create another delay period of 190ms + 70ms = 260ms.
+The 5th is called at 300ms, but it is after 260ms, so it should be called immediately and should create another delay period of 300ms + 70ms = 370ms.
+ +

 

+

Constraints:

+ +
    +
  • 0 <= t <= 1000
  • +
  • 1 <= calls.length <= 10
  • +
  • 0 <= calls[i].t <= 1000
  • +
  • 0 <= calls[i].inputs[i], calls[i].inputs.length <= 10
  • +
diff --git a/leetcode-cn/problem (English)/英雄的力量(English) [power-of-heroes].html b/leetcode-cn/problem (English)/英雄的力量(English) [power-of-heroes].html new file mode 100644 index 00000000..2f7449e5 --- /dev/null +++ b/leetcode-cn/problem (English)/英雄的力量(English) [power-of-heroes].html @@ -0,0 +1,41 @@ +

You are given a 0-indexed integer array nums representing the strength of some heroes. The power of a group of heroes is defined as follows:

+ +
    +
  • Let i0, i1, ... ,ik be the indices of the heroes in a group. Then, the power of this group is max(nums[i0], nums[i1], ... ,nums[ik])2 * min(nums[i0], nums[i1], ... ,nums[ik]).
  • +
+ +

Return the sum of the power of all non-empty groups of heroes possible. Since the sum could be very large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: nums = [2,1,4]
+Output: 141
+Explanation: 
+1st group: [2] has power = 22 * 2 = 8.
+2nd group: [1] has power = 12 * 1 = 1. 
+3rd group: [4] has power = 42 * 4 = 64. 
+4th group: [2,1] has power = 22 * 1 = 4. 
+5th group: [2,4] has power = 42 * 2 = 32. 
+6th group: [1,4] has power = 42 * 1 = 16. 
+​​​​​​​7th group: [2,1,4] has power = 42​​​​​​​ * 1 = 16. 
+The sum of powers of all groups is 8 + 1 + 64 + 4 + 32 + 16 + 16 = 141.
+
+
+ +

Example 2:

+ +
+Input: nums = [1,1,1]
+Output: 7
+Explanation: A total of 7 groups are possible, and the power of each group will be 1. Therefore, the sum of the powers of all groups is 7.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
  • +
  • 1 <= nums[i] <= 109
  • +
diff --git a/leetcode-cn/problem (English)/计数器 II(English) [counter-ii].html b/leetcode-cn/problem (English)/计数器 II(English) [counter-ii].html new file mode 100644 index 00000000..28454266 --- /dev/null +++ b/leetcode-cn/problem (English)/计数器 II(English) [counter-ii].html @@ -0,0 +1,44 @@ +

Write a function createCounter. It should accept an initial integer init. It should return an object with three functions.

+ +

The three functions are:

+ +
    +
  • increment() increases the current value by 1 and then returns it.
  • +
  • decrement() reduces the current value by 1 and then returns it.
  • +
  • reset() sets the current value to init and then returns it.
  • +
+ +

 

+

Example 1:

+ +
+Input: init = 5, calls = ["increment","reset","decrement"]
+Output: [6,5,4]
+Explanation:
+const counter = createCounter(5);
+counter.increment(); // 6
+counter.reset(); // 5
+counter.decrement(); // 4
+
+ +

Example 2:

+ +
+Input: init = 0, calls = ["increment","increment","decrement","reset","reset"]
+Output: [1,2,1,0,0]
+Explanation:
+const counter = createCounter(0);
+counter.increment(); // 1
+counter.increment(); // 2
+counter.decrement(); // 1
+counter.reset(); // 0
+counter.reset(); // 0
+
+ +

 

+

Constraints:

+ +
    +
  • -1000 <= init <= 1000
  • +
  • total calls not to exceed 1000
  • +
diff --git a/leetcode-cn/problem (English)/频率跟踪器(English) [frequency-tracker].html b/leetcode-cn/problem (English)/频率跟踪器(English) [frequency-tracker].html new file mode 100644 index 00000000..8fd2bb62 --- /dev/null +++ b/leetcode-cn/problem (English)/频率跟踪器(English) [frequency-tracker].html @@ -0,0 +1,71 @@ +

Design a data structure that keeps track of the values in it and answers some queries regarding their frequencies.

+ +

Implement the FrequencyTracker class.

+ +
    +
  • FrequencyTracker(): Initializes the FrequencyTracker object with an empty array initially.
  • +
  • void add(int number): Adds number to the data structure.
  • +
  • void deleteOne(int number): Deletes one occurence of number from the data structure. The data structure may not contain number, and in this case nothing is deleted.
  • +
  • bool hasFrequency(int frequency): Returns true if there is a number in the data structure that occurs frequency number of times, otherwise, it returns false.
  • +
+ +

 

+

Example 1:

+ +
+Input
+["FrequencyTracker", "add", "add", "hasFrequency"]
+[[], [3], [3], [2]]
+Output
+[null, null, null, true]
+
+Explanation
+FrequencyTracker frequencyTracker = new FrequencyTracker();
+frequencyTracker.add(3); // The data structure now contains [3]
+frequencyTracker.add(3); // The data structure now contains [3, 3]
+frequencyTracker.hasFrequency(2); // Returns true, because 3 occurs twice
+
+
+ +

Example 2:

+ +
+Input
+["FrequencyTracker", "add", "deleteOne", "hasFrequency"]
+[[], [1], [1], [1]]
+Output
+[null, null, null, false]
+
+Explanation
+FrequencyTracker frequencyTracker = new FrequencyTracker();
+frequencyTracker.add(1); // The data structure now contains [1]
+frequencyTracker.deleteOne(1); // The data structure becomes empty []
+frequencyTracker.hasFrequency(1); // Returns false, because the data structure is empty
+
+
+ +

Example 3:

+ +
+Input
+["FrequencyTracker", "hasFrequency", "add", "hasFrequency"]
+[[], [2], [3], [1]]
+Output
+[null, false, null, true]
+
+Explanation
+FrequencyTracker frequencyTracker = new FrequencyTracker();
+frequencyTracker.hasFrequency(2); // Returns false, because the data structure is empty
+frequencyTracker.add(3); // The data structure now contains [3]
+frequencyTracker.hasFrequency(1); // Returns true, because 3 occurs once
+
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= number <= 105
  • +
  • 1 <= frequency <= 105
  • +
  • At most, 2 * 105 calls will be made to add, deleteOne, and hasFrequency in total.
  • +
diff --git a/leetcode/origin-data.json b/leetcode/origin-data.json index 94cf8bdb..536e766e 100644 --- a/leetcode/origin-data.json +++ b/leetcode/origin-data.json @@ -1,23 +1,23 @@ { "user_name": "", "num_solved": 0, - "num_total": 2663, + "num_total": 2688, "ac_easy": 0, "ac_medium": 0, "ac_hard": 0, "stat_status_pairs": [ { "stat": { - "question_id": 2815, + "question_id": 2842, "question__article__live": null, "question__article__slug": null, "question__article__has_video_solution": null, - "question__title": "Find Maximal Uncovered Ranges", - "question__title_slug": "find-maximal-uncovered-ranges", + "question__title": "Find Active Users", + "question__title_slug": "find-active-users", "question__hide": false, - "total_acs": 309, - "total_submitted": 480, - "frontend_question_id": 2655, + "total_acs": 57, + "total_submitted": 187, + "frontend_question_id": 2688, "is_new_question": true }, "status": null, @@ -29,6 +29,351 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2841, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Bikes Last Time Used ", + "question__title_slug": "bikes-last-time-used", + "question__hide": false, + "total_acs": 73, + "total_submitted": 96, + "frontend_question_id": 2687, + "is_new_question": true + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2840, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Immediate Food Delivery III", + "question__title_slug": "immediate-food-delivery-iii", + "question__hide": false, + "total_acs": 40, + "total_submitted": 104, + "frontend_question_id": 2686, + "is_new_question": true + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2835, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Split a Circular Linked List", + "question__title_slug": "split-a-circular-linked-list", + "question__hide": false, + "total_acs": 275, + "total_submitted": 352, + "frontend_question_id": 2674, + "is_new_question": true + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2830, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Count Artist Occurrences On Spotify Ranking List", + "question__title_slug": "count-artist-occurrences-on-spotify-ranking-list", + "question__hide": false, + "total_acs": 183, + "total_submitted": 333, + "frontend_question_id": 2669, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2829, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Find Latest Salaries", + "question__title_slug": "find-latest-salaries", + "question__hide": false, + "total_acs": 202, + "total_submitted": 416, + "frontend_question_id": 2668, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2823, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "The Knight’s Tour", + "question__title_slug": "the-knights-tour", + "question__hide": false, + "total_acs": 428, + "total_submitted": 564, + "frontend_question_id": 2664, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2815, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Find Maximal Uncovered Ranges", + "question__title_slug": "find-maximal-uncovered-ranges", + "question__hide": false, + "total_acs": 377, + "total_submitted": 611, + "frontend_question_id": 2655, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2809, + "question__article__live": true, + "question__article__slug": "create-hello-world-function", + "question__article__has_video_solution": false, + "question__title": "Create Hello World Function", + "question__title_slug": "create-hello-world-function", + "question__hide": false, + "total_acs": 26003, + "total_submitted": 28022, + "frontend_question_id": 2667, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2798, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Chunk Array", + "question__title_slug": "chunk-array", + "question__hide": false, + "total_acs": 1097, + "total_submitted": 1331, + "frontend_question_id": 2677, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2796, + "question__article__live": true, + "question__article__slug": "allow-one-function-call", + "question__article__has_video_solution": false, + "question__title": "Allow One Function Call", + "question__title_slug": "allow-one-function-call", + "question__hide": false, + "total_acs": 11792, + "total_submitted": 12852, + "frontend_question_id": 2666, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2794, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Maximum Number of Moves in a Grid", + "question__title_slug": "maximum-number-of-moves-in-a-grid", + "question__hide": false, + "total_acs": 9802, + "total_submitted": 22556, + "frontend_question_id": 2684, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2793, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Count the Number of Complete Components", + "question__title_slug": "count-the-number-of-complete-components", + "question__hide": false, + "total_acs": 7290, + "total_submitted": 10971, + "frontend_question_id": 2685, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2792, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Neighboring Bitwise XOR", + "question__title_slug": "neighboring-bitwise-xor", + "question__hide": false, + "total_acs": 11278, + "total_submitted": 19178, + "frontend_question_id": 2683, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2791, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Find the Losers of the Circular Game", + "question__title_slug": "find-the-losers-of-the-circular-game", + "question__hide": false, + "total_acs": 13256, + "total_submitted": 28824, + "frontend_question_id": 2682, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2789, + "question__article__live": true, + "question__article__slug": "counter-ii", + "question__article__has_video_solution": false, + "question__title": "Counter II", + "question__title_slug": "counter-ii", + "question__hide": false, + "total_acs": 17967, + "total_submitted": 20024, + "frontend_question_id": 2665, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2788, @@ -38,8 +383,8 @@ "question__title": "Design Cancellable Function", "question__title_slug": "design-cancellable-function", "question__hide": false, - "total_acs": 260, - "total_submitted": 494, + "total_acs": 426, + "total_submitted": 801, "frontend_question_id": 2650, "is_new_question": false }, @@ -52,6 +397,29 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2784, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Power of Heroes", + "question__title_slug": "power-of-heroes", + "question__hide": false, + "total_acs": 3903, + "total_submitted": 14693, + "frontend_question_id": 2681, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2783, @@ -61,8 +429,8 @@ "question__title": "Nested Array Generator", "question__title_slug": "nested-array-generator", "question__hide": false, - "total_acs": 931, - "total_submitted": 1173, + "total_acs": 1398, + "total_submitted": 1894, "frontend_question_id": 2649, "is_new_question": false }, @@ -75,6 +443,98 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2780, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Make Costs of Paths Equal in a Binary Tree", + "question__title_slug": "make-costs-of-paths-equal-in-a-binary-tree", + "question__hide": false, + "total_acs": 8082, + "total_submitted": 13810, + "frontend_question_id": 2673, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2779, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Number of Adjacent Elements With the Same Color", + "question__title_slug": "number-of-adjacent-elements-with-the-same-color", + "question__hide": false, + "total_acs": 10236, + "total_submitted": 18742, + "frontend_question_id": 2672, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2778, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Frequency Tracker", + "question__title_slug": "frequency-tracker", + "question__hide": false, + "total_acs": 13807, + "total_submitted": 50337, + "frontend_question_id": 2671, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2777, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Find the Distinct Difference Array", + "question__title_slug": "find-the-distinct-difference-array", + "question__hide": false, + "total_acs": 18655, + "total_submitted": 24391, + "frontend_question_id": 2670, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2775, @@ -84,8 +544,8 @@ "question__title": "Generate Fibonacci Sequence", "question__title_slug": "generate-fibonacci-sequence", "question__hide": false, - "total_acs": 2184, - "total_submitted": 2583, + "total_acs": 3388, + "total_submitted": 4022, "frontend_question_id": 2648, "is_new_question": false }, @@ -98,6 +558,52 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2771, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Throttle", + "question__title_slug": "throttle", + "question__hide": false, + "total_acs": 252, + "total_submitted": 322, + "frontend_question_id": 2676, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2769, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Array of Objects to Matrix", + "question__title_slug": "array-of-objects-to-matrix", + "question__hide": false, + "total_acs": 207, + "total_submitted": 321, + "frontend_question_id": 2675, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2767, @@ -107,8 +613,8 @@ "question__title": "Maximum Sum With Exactly K Elements ", "question__title_slug": "maximum-sum-with-exactly-k-elements", "question__hide": false, - "total_acs": 17387, - "total_submitted": 20975, + "total_acs": 21556, + "total_submitted": 25930, "frontend_question_id": 2656, "is_new_question": false }, @@ -130,8 +636,8 @@ "question__title": "Find the Prefix Common Array of Two Arrays", "question__title_slug": "find-the-prefix-common-array-of-two-arrays", "question__hide": false, - "total_acs": 14822, - "total_submitted": 18701, + "total_acs": 16941, + "total_submitted": 21197, "frontend_question_id": 2657, "is_new_question": false }, @@ -153,8 +659,8 @@ "question__title": "Make Array Empty", "question__title_slug": "make-array-empty", "question__hide": false, - "total_acs": 3625, - "total_submitted": 18872, + "total_acs": 4523, + "total_submitted": 21680, "frontend_question_id": 2659, "is_new_question": false }, @@ -176,8 +682,8 @@ "question__title": "Maximum Number of Fish in a Grid", "question__title_slug": "maximum-number-of-fish-in-a-grid", "question__hide": false, - "total_acs": 11115, - "total_submitted": 19224, + "total_acs": 12820, + "total_submitted": 21854, "frontend_question_id": 2658, "is_new_question": false }, @@ -199,8 +705,8 @@ "question__title": "Cache With Time Limit", "question__title_slug": "cache-with-time-limit", "question__hide": false, - "total_acs": 1953, - "total_submitted": 2777, + "total_acs": 2683, + "total_submitted": 3862, "frontend_question_id": 2622, "is_new_question": false }, @@ -216,14 +722,14 @@ { "stat": { "question_id": 2761, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "array-reduce-transformation", + "question__article__has_video_solution": false, "question__title": "Array Reduce Transformation", "question__title_slug": "array-reduce-transformation", "question__hide": false, - "total_acs": 5493, - "total_submitted": 6388, + "total_acs": 18979, + "total_submitted": 21218, "frontend_question_id": 2626, "is_new_question": false }, @@ -245,8 +751,8 @@ "question__title": "Snail Traversal", "question__title_slug": "snail-traversal", "question__hide": false, - "total_acs": 1597, - "total_submitted": 2346, + "total_acs": 2141, + "total_submitted": 3167, "frontend_question_id": 2624, "is_new_question": false }, @@ -268,8 +774,8 @@ "question__title": "Flatten Deeply Nested Array", "question__title_slug": "flatten-deeply-nested-array", "question__hide": false, - "total_acs": 2014, - "total_submitted": 3188, + "total_acs": 2742, + "total_submitted": 4469, "frontend_question_id": 2625, "is_new_question": false }, @@ -285,14 +791,14 @@ { "stat": { "question_id": 2758, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "check-if-object-instance-of-class", + "question__article__has_video_solution": false, "question__title": "Check if Object Instance of Class", "question__title_slug": "check-if-object-instance-of-class", "question__hide": false, - "total_acs": 3251, - "total_submitted": 13279, + "total_acs": 4198, + "total_submitted": 17577, "frontend_question_id": 2618, "is_new_question": false }, @@ -314,8 +820,8 @@ "question__title": "Minimum Number of Operations to Make All Array Elements Equal to 1", "question__title_slug": "minimum-number-of-operations-to-make-all-array-elements-equal-to-1", "question__hide": false, - "total_acs": 8679, - "total_submitted": 24838, + "total_acs": 9110, + "total_submitted": 25872, "frontend_question_id": 2654, "is_new_question": false }, @@ -337,8 +843,8 @@ "question__title": "Sum Multiples", "question__title_slug": "sum-multiples", "question__hide": false, - "total_acs": 27663, - "total_submitted": 32480, + "total_acs": 32662, + "total_submitted": 38440, "frontend_question_id": 2652, "is_new_question": false }, @@ -360,8 +866,8 @@ "question__title": "Sliding Subarray Beauty", "question__title_slug": "sliding-subarray-beauty", "question__hide": false, - "total_acs": 12443, - "total_submitted": 40968, + "total_acs": 13190, + "total_submitted": 42765, "frontend_question_id": 2653, "is_new_question": false }, @@ -383,8 +889,8 @@ "question__title": "Promise Pool", "question__title_slug": "promise-pool", "question__hide": false, - "total_acs": 941, - "total_submitted": 1261, + "total_acs": 1301, + "total_submitted": 1779, "frontend_question_id": 2636, "is_new_question": false }, @@ -400,14 +906,14 @@ { "stat": { "question_id": 2749, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "promise-time-limit", + "question__article__has_video_solution": false, "question__title": "Promise Time Limit", "question__title_slug": "promise-time-limit", "question__hide": false, - "total_acs": 2445, - "total_submitted": 3009, + "total_acs": 3399, + "total_submitted": 4221, "frontend_question_id": 2637, "is_new_question": false }, @@ -429,8 +935,8 @@ "question__title": "Calculate Delayed Arrival Time", "question__title_slug": "calculate-delayed-arrival-time", "question__hide": false, - "total_acs": 24447, - "total_submitted": 29534, + "total_acs": 26601, + "total_submitted": 32303, "frontend_question_id": 2651, "is_new_question": false }, @@ -446,14 +952,14 @@ { "stat": { "question_id": 2747, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "apply-transform-over-each-element-in-array", + "question__article__has_video_solution": false, "question__title": "Apply Transform Over Each Element in Array", "question__title_slug": "apply-transform-over-each-element-in-array", "question__hide": false, - "total_acs": 5316, - "total_submitted": 5982, + "total_acs": 21922, + "total_submitted": 24322, "frontend_question_id": 2635, "is_new_question": false }, @@ -469,14 +975,14 @@ { "stat": { "question_id": 2746, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "filter-elements-from-array", + "question__article__has_video_solution": false, "question__title": "Filter Elements from Array", "question__title_slug": "filter-elements-from-array", "question__hide": false, - "total_acs": 5654, - "total_submitted": 6780, + "total_acs": 20047, + "total_submitted": 22710, "frontend_question_id": 2634, "is_new_question": false }, @@ -498,8 +1004,8 @@ "question__title": "Convert Object to JSON String", "question__title_slug": "convert-object-to-json-string", "question__hide": false, - "total_acs": 1526, - "total_submitted": 2157, + "total_acs": 2024, + "total_submitted": 2927, "frontend_question_id": 2633, "is_new_question": false }, @@ -521,8 +1027,8 @@ "question__title": "Memoize II", "question__title_slug": "memoize-ii", "question__hide": false, - "total_acs": 842, - "total_submitted": 2184, + "total_acs": 1109, + "total_submitted": 3027, "frontend_question_id": 2630, "is_new_question": false }, @@ -544,8 +1050,8 @@ "question__title": "Debounce", "question__title_slug": "debounce", "question__hide": false, - "total_acs": 2144, - "total_submitted": 2353, + "total_acs": 3001, + "total_submitted": 3329, "frontend_question_id": 2627, "is_new_question": false }, @@ -567,8 +1073,8 @@ "question__title": "Group By", "question__title_slug": "group-by", "question__hide": false, - "total_acs": 1760, - "total_submitted": 2106, + "total_acs": 2464, + "total_submitted": 3026, "frontend_question_id": 2631, "is_new_question": false }, @@ -584,14 +1090,14 @@ { "stat": { "question_id": 2741, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "function-composition", + "question__article__has_video_solution": false, "question__title": "Function Composition", "question__title_slug": "function-composition", "question__hide": false, - "total_acs": 5069, - "total_submitted": 5788, + "total_acs": 17654, + "total_submitted": 19291, "frontend_question_id": 2629, "is_new_question": false }, @@ -607,14 +1113,14 @@ { "stat": { "question_id": 2740, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "curry-editorials", + "question__article__has_video_solution": false, "question__title": "Curry", "question__title_slug": "curry", "question__hide": false, - "total_acs": 1795, - "total_submitted": 2061, + "total_acs": 8935, + "total_submitted": 9826, "frontend_question_id": 2632, "is_new_question": false }, @@ -636,8 +1142,8 @@ "question__title": "Minimize the Total Price of the Trips", "question__title_slug": "minimize-the-total-price-of-the-trips", "question__hide": false, - "total_acs": 4823, - "total_submitted": 12025, + "total_acs": 5009, + "total_submitted": 12397, "frontend_question_id": 2646, "is_new_question": false }, @@ -659,8 +1165,8 @@ "question__title": "Count the Number of K-Free Subsets", "question__title_slug": "count-the-number-of-k-free-subsets", "question__hide": false, - "total_acs": 322, - "total_submitted": 561, + "total_acs": 363, + "total_submitted": 627, "frontend_question_id": 2638, "is_new_question": false }, @@ -682,8 +1188,8 @@ "question__title": "Row With Maximum Ones", "question__title_slug": "row-with-maximum-ones", "question__hide": false, - "total_acs": 23235, - "total_submitted": 30528, + "total_acs": 24567, + "total_submitted": 32258, "frontend_question_id": 2643, "is_new_question": false }, @@ -705,8 +1211,8 @@ "question__title": "Minimum Additions to Make Valid String", "question__title_slug": "minimum-additions-to-make-valid-string", "question__hide": false, - "total_acs": 17813, - "total_submitted": 36199, + "total_acs": 18362, + "total_submitted": 37182, "frontend_question_id": 2645, "is_new_question": false }, @@ -728,8 +1234,8 @@ "question__title": "JSON Deep Equal", "question__title_slug": "json-deep-equal", "question__hide": false, - "total_acs": 1606, - "total_submitted": 5506, + "total_acs": 2205, + "total_submitted": 8333, "frontend_question_id": 2628, "is_new_question": false }, @@ -751,8 +1257,8 @@ "question__title": "Array Prototype Last", "question__title_slug": "array-prototype-last", "question__hide": false, - "total_acs": 14314, - "total_submitted": 18700, + "total_acs": 19922, + "total_submitted": 26588, "frontend_question_id": 2619, "is_new_question": false }, @@ -768,14 +1274,14 @@ { "stat": { "question_id": 2733, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "sleep", + "question__article__has_video_solution": false, "question__title": "Sleep", "question__title_slug": "sleep", "question__hide": false, - "total_acs": 9666, - "total_submitted": 11237, + "total_acs": 16924, + "total_submitted": 19419, "frontend_question_id": 2621, "is_new_question": false }, @@ -791,14 +1297,14 @@ { "stat": { "question_id": 2732, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "counter", + "question__article__has_video_solution": false, "question__title": "Counter", "question__title_slug": "counter", "question__hide": false, - "total_acs": 17227, - "total_submitted": 20329, + "total_acs": 40969, + "total_submitted": 46814, "frontend_question_id": 2620, "is_new_question": false }, @@ -814,14 +1320,14 @@ { "stat": { "question_id": 2731, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "memoize", + "question__article__has_video_solution": false, "question__title": "Memoize", "question__title_slug": "memoize", "question__hide": false, - "total_acs": 2830, - "total_submitted": 4910, + "total_acs": 12297, + "total_submitted": 18107, "frontend_question_id": 2623, "is_new_question": false }, @@ -834,6 +1340,75 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2730, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Maximum OR", + "question__title_slug": "maximum-or", + "question__hide": false, + "total_acs": 6455, + "total_submitted": 17425, + "frontend_question_id": 2680, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2728, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Sum in a Matrix", + "question__title_slug": "sum-in-a-matrix", + "question__hide": false, + "total_acs": 14257, + "total_submitted": 24568, + "frontend_question_id": 2679, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2727, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Number of Senior Citizens", + "question__title_slug": "number-of-senior-citizens", + "question__hide": false, + "total_acs": 16615, + "total_submitted": 21128, + "frontend_question_id": 2678, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2726, @@ -843,8 +1418,8 @@ "question__title": "Minimum Reverse Operations", "question__title_slug": "minimum-reverse-operations", "question__hide": false, - "total_acs": 2391, - "total_submitted": 16400, + "total_acs": 2460, + "total_submitted": 16793, "frontend_question_id": 2612, "is_new_question": false }, @@ -866,8 +1441,8 @@ "question__title": "Mice and Cheese", "question__title_slug": "mice-and-cheese", "question__hide": false, - "total_acs": 15183, - "total_submitted": 35437, + "total_acs": 15446, + "total_submitted": 35935, "frontend_question_id": 2611, "is_new_question": false }, @@ -889,8 +1464,8 @@ "question__title": "Convert an Array Into a 2D Array With Conditions", "question__title_slug": "convert-an-array-into-a-2d-array-with-conditions", "question__hide": false, - "total_acs": 22814, - "total_submitted": 26604, + "total_acs": 23661, + "total_submitted": 27628, "frontend_question_id": 2610, "is_new_question": false }, @@ -912,8 +1487,8 @@ "question__title": "Find the Longest Balanced Substring of a Binary String", "question__title_slug": "find-the-longest-balanced-substring-of-a-binary-string", "question__hide": false, - "total_acs": 21733, - "total_submitted": 47392, + "total_acs": 22178, + "total_submitted": 48202, "frontend_question_id": 2609, "is_new_question": false }, @@ -935,8 +1510,8 @@ "question__title": "Prime In Diagonal", "question__title_slug": "prime-in-diagonal", "question__hide": false, - "total_acs": 23411, - "total_submitted": 72188, + "total_acs": 24237, + "total_submitted": 74608, "frontend_question_id": 2614, "is_new_question": false }, @@ -958,8 +1533,8 @@ "question__title": "Sum of Distances", "question__title_slug": "sum-of-distances", "question__hide": false, - "total_acs": 11894, - "total_submitted": 40447, + "total_acs": 12145, + "total_submitted": 41203, "frontend_question_id": 2615, "is_new_question": false }, @@ -981,8 +1556,8 @@ "question__title": "Minimize the Maximum Difference of Pairs", "question__title_slug": "minimize-the-maximum-difference-of-pairs", "question__hide": false, - "total_acs": 7684, - "total_submitted": 25559, + "total_acs": 7866, + "total_submitted": 26085, "frontend_question_id": 2616, "is_new_question": false }, @@ -1004,8 +1579,8 @@ "question__title": "Beautiful Pairs", "question__title_slug": "beautiful-pairs", "question__hide": false, - "total_acs": 323, - "total_submitted": 667, + "total_acs": 327, + "total_submitted": 673, "frontend_question_id": 2613, "is_new_question": false }, @@ -1027,8 +1602,8 @@ "question__title": "Minimum Operations to Make All Array Elements Equal", "question__title_slug": "minimum-operations-to-make-all-array-elements-equal", "question__hide": false, - "total_acs": 11195, - "total_submitted": 32182, + "total_acs": 11431, + "total_submitted": 32776, "frontend_question_id": 2602, "is_new_question": false }, @@ -1050,8 +1625,8 @@ "question__title": "Collect Coins in a Tree", "question__title_slug": "collect-coins-in-a-tree", "question__hide": false, - "total_acs": 3203, - "total_submitted": 8475, + "total_acs": 3306, + "total_submitted": 8772, "frontend_question_id": 2603, "is_new_question": false }, @@ -1073,8 +1648,8 @@ "question__title": "Prime Subtraction Operation", "question__title_slug": "prime-subtraction-operation", "question__hide": false, - "total_acs": 12265, - "total_submitted": 33327, + "total_acs": 12470, + "total_submitted": 33854, "frontend_question_id": 2601, "is_new_question": false }, @@ -1096,8 +1671,8 @@ "question__title": "K Items With the Maximum Sum", "question__title_slug": "k-items-with-the-maximum-sum", "question__hide": false, - "total_acs": 24013, - "total_submitted": 38798, + "total_acs": 24707, + "total_submitted": 39936, "frontend_question_id": 2600, "is_new_question": false }, @@ -1119,8 +1694,8 @@ "question__title": "Left and Right Sum Differences", "question__title_slug": "left-and-right-sum-differences", "question__hide": false, - "total_acs": 51060, - "total_submitted": 57851, + "total_acs": 53987, + "total_submitted": 61195, "frontend_question_id": 2574, "is_new_question": false }, @@ -1142,8 +1717,8 @@ "question__title": "Find the Divisibility Array of a String", "question__title_slug": "find-the-divisibility-array-of-a-string", "question__hide": false, - "total_acs": 20654, - "total_submitted": 65993, + "total_acs": 20845, + "total_submitted": 66593, "frontend_question_id": 2575, "is_new_question": false }, @@ -1165,8 +1740,8 @@ "question__title": "Find the Maximum Number of Marked Indices", "question__title_slug": "find-the-maximum-number-of-marked-indices", "question__hide": false, - "total_acs": 14744, - "total_submitted": 39085, + "total_acs": 14862, + "total_submitted": 39350, "frontend_question_id": 2576, "is_new_question": false }, @@ -1188,8 +1763,8 @@ "question__title": "Minimum Time to Visit a Cell In a Grid", "question__title_slug": "minimum-time-to-visit-a-cell-in-a-grid", "question__hide": false, - "total_acs": 6770, - "total_submitted": 19398, + "total_acs": 6896, + "total_submitted": 19728, "frontend_question_id": 2577, "is_new_question": false }, @@ -1211,8 +1786,8 @@ "question__title": "Minimum Operations to Reduce an Integer to 0", "question__title_slug": "minimum-operations-to-reduce-an-integer-to-0", "question__hide": false, - "total_acs": 16156, - "total_submitted": 32287, + "total_acs": 16312, + "total_submitted": 32502, "frontend_question_id": 2571, "is_new_question": false }, @@ -1234,8 +1809,8 @@ "question__title": "Count the Number of Square-Free Subsets", "question__title_slug": "count-the-number-of-square-free-subsets", "question__hide": false, - "total_acs": 5335, - "total_submitted": 25611, + "total_acs": 5468, + "total_submitted": 25991, "frontend_question_id": 2572, "is_new_question": false }, @@ -1257,8 +1832,8 @@ "question__title": "Find the String with LCP", "question__title_slug": "find-the-string-with-lcp", "question__hide": false, - "total_acs": 3067, - "total_submitted": 8762, + "total_acs": 3117, + "total_submitted": 8914, "frontend_question_id": 2573, "is_new_question": false }, @@ -1280,8 +1855,8 @@ "question__title": "Merge Two 2D Arrays by Summing Values", "question__title_slug": "merge-two-2d-arrays-by-summing-values", "question__hide": false, - "total_acs": 24883, - "total_submitted": 33868, + "total_acs": 25343, + "total_submitted": 34480, "frontend_question_id": 2570, "is_new_question": false }, @@ -1303,8 +1878,8 @@ "question__title": "Minimum Score by Changing Two Elements", "question__title_slug": "minimum-score-by-changing-two-elements", "question__hide": false, - "total_acs": 13233, - "total_submitted": 27711, + "total_acs": 13357, + "total_submitted": 27899, "frontend_question_id": 2567, "is_new_question": false }, @@ -1326,8 +1901,8 @@ "question__title": "Minimum Impossible OR", "question__title_slug": "minimum-impossible-or", "question__hide": false, - "total_acs": 11661, - "total_submitted": 20235, + "total_acs": 11770, + "total_submitted": 20394, "frontend_question_id": 2568, "is_new_question": false }, @@ -1349,8 +1924,8 @@ "question__title": "Maximum Difference by Remapping a Digit", "question__title_slug": "maximum-difference-by-remapping-a-digit", "question__hide": false, - "total_acs": 18640, - "total_submitted": 30931, + "total_acs": 18784, + "total_submitted": 31185, "frontend_question_id": 2566, "is_new_question": false }, @@ -1372,8 +1947,8 @@ "question__title": "Handling Sum Queries After Update", "question__title_slug": "handling-sum-queries-after-update", "question__hide": false, - "total_acs": 3530, - "total_submitted": 13144, + "total_acs": 3580, + "total_submitted": 13234, "frontend_question_id": 2569, "is_new_question": false }, @@ -1395,8 +1970,8 @@ "question__title": "Maximum Number of Integers to Choose From a Range II", "question__title_slug": "maximum-number-of-integers-to-choose-from-a-range-ii", "question__hide": false, - "total_acs": 789, - "total_submitted": 1820, + "total_acs": 836, + "total_submitted": 1901, "frontend_question_id": 2557, "is_new_question": false }, @@ -1418,8 +1993,8 @@ "question__title": "Subsequence With the Minimum Score", "question__title_slug": "subsequence-with-the-minimum-score", "question__hide": false, - "total_acs": 4676, - "total_submitted": 14662, + "total_acs": 4723, + "total_submitted": 14800, "frontend_question_id": 2565, "is_new_question": false }, @@ -1441,8 +2016,8 @@ "question__title": "Substring XOR Queries", "question__title_slug": "substring-xor-queries", "question__hide": false, - "total_acs": 9821, - "total_submitted": 29237, + "total_acs": 9884, + "total_submitted": 29379, "frontend_question_id": 2564, "is_new_question": false }, @@ -1464,8 +2039,8 @@ "question__title": "Count the Number of Fair Pairs", "question__title_slug": "count-the-number-of-fair-pairs", "question__hide": false, - "total_acs": 17600, - "total_submitted": 54625, + "total_acs": 17773, + "total_submitted": 55051, "frontend_question_id": 2563, "is_new_question": false }, @@ -1487,8 +2062,8 @@ "question__title": "Find the Array Concatenation Value", "question__title_slug": "find-the-array-concatenation-value", "question__hide": false, - "total_acs": 30857, - "total_submitted": 44263, + "total_acs": 31277, + "total_submitted": 44865, "frontend_question_id": 2562, "is_new_question": false }, @@ -1510,8 +2085,8 @@ "question__title": "Minimum Number of Visited Cells in a Grid", "question__title_slug": "minimum-number-of-visited-cells-in-a-grid", "question__hide": false, - "total_acs": 5654, - "total_submitted": 19882, + "total_acs": 5892, + "total_submitted": 20763, "frontend_question_id": 2617, "is_new_question": false }, @@ -1533,8 +2108,8 @@ "question__title": "The Number of Beautiful Subsets", "question__title_slug": "the-number-of-beautiful-subsets", "question__hide": false, - "total_acs": 12647, - "total_submitted": 43302, + "total_acs": 12814, + "total_submitted": 43930, "frontend_question_id": 2597, "is_new_question": false }, @@ -1556,8 +2131,8 @@ "question__title": "Find Score of an Array After Marking All Elements", "question__title_slug": "find-score-of-an-array-after-marking-all-elements", "question__hide": false, - "total_acs": 12419, - "total_submitted": 23192, + "total_acs": 12592, + "total_submitted": 23499, "frontend_question_id": 2593, "is_new_question": false }, @@ -1579,8 +2154,8 @@ "question__title": "Find the Maximum Divisibility Score", "question__title_slug": "find-the-maximum-divisibility-score", "question__hide": false, - "total_acs": 19941, - "total_submitted": 41196, + "total_acs": 20713, + "total_submitted": 42708, "frontend_question_id": 2644, "is_new_question": false }, @@ -1602,8 +2177,8 @@ "question__title": "Maximum Price to Fill a Bag", "question__title_slug": "maximum-price-to-fill-a-bag", "question__hide": false, - "total_acs": 800, - "total_submitted": 1184, + "total_acs": 816, + "total_submitted": 1212, "frontend_question_id": 2548, "is_new_question": false }, @@ -1625,8 +2200,8 @@ "question__title": "Take Gifts From the Richest Pile", "question__title_slug": "take-gifts-from-the-richest-pile", "question__hide": false, - "total_acs": 28884, - "total_submitted": 43296, + "total_acs": 29287, + "total_submitted": 43882, "frontend_question_id": 2558, "is_new_question": false }, @@ -1648,8 +2223,8 @@ "question__title": "Count Vowel Strings in Ranges", "question__title_slug": "count-vowel-strings-in-ranges", "question__hide": false, - "total_acs": 20649, - "total_submitted": 40243, + "total_acs": 20821, + "total_submitted": 40586, "frontend_question_id": 2559, "is_new_question": false }, @@ -1671,8 +2246,8 @@ "question__title": "House Robber IV", "question__title_slug": "house-robber-iv", "question__hide": false, - "total_acs": 10947, - "total_submitted": 27130, + "total_acs": 11075, + "total_submitted": 27382, "frontend_question_id": 2560, "is_new_question": false }, @@ -1694,8 +2269,8 @@ "question__title": "Rearranging Fruits", "question__title_slug": "rearranging-fruits", "question__hide": false, - "total_acs": 6624, - "total_submitted": 19369, + "total_acs": 6677, + "total_submitted": 19519, "frontend_question_id": 2561, "is_new_question": false }, @@ -1717,8 +2292,8 @@ "question__title": "Design a Todo List", "question__title_slug": "design-a-todo-list", "question__hide": false, - "total_acs": 585, - "total_submitted": 966, + "total_acs": 613, + "total_submitted": 1017, "frontend_question_id": 2590, "is_new_question": false }, @@ -1740,8 +2315,8 @@ "question__title": "Lexicographically Smallest Beautiful String", "question__title_slug": "lexicographically-smallest-beautiful-string", "question__hide": false, - "total_acs": 2214, - "total_submitted": 6056, + "total_acs": 2912, + "total_submitted": 7656, "frontend_question_id": 2663, "is_new_question": false }, @@ -1763,8 +2338,8 @@ "question__title": "Minimum Cost of a Path With Special Roads", "question__title_slug": "minimum-cost-of-a-path-with-special-roads", "question__hide": false, - "total_acs": 4780, - "total_submitted": 15523, + "total_acs": 6091, + "total_submitted": 18530, "frontend_question_id": 2662, "is_new_question": false }, @@ -1786,8 +2361,8 @@ "question__title": "First Completely Painted Row or Column", "question__title_slug": "first-completely-painted-row-or-column", "question__hide": false, - "total_acs": 12100, - "total_submitted": 24745, + "total_acs": 14443, + "total_submitted": 28996, "frontend_question_id": 2661, "is_new_question": false }, @@ -1809,8 +2384,8 @@ "question__title": "Determine the Winner of a Bowling Game", "question__title_slug": "determine-the-winner-of-a-bowling-game", "question__hide": false, - "total_acs": 16357, - "total_submitted": 49749, + "total_acs": 19562, + "total_submitted": 58284, "frontend_question_id": 2660, "is_new_question": false }, @@ -1832,8 +2407,8 @@ "question__title": "Count the Number of Good Subsequences", "question__title_slug": "count-the-number-of-good-subsequences", "question__hide": false, - "total_acs": 1322, - "total_submitted": 1837, + "total_acs": 1336, + "total_submitted": 1865, "frontend_question_id": 2539, "is_new_question": false }, @@ -1855,8 +2430,8 @@ "question__title": "Count Increasing Quadruplets", "question__title_slug": "count-increasing-quadruplets", "question__hide": false, - "total_acs": 4962, - "total_submitted": 16049, + "total_acs": 4999, + "total_submitted": 16230, "frontend_question_id": 2552, "is_new_question": false }, @@ -1878,8 +2453,8 @@ "question__title": "Put Marbles in Bags", "question__title_slug": "put-marbles-in-bags", "question__hide": false, - "total_acs": 9101, - "total_submitted": 17344, + "total_acs": 9203, + "total_submitted": 17521, "frontend_question_id": 2551, "is_new_question": false }, @@ -1901,8 +2476,8 @@ "question__title": "Count Collisions of Monkeys on a Polygon", "question__title_slug": "count-collisions-of-monkeys-on-a-polygon", "question__hide": false, - "total_acs": 15089, - "total_submitted": 56831, + "total_acs": 15171, + "total_submitted": 57057, "frontend_question_id": 2550, "is_new_question": false }, @@ -1924,8 +2499,8 @@ "question__title": "Count Distinct Numbers on Board", "question__title_slug": "count-distinct-numbers-on-board", "question__hide": false, - "total_acs": 27755, - "total_submitted": 46293, + "total_acs": 28027, + "total_submitted": 46749, "frontend_question_id": 2549, "is_new_question": false }, @@ -1947,8 +2522,8 @@ "question__title": "Design Graph With Shortest Path Calculator", "question__title_slug": "design-graph-with-shortest-path-calculator", "question__hide": false, - "total_acs": 7561, - "total_submitted": 13381, + "total_acs": 7859, + "total_submitted": 13835, "frontend_question_id": 2642, "is_new_question": false }, @@ -1970,8 +2545,8 @@ "question__title": "Cousins in Binary Tree II", "question__title_slug": "cousins-in-binary-tree-ii", "question__hide": false, - "total_acs": 10311, - "total_submitted": 15139, + "total_acs": 10687, + "total_submitted": 15636, "frontend_question_id": 2641, "is_new_question": false }, @@ -1993,8 +2568,8 @@ "question__title": "Find the Score of All Prefixes of an Array", "question__title_slug": "find-the-score-of-all-prefixes-of-an-array", "question__hide": false, - "total_acs": 17010, - "total_submitted": 23853, + "total_acs": 17550, + "total_submitted": 24584, "frontend_question_id": 2640, "is_new_question": false }, @@ -2016,8 +2591,8 @@ "question__title": "Find the Width of Columns of a Grid", "question__title_slug": "find-the-width-of-columns-of-a-grid", "question__hide": false, - "total_acs": 17024, - "total_submitted": 26076, + "total_acs": 17552, + "total_submitted": 26794, "frontend_question_id": 2639, "is_new_question": false }, @@ -2039,8 +2614,8 @@ "question__title": "Make the Prefix Sum Non-negative", "question__title_slug": "make-the-prefix-sum-non-negative", "question__hide": false, - "total_acs": 633, - "total_submitted": 1218, + "total_acs": 728, + "total_submitted": 1380, "frontend_question_id": 2599, "is_new_question": false }, @@ -2062,8 +2637,8 @@ "question__title": "Maximize Win From Two Segments", "question__title_slug": "maximize-win-from-two-segments", "question__hide": false, - "total_acs": 6859, - "total_submitted": 22252, + "total_acs": 6933, + "total_submitted": 22434, "frontend_question_id": 2555, "is_new_question": false }, @@ -2085,8 +2660,8 @@ "question__title": "Number of Good Binary Strings", "question__title_slug": "number-of-good-binary-strings", "question__hide": false, - "total_acs": 607, - "total_submitted": 938, + "total_acs": 615, + "total_submitted": 954, "frontend_question_id": 2533, "is_new_question": false }, @@ -2108,8 +2683,8 @@ "question__title": "Shortest Cycle in a Graph", "question__title_slug": "shortest-cycle-in-a-graph", "question__hide": false, - "total_acs": 9752, - "total_submitted": 25655, + "total_acs": 10126, + "total_submitted": 26473, "frontend_question_id": 2608, "is_new_question": false }, @@ -2131,8 +2706,8 @@ "question__title": "Make K-Subarray Sums Equal", "question__title_slug": "make-k-subarray-sums-equal", "question__hide": false, - "total_acs": 6101, - "total_submitted": 18772, + "total_acs": 6237, + "total_submitted": 19045, "frontend_question_id": 2607, "is_new_question": false }, @@ -2154,8 +2729,8 @@ "question__title": "Find the Substring With Maximum Cost", "question__title_slug": "find-the-substring-with-maximum-cost", "question__hide": false, - "total_acs": 16700, - "total_submitted": 30197, + "total_acs": 17086, + "total_submitted": 30796, "frontend_question_id": 2606, "is_new_question": false }, @@ -2177,8 +2752,8 @@ "question__title": "Form Smallest Number From Two Digit Arrays", "question__title_slug": "form-smallest-number-from-two-digit-arrays", "question__hide": false, - "total_acs": 22835, - "total_submitted": 42635, + "total_acs": 23473, + "total_submitted": 43798, "frontend_question_id": 2605, "is_new_question": false }, @@ -2200,8 +2775,8 @@ "question__title": "Maximum Frequency Score of a Subarray", "question__title_slug": "maximum-frequency-score-of-a-subarray", "question__hide": false, - "total_acs": 577, - "total_submitted": 1420, + "total_acs": 578, + "total_submitted": 1425, "frontend_question_id": 2524, "is_new_question": false }, @@ -2223,8 +2798,8 @@ "question__title": "Minimum Time to Eat All Grains", "question__title_slug": "minimum-time-to-eat-all-grains", "question__hide": false, - "total_acs": 424, - "total_submitted": 936, + "total_acs": 440, + "total_submitted": 962, "frontend_question_id": 2604, "is_new_question": false }, @@ -2246,8 +2821,8 @@ "question__title": "Minimum Time to Repair Cars", "question__title_slug": "minimum-time-to-repair-cars", "question__hide": false, - "total_acs": 9368, - "total_submitted": 21376, + "total_acs": 9533, + "total_submitted": 21737, "frontend_question_id": 2594, "is_new_question": false }, @@ -2269,8 +2844,8 @@ "question__title": "Maximize Greatness of an Array", "question__title_slug": "maximize-greatness-of-an-array", "question__hide": false, - "total_acs": 14921, - "total_submitted": 26353, + "total_acs": 15140, + "total_submitted": 26669, "frontend_question_id": 2592, "is_new_question": false }, @@ -2292,8 +2867,8 @@ "question__title": "Distribute Money to Maximum Children", "question__title_slug": "distribute-money-to-maximum-children", "question__hide": false, - "total_acs": 16535, - "total_submitted": 89385, + "total_acs": 16936, + "total_submitted": 91164, "frontend_question_id": 2591, "is_new_question": false }, @@ -2315,8 +2890,8 @@ "question__title": "Check Knight Tour Configuration", "question__title_slug": "check-knight-tour-configuration", "question__hide": false, - "total_acs": 18348, - "total_submitted": 31143, + "total_acs": 18619, + "total_submitted": 31642, "frontend_question_id": 2596, "is_new_question": false }, @@ -2338,8 +2913,8 @@ "question__title": "Smallest Missing Non-negative Integer After Operations", "question__title_slug": "smallest-missing-non-negative-integer-after-operations", "question__hide": false, - "total_acs": 10379, - "total_submitted": 26553, + "total_acs": 10524, + "total_submitted": 26869, "frontend_question_id": 2598, "is_new_question": false }, @@ -2361,8 +2936,8 @@ "question__title": "Number of Even and Odd Bits", "question__title_slug": "number-of-even-and-odd-bits", "question__hide": false, - "total_acs": 27019, - "total_submitted": 38092, + "total_acs": 27628, + "total_submitted": 38867, "frontend_question_id": 2595, "is_new_question": false }, @@ -2384,8 +2959,8 @@ "question__title": "Count the Number of K-Big Indices", "question__title_slug": "count-the-number-of-k-big-indices", "question__hide": false, - "total_acs": 617, - "total_submitted": 959, + "total_acs": 638, + "total_submitted": 991, "frontend_question_id": 2519, "is_new_question": false }, @@ -2407,8 +2982,8 @@ "question__title": "Minimum Time to Complete All Tasks", "question__title_slug": "minimum-time-to-complete-all-tasks", "question__hide": false, - "total_acs": 5981, - "total_submitted": 16043, + "total_acs": 6087, + "total_submitted": 16306, "frontend_question_id": 2589, "is_new_question": false }, @@ -2430,8 +3005,8 @@ "question__title": "Count the Number of Beautiful Subarrays", "question__title_slug": "count-the-number-of-beautiful-subarrays", "question__hide": false, - "total_acs": 12663, - "total_submitted": 25549, + "total_acs": 12736, + "total_submitted": 25667, "frontend_question_id": 2588, "is_new_question": false }, @@ -2453,8 +3028,8 @@ "question__title": "Rearrange Array to Maximize Prefix Score", "question__title_slug": "rearrange-array-to-maximize-prefix-score", "question__hide": false, - "total_acs": 22099, - "total_submitted": 55625, + "total_acs": 22285, + "total_submitted": 56024, "frontend_question_id": 2587, "is_new_question": false }, @@ -2476,8 +3051,8 @@ "question__title": "Count the Number of Vowel Strings in Range", "question__title_slug": "count-the-number-of-vowel-strings-in-range", "question__hide": false, - "total_acs": 31874, - "total_submitted": 41541, + "total_acs": 32821, + "total_submitted": 42857, "frontend_question_id": 2586, "is_new_question": false }, @@ -2499,8 +3074,8 @@ "question__title": "Check if There is a Path With Equal Number of 0's And 1's", "question__title_slug": "check-if-there-is-a-path-with-equal-number-of-0s-and-1s", "question__hide": false, - "total_acs": 1085, - "total_submitted": 2040, + "total_acs": 1130, + "total_submitted": 2137, "frontend_question_id": 2510, "is_new_question": false }, @@ -2522,8 +3097,8 @@ "question__title": "Count Number of Possible Root Nodes", "question__title_slug": "count-number-of-possible-root-nodes", "question__hide": false, - "total_acs": 3633, - "total_submitted": 7477, + "total_acs": 3695, + "total_submitted": 7558, "frontend_question_id": 2581, "is_new_question": false }, @@ -2545,8 +3120,8 @@ "question__title": "Count Ways to Group Overlapping Ranges", "question__title_slug": "count-ways-to-group-overlapping-ranges", "question__hide": false, - "total_acs": 11808, - "total_submitted": 33786, + "total_acs": 11896, + "total_submitted": 33998, "frontend_question_id": 2580, "is_new_question": false }, @@ -2568,8 +3143,8 @@ "question__title": "Split With Minimum Sum", "question__title_slug": "split-with-minimum-sum", "question__hide": false, - "total_acs": 20712, - "total_submitted": 29526, + "total_acs": 21168, + "total_submitted": 30142, "frontend_question_id": 2578, "is_new_question": false }, @@ -2591,8 +3166,8 @@ "question__title": "Count Total Number of Colored Cells", "question__title_slug": "count-total-number-of-colored-cells", "question__hide": false, - "total_acs": 19219, - "total_submitted": 33501, + "total_acs": 19440, + "total_submitted": 33846, "frontend_question_id": 2579, "is_new_question": false }, @@ -2614,8 +3189,8 @@ "question__title": "Number of Ways to Earn Points", "question__title_slug": "number-of-ways-to-earn-points", "question__hide": false, - "total_acs": 10276, - "total_submitted": 17382, + "total_acs": 10439, + "total_submitted": 17638, "frontend_question_id": 2585, "is_new_question": false }, @@ -2637,8 +3212,8 @@ "question__title": "Split the Array to Make Coprime Products", "question__title_slug": "split-the-array-to-make-coprime-products", "question__hide": false, - "total_acs": 8949, - "total_submitted": 40275, + "total_acs": 9043, + "total_submitted": 40592, "frontend_question_id": 2584, "is_new_question": false }, @@ -2660,8 +3235,8 @@ "question__title": "Kth Largest Sum in a Binary Tree", "question__title_slug": "kth-largest-sum-in-a-binary-tree", "question__hide": false, - "total_acs": 20656, - "total_submitted": 44031, + "total_acs": 20957, + "total_submitted": 44718, "frontend_question_id": 2583, "is_new_question": false }, @@ -2683,8 +3258,8 @@ "question__title": "Pass the Pillow", "question__title_slug": "pass-the-pillow", "question__hide": false, - "total_acs": 25004, - "total_submitted": 54120, + "total_acs": 25444, + "total_submitted": 54936, "frontend_question_id": 2582, "is_new_question": false }, @@ -2706,8 +3281,8 @@ "question__title": "Bitwise OR of All Subsequence Sums", "question__title_slug": "bitwise-or-of-all-subsequence-sums", "question__hide": false, - "total_acs": 611, - "total_submitted": 1035, + "total_acs": 616, + "total_submitted": 1042, "frontend_question_id": 2505, "is_new_question": false }, @@ -2729,8 +3304,8 @@ "question__title": "Concatenate the Name and the Profession", "question__title_slug": "concatenate-the-name-and-the-profession", "question__hide": false, - "total_acs": 1554, - "total_submitted": 2544, + "total_acs": 1618, + "total_submitted": 2659, "frontend_question_id": 2504, "is_new_question": false }, @@ -2752,8 +3327,8 @@ "question__title": "Time to Cross a Bridge", "question__title_slug": "time-to-cross-a-bridge", "question__hide": false, - "total_acs": 3111, - "total_submitted": 5977, + "total_acs": 3137, + "total_submitted": 6029, "frontend_question_id": 2532, "is_new_question": false }, @@ -2775,8 +3350,8 @@ "question__title": "Disconnect Path in a Binary Matrix by at Most One Flip", "question__title_slug": "disconnect-path-in-a-binary-matrix-by-at-most-one-flip", "question__hide": false, - "total_acs": 8835, - "total_submitted": 31281, + "total_acs": 8956, + "total_submitted": 31756, "frontend_question_id": 2556, "is_new_question": false }, @@ -2798,8 +3373,8 @@ "question__title": "Maximum Number of Integers to Choose From a Range I", "question__title_slug": "maximum-number-of-integers-to-choose-from-a-range-i", "question__hide": false, - "total_acs": 22170, - "total_submitted": 42171, + "total_acs": 22378, + "total_submitted": 42514, "frontend_question_id": 2554, "is_new_question": false }, @@ -2821,8 +3396,8 @@ "question__title": "Separate the Digits in an Array", "question__title_slug": "separate-the-digits-in-an-array", "question__hide": false, - "total_acs": 36629, - "total_submitted": 46047, + "total_acs": 37549, + "total_submitted": 47217, "frontend_question_id": 2553, "is_new_question": false }, @@ -2844,8 +3419,8 @@ "question__title": "Number of Subarrays Having Even Product", "question__title_slug": "number-of-subarrays-having-even-product", "question__hide": false, - "total_acs": 1048, - "total_submitted": 1615, + "total_acs": 1071, + "total_submitted": 1652, "frontend_question_id": 2495, "is_new_question": false }, @@ -2867,8 +3442,8 @@ "question__title": "Merge Overlapping Events in the Same Hall", "question__title_slug": "merge-overlapping-events-in-the-same-hall", "question__hide": false, - "total_acs": 497, - "total_submitted": 2244, + "total_acs": 535, + "total_submitted": 2365, "frontend_question_id": 2494, "is_new_question": false }, @@ -2890,8 +3465,8 @@ "question__title": "Maximum Subsequence Score", "question__title_slug": "maximum-subsequence-score", "question__hide": false, - "total_acs": 8344, - "total_submitted": 21699, + "total_acs": 8573, + "total_submitted": 22199, "frontend_question_id": 2542, "is_new_question": false }, @@ -2913,8 +3488,8 @@ "question__title": "Check if Point Is Reachable", "question__title_slug": "check-if-point-is-reachable", "question__hide": false, - "total_acs": 4989, - "total_submitted": 11842, + "total_acs": 5038, + "total_submitted": 11925, "frontend_question_id": 2543, "is_new_question": false }, @@ -2936,8 +3511,8 @@ "question__title": "Minimum Common Value", "question__title_slug": "minimum-common-value", "question__hide": false, - "total_acs": 34022, - "total_submitted": 66608, + "total_acs": 34764, + "total_submitted": 68074, "frontend_question_id": 2540, "is_new_question": false }, @@ -2959,8 +3534,8 @@ "question__title": "Minimum Cost to Split an Array", "question__title_slug": "minimum-cost-to-split-an-array", "question__hide": false, - "total_acs": 8668, - "total_submitted": 22345, + "total_acs": 8729, + "total_submitted": 22502, "frontend_question_id": 2547, "is_new_question": false }, @@ -2982,8 +3557,8 @@ "question__title": "Apply Bitwise Operations to Make Strings Equal", "question__title_slug": "apply-bitwise-operations-to-make-strings-equal", "question__hide": false, - "total_acs": 15491, - "total_submitted": 38115, + "total_acs": 15554, + "total_submitted": 38247, "frontend_question_id": 2546, "is_new_question": false }, @@ -3005,8 +3580,8 @@ "question__title": "Sort the Students by Their Kth Score", "question__title_slug": "sort-the-students-by-their-kth-score", "question__hide": false, - "total_acs": 32207, - "total_submitted": 37567, + "total_acs": 32949, + "total_submitted": 38421, "frontend_question_id": 2545, "is_new_question": false }, @@ -3028,8 +3603,8 @@ "question__title": "Alternating Digit Sum", "question__title_slug": "alternating-digit-sum", "question__hide": false, - "total_acs": 35184, - "total_submitted": 50724, + "total_acs": 35743, + "total_submitted": 51526, "frontend_question_id": 2544, "is_new_question": false }, @@ -3051,8 +3626,8 @@ "question__title": "Number of Substrings With Fixed Ratio", "question__title_slug": "number-of-substrings-with-fixed-ratio", "question__hide": false, - "total_acs": 546, - "total_submitted": 936, + "total_acs": 557, + "total_submitted": 953, "frontend_question_id": 2489, "is_new_question": false }, @@ -3074,8 +3649,8 @@ "question__title": "Minimize the Maximum of Two Arrays", "question__title_slug": "minimize-the-maximum-of-two-arrays", "question__hide": false, - "total_acs": 4744, - "total_submitted": 17896, + "total_acs": 4809, + "total_submitted": 18069, "frontend_question_id": 2513, "is_new_question": false }, @@ -3097,8 +3672,8 @@ "question__title": "Difference Between Maximum and Minimum Price Sum", "question__title_slug": "difference-between-maximum-and-minimum-price-sum", "question__hide": false, - "total_acs": 5252, - "total_submitted": 15096, + "total_acs": 5289, + "total_submitted": 15208, "frontend_question_id": 2538, "is_new_question": false }, @@ -3120,8 +3695,8 @@ "question__title": "Count the Number of Good Subarrays", "question__title_slug": "count-the-number-of-good-subarrays", "question__hide": false, - "total_acs": 12467, - "total_submitted": 25950, + "total_acs": 12566, + "total_submitted": 26131, "frontend_question_id": 2537, "is_new_question": false }, @@ -3143,8 +3718,8 @@ "question__title": "Increment Submatrices by One", "question__title_slug": "increment-submatrices-by-one", "question__hide": false, - "total_acs": 17072, - "total_submitted": 35211, + "total_acs": 17163, + "total_submitted": 35370, "frontend_question_id": 2536, "is_new_question": false }, @@ -3166,8 +3741,8 @@ "question__title": "Difference Between Element Sum and Digit Sum of an Array", "question__title_slug": "difference-between-element-sum-and-digit-sum-of-an-array", "question__hide": false, - "total_acs": 60804, - "total_submitted": 71809, + "total_acs": 62410, + "total_submitted": 73814, "frontend_question_id": 2535, "is_new_question": false }, @@ -3189,8 +3764,8 @@ "question__title": "Maximum XOR of Two Non-Overlapping Subtrees", "question__title_slug": "maximum-xor-of-two-non-overlapping-subtrees", "question__hide": false, - "total_acs": 376, - "total_submitted": 809, + "total_acs": 390, + "total_submitted": 837, "frontend_question_id": 2479, "is_new_question": false }, @@ -3212,8 +3787,8 @@ "question__title": "Form a Chemical Bond", "question__title_slug": "form-a-chemical-bond", "question__hide": false, - "total_acs": 1707, - "total_submitted": 2753, + "total_acs": 1760, + "total_submitted": 2856, "frontend_question_id": 2480, "is_new_question": false }, @@ -3235,8 +3810,8 @@ "question__title": "Find Xor-Beauty of Array", "question__title_slug": "find-xor-beauty-of-array", "question__hide": false, - "total_acs": 14359, - "total_submitted": 20408, + "total_acs": 14468, + "total_submitted": 20599, "frontend_question_id": 2527, "is_new_question": false }, @@ -3258,8 +3833,8 @@ "question__title": "Find Consecutive Integers from a Data Stream", "question__title_slug": "find-consecutive-integers-from-a-data-stream", "question__hide": false, - "total_acs": 16701, - "total_submitted": 36667, + "total_acs": 16872, + "total_submitted": 36945, "frontend_question_id": 2526, "is_new_question": false }, @@ -3281,8 +3856,8 @@ "question__title": "Categorize Box According to Criteria", "question__title_slug": "categorize-box-according-to-criteria", "question__hide": false, - "total_acs": 22911, - "total_submitted": 66870, + "total_acs": 23138, + "total_submitted": 67477, "frontend_question_id": 2525, "is_new_question": false }, @@ -3304,8 +3879,8 @@ "question__title": "Maximize the Minimum Powered City", "question__title_slug": "maximize-the-minimum-powered-city", "question__hide": false, - "total_acs": 4557, - "total_submitted": 14258, + "total_acs": 4618, + "total_submitted": 14377, "frontend_question_id": 2528, "is_new_question": false }, @@ -3327,8 +3902,8 @@ "question__title": "Time Taken to Cross the Door", "question__title_slug": "time-taken-to-cross-the-door", "question__hide": false, - "total_acs": 474, - "total_submitted": 702, + "total_acs": 508, + "total_submitted": 752, "frontend_question_id": 2534, "is_new_question": false }, @@ -3350,8 +3925,8 @@ "question__title": "Maximal Score After Applying K Operations", "question__title_slug": "maximal-score-after-applying-k-operations", "question__hide": false, - "total_acs": 21599, - "total_submitted": 49569, + "total_acs": 21756, + "total_submitted": 49832, "frontend_question_id": 2530, "is_new_question": false }, @@ -3373,8 +3948,8 @@ "question__title": "Make Number of Distinct Characters Equal", "question__title_slug": "make-number-of-distinct-characters-equal", "question__hide": false, - "total_acs": 13896, - "total_submitted": 54371, + "total_acs": 14000, + "total_submitted": 54694, "frontend_question_id": 2531, "is_new_question": false }, @@ -3396,8 +3971,8 @@ "question__title": "Maximum Count of Positive Integer and Negative Integer", "question__title_slug": "maximum-count-of-positive-integer-and-negative-integer", "question__hide": false, - "total_acs": 51751, - "total_submitted": 69929, + "total_acs": 52990, + "total_submitted": 71674, "frontend_question_id": 2529, "is_new_question": false }, @@ -3419,8 +3994,8 @@ "question__title": "Customers With Strictly Increasing Purchases", "question__title_slug": "customers-with-strictly-increasing-purchases", "question__hide": false, - "total_acs": 1093, - "total_submitted": 2720, + "total_acs": 1150, + "total_submitted": 2910, "frontend_question_id": 2474, "is_new_question": false }, @@ -3442,8 +4017,8 @@ "question__title": "Minimum Cost to Buy Apples", "question__title_slug": "minimum-cost-to-buy-apples", "question__hide": false, - "total_acs": 948, - "total_submitted": 1510, + "total_acs": 968, + "total_submitted": 1565, "frontend_question_id": 2473, "is_new_question": false }, @@ -3465,8 +4040,8 @@ "question__title": "Closest Prime Numbers in Range", "question__title_slug": "closest-prime-numbers-in-range", "question__hide": false, - "total_acs": 16444, - "total_submitted": 44545, + "total_acs": 16657, + "total_submitted": 44997, "frontend_question_id": 2523, "is_new_question": false }, @@ -3488,8 +4063,8 @@ "question__title": "Distinct Prime Factors of Product of Array", "question__title_slug": "distinct-prime-factors-of-product-of-array", "question__hide": false, - "total_acs": 20850, - "total_submitted": 41527, + "total_acs": 21080, + "total_submitted": 41920, "frontend_question_id": 2521, "is_new_question": false }, @@ -3511,8 +4086,8 @@ "question__title": "Count the Digits That Divide a Number", "question__title_slug": "count-the-digits-that-divide-a-number", "question__hide": false, - "total_acs": 41620, - "total_submitted": 49138, + "total_acs": 42622, + "total_submitted": 50345, "frontend_question_id": 2520, "is_new_question": false }, @@ -3534,8 +4109,8 @@ "question__title": "Minimum Subarrays in a Valid Split", "question__title_slug": "minimum-subarrays-in-a-valid-split", "question__hide": false, - "total_acs": 724, - "total_submitted": 1298, + "total_acs": 755, + "total_submitted": 1355, "frontend_question_id": 2464, "is_new_question": false }, @@ -3557,8 +4132,8 @@ "question__title": "Difference Between Ones and Zeros in Row and Column", "question__title_slug": "difference-between-ones-and-zeros-in-row-and-column", "question__hide": false, - "total_acs": 18292, - "total_submitted": 22977, + "total_acs": 18708, + "total_submitted": 23464, "frontend_question_id": 2482, "is_new_question": false }, @@ -3580,8 +4155,8 @@ "question__title": "Count Anagrams", "question__title_slug": "count-anagrams", "question__hide": false, - "total_acs": 6031, - "total_submitted": 17825, + "total_acs": 6127, + "total_submitted": 18126, "frontend_question_id": 2514, "is_new_question": false }, @@ -3603,8 +4178,8 @@ "question__title": "Minimum Operations to Make Array Equal II", "question__title_slug": "minimum-operations-to-make-array-equal-ii", "question__hide": false, - "total_acs": 17343, - "total_submitted": 56031, + "total_acs": 17439, + "total_submitted": 56318, "frontend_question_id": 2541, "is_new_question": false }, @@ -3626,8 +4201,8 @@ "question__title": "Reward Top K Students", "question__title_slug": "reward-top-k-students", "question__hide": false, - "total_acs": 13180, - "total_submitted": 28404, + "total_acs": 13381, + "total_submitted": 28866, "frontend_question_id": 2512, "is_new_question": false }, @@ -3649,8 +4224,8 @@ "question__title": "Maximum Enemy Forts That Can Be Captured", "question__title_slug": "maximum-enemy-forts-that-can-be-captured", "question__hide": false, - "total_acs": 16108, - "total_submitted": 42753, + "total_acs": 16350, + "total_submitted": 43304, "frontend_question_id": 2511, "is_new_question": false }, @@ -3672,8 +4247,8 @@ "question__title": "Number of Great Partitions", "question__title_slug": "number-of-great-partitions", "question__hide": false, - "total_acs": 5442, - "total_submitted": 16631, + "total_acs": 5501, + "total_submitted": 16815, "frontend_question_id": 2518, "is_new_question": false }, @@ -3695,8 +4270,8 @@ "question__title": "Maximum Tastiness of Candy Basket", "question__title_slug": "maximum-tastiness-of-candy-basket", "question__hide": false, - "total_acs": 11123, - "total_submitted": 17262, + "total_acs": 11270, + "total_submitted": 17496, "frontend_question_id": 2517, "is_new_question": false }, @@ -3718,8 +4293,8 @@ "question__title": "Take K of Each Character From Left and Right", "question__title_slug": "take-k-of-each-character-from-left-and-right", "question__hide": false, - "total_acs": 11119, - "total_submitted": 32774, + "total_acs": 11205, + "total_submitted": 32979, "frontend_question_id": 2516, "is_new_question": false }, @@ -3741,8 +4316,8 @@ "question__title": "Shortest Distance to Target String in a Circular Array", "question__title_slug": "shortest-distance-to-target-string-in-a-circular-array", "question__hide": false, - "total_acs": 21108, - "total_submitted": 43192, + "total_acs": 21304, + "total_submitted": 43646, "frontend_question_id": 2515, "is_new_question": false }, @@ -3764,8 +4339,8 @@ "question__title": "Cycle Length Queries in a Tree", "question__title_slug": "cycle-length-queries-in-a-tree", "question__hide": false, - "total_acs": 8719, - "total_submitted": 15382, + "total_acs": 8818, + "total_submitted": 15545, "frontend_question_id": 2509, "is_new_question": false }, @@ -3787,8 +4362,8 @@ "question__title": "Add Edges to Make Degrees of All Nodes Even", "question__title_slug": "add-edges-to-make-degrees-of-all-nodes-even", "question__hide": false, - "total_acs": 9201, - "total_submitted": 28579, + "total_acs": 9261, + "total_submitted": 28780, "frontend_question_id": 2508, "is_new_question": false }, @@ -3810,8 +4385,8 @@ "question__title": "Smallest Value After Replacing With Sum of Prime Factors", "question__title_slug": "smallest-value-after-replacing-with-sum-of-prime-factors", "question__hide": false, - "total_acs": 16504, - "total_submitted": 34108, + "total_acs": 16622, + "total_submitted": 34356, "frontend_question_id": 2507, "is_new_question": false }, @@ -3833,8 +4408,8 @@ "question__title": "Count Pairs Of Similar Strings", "question__title_slug": "count-pairs-of-similar-strings", "question__hide": false, - "total_acs": 27090, - "total_submitted": 38444, + "total_acs": 27505, + "total_submitted": 39241, "frontend_question_id": 2506, "is_new_question": false }, @@ -3856,8 +4431,8 @@ "question__title": "Number of Distinct Binary Strings After Applying Operations", "question__title_slug": "number-of-distinct-binary-strings-after-applying-operations", "question__hide": false, - "total_acs": 611, - "total_submitted": 918, + "total_acs": 619, + "total_submitted": 928, "frontend_question_id": 2450, "is_new_question": false }, @@ -3879,8 +4454,8 @@ "question__title": "Minimum Total Cost to Make Arrays Unequal", "question__title_slug": "minimum-total-cost-to-make-arrays-unequal", "question__hide": false, - "total_acs": 2817, - "total_submitted": 6550, + "total_acs": 2839, + "total_submitted": 6598, "frontend_question_id": 2499, "is_new_question": false }, @@ -3902,8 +4477,8 @@ "question__title": "Frog Jump II", "question__title_slug": "frog-jump-ii", "question__hide": false, - "total_acs": 12001, - "total_submitted": 19731, + "total_acs": 12198, + "total_submitted": 20052, "frontend_question_id": 2498, "is_new_question": false }, @@ -3925,8 +4500,8 @@ "question__title": "Maximum Star Sum of a Graph", "question__title_slug": "maximum-star-sum-of-a-graph", "question__hide": false, - "total_acs": 12313, - "total_submitted": 32170, + "total_acs": 12504, + "total_submitted": 32655, "frontend_question_id": 2497, "is_new_question": false }, @@ -3948,8 +4523,8 @@ "question__title": "Maximum Value of a String in an Array", "question__title_slug": "maximum-value-of-a-string-in-an-array", "question__hide": false, - "total_acs": 25604, - "total_submitted": 35528, + "total_acs": 26081, + "total_submitted": 36192, "frontend_question_id": 2496, "is_new_question": false }, @@ -3971,8 +4546,8 @@ "question__title": "Maximum Number of Points From Grid Queries", "question__title_slug": "maximum-number-of-points-from-grid-queries", "question__hide": false, - "total_acs": 6461, - "total_submitted": 17498, + "total_acs": 6521, + "total_submitted": 17641, "frontend_question_id": 2503, "is_new_question": false }, @@ -3994,8 +4569,8 @@ "question__title": "Design Memory Allocator", "question__title_slug": "design-memory-allocator", "question__hide": false, - "total_acs": 11395, - "total_submitted": 21783, + "total_acs": 11542, + "total_submitted": 22057, "frontend_question_id": 2502, "is_new_question": false }, @@ -4017,8 +4592,8 @@ "question__title": "Longest Square Streak in an Array", "question__title_slug": "longest-square-streak-in-an-array", "question__hide": false, - "total_acs": 19810, - "total_submitted": 50263, + "total_acs": 19963, + "total_submitted": 50595, "frontend_question_id": 2501, "is_new_question": false }, @@ -4040,8 +4615,8 @@ "question__title": "Delete Greatest Value in Each Row", "question__title_slug": "delete-greatest-value-in-each-row", "question__hide": false, - "total_acs": 32078, - "total_submitted": 39916, + "total_acs": 32673, + "total_submitted": 40716, "frontend_question_id": 2500, "is_new_question": false }, @@ -4063,8 +4638,8 @@ "question__title": "Number of Nodes With Value One", "question__title_slug": "number-of-nodes-with-value-one", "question__hide": false, - "total_acs": 1292, - "total_submitted": 1843, + "total_acs": 1316, + "total_submitted": 1872, "frontend_question_id": 2445, "is_new_question": false }, @@ -4086,8 +4661,8 @@ "question__title": "Divide Nodes Into the Maximum Number of Groups", "question__title_slug": "divide-nodes-into-the-maximum-number-of-groups", "question__hide": false, - "total_acs": 5143, - "total_submitted": 13931, + "total_acs": 5173, + "total_submitted": 14004, "frontend_question_id": 2493, "is_new_question": false }, @@ -4109,8 +4684,8 @@ "question__title": "Minimum Score of a Path Between Two Cities", "question__title_slug": "minimum-score-of-a-path-between-two-cities", "question__hide": false, - "total_acs": 70605, - "total_submitted": 121874, + "total_acs": 70881, + "total_submitted": 122442, "frontend_question_id": 2492, "is_new_question": false }, @@ -4132,8 +4707,8 @@ "question__title": "Divide Players Into Teams of Equal Skill", "question__title_slug": "divide-players-into-teams-of-equal-skill", "question__hide": false, - "total_acs": 23796, - "total_submitted": 40531, + "total_acs": 24006, + "total_submitted": 40863, "frontend_question_id": 2491, "is_new_question": false }, @@ -4155,8 +4730,8 @@ "question__title": "Circular Sentence", "question__title_slug": "circular-sentence", "question__hide": false, - "total_acs": 27910, - "total_submitted": 43614, + "total_acs": 28245, + "total_submitted": 44209, "frontend_question_id": 2490, "is_new_question": false }, @@ -4178,8 +4753,8 @@ "question__title": "Minimum Split Into Subarrays With GCD Greater Than One", "question__title_slug": "minimum-split-into-subarrays-with-gcd-greater-than-one", "question__hide": false, - "total_acs": 1433, - "total_submitted": 1948, + "total_acs": 1450, + "total_submitted": 1973, "frontend_question_id": 2436, "is_new_question": false }, @@ -4201,8 +4776,8 @@ "question__title": "Count Palindromic Subsequences", "question__title_slug": "count-palindromic-subsequences", "question__hide": false, - "total_acs": 5172, - "total_submitted": 15644, + "total_acs": 5276, + "total_submitted": 15864, "frontend_question_id": 2484, "is_new_question": false }, @@ -4224,8 +4799,8 @@ "question__title": "Minimum Penalty for a Shop", "question__title_slug": "minimum-penalty-for-a-shop", "question__hide": false, - "total_acs": 13286, - "total_submitted": 23886, + "total_acs": 13461, + "total_submitted": 24204, "frontend_question_id": 2483, "is_new_question": false }, @@ -4247,8 +4822,8 @@ "question__title": "Minimum Cuts to Divide a Circle", "question__title_slug": "minimum-cuts-to-divide-a-circle", "question__hide": false, - "total_acs": 21245, - "total_submitted": 40461, + "total_acs": 21504, + "total_submitted": 40939, "frontend_question_id": 2481, "is_new_question": false }, @@ -4270,8 +4845,8 @@ "question__title": "Count Subarrays With Median K", "question__title_slug": "count-subarrays-with-median-k", "question__hide": false, - "total_acs": 8671, - "total_submitted": 20219, + "total_acs": 8749, + "total_submitted": 20400, "frontend_question_id": 2488, "is_new_question": false }, @@ -4293,8 +4868,8 @@ "question__title": "Remove Nodes From Linked List", "question__title_slug": "remove-nodes-from-linked-list", "question__hide": false, - "total_acs": 29153, - "total_submitted": 43200, + "total_acs": 29890, + "total_submitted": 44430, "frontend_question_id": 2487, "is_new_question": false }, @@ -4316,8 +4891,8 @@ "question__title": "Append Characters to String to Make Subsequence", "question__title_slug": "append-characters-to-string-to-make-subsequence", "question__hide": false, - "total_acs": 21044, - "total_submitted": 33073, + "total_acs": 21414, + "total_submitted": 33607, "frontend_question_id": 2486, "is_new_question": false }, @@ -4339,8 +4914,8 @@ "question__title": "Find the Pivot Integer", "question__title_slug": "find-the-pivot-integer", "question__hide": false, - "total_acs": 35778, - "total_submitted": 44651, + "total_acs": 36461, + "total_submitted": 45559, "frontend_question_id": 2485, "is_new_question": false }, @@ -4362,8 +4937,8 @@ "question__title": "Maximize Total Tastiness of Purchased Fruits", "question__title_slug": "maximize-total-tastiness-of-purchased-fruits", "question__hide": false, - "total_acs": 1402, - "total_submitted": 2109, + "total_acs": 1432, + "total_submitted": 2161, "frontend_question_id": 2431, "is_new_question": false }, @@ -4385,8 +4960,8 @@ "question__title": "Number of Beautiful Partitions", "question__title_slug": "number-of-beautiful-partitions", "question__hide": false, - "total_acs": 7626, - "total_submitted": 25116, + "total_acs": 7696, + "total_submitted": 25329, "frontend_question_id": 2478, "is_new_question": false }, @@ -4408,8 +4983,8 @@ "question__title": "Minimum Fuel Cost to Report to the Capital", "question__title_slug": "minimum-fuel-cost-to-report-to-the-capital", "question__hide": false, - "total_acs": 54831, - "total_submitted": 81517, + "total_acs": 55131, + "total_submitted": 82044, "frontend_question_id": 2477, "is_new_question": false }, @@ -4431,8 +5006,8 @@ "question__title": "Closest Nodes Queries in a Binary Search Tree", "question__title_slug": "closest-nodes-queries-in-a-binary-search-tree", "question__hide": false, - "total_acs": 15386, - "total_submitted": 37691, + "total_acs": 15505, + "total_submitted": 37939, "frontend_question_id": 2476, "is_new_question": false }, @@ -4454,8 +5029,8 @@ "question__title": "Number of Unequal Triplets in Array", "question__title_slug": "number-of-unequal-triplets-in-array", "question__hide": false, - "total_acs": 27184, - "total_submitted": 38360, + "total_acs": 27512, + "total_submitted": 38838, "frontend_question_id": 2475, "is_new_question": false }, @@ -4477,8 +5052,8 @@ "question__title": "Merge Operations to Turn Array Into a Palindrome", "question__title_slug": "merge-operations-to-turn-array-into-a-palindrome", "question__hide": false, - "total_acs": 1353, - "total_submitted": 1941, + "total_acs": 1388, + "total_submitted": 1995, "frontend_question_id": 2422, "is_new_question": false }, @@ -4500,8 +5075,8 @@ "question__title": "Most Profitable Path in a Tree", "question__title_slug": "most-profitable-path-in-a-tree", "question__hide": false, - "total_acs": 7361, - "total_submitted": 15311, + "total_acs": 7539, + "total_submitted": 15619, "frontend_question_id": 2467, "is_new_question": false }, @@ -4523,8 +5098,8 @@ "question__title": "Split Message Based on Limit", "question__title_slug": "split-message-based-on-limit", "question__hide": false, - "total_acs": 3822, - "total_submitted": 8509, + "total_acs": 3885, + "total_submitted": 8671, "frontend_question_id": 2468, "is_new_question": false }, @@ -4546,8 +5121,8 @@ "question__title": "Count Ways To Build Good Strings", "question__title_slug": "count-ways-to-build-good-strings", "question__hide": false, - "total_acs": 11678, - "total_submitted": 27780, + "total_acs": 56781, + "total_submitted": 99275, "frontend_question_id": 2466, "is_new_question": false }, @@ -4569,8 +5144,8 @@ "question__title": "Number of Distinct Averages", "question__title_slug": "number-of-distinct-averages", "question__hide": false, - "total_acs": 27434, - "total_submitted": 47195, + "total_acs": 27881, + "total_submitted": 47926, "frontend_question_id": 2465, "is_new_question": false }, @@ -4592,8 +5167,8 @@ "question__title": "Closest Fair Integer", "question__title_slug": "closest-fair-integer", "question__hide": false, - "total_acs": 745, - "total_submitted": 1667, + "total_acs": 754, + "total_submitted": 1702, "frontend_question_id": 2417, "is_new_question": false }, @@ -4615,8 +5190,8 @@ "question__title": "Maximum Number of Non-overlapping Palindrome Substrings", "question__title_slug": "maximum-number-of-non-overlapping-palindrome-substrings", "question__hide": false, - "total_acs": 9533, - "total_submitted": 24974, + "total_acs": 9648, + "total_submitted": 25226, "frontend_question_id": 2472, "is_new_question": false }, @@ -4638,8 +5213,8 @@ "question__title": "Minimum Number of Operations to Sort a Binary Tree by Level", "question__title_slug": "minimum-number-of-operations-to-sort-a-binary-tree-by-level", "question__hide": false, - "total_acs": 16188, - "total_submitted": 26024, + "total_acs": 16316, + "total_submitted": 26225, "frontend_question_id": 2471, "is_new_question": false }, @@ -4661,8 +5236,8 @@ "question__title": "Number of Subarrays With LCM Equal to K", "question__title_slug": "number-of-subarrays-with-lcm-equal-to-k", "question__hide": false, - "total_acs": 18400, - "total_submitted": 48096, + "total_acs": 18518, + "total_submitted": 48343, "frontend_question_id": 2470, "is_new_question": false }, @@ -4684,8 +5259,8 @@ "question__title": "Convert the Temperature", "question__title_slug": "convert-the-temperature", "question__hide": false, - "total_acs": 79968, - "total_submitted": 89971, + "total_acs": 82506, + "total_submitted": 92881, "frontend_question_id": 2469, "is_new_question": false }, @@ -4707,8 +5282,8 @@ "question__title": "Design SQL", "question__title_slug": "design-sql", "question__hide": false, - "total_acs": 1371, - "total_submitted": 1649, + "total_acs": 1413, + "total_submitted": 1696, "frontend_question_id": 2408, "is_new_question": false }, @@ -4730,8 +5305,8 @@ "question__title": "Minimum Total Distance Traveled", "question__title_slug": "minimum-total-distance-traveled", "question__hide": false, - "total_acs": 6248, - "total_submitted": 15413, + "total_acs": 6295, + "total_submitted": 15550, "frontend_question_id": 2463, "is_new_question": false }, @@ -4753,8 +5328,8 @@ "question__title": "Total Cost to Hire K Workers", "question__title_slug": "total-cost-to-hire-k-workers", "question__hide": false, - "total_acs": 14618, - "total_submitted": 39116, + "total_acs": 14915, + "total_submitted": 39802, "frontend_question_id": 2462, "is_new_question": false }, @@ -4776,8 +5351,8 @@ "question__title": "Maximum Sum of Distinct Subarrays With Length K", "question__title_slug": "maximum-sum-of-distinct-subarrays-with-length-k", "question__hide": false, - "total_acs": 24669, - "total_submitted": 71768, + "total_acs": 25065, + "total_submitted": 73091, "frontend_question_id": 2461, "is_new_question": false }, @@ -4799,8 +5374,8 @@ "question__title": "Apply Operations to an Array", "question__title_slug": "apply-operations-to-an-array", "question__hide": false, - "total_acs": 37220, - "total_submitted": 55516, + "total_acs": 37787, + "total_submitted": 56348, "frontend_question_id": 2460, "is_new_question": false }, @@ -4822,8 +5397,8 @@ "question__title": "Words Within Two Edits of Dictionary", "question__title_slug": "words-within-two-edits-of-dictionary", "question__hide": false, - "total_acs": 16119, - "total_submitted": 26767, + "total_acs": 16248, + "total_submitted": 26954, "frontend_question_id": 2452, "is_new_question": false }, @@ -4845,8 +5420,8 @@ "question__title": "Next Greater Element IV", "question__title_slug": "next-greater-element-iv", "question__hide": false, - "total_acs": 6653, - "total_submitted": 17000, + "total_acs": 6737, + "total_submitted": 17232, "frontend_question_id": 2454, "is_new_question": false }, @@ -4868,8 +5443,8 @@ "question__title": "Destroy Sequential Targets", "question__title_slug": "destroy-sequential-targets", "question__hide": false, - "total_acs": 11879, - "total_submitted": 31457, + "total_acs": 11959, + "total_submitted": 31670, "frontend_question_id": 2453, "is_new_question": false }, @@ -4891,8 +5466,8 @@ "question__title": "Odd String Difference", "question__title_slug": "odd-string-difference", "question__hide": false, - "total_acs": 20932, - "total_submitted": 35138, + "total_acs": 21084, + "total_submitted": 35426, "frontend_question_id": 2451, "is_new_question": false }, @@ -4914,8 +5489,8 @@ "question__title": "Number of Subarrays With GCD Equal to K", "question__title_slug": "number-of-subarrays-with-gcd-equal-to-k", "question__hide": false, - "total_acs": 19994, - "total_submitted": 41076, + "total_acs": 20125, + "total_submitted": 41298, "frontend_question_id": 2447, "is_new_question": false }, @@ -4937,8 +5512,8 @@ "question__title": "Height of Binary Tree After Subtree Removal Queries", "question__title_slug": "height-of-binary-tree-after-subtree-removal-queries", "question__hide": false, - "total_acs": 9242, - "total_submitted": 24748, + "total_acs": 9515, + "total_submitted": 25435, "frontend_question_id": 2458, "is_new_question": false }, @@ -4960,8 +5535,8 @@ "question__title": "Minimum Addition to Make Integer Beautiful", "question__title_slug": "minimum-addition-to-make-integer-beautiful", "question__hide": false, - "total_acs": 15644, - "total_submitted": 42424, + "total_acs": 15731, + "total_submitted": 42620, "frontend_question_id": 2457, "is_new_question": false }, @@ -4983,8 +5558,8 @@ "question__title": "Most Popular Video Creator", "question__title_slug": "most-popular-video-creator", "question__hide": false, - "total_acs": 18099, - "total_submitted": 41420, + "total_acs": 18189, + "total_submitted": 41598, "frontend_question_id": 2456, "is_new_question": false }, @@ -5006,8 +5581,8 @@ "question__title": "Average Value of Even Numbers That Are Divisible by Three", "question__title_slug": "average-value-of-even-numbers-that-are-divisible-by-three", "question__hide": false, - "total_acs": 36798, - "total_submitted": 62008, + "total_acs": 37246, + "total_submitted": 62763, "frontend_question_id": 2455, "is_new_question": false }, @@ -5029,8 +5604,8 @@ "question__title": "Sum of Number and Its Reverse", "question__title_slug": "sum-of-number-and-its-reverse", "question__hide": false, - "total_acs": 28451, - "total_submitted": 62147, + "total_acs": 28858, + "total_submitted": 62804, "frontend_question_id": 2443, "is_new_question": false }, @@ -5052,8 +5627,8 @@ "question__title": "Color the Triangle Red", "question__title_slug": "color-the-triangle-red", "question__hide": false, - "total_acs": 196, - "total_submitted": 261, + "total_acs": 205, + "total_submitted": 274, "frontend_question_id": 2647, "is_new_question": false }, @@ -5075,8 +5650,8 @@ "question__title": "Minimum Number of Operations to Make Arrays Similar", "question__title_slug": "minimum-number-of-operations-to-make-arrays-similar", "question__hide": false, - "total_acs": 9380, - "total_submitted": 14812, + "total_acs": 9452, + "total_submitted": 14967, "frontend_question_id": 2449, "is_new_question": false }, @@ -5098,8 +5673,8 @@ "question__title": "Minimum Cost to Make Array Equal", "question__title_slug": "minimum-cost-to-make-array-equal", "question__hide": false, - "total_acs": 12480, - "total_submitted": 35880, + "total_acs": 12551, + "total_submitted": 36046, "frontend_question_id": 2448, "is_new_question": false }, @@ -5121,8 +5696,8 @@ "question__title": "Minimum Time to Kill All Monsters", "question__title_slug": "minimum-time-to-kill-all-monsters", "question__hide": false, - "total_acs": 892, - "total_submitted": 1669, + "total_acs": 896, + "total_submitted": 1681, "frontend_question_id": 2403, "is_new_question": false }, @@ -5144,8 +5719,8 @@ "question__title": "Determine if Two Events Have Conflict", "question__title_slug": "determine-if-two-events-have-conflict", "question__hide": false, - "total_acs": 29139, - "total_submitted": 58277, + "total_acs": 29439, + "total_submitted": 58844, "frontend_question_id": 2446, "is_new_question": false }, @@ -5167,8 +5742,8 @@ "question__title": "Count Strictly Increasing Subarrays", "question__title_slug": "count-strictly-increasing-subarrays", "question__hide": false, - "total_acs": 2406, - "total_submitted": 3307, + "total_acs": 2441, + "total_submitted": 3359, "frontend_question_id": 2393, "is_new_question": false }, @@ -5190,8 +5765,8 @@ "question__title": "Employees With Deductions", "question__title_slug": "employees-with-deductions", "question__hide": false, - "total_acs": 2115, - "total_submitted": 5100, + "total_acs": 2158, + "total_submitted": 5214, "frontend_question_id": 2394, "is_new_question": false }, @@ -5213,8 +5788,8 @@ "question__title": "Bitwise XOR of All Pairings", "question__title_slug": "bitwise-xor-of-all-pairings", "question__hide": false, - "total_acs": 14867, - "total_submitted": 25471, + "total_acs": 14994, + "total_submitted": 25681, "frontend_question_id": 2425, "is_new_question": false }, @@ -5236,8 +5811,8 @@ "question__title": "Remove Letter To Equalize Frequency", "question__title_slug": "remove-letter-to-equalize-frequency", "question__hide": false, - "total_acs": 26626, - "total_submitted": 149137, + "total_acs": 27038, + "total_submitted": 152041, "frontend_question_id": 2423, "is_new_question": false }, @@ -5259,8 +5834,8 @@ "question__title": "Create Components With Same Value", "question__title_slug": "create-components-with-same-value", "question__hide": false, - "total_acs": 4474, - "total_submitted": 8313, + "total_acs": 4503, + "total_submitted": 8376, "frontend_question_id": 2440, "is_new_question": false }, @@ -5282,8 +5857,8 @@ "question__title": "Minimize Maximum of Array", "question__title_slug": "minimize-maximum-of-array", "question__hide": false, - "total_acs": 67091, - "total_submitted": 141712, + "total_acs": 67445, + "total_submitted": 142444, "frontend_question_id": 2439, "is_new_question": false }, @@ -5305,8 +5880,8 @@ "question__title": "Range Product Queries of Powers", "question__title_slug": "range-product-queries-of-powers", "question__hide": false, - "total_acs": 13397, - "total_submitted": 34424, + "total_acs": 13458, + "total_submitted": 34527, "frontend_question_id": 2438, "is_new_question": false }, @@ -5328,8 +5903,8 @@ "question__title": "Number of Valid Clock Times", "question__title_slug": "number-of-valid-clock-times", "question__hide": false, - "total_acs": 18627, - "total_submitted": 42994, + "total_acs": 18869, + "total_submitted": 43437, "frontend_question_id": 2437, "is_new_question": false }, @@ -5351,8 +5926,8 @@ "question__title": "Count Subarrays With Fixed Bounds", "question__title_slug": "count-subarrays-with-fixed-bounds", "question__hide": false, - "total_acs": 56459, - "total_submitted": 91217, + "total_acs": 56665, + "total_submitted": 91553, "frontend_question_id": 2444, "is_new_question": false }, @@ -5374,8 +5949,8 @@ "question__title": "Longest Increasing Subsequence II", "question__title_slug": "longest-increasing-subsequence-ii", "question__hide": false, - "total_acs": 8498, - "total_submitted": 38549, + "total_acs": 8624, + "total_submitted": 38983, "frontend_question_id": 2407, "is_new_question": false }, @@ -5397,8 +5972,8 @@ "question__title": "Count Number of Distinct Integers After Reverse Operations", "question__title_slug": "count-number-of-distinct-integers-after-reverse-operations", "question__hide": false, - "total_acs": 37695, - "total_submitted": 47972, + "total_acs": 38706, + "total_submitted": 49205, "frontend_question_id": 2442, "is_new_question": false }, @@ -5420,8 +5995,8 @@ "question__title": "Largest Positive Integer That Exists With Its Negative", "question__title_slug": "largest-positive-integer-that-exists-with-its-negative", "question__hide": false, - "total_acs": 39592, - "total_submitted": 58314, + "total_acs": 40880, + "total_submitted": 60040, "frontend_question_id": 2441, "is_new_question": false }, @@ -5443,8 +6018,8 @@ "question__title": "Change Null Values in a Table to the Previous Value", "question__title_slug": "change-null-values-in-a-table-to-the-previous-value", "question__hide": false, - "total_acs": 2143, - "total_submitted": 3401, + "total_acs": 2202, + "total_submitted": 3532, "frontend_question_id": 2388, "is_new_question": false }, @@ -5466,8 +6041,8 @@ "question__title": "Median of a Row Wise Sorted Matrix", "question__title_slug": "median-of-a-row-wise-sorted-matrix", "question__hide": false, - "total_acs": 1507, - "total_submitted": 2194, + "total_acs": 1533, + "total_submitted": 2228, "frontend_question_id": 2387, "is_new_question": false }, @@ -5489,8 +6064,8 @@ "question__title": "Paths in Matrix Whose Sum Is Divisible by K", "question__title_slug": "paths-in-matrix-whose-sum-is-divisible-by-k", "question__hide": false, - "total_acs": 15834, - "total_submitted": 37950, + "total_acs": 16001, + "total_submitted": 38321, "frontend_question_id": 2435, "is_new_question": false }, @@ -5512,8 +6087,8 @@ "question__title": "Using a Robot to Print the Lexicographically Smallest String", "question__title_slug": "using-a-robot-to-print-the-lexicographically-smallest-string", "question__hide": false, - "total_acs": 14254, - "total_submitted": 37134, + "total_acs": 14357, + "total_submitted": 37350, "frontend_question_id": 2434, "is_new_question": false }, @@ -5535,8 +6110,8 @@ "question__title": "Find The Original Array of Prefix Xor", "question__title_slug": "find-the-original-array-of-prefix-xor", "question__hide": false, - "total_acs": 33389, - "total_submitted": 39145, + "total_acs": 33886, + "total_submitted": 39711, "frontend_question_id": 2433, "is_new_question": false }, @@ -5558,8 +6133,8 @@ "question__title": "The Employee That Worked on the Longest Task", "question__title_slug": "the-employee-that-worked-on-the-longest-task", "question__hide": false, - "total_acs": 27800, - "total_submitted": 56118, + "total_acs": 28066, + "total_submitted": 56546, "frontend_question_id": 2432, "is_new_question": false }, @@ -5581,8 +6156,8 @@ "question__title": "Choose Edges to Maximize Score in a Tree", "question__title_slug": "choose-edges-to-maximize-score-in-a-tree", "question__hide": false, - "total_acs": 934, - "total_submitted": 1545, + "total_acs": 950, + "total_submitted": 1571, "frontend_question_id": 2378, "is_new_question": false }, @@ -5604,8 +6179,8 @@ "question__title": "Sort the Olympic Table", "question__title_slug": "sort-the-olympic-table", "question__hide": false, - "total_acs": 3337, - "total_submitted": 4261, + "total_acs": 3401, + "total_submitted": 4360, "frontend_question_id": 2377, "is_new_question": false }, @@ -5627,8 +6202,8 @@ "question__title": "Calculate the Influence of Each Salesperson", "question__title_slug": "calculate-the-influence-of-each-salesperson", "question__hide": false, - "total_acs": 2887, - "total_submitted": 3384, + "total_acs": 2941, + "total_submitted": 3456, "frontend_question_id": 2372, "is_new_question": false }, @@ -5650,8 +6225,8 @@ "question__title": "Number of Pairs Satisfying Inequality", "question__title_slug": "number-of-pairs-satisfying-inequality", "question__hide": false, - "total_acs": 9502, - "total_submitted": 21960, + "total_acs": 9586, + "total_submitted": 22149, "frontend_question_id": 2426, "is_new_question": false }, @@ -5673,8 +6248,8 @@ "question__title": "Longest Uploaded Prefix", "question__title_slug": "longest-uploaded-prefix", "question__hide": false, - "total_acs": 15470, - "total_submitted": 28637, + "total_acs": 15607, + "total_submitted": 28856, "frontend_question_id": 2424, "is_new_question": false }, @@ -5696,8 +6271,8 @@ "question__title": "Partition String Into Substrings With Values at Most K", "question__title_slug": "partition-string-into-substrings-with-values-at-most-k", "question__hide": false, - "total_acs": 16102, - "total_submitted": 34578, + "total_acs": 16212, + "total_submitted": 34792, "frontend_question_id": 2522, "is_new_question": false }, @@ -5719,8 +6294,8 @@ "question__title": "Maximum Deletions on a String", "question__title_slug": "maximum-deletions-on-a-string", "question__hide": false, - "total_acs": 10499, - "total_submitted": 32843, + "total_acs": 10552, + "total_submitted": 33013, "frontend_question_id": 2430, "is_new_question": false }, @@ -5742,8 +6317,8 @@ "question__title": "Minimize XOR", "question__title_slug": "minimize-xor", "question__hide": false, - "total_acs": 17901, - "total_submitted": 42059, + "total_acs": 18000, + "total_submitted": 42216, "frontend_question_id": 2429, "is_new_question": false }, @@ -5765,8 +6340,8 @@ "question__title": "Maximum Sum of an Hourglass", "question__title_slug": "maximum-sum-of-an-hourglass", "question__hide": false, - "total_acs": 28113, - "total_submitted": 37815, + "total_acs": 28368, + "total_submitted": 38193, "frontend_question_id": 2428, "is_new_question": false }, @@ -5788,8 +6363,8 @@ "question__title": "Number of Common Factors", "question__title_slug": "number-of-common-factors", "question__hide": false, - "total_acs": 49080, - "total_submitted": 61791, + "total_acs": 50027, + "total_submitted": 63004, "frontend_question_id": 2427, "is_new_question": false }, @@ -5811,8 +6386,8 @@ "question__title": "Minimize Maximum Value in a Grid", "question__title_slug": "minimize-maximum-value-in-a-grid", "question__hide": false, - "total_acs": 990, - "total_submitted": 1391, + "total_acs": 1045, + "total_submitted": 1478, "frontend_question_id": 2371, "is_new_question": false }, @@ -5834,8 +6409,8 @@ "question__title": "Number of Good Paths", "question__title_slug": "number-of-good-paths", "question__hide": false, - "total_acs": 48595, - "total_submitted": 84748, + "total_acs": 48783, + "total_submitted": 85154, "frontend_question_id": 2421, "is_new_question": false }, @@ -5857,8 +6432,8 @@ "question__title": "Find All Good Indices", "question__title_slug": "find-all-good-indices", "question__hide": false, - "total_acs": 18607, - "total_submitted": 49532, + "total_acs": 18734, + "total_submitted": 49812, "frontend_question_id": 2420, "is_new_question": false }, @@ -5880,8 +6455,8 @@ "question__title": "Longest Subarray With Maximum Bitwise AND", "question__title_slug": "longest-subarray-with-maximum-bitwise-and", "question__hide": false, - "total_acs": 21800, - "total_submitted": 45336, + "total_acs": 21943, + "total_submitted": 45591, "frontend_question_id": 2419, "is_new_question": false }, @@ -5903,8 +6478,8 @@ "question__title": "Sort the People", "question__title_slug": "sort-the-people", "question__hide": false, - "total_acs": 74022, - "total_submitted": 91732, + "total_acs": 75630, + "total_submitted": 93888, "frontend_question_id": 2418, "is_new_question": false }, @@ -5926,8 +6501,8 @@ "question__title": "Generate the Invoice", "question__title_slug": "generate-the-invoice", "question__hide": false, - "total_acs": 1761, - "total_submitted": 2255, + "total_acs": 1809, + "total_submitted": 2308, "frontend_question_id": 2362, "is_new_question": false }, @@ -5949,8 +6524,8 @@ "question__title": "Minimum Costs Using the Train Line", "question__title_slug": "minimum-costs-using-the-train-line", "question__hide": false, - "total_acs": 4440, - "total_submitted": 5868, + "total_acs": 4539, + "total_submitted": 5976, "frontend_question_id": 2361, "is_new_question": false }, @@ -5972,8 +6547,8 @@ "question__title": "Minimum Money Required Before Transactions", "question__title_slug": "minimum-money-required-before-transactions", "question__hide": false, - "total_acs": 8594, - "total_submitted": 21759, + "total_acs": 8692, + "total_submitted": 21993, "frontend_question_id": 2412, "is_new_question": false }, @@ -5995,8 +6570,8 @@ "question__title": "Smallest Subarrays With Maximum Bitwise OR", "question__title_slug": "smallest-subarrays-with-maximum-bitwise-or", "question__hide": false, - "total_acs": 9743, - "total_submitted": 23358, + "total_acs": 9821, + "total_submitted": 23503, "frontend_question_id": 2411, "is_new_question": false }, @@ -6018,8 +6593,8 @@ "question__title": "Maximum Matching of Players With Trainers", "question__title_slug": "maximum-matching-of-players-with-trainers", "question__hide": false, - "total_acs": 24393, - "total_submitted": 39871, + "total_acs": 24596, + "total_submitted": 40170, "frontend_question_id": 2410, "is_new_question": false }, @@ -6041,8 +6616,8 @@ "question__title": "Count Days Spent Together", "question__title_slug": "count-days-spent-together", "question__hide": false, - "total_acs": 17511, - "total_submitted": 39925, + "total_acs": 17626, + "total_submitted": 40165, "frontend_question_id": 2409, "is_new_question": false }, @@ -6064,8 +6639,8 @@ "question__title": "Number of Unique Subjects Taught by Each Teacher", "question__title_slug": "number-of-unique-subjects-taught-by-each-teacher", "question__hide": false, - "total_acs": 8437, - "total_submitted": 9507, + "total_acs": 9963, + "total_submitted": 11261, "frontend_question_id": 2356, "is_new_question": false }, @@ -6087,8 +6662,8 @@ "question__title": "Sum of Prefix Scores of Strings", "question__title_slug": "sum-of-prefix-scores-of-strings", "question__hide": false, - "total_acs": 20142, - "total_submitted": 45920, + "total_acs": 20275, + "total_submitted": 46218, "frontend_question_id": 2416, "is_new_question": false }, @@ -6110,8 +6685,8 @@ "question__title": "Reverse Odd Levels of Binary Tree", "question__title_slug": "reverse-odd-levels-of-binary-tree", "question__hide": false, - "total_acs": 33740, - "total_submitted": 43856, + "total_acs": 34289, + "total_submitted": 44562, "frontend_question_id": 2415, "is_new_question": false }, @@ -6133,8 +6708,8 @@ "question__title": "Length of the Longest Alphabetical Continuous Substring", "question__title_slug": "length-of-the-longest-alphabetical-continuous-substring", "question__hide": false, - "total_acs": 33208, - "total_submitted": 58974, + "total_acs": 34525, + "total_submitted": 60960, "frontend_question_id": 2414, "is_new_question": false }, @@ -6156,8 +6731,8 @@ "question__title": "Smallest Even Multiple", "question__title_slug": "smallest-even-multiple", "question__hide": false, - "total_acs": 85937, - "total_submitted": 98018, + "total_acs": 88303, + "total_submitted": 100735, "frontend_question_id": 2413, "is_new_question": false }, @@ -6179,8 +6754,8 @@ "question__title": "Maximum Number of Books You Can Take", "question__title_slug": "maximum-number-of-books-you-can-take", "question__hide": false, - "total_acs": 4280, - "total_submitted": 9724, + "total_acs": 4320, + "total_submitted": 9808, "frontend_question_id": 2355, "is_new_question": false }, @@ -6202,8 +6777,8 @@ "question__title": "Sort Array by Moving Items to Empty Space", "question__title_slug": "sort-array-by-moving-items-to-empty-space", "question__hide": false, - "total_acs": 508, - "total_submitted": 970, + "total_acs": 534, + "total_submitted": 1041, "frontend_question_id": 2459, "is_new_question": false }, @@ -6225,8 +6800,8 @@ "question__title": "Divide Intervals Into Minimum Number of Groups", "question__title_slug": "divide-intervals-into-minimum-number-of-groups", "question__hide": false, - "total_acs": 21412, - "total_submitted": 46476, + "total_acs": 21562, + "total_submitted": 46737, "frontend_question_id": 2406, "is_new_question": false }, @@ -6248,8 +6823,8 @@ "question__title": "Optimal Partition of String", "question__title_slug": "optimal-partition-of-string", "question__hide": false, - "total_acs": 111842, - "total_submitted": 139684, + "total_acs": 112586, + "total_submitted": 140693, "frontend_question_id": 2405, "is_new_question": false }, @@ -6271,8 +6846,8 @@ "question__title": "Most Frequent Even Element", "question__title_slug": "most-frequent-even-element", "question__hide": false, - "total_acs": 49001, - "total_submitted": 96293, + "total_acs": 49705, + "total_submitted": 97729, "frontend_question_id": 2404, "is_new_question": false }, @@ -6294,8 +6869,8 @@ "question__title": "Finding the Number of Visible Mountains", "question__title_slug": "finding-the-number-of-visible-mountains", "question__hide": false, - "total_acs": 3538, - "total_submitted": 8391, + "total_acs": 3621, + "total_submitted": 8624, "frontend_question_id": 2345, "is_new_question": false }, @@ -6317,8 +6892,8 @@ "question__title": "Compute the Rank as a Percentage", "question__title_slug": "compute-the-rank-as-a-percentage", "question__hide": false, - "total_acs": 2516, - "total_submitted": 7584, + "total_acs": 2568, + "total_submitted": 7733, "frontend_question_id": 2346, "is_new_question": false }, @@ -6340,8 +6915,8 @@ "question__title": "Task Scheduler II", "question__title_slug": "task-scheduler-ii", "question__hide": false, - "total_acs": 18166, - "total_submitted": 38780, + "total_acs": 18301, + "total_submitted": 39031, "frontend_question_id": 2365, "is_new_question": false }, @@ -6363,8 +6938,8 @@ "question__title": "Maximum Rows Covered by Columns", "question__title_slug": "maximum-rows-covered-by-columns", "question__hide": false, - "total_acs": 12177, - "total_submitted": 22818, + "total_acs": 12234, + "total_submitted": 22902, "frontend_question_id": 2397, "is_new_question": false }, @@ -6386,8 +6961,8 @@ "question__title": "Strictly Palindromic Number", "question__title_slug": "strictly-palindromic-number", "question__hide": false, - "total_acs": 50793, - "total_submitted": 57972, + "total_acs": 51746, + "total_submitted": 59068, "frontend_question_id": 2396, "is_new_question": false }, @@ -6409,8 +6984,8 @@ "question__title": "Find Subarrays With Equal Sum", "question__title_slug": "find-subarrays-with-equal-sum", "question__hide": false, - "total_acs": 35785, - "total_submitted": 55602, + "total_acs": 36102, + "total_submitted": 56123, "frontend_question_id": 2395, "is_new_question": false }, @@ -6432,8 +7007,8 @@ "question__title": "Meeting Rooms III", "question__title_slug": "meeting-rooms-iii", "question__hide": false, - "total_acs": 17475, - "total_submitted": 52258, + "total_acs": 18151, + "total_submitted": 54318, "frontend_question_id": 2402, "is_new_question": false }, @@ -6455,8 +7030,8 @@ "question__title": "Longest Nice Subarray", "question__title_slug": "longest-nice-subarray", "question__hide": false, - "total_acs": 21141, - "total_submitted": 42846, + "total_acs": 21334, + "total_submitted": 43288, "frontend_question_id": 2401, "is_new_question": false }, @@ -6478,8 +7053,8 @@ "question__title": "Number of Ways to Reach a Position After Exactly k Steps", "question__title_slug": "number-of-ways-to-reach-a-position-after-exactly-k-steps", "question__hide": false, - "total_acs": 21699, - "total_submitted": 65659, + "total_acs": 21813, + "total_submitted": 65987, "frontend_question_id": 2400, "is_new_question": false }, @@ -6501,8 +7076,8 @@ "question__title": "Check Distances Between Same Letters", "question__title_slug": "check-distances-between-same-letters", "question__hide": false, - "total_acs": 35810, - "total_submitted": 50637, + "total_acs": 36116, + "total_submitted": 51100, "frontend_question_id": 2399, "is_new_question": false }, @@ -6524,8 +7099,8 @@ "question__title": "Largest Palindromic Number", "question__title_slug": "largest-palindromic-number", "question__hide": false, - "total_acs": 20974, - "total_submitted": 66915, + "total_acs": 21112, + "total_submitted": 67314, "frontend_question_id": 2384, "is_new_question": false }, @@ -6547,8 +7122,8 @@ "question__title": "Minimum Adjacent Swaps to Make a Valid Array", "question__title_slug": "minimum-adjacent-swaps-to-make-a-valid-array", "question__hide": false, - "total_acs": 6807, - "total_submitted": 9103, + "total_acs": 6867, + "total_submitted": 9185, "frontend_question_id": 2340, "is_new_question": false }, @@ -6570,8 +7145,8 @@ "question__title": "Max Sum of a Pair With Equal Sum of Digits", "question__title_slug": "max-sum-of-a-pair-with-equal-sum-of-digits", "question__hide": false, - "total_acs": 32909, - "total_submitted": 61885, + "total_acs": 33161, + "total_submitted": 62329, "frontend_question_id": 2342, "is_new_question": false }, @@ -6593,8 +7168,8 @@ "question__title": "Build a Matrix With Conditions", "question__title_slug": "build-a-matrix-with-conditions", "question__hide": false, - "total_acs": 11259, - "total_submitted": 18908, + "total_acs": 11341, + "total_submitted": 19028, "frontend_question_id": 2392, "is_new_question": false }, @@ -6616,8 +7191,8 @@ "question__title": "Minimum Amount of Time to Collect Garbage", "question__title_slug": "minimum-amount-of-time-to-collect-garbage", "question__hide": false, - "total_acs": 34425, - "total_submitted": 40994, + "total_acs": 34872, + "total_submitted": 41604, "frontend_question_id": 2391, "is_new_question": false }, @@ -6639,8 +7214,8 @@ "question__title": "Removing Stars From a String", "question__title_slug": "removing-stars-from-a-string", "question__hide": false, - "total_acs": 124312, - "total_submitted": 171591, + "total_acs": 126118, + "total_submitted": 173900, "frontend_question_id": 2390, "is_new_question": false }, @@ -6662,8 +7237,8 @@ "question__title": "Longest Subsequence With Limited Sum", "question__title_slug": "longest-subsequence-with-limited-sum", "question__hide": false, - "total_acs": 81794, - "total_submitted": 113113, + "total_acs": 82387, + "total_submitted": 113958, "frontend_question_id": 2389, "is_new_question": false }, @@ -6685,8 +7260,8 @@ "question__title": "Valid Palindrome IV", "question__title_slug": "valid-palindrome-iv", "question__hide": false, - "total_acs": 2837, - "total_submitted": 3733, + "total_acs": 2893, + "total_submitted": 3807, "frontend_question_id": 2330, "is_new_question": false }, @@ -6708,8 +7283,8 @@ "question__title": "Maximum Segment Sum After Removals", "question__title_slug": "maximum-segment-sum-after-removals", "question__hide": false, - "total_acs": 6543, - "total_submitted": 13721, + "total_acs": 6668, + "total_submitted": 13885, "frontend_question_id": 2382, "is_new_question": false }, @@ -6731,8 +7306,8 @@ "question__title": "Shifting Letters II", "question__title_slug": "shifting-letters-ii", "question__hide": false, - "total_acs": 15198, - "total_submitted": 42988, + "total_acs": 15320, + "total_submitted": 43239, "frontend_question_id": 2381, "is_new_question": false }, @@ -6754,8 +7329,8 @@ "question__title": "Time Needed to Rearrange a Binary String", "question__title_slug": "time-needed-to-rearrange-a-binary-string", "question__hide": false, - "total_acs": 22924, - "total_submitted": 46733, + "total_acs": 23157, + "total_submitted": 47190, "frontend_question_id": 2380, "is_new_question": false }, @@ -6777,8 +7352,8 @@ "question__title": "Minimum Recolors to Get K Consecutive Black Blocks", "question__title_slug": "minimum-recolors-to-get-k-consecutive-black-blocks", "question__hide": false, - "total_acs": 33376, - "total_submitted": 57782, + "total_acs": 34263, + "total_submitted": 59192, "frontend_question_id": 2379, "is_new_question": false }, @@ -6800,8 +7375,8 @@ "question__title": "Find the K-Sum of an Array", "question__title_slug": "find-the-k-sum-of-an-array", "question__hide": false, - "total_acs": 7135, - "total_submitted": 18720, + "total_acs": 7182, + "total_submitted": 18841, "frontend_question_id": 2386, "is_new_question": false }, @@ -6823,8 +7398,8 @@ "question__title": "Amount of Time for Binary Tree to Be Infected", "question__title_slug": "amount-of-time-for-binary-tree-to-be-infected", "question__hide": false, - "total_acs": 24458, - "total_submitted": 43090, + "total_acs": 24715, + "total_submitted": 43472, "frontend_question_id": 2385, "is_new_question": false }, @@ -6846,8 +7421,8 @@ "question__title": "Minimum Hours of Training to Win a Competition", "question__title_slug": "minimum-hours-of-training-to-win-a-competition", "question__hide": false, - "total_acs": 25940, - "total_submitted": 63249, + "total_acs": 26100, + "total_submitted": 63622, "frontend_question_id": 2383, "is_new_question": false }, @@ -6869,8 +7444,8 @@ "question__title": "Find Minimum Time to Finish All Jobs II", "question__title_slug": "find-minimum-time-to-finish-all-jobs-ii", "question__hide": false, - "total_acs": 1718, - "total_submitted": 2311, + "total_acs": 1763, + "total_submitted": 2375, "frontend_question_id": 2323, "is_new_question": false }, @@ -6892,8 +7467,8 @@ "question__title": "Count Special Integers", "question__title_slug": "count-special-integers", "question__hide": false, - "total_acs": 8850, - "total_submitted": 24291, + "total_acs": 8919, + "total_submitted": 24459, "frontend_question_id": 2376, "is_new_question": false }, @@ -6915,8 +7490,8 @@ "question__title": "Construct Smallest Number From DI String", "question__title_slug": "construct-smallest-number-from-di-string", "question__hide": false, - "total_acs": 22576, - "total_submitted": 30340, + "total_acs": 22762, + "total_submitted": 30584, "frontend_question_id": 2375, "is_new_question": false }, @@ -6938,8 +7513,8 @@ "question__title": "Node With Highest Edge Score", "question__title_slug": "node-with-highest-edge-score", "question__hide": false, - "total_acs": 26186, - "total_submitted": 56255, + "total_acs": 26352, + "total_submitted": 56600, "frontend_question_id": 2374, "is_new_question": false }, @@ -6961,8 +7536,8 @@ "question__title": "Largest Local Values in a Matrix", "question__title_slug": "largest-local-values-in-a-matrix", "question__hide": false, - "total_acs": 36333, - "total_submitted": 43599, + "total_acs": 36779, + "total_submitted": 44189, "frontend_question_id": 2373, "is_new_question": false }, @@ -6984,8 +7559,8 @@ "question__title": "All the Matches of the League", "question__title_slug": "all-the-matches-of-the-league", "question__hide": false, - "total_acs": 4492, - "total_submitted": 5106, + "total_acs": 4578, + "total_submitted": 5221, "frontend_question_id": 2339, "is_new_question": false }, @@ -7007,8 +7582,8 @@ "question__title": "Product Sales Analysis V", "question__title_slug": "product-sales-analysis-v", "question__hide": false, - "total_acs": 4141, - "total_submitted": 6044, + "total_acs": 4225, + "total_submitted": 6186, "frontend_question_id": 2329, "is_new_question": false }, @@ -7030,8 +7605,8 @@ "question__title": "Product Sales Analysis IV", "question__title_slug": "product-sales-analysis-iv", "question__hide": false, - "total_acs": 3800, - "total_submitted": 4977, + "total_acs": 3859, + "total_submitted": 5066, "frontend_question_id": 2324, "is_new_question": false }, @@ -7053,8 +7628,8 @@ "question__title": "Minimum Replacements to Sort the Array", "question__title_slug": "minimum-replacements-to-sort-the-array", "question__hide": false, - "total_acs": 9886, - "total_submitted": 24151, + "total_acs": 9967, + "total_submitted": 24351, "frontend_question_id": 2366, "is_new_question": false }, @@ -7076,8 +7651,8 @@ "question__title": "Maximum Number of Robots Within Budget", "question__title_slug": "maximum-number-of-robots-within-budget", "question__hide": false, - "total_acs": 15294, - "total_submitted": 46187, + "total_acs": 15410, + "total_submitted": 46588, "frontend_question_id": 2398, "is_new_question": false }, @@ -7099,8 +7674,8 @@ "question__title": "Count Number of Bad Pairs", "question__title_slug": "count-number-of-bad-pairs", "question__hide": false, - "total_acs": 23237, - "total_submitted": 56664, + "total_acs": 23391, + "total_submitted": 57039, "frontend_question_id": 2364, "is_new_question": false }, @@ -7122,8 +7697,8 @@ "question__title": "Merge Similar Items", "question__title_slug": "merge-similar-items", "question__hide": false, - "total_acs": 37122, - "total_submitted": 49114, + "total_acs": 37564, + "total_submitted": 49766, "frontend_question_id": 2363, "is_new_question": false }, @@ -7145,8 +7720,8 @@ "question__title": "The First Day of the Maximum Recorded Degree in Each City", "question__title_slug": "the-first-day-of-the-maximum-recorded-degree-in-each-city", "question__hide": false, - "total_acs": 3127, - "total_submitted": 4302, + "total_acs": 3180, + "total_submitted": 4376, "frontend_question_id": 2314, "is_new_question": false }, @@ -7168,8 +7743,8 @@ "question__title": "Reachable Nodes With Restrictions", "question__title_slug": "reachable-nodes-with-restrictions", "question__hide": false, - "total_acs": 33151, - "total_submitted": 57511, + "total_acs": 33511, + "total_submitted": 58066, "frontend_question_id": 2368, "is_new_question": false }, @@ -7191,8 +7766,8 @@ "question__title": "Longest Ideal Subsequence", "question__title_slug": "longest-ideal-subsequence", "question__hide": false, - "total_acs": 19102, - "total_submitted": 50799, + "total_acs": 19258, + "total_submitted": 51179, "frontend_question_id": 2370, "is_new_question": false }, @@ -7214,8 +7789,8 @@ "question__title": "Check if There is a Valid Partition For The Array", "question__title_slug": "check-if-there-is-a-valid-partition-for-the-array", "question__hide": false, - "total_acs": 19397, - "total_submitted": 48253, + "total_acs": 19492, + "total_submitted": 48581, "frontend_question_id": 2369, "is_new_question": false }, @@ -7237,8 +7812,8 @@ "question__title": "Number of Arithmetic Triplets", "question__title_slug": "number-of-arithmetic-triplets", "question__hide": false, - "total_acs": 71496, - "total_submitted": 85541, + "total_acs": 72747, + "total_submitted": 87067, "frontend_question_id": 2367, "is_new_question": false }, @@ -7260,8 +7835,8 @@ "question__title": "Arrange Table by Gender", "question__title_slug": "arrange-table-by-gender", "question__hide": false, - "total_acs": 3400, - "total_submitted": 4775, + "total_acs": 3473, + "total_submitted": 4909, "frontend_question_id": 2308, "is_new_question": false }, @@ -7283,8 +7858,8 @@ "question__title": "Tasks Count in the Weekend", "question__title_slug": "tasks-count-in-the-weekend", "question__hide": false, - "total_acs": 3663, - "total_submitted": 4380, + "total_acs": 3725, + "total_submitted": 4472, "frontend_question_id": 2298, "is_new_question": false }, @@ -7306,8 +7881,8 @@ "question__title": "Longest Cycle in a Graph", "question__title_slug": "longest-cycle-in-a-graph", "question__hide": false, - "total_acs": 62188, - "total_submitted": 122770, + "total_acs": 62511, + "total_submitted": 123420, "frontend_question_id": 2360, "is_new_question": false }, @@ -7329,8 +7904,8 @@ "question__title": "Find Closest Node to Given Two Nodes", "question__title_slug": "find-closest-node-to-given-two-nodes", "question__hide": false, - "total_acs": 67138, - "total_submitted": 145663, + "total_acs": 67351, + "total_submitted": 146241, "frontend_question_id": 2359, "is_new_question": false }, @@ -7352,8 +7927,8 @@ "question__title": "Maximum Number of Groups Entering a Competition", "question__title_slug": "maximum-number-of-groups-entering-a-competition", "question__hide": false, - "total_acs": 29518, - "total_submitted": 43691, + "total_acs": 29680, + "total_submitted": 43916, "frontend_question_id": 2358, "is_new_question": false }, @@ -7375,8 +7950,8 @@ "question__title": "Make Array Zero by Subtracting Equal Amounts", "question__title_slug": "make-array-zero-by-subtracting-equal-amounts", "question__hide": false, - "total_acs": 66831, - "total_submitted": 92258, + "total_acs": 67691, + "total_submitted": 93463, "frontend_question_id": 2357, "is_new_question": false }, @@ -7398,8 +7973,8 @@ "question__title": "Shortest Impossible Sequence of Rolls", "question__title_slug": "shortest-impossible-sequence-of-rolls", "question__hide": false, - "total_acs": 11937, - "total_submitted": 17561, + "total_acs": 12025, + "total_submitted": 17669, "frontend_question_id": 2350, "is_new_question": false }, @@ -7421,8 +7996,8 @@ "question__title": "Design a Number Container System", "question__title_slug": "design-a-number-container-system", "question__hide": false, - "total_acs": 18865, - "total_submitted": 41522, + "total_acs": 18947, + "total_submitted": 41731, "frontend_question_id": 2349, "is_new_question": false }, @@ -7444,8 +8019,8 @@ "question__title": "Best Poker Hand", "question__title_slug": "best-poker-hand", "question__hide": false, - "total_acs": 31967, - "total_submitted": 52828, + "total_acs": 32380, + "total_submitted": 53441, "frontend_question_id": 2347, "is_new_question": false }, @@ -7467,8 +8042,8 @@ "question__title": "Number of Zero-Filled Subarrays", "question__title_slug": "number-of-zero-filled-subarrays", "question__hide": false, - "total_acs": 106258, - "total_submitted": 159210, + "total_acs": 106590, + "total_submitted": 159680, "frontend_question_id": 2348, "is_new_question": false }, @@ -7490,8 +8065,8 @@ "question__title": "Products With Three or More Orders in Two Consecutive Years", "question__title_slug": "products-with-three-or-more-orders-in-two-consecutive-years", "question__hide": false, - "total_acs": 4003, - "total_submitted": 10406, + "total_acs": 4075, + "total_submitted": 10589, "frontend_question_id": 2292, "is_new_question": false }, @@ -7513,8 +8088,8 @@ "question__title": "Number of Excellent Pairs", "question__title_slug": "number-of-excellent-pairs", "question__hide": false, - "total_acs": 12044, - "total_submitted": 26236, + "total_acs": 12094, + "total_submitted": 26353, "frontend_question_id": 2354, "is_new_question": false }, @@ -7536,8 +8111,8 @@ "question__title": "Design a Food Rating System", "question__title_slug": "design-a-food-rating-system", "question__hide": false, - "total_acs": 16507, - "total_submitted": 47692, + "total_acs": 16590, + "total_submitted": 48035, "frontend_question_id": 2353, "is_new_question": false }, @@ -7553,14 +8128,14 @@ { "stat": { "question_id": 2428, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "equal-row-and-column-pairs", + "question__article__has_video_solution": false, "question__title": "Equal Row and Column Pairs", "question__title_slug": "equal-row-and-column-pairs", "question__hide": false, - "total_acs": 35173, - "total_submitted": 49836, + "total_acs": 36206, + "total_submitted": 51294, "frontend_question_id": 2352, "is_new_question": false }, @@ -7582,8 +8157,8 @@ "question__title": "First Letter to Appear Twice", "question__title_slug": "first-letter-to-appear-twice", "question__hide": false, - "total_acs": 71839, - "total_submitted": 96337, + "total_acs": 72750, + "total_submitted": 97810, "frontend_question_id": 2351, "is_new_question": false }, @@ -7605,8 +8180,8 @@ "question__title": "Maximum Profit From Trading Stocks", "question__title_slug": "maximum-profit-from-trading-stocks", "question__hide": false, - "total_acs": 3652, - "total_submitted": 8125, + "total_acs": 3720, + "total_submitted": 8271, "frontend_question_id": 2291, "is_new_question": false }, @@ -7628,8 +8203,8 @@ "question__title": "Number of People That Can Be Seen in a Grid", "question__title_slug": "number-of-people-that-can-be-seen-in-a-grid", "question__hide": false, - "total_acs": 1174, - "total_submitted": 2378, + "total_acs": 1177, + "total_submitted": 2382, "frontend_question_id": 2282, "is_new_question": false }, @@ -7651,8 +8226,8 @@ "question__title": "Minimum Deletions to Make Array Divisible", "question__title_slug": "minimum-deletions-to-make-array-divisible", "question__hide": false, - "total_acs": 23517, - "total_submitted": 41465, + "total_acs": 23668, + "total_submitted": 41801, "frontend_question_id": 2344, "is_new_question": false }, @@ -7674,8 +8249,8 @@ "question__title": "Query Kth Smallest Trimmed Number", "question__title_slug": "query-kth-smallest-trimmed-number", "question__hide": false, - "total_acs": 21293, - "total_submitted": 51464, + "total_acs": 21429, + "total_submitted": 51702, "frontend_question_id": 2343, "is_new_question": false }, @@ -7697,8 +8272,8 @@ "question__title": "Maximum Number of Pairs in Array", "question__title_slug": "maximum-number-of-pairs-in-array", "question__hide": false, - "total_acs": 48873, - "total_submitted": 64466, + "total_acs": 49375, + "total_submitted": 65144, "frontend_question_id": 2341, "is_new_question": false }, @@ -7720,8 +8295,8 @@ "question__title": "Closest Node to Path in Tree", "question__title_slug": "closest-node-to-path-in-tree", "question__hide": false, - "total_acs": 2582, - "total_submitted": 4044, + "total_acs": 2666, + "total_submitted": 4169, "frontend_question_id": 2277, "is_new_question": false }, @@ -7743,8 +8318,8 @@ "question__title": "Subarray With Elements Greater Than Varying Threshold", "question__title_slug": "subarray-with-elements-greater-than-varying-threshold", "question__hide": false, - "total_acs": 6189, - "total_submitted": 14981, + "total_acs": 6255, + "total_submitted": 15152, "frontend_question_id": 2334, "is_new_question": false }, @@ -7766,8 +8341,8 @@ "question__title": "Minimum Sum of Squared Difference", "question__title_slug": "minimum-sum-of-squared-difference", "question__hide": false, - "total_acs": 11316, - "total_submitted": 44461, + "total_acs": 11385, + "total_submitted": 44715, "frontend_question_id": 2333, "is_new_question": false }, @@ -7789,8 +8364,8 @@ "question__title": "The Latest Time to Catch a Bus", "question__title_slug": "the-latest-time-to-catch-a-bus", "question__hide": false, - "total_acs": 14261, - "total_submitted": 59913, + "total_acs": 14722, + "total_submitted": 61321, "frontend_question_id": 2332, "is_new_question": false }, @@ -7812,8 +8387,8 @@ "question__title": "Evaluate Boolean Binary Tree", "question__title_slug": "evaluate-boolean-binary-tree", "question__hide": false, - "total_acs": 46500, - "total_submitted": 59333, + "total_acs": 47070, + "total_submitted": 60071, "frontend_question_id": 2331, "is_new_question": false }, @@ -7835,8 +8410,8 @@ "question__title": "Count the Number of Ideal Arrays", "question__title_slug": "count-the-number-of-ideal-arrays", "question__hide": false, - "total_acs": 4886, - "total_submitted": 18606, + "total_acs": 4932, + "total_submitted": 18786, "frontend_question_id": 2338, "is_new_question": false }, @@ -7858,8 +8433,8 @@ "question__title": "Move Pieces to Obtain a String", "question__title_slug": "move-pieces-to-obtain-a-string", "question__hide": false, - "total_acs": 21539, - "total_submitted": 45116, + "total_acs": 21642, + "total_submitted": 45356, "frontend_question_id": 2337, "is_new_question": false }, @@ -7881,8 +8456,8 @@ "question__title": "Smallest Number in Infinite Set", "question__title_slug": "smallest-number-in-infinite-set", "question__hide": false, - "total_acs": 84807, - "total_submitted": 112832, + "total_acs": 85460, + "total_submitted": 113807, "frontend_question_id": 2336, "is_new_question": false }, @@ -7904,8 +8479,8 @@ "question__title": "Minimum Amount of Time to Fill Cups", "question__title_slug": "minimum-amount-of-time-to-fill-cups", "question__hide": false, - "total_acs": 35019, - "total_submitted": 61994, + "total_acs": 35361, + "total_submitted": 62527, "frontend_question_id": 2335, "is_new_question": false }, @@ -7927,8 +8502,8 @@ "question__title": "Spiral Matrix IV", "question__title_slug": "spiral-matrix-iv", "question__hide": false, - "total_acs": 27231, - "total_submitted": 36486, + "total_acs": 28420, + "total_submitted": 37915, "frontend_question_id": 2326, "is_new_question": false }, @@ -7950,8 +8525,8 @@ "question__title": "Number of Increasing Paths in a Grid", "question__title_slug": "number-of-increasing-paths-in-a-grid", "question__hide": false, - "total_acs": 17240, - "total_submitted": 36179, + "total_acs": 17380, + "total_submitted": 36472, "frontend_question_id": 2328, "is_new_question": false }, @@ -7973,8 +8548,8 @@ "question__title": "Number of People Aware of a Secret", "question__title_slug": "number-of-people-aware-of-a-secret", "question__hide": false, - "total_acs": 17396, - "total_submitted": 38707, + "total_acs": 17463, + "total_submitted": 38847, "frontend_question_id": 2327, "is_new_question": false }, @@ -7996,8 +8571,8 @@ "question__title": "Decode the Message", "question__title_slug": "decode-the-message", "question__hide": false, - "total_acs": 57719, - "total_submitted": 68354, + "total_acs": 58532, + "total_submitted": 69475, "frontend_question_id": 2325, "is_new_question": false }, @@ -8019,8 +8594,8 @@ "question__title": "Minimum Number of Keypresses", "question__title_slug": "minimum-number-of-keypresses", "question__hide": false, - "total_acs": 11403, - "total_submitted": 15657, + "total_acs": 11620, + "total_submitted": 15981, "frontend_question_id": 2268, "is_new_question": false }, @@ -8042,8 +8617,8 @@ "question__title": "Number of Distinct Roll Sequences", "question__title_slug": "number-of-distinct-roll-sequences", "question__hide": false, - "total_acs": 8648, - "total_submitted": 15414, + "total_acs": 8682, + "total_submitted": 15477, "frontend_question_id": 2318, "is_new_question": false }, @@ -8065,8 +8640,8 @@ "question__title": "Count Unreachable Pairs of Nodes in an Undirected Graph", "question__title_slug": "count-unreachable-pairs-of-nodes-in-an-undirected-graph", "question__hide": false, - "total_acs": 72277, - "total_submitted": 142637, + "total_acs": 72468, + "total_submitted": 143169, "frontend_question_id": 2316, "is_new_question": false }, @@ -8088,8 +8663,8 @@ "question__title": "Maximum XOR After Operations ", "question__title_slug": "maximum-xor-after-operations", "question__hide": false, - "total_acs": 17878, - "total_submitted": 22567, + "total_acs": 18035, + "total_submitted": 22778, "frontend_question_id": 2317, "is_new_question": false }, @@ -8111,8 +8686,8 @@ "question__title": "Count Asterisks", "question__title_slug": "count-asterisks", "question__hide": false, - "total_acs": 45318, - "total_submitted": 55217, + "total_acs": 45916, + "total_submitted": 56016, "frontend_question_id": 2315, "is_new_question": false }, @@ -8134,8 +8709,8 @@ "question__title": "Minimum Score After Removals on a Tree", "question__title_slug": "minimum-score-after-removals-on-a-tree", "question__hide": false, - "total_acs": 5547, - "total_submitted": 10939, + "total_acs": 5571, + "total_submitted": 10982, "frontend_question_id": 2322, "is_new_question": false }, @@ -8157,8 +8732,8 @@ "question__title": "Minimum Flips in Binary Tree to Get Result", "question__title_slug": "minimum-flips-in-binary-tree-to-get-result", "question__hide": false, - "total_acs": 1098, - "total_submitted": 1746, + "total_acs": 1148, + "total_submitted": 1859, "frontend_question_id": 2313, "is_new_question": false }, @@ -8180,8 +8755,8 @@ "question__title": "Check if Matrix Is X-Matrix", "question__title_slug": "check-if-matrix-is-x-matrix", "question__hide": false, - "total_acs": 38352, - "total_submitted": 57698, + "total_acs": 39673, + "total_submitted": 59784, "frontend_question_id": 2319, "is_new_question": false }, @@ -8203,8 +8778,8 @@ "question__title": "Count Number of Ways to Place Houses", "question__title_slug": "count-number-of-ways-to-place-houses", "question__hide": false, - "total_acs": 22183, - "total_submitted": 54531, + "total_acs": 22307, + "total_submitted": 54842, "frontend_question_id": 2320, "is_new_question": false }, @@ -8226,8 +8801,8 @@ "question__title": "Design Video Sharing Platform", "question__title_slug": "design-video-sharing-platform", "question__hide": false, - "total_acs": 1479, - "total_submitted": 2300, + "total_acs": 1523, + "total_submitted": 2361, "frontend_question_id": 2254, "is_new_question": false }, @@ -8249,8 +8824,8 @@ "question__title": "Longest Binary Subsequence Less Than or Equal to K", "question__title_slug": "longest-binary-subsequence-less-than-or-equal-to-k", "question__hide": false, - "total_acs": 18600, - "total_submitted": 50244, + "total_acs": 18693, + "total_submitted": 50469, "frontend_question_id": 2311, "is_new_question": false }, @@ -8272,8 +8847,8 @@ "question__title": "Count Subarrays With Score Less Than K", "question__title_slug": "count-subarrays-with-score-less-than-k", "question__hide": false, - "total_acs": 16769, - "total_submitted": 32033, + "total_acs": 16910, + "total_submitted": 32277, "frontend_question_id": 2302, "is_new_question": false }, @@ -8295,8 +8870,8 @@ "question__title": "Match Substring After Replacement", "question__title_slug": "match-substring-after-replacement", "question__hide": false, - "total_acs": 11507, - "total_submitted": 29191, + "total_acs": 11549, + "total_submitted": 29265, "frontend_question_id": 2301, "is_new_question": false }, @@ -8318,8 +8893,8 @@ "question__title": "Successful Pairs of Spells and Potions", "question__title_slug": "successful-pairs-of-spells-and-potions", "question__hide": false, - "total_acs": 88103, - "total_submitted": 213671, + "total_acs": 88686, + "total_submitted": 214936, "frontend_question_id": 2300, "is_new_question": false }, @@ -8341,8 +8916,8 @@ "question__title": "Strong Password Checker II", "question__title_slug": "strong-password-checker-ii", "question__hide": false, - "total_acs": 31083, - "total_submitted": 55364, + "total_acs": 31352, + "total_submitted": 56025, "frontend_question_id": 2299, "is_new_question": false }, @@ -8364,8 +8939,8 @@ "question__title": "Naming a Company", "question__title_slug": "naming-a-company", "question__hide": false, - "total_acs": 55138, - "total_submitted": 117137, + "total_acs": 55276, + "total_submitted": 117410, "frontend_question_id": 2306, "is_new_question": false }, @@ -8387,8 +8962,8 @@ "question__title": "Design a Text Editor", "question__title_slug": "design-a-text-editor", "question__hide": false, - "total_acs": 16299, - "total_submitted": 39792, + "total_acs": 16458, + "total_submitted": 40070, "frontend_question_id": 2296, "is_new_question": false }, @@ -8410,8 +8985,8 @@ "question__title": "Replace Elements in an Array", "question__title_slug": "replace-elements-in-an-array", "question__hide": false, - "total_acs": 28423, - "total_submitted": 49400, + "total_acs": 28584, + "total_submitted": 49680, "frontend_question_id": 2295, "is_new_question": false }, @@ -8433,8 +9008,8 @@ "question__title": "Partition Array Such That Maximum Difference Is K", "question__title_slug": "partition-array-such-that-maximum-difference-is-k", "question__hide": false, - "total_acs": 31592, - "total_submitted": 43432, + "total_acs": 31818, + "total_submitted": 43791, "frontend_question_id": 2294, "is_new_question": false }, @@ -8456,8 +9031,8 @@ "question__title": "Min Max Game", "question__title_slug": "min-max-game", "question__hide": false, - "total_acs": 36759, - "total_submitted": 57734, + "total_acs": 37010, + "total_submitted": 58193, "frontend_question_id": 2293, "is_new_question": false }, @@ -8479,8 +9054,8 @@ "question__title": "Count Positions on Street With Required Brightness", "question__title_slug": "count-positions-on-street-with-required-brightness", "question__hide": false, - "total_acs": 2054, - "total_submitted": 3191, + "total_acs": 2068, + "total_submitted": 3217, "frontend_question_id": 2237, "is_new_question": false }, @@ -8502,8 +9077,8 @@ "question__title": "Root Equals Sum of Children", "question__title_slug": "root-equals-sum-of-children", "question__hide": false, - "total_acs": 126072, - "total_submitted": 149826, + "total_acs": 128725, + "total_submitted": 153255, "frontend_question_id": 2236, "is_new_question": false }, @@ -8525,8 +9100,8 @@ "question__title": "Add Two Integers", "question__title_slug": "add-two-integers", "question__hide": false, - "total_acs": 272908, - "total_submitted": 309254, + "total_acs": 279423, + "total_submitted": 316754, "frontend_question_id": 2235, "is_new_question": false }, @@ -8548,8 +9123,8 @@ "question__title": "Dynamic Unpivoting of a Table", "question__title_slug": "dynamic-unpivoting-of-a-table", "question__hide": false, - "total_acs": 521, - "total_submitted": 800, + "total_acs": 538, + "total_submitted": 820, "frontend_question_id": 2253, "is_new_question": false }, @@ -8571,8 +9146,8 @@ "question__title": "Dynamic Pivoting of a Table", "question__title_slug": "dynamic-pivoting-of-a-table", "question__hide": false, - "total_acs": 854, - "total_submitted": 1521, + "total_acs": 873, + "total_submitted": 1549, "frontend_question_id": 2252, "is_new_question": false }, @@ -8594,8 +9169,8 @@ "question__title": "Booking Concert Tickets in Groups", "question__title_slug": "booking-concert-tickets-in-groups", "question__hide": false, - "total_acs": 4739, - "total_submitted": 30426, + "total_acs": 4762, + "total_submitted": 30570, "frontend_question_id": 2286, "is_new_question": false }, @@ -8617,8 +9192,8 @@ "question__title": "Maximum Total Importance of Roads", "question__title_slug": "maximum-total-importance-of-roads", "question__hide": false, - "total_acs": 25363, - "total_submitted": 41785, + "total_acs": 25626, + "total_submitted": 42274, "frontend_question_id": 2285, "is_new_question": false }, @@ -8640,8 +9215,8 @@ "question__title": "Sender With Largest Word Count", "question__title_slug": "sender-with-largest-word-count", "question__hide": false, - "total_acs": 26594, - "total_submitted": 47514, + "total_acs": 26741, + "total_submitted": 47765, "frontend_question_id": 2284, "is_new_question": false }, @@ -8663,8 +9238,8 @@ "question__title": "Check if Number Has Equal Digit Count and Digit Value", "question__title_slug": "check-if-number-has-equal-digit-count-and-digit-value", "question__hide": false, - "total_acs": 39639, - "total_submitted": 54396, + "total_acs": 40059, + "total_submitted": 54989, "frontend_question_id": 2283, "is_new_question": false }, @@ -8686,8 +9261,8 @@ "question__title": "Number of Times a Driver Was a Passenger", "question__title_slug": "number-of-times-a-driver-was-a-passenger", "question__hide": false, - "total_acs": 4591, - "total_submitted": 6348, + "total_acs": 4661, + "total_submitted": 6509, "frontend_question_id": 2238, "is_new_question": false }, @@ -8709,8 +9284,8 @@ "question__title": "Minimum Obstacle Removal to Reach Corner", "question__title_slug": "minimum-obstacle-removal-to-reach-corner", "question__hide": false, - "total_acs": 16364, - "total_submitted": 32892, + "total_acs": 16465, + "total_submitted": 33041, "frontend_question_id": 2290, "is_new_question": false }, @@ -8732,8 +9307,8 @@ "question__title": "Steps to Make Array Non-decreasing", "question__title_slug": "steps-to-make-array-non-decreasing", "question__hide": false, - "total_acs": 14694, - "total_submitted": 70173, + "total_acs": 14833, + "total_submitted": 70917, "frontend_question_id": 2289, "is_new_question": false }, @@ -8755,8 +9330,8 @@ "question__title": "Apply Discount to Prices", "question__title_slug": "apply-discount-to-prices", "question__hide": false, - "total_acs": 17572, - "total_submitted": 62569, + "total_acs": 17674, + "total_submitted": 62809, "frontend_question_id": 2288, "is_new_question": false }, @@ -8778,8 +9353,8 @@ "question__title": "Rearrange Characters to Make Target String", "question__title_slug": "rearrange-characters-to-make-target-string", "question__hide": false, - "total_acs": 31222, - "total_submitted": 53746, + "total_acs": 31412, + "total_submitted": 54095, "frontend_question_id": 2287, "is_new_question": false }, @@ -8801,8 +9376,8 @@ "question__title": "The Users That Are Eligible for Discount", "question__title_slug": "the-users-that-are-eligible-for-discount", "question__hide": false, - "total_acs": 3556, - "total_submitted": 7213, + "total_acs": 3598, + "total_submitted": 7300, "frontend_question_id": 2230, "is_new_question": false }, @@ -8824,8 +9399,8 @@ "question__title": "Users With Two Purchases Within Seven Days", "question__title_slug": "users-with-two-purchases-within-seven-days", "question__hide": false, - "total_acs": 5036, - "total_submitted": 11513, + "total_acs": 5086, + "total_submitted": 11616, "frontend_question_id": 2228, "is_new_question": false }, @@ -8847,8 +9422,8 @@ "question__title": "Maximum Sum Score of Array", "question__title_slug": "maximum-sum-score-of-array", "question__hide": false, - "total_acs": 2906, - "total_submitted": 4747, + "total_acs": 2926, + "total_submitted": 4779, "frontend_question_id": 2219, "is_new_question": false }, @@ -8870,8 +9445,8 @@ "question__title": "Sum of Total Strength of Wizards", "question__title_slug": "sum-of-total-strength-of-wizards", "question__hide": false, - "total_acs": 14260, - "total_submitted": 52220, + "total_acs": 14343, + "total_submitted": 52613, "frontend_question_id": 2281, "is_new_question": false }, @@ -8893,8 +9468,8 @@ "question__title": "Minimum Lines to Represent a Line Chart", "question__title_slug": "minimum-lines-to-represent-a-line-chart", "question__hide": false, - "total_acs": 22557, - "total_submitted": 91744, + "total_acs": 22635, + "total_submitted": 91981, "frontend_question_id": 2280, "is_new_question": false }, @@ -8916,8 +9491,8 @@ "question__title": "Maximum Bags With Full Capacity of Rocks", "question__title_slug": "maximum-bags-with-full-capacity-of-rocks", "question__hide": false, - "total_acs": 85071, - "total_submitted": 125635, + "total_acs": 85357, + "total_submitted": 126020, "frontend_question_id": 2279, "is_new_question": false }, @@ -8939,8 +9514,8 @@ "question__title": "Percentage of Letter in String", "question__title_slug": "percentage-of-letter-in-string", "question__hide": false, - "total_acs": 49380, - "total_submitted": 66703, + "total_acs": 49856, + "total_submitted": 67359, "frontend_question_id": 2278, "is_new_question": false }, @@ -8962,8 +9537,8 @@ "question__title": "Longest Path With Different Adjacent Characters", "question__title_slug": "longest-path-with-different-adjacent-characters", "question__hide": false, - "total_acs": 65956, - "total_submitted": 118623, + "total_acs": 66129, + "total_submitted": 119003, "frontend_question_id": 2246, "is_new_question": false }, @@ -8985,8 +9560,8 @@ "question__title": "Maximum Trailing Zeros in a Cornered Path", "question__title_slug": "maximum-trailing-zeros-in-a-cornered-path", "question__hide": false, - "total_acs": 7036, - "total_submitted": 19991, + "total_acs": 7066, + "total_submitted": 20068, "frontend_question_id": 2245, "is_new_question": false }, @@ -9008,8 +9583,8 @@ "question__title": "Minimum Rounds to Complete All Tasks", "question__title_slug": "minimum-rounds-to-complete-all-tasks", "question__hide": false, - "total_acs": 132931, - "total_submitted": 211312, + "total_acs": 133682, + "total_submitted": 212570, "frontend_question_id": 2244, "is_new_question": false }, @@ -9031,8 +9606,8 @@ "question__title": "Calculate Digit Sum of a String", "question__title_slug": "calculate-digit-sum-of-a-string", "question__hide": false, - "total_acs": 30080, - "total_submitted": 45324, + "total_acs": 30286, + "total_submitted": 45679, "frontend_question_id": 2243, "is_new_question": false }, @@ -9048,14 +9623,14 @@ { "stat": { "question_id": 2360, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "substring-with-largest-variance", + "question__article__has_video_solution": false, "question__title": "Substring With Largest Variance", "question__title_slug": "substring-with-largest-variance", "question__hide": false, - "total_acs": 24109, - "total_submitted": 65461, + "total_acs": 24192, + "total_submitted": 65670, "frontend_question_id": 2272, "is_new_question": false }, @@ -9077,8 +9652,8 @@ "question__title": "Maximum White Tiles Covered by a Carpet", "question__title_slug": "maximum-white-tiles-covered-by-a-carpet", "question__hide": false, - "total_acs": 13366, - "total_submitted": 40491, + "total_acs": 13673, + "total_submitted": 41439, "frontend_question_id": 2271, "is_new_question": false }, @@ -9100,8 +9675,8 @@ "question__title": "Number of Ways to Split Array", "question__title_slug": "number-of-ways-to-split-array", "question__hide": false, - "total_acs": 26445, - "total_submitted": 57924, + "total_acs": 26721, + "total_submitted": 58499, "frontend_question_id": 2270, "is_new_question": false }, @@ -9123,8 +9698,8 @@ "question__title": "Count Integers in Intervals", "question__title_slug": "count-integers-in-intervals", "question__hide": false, - "total_acs": 13128, - "total_submitted": 38016, + "total_acs": 13319, + "total_submitted": 38424, "frontend_question_id": 2276, "is_new_question": false }, @@ -9146,8 +9721,8 @@ "question__title": "Largest Combination With Bitwise AND Greater Than Zero", "question__title_slug": "largest-combination-with-bitwise-and-greater-than-zero", "question__hide": false, - "total_acs": 20842, - "total_submitted": 28822, + "total_acs": 20959, + "total_submitted": 28962, "frontend_question_id": 2275, "is_new_question": false }, @@ -9169,8 +9744,8 @@ "question__title": "Maximum Consecutive Floors Without Special Floors", "question__title_slug": "maximum-consecutive-floors-without-special-floors", "question__hide": false, - "total_acs": 25863, - "total_submitted": 49690, + "total_acs": 26016, + "total_submitted": 49949, "frontend_question_id": 2274, "is_new_question": false }, @@ -9192,8 +9767,8 @@ "question__title": "Minimum Health to Beat Game", "question__title_slug": "minimum-health-to-beat-game", "question__hide": false, - "total_acs": 27905, - "total_submitted": 48155, + "total_acs": 27953, + "total_submitted": 48260, "frontend_question_id": 2214, "is_new_question": false }, @@ -9215,8 +9790,8 @@ "question__title": "Maximum Score of a Node Sequence", "question__title_slug": "maximum-score-of-a-node-sequence", "question__hide": false, - "total_acs": 9760, - "total_submitted": 25718, + "total_acs": 9805, + "total_submitted": 25928, "frontend_question_id": 2242, "is_new_question": false }, @@ -9238,8 +9813,8 @@ "question__title": "Design an ATM Machine", "question__title_slug": "design-an-atm-machine", "question__hide": false, - "total_acs": 13617, - "total_submitted": 34944, + "total_acs": 13758, + "total_submitted": 35399, "frontend_question_id": 2241, "is_new_question": false }, @@ -9261,8 +9836,8 @@ "question__title": "Number of Ways to Buy Pens and Pencils", "question__title_slug": "number-of-ways-to-buy-pens-and-pencils", "question__hide": false, - "total_acs": 20760, - "total_submitted": 36505, + "total_acs": 20919, + "total_submitted": 36780, "frontend_question_id": 2240, "is_new_question": false }, @@ -9284,8 +9859,8 @@ "question__title": "Find Closest Number to Zero", "question__title_slug": "find-closest-number-to-zero", "question__hide": false, - "total_acs": 39389, - "total_submitted": 87059, + "total_acs": 39785, + "total_submitted": 88042, "frontend_question_id": 2239, "is_new_question": false }, @@ -9307,8 +9882,8 @@ "question__title": " Check if There Is a Valid Parentheses String Path", "question__title_slug": "check-if-there-is-a-valid-parentheses-string-path", "question__hide": false, - "total_acs": 12671, - "total_submitted": 33461, + "total_acs": 12724, + "total_submitted": 33584, "frontend_question_id": 2267, "is_new_question": false }, @@ -9330,8 +9905,8 @@ "question__title": "Count Number of Texts", "question__title_slug": "count-number-of-texts", "question__hide": false, - "total_acs": 15322, - "total_submitted": 32602, + "total_acs": 15420, + "total_submitted": 32780, "frontend_question_id": 2266, "is_new_question": false }, @@ -9353,8 +9928,8 @@ "question__title": "Count Nodes Equal to Average of Subtree", "question__title_slug": "count-nodes-equal-to-average-of-subtree", "question__hide": false, - "total_acs": 39502, - "total_submitted": 46440, + "total_acs": 39901, + "total_submitted": 46921, "frontend_question_id": 2265, "is_new_question": false }, @@ -9376,8 +9951,8 @@ "question__title": "Largest 3-Same-Digit Number in String", "question__title_slug": "largest-3-same-digit-number-in-string", "question__hide": false, - "total_acs": 32054, - "total_submitted": 53810, + "total_acs": 32329, + "total_submitted": 54312, "frontend_question_id": 2264, "is_new_question": false }, @@ -9399,8 +9974,8 @@ "question__title": "Minimum Number of Operations to Convert Time", "question__title_slug": "minimum-number-of-operations-to-convert-time", "question__hide": false, - "total_acs": 32534, - "total_submitted": 50137, + "total_acs": 32761, + "total_submitted": 50532, "frontend_question_id": 2224, "is_new_question": false }, @@ -9422,8 +9997,8 @@ "question__title": "Escape the Spreading Fire", "question__title_slug": "escape-the-spreading-fire", "question__hide": false, - "total_acs": 7078, - "total_submitted": 20285, + "total_acs": 7136, + "total_submitted": 20432, "frontend_question_id": 2258, "is_new_question": false }, @@ -9445,8 +10020,8 @@ "question__title": "Count Unguarded Cells in the Grid", "question__title_slug": "count-unguarded-cells-in-the-grid", "question__hide": false, - "total_acs": 13524, - "total_submitted": 25984, + "total_acs": 13588, + "total_submitted": 26123, "frontend_question_id": 2257, "is_new_question": false }, @@ -9468,8 +10043,8 @@ "question__title": "Minimum Average Difference", "question__title_slug": "minimum-average-difference", "question__hide": false, - "total_acs": 75527, - "total_submitted": 175407, + "total_acs": 75774, + "total_submitted": 176005, "frontend_question_id": 2256, "is_new_question": false }, @@ -9491,8 +10066,8 @@ "question__title": "Count Prefixes of a Given String", "question__title_slug": "count-prefixes-of-a-given-string", "question__hide": false, - "total_acs": 41010, - "total_submitted": 56536, + "total_acs": 41601, + "total_submitted": 57355, "frontend_question_id": 2255, "is_new_question": false }, @@ -9514,8 +10089,8 @@ "question__title": "Total Appeal of A String", "question__title_slug": "total-appeal-of-a-string", "question__hide": false, - "total_acs": 23229, - "total_submitted": 41168, + "total_acs": 23401, + "total_submitted": 41573, "frontend_question_id": 2262, "is_new_question": false }, @@ -9537,8 +10112,8 @@ "question__title": "K Divisible Elements Subarrays", "question__title_slug": "k-divisible-elements-subarrays", "question__hide": false, - "total_acs": 21314, - "total_submitted": 44215, + "total_acs": 21503, + "total_submitted": 44586, "frontend_question_id": 2261, "is_new_question": false }, @@ -9560,8 +10135,8 @@ "question__title": "Minimum Consecutive Cards to Pick Up", "question__title_slug": "minimum-consecutive-cards-to-pick-up", "question__hide": false, - "total_acs": 42416, - "total_submitted": 83123, + "total_acs": 43083, + "total_submitted": 84498, "frontend_question_id": 2260, "is_new_question": false }, @@ -9583,8 +10158,8 @@ "question__title": "Remove Digit From Number to Maximize Result", "question__title_slug": "remove-digit-from-number-to-maximize-result", "question__hide": false, - "total_acs": 51286, - "total_submitted": 111655, + "total_acs": 52044, + "total_submitted": 113440, "frontend_question_id": 2259, "is_new_question": false }, @@ -9606,8 +10181,8 @@ "question__title": "The Number of Users That Are Eligible for Discount", "question__title_slug": "the-number-of-users-that-are-eligible-for-discount", "question__hide": false, - "total_acs": 4239, - "total_submitted": 8437, + "total_acs": 4277, + "total_submitted": 8507, "frontend_question_id": 2205, "is_new_question": false }, @@ -9629,8 +10204,8 @@ "question__title": "Finding the Topic of Each Post", "question__title_slug": "finding-the-topic-of-each-post", "question__hide": false, - "total_acs": 1758, - "total_submitted": 3520, + "total_acs": 1789, + "total_submitted": 3575, "frontend_question_id": 2199, "is_new_question": false }, @@ -9652,8 +10227,8 @@ "question__title": "Number of Flowers in Full Bloom", "question__title_slug": "number-of-flowers-in-full-bloom", "question__hide": false, - "total_acs": 13089, - "total_submitted": 25608, + "total_acs": 13181, + "total_submitted": 25783, "frontend_question_id": 2251, "is_new_question": false }, @@ -9675,8 +10250,8 @@ "question__title": "Count Number of Rectangles Containing Each Point", "question__title_slug": "count-number-of-rectangles-containing-each-point", "question__hide": false, - "total_acs": 12221, - "total_submitted": 35828, + "total_acs": 12294, + "total_submitted": 36072, "frontend_question_id": 2250, "is_new_question": false }, @@ -9698,8 +10273,8 @@ "question__title": "Count Lattice Points Inside a Circle", "question__title_slug": "count-lattice-points-inside-a-circle", "question__hide": false, - "total_acs": 18744, - "total_submitted": 37061, + "total_acs": 18865, + "total_submitted": 37273, "frontend_question_id": 2249, "is_new_question": false }, @@ -9721,8 +10296,8 @@ "question__title": "Intersection of Multiple Arrays", "question__title_slug": "intersection-of-multiple-arrays", "question__hide": false, - "total_acs": 49965, - "total_submitted": 72943, + "total_acs": 50975, + "total_submitted": 74401, "frontend_question_id": 2248, "is_new_question": false }, @@ -9744,8 +10319,8 @@ "question__title": "Maximum Total Beauty of the Gardens", "question__title_slug": "maximum-total-beauty-of-the-gardens", "question__hide": false, - "total_acs": 5517, - "total_submitted": 19315, + "total_acs": 5565, + "total_submitted": 19500, "frontend_question_id": 2234, "is_new_question": false }, @@ -9767,8 +10342,8 @@ "question__title": "Maximum Product After K Increments", "question__title_slug": "maximum-product-after-k-increments", "question__hide": false, - "total_acs": 23257, - "total_submitted": 56708, + "total_acs": 23427, + "total_submitted": 57117, "frontend_question_id": 2233, "is_new_question": false }, @@ -9790,8 +10365,8 @@ "question__title": "Minimize Result by Adding Parentheses to Expression", "question__title_slug": "minimize-result-by-adding-parentheses-to-expression", "question__hide": false, - "total_acs": 15501, - "total_submitted": 23679, + "total_acs": 15586, + "total_submitted": 23780, "frontend_question_id": 2232, "is_new_question": false }, @@ -9813,8 +10388,8 @@ "question__title": "Largest Number After Digit Swaps by Parity", "question__title_slug": "largest-number-after-digit-swaps-by-parity", "question__hide": false, - "total_acs": 31715, - "total_submitted": 52256, + "total_acs": 31959, + "total_submitted": 52670, "frontend_question_id": 2231, "is_new_question": false }, @@ -9836,8 +10411,8 @@ "question__title": "Sum of Scores of Built Strings", "question__title_slug": "sum-of-scores-of-built-strings", "question__hide": false, - "total_acs": 5339, - "total_submitted": 14250, + "total_acs": 5379, + "total_submitted": 14495, "frontend_question_id": 2223, "is_new_question": false }, @@ -9859,8 +10434,8 @@ "question__title": "Number of Ways to Select Buildings", "question__title_slug": "number-of-ways-to-select-buildings", "question__hide": false, - "total_acs": 26558, - "total_submitted": 51989, + "total_acs": 26712, + "total_submitted": 52289, "frontend_question_id": 2222, "is_new_question": false }, @@ -9882,8 +10457,8 @@ "question__title": "Find Triangular Sum of an Array", "question__title_slug": "find-triangular-sum-of-an-array", "question__hide": false, - "total_acs": 54791, - "total_submitted": 69976, + "total_acs": 55243, + "total_submitted": 70524, "frontend_question_id": 2221, "is_new_question": false }, @@ -9905,8 +10480,8 @@ "question__title": "Minimum Bit Flips to Convert Number", "question__title_slug": "minimum-bit-flips-to-convert-number", "question__hide": false, - "total_acs": 39534, - "total_submitted": 47967, + "total_acs": 40155, + "total_submitted": 49010, "frontend_question_id": 2220, "is_new_question": false }, @@ -9928,8 +10503,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": 5231, - "total_submitted": 10419, + "total_acs": 5283, + "total_submitted": 10509, "frontend_question_id": 2184, "is_new_question": false }, @@ -9951,8 +10526,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": 9211, - "total_submitted": 25573, + "total_acs": 9268, + "total_submitted": 25731, "frontend_question_id": 2203, "is_new_question": false }, @@ -9974,8 +10549,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": 31744, - "total_submitted": 48777, + "total_acs": 31887, + "total_submitted": 49087, "frontend_question_id": 2200, "is_new_question": false }, @@ -9997,8 +10572,8 @@ "question__title": "Longest Substring of One Repeating Character", "question__title_slug": "longest-substring-of-one-repeating-character", "question__hide": false, - "total_acs": 3496, - "total_submitted": 11311, + "total_acs": 3630, + "total_submitted": 11522, "frontend_question_id": 2213, "is_new_question": false }, @@ -10020,8 +10595,8 @@ "question__title": "Maximum Points in an Archery Competition", "question__title_slug": "maximum-points-in-an-archery-competition", "question__hide": false, - "total_acs": 12726, - "total_submitted": 25750, + "total_acs": 12810, + "total_submitted": 25903, "frontend_question_id": 2212, "is_new_question": false }, @@ -10043,8 +10618,8 @@ "question__title": "Count Collisions on a Road", "question__title_slug": "count-collisions-on-a-road", "question__hide": false, - "total_acs": 19901, - "total_submitted": 46978, + "total_acs": 20030, + "total_submitted": 47251, "frontend_question_id": 2211, "is_new_question": false }, @@ -10066,8 +10641,8 @@ "question__title": "Count Hills and Valleys in an Array", "question__title_slug": "count-hills-and-valleys-in-an-array", "question__hide": false, - "total_acs": 31600, - "total_submitted": 54037, + "total_acs": 31845, + "total_submitted": 54422, "frontend_question_id": 2210, "is_new_question": false }, @@ -10089,8 +10664,8 @@ "question__title": "The Change in Global Rankings", "question__title_slug": "the-change-in-global-rankings", "question__hide": false, - "total_acs": 4159, - "total_submitted": 6501, + "total_acs": 4211, + "total_submitted": 6611, "frontend_question_id": 2175, "is_new_question": false }, @@ -10112,8 +10687,8 @@ "question__title": "Remove All Ones With Row and Column Flips II", "question__title_slug": "remove-all-ones-with-row-and-column-flips-ii", "question__hide": false, - "total_acs": 4183, - "total_submitted": 6120, + "total_acs": 4197, + "total_submitted": 6138, "frontend_question_id": 2174, "is_new_question": false }, @@ -10135,8 +10710,8 @@ "question__title": "Longest Winning Streak", "question__title_slug": "longest-winning-streak", "question__hide": false, - "total_acs": 2766, - "total_submitted": 5092, + "total_acs": 2816, + "total_submitted": 5155, "frontend_question_id": 2173, "is_new_question": false }, @@ -10158,8 +10733,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": 27143, - "total_submitted": 45515, + "total_acs": 27345, + "total_submitted": 45909, "frontend_question_id": 2190, "is_new_question": false }, @@ -10181,8 +10756,8 @@ "question__title": "Minimum White Tiles After Covering With Carpets", "question__title_slug": "minimum-white-tiles-after-covering-with-carpets", "question__hide": false, - "total_acs": 9845, - "total_submitted": 28684, + "total_acs": 9937, + "total_submitted": 28868, "frontend_question_id": 2209, "is_new_question": false }, @@ -10204,8 +10779,8 @@ "question__title": "Minimum Operations to Halve Array Sum", "question__title_slug": "minimum-operations-to-halve-array-sum", "question__hide": false, - "total_acs": 20896, - "total_submitted": 45945, + "total_acs": 21038, + "total_submitted": 46236, "frontend_question_id": 2208, "is_new_question": false }, @@ -10227,8 +10802,8 @@ "question__title": "Maximize Number of Subsequences in a String", "question__title_slug": "maximize-number-of-subsequences-in-a-string", "question__hide": false, - "total_acs": 15736, - "total_submitted": 47109, + "total_acs": 15799, + "total_submitted": 47233, "frontend_question_id": 2207, "is_new_question": false }, @@ -10250,8 +10825,8 @@ "question__title": "Divide Array Into Equal Pairs", "question__title_slug": "divide-array-into-equal-pairs", "question__hide": false, - "total_acs": 54474, - "total_submitted": 73934, + "total_acs": 55025, + "total_submitted": 74759, "frontend_question_id": 2206, "is_new_question": false }, @@ -10273,8 +10848,8 @@ "question__title": "Replace Non-Coprime Numbers in Array", "question__title_slug": "replace-non-coprime-numbers-in-array", "question__hide": false, - "total_acs": 11794, - "total_submitted": 30595, + "total_acs": 11852, + "total_submitted": 30712, "frontend_question_id": 2197, "is_new_question": false }, @@ -10296,8 +10871,8 @@ "question__title": "Create Binary Tree From Descriptions", "question__title_slug": "create-binary-tree-from-descriptions", "question__hide": false, - "total_acs": 26568, - "total_submitted": 36691, + "total_acs": 26740, + "total_submitted": 36967, "frontend_question_id": 2196, "is_new_question": false }, @@ -10319,8 +10894,8 @@ "question__title": "Append K Integers With Minimal Sum", "question__title_slug": "append-k-integers-with-minimal-sum", "question__hide": false, - "total_acs": 26297, - "total_submitted": 105346, + "total_acs": 26423, + "total_submitted": 105875, "frontend_question_id": 2195, "is_new_question": false }, @@ -10342,8 +10917,8 @@ "question__title": "Cells in a Range on an Excel Sheet", "question__title_slug": "cells-in-a-range-on-an-excel-sheet", "question__hide": false, - "total_acs": 48441, - "total_submitted": 57361, + "total_acs": 48986, + "total_submitted": 58058, "frontend_question_id": 2194, "is_new_question": false }, @@ -10365,8 +10940,8 @@ "question__title": "Unique Substrings With Equal Digit Frequency", "question__title_slug": "unique-substrings-with-equal-digit-frequency", "question__hide": false, - "total_acs": 1779, - "total_submitted": 2978, + "total_acs": 1794, + "total_submitted": 3006, "frontend_question_id": 2168, "is_new_question": false }, @@ -10388,8 +10963,8 @@ "question__title": "Order Two Columns Independently", "question__title_slug": "order-two-columns-independently", "question__hide": false, - "total_acs": 4861, - "total_submitted": 8114, + "total_acs": 4930, + "total_submitted": 8245, "frontend_question_id": 2159, "is_new_question": false }, @@ -10411,8 +10986,8 @@ "question__title": "Count Array Pairs Divisible by K", "question__title_slug": "count-array-pairs-divisible-by-k", "question__hide": false, - "total_acs": 12014, - "total_submitted": 42483, + "total_acs": 12067, + "total_submitted": 42701, "frontend_question_id": 2183, "is_new_question": false }, @@ -10434,8 +11009,8 @@ "question__title": "Construct String With Repeat Limit", "question__title_slug": "construct-string-with-repeat-limit", "question__hide": false, - "total_acs": 17238, - "total_submitted": 32971, + "total_acs": 17336, + "total_submitted": 33111, "frontend_question_id": 2182, "is_new_question": false }, @@ -10457,8 +11032,8 @@ "question__title": "Merge Nodes in Between Zeros", "question__title_slug": "merge-nodes-in-between-zeros", "question__hide": false, - "total_acs": 74248, - "total_submitted": 86260, + "total_acs": 75236, + "total_submitted": 87413, "frontend_question_id": 2181, "is_new_question": false }, @@ -10480,8 +11055,8 @@ "question__title": "Count Integers With Even Digit Sum", "question__title_slug": "count-integers-with-even-digit-sum", "question__hide": false, - "total_acs": 42746, - "total_submitted": 65154, + "total_acs": 43107, + "total_submitted": 65661, "frontend_question_id": 2180, "is_new_question": false }, @@ -10503,8 +11078,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": 23568, - "total_submitted": 43137, + "total_acs": 23655, + "total_submitted": 43316, "frontend_question_id": 2158, "is_new_question": false }, @@ -10526,8 +11101,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": 1972, - "total_submitted": 4398, + "total_acs": 2000, + "total_submitted": 4459, "frontend_question_id": 2153, "is_new_question": false }, @@ -10549,8 +11124,8 @@ "question__title": "Minimum Time to Finish the Race", "question__title_slug": "minimum-time-to-finish-the-race", "question__hide": false, - "total_acs": 9899, - "total_submitted": 23817, + "total_acs": 9968, + "total_submitted": 23917, "frontend_question_id": 2188, "is_new_question": false }, @@ -10572,8 +11147,8 @@ "question__title": "Minimum Time to Complete Trips", "question__title_slug": "minimum-time-to-complete-trips", "question__hide": false, - "total_acs": 96240, - "total_submitted": 245651, + "total_acs": 96718, + "total_submitted": 246763, "frontend_question_id": 2187, "is_new_question": false }, @@ -10595,8 +11170,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": 32017, - "total_submitted": 44559, + "total_acs": 32332, + "total_submitted": 44998, "frontend_question_id": 2186, "is_new_question": false }, @@ -10618,8 +11193,8 @@ "question__title": "Counting Words With a Given Prefix", "question__title_slug": "counting-words-with-a-given-prefix", "question__hide": false, - "total_acs": 63234, - "total_submitted": 81840, + "total_acs": 63948, + "total_submitted": 82841, "frontend_question_id": 2185, "is_new_question": false }, @@ -10641,8 +11216,8 @@ "question__title": "Maximum AND Sum of Array", "question__title_slug": "maximum-and-sum-of-array", "question__hide": false, - "total_acs": 10937, - "total_submitted": 22642, + "total_acs": 10997, + "total_submitted": 22775, "frontend_question_id": 2172, "is_new_question": false }, @@ -10664,8 +11239,8 @@ "question__title": "Removing Minimum Number of Magic Beans", "question__title_slug": "removing-minimum-number-of-magic-beans", "question__hide": false, - "total_acs": 21479, - "total_submitted": 51041, + "total_acs": 21608, + "total_submitted": 51381, "frontend_question_id": 2171, "is_new_question": false }, @@ -10687,8 +11262,8 @@ "question__title": "Minimum Operations to Make the Array Alternating", "question__title_slug": "minimum-operations-to-make-the-array-alternating", "question__hide": false, - "total_acs": 19266, - "total_submitted": 58229, + "total_acs": 19340, + "total_submitted": 58451, "frontend_question_id": 2170, "is_new_question": false }, @@ -10710,8 +11285,8 @@ "question__title": "Count Operations to Obtain Zero", "question__title_slug": "count-operations-to-obtain-zero", "question__hide": false, - "total_acs": 53903, - "total_submitted": 71845, + "total_acs": 54413, + "total_submitted": 72574, "frontend_question_id": 2169, "is_new_question": false }, @@ -10733,8 +11308,8 @@ "question__title": "Minimum Number of Lines to Cover Points", "question__title_slug": "minimum-number-of-lines-to-cover-points", "question__hide": false, - "total_acs": 1532, - "total_submitted": 3230, + "total_acs": 1536, + "total_submitted": 3241, "frontend_question_id": 2152, "is_new_question": false }, @@ -10756,8 +11331,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": 10504, - "total_submitted": 25737, + "total_acs": 10548, + "total_submitted": 25835, "frontend_question_id": 2167, "is_new_question": false }, @@ -10779,8 +11354,8 @@ "question__title": "Design Bitset", "question__title_slug": "design-bitset", "question__hide": false, - "total_acs": 18832, - "total_submitted": 59304, + "total_acs": 18895, + "total_submitted": 59530, "frontend_question_id": 2166, "is_new_question": false }, @@ -10802,8 +11377,8 @@ "question__title": "Smallest Value of the Rearranged Number", "question__title_slug": "smallest-value-of-the-rearranged-number", "question__hide": false, - "total_acs": 28498, - "total_submitted": 55434, + "total_acs": 28651, + "total_submitted": 55710, "frontend_question_id": 2165, "is_new_question": false }, @@ -10825,8 +11400,8 @@ "question__title": "Sort Even and Odd Indices Independently", "question__title_slug": "sort-even-and-odd-indices-independently", "question__hide": false, - "total_acs": 43781, - "total_submitted": 67746, + "total_acs": 44128, + "total_submitted": 68359, "frontend_question_id": 2164, "is_new_question": false }, @@ -10848,8 +11423,8 @@ "question__title": "Choose Numbers From Two Arrays in Range", "question__title_slug": "choose-numbers-from-two-arrays-in-range", "question__hide": false, - "total_acs": 806, - "total_submitted": 1536, + "total_acs": 809, + "total_submitted": 1542, "frontend_question_id": 2143, "is_new_question": false }, @@ -10871,8 +11446,8 @@ "question__title": "The Number of Passengers in Each Bus I", "question__title_slug": "the-number-of-passengers-in-each-bus-i", "question__hide": false, - "total_acs": 5982, - "total_submitted": 12079, + "total_acs": 6067, + "total_submitted": 12295, "frontend_question_id": 2142, "is_new_question": false }, @@ -10894,8 +11469,8 @@ "question__title": "Count Good Triplets in an Array", "question__title_slug": "count-good-triplets-in-an-array", "question__hide": false, - "total_acs": 6122, - "total_submitted": 15891, + "total_acs": 6166, + "total_submitted": 15994, "frontend_question_id": 2179, "is_new_question": false }, @@ -10917,8 +11492,8 @@ "question__title": "Maximum Split of Positive Even Integers", "question__title_slug": "maximum-split-of-positive-even-integers", "question__hide": false, - "total_acs": 38875, - "total_submitted": 65443, + "total_acs": 39104, + "total_submitted": 65780, "frontend_question_id": 2178, "is_new_question": false }, @@ -10940,8 +11515,8 @@ "question__title": "Find Three Consecutive Integers That Sum to a Given Number", "question__title_slug": "find-three-consecutive-integers-that-sum-to-a-given-number", "question__hide": false, - "total_acs": 33724, - "total_submitted": 52778, + "total_acs": 34064, + "total_submitted": 53290, "frontend_question_id": 2177, "is_new_question": false }, @@ -10963,8 +11538,8 @@ "question__title": "Count Equal and Divisible Pairs in an Array", "question__title_slug": "count-equal-and-divisible-pairs-in-an-array", "question__hide": false, - "total_acs": 51483, - "total_submitted": 64756, + "total_acs": 51952, + "total_submitted": 65340, "frontend_question_id": 2176, "is_new_question": false }, @@ -10986,8 +11561,8 @@ "question__title": "Groups of Strings", "question__title_slug": "groups-of-strings", "question__hide": false, - "total_acs": 7800, - "total_submitted": 30614, + "total_acs": 7863, + "total_submitted": 30829, "frontend_question_id": 2157, "is_new_question": false }, @@ -11009,8 +11584,8 @@ "question__title": "Find Substring With Given Hash Value", "question__title_slug": "find-substring-with-given-hash-value", "question__hide": false, - "total_acs": 11323, - "total_submitted": 50664, + "total_acs": 11354, + "total_submitted": 50789, "frontend_question_id": 2156, "is_new_question": false }, @@ -11032,8 +11607,8 @@ "question__title": "Keep Multiplying Found Values by Two", "question__title_slug": "keep-multiplying-found-values-by-two", "question__hide": false, - "total_acs": 66091, - "total_submitted": 91266, + "total_acs": 66744, + "total_submitted": 92264, "frontend_question_id": 2154, "is_new_question": false }, @@ -11055,8 +11630,8 @@ "question__title": "Pour Water Between Buckets to Make Water Levels Equal", "question__title_slug": "pour-water-between-buckets-to-make-water-levels-equal", "question__hide": false, - "total_acs": 1753, - "total_submitted": 2622, + "total_acs": 1767, + "total_submitted": 2642, "frontend_question_id": 2137, "is_new_question": false }, @@ -11078,8 +11653,8 @@ "question__title": "Maximum Good People Based on Statements", "question__title_slug": "maximum-good-people-based-on-statements", "question__hide": false, - "total_acs": 11248, - "total_submitted": 22897, + "total_acs": 11299, + "total_submitted": 22982, "frontend_question_id": 2151, "is_new_question": false }, @@ -11101,8 +11676,8 @@ "question__title": "Rearrange Array Elements by Sign", "question__title_slug": "rearrange-array-elements-by-sign", "question__hide": false, - "total_acs": 78894, - "total_submitted": 97362, + "total_acs": 80808, + "total_submitted": 99563, "frontend_question_id": 2149, "is_new_question": false }, @@ -11124,8 +11699,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": 34962, - "total_submitted": 57890, + "total_acs": 35244, + "total_submitted": 58332, "frontend_question_id": 2150, "is_new_question": false }, @@ -11147,8 +11722,8 @@ "question__title": "Count Elements With Strictly Smaller and Greater Elements ", "question__title_slug": "count-elements-with-strictly-smaller-and-greater-elements", "question__hide": false, - "total_acs": 41604, - "total_submitted": 69824, + "total_acs": 41914, + "total_submitted": 70398, "frontend_question_id": 2148, "is_new_question": false }, @@ -11170,8 +11745,8 @@ "question__title": "Remove All Ones With Row and Column Flips", "question__title_slug": "remove-all-ones-with-row-and-column-flips", "question__hide": false, - "total_acs": 30620, - "total_submitted": 40116, + "total_acs": 30707, + "total_submitted": 40240, "frontend_question_id": 2128, "is_new_question": false }, @@ -11193,8 +11768,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": 7691, - "total_submitted": 16186, + "total_acs": 7745, + "total_submitted": 16322, "frontend_question_id": 2163, "is_new_question": false }, @@ -11216,8 +11791,8 @@ "question__title": "Minimum Cost to Set Cooking Time", "question__title_slug": "minimum-cost-to-set-cooking-time", "question__hide": false, - "total_acs": 13657, - "total_submitted": 34089, + "total_acs": 13736, + "total_submitted": 34236, "frontend_question_id": 2162, "is_new_question": false }, @@ -11239,8 +11814,8 @@ "question__title": "Partition Array According to Given Pivot", "question__title_slug": "partition-array-according-to-given-pivot", "question__hide": false, - "total_acs": 48543, - "total_submitted": 57295, + "total_acs": 49140, + "total_submitted": 57959, "frontend_question_id": 2161, "is_new_question": false }, @@ -11262,8 +11837,8 @@ "question__title": "Minimum Sum of Four Digit Number After Splitting Digits", "question__title_slug": "minimum-sum-of-four-digit-number-after-splitting-digits", "question__hide": false, - "total_acs": 85209, - "total_submitted": 98290, + "total_acs": 86495, + "total_submitted": 99919, "frontend_question_id": 2160, "is_new_question": false }, @@ -11285,8 +11860,8 @@ "question__title": "Maximum Running Time of N Computers", "question__title_slug": "maximum-running-time-of-n-computers", "question__hide": false, - "total_acs": 11350, - "total_submitted": 28983, + "total_acs": 11520, + "total_submitted": 29473, "frontend_question_id": 2141, "is_new_question": false }, @@ -11308,8 +11883,8 @@ "question__title": "Solving Questions With Brainpower", "question__title_slug": "solving-questions-with-brainpower", "question__hide": false, - "total_acs": 25556, - "total_submitted": 54921, + "total_acs": 78632, + "total_submitted": 141302, "frontend_question_id": 2140, "is_new_question": false }, @@ -11331,8 +11906,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": 25036, - "total_submitted": 39414, + "total_acs": 25157, + "total_submitted": 39610, "frontend_question_id": 2155, "is_new_question": false }, @@ -11354,8 +11929,8 @@ "question__title": "Divide a String Into Groups of Size k", "question__title_slug": "divide-a-string-into-groups-of-size-k", "question__hide": false, - "total_acs": 35775, - "total_submitted": 54631, + "total_acs": 36054, + "total_submitted": 55030, "frontend_question_id": 2138, "is_new_question": false }, @@ -11377,8 +11952,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": 721, - "total_submitted": 1755, + "total_acs": 723, + "total_submitted": 1758, "frontend_question_id": 2123, "is_new_question": false }, @@ -11400,8 +11975,8 @@ "question__title": "Elements in Array After Removing and Replacing Elements", "question__title_slug": "elements-in-array-after-removing-and-replacing-elements", "question__hide": false, - "total_acs": 1511, - "total_submitted": 2055, + "total_acs": 1519, + "total_submitted": 2075, "frontend_question_id": 2113, "is_new_question": false }, @@ -11423,8 +11998,8 @@ "question__title": "Earliest Possible Day of Full Bloom", "question__title_slug": "earliest-possible-day-of-full-bloom", "question__hide": false, - "total_acs": 47845, - "total_submitted": 65484, + "total_acs": 47979, + "total_submitted": 65715, "frontend_question_id": 2136, "is_new_question": false }, @@ -11446,8 +12021,8 @@ "question__title": "Count Words Obtained After Adding a Letter", "question__title_slug": "count-words-obtained-after-adding-a-letter", "question__hide": false, - "total_acs": 29763, - "total_submitted": 69692, + "total_acs": 29872, + "total_submitted": 69977, "frontend_question_id": 2135, "is_new_question": false }, @@ -11469,8 +12044,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": 21863, - "total_submitted": 42723, + "total_acs": 22016, + "total_submitted": 43016, "frontend_question_id": 2134, "is_new_question": false }, @@ -11492,8 +12067,8 @@ "question__title": "Check if Every Row and Column Contains All Numbers", "question__title_slug": "check-if-every-row-and-column-contains-all-numbers", "question__hide": false, - "total_acs": 52696, - "total_submitted": 101025, + "total_acs": 54093, + "total_submitted": 104234, "frontend_question_id": 2133, "is_new_question": false }, @@ -11515,8 +12090,8 @@ "question__title": "Build the Equation", "question__title_slug": "build-the-equation", "question__hide": false, - "total_acs": 1665, - "total_submitted": 2931, + "total_acs": 1692, + "total_submitted": 2971, "frontend_question_id": 2118, "is_new_question": false }, @@ -11538,8 +12113,8 @@ "question__title": "The Airport With the Most Traffic", "question__title_slug": "the-airport-with-the-most-traffic", "question__hide": false, - "total_acs": 5716, - "total_submitted": 8103, + "total_acs": 5790, + "total_submitted": 8245, "frontend_question_id": 2112, "is_new_question": false }, @@ -11561,8 +12136,8 @@ "question__title": "Number of Ways to Divide a Long Corridor", "question__title_slug": "number-of-ways-to-divide-a-long-corridor", "question__hide": false, - "total_acs": 9772, - "total_submitted": 24456, + "total_acs": 9854, + "total_submitted": 24937, "frontend_question_id": 2147, "is_new_question": false }, @@ -11584,8 +12159,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": 12514, - "total_submitted": 30162, + "total_acs": 12604, + "total_submitted": 30358, "frontend_question_id": 2146, "is_new_question": false }, @@ -11607,8 +12182,8 @@ "question__title": "Count the Hidden Sequences", "question__title_slug": "count-the-hidden-sequences", "question__hide": false, - "total_acs": 15085, - "total_submitted": 40793, + "total_acs": 15176, + "total_submitted": 41032, "frontend_question_id": 2145, "is_new_question": false }, @@ -11630,8 +12205,8 @@ "question__title": "Minimum Cost of Buying Candies With Discount", "question__title_slug": "minimum-cost-of-buying-candies-with-discount", "question__hide": false, - "total_acs": 36206, - "total_submitted": 59534, + "total_acs": 36477, + "total_submitted": 59970, "frontend_question_id": 2144, "is_new_question": false }, @@ -11653,8 +12228,8 @@ "question__title": "Number of Unique Flavors After Sharing K Candies", "question__title_slug": "number-of-unique-flavors-after-sharing-k-candies", "question__hide": false, - "total_acs": 2347, - "total_submitted": 4179, + "total_acs": 2374, + "total_submitted": 4232, "frontend_question_id": 2107, "is_new_question": false }, @@ -11676,8 +12251,8 @@ "question__title": "Maximum Employees to Be Invited to a Meeting", "question__title_slug": "maximum-employees-to-be-invited-to-a-meeting", "question__hide": false, - "total_acs": 8706, - "total_submitted": 24922, + "total_acs": 8794, + "total_submitted": 25144, "frontend_question_id": 2127, "is_new_question": false }, @@ -11699,8 +12274,8 @@ "question__title": "Destroying Asteroids", "question__title_slug": "destroying-asteroids", "question__hide": false, - "total_acs": 28334, - "total_submitted": 56653, + "total_acs": 28589, + "total_submitted": 57075, "frontend_question_id": 2126, "is_new_question": false }, @@ -11722,8 +12297,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": 46136, - "total_submitted": 56400, + "total_acs": 46559, + "total_submitted": 56896, "frontend_question_id": 2125, "is_new_question": false }, @@ -11745,8 +12320,8 @@ "question__title": "Check if All A's Appears Before All B's", "question__title_slug": "check-if-all-as-appears-before-all-bs", "question__hide": false, - "total_acs": 53664, - "total_submitted": 75371, + "total_acs": 54298, + "total_submitted": 76219, "frontend_question_id": 2124, "is_new_question": false }, @@ -11768,8 +12343,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": 2231, - "total_submitted": 5825, + "total_acs": 2240, + "total_submitted": 5851, "frontend_question_id": 2098, "is_new_question": false }, @@ -11791,8 +12366,8 @@ "question__title": "Recover the Original Array", "question__title_slug": "recover-the-original-array", "question__hide": false, - "total_acs": 8914, - "total_submitted": 23242, + "total_acs": 8941, + "total_submitted": 23348, "frontend_question_id": 2122, "is_new_question": false }, @@ -11814,8 +12389,8 @@ "question__title": "Intervals Between Identical Elements", "question__title_slug": "intervals-between-identical-elements", "question__hide": false, - "total_acs": 15984, - "total_submitted": 36597, + "total_acs": 16055, + "total_submitted": 36765, "frontend_question_id": 2121, "is_new_question": false }, @@ -11837,8 +12412,8 @@ "question__title": "Execution of All Suffix Instructions Staying in a Grid", "question__title_slug": "execution-of-all-suffix-instructions-staying-in-a-grid", "question__hide": false, - "total_acs": 23774, - "total_submitted": 28693, + "total_acs": 23949, + "total_submitted": 28900, "frontend_question_id": 2120, "is_new_question": false }, @@ -11860,8 +12435,8 @@ "question__title": "A Number After a Double Reversal", "question__title_slug": "a-number-after-a-double-reversal", "question__hide": false, - "total_acs": 56964, - "total_submitted": 73806, + "total_acs": 57645, + "total_submitted": 74587, "frontend_question_id": 2119, "is_new_question": false }, @@ -11883,8 +12458,8 @@ "question__title": "Longest Palindrome by Concatenating Two Letter Words", "question__title_slug": "longest-palindrome-by-concatenating-two-letter-words", "question__hide": false, - "total_acs": 101915, - "total_submitted": 210827, + "total_acs": 102584, + "total_submitted": 212227, "frontend_question_id": 2131, "is_new_question": false }, @@ -11906,8 +12481,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": 92191, - "total_submitted": 114513, + "total_acs": 93733, + "total_submitted": 116488, "frontend_question_id": 2130, "is_new_question": false }, @@ -11929,8 +12504,8 @@ "question__title": "Capitalize the Title", "question__title_slug": "capitalize-the-title", "question__hide": false, - "total_acs": 44548, - "total_submitted": 71442, + "total_acs": 44963, + "total_submitted": 72109, "frontend_question_id": 2129, "is_new_question": false }, @@ -11952,8 +12527,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": 10922, - "total_submitted": 29030, + "total_acs": 10977, + "total_submitted": 29161, "frontend_question_id": 2111, "is_new_question": false }, @@ -11975,8 +12550,8 @@ "question__title": "Number of Smooth Descent Periods of a Stock", "question__title_slug": "number-of-smooth-descent-periods-of-a-stock", "question__hide": false, - "total_acs": 29035, - "total_submitted": 50084, + "total_acs": 29198, + "total_submitted": 50347, "frontend_question_id": 2110, "is_new_question": false }, @@ -11998,8 +12573,8 @@ "question__title": "Adding Spaces to a String", "question__title_slug": "adding-spaces-to-a-string", "question__hide": false, - "total_acs": 31528, - "total_submitted": 55759, + "total_acs": 31750, + "total_submitted": 56154, "frontend_question_id": 2109, "is_new_question": false }, @@ -12021,8 +12596,8 @@ "question__title": "Find First Palindromic String in the Array", "question__title_slug": "find-first-palindromic-string-in-the-array", "question__hide": false, - "total_acs": 85825, - "total_submitted": 109225, + "total_acs": 86723, + "total_submitted": 110323, "frontend_question_id": 2108, "is_new_question": false }, @@ -12044,8 +12619,8 @@ "question__title": "Minimum Cost to Reach City With Discounts", "question__title_slug": "minimum-cost-to-reach-city-with-discounts", "question__hide": false, - "total_acs": 3974, - "total_submitted": 7066, + "total_acs": 3999, + "total_submitted": 7108, "frontend_question_id": 2093, "is_new_question": false }, @@ -12067,8 +12642,8 @@ "question__title": "Maximum Fruits Harvested After at Most K Steps", "question__title_slug": "maximum-fruits-harvested-after-at-most-k-steps", "question__hide": false, - "total_acs": 8678, - "total_submitted": 24783, + "total_acs": 8792, + "total_submitted": 25040, "frontend_question_id": 2106, "is_new_question": false }, @@ -12090,8 +12665,8 @@ "question__title": "Watering Plants II", "question__title_slug": "watering-plants-ii", "question__hide": false, - "total_acs": 15633, - "total_submitted": 31884, + "total_acs": 15745, + "total_submitted": 32129, "frontend_question_id": 2105, "is_new_question": false }, @@ -12113,8 +12688,8 @@ "question__title": "Sum of Subarray Ranges", "question__title_slug": "sum-of-subarray-ranges", "question__hide": false, - "total_acs": 68629, - "total_submitted": 113619, + "total_acs": 68958, + "total_submitted": 114137, "frontend_question_id": 2104, "is_new_question": false }, @@ -12136,8 +12711,8 @@ "question__title": "Rings and Rods", "question__title_slug": "rings-and-rods", "question__hide": false, - "total_acs": 53737, - "total_submitted": 66198, + "total_acs": 54306, + "total_submitted": 66927, "frontend_question_id": 2103, "is_new_question": false }, @@ -12159,8 +12734,8 @@ "question__title": "Substrings That Begin and End With the Same Letter", "question__title_slug": "substrings-that-begin-and-end-with-the-same-letter", "question__hide": false, - "total_acs": 5233, - "total_submitted": 7709, + "total_acs": 5250, + "total_submitted": 7731, "frontend_question_id": 2083, "is_new_question": false }, @@ -12182,8 +12757,8 @@ "question__title": "Drop Type 1 Orders for Customers With Type 0 Orders", "question__title_slug": "drop-type-1-orders-for-customers-with-type-0-orders", "question__hide": false, - "total_acs": 7367, - "total_submitted": 8358, + "total_acs": 7428, + "total_submitted": 8447, "frontend_question_id": 2084, "is_new_question": false }, @@ -12205,8 +12780,8 @@ "question__title": "The Number of Rich Customers", "question__title_slug": "the-number-of-rich-customers", "question__hide": false, - "total_acs": 8496, - "total_submitted": 10645, + "total_acs": 8556, + "total_submitted": 10726, "frontend_question_id": 2082, "is_new_question": false }, @@ -12228,8 +12803,8 @@ "question__title": "Abbreviating the Product of a Range", "question__title_slug": "abbreviating-the-product-of-a-range", "question__hide": false, - "total_acs": 2695, - "total_submitted": 9994, + "total_acs": 2716, + "total_submitted": 10083, "frontend_question_id": 2117, "is_new_question": false }, @@ -12251,8 +12826,8 @@ "question__title": "Check if a Parentheses String Can Be Valid", "question__title_slug": "check-if-a-parentheses-string-can-be-valid", "question__hide": false, - "total_acs": 15634, - "total_submitted": 50587, + "total_acs": 15779, + "total_submitted": 51017, "frontend_question_id": 2116, "is_new_question": false }, @@ -12274,8 +12849,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": 66002, - "total_submitted": 136221, + "total_acs": 66758, + "total_submitted": 137419, "frontend_question_id": 2115, "is_new_question": false }, @@ -12297,8 +12872,8 @@ "question__title": "Maximum Number of Words Found in Sentences", "question__title_slug": "maximum-number-of-words-found-in-sentences", "question__hide": false, - "total_acs": 181381, - "total_submitted": 208430, + "total_acs": 184024, + "total_submitted": 211738, "frontend_question_id": 2114, "is_new_question": false }, @@ -12320,8 +12895,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": 3056, - "total_submitted": 5528, + "total_acs": 3072, + "total_submitted": 5554, "frontend_question_id": 2077, "is_new_question": false }, @@ -12343,8 +12918,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": 81312, - "total_submitted": 167780, + "total_acs": 81679, + "total_submitted": 168562, "frontend_question_id": 2096, "is_new_question": false }, @@ -12366,8 +12941,8 @@ "question__title": "Delete the Middle Node of a Linked List", "question__title_slug": "delete-the-middle-node-of-a-linked-list", "question__hide": false, - "total_acs": 186430, - "total_submitted": 314304, + "total_acs": 188953, + "total_submitted": 318700, "frontend_question_id": 2095, "is_new_question": false }, @@ -12389,8 +12964,8 @@ "question__title": "Finding 3-Digit Even Numbers", "question__title_slug": "finding-3-digit-even-numbers", "question__hide": false, - "total_acs": 23093, - "total_submitted": 39899, + "total_acs": 23281, + "total_submitted": 40189, "frontend_question_id": 2094, "is_new_question": false }, @@ -12412,8 +12987,8 @@ "question__title": "The Winner University", "question__title_slug": "the-winner-university", "question__hide": false, - "total_acs": 8053, - "total_submitted": 11131, + "total_acs": 8115, + "total_submitted": 11198, "frontend_question_id": 2072, "is_new_question": false }, @@ -12435,8 +13010,8 @@ "question__title": "Find All People With Secret", "question__title_slug": "find-all-people-with-secret", "question__hide": false, - "total_acs": 20910, - "total_submitted": 61109, + "total_acs": 21042, + "total_submitted": 61475, "frontend_question_id": 2092, "is_new_question": false }, @@ -12458,8 +13033,8 @@ "question__title": "Removing Minimum and Maximum From Array", "question__title_slug": "removing-minimum-and-maximum-from-array", "question__hide": false, - "total_acs": 29772, - "total_submitted": 53662, + "total_acs": 30024, + "total_submitted": 54123, "frontend_question_id": 2091, "is_new_question": false }, @@ -12481,8 +13056,8 @@ "question__title": "K Radius Subarray Averages", "question__title_slug": "k-radius-subarray-averages", "question__hide": false, - "total_acs": 23542, - "total_submitted": 55104, + "total_acs": 23693, + "total_submitted": 55416, "frontend_question_id": 2090, "is_new_question": false }, @@ -12504,8 +13079,8 @@ "question__title": "Find Target Indices After Sorting Array", "question__title_slug": "find-target-indices-after-sorting-array", "question__hide": false, - "total_acs": 116168, - "total_submitted": 152675, + "total_acs": 117574, + "total_submitted": 154587, "frontend_question_id": 2089, "is_new_question": false }, @@ -12527,8 +13102,8 @@ "question__title": "Number of Equal Count Substrings", "question__title_slug": "number-of-equal-count-substrings", "question__hide": false, - "total_acs": 1926, - "total_submitted": 3977, + "total_acs": 1939, + "total_submitted": 4004, "frontend_question_id": 2067, "is_new_question": false }, @@ -12550,8 +13125,8 @@ "question__title": "Account Balance", "question__title_slug": "account-balance", "question__hide": false, - "total_acs": 6772, - "total_submitted": 8035, + "total_acs": 6830, + "total_submitted": 8140, "frontend_question_id": 2066, "is_new_question": false }, @@ -12573,8 +13148,8 @@ "question__title": "Sequentially Ordinal Rank Tracker", "question__title_slug": "sequentially-ordinal-rank-tracker", "question__hide": false, - "total_acs": 12419, - "total_submitted": 18919, + "total_acs": 12630, + "total_submitted": 19229, "frontend_question_id": 2102, "is_new_question": false }, @@ -12590,14 +13165,14 @@ { "stat": { "question_id": 2206, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "detonate-the-maximum-bombs", + "question__article__has_video_solution": false, "question__title": "Detonate the Maximum Bombs", "question__title_slug": "detonate-the-maximum-bombs", "question__hide": false, - "total_acs": 30725, - "total_submitted": 73006, + "total_acs": 31520, + "total_submitted": 74604, "frontend_question_id": 2101, "is_new_question": false }, @@ -12619,8 +13194,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": 20547, - "total_submitted": 41907, + "total_acs": 20677, + "total_submitted": 42168, "frontend_question_id": 2100, "is_new_question": false }, @@ -12642,8 +13217,8 @@ "question__title": "Find Subsequence of Length K With the Largest Sum", "question__title_slug": "find-subsequence-of-length-k-with-the-largest-sum", "question__hide": false, - "total_acs": 33495, - "total_submitted": 78214, + "total_acs": 33827, + "total_submitted": 79015, "frontend_question_id": 2099, "is_new_question": false }, @@ -12665,8 +13240,8 @@ "question__title": "Number of Spaces Cleaning Robot Cleaned", "question__title_slug": "number-of-spaces-cleaning-robot-cleaned", "question__hide": false, - "total_acs": 3557, - "total_submitted": 6528, + "total_acs": 3590, + "total_submitted": 6567, "frontend_question_id": 2061, "is_new_question": false }, @@ -12688,8 +13263,8 @@ "question__title": "Sum of k-Mirror Numbers", "question__title_slug": "sum-of-k-mirror-numbers", "question__hide": false, - "total_acs": 6345, - "total_submitted": 15146, + "total_acs": 6366, + "total_submitted": 15183, "frontend_question_id": 2081, "is_new_question": false }, @@ -12711,8 +13286,8 @@ "question__title": "Valid Arrangement of Pairs", "question__title_slug": "valid-arrangement-of-pairs", "question__hide": false, - "total_acs": 7145, - "total_submitted": 17311, + "total_acs": 7207, + "total_submitted": 17437, "frontend_question_id": 2097, "is_new_question": false }, @@ -12734,8 +13309,8 @@ "question__title": "Stamping the Grid", "question__title_slug": "stamping-the-grid", "question__hide": false, - "total_acs": 5684, - "total_submitted": 17965, + "total_acs": 5710, + "total_submitted": 18044, "frontend_question_id": 2132, "is_new_question": false }, @@ -12757,8 +13332,8 @@ "question__title": "Two Furthest Houses With Different Colors", "question__title_slug": "two-furthest-houses-with-different-colors", "question__hide": false, - "total_acs": 41280, - "total_submitted": 61662, + "total_acs": 41583, + "total_submitted": 62262, "frontend_question_id": 2078, "is_new_question": false }, @@ -12780,8 +13355,8 @@ "question__title": "Process Restricted Friend Requests", "question__title_slug": "process-restricted-friend-requests", "question__hide": false, - "total_acs": 13683, - "total_submitted": 25750, + "total_acs": 13758, + "total_submitted": 25849, "frontend_question_id": 2076, "is_new_question": false }, @@ -12803,8 +13378,8 @@ "question__title": "Decode the Slanted Ciphertext", "question__title_slug": "decode-the-slanted-ciphertext", "question__hide": false, - "total_acs": 11088, - "total_submitted": 22189, + "total_acs": 11145, + "total_submitted": 22296, "frontend_question_id": 2075, "is_new_question": false }, @@ -12826,8 +13401,8 @@ "question__title": "Reverse Nodes in Even Length Groups", "question__title_slug": "reverse-nodes-in-even-length-groups", "question__hide": false, - "total_acs": 16274, - "total_submitted": 30284, + "total_acs": 16459, + "total_submitted": 30558, "frontend_question_id": 2074, "is_new_question": false }, @@ -12849,8 +13424,8 @@ "question__title": "Time Needed to Buy Tickets", "question__title_slug": "time-needed-to-buy-tickets", "question__hide": false, - "total_acs": 41363, - "total_submitted": 66331, + "total_acs": 41786, + "total_submitted": 66991, "frontend_question_id": 2073, "is_new_question": false }, @@ -12872,8 +13447,8 @@ "question__title": "The Category of Each Member in the Store", "question__title_slug": "the-category-of-each-member-in-the-store", "question__hide": false, - "total_acs": 5674, - "total_submitted": 7996, + "total_acs": 5723, + "total_submitted": 8059, "frontend_question_id": 2051, "is_new_question": false }, @@ -12895,8 +13470,8 @@ "question__title": "Count Fertile Pyramids in a Land", "question__title_slug": "count-fertile-pyramids-in-a-land", "question__hide": false, - "total_acs": 5902, - "total_submitted": 9320, + "total_acs": 5943, + "total_submitted": 9434, "frontend_question_id": 2088, "is_new_question": false }, @@ -12918,8 +13493,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": 13688, - "total_submitted": 26905, + "total_acs": 13753, + "total_submitted": 27063, "frontend_question_id": 2087, "is_new_question": false }, @@ -12941,8 +13516,8 @@ "question__title": "Minimum Number of Food Buckets to Feed the Hamsters", "question__title_slug": "minimum-number-of-food-buckets-to-feed-the-hamsters", "question__hide": false, - "total_acs": 14570, - "total_submitted": 32485, + "total_acs": 14649, + "total_submitted": 32653, "frontend_question_id": 2086, "is_new_question": false }, @@ -12964,8 +13539,8 @@ "question__title": "Count Common Words With One Occurrence", "question__title_slug": "count-common-words-with-one-occurrence", "question__hide": false, - "total_acs": 45662, - "total_submitted": 65167, + "total_acs": 46198, + "total_submitted": 65985, "frontend_question_id": 2085, "is_new_question": false }, @@ -12987,8 +13562,8 @@ "question__title": "Maximum Path Quality of a Graph", "question__title_slug": "maximum-path-quality-of-a-graph", "question__hide": false, - "total_acs": 15180, - "total_submitted": 26712, + "total_acs": 15281, + "total_submitted": 26886, "frontend_question_id": 2065, "is_new_question": false }, @@ -13010,8 +13585,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": 20097, - "total_submitted": 39752, + "total_acs": 20235, + "total_submitted": 40019, "frontend_question_id": 2064, "is_new_question": false }, @@ -13033,8 +13608,8 @@ "question__title": "Vowels of All Substrings", "question__title_slug": "vowels-of-all-substrings", "question__hide": false, - "total_acs": 21858, - "total_submitted": 40070, + "total_acs": 22061, + "total_submitted": 40403, "frontend_question_id": 2063, "is_new_question": false }, @@ -13056,8 +13631,8 @@ "question__title": "Count Vowel Substrings of a String", "question__title_slug": "count-vowel-substrings-of-a-string", "question__hide": false, - "total_acs": 27993, - "total_submitted": 42391, + "total_acs": 28304, + "total_submitted": 42826, "frontend_question_id": 2062, "is_new_question": false }, @@ -13079,8 +13654,8 @@ "question__title": "Accepted Candidates From the Interviews", "question__title_slug": "accepted-candidates-from-the-interviews", "question__hide": false, - "total_acs": 6398, - "total_submitted": 8074, + "total_acs": 6449, + "total_submitted": 8148, "frontend_question_id": 2041, "is_new_question": false }, @@ -13102,8 +13677,8 @@ "question__title": "Check if an Original String Exists Given Two Encoded Strings", "question__title_slug": "check-if-an-original-string-exists-given-two-encoded-strings", "question__hide": false, - "total_acs": 9133, - "total_submitted": 22608, + "total_acs": 9171, + "total_submitted": 22711, "frontend_question_id": 2060, "is_new_question": false }, @@ -13125,8 +13700,8 @@ "question__title": "Minimum Operations to Convert Number", "question__title_slug": "minimum-operations-to-convert-number", "question__hide": false, - "total_acs": 13319, - "total_submitted": 27848, + "total_acs": 13364, + "total_submitted": 27979, "frontend_question_id": 2059, "is_new_question": false }, @@ -13148,8 +13723,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": 23406, - "total_submitted": 41157, + "total_acs": 23682, + "total_submitted": 41571, "frontend_question_id": 2058, "is_new_question": false }, @@ -13171,8 +13746,8 @@ "question__title": "Smallest Index With Equal Value", "question__title_slug": "smallest-index-with-equal-value", "question__hide": false, - "total_acs": 42212, - "total_submitted": 58825, + "total_acs": 42642, + "total_submitted": 59451, "frontend_question_id": 2057, "is_new_question": false }, @@ -13194,8 +13769,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": 6686, - "total_submitted": 19850, + "total_acs": 6715, + "total_submitted": 20010, "frontend_question_id": 2071, "is_new_question": false }, @@ -13217,8 +13792,8 @@ "question__title": "Most Beautiful Item for Each Query", "question__title_slug": "most-beautiful-item-for-each-query", "question__hide": false, - "total_acs": 12700, - "total_submitted": 25681, + "total_acs": 12798, + "total_submitted": 25900, "frontend_question_id": 2070, "is_new_question": false }, @@ -13240,8 +13815,8 @@ "question__title": "Walking Robot Simulation II", "question__title_slug": "walking-robot-simulation-ii", "question__hide": false, - "total_acs": 8285, - "total_submitted": 35180, + "total_acs": 8382, + "total_submitted": 35456, "frontend_question_id": 2069, "is_new_question": false }, @@ -13263,8 +13838,8 @@ "question__title": "Check Whether Two Strings are Almost Equivalent", "question__title_slug": "check-whether-two-strings-are-almost-equivalent", "question__hide": false, - "total_acs": 34887, - "total_submitted": 54609, + "total_acs": 35372, + "total_submitted": 55343, "frontend_question_id": 2068, "is_new_question": false }, @@ -13286,8 +13861,8 @@ "question__title": "Parallel Courses III", "question__title_slug": "parallel-courses-iii", "question__hide": false, - "total_acs": 18200, - "total_submitted": 30799, + "total_acs": 18333, + "total_submitted": 31005, "frontend_question_id": 2050, "is_new_question": false }, @@ -13309,8 +13884,8 @@ "question__title": "Count Nodes With the Highest Score", "question__title_slug": "count-nodes-with-the-highest-score", "question__hide": false, - "total_acs": 16643, - "total_submitted": 34970, + "total_acs": 16770, + "total_submitted": 35202, "frontend_question_id": 2049, "is_new_question": false }, @@ -13332,8 +13907,8 @@ "question__title": "Next Greater Numerically Balanced Number", "question__title_slug": "next-greater-numerically-balanced-number", "question__hide": false, - "total_acs": 11049, - "total_submitted": 23401, + "total_acs": 11098, + "total_submitted": 23483, "frontend_question_id": 2048, "is_new_question": false }, @@ -13355,8 +13930,8 @@ "question__title": "Number of Valid Words in a Sentence", "question__title_slug": "number-of-valid-words-in-a-sentence", "question__hide": false, - "total_acs": 21918, - "total_submitted": 75346, + "total_acs": 22067, + "total_submitted": 75973, "frontend_question_id": 2047, "is_new_question": false }, @@ -13378,8 +13953,8 @@ "question__title": "Low-Quality Problems", "question__title_slug": "low-quality-problems", "question__hide": false, - "total_acs": 9047, - "total_submitted": 10665, + "total_acs": 9115, + "total_submitted": 10766, "frontend_question_id": 2026, "is_new_question": false }, @@ -13401,8 +13976,8 @@ "question__title": "Second Minimum Time to Reach Destination", "question__title_slug": "second-minimum-time-to-reach-destination", "question__hide": false, - "total_acs": 8814, - "total_submitted": 22425, + "total_acs": 8854, + "total_submitted": 22542, "frontend_question_id": 2045, "is_new_question": false }, @@ -13424,8 +13999,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": 21019, - "total_submitted": 27802, + "total_acs": 21181, + "total_submitted": 28015, "frontend_question_id": 2044, "is_new_question": false }, @@ -13447,8 +14022,8 @@ "question__title": "Simple Bank System", "question__title_slug": "simple-bank-system", "question__hide": false, - "total_acs": 18576, - "total_submitted": 28466, + "total_acs": 18747, + "total_submitted": 28728, "frontend_question_id": 2043, "is_new_question": false }, @@ -13470,8 +14045,8 @@ "question__title": "Check if Numbers Are Ascending in a Sentence", "question__title_slug": "check-if-numbers-are-ascending-in-a-sentence", "question__hide": false, - "total_acs": 41717, - "total_submitted": 61887, + "total_acs": 42076, + "total_submitted": 62376, "frontend_question_id": 2042, "is_new_question": false }, @@ -13493,8 +14068,8 @@ "question__title": "Number of Accounts That Did Not Stream", "question__title_slug": "number-of-accounts-that-did-not-stream", "question__hide": false, - "total_acs": 7900, - "total_submitted": 10834, + "total_acs": 7947, + "total_submitted": 10936, "frontend_question_id": 2020, "is_new_question": false }, @@ -13516,8 +14091,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": 3438, - "total_submitted": 6256, + "total_acs": 3446, + "total_submitted": 6292, "frontend_question_id": 2056, "is_new_question": false }, @@ -13539,8 +14114,8 @@ "question__title": "Plates Between Candles", "question__title_slug": "plates-between-candles", "question__hide": false, - "total_acs": 29996, - "total_submitted": 67306, + "total_acs": 30136, + "total_submitted": 67614, "frontend_question_id": 2055, "is_new_question": false }, @@ -13562,8 +14137,8 @@ "question__title": "Two Best Non-Overlapping Events", "question__title_slug": "two-best-non-overlapping-events", "question__hide": false, - "total_acs": 13744, - "total_submitted": 30368, + "total_acs": 13856, + "total_submitted": 30604, "frontend_question_id": 2054, "is_new_question": false }, @@ -13585,8 +14160,8 @@ "question__title": "Kth Distinct String in an Array", "question__title_slug": "kth-distinct-string-in-an-array", "question__hide": false, - "total_acs": 44406, - "total_submitted": 61505, + "total_acs": 44850, + "total_submitted": 62186, "frontend_question_id": 2053, "is_new_question": false }, @@ -13608,8 +14183,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": 13896, - "total_submitted": 73587, + "total_acs": 14068, + "total_submitted": 74317, "frontend_question_id": 2035, "is_new_question": false }, @@ -13631,8 +14206,8 @@ "question__title": "Stock Price Fluctuation ", "question__title_slug": "stock-price-fluctuation", "question__hide": false, - "total_acs": 56623, - "total_submitted": 115978, + "total_acs": 56840, + "total_submitted": 116415, "frontend_question_id": 2034, "is_new_question": false }, @@ -13654,8 +14229,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": 19011, - "total_submitted": 36326, + "total_acs": 19111, + "total_submitted": 36566, "frontend_question_id": 2033, "is_new_question": false }, @@ -13677,8 +14252,8 @@ "question__title": "Two Out of Three", "question__title_slug": "two-out-of-three", "question__hide": false, - "total_acs": 47424, - "total_submitted": 64406, + "total_acs": 47941, + "total_submitted": 65062, "frontend_question_id": 2032, "is_new_question": false }, @@ -13700,8 +14275,8 @@ "question__title": "The Number of Seniors and Juniors to Join the Company II", "question__title_slug": "the-number-of-seniors-and-juniors-to-join-the-company-ii", "question__hide": false, - "total_acs": 4178, - "total_submitted": 6945, + "total_acs": 4225, + "total_submitted": 7005, "frontend_question_id": 2010, "is_new_question": false }, @@ -13723,8 +14298,8 @@ "question__title": "Smallest K-Length Subsequence With Occurrences of a Letter", "question__title_slug": "smallest-k-length-subsequence-with-occurrences-of-a-letter", "question__hide": false, - "total_acs": 6242, - "total_submitted": 16193, + "total_acs": 6288, + "total_submitted": 16340, "frontend_question_id": 2030, "is_new_question": false }, @@ -13746,8 +14321,8 @@ "question__title": "Stone Game IX", "question__title_slug": "stone-game-ix", "question__hide": false, - "total_acs": 6472, - "total_submitted": 24248, + "total_acs": 6504, + "total_submitted": 24347, "frontend_question_id": 2029, "is_new_question": false }, @@ -13769,8 +14344,8 @@ "question__title": "Find Missing Observations", "question__title_slug": "find-missing-observations", "question__hide": false, - "total_acs": 21337, - "total_submitted": 47644, + "total_acs": 21552, + "total_submitted": 48094, "frontend_question_id": 2028, "is_new_question": false }, @@ -13792,8 +14367,8 @@ "question__title": "Minimum Moves to Convert String", "question__title_slug": "minimum-moves-to-convert-string", "question__hide": false, - "total_acs": 27478, - "total_submitted": 50829, + "total_acs": 27681, + "total_submitted": 51205, "frontend_question_id": 2027, "is_new_question": false }, @@ -13815,8 +14390,8 @@ "question__title": "Subtree Removal Game with Fibonacci Tree", "question__title_slug": "subtree-removal-game-with-fibonacci-tree", "question__hide": false, - "total_acs": 480, - "total_submitted": 770, + "total_acs": 488, + "total_submitted": 786, "frontend_question_id": 2005, "is_new_question": false }, @@ -13838,8 +14413,8 @@ "question__title": "The Number of Seniors and Juniors to Join the Company", "question__title_slug": "the-number-of-seniors-and-juniors-to-join-the-company", "question__hide": false, - "total_acs": 6183, - "total_submitted": 15256, + "total_acs": 6237, + "total_submitted": 15363, "frontend_question_id": 2004, "is_new_question": false }, @@ -13861,8 +14436,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": 10849, - "total_submitted": 21321, + "total_acs": 10902, + "total_submitted": 21429, "frontend_question_id": 2039, "is_new_question": false }, @@ -13884,8 +14459,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": 9115, - "total_submitted": 31731, + "total_acs": 9153, + "total_submitted": 31885, "frontend_question_id": 2040, "is_new_question": false }, @@ -13907,8 +14482,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": 24467, - "total_submitted": 42193, + "total_acs": 24694, + "total_submitted": 42627, "frontend_question_id": 2038, "is_new_question": false }, @@ -13930,8 +14505,8 @@ "question__title": "Minimum Number of Moves to Seat Everyone", "question__title_slug": "minimum-number-of-moves-to-seat-everyone", "question__hide": false, - "total_acs": 48007, - "total_submitted": 58420, + "total_acs": 48511, + "total_submitted": 59285, "frontend_question_id": 2037, "is_new_question": false }, @@ -13953,8 +14528,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": 5765, - "total_submitted": 17197, + "total_acs": 5800, + "total_submitted": 17569, "frontend_question_id": 2019, "is_new_question": false }, @@ -13976,8 +14551,8 @@ "question__title": "Check if Word Can Be Placed In Crossword", "question__title_slug": "check-if-word-can-be-placed-in-crossword", "question__hide": false, - "total_acs": 17292, - "total_submitted": 34967, + "total_acs": 17359, + "total_submitted": 35301, "frontend_question_id": 2018, "is_new_question": false }, @@ -13999,8 +14574,8 @@ "question__title": "Grid Game", "question__title_slug": "grid-game", "question__hide": false, - "total_acs": 15777, - "total_submitted": 36116, + "total_acs": 15952, + "total_submitted": 36462, "frontend_question_id": 2017, "is_new_question": false }, @@ -14022,8 +14597,8 @@ "question__title": "Maximum Difference Between Increasing Elements", "question__title_slug": "maximum-difference-between-increasing-elements", "question__hide": false, - "total_acs": 59505, - "total_submitted": 109455, + "total_acs": 59919, + "total_submitted": 110158, "frontend_question_id": 2016, "is_new_question": false }, @@ -14045,8 +14620,8 @@ "question__title": "Count the Number of Experiments", "question__title_slug": "count-the-number-of-experiments", "question__hide": false, - "total_acs": 5185, - "total_submitted": 10327, + "total_acs": 5225, + "total_submitted": 10405, "frontend_question_id": 1990, "is_new_question": false }, @@ -14068,8 +14643,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": 1578, - "total_submitted": 2680, + "total_acs": 1589, + "total_submitted": 2697, "frontend_question_id": 2015, "is_new_question": false }, @@ -14091,8 +14666,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": 1292, - "total_submitted": 2607, + "total_acs": 1299, + "total_submitted": 2620, "frontend_question_id": 1999, "is_new_question": false }, @@ -14114,8 +14689,8 @@ "question__title": "Longest Subsequence Repeated k Times", "question__title_slug": "longest-subsequence-repeated-k-times", "question__hide": false, - "total_acs": 5867, - "total_submitted": 10578, + "total_acs": 5899, + "total_submitted": 10636, "frontend_question_id": 2014, "is_new_question": false }, @@ -14137,8 +14712,8 @@ "question__title": "Detect Squares", "question__title_slug": "detect-squares", "question__hide": false, - "total_acs": 45520, - "total_submitted": 90546, + "total_acs": 45812, + "total_submitted": 91141, "frontend_question_id": 2013, "is_new_question": false }, @@ -14160,8 +14735,8 @@ "question__title": "Sum of Beauty in the Array", "question__title_slug": "sum-of-beauty-in-the-array", "question__hide": false, - "total_acs": 18930, - "total_submitted": 40282, + "total_acs": 19035, + "total_submitted": 40437, "frontend_question_id": 2012, "is_new_question": false }, @@ -14183,8 +14758,8 @@ "question__title": "Final Value of Variable After Performing Operations", "question__title_slug": "final-value-of-variable-after-performing-operations", "question__hide": false, - "total_acs": 227418, - "total_submitted": 256405, + "total_acs": 230768, + "total_submitted": 260253, "frontend_question_id": 2011, "is_new_question": false }, @@ -14206,8 +14781,8 @@ "question__title": "Find Cutoff Score for Each School", "question__title_slug": "find-cutoff-score-for-each-school", "question__hide": false, - "total_acs": 8967, - "total_submitted": 13159, + "total_acs": 9039, + "total_submitted": 13272, "frontend_question_id": 1988, "is_new_question": false }, @@ -14229,8 +14804,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": 7055, - "total_submitted": 21524, + "total_acs": 7096, + "total_submitted": 21622, "frontend_question_id": 2025, "is_new_question": false }, @@ -14252,8 +14827,8 @@ "question__title": "Maximize the Confusion of an Exam", "question__title_slug": "maximize-the-confusion-of-an-exam", "question__hide": false, - "total_acs": 25377, - "total_submitted": 41936, + "total_acs": 25640, + "total_submitted": 42342, "frontend_question_id": 2024, "is_new_question": false }, @@ -14275,8 +14850,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": 32036, - "total_submitted": 43564, + "total_acs": 32341, + "total_submitted": 43992, "frontend_question_id": 2023, "is_new_question": false }, @@ -14298,8 +14873,8 @@ "question__title": "Convert 1D Array Into 2D Array", "question__title_slug": "convert-1d-array-into-2d-array", "question__hide": false, - "total_acs": 58335, - "total_submitted": 98502, + "total_acs": 58882, + "total_submitted": 99343, "frontend_question_id": 2022, "is_new_question": false }, @@ -14321,8 +14896,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": 6565, - "total_submitted": 14671, + "total_acs": 6594, + "total_submitted": 14722, "frontend_question_id": 2003, "is_new_question": false }, @@ -14344,8 +14919,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": 18416, - "total_submitted": 33761, + "total_acs": 18624, + "total_submitted": 34069, "frontend_question_id": 2002, "is_new_question": false }, @@ -14367,8 +14942,8 @@ "question__title": "Number of Pairs of Interchangeable Rectangles", "question__title_slug": "number-of-pairs-of-interchangeable-rectangles", "question__hide": false, - "total_acs": 24810, - "total_submitted": 53594, + "total_acs": 25109, + "total_submitted": 54159, "frontend_question_id": 2001, "is_new_question": false }, @@ -14390,8 +14965,8 @@ "question__title": "Reverse Prefix of Word", "question__title_slug": "reverse-prefix-of-word", "question__hide": false, - "total_acs": 64711, - "total_submitted": 81999, + "total_acs": 65641, + "total_submitted": 83133, "frontend_question_id": 2000, "is_new_question": false }, @@ -14413,8 +14988,8 @@ "question__title": "Employees Whose Manager Left the Company", "question__title_slug": "employees-whose-manager-left-the-company", "question__hide": false, - "total_acs": 10327, - "total_submitted": 21210, + "total_acs": 11238, + "total_submitted": 23293, "frontend_question_id": 1978, "is_new_question": false }, @@ -14436,8 +15011,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": 7840, - "total_submitted": 10442, + "total_acs": 7876, + "total_submitted": 10488, "frontend_question_id": 1973, "is_new_question": false }, @@ -14459,8 +15034,8 @@ "question__title": "GCD Sort of an Array", "question__title_slug": "gcd-sort-of-an-array", "question__hide": false, - "total_acs": 6831, - "total_submitted": 15046, + "total_acs": 6872, + "total_submitted": 15164, "frontend_question_id": 1998, "is_new_question": false }, @@ -14482,8 +15057,8 @@ "question__title": "First Day Where You Have Been in All the Rooms", "question__title_slug": "first-day-where-you-have-been-in-all-the-rooms", "question__hide": false, - "total_acs": 7727, - "total_submitted": 21138, + "total_acs": 7767, + "total_submitted": 21213, "frontend_question_id": 1997, "is_new_question": false }, @@ -14505,8 +15080,8 @@ "question__title": "The Number of Weak Characters in the Game", "question__title_slug": "the-number-of-weak-characters-in-the-game", "question__hide": false, - "total_acs": 94472, - "total_submitted": 215061, + "total_acs": 94718, + "total_submitted": 215653, "frontend_question_id": 1996, "is_new_question": false }, @@ -14528,8 +15103,8 @@ "question__title": "Count Special Quadruplets", "question__title_slug": "count-special-quadruplets", "question__hide": false, - "total_acs": 30972, - "total_submitted": 51736, + "total_acs": 31208, + "total_submitted": 52104, "frontend_question_id": 1995, "is_new_question": false }, @@ -14551,8 +15126,8 @@ "question__title": "Find if Path Exists in Graph", "question__title_slug": "find-if-path-exists-in-graph", "question__hide": false, - "total_acs": 231852, - "total_submitted": 446159, + "total_acs": 233556, + "total_submitted": 449884, "frontend_question_id": 1971, "is_new_question": false }, @@ -14574,8 +15149,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": 7628, - "total_submitted": 14777, + "total_acs": 7695, + "total_submitted": 14912, "frontend_question_id": 1972, "is_new_question": false }, @@ -14597,8 +15172,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": 10884, - "total_submitted": 23939, + "total_acs": 10965, + "total_submitted": 24114, "frontend_question_id": 2009, "is_new_question": false }, @@ -14620,8 +15195,8 @@ "question__title": "Maximum Earnings From Taxi", "question__title_slug": "maximum-earnings-from-taxi", "question__hide": false, - "total_acs": 21705, - "total_submitted": 49809, + "total_acs": 21867, + "total_submitted": 50261, "frontend_question_id": 2008, "is_new_question": false }, @@ -14643,8 +15218,8 @@ "question__title": "Find Original Array From Doubled Array", "question__title_slug": "find-original-array-from-doubled-array", "question__hide": false, - "total_acs": 118209, - "total_submitted": 291019, + "total_acs": 118439, + "total_submitted": 291698, "frontend_question_id": 2007, "is_new_question": false }, @@ -14666,8 +15241,8 @@ "question__title": "Count Number of Pairs With Absolute Difference K", "question__title_slug": "count-number-of-pairs-with-absolute-difference-k", "question__hide": false, - "total_acs": 96457, - "total_submitted": 116549, + "total_acs": 97558, + "total_submitted": 117841, "frontend_question_id": 2006, "is_new_question": false }, @@ -14689,8 +15264,8 @@ "question__title": "Number of Unique Good Subsequences", "question__title_slug": "number-of-unique-good-subsequences", "question__hide": false, - "total_acs": 9348, - "total_submitted": 17996, + "total_acs": 9397, + "total_submitted": 18090, "frontend_question_id": 1987, "is_new_question": false }, @@ -14712,8 +15287,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": 20181, - "total_submitted": 61305, + "total_acs": 20322, + "total_submitted": 61804, "frontend_question_id": 1986, "is_new_question": false }, @@ -14735,8 +15310,8 @@ "question__title": "Find the Kth Largest Integer in the Array", "question__title_slug": "find-the-kth-largest-integer-in-the-array", "question__hide": false, - "total_acs": 46673, - "total_submitted": 104830, + "total_acs": 47107, + "total_submitted": 105762, "frontend_question_id": 1985, "is_new_question": false }, @@ -14758,8 +15333,8 @@ "question__title": "Minimum Difference Between Highest and Lowest of K Scores", "question__title_slug": "minimum-difference-between-highest-and-lowest-of-k-scores", "question__hide": false, - "total_acs": 44769, - "total_submitted": 82042, + "total_acs": 45673, + "total_submitted": 83583, "frontend_question_id": 1984, "is_new_question": false }, @@ -14781,8 +15356,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": 2281, - "total_submitted": 3493, + "total_acs": 2296, + "total_submitted": 3524, "frontend_question_id": 1966, "is_new_question": false }, @@ -14804,8 +15379,8 @@ "question__title": "Employees With Missing Information", "question__title_slug": "employees-with-missing-information", "question__hide": false, - "total_acs": 92818, - "total_submitted": 125226, + "total_acs": 94698, + "total_submitted": 128241, "frontend_question_id": 1965, "is_new_question": false }, @@ -14827,8 +15402,8 @@ "question__title": "Find Array Given Subset Sums", "question__title_slug": "find-array-given-subset-sums", "question__hide": false, - "total_acs": 4238, - "total_submitted": 8865, + "total_acs": 4271, + "total_submitted": 8926, "frontend_question_id": 1982, "is_new_question": false }, @@ -14850,8 +15425,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": 20638, - "total_submitted": 63654, + "total_acs": 20715, + "total_submitted": 63931, "frontend_question_id": 1981, "is_new_question": false }, @@ -14873,8 +15448,8 @@ "question__title": "Find Unique Binary String", "question__title_slug": "find-unique-binary-string", "question__hide": false, - "total_acs": 36780, - "total_submitted": 56375, + "total_acs": 37118, + "total_submitted": 56839, "frontend_question_id": 1980, "is_new_question": false }, @@ -14896,8 +15471,8 @@ "question__title": "Find Greatest Common Divisor of Array", "question__title_slug": "find-greatest-common-divisor-of-array", "question__hide": false, - "total_acs": 82977, - "total_submitted": 107743, + "total_acs": 84253, + "total_submitted": 109357, "frontend_question_id": 1979, "is_new_question": false }, @@ -14919,8 +15494,8 @@ "question__title": "The Number of Good Subsets", "question__title_slug": "the-number-of-good-subsets", "question__hide": false, - "total_acs": 5480, - "total_submitted": 15705, + "total_acs": 5522, + "total_submitted": 15815, "frontend_question_id": 1994, "is_new_question": false }, @@ -14942,8 +15517,8 @@ "question__title": "Operations on Tree", "question__title_slug": "operations-on-tree", "question__hide": false, - "total_acs": 10826, - "total_submitted": 24638, + "total_acs": 11014, + "total_submitted": 24945, "frontend_question_id": 1993, "is_new_question": false }, @@ -14965,8 +15540,8 @@ "question__title": "Find All Groups of Farmland", "question__title_slug": "find-all-groups-of-farmland", "question__hide": false, - "total_acs": 21828, - "total_submitted": 31979, + "total_acs": 21971, + "total_submitted": 32176, "frontend_question_id": 1992, "is_new_question": false }, @@ -14988,8 +15563,8 @@ "question__title": "Find the Middle Index in Array", "question__title_slug": "find-the-middle-index-in-array", "question__hide": false, - "total_acs": 62838, - "total_submitted": 93316, + "total_acs": 63771, + "total_submitted": 94802, "frontend_question_id": 1991, "is_new_question": false }, @@ -15011,8 +15586,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": 11801, - "total_submitted": 23845, + "total_acs": 11880, + "total_submitted": 24009, "frontend_question_id": 1970, "is_new_question": false }, @@ -15034,8 +15609,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": 9077, - "total_submitted": 26465, + "total_acs": 9142, + "total_submitted": 26592, "frontend_question_id": 1969, "is_new_question": false }, @@ -15057,8 +15632,8 @@ "question__title": "Number of Strings That Appear as Substrings in Word", "question__title_slug": "number-of-strings-that-appear-as-substrings-in-word", "question__hide": false, - "total_acs": 48930, - "total_submitted": 61099, + "total_acs": 49590, + "total_submitted": 61889, "frontend_question_id": 1967, "is_new_question": false }, @@ -15080,8 +15655,8 @@ "question__title": "All the Pairs With the Maximum Number of Common Followers", "question__title_slug": "all-the-pairs-with-the-maximum-number-of-common-followers", "question__hide": false, - "total_acs": 9208, - "total_submitted": 13162, + "total_acs": 9305, + "total_submitted": 13315, "frontend_question_id": 1951, "is_new_question": false }, @@ -15103,8 +15678,8 @@ "question__title": "Strong Friendship", "question__title_slug": "strong-friendship", "question__hide": false, - "total_acs": 9331, - "total_submitted": 16728, + "total_acs": 9403, + "total_submitted": 16907, "frontend_question_id": 1949, "is_new_question": false }, @@ -15126,8 +15701,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": 10366, - "total_submitted": 21891, + "total_acs": 48578, + "total_submitted": 75677, "frontend_question_id": 1964, "is_new_question": false }, @@ -15149,8 +15724,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": 46275, - "total_submitted": 66881, + "total_acs": 46752, + "total_submitted": 67509, "frontend_question_id": 1963, "is_new_question": false }, @@ -15172,8 +15747,8 @@ "question__title": "Remove Stones to Minimize the Total", "question__title_slug": "remove-stones-to-minimize-the-total", "question__hide": false, - "total_acs": 79273, - "total_submitted": 131498, + "total_acs": 79818, + "total_submitted": 132282, "frontend_question_id": 1962, "is_new_question": false }, @@ -15195,8 +15770,8 @@ "question__title": "Check If String Is a Prefix of Array", "question__title_slug": "check-if-string-is-a-prefix-of-array", "question__hide": false, - "total_acs": 38285, - "total_submitted": 71845, + "total_acs": 38562, + "total_submitted": 72453, "frontend_question_id": 1961, "is_new_question": false }, @@ -15218,8 +15793,8 @@ "question__title": "Users That Actively Request Confirmation Messages", "question__title_slug": "users-that-actively-request-confirmation-messages", "question__hide": false, - "total_acs": 8585, - "total_submitted": 14664, + "total_acs": 8655, + "total_submitted": 14822, "frontend_question_id": 1939, "is_new_question": false }, @@ -15241,8 +15816,8 @@ "question__title": "Number of Ways to Separate Numbers", "question__title_slug": "number-of-ways-to-separate-numbers", "question__hide": false, - "total_acs": 4604, - "total_submitted": 22461, + "total_acs": 4632, + "total_submitted": 22671, "frontend_question_id": 1977, "is_new_question": false }, @@ -15264,8 +15839,8 @@ "question__title": "Number of Ways to Arrive at Destination", "question__title_slug": "number-of-ways-to-arrive-at-destination", "question__hide": false, - "total_acs": 30710, - "total_submitted": 100392, + "total_acs": 31152, + "total_submitted": 102056, "frontend_question_id": 1976, "is_new_question": false }, @@ -15287,8 +15862,8 @@ "question__title": "Maximum Matrix Sum", "question__title_slug": "maximum-matrix-sum", "question__hide": false, - "total_acs": 15019, - "total_submitted": 30944, + "total_acs": 15100, + "total_submitted": 31072, "frontend_question_id": 1975, "is_new_question": false }, @@ -15310,8 +15885,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": 30815, - "total_submitted": 42368, + "total_acs": 31058, + "total_submitted": 42668, "frontend_question_id": 1974, "is_new_question": false }, @@ -15333,8 +15908,8 @@ "question__title": "Confirmation Rate", "question__title_slug": "confirmation-rate", "question__hide": false, - "total_acs": 11668, - "total_submitted": 16156, + "total_acs": 13066, + "total_submitted": 18706, "frontend_question_id": 1934, "is_new_question": false }, @@ -15356,8 +15931,8 @@ "question__title": "Count Number of Special Subsequences", "question__title_slug": "count-number-of-special-subsequences", "question__hide": false, - "total_acs": 9470, - "total_submitted": 18565, + "total_acs": 9509, + "total_submitted": 18640, "frontend_question_id": 1955, "is_new_question": false }, @@ -15379,8 +15954,8 @@ "question__title": "Array With Elements Not Equal to Average of Neighbors", "question__title_slug": "array-with-elements-not-equal-to-average-of-neighbors", "question__hide": false, - "total_acs": 24832, - "total_submitted": 50368, + "total_acs": 25102, + "total_submitted": 51143, "frontend_question_id": 1968, "is_new_question": false }, @@ -15402,8 +15977,8 @@ "question__title": "Maximum Number of Weeks for Which You Can Work", "question__title_slug": "maximum-number-of-weeks-for-which-you-can-work", "question__hide": false, - "total_acs": 19298, - "total_submitted": 48869, + "total_acs": 19390, + "total_submitted": 49146, "frontend_question_id": 1953, "is_new_question": false }, @@ -15425,8 +16000,8 @@ "question__title": "Three Divisors", "question__title_slug": "three-divisors", "question__hide": false, - "total_acs": 44591, - "total_submitted": 76404, + "total_acs": 45086, + "total_submitted": 77168, "frontend_question_id": 1952, "is_new_question": false }, @@ -15448,8 +16023,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": 1409, - "total_submitted": 2792, + "total_acs": 1416, + "total_submitted": 2807, "frontend_question_id": 2052, "is_new_question": false }, @@ -15471,8 +16046,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": 6958, - "total_submitted": 16467, + "total_acs": 6994, + "total_submitted": 16535, "frontend_question_id": 1959, "is_new_question": false }, @@ -15494,8 +16069,8 @@ "question__title": "Check if Move is Legal", "question__title_slug": "check-if-move-is-legal", "question__hide": false, - "total_acs": 9269, - "total_submitted": 20377, + "total_acs": 9343, + "total_submitted": 20506, "frontend_question_id": 1958, "is_new_question": false }, @@ -15517,8 +16092,8 @@ "question__title": "Delete Duplicate Folders in System", "question__title_slug": "delete-duplicate-folders-in-system", "question__hide": false, - "total_acs": 7232, - "total_submitted": 12863, + "total_acs": 7274, + "total_submitted": 12929, "frontend_question_id": 1948, "is_new_question": false }, @@ -15540,8 +16115,8 @@ "question__title": "Maximum Compatibility Score Sum", "question__title_slug": "maximum-compatibility-score-sum", "question__hide": false, - "total_acs": 19727, - "total_submitted": 32215, + "total_acs": 19818, + "total_submitted": 32371, "frontend_question_id": 1947, "is_new_question": false }, @@ -15563,8 +16138,8 @@ "question__title": "Largest Number After Mutating Substring", "question__title_slug": "largest-number-after-mutating-substring", "question__hide": false, - "total_acs": 17458, - "total_submitted": 50103, + "total_acs": 17533, + "total_submitted": 50269, "frontend_question_id": 1946, "is_new_question": false }, @@ -15586,8 +16161,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": 40535, - "total_submitted": 65700, + "total_acs": 40870, + "total_submitted": 66239, "frontend_question_id": 1945, "is_new_question": false }, @@ -15609,8 +16184,8 @@ "question__title": "Brightest Position on Street", "question__title_slug": "brightest-position-on-street", "question__hide": false, - "total_acs": 4396, - "total_submitted": 7073, + "total_acs": 4437, + "total_submitted": 7138, "frontend_question_id": 2021, "is_new_question": false }, @@ -15633,7 +16208,7 @@ "question__title_slug": "erect-the-fence-ii", "question__hide": false, "total_acs": 579, - "total_submitted": 1096, + "total_submitted": 1097, "frontend_question_id": 1924, "is_new_question": false }, @@ -15656,7 +16231,7 @@ "question__title_slug": "minimum-time-for-k-virus-variants-to-spread", "question__hide": false, "total_acs": 718, - "total_submitted": 1483, + "total_submitted": 1491, "frontend_question_id": 1956, "is_new_question": false }, @@ -15678,8 +16253,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": 2483, - "total_submitted": 5003, + "total_acs": 2488, + "total_submitted": 5011, "frontend_question_id": 1950, "is_new_question": false }, @@ -15701,8 +16276,8 @@ "question__title": "Longest Common Subsequence Between Sorted Arrays", "question__title_slug": "longest-common-subsequence-between-sorted-arrays", "question__hide": false, - "total_acs": 5181, - "total_submitted": 6574, + "total_acs": 5211, + "total_submitted": 6614, "frontend_question_id": 1940, "is_new_question": false }, @@ -15724,8 +16299,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": 2980, - "total_submitted": 5909, + "total_acs": 3009, + "total_submitted": 5953, "frontend_question_id": 1933, "is_new_question": false }, @@ -15747,8 +16322,8 @@ "question__title": "Kth Smallest Subarray Sum", "question__title_slug": "kth-smallest-subarray-sum", "question__hide": false, - "total_acs": 3345, - "total_submitted": 6374, + "total_acs": 3362, + "total_submitted": 6407, "frontend_question_id": 1918, "is_new_question": false }, @@ -15770,8 +16345,8 @@ "question__title": "Maximum Genetic Difference Query", "question__title_slug": "maximum-genetic-difference-query", "question__hide": false, - "total_acs": 4294, - "total_submitted": 10819, + "total_acs": 4311, + "total_submitted": 10844, "frontend_question_id": 1938, "is_new_question": false }, @@ -15793,8 +16368,8 @@ "question__title": "Maximum Number of Points with Cost", "question__title_slug": "maximum-number-of-points-with-cost", "question__hide": false, - "total_acs": 54443, - "total_submitted": 151154, + "total_acs": 54564, + "total_submitted": 151537, "frontend_question_id": 1937, "is_new_question": false }, @@ -15816,8 +16391,8 @@ "question__title": "Add Minimum Number of Rungs", "question__title_slug": "add-minimum-number-of-rungs", "question__hide": false, - "total_acs": 23269, - "total_submitted": 54222, + "total_acs": 23398, + "total_submitted": 54489, "frontend_question_id": 1936, "is_new_question": false }, @@ -15839,8 +16414,8 @@ "question__title": "Check for Contradictions in Equations", "question__title_slug": "check-for-contradictions-in-equations", "question__hide": false, - "total_acs": 891, - "total_submitted": 2041, + "total_acs": 912, + "total_submitted": 2077, "frontend_question_id": 2307, "is_new_question": false }, @@ -15862,8 +16437,8 @@ "question__title": "Leetcodify Similar Friends", "question__title_slug": "leetcodify-similar-friends", "question__hide": false, - "total_acs": 4133, - "total_submitted": 9845, + "total_acs": 4175, + "total_submitted": 9935, "frontend_question_id": 1919, "is_new_question": false }, @@ -15885,8 +16460,8 @@ "question__title": "Leetcodify Friends Recommendations", "question__title_slug": "leetcodify-friends-recommendations", "question__hide": false, - "total_acs": 4905, - "total_submitted": 17611, + "total_acs": 4952, + "total_submitted": 17712, "frontend_question_id": 1917, "is_new_question": false }, @@ -15908,8 +16483,8 @@ "question__title": "Game of Nim", "question__title_slug": "game-of-nim", "question__hide": false, - "total_acs": 3941, - "total_submitted": 6105, + "total_acs": 3963, + "total_submitted": 6141, "frontend_question_id": 1908, "is_new_question": false }, @@ -15931,8 +16506,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": 7806, - "total_submitted": 13662, + "total_acs": 7869, + "total_submitted": 13748, "frontend_question_id": 1931, "is_new_question": false }, @@ -15954,8 +16529,8 @@ "question__title": "Merge BSTs to Create Single BST", "question__title_slug": "merge-bsts-to-create-single-bst", "question__hide": false, - "total_acs": 6514, - "total_submitted": 18320, + "total_acs": 6588, + "total_submitted": 18507, "frontend_question_id": 1932, "is_new_question": false }, @@ -15977,8 +16552,8 @@ "question__title": "Unique Length-3 Palindromic Subsequences", "question__title_slug": "unique-length-3-palindromic-subsequences", "question__hide": false, - "total_acs": 24073, - "total_submitted": 46036, + "total_acs": 24404, + "total_submitted": 46679, "frontend_question_id": 1930, "is_new_question": false }, @@ -16000,8 +16575,8 @@ "question__title": "Concatenation of Array", "question__title_slug": "concatenation-of-array", "question__hide": false, - "total_acs": 415153, - "total_submitted": 461143, + "total_acs": 423657, + "total_submitted": 470949, "frontend_question_id": 1929, "is_new_question": false }, @@ -16023,8 +16598,8 @@ "question__title": "Count Salary Categories", "question__title_slug": "count-salary-categories", "question__hide": false, - "total_acs": 9368, - "total_submitted": 15001, + "total_acs": 9961, + "total_submitted": 16059, "frontend_question_id": 1907, "is_new_question": false }, @@ -16046,8 +16621,8 @@ "question__title": "Jump Game VIII", "question__title_slug": "jump-game-viii", "question__hide": false, - "total_acs": 1532, - "total_submitted": 2761, + "total_acs": 1565, + "total_submitted": 2815, "frontend_question_id": 2297, "is_new_question": false }, @@ -16069,8 +16644,8 @@ "question__title": "Describe the Painting", "question__title_slug": "describe-the-painting", "question__hide": false, - "total_acs": 10143, - "total_submitted": 21059, + "total_acs": 10212, + "total_submitted": 21178, "frontend_question_id": 1943, "is_new_question": false }, @@ -16092,8 +16667,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": 14163, - "total_submitted": 34839, + "total_acs": 14357, + "total_submitted": 35111, "frontend_question_id": 1942, "is_new_question": false }, @@ -16115,8 +16690,8 @@ "question__title": "Check if All Characters Have Equal Number of Occurrences", "question__title_slug": "check-if-all-characters-have-equal-number-of-occurrences", "question__hide": false, - "total_acs": 62820, - "total_submitted": 81821, + "total_acs": 63458, + "total_submitted": 82662, "frontend_question_id": 1941, "is_new_question": false }, @@ -16138,8 +16713,8 @@ "question__title": "Depth of BST Given Insertion Order", "question__title_slug": "depth-of-bst-given-insertion-order", "question__hide": false, - "total_acs": 1859, - "total_submitted": 4190, + "total_acs": 1873, + "total_submitted": 4218, "frontend_question_id": 1902, "is_new_question": false }, @@ -16161,8 +16736,8 @@ "question__title": "Longest Common Subpath", "question__title_slug": "longest-common-subpath", "question__hide": false, - "total_acs": 6123, - "total_submitted": 22191, + "total_acs": 6142, + "total_submitted": 22250, "frontend_question_id": 1923, "is_new_question": false }, @@ -16184,8 +16759,8 @@ "question__title": "Count Good Numbers", "question__title_slug": "count-good-numbers", "question__hide": false, - "total_acs": 26492, - "total_submitted": 65914, + "total_acs": 26904, + "total_submitted": 66676, "frontend_question_id": 1922, "is_new_question": false }, @@ -16207,8 +16782,8 @@ "question__title": "Eliminate Maximum Number of Monsters", "question__title_slug": "eliminate-maximum-number-of-monsters", "question__hide": false, - "total_acs": 22176, - "total_submitted": 59271, + "total_acs": 22329, + "total_submitted": 59625, "frontend_question_id": 1921, "is_new_question": false }, @@ -16230,8 +16805,8 @@ "question__title": "Build Array from Permutation", "question__title_slug": "build-array-from-permutation", "question__hide": false, - "total_acs": 332066, - "total_submitted": 369123, + "total_acs": 336133, + "total_submitted": 373742, "frontend_question_id": 1920, "is_new_question": false }, @@ -16253,8 +16828,8 @@ "question__title": "Find a Peak Element II", "question__title_slug": "find-a-peak-element-ii", "question__hide": false, - "total_acs": 37656, - "total_submitted": 72324, + "total_acs": 38143, + "total_submitted": 73318, "frontend_question_id": 1901, "is_new_question": false }, @@ -16276,8 +16851,8 @@ "question__title": "Page Recommendations II", "question__title_slug": "page-recommendations-ii", "question__hide": false, - "total_acs": 5237, - "total_submitted": 12113, + "total_acs": 5269, + "total_submitted": 12174, "frontend_question_id": 1892, "is_new_question": false }, @@ -16299,8 +16874,8 @@ "question__title": "Cutting Ribbons", "question__title_slug": "cutting-ribbons", "question__hide": false, - "total_acs": 51119, - "total_submitted": 105660, + "total_acs": 51225, + "total_submitted": 105845, "frontend_question_id": 1891, "is_new_question": false }, @@ -16322,8 +16897,8 @@ "question__title": "Number of Wonderful Substrings", "question__title_slug": "number-of-wonderful-substrings", "question__hide": false, - "total_acs": 11083, - "total_submitted": 24353, + "total_acs": 11135, + "total_submitted": 24461, "frontend_question_id": 1915, "is_new_question": false }, @@ -16345,8 +16920,8 @@ "question__title": "Cyclically Rotating a Grid", "question__title_slug": "cyclically-rotating-a-grid", "question__hide": false, - "total_acs": 10980, - "total_submitted": 22673, + "total_acs": 11028, + "total_submitted": 22746, "frontend_question_id": 1914, "is_new_question": false }, @@ -16368,8 +16943,8 @@ "question__title": "Maximum Product Difference Between Two Pairs", "question__title_slug": "maximum-product-difference-between-two-pairs", "question__hide": false, - "total_acs": 84800, - "total_submitted": 104444, + "total_acs": 85711, + "total_submitted": 105600, "frontend_question_id": 1913, "is_new_question": false }, @@ -16391,8 +16966,8 @@ "question__title": "The Latest Login in 2020", "question__title_slug": "the-latest-login-in-2020", "question__hide": false, - "total_acs": 58945, - "total_submitted": 75176, + "total_acs": 60000, + "total_submitted": 76623, "frontend_question_id": 1890, "is_new_question": false }, @@ -16414,8 +16989,8 @@ "question__title": "Minimum Cost to Reach Destination in Time", "question__title_slug": "minimum-cost-to-reach-destination-in-time", "question__hide": false, - "total_acs": 14676, - "total_submitted": 38825, + "total_acs": 14761, + "total_submitted": 39049, "frontend_question_id": 1928, "is_new_question": false }, @@ -16437,8 +17012,8 @@ "question__title": "Sum Game", "question__title_slug": "sum-game", "question__hide": false, - "total_acs": 8676, - "total_submitted": 18650, + "total_acs": 8723, + "total_submitted": 18737, "frontend_question_id": 1927, "is_new_question": false }, @@ -16460,8 +17035,8 @@ "question__title": "Nearest Exit from Entrance in Maze", "question__title_slug": "nearest-exit-from-entrance-in-maze", "question__hide": false, - "total_acs": 78564, - "total_submitted": 160701, + "total_acs": 79415, + "total_submitted": 162420, "frontend_question_id": 1926, "is_new_question": false }, @@ -16483,8 +17058,8 @@ "question__title": "Count Square Sum Triples", "question__title_slug": "count-square-sum-triples", "question__hide": false, - "total_acs": 32976, - "total_submitted": 48522, + "total_acs": 33237, + "total_submitted": 49051, "frontend_question_id": 1925, "is_new_question": false }, @@ -16506,8 +17081,8 @@ "question__title": "Count Pairs in Two Arrays", "question__title_slug": "count-pairs-in-two-arrays", "question__hide": false, - "total_acs": 4640, - "total_submitted": 7825, + "total_acs": 4688, + "total_submitted": 7914, "frontend_question_id": 1885, "is_new_question": false }, @@ -16529,8 +17104,8 @@ "question__title": "Count Sub Islands", "question__title_slug": "count-sub-islands", "question__hide": false, - "total_acs": 67535, - "total_submitted": 99685, + "total_acs": 68172, + "total_submitted": 100616, "frontend_question_id": 1905, "is_new_question": false }, @@ -16552,8 +17127,8 @@ "question__title": "Minimum Absolute Difference Queries", "question__title_slug": "minimum-absolute-difference-queries", "question__hide": false, - "total_acs": 9510, - "total_submitted": 21702, + "total_acs": 9549, + "total_submitted": 21767, "frontend_question_id": 1906, "is_new_question": false }, @@ -16575,8 +17150,8 @@ "question__title": "The Number of Full Rounds You Have Played", "question__title_slug": "the-number-of-full-rounds-you-have-played", "question__hide": false, - "total_acs": 19090, - "total_submitted": 42623, + "total_acs": 19146, + "total_submitted": 42864, "frontend_question_id": 1904, "is_new_question": false }, @@ -16598,8 +17173,8 @@ "question__title": "Largest Odd Number in String", "question__title_slug": "largest-odd-number-in-string", "question__hide": false, - "total_acs": 58620, - "total_submitted": 104004, + "total_acs": 59874, + "total_submitted": 106079, "frontend_question_id": 1903, "is_new_question": false }, @@ -16621,8 +17196,8 @@ "question__title": "Egg Drop With 2 Eggs and N Floors", "question__title_slug": "egg-drop-with-2-eggs-and-n-floors", "question__hide": false, - "total_acs": 34300, - "total_submitted": 48485, + "total_acs": 34585, + "total_submitted": 48832, "frontend_question_id": 1884, "is_new_question": false }, @@ -16644,8 +17219,8 @@ "question__title": "Group Employees of the Same Salary", "question__title_slug": "group-employees-of-the-same-salary", "question__hide": false, - "total_acs": 9225, - "total_submitted": 12821, + "total_acs": 9274, + "total_submitted": 12892, "frontend_question_id": 1875, "is_new_question": false }, @@ -16667,8 +17242,8 @@ "question__title": "Minimize Product Sum of Two Arrays", "question__title_slug": "minimize-product-sum-of-two-arrays", "question__hide": false, - "total_acs": 16407, - "total_submitted": 18245, + "total_acs": 16477, + "total_submitted": 18316, "frontend_question_id": 1874, "is_new_question": false }, @@ -16690,8 +17265,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": 4680, - "total_submitted": 9252, + "total_acs": 4693, + "total_submitted": 9279, "frontend_question_id": 1900, "is_new_question": false }, @@ -16713,8 +17288,8 @@ "question__title": "Maximum Number of Removable Characters", "question__title_slug": "maximum-number-of-removable-characters", "question__hide": false, - "total_acs": 22277, - "total_submitted": 54140, + "total_acs": 22475, + "total_submitted": 54528, "frontend_question_id": 1898, "is_new_question": false }, @@ -16736,8 +17311,8 @@ "question__title": "Merge Triplets to Form Target Triplet", "question__title_slug": "merge-triplets-to-form-target-triplet", "question__hide": false, - "total_acs": 30551, - "total_submitted": 47160, + "total_acs": 30976, + "total_submitted": 47780, "frontend_question_id": 1899, "is_new_question": false }, @@ -16759,8 +17334,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": 28965, - "total_submitted": 48764, + "total_acs": 29160, + "total_submitted": 49122, "frontend_question_id": 1897, "is_new_question": false }, @@ -16782,8 +17357,8 @@ "question__title": "Calculate Special Bonus", "question__title_slug": "calculate-special-bonus", "question__hide": false, - "total_acs": 174530, - "total_submitted": 295910, + "total_acs": 177760, + "total_submitted": 302030, "frontend_question_id": 1873, "is_new_question": false }, @@ -16805,8 +17380,8 @@ "question__title": "Design Movie Rental System", "question__title_slug": "design-movie-rental-system", "question__hide": false, - "total_acs": 5027, - "total_submitted": 12692, + "total_acs": 5059, + "total_submitted": 12892, "frontend_question_id": 1912, "is_new_question": false }, @@ -16828,8 +17403,8 @@ "question__title": "Maximum Alternating Subsequence Sum", "question__title_slug": "maximum-alternating-subsequence-sum", "question__hide": false, - "total_acs": 24758, - "total_submitted": 41807, + "total_acs": 24923, + "total_submitted": 42058, "frontend_question_id": 1911, "is_new_question": false }, @@ -16851,8 +17426,8 @@ "question__title": "Remove All Occurrences of a Substring", "question__title_slug": "remove-all-occurrences-of-a-substring", "question__hide": false, - "total_acs": 61885, - "total_submitted": 82819, + "total_acs": 62796, + "total_submitted": 84002, "frontend_question_id": 1910, "is_new_question": false }, @@ -16874,8 +17449,8 @@ "question__title": "Remove One Element to Make the Array Strictly Increasing", "question__title_slug": "remove-one-element-to-make-the-array-strictly-increasing", "question__hide": false, - "total_acs": 46219, - "total_submitted": 176871, + "total_acs": 46724, + "total_submitted": 178458, "frontend_question_id": 1909, "is_new_question": false }, @@ -16897,8 +17472,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": 25888, - "total_submitted": 44865, + "total_acs": 25932, + "total_submitted": 44939, "frontend_question_id": 1868, "is_new_question": false }, @@ -16920,8 +17495,8 @@ "question__title": "Minimum Space Wasted From Packaging", "question__title_slug": "minimum-space-wasted-from-packaging", "question__hide": false, - "total_acs": 10790, - "total_submitted": 34501, + "total_acs": 10866, + "total_submitted": 34743, "frontend_question_id": 1889, "is_new_question": false }, @@ -16943,8 +17518,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": 18633, - "total_submitted": 47935, + "total_acs": 18813, + "total_submitted": 48328, "frontend_question_id": 1888, "is_new_question": false }, @@ -16966,8 +17541,8 @@ "question__title": "Reduction Operations to Make the Array Elements Equal", "question__title_slug": "reduction-operations-to-make-the-array-elements-equal", "question__hide": false, - "total_acs": 21371, - "total_submitted": 34246, + "total_acs": 21484, + "total_submitted": 34410, "frontend_question_id": 1887, "is_new_question": false }, @@ -16989,8 +17564,8 @@ "question__title": "Determine Whether Matrix Can Be Obtained By Rotation", "question__title_slug": "determine-whether-matrix-can-be-obtained-by-rotation", "question__hide": false, - "total_acs": 53185, - "total_submitted": 94997, + "total_acs": 53633, + "total_submitted": 95753, "frontend_question_id": 1886, "is_new_question": false }, @@ -17012,8 +17587,8 @@ "question__title": "Orders With Maximum Quantity Above Average", "question__title_slug": "orders-with-maximum-quantity-above-average", "question__hide": false, - "total_acs": 13340, - "total_submitted": 18295, + "total_acs": 13412, + "total_submitted": 18392, "frontend_question_id": 1867, "is_new_question": false }, @@ -17035,8 +17610,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": 5574, - "total_submitted": 14694, + "total_acs": 5601, + "total_submitted": 14764, "frontend_question_id": 1883, "is_new_question": false }, @@ -17058,8 +17633,8 @@ "question__title": "Process Tasks Using Servers", "question__title_slug": "process-tasks-using-servers", "question__hide": false, - "total_acs": 25421, - "total_submitted": 64386, + "total_acs": 25725, + "total_submitted": 65008, "frontend_question_id": 1882, "is_new_question": false }, @@ -17081,8 +17656,8 @@ "question__title": "Maximum Value after Insertion", "question__title_slug": "maximum-value-after-insertion", "question__hide": false, - "total_acs": 23531, - "total_submitted": 63367, + "total_acs": 23693, + "total_submitted": 63679, "frontend_question_id": 1881, "is_new_question": false }, @@ -17104,8 +17679,8 @@ "question__title": "Check if Word Equals Summation of Two Words", "question__title_slug": "check-if-word-equals-summation-of-two-words", "question__hide": false, - "total_acs": 52374, - "total_submitted": 70803, + "total_acs": 52787, + "total_submitted": 71388, "frontend_question_id": 1880, "is_new_question": false }, @@ -17127,8 +17702,8 @@ "question__title": "Longest Word With All Prefixes", "question__title_slug": "longest-word-with-all-prefixes", "question__hide": false, - "total_acs": 6077, - "total_submitted": 9024, + "total_acs": 6136, + "total_submitted": 9097, "frontend_question_id": 1858, "is_new_question": false }, @@ -17150,8 +17725,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": 3343, - "total_submitted": 6197, + "total_acs": 3369, + "total_submitted": 6241, "frontend_question_id": 1896, "is_new_question": false }, @@ -17173,8 +17748,8 @@ "question__title": "Maximum Cost of Trip With K Highways", "question__title_slug": "maximum-cost-of-trip-with-k-highways", "question__hide": false, - "total_acs": 1195, - "total_submitted": 2347, + "total_acs": 1204, + "total_submitted": 2371, "frontend_question_id": 2247, "is_new_question": false }, @@ -17196,8 +17771,8 @@ "question__title": "Find the Student that Will Replace the Chalk", "question__title_slug": "find-the-student-that-will-replace-the-chalk", "question__hide": false, - "total_acs": 29859, - "total_submitted": 66867, + "total_acs": 30077, + "total_submitted": 67276, "frontend_question_id": 1894, "is_new_question": false }, @@ -17219,8 +17794,8 @@ "question__title": "Check if All the Integers in a Range Are Covered", "question__title_slug": "check-if-all-the-integers-in-a-range-are-covered", "question__hide": false, - "total_acs": 31705, - "total_submitted": 63048, + "total_acs": 31951, + "total_submitted": 63540, "frontend_question_id": 1893, "is_new_question": false }, @@ -17242,8 +17817,8 @@ "question__title": "Convert Date Format", "question__title_slug": "convert-date-format", "question__hide": false, - "total_acs": 10461, - "total_submitted": 12083, + "total_acs": 10530, + "total_submitted": 12171, "frontend_question_id": 1853, "is_new_question": false }, @@ -17265,8 +17840,8 @@ "question__title": "Distinct Numbers in Each Subarray", "question__title_slug": "distinct-numbers-in-each-subarray", "question__hide": false, - "total_acs": 5777, - "total_submitted": 8111, + "total_acs": 5813, + "total_submitted": 8168, "frontend_question_id": 1852, "is_new_question": false }, @@ -17288,8 +17863,8 @@ "question__title": "Stone Game VIII", "question__title_slug": "stone-game-viii", "question__hide": false, - "total_acs": 7359, - "total_submitted": 14002, + "total_acs": 7408, + "total_submitted": 14089, "frontend_question_id": 1872, "is_new_question": false }, @@ -17311,8 +17886,8 @@ "question__title": "Jump Game VII", "question__title_slug": "jump-game-vii", "question__hide": false, - "total_acs": 34645, - "total_submitted": 138909, + "total_acs": 34833, + "total_submitted": 139637, "frontend_question_id": 1871, "is_new_question": false }, @@ -17334,8 +17909,8 @@ "question__title": "Minimum Speed to Arrive on Time", "question__title_slug": "minimum-speed-to-arrive-on-time", "question__hide": false, - "total_acs": 29272, - "total_submitted": 75493, + "total_acs": 29492, + "total_submitted": 76078, "frontend_question_id": 1870, "is_new_question": false }, @@ -17357,8 +17932,8 @@ "question__title": "Longer Contiguous Segments of Ones than Zeros", "question__title_slug": "longer-contiguous-segments-of-ones-than-zeros", "question__hide": false, - "total_acs": 38385, - "total_submitted": 63568, + "total_acs": 38632, + "total_submitted": 63979, "frontend_question_id": 1869, "is_new_question": false }, @@ -17380,8 +17955,8 @@ "question__title": "Suspicious Bank Accounts", "question__title_slug": "suspicious-bank-accounts", "question__hide": false, - "total_acs": 8566, - "total_submitted": 18371, + "total_acs": 8612, + "total_submitted": 18492, "frontend_question_id": 1843, "is_new_question": false }, @@ -17403,8 +17978,8 @@ "question__title": "Next Palindrome Using Same Digits", "question__title_slug": "next-palindrome-using-same-digits", "question__hide": false, - "total_acs": 4886, - "total_submitted": 9202, + "total_acs": 4894, + "total_submitted": 9221, "frontend_question_id": 1842, "is_new_question": false }, @@ -17426,8 +18001,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": 11055, - "total_submitted": 19795, + "total_acs": 11125, + "total_submitted": 19948, "frontend_question_id": 1866, "is_new_question": false }, @@ -17449,8 +18024,8 @@ "question__title": "Finding Pairs With a Certain Sum", "question__title_slug": "finding-pairs-with-a-certain-sum", "question__hide": false, - "total_acs": 20551, - "total_submitted": 40837, + "total_acs": 20665, + "total_submitted": 41051, "frontend_question_id": 1865, "is_new_question": false }, @@ -17472,8 +18047,8 @@ "question__title": "Minimum Number of Swaps to Make the Binary String Alternating", "question__title_slug": "minimum-number-of-swaps-to-make-the-binary-string-alternating", "question__hide": false, - "total_acs": 22765, - "total_submitted": 53175, + "total_acs": 22840, + "total_submitted": 53347, "frontend_question_id": 1864, "is_new_question": false }, @@ -17495,8 +18070,8 @@ "question__title": "Sum of All Subset XOR Totals", "question__title_slug": "sum-of-all-subset-xor-totals", "question__hide": false, - "total_acs": 54286, - "total_submitted": 67630, + "total_acs": 54753, + "total_submitted": 68164, "frontend_question_id": 1863, "is_new_question": false }, @@ -17518,8 +18093,8 @@ "question__title": "Sort Linked List Already Sorted Using Absolute Values", "question__title_slug": "sort-linked-list-already-sorted-using-absolute-values", "question__hide": false, - "total_acs": 5000, - "total_submitted": 7274, + "total_acs": 5061, + "total_submitted": 7372, "frontend_question_id": 2046, "is_new_question": false }, @@ -17541,8 +18116,8 @@ "question__title": "League Statistics", "question__title_slug": "league-statistics", "question__hide": false, - "total_acs": 11080, - "total_submitted": 20297, + "total_acs": 11136, + "total_submitted": 20402, "frontend_question_id": 1841, "is_new_question": false }, @@ -17564,8 +18139,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": 12641, - "total_submitted": 26854, + "total_acs": 12701, + "total_submitted": 26993, "frontend_question_id": 1878, "is_new_question": false }, @@ -17587,8 +18162,8 @@ "question__title": "Minimum XOR Sum of Two Arrays", "question__title_slug": "minimum-xor-sum-of-two-arrays", "question__hide": false, - "total_acs": 10884, - "total_submitted": 23901, + "total_acs": 10939, + "total_submitted": 23998, "frontend_question_id": 1879, "is_new_question": false }, @@ -17610,8 +18185,8 @@ "question__title": "Minimize Maximum Pair Sum in Array", "question__title_slug": "minimize-maximum-pair-sum-in-array", "question__hide": false, - "total_acs": 72750, - "total_submitted": 91071, + "total_acs": 73244, + "total_submitted": 91697, "frontend_question_id": 1877, "is_new_question": false }, @@ -17633,8 +18208,8 @@ "question__title": "Substrings of Size Three with Distinct Characters", "question__title_slug": "substrings-of-size-three-with-distinct-characters", "question__hide": false, - "total_acs": 77174, - "total_submitted": 108297, + "total_acs": 78263, + "total_submitted": 109692, "frontend_question_id": 1876, "is_new_question": false }, @@ -17656,8 +18231,8 @@ "question__title": "Largest Color Value in a Directed Graph", "question__title_slug": "largest-color-value-in-a-directed-graph", "question__hide": false, - "total_acs": 54231, - "total_submitted": 103926, + "total_acs": 54600, + "total_submitted": 104731, "frontend_question_id": 1857, "is_new_question": false }, @@ -17679,8 +18254,8 @@ "question__title": "Maximum Subarray Min-Product", "question__title_slug": "maximum-subarray-min-product", "question__hide": false, - "total_acs": 21096, - "total_submitted": 55613, + "total_acs": 21209, + "total_submitted": 55883, "frontend_question_id": 1856, "is_new_question": false }, @@ -17702,8 +18277,8 @@ "question__title": "Maximum Distance Between a Pair of Values", "question__title_slug": "maximum-distance-between-a-pair-of-values", "question__hide": false, - "total_acs": 42024, - "total_submitted": 78825, + "total_acs": 42365, + "total_submitted": 79374, "frontend_question_id": 1855, "is_new_question": false }, @@ -17725,8 +18300,8 @@ "question__title": "Maximum Population Year", "question__title_slug": "maximum-population-year", "question__hide": false, - "total_acs": 48559, - "total_submitted": 80854, + "total_acs": 48965, + "total_submitted": 81506, "frontend_question_id": 1854, "is_new_question": false }, @@ -17748,8 +18323,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": 23530, - "total_submitted": 33366, + "total_acs": 23658, + "total_submitted": 33550, "frontend_question_id": 1836, "is_new_question": false }, @@ -17771,8 +18346,8 @@ "question__title": "Maximum Transaction Each Day", "question__title_slug": "maximum-transaction-each-day", "question__hide": false, - "total_acs": 13147, - "total_submitted": 15888, + "total_acs": 13254, + "total_submitted": 16029, "frontend_question_id": 1831, "is_new_question": false }, @@ -17794,8 +18369,8 @@ "question__title": "Faulty Sensor", "question__title_slug": "faulty-sensor", "question__hide": false, - "total_acs": 3577, - "total_submitted": 7199, + "total_acs": 3601, + "total_submitted": 7244, "frontend_question_id": 1826, "is_new_question": false }, @@ -17817,8 +18392,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": 1671, - "total_submitted": 3198, + "total_acs": 1679, + "total_submitted": 3223, "frontend_question_id": 1989, "is_new_question": false }, @@ -17840,8 +18415,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": 17835, - "total_submitted": 24990, + "total_acs": 17910, + "total_submitted": 25096, "frontend_question_id": 1850, "is_new_question": false }, @@ -17863,8 +18438,8 @@ "question__title": "Minimum Interval to Include Each Query", "question__title_slug": "minimum-interval-to-include-each-query", "question__hide": false, - "total_acs": 17062, - "total_submitted": 35375, + "total_acs": 17285, + "total_submitted": 35782, "frontend_question_id": 1851, "is_new_question": false }, @@ -17886,8 +18461,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": 19549, - "total_submitted": 58563, + "total_acs": 19705, + "total_submitted": 59058, "frontend_question_id": 1849, "is_new_question": false }, @@ -17909,8 +18484,8 @@ "question__title": "Minimum Distance to the Target Element", "question__title_slug": "minimum-distance-to-the-target-element", "question__hide": false, - "total_acs": 34088, - "total_submitted": 59267, + "total_acs": 34382, + "total_submitted": 59992, "frontend_question_id": 1848, "is_new_question": false }, @@ -17932,8 +18507,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": 14837, - "total_submitted": 16660, + "total_acs": 15134, + "total_submitted": 16992, "frontend_question_id": 1821, "is_new_question": false }, @@ -17955,8 +18530,8 @@ "question__title": "Rotating the Box", "question__title_slug": "rotating-the-box", "question__hide": false, - "total_acs": 40898, - "total_submitted": 62639, + "total_acs": 41205, + "total_submitted": 63033, "frontend_question_id": 1861, "is_new_question": false }, @@ -17978,8 +18553,8 @@ "question__title": "Incremental Memory Leak", "question__title_slug": "incremental-memory-leak", "question__hide": false, - "total_acs": 15769, - "total_submitted": 21994, + "total_acs": 15847, + "total_submitted": 22112, "frontend_question_id": 1860, "is_new_question": false }, @@ -18001,8 +18576,8 @@ "question__title": "Sorting the Sentence", "question__title_slug": "sorting-the-sentence", "question__hide": false, - "total_acs": 114226, - "total_submitted": 136019, + "total_acs": 115440, + "total_submitted": 137608, "frontend_question_id": 1859, "is_new_question": false }, @@ -18024,8 +18599,8 @@ "question__title": "Maximum Number of Accepted Invitations", "question__title_slug": "maximum-number-of-accepted-invitations", "question__hide": false, - "total_acs": 5352, - "total_submitted": 10819, + "total_acs": 5383, + "total_submitted": 10905, "frontend_question_id": 1820, "is_new_question": false }, @@ -18047,8 +18622,8 @@ "question__title": "Maximum Building Height", "question__title_slug": "maximum-building-height", "question__hide": false, - "total_acs": 6131, - "total_submitted": 17226, + "total_acs": 6147, + "total_submitted": 17282, "frontend_question_id": 1840, "is_new_question": false }, @@ -18070,8 +18645,8 @@ "question__title": "Longest Substring Of All Vowels in Order", "question__title_slug": "longest-substring-of-all-vowels-in-order", "question__hide": false, - "total_acs": 24797, - "total_submitted": 50907, + "total_acs": 24984, + "total_submitted": 51280, "frontend_question_id": 1839, "is_new_question": false }, @@ -18093,8 +18668,8 @@ "question__title": "Frequency of the Most Frequent Element", "question__title_slug": "frequency-of-the-most-frequent-element", "question__hide": false, - "total_acs": 42225, - "total_submitted": 106970, + "total_acs": 42663, + "total_submitted": 107889, "frontend_question_id": 1838, "is_new_question": false }, @@ -18116,8 +18691,8 @@ "question__title": "Sum of Digits in Base K", "question__title_slug": "sum-of-digits-in-base-k", "question__hide": false, - "total_acs": 40098, - "total_submitted": 52144, + "total_acs": 40478, + "total_submitted": 52619, "frontend_question_id": 1837, "is_new_question": false }, @@ -18139,8 +18714,8 @@ "question__title": "Find Interview Candidates", "question__title_slug": "find-interview-candidates", "question__hide": false, - "total_acs": 12558, - "total_submitted": 19903, + "total_acs": 12595, + "total_submitted": 19977, "frontend_question_id": 1811, "is_new_question": false }, @@ -18162,8 +18737,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": 15094, - "total_submitted": 24929, + "total_acs": 15195, + "total_submitted": 25100, "frontend_question_id": 1835, "is_new_question": false }, @@ -18185,8 +18760,8 @@ "question__title": "Single-Threaded CPU", "question__title_slug": "single-threaded-cpu", "question__hide": false, - "total_acs": 87765, - "total_submitted": 191955, + "total_acs": 88185, + "total_submitted": 192924, "frontend_question_id": 1834, "is_new_question": false }, @@ -18208,8 +18783,8 @@ "question__title": "Maximum Ice Cream Bars", "question__title_slug": "maximum-ice-cream-bars", "question__hide": false, - "total_acs": 140168, - "total_submitted": 189655, + "total_acs": 140644, + "total_submitted": 190345, "frontend_question_id": 1833, "is_new_question": false }, @@ -18231,8 +18806,8 @@ "question__title": "Check if the Sentence Is Pangram", "question__title_slug": "check-if-the-sentence-is-pangram", "question__hide": false, - "total_acs": 230495, - "total_submitted": 276186, + "total_acs": 232778, + "total_submitted": 279194, "frontend_question_id": 1832, "is_new_question": false }, @@ -18254,8 +18829,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": 2374, - "total_submitted": 4363, + "total_acs": 2392, + "total_submitted": 4384, "frontend_question_id": 1810, "is_new_question": false }, @@ -18277,8 +18852,8 @@ "question__title": "Ad-Free Sessions", "question__title_slug": "ad-free-sessions", "question__hide": false, - "total_acs": 12999, - "total_submitted": 22093, + "total_acs": 13057, + "total_submitted": 22256, "frontend_question_id": 1809, "is_new_question": false }, @@ -18300,8 +18875,8 @@ "question__title": "Closest Room", "question__title_slug": "closest-room", "question__hide": false, - "total_acs": 7174, - "total_submitted": 20093, + "total_acs": 7218, + "total_submitted": 20181, "frontend_question_id": 1847, "is_new_question": false }, @@ -18323,8 +18898,8 @@ "question__title": "Maximum Element After Decreasing and Rearranging", "question__title_slug": "maximum-element-after-decreasing-and-rearranging", "question__hide": false, - "total_acs": 19464, - "total_submitted": 32991, + "total_acs": 19587, + "total_submitted": 33225, "frontend_question_id": 1846, "is_new_question": false }, @@ -18346,8 +18921,8 @@ "question__title": "Seat Reservation Manager", "question__title_slug": "seat-reservation-manager", "question__hide": false, - "total_acs": 32280, - "total_submitted": 49011, + "total_acs": 32613, + "total_submitted": 49472, "frontend_question_id": 1845, "is_new_question": false }, @@ -18369,8 +18944,8 @@ "question__title": "Replace All Digits with Characters", "question__title_slug": "replace-all-digits-with-characters", "question__hide": false, - "total_acs": 61840, - "total_submitted": 77153, + "total_acs": 62437, + "total_submitted": 77858, "frontend_question_id": 1844, "is_new_question": false }, @@ -18392,8 +18967,8 @@ "question__title": "Finding MK Average", "question__title_slug": "finding-mk-average", "question__hide": false, - "total_acs": 10411, - "total_submitted": 29124, + "total_acs": 10450, + "total_submitted": 29226, "frontend_question_id": 1825, "is_new_question": false }, @@ -18415,8 +18990,8 @@ "question__title": "Minimum Sideway Jumps", "question__title_slug": "minimum-sideway-jumps", "question__hide": false, - "total_acs": 27753, - "total_submitted": 56232, + "total_acs": 28111, + "total_submitted": 56899, "frontend_question_id": 1824, "is_new_question": false }, @@ -18438,8 +19013,8 @@ "question__title": "Find the Winner of the Circular Game", "question__title_slug": "find-the-winner-of-the-circular-game", "question__hide": false, - "total_acs": 91992, - "total_submitted": 118013, + "total_acs": 92982, + "total_submitted": 119339, "frontend_question_id": 1823, "is_new_question": false }, @@ -18461,8 +19036,8 @@ "question__title": "Sign of the Product of an Array", "question__title_slug": "sign-of-the-product-of-an-array", "question__hide": false, - "total_acs": 253034, - "total_submitted": 383002, + "total_acs": 261204, + "total_submitted": 395914, "frontend_question_id": 1822, "is_new_question": false }, @@ -18484,8 +19059,8 @@ "question__title": "Implement Trie II (Prefix Tree)", "question__title_slug": "implement-trie-ii-prefix-tree", "question__hide": false, - "total_acs": 12002, - "total_submitted": 20078, + "total_acs": 12098, + "total_submitted": 20267, "frontend_question_id": 1804, "is_new_question": false }, @@ -18507,8 +19082,8 @@ "question__title": "Rearrange Products Table", "question__title_slug": "rearrange-products-table", "question__hide": false, - "total_acs": 88564, - "total_submitted": 102611, + "total_acs": 90106, + "total_submitted": 104490, "frontend_question_id": 1795, "is_new_question": false }, @@ -18530,8 +19105,8 @@ "question__title": "Number of Different Subsequences GCDs", "question__title_slug": "number-of-different-subsequences-gcds", "question__hide": false, - "total_acs": 7402, - "total_submitted": 18972, + "total_acs": 7442, + "total_submitted": 19049, "frontend_question_id": 1819, "is_new_question": false }, @@ -18553,8 +19128,8 @@ "question__title": "Minimum Absolute Sum Difference", "question__title_slug": "minimum-absolute-sum-difference", "question__hide": false, - "total_acs": 21114, - "total_submitted": 69178, + "total_acs": 21239, + "total_submitted": 69552, "frontend_question_id": 1818, "is_new_question": false }, @@ -18576,8 +19151,8 @@ "question__title": "Finding the Users Active Minutes", "question__title_slug": "finding-the-users-active-minutes", "question__hide": false, - "total_acs": 47214, - "total_submitted": 58789, + "total_acs": 47496, + "total_submitted": 59147, "frontend_question_id": 1817, "is_new_question": false }, @@ -18599,8 +19174,8 @@ "question__title": "Truncate Sentence", "question__title_slug": "truncate-sentence", "question__hide": false, - "total_acs": 103660, - "total_submitted": 124595, + "total_acs": 104824, + "total_submitted": 125964, "frontend_question_id": 1816, "is_new_question": false }, @@ -18622,8 +19197,8 @@ "question__title": "Count Pairs of Equal Substrings With Minimum Difference", "question__title_slug": "count-pairs-of-equal-substrings-with-minimum-difference", "question__hide": false, - "total_acs": 1583, - "total_submitted": 2428, + "total_acs": 1593, + "total_submitted": 2444, "frontend_question_id": 1794, "is_new_question": false }, @@ -18645,8 +19220,8 @@ "question__title": "Primary Department for Each Employee", "question__title_slug": "primary-department-for-each-employee", "question__hide": false, - "total_acs": 17032, - "total_submitted": 21971, + "total_acs": 17874, + "total_submitted": 23209, "frontend_question_id": 1789, "is_new_question": false }, @@ -18668,8 +19243,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": 3019, - "total_submitted": 6189, + "total_acs": 3053, + "total_submitted": 6255, "frontend_question_id": 1830, "is_new_question": false }, @@ -18691,8 +19266,8 @@ "question__title": "Maximum XOR for Each Query", "question__title_slug": "maximum-xor-for-each-query", "question__hide": false, - "total_acs": 22827, - "total_submitted": 29698, + "total_acs": 22943, + "total_submitted": 29832, "frontend_question_id": 1829, "is_new_question": false }, @@ -18714,8 +19289,8 @@ "question__title": "Queries on Number of Points Inside a Circle", "question__title_slug": "queries-on-number-of-points-inside-a-circle", "question__hide": false, - "total_acs": 60166, - "total_submitted": 69704, + "total_acs": 60547, + "total_submitted": 70214, "frontend_question_id": 1828, "is_new_question": false }, @@ -18737,8 +19312,8 @@ "question__title": "Minimum Operations to Make the Array Increasing", "question__title_slug": "minimum-operations-to-make-the-array-increasing", "question__hide": false, - "total_acs": 67267, - "total_submitted": 85873, + "total_acs": 67764, + "total_submitted": 86519, "frontend_question_id": 1827, "is_new_question": false }, @@ -18760,8 +19335,8 @@ "question__title": "Maximize the Beauty of the Garden", "question__title_slug": "maximize-the-beauty-of-the-garden", "question__hide": false, - "total_acs": 1807, - "total_submitted": 2710, + "total_acs": 1810, + "total_submitted": 2715, "frontend_question_id": 1788, "is_new_question": false }, @@ -18783,8 +19358,8 @@ "question__title": "Maximize Number of Nice Divisors", "question__title_slug": "maximize-number-of-nice-divisors", "question__hide": false, - "total_acs": 5565, - "total_submitted": 17514, + "total_acs": 5588, + "total_submitted": 17569, "frontend_question_id": 1808, "is_new_question": false }, @@ -18806,8 +19381,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": 16046, - "total_submitted": 22273, + "total_acs": 16136, + "total_submitted": 22387, "frontend_question_id": 1806, "is_new_question": false }, @@ -18829,8 +19404,8 @@ "question__title": "Evaluate the Bracket Pairs of a String", "question__title_slug": "evaluate-the-bracket-pairs-of-a-string", "question__hide": false, - "total_acs": 24982, - "total_submitted": 37567, + "total_acs": 25106, + "total_submitted": 37728, "frontend_question_id": 1807, "is_new_question": false }, @@ -18852,8 +19427,8 @@ "question__title": "Number of Different Integers in a String", "question__title_slug": "number-of-different-integers-in-a-string", "question__hide": false, - "total_acs": 36897, - "total_submitted": 100655, + "total_acs": 37274, + "total_submitted": 101484, "frontend_question_id": 1805, "is_new_question": false }, @@ -18875,8 +19450,8 @@ "question__title": "Grand Slam Titles", "question__title_slug": "grand-slam-titles", "question__hide": false, - "total_acs": 18950, - "total_submitted": 21903, + "total_acs": 19073, + "total_submitted": 22102, "frontend_question_id": 1783, "is_new_question": false }, @@ -18898,8 +19473,8 @@ "question__title": "Shortest Path in a Hidden Grid", "question__title_slug": "shortest-path-in-a-hidden-grid", "question__hide": false, - "total_acs": 4654, - "total_submitted": 11906, + "total_acs": 4670, + "total_submitted": 11947, "frontend_question_id": 1778, "is_new_question": false }, @@ -18921,8 +19496,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": 13781, - "total_submitted": 24583, + "total_acs": 13884, + "total_submitted": 24713, "frontend_question_id": 1798, "is_new_question": false }, @@ -18944,8 +19519,8 @@ "question__title": "Maximum Value at a Given Index in a Bounded Array", "question__title_slug": "maximum-value-at-a-given-index-in-a-bounded-array", "question__hide": false, - "total_acs": 16435, - "total_submitted": 50668, + "total_acs": 16553, + "total_submitted": 50961, "frontend_question_id": 1802, "is_new_question": false }, @@ -18967,8 +19542,8 @@ "question__title": "Number of Orders in the Backlog", "question__title_slug": "number-of-orders-in-the-backlog", "question__hide": false, - "total_acs": 16368, - "total_submitted": 33800, + "total_acs": 16579, + "total_submitted": 34097, "frontend_question_id": 1801, "is_new_question": false }, @@ -18990,8 +19565,8 @@ "question__title": "Maximum Ascending Subarray Sum", "question__title_slug": "maximum-ascending-subarray-sum", "question__hide": false, - "total_acs": 42554, - "total_submitted": 67472, + "total_acs": 43042, + "total_submitted": 68263, "frontend_question_id": 1800, "is_new_question": false }, @@ -19013,8 +19588,8 @@ "question__title": "Product's Price for Each Store", "question__title_slug": "products-price-for-each-store", "question__hide": false, - "total_acs": 16835, - "total_submitted": 20168, + "total_acs": 16921, + "total_submitted": 20325, "frontend_question_id": 1777, "is_new_question": false }, @@ -19036,8 +19611,8 @@ "question__title": "Count Nice Pairs in an Array", "question__title_slug": "count-nice-pairs-in-an-array", "question__hide": false, - "total_acs": 24641, - "total_submitted": 58594, + "total_acs": 24795, + "total_submitted": 58982, "frontend_question_id": 1814, "is_new_question": false }, @@ -19059,8 +19634,8 @@ "question__title": "Maximum Number of Groups Getting Fresh Donuts", "question__title_slug": "maximum-number-of-groups-getting-fresh-donuts", "question__hide": false, - "total_acs": 5481, - "total_submitted": 13698, + "total_acs": 5524, + "total_submitted": 13790, "frontend_question_id": 1815, "is_new_question": false }, @@ -19082,8 +19657,8 @@ "question__title": "Sentence Similarity III", "question__title_slug": "sentence-similarity-iii", "question__hide": false, - "total_acs": 13328, - "total_submitted": 40253, + "total_acs": 13416, + "total_submitted": 40497, "frontend_question_id": 1813, "is_new_question": false }, @@ -19105,8 +19680,8 @@ "question__title": "Determine Color of a Chessboard Square", "question__title_slug": "determine-color-of-a-chessboard-square", "question__hide": false, - "total_acs": 58057, - "total_submitted": 74652, + "total_acs": 58589, + "total_submitted": 75371, "frontend_question_id": 1812, "is_new_question": false }, @@ -19128,8 +19703,8 @@ "question__title": "Sort Features by Popularity", "question__title_slug": "sort-features-by-popularity", "question__hide": false, - "total_acs": 4988, - "total_submitted": 7683, + "total_acs": 5015, + "total_submitted": 7731, "frontend_question_id": 1772, "is_new_question": false }, @@ -19151,8 +19726,8 @@ "question__title": "Maximum Score of a Good Subarray", "question__title_slug": "maximum-score-of-a-good-subarray", "question__hide": false, - "total_acs": 20066, - "total_submitted": 37463, + "total_acs": 20165, + "total_submitted": 37637, "frontend_question_id": 1793, "is_new_question": false }, @@ -19174,8 +19749,8 @@ "question__title": "Maximum Average Pass Ratio", "question__title_slug": "maximum-average-pass-ratio", "question__hide": false, - "total_acs": 19005, - "total_submitted": 36243, + "total_acs": 19089, + "total_submitted": 36391, "frontend_question_id": 1792, "is_new_question": false }, @@ -19197,8 +19772,8 @@ "question__title": "Find Center of Star Graph", "question__title_slug": "find-center-of-star-graph", "question__hide": false, - "total_acs": 135444, - "total_submitted": 162112, + "total_acs": 136596, + "total_submitted": 163554, "frontend_question_id": 1791, "is_new_question": false }, @@ -19220,8 +19795,8 @@ "question__title": "Check if One String Swap Can Make Strings Equal", "question__title_slug": "check-if-one-string-swap-can-make-strings-equal", "question__hide": false, - "total_acs": 85726, - "total_submitted": 189575, + "total_acs": 86583, + "total_submitted": 191512, "frontend_question_id": 1790, "is_new_question": false }, @@ -19243,8 +19818,8 @@ "question__title": "Find the Subtasks That Did Not Execute", "question__title_slug": "find-the-subtasks-that-did-not-execute", "question__hide": false, - "total_acs": 8318, - "total_submitted": 10233, + "total_acs": 8427, + "total_submitted": 10389, "frontend_question_id": 1767, "is_new_question": false }, @@ -19266,8 +19841,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": 4429, - "total_submitted": 11213, + "total_acs": 4449, + "total_submitted": 11266, "frontend_question_id": 1787, "is_new_question": false }, @@ -19289,8 +19864,8 @@ "question__title": "Number of Restricted Paths From First to Last Node", "question__title_slug": "number-of-restricted-paths-from-first-to-last-node", "question__hide": false, - "total_acs": 18557, - "total_submitted": 47441, + "total_acs": 18714, + "total_submitted": 47779, "frontend_question_id": 1786, "is_new_question": false }, @@ -19312,8 +19887,8 @@ "question__title": "Minimum Elements to Add to Form a Given Sum", "question__title_slug": "minimum-elements-to-add-to-form-a-given-sum", "question__hide": false, - "total_acs": 17821, - "total_submitted": 41835, + "total_acs": 17917, + "total_submitted": 42033, "frontend_question_id": 1785, "is_new_question": false }, @@ -19335,8 +19910,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": 33229, - "total_submitted": 83246, + "total_acs": 33476, + "total_submitted": 83925, "frontend_question_id": 1784, "is_new_question": false }, @@ -19358,8 +19933,8 @@ "question__title": "Buildings With an Ocean View", "question__title_slug": "buildings-with-an-ocean-view", "question__hide": false, - "total_acs": 140865, - "total_submitted": 178232, + "total_acs": 141122, + "total_submitted": 178560, "frontend_question_id": 1762, "is_new_question": false }, @@ -19381,8 +19956,8 @@ "question__title": "Recyclable and Low Fat Products", "question__title_slug": "recyclable-and-low-fat-products", "question__hide": false, - "total_acs": 328606, - "total_submitted": 355801, + "total_acs": 338338, + "total_submitted": 366678, "frontend_question_id": 1757, "is_new_question": false }, @@ -19404,8 +19979,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": 6101, - "total_submitted": 13048, + "total_acs": 6182, + "total_submitted": 13201, "frontend_question_id": 1803, "is_new_question": false }, @@ -19427,8 +20002,8 @@ "question__title": "Maximize Score After N Operations", "question__title_slug": "maximize-score-after-n-operations", "question__hide": false, - "total_acs": 16384, - "total_submitted": 35328, + "total_acs": 50604, + "total_submitted": 86159, "frontend_question_id": 1799, "is_new_question": false }, @@ -19450,8 +20025,8 @@ "question__title": "Design Authentication Manager", "question__title_slug": "design-authentication-manager", "question__hide": false, - "total_acs": 17089, - "total_submitted": 29949, + "total_acs": 17240, + "total_submitted": 30188, "frontend_question_id": 1797, "is_new_question": false }, @@ -19473,8 +20048,8 @@ "question__title": "Second Largest Digit in a String", "question__title_slug": "second-largest-digit-in-a-string", "question__hide": false, - "total_acs": 39754, - "total_submitted": 80415, + "total_acs": 40408, + "total_submitted": 81628, "frontend_question_id": 1796, "is_new_question": false }, @@ -19496,8 +20071,8 @@ "question__title": "Design Most Recently Used Queue", "question__title_slug": "design-most-recently-used-queue", "question__hide": false, - "total_acs": 9487, - "total_submitted": 12077, + "total_acs": 9605, + "total_submitted": 12230, "frontend_question_id": 1756, "is_new_question": false }, @@ -19519,8 +20094,8 @@ "question__title": "Car Fleet II", "question__title_slug": "car-fleet-ii", "question__hide": false, - "total_acs": 21778, - "total_submitted": 40690, + "total_acs": 21826, + "total_submitted": 40778, "frontend_question_id": 1776, "is_new_question": false }, @@ -19542,8 +20117,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": 24761, - "total_submitted": 46666, + "total_acs": 24866, + "total_submitted": 46869, "frontend_question_id": 1775, "is_new_question": false }, @@ -19565,8 +20140,8 @@ "question__title": "Closest Dessert Cost", "question__title_slug": "closest-dessert-cost", "question__hide": false, - "total_acs": 25121, - "total_submitted": 53067, + "total_acs": 25247, + "total_submitted": 53439, "frontend_question_id": 1774, "is_new_question": false }, @@ -19588,8 +20163,8 @@ "question__title": "Count Items Matching a Rule", "question__title_slug": "count-items-matching-a-rule", "question__hide": false, - "total_acs": 156694, - "total_submitted": 185573, + "total_acs": 158215, + "total_submitted": 187367, "frontend_question_id": 1773, "is_new_question": false }, @@ -19611,8 +20186,8 @@ "question__title": "Leetflex Banned Accounts", "question__title_slug": "leetflex-banned-accounts", "question__hide": false, - "total_acs": 15609, - "total_submitted": 23371, + "total_acs": 15719, + "total_submitted": 23553, "frontend_question_id": 1747, "is_new_question": false }, @@ -19634,8 +20209,8 @@ "question__title": "Maximize Palindrome Length From Subsequences", "question__title_slug": "maximize-palindrome-length-from-subsequences", "question__hide": false, - "total_acs": 9257, - "total_submitted": 26276, + "total_acs": 9300, + "total_submitted": 26478, "frontend_question_id": 1771, "is_new_question": false }, @@ -19657,8 +20232,8 @@ "question__title": "Maximum Score from Performing Multiplication Operations", "question__title_slug": "maximum-score-from-performing-multiplication-operations", "question__hide": false, - "total_acs": 93714, - "total_submitted": 248964, + "total_acs": 94079, + "total_submitted": 249577, "frontend_question_id": 1770, "is_new_question": false }, @@ -19680,8 +20255,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": 101872, - "total_submitted": 119532, + "total_acs": 102511, + "total_submitted": 120240, "frontend_question_id": 1769, "is_new_question": false }, @@ -19703,8 +20278,8 @@ "question__title": "Merge Strings Alternately", "question__title_slug": "merge-strings-alternately", "question__hide": false, - "total_acs": 182741, - "total_submitted": 220821, + "total_acs": 191652, + "total_submitted": 231577, "frontend_question_id": 1768, "is_new_question": false }, @@ -19726,8 +20301,8 @@ "question__title": "Maximum Subarray Sum After One Operation", "question__title_slug": "maximum-subarray-sum-after-one-operation", "question__hide": false, - "total_acs": 8266, - "total_submitted": 13247, + "total_acs": 8304, + "total_submitted": 13322, "frontend_question_id": 1746, "is_new_question": false }, @@ -19749,8 +20324,8 @@ "question__title": "Find Total Time Spent by Each Employee", "question__title_slug": "find-total-time-spent-by-each-employee", "question__hide": false, - "total_acs": 85577, - "total_submitted": 95720, + "total_acs": 86849, + "total_submitted": 97302, "frontend_question_id": 1741, "is_new_question": false }, @@ -19772,8 +20347,8 @@ "question__title": "Count Pairs Of Nodes", "question__title_slug": "count-pairs-of-nodes", "question__hide": false, - "total_acs": 5487, - "total_submitted": 14291, + "total_acs": 5510, + "total_submitted": 14354, "frontend_question_id": 1782, "is_new_question": false }, @@ -19795,8 +20370,8 @@ "question__title": "Sum of Beauty of All Substrings", "question__title_slug": "sum-of-beauty-of-all-substrings", "question__hide": false, - "total_acs": 21300, - "total_submitted": 34792, + "total_acs": 21597, + "total_submitted": 35231, "frontend_question_id": 1781, "is_new_question": false }, @@ -19818,8 +20393,8 @@ "question__title": "Check if Number is a Sum of Powers of Three", "question__title_slug": "check-if-number-is-a-sum-of-powers-of-three", "question__hide": false, - "total_acs": 32488, - "total_submitted": 49264, + "total_acs": 32687, + "total_submitted": 49538, "frontend_question_id": 1780, "is_new_question": false }, @@ -19841,8 +20416,8 @@ "question__title": "Find Nearest Point That Has the Same X or Y Coordinate", "question__title_slug": "find-nearest-point-that-has-the-same-x-or-y-coordinate", "question__hide": false, - "total_acs": 98264, - "total_submitted": 145891, + "total_acs": 99075, + "total_submitted": 147028, "frontend_question_id": 1779, "is_new_question": false }, @@ -19864,8 +20439,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": 19508, - "total_submitted": 46951, + "total_acs": 19549, + "total_submitted": 47051, "frontend_question_id": 1761, "is_new_question": false }, @@ -19887,8 +20462,8 @@ "question__title": "Minimum Limit of Balls in a Bag", "question__title_slug": "minimum-limit-of-balls-in-a-bag", "question__hide": false, - "total_acs": 31288, - "total_submitted": 51739, + "total_acs": 31484, + "total_submitted": 52056, "frontend_question_id": 1760, "is_new_question": false }, @@ -19910,8 +20485,8 @@ "question__title": "Count Number of Homogenous Substrings", "question__title_slug": "count-number-of-homogenous-substrings", "question__hide": false, - "total_acs": 25113, - "total_submitted": 51729, + "total_acs": 25254, + "total_submitted": 51999, "frontend_question_id": 1759, "is_new_question": false }, @@ -19933,8 +20508,8 @@ "question__title": "Minimum Changes To Make Alternating Binary String", "question__title_slug": "minimum-changes-to-make-alternating-binary-string", "question__hide": false, - "total_acs": 34905, - "total_submitted": 59800, + "total_acs": 35127, + "total_submitted": 60169, "frontend_question_id": 1758, "is_new_question": false }, @@ -19956,8 +20531,8 @@ "question__title": "Find Distance in a Binary Tree", "question__title_slug": "find-distance-in-a-binary-tree", "question__hide": false, - "total_acs": 18542, - "total_submitted": 26732, + "total_acs": 18611, + "total_submitted": 26817, "frontend_question_id": 1740, "is_new_question": false }, @@ -19979,8 +20554,8 @@ "question__title": "The Number of Employees Which Report to Each Employee", "question__title_slug": "the-number-of-employees-which-report-to-each-employee", "question__hide": false, - "total_acs": 20139, - "total_submitted": 41450, + "total_acs": 21049, + "total_submitted": 43638, "frontend_question_id": 1731, "is_new_question": false }, @@ -20002,8 +20577,8 @@ "question__title": "Closest Subsequence Sum", "question__title_slug": "closest-subsequence-sum", "question__hide": false, - "total_acs": 12183, - "total_submitted": 33242, + "total_acs": 12274, + "total_submitted": 33463, "frontend_question_id": 1755, "is_new_question": false }, @@ -20025,8 +20600,8 @@ "question__title": "Largest Merge Of Two Strings", "question__title_slug": "largest-merge-of-two-strings", "question__hide": false, - "total_acs": 18342, - "total_submitted": 39764, + "total_acs": 18440, + "total_submitted": 39968, "frontend_question_id": 1754, "is_new_question": false }, @@ -20048,8 +20623,8 @@ "question__title": "Maximum Score From Removing Stones", "question__title_slug": "maximum-score-from-removing-stones", "question__hide": false, - "total_acs": 31462, - "total_submitted": 47133, + "total_acs": 31685, + "total_submitted": 47444, "frontend_question_id": 1753, "is_new_question": false }, @@ -20071,8 +20646,8 @@ "question__title": "Check if Array Is Sorted and Rotated", "question__title_slug": "check-if-array-is-sorted-and-rotated", "question__hide": false, - "total_acs": 88913, - "total_submitted": 177089, + "total_acs": 90867, + "total_submitted": 181192, "frontend_question_id": 1752, "is_new_question": false }, @@ -20094,8 +20669,8 @@ "question__title": "Find Followers Count", "question__title_slug": "find-followers-count", "question__hide": false, - "total_acs": 66462, - "total_submitted": 93607, + "total_acs": 68074, + "total_submitted": 95902, "frontend_question_id": 1729, "is_new_question": false }, @@ -20117,8 +20692,8 @@ "question__title": "Map of Highest Peak", "question__title_slug": "map-of-highest-peak", "question__hide": false, - "total_acs": 21104, - "total_submitted": 34949, + "total_acs": 21209, + "total_submitted": 35095, "frontend_question_id": 1765, "is_new_question": false }, @@ -20140,8 +20715,8 @@ "question__title": "Tree of Coprimes", "question__title_slug": "tree-of-coprimes", "question__hide": false, - "total_acs": 7579, - "total_submitted": 19108, + "total_acs": 7606, + "total_submitted": 19194, "frontend_question_id": 1766, "is_new_question": false }, @@ -20163,8 +20738,8 @@ "question__title": "Form Array by Concatenating Subarrays of Another Array", "question__title_slug": "form-array-by-concatenating-subarrays-of-another-array", "question__hide": false, - "total_acs": 12816, - "total_submitted": 24182, + "total_acs": 12865, + "total_submitted": 24278, "frontend_question_id": 1764, "is_new_question": false }, @@ -20186,8 +20761,8 @@ "question__title": "Longest Nice Substring", "question__title_slug": "longest-nice-substring", "question__hide": false, - "total_acs": 38204, - "total_submitted": 62255, + "total_acs": 38528, + "total_submitted": 62794, "frontend_question_id": 1763, "is_new_question": false }, @@ -20209,8 +20784,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": 9138, - "total_submitted": 27588, + "total_acs": 9169, + "total_submitted": 27676, "frontend_question_id": 1744, "is_new_question": false }, @@ -20232,8 +20807,8 @@ "question__title": "Palindrome Partitioning IV", "question__title_slug": "palindrome-partitioning-iv", "question__hide": false, - "total_acs": 19780, - "total_submitted": 43695, + "total_acs": 19869, + "total_submitted": 43913, "frontend_question_id": 1745, "is_new_question": false }, @@ -20255,8 +20830,8 @@ "question__title": "Restore the Array From Adjacent Pairs", "question__title_slug": "restore-the-array-from-adjacent-pairs", "question__hide": false, - "total_acs": 35040, - "total_submitted": 51035, + "total_acs": 35326, + "total_submitted": 51399, "frontend_question_id": 1743, "is_new_question": false }, @@ -20278,8 +20853,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": 2374, - "total_submitted": 4537, + "total_acs": 2399, + "total_submitted": 4577, "frontend_question_id": 1724, "is_new_question": false }, @@ -20301,8 +20876,8 @@ "question__title": "Count Apples and Oranges", "question__title_slug": "count-apples-and-oranges", "question__hide": false, - "total_acs": 12463, - "total_submitted": 16365, + "total_acs": 12506, + "total_submitted": 16448, "frontend_question_id": 1715, "is_new_question": false }, @@ -20324,8 +20899,8 @@ "question__title": "Building Boxes", "question__title_slug": "building-boxes", "question__hide": false, - "total_acs": 5958, - "total_submitted": 11466, + "total_acs": 5982, + "total_submitted": 11519, "frontend_question_id": 1739, "is_new_question": false }, @@ -20347,8 +20922,8 @@ "question__title": "Find Kth Largest XOR Coordinate Value", "question__title_slug": "find-kth-largest-xor-coordinate-value", "question__hide": false, - "total_acs": 18630, - "total_submitted": 30495, + "total_acs": 18715, + "total_submitted": 30629, "frontend_question_id": 1738, "is_new_question": false }, @@ -20370,8 +20945,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": 11535, - "total_submitted": 32609, + "total_acs": 11570, + "total_submitted": 32707, "frontend_question_id": 1737, "is_new_question": false }, @@ -20393,8 +20968,8 @@ "question__title": "Latest Time by Replacing Hidden Digits", "question__title_slug": "latest-time-by-replacing-hidden-digits", "question__hide": false, - "total_acs": 28984, - "total_submitted": 68187, + "total_acs": 29127, + "total_submitted": 68592, "frontend_question_id": 1736, "is_new_question": false }, @@ -20416,8 +20991,8 @@ "question__title": "Biggest Window Between Visits", "question__title_slug": "biggest-window-between-visits", "question__hide": false, - "total_acs": 17179, - "total_submitted": 22946, + "total_acs": 17288, + "total_submitted": 23143, "frontend_question_id": 1709, "is_new_question": false }, @@ -20433,14 +21008,14 @@ { "stat": { "question_id": 1851, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "maximum-number-of-events-that-can-be-attended-ii", + "question__article__has_video_solution": false, "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": 21740, - "total_submitted": 38061, + "total_acs": 21923, + "total_submitted": 38308, "frontend_question_id": 1751, "is_new_question": false }, @@ -20462,8 +21037,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": 18894, - "total_submitted": 42810, + "total_acs": 19016, + "total_submitted": 43059, "frontend_question_id": 1750, "is_new_question": false }, @@ -20485,8 +21060,8 @@ "question__title": "Maximum Absolute Sum of Any Subarray", "question__title_slug": "maximum-absolute-sum-of-any-subarray", "question__hide": false, - "total_acs": 31043, - "total_submitted": 53063, + "total_acs": 31174, + "total_submitted": 53300, "frontend_question_id": 1749, "is_new_question": false }, @@ -20508,8 +21083,8 @@ "question__title": "Sum of Unique Elements", "question__title_slug": "sum-of-unique-elements", "question__hide": false, - "total_acs": 116625, - "total_submitted": 152696, + "total_acs": 117617, + "total_submitted": 153991, "frontend_question_id": 1748, "is_new_question": false }, @@ -20531,8 +21106,8 @@ "question__title": "Largest Subarray Length K", "question__title_slug": "largest-subarray-length-k", "question__hide": false, - "total_acs": 7205, - "total_submitted": 11262, + "total_acs": 7237, + "total_submitted": 11326, "frontend_question_id": 1708, "is_new_question": false }, @@ -20554,8 +21129,8 @@ "question__title": "Largest Submatrix With Rearrangements", "question__title_slug": "largest-submatrix-with-rearrangements", "question__hide": false, - "total_acs": 15144, - "total_submitted": 24652, + "total_acs": 15193, + "total_submitted": 24721, "frontend_question_id": 1727, "is_new_question": false }, @@ -20577,8 +21152,8 @@ "question__title": "Maximum Number of Balls in a Box", "question__title_slug": "maximum-number-of-balls-in-a-box", "question__hide": false, - "total_acs": 51930, - "total_submitted": 70498, + "total_acs": 52247, + "total_submitted": 70981, "frontend_question_id": 1742, "is_new_question": false }, @@ -20600,8 +21175,8 @@ "question__title": "Number Of Rectangles That Can Form The Largest Square", "question__title_slug": "number-of-rectangles-that-can-form-the-largest-square", "question__hide": false, - "total_acs": 56709, - "total_submitted": 72087, + "total_acs": 57028, + "total_submitted": 72493, "frontend_question_id": 1725, "is_new_question": false }, @@ -20623,8 +21198,8 @@ "question__title": "Number of Calls Between Two Persons", "question__title_slug": "number-of-calls-between-two-persons", "question__hide": false, - "total_acs": 34064, - "total_submitted": 41238, + "total_acs": 34315, + "total_submitted": 41652, "frontend_question_id": 1699, "is_new_question": false }, @@ -20646,8 +21221,8 @@ "question__title": "Minimize Hamming Distance After Swap Operations", "question__title_slug": "minimize-hamming-distance-after-swap-operations", "question__hide": false, - "total_acs": 15374, - "total_submitted": 31578, + "total_acs": 15451, + "total_submitted": 31735, "frontend_question_id": 1722, "is_new_question": false }, @@ -20669,8 +21244,8 @@ "question__title": "Decode XORed Array", "question__title_slug": "decode-xored-array", "question__hide": false, - "total_acs": 111969, - "total_submitted": 130472, + "total_acs": 112946, + "total_submitted": 131641, "frontend_question_id": 1720, "is_new_question": false }, @@ -20692,8 +21267,8 @@ "question__title": "Number of Distinct Substrings in a String", "question__title_slug": "number-of-distinct-substrings-in-a-string", "question__hide": false, - "total_acs": 8051, - "total_submitted": 12680, + "total_acs": 8081, + "total_submitted": 12728, "frontend_question_id": 1698, "is_new_question": false }, @@ -20715,8 +21290,8 @@ "question__title": "Daily Leads and Partners", "question__title_slug": "daily-leads-and-partners", "question__hide": false, - "total_acs": 79228, - "total_submitted": 89964, + "total_acs": 80466, + "total_submitted": 91458, "frontend_question_id": 1693, "is_new_question": false }, @@ -20738,8 +21313,8 @@ "question__title": "Count Ways to Make Array With Product", "question__title_slug": "count-ways-to-make-array-with-product", "question__hide": false, - "total_acs": 4563, - "total_submitted": 9134, + "total_acs": 4600, + "total_submitted": 9219, "frontend_question_id": 1735, "is_new_question": false }, @@ -20761,8 +21336,8 @@ "question__title": "Decode XORed Permutation", "question__title_slug": "decode-xored-permutation", "question__hide": false, - "total_acs": 12312, - "total_submitted": 19520, + "total_acs": 12366, + "total_submitted": 19588, "frontend_question_id": 1734, "is_new_question": false }, @@ -20784,8 +21359,8 @@ "question__title": "Minimum Number of People to Teach", "question__title_slug": "minimum-number-of-people-to-teach", "question__hide": false, - "total_acs": 7557, - "total_submitted": 18047, + "total_acs": 7602, + "total_submitted": 18232, "frontend_question_id": 1733, "is_new_question": false }, @@ -20807,8 +21382,8 @@ "question__title": "Find the Highest Altitude", "question__title_slug": "find-the-highest-altitude", "question__hide": false, - "total_acs": 113318, - "total_submitted": 143562, + "total_acs": 115665, + "total_submitted": 146398, "frontend_question_id": 1732, "is_new_question": false }, @@ -20830,8 +21405,8 @@ "question__title": "Minimum Operations to Make a Subsequence", "question__title_slug": "minimum-operations-to-make-a-subsequence", "question__hide": false, - "total_acs": 9368, - "total_submitted": 19309, + "total_acs": 9430, + "total_submitted": 19426, "frontend_question_id": 1713, "is_new_question": false }, @@ -20853,8 +21428,8 @@ "question__title": "Ways to Split Array Into Three Subarrays", "question__title_slug": "ways-to-split-array-into-three-subarrays", "question__hide": false, - "total_acs": 28070, - "total_submitted": 85806, + "total_acs": 28248, + "total_submitted": 86264, "frontend_question_id": 1712, "is_new_question": false }, @@ -20876,8 +21451,8 @@ "question__title": "Count Good Meals", "question__title_slug": "count-good-meals", "question__hide": false, - "total_acs": 32274, - "total_submitted": 110119, + "total_acs": 32418, + "total_submitted": 110526, "frontend_question_id": 1711, "is_new_question": false }, @@ -20899,8 +21474,8 @@ "question__title": "Maximum Units on a Truck", "question__title_slug": "maximum-units-on-a-truck", "question__hide": false, - "total_acs": 265597, - "total_submitted": 359853, + "total_acs": 266344, + "total_submitted": 360926, "frontend_question_id": 1710, "is_new_question": false }, @@ -20922,8 +21497,8 @@ "question__title": "Count Ways to Distribute Candies", "question__title_slug": "count-ways-to-distribute-candies", "question__hide": false, - "total_acs": 2139, - "total_submitted": 3428, + "total_acs": 2146, + "total_submitted": 3452, "frontend_question_id": 1692, "is_new_question": false }, @@ -20945,8 +21520,8 @@ "question__title": "Invalid Tweets", "question__title_slug": "invalid-tweets", "question__hide": false, - "total_acs": 28592, - "total_submitted": 31904, + "total_acs": 32953, + "total_submitted": 37069, "frontend_question_id": 1683, "is_new_question": false }, @@ -20968,8 +21543,8 @@ "question__title": "Maximum XOR With an Element From Array", "question__title_slug": "maximum-xor-with-an-element-from-array", "question__hide": false, - "total_acs": 14099, - "total_submitted": 31291, + "total_acs": 14281, + "total_submitted": 31548, "frontend_question_id": 1707, "is_new_question": false }, @@ -20991,8 +21566,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": 20944, - "total_submitted": 49376, + "total_acs": 21054, + "total_submitted": 49608, "frontend_question_id": 1723, "is_new_question": false }, @@ -21014,8 +21589,8 @@ "question__title": "Maximum Number of Eaten Apples", "question__title_slug": "maximum-number-of-eaten-apples", "question__hide": false, - "total_acs": 19088, - "total_submitted": 50197, + "total_acs": 19160, + "total_submitted": 50389, "frontend_question_id": 1705, "is_new_question": false }, @@ -21037,8 +21612,8 @@ "question__title": "Determine if String Halves Are Alike", "question__title_slug": "determine-if-string-halves-are-alike", "question__hide": false, - "total_acs": 188896, - "total_submitted": 243041, + "total_acs": 189520, + "total_submitted": 243882, "frontend_question_id": 1704, "is_new_question": false }, @@ -21060,8 +21635,8 @@ "question__title": "Longest Palindromic Subsequence II", "question__title_slug": "longest-palindromic-subsequence-ii", "question__hide": false, - "total_acs": 4697, - "total_submitted": 9445, + "total_acs": 4703, + "total_submitted": 9465, "frontend_question_id": 1682, "is_new_question": false }, @@ -21083,8 +21658,8 @@ "question__title": "Product's Worth Over Invoices", "question__title_slug": "products-worth-over-invoices", "question__hide": false, - "total_acs": 14398, - "total_submitted": 37685, + "total_acs": 14448, + "total_submitted": 37818, "frontend_question_id": 1677, "is_new_question": false }, @@ -21106,8 +21681,8 @@ "question__title": "Number Of Ways To Reconstruct A Tree", "question__title_slug": "number-of-ways-to-reconstruct-a-tree", "question__hide": false, - "total_acs": 3497, - "total_submitted": 8018, + "total_acs": 3580, + "total_submitted": 8216, "frontend_question_id": 1719, "is_new_question": false }, @@ -21129,8 +21704,8 @@ "question__title": "Construct the Lexicographically Largest Valid Sequence", "question__title_slug": "construct-the-lexicographically-largest-valid-sequence", "question__hide": false, - "total_acs": 10926, - "total_submitted": 20938, + "total_acs": 10961, + "total_submitted": 21003, "frontend_question_id": 1718, "is_new_question": false }, @@ -21152,8 +21727,8 @@ "question__title": "Maximum Score From Removing Substrings", "question__title_slug": "maximum-score-from-removing-substrings", "question__hide": false, - "total_acs": 12410, - "total_submitted": 26871, + "total_acs": 12465, + "total_submitted": 26966, "frontend_question_id": 1717, "is_new_question": false }, @@ -21175,8 +21750,8 @@ "question__title": "Calculate Money in Leetcode Bank", "question__title_slug": "calculate-money-in-leetcode-bank", "question__hide": false, - "total_acs": 39877, - "total_submitted": 60195, + "total_acs": 40100, + "total_submitted": 60478, "frontend_question_id": 1716, "is_new_question": false }, @@ -21198,8 +21773,8 @@ "question__title": "Lowest Common Ancestor of a Binary Tree IV", "question__title_slug": "lowest-common-ancestor-of-a-binary-tree-iv", "question__hide": false, - "total_acs": 28694, - "total_submitted": 36092, + "total_acs": 28793, + "total_submitted": 36220, "frontend_question_id": 1676, "is_new_question": false }, @@ -21221,8 +21796,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": 44804, - "total_submitted": 70920, + "total_acs": 45300, + "total_submitted": 71776, "frontend_question_id": 1697, "is_new_question": false }, @@ -21244,8 +21819,8 @@ "question__title": "Jump Game VI", "question__title_slug": "jump-game-vi", "question__hide": false, - "total_acs": 98370, - "total_submitted": 213780, + "total_acs": 98576, + "total_submitted": 214265, "frontend_question_id": 1696, "is_new_question": false }, @@ -21267,8 +21842,8 @@ "question__title": "Maximum Erasure Value", "question__title_slug": "maximum-erasure-value", "question__hide": false, - "total_acs": 109428, - "total_submitted": 190094, + "total_acs": 109804, + "total_submitted": 190781, "frontend_question_id": 1695, "is_new_question": false }, @@ -21290,8 +21865,8 @@ "question__title": "Reformat Phone Number", "question__title_slug": "reformat-phone-number", "question__hide": false, - "total_acs": 31096, - "total_submitted": 47790, + "total_acs": 31229, + "total_submitted": 48019, "frontend_question_id": 1694, "is_new_question": false }, @@ -21313,8 +21888,8 @@ "question__title": "Fix Names in a Table", "question__title_slug": "fix-names-in-a-table", "question__hide": false, - "total_acs": 113312, - "total_submitted": 174790, + "total_acs": 115733, + "total_submitted": 178759, "frontend_question_id": 1667, "is_new_question": false }, @@ -21336,8 +21911,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": 3379, - "total_submitted": 4624, + "total_acs": 3393, + "total_submitted": 4640, "frontend_question_id": 1666, "is_new_question": false }, @@ -21382,8 +21957,8 @@ "question__title": "Stone Game VII", "question__title_slug": "stone-game-vii", "question__hide": false, - "total_acs": 30521, - "total_submitted": 52475, + "total_acs": 30595, + "total_submitted": 52610, "frontend_question_id": 1690, "is_new_question": false }, @@ -21405,8 +21980,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": 174563, - "total_submitted": 195822, + "total_acs": 175556, + "total_submitted": 197001, "frontend_question_id": 1689, "is_new_question": false }, @@ -21428,8 +22003,8 @@ "question__title": "Count of Matches in Tournament", "question__title_slug": "count-of-matches-in-tournament", "question__hide": false, - "total_acs": 98532, - "total_submitted": 118616, + "total_acs": 99361, + "total_submitted": 119675, "frontend_question_id": 1688, "is_new_question": false }, @@ -21451,8 +22026,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": 8562, - "total_submitted": 20020, + "total_acs": 8593, + "total_submitted": 20092, "frontend_question_id": 1703, "is_new_question": false }, @@ -21474,8 +22049,8 @@ "question__title": "Maximum Binary String After Change", "question__title_slug": "maximum-binary-string-after-change", "question__hide": false, - "total_acs": 10854, - "total_submitted": 23512, + "total_acs": 10912, + "total_submitted": 23613, "frontend_question_id": 1702, "is_new_question": false }, @@ -21497,8 +22072,8 @@ "question__title": "Average Waiting Time", "question__title_slug": "average-waiting-time", "question__hide": false, - "total_acs": 24269, - "total_submitted": 38772, + "total_acs": 24429, + "total_submitted": 39006, "frontend_question_id": 1701, "is_new_question": false }, @@ -21520,8 +22095,8 @@ "question__title": "Number of Students Unable to Eat Lunch", "question__title_slug": "number-of-students-unable-to-eat-lunch", "question__hide": false, - "total_acs": 64590, - "total_submitted": 93620, + "total_acs": 65301, + "total_submitted": 94565, "frontend_question_id": 1700, "is_new_question": false }, @@ -21543,8 +22118,8 @@ "question__title": "Average Time of Process per Machine", "question__title_slug": "average-time-of-process-per-machine", "question__hide": false, - "total_acs": 22264, - "total_submitted": 28917, + "total_acs": 24169, + "total_submitted": 31820, "frontend_question_id": 1661, "is_new_question": false }, @@ -21566,8 +22141,8 @@ "question__title": "Concatenation of Consecutive Binary Numbers", "question__title_slug": "concatenation-of-consecutive-binary-numbers", "question__hide": false, - "total_acs": 87266, - "total_submitted": 153113, + "total_acs": 87354, + "total_submitted": 153241, "frontend_question_id": 1680, "is_new_question": false }, @@ -21589,8 +22164,8 @@ "question__title": "Minimum Incompatibility", "question__title_slug": "minimum-incompatibility", "question__hide": false, - "total_acs": 7126, - "total_submitted": 18759, + "total_acs": 7142, + "total_submitted": 18788, "frontend_question_id": 1681, "is_new_question": false }, @@ -21612,8 +22187,8 @@ "question__title": "Max Number of K-Sum Pairs", "question__title_slug": "max-number-of-k-sum-pairs", "question__hide": false, - "total_acs": 123498, - "total_submitted": 215786, + "total_acs": 125219, + "total_submitted": 218894, "frontend_question_id": 1679, "is_new_question": false }, @@ -21635,8 +22210,8 @@ "question__title": "Goal Parser Interpretation", "question__title_slug": "goal-parser-interpretation", "question__hide": false, - "total_acs": 181222, - "total_submitted": 209124, + "total_acs": 183145, + "total_submitted": 211306, "frontend_question_id": 1678, "is_new_question": false }, @@ -21658,8 +22233,8 @@ "question__title": "Correct a Binary Tree", "question__title_slug": "correct-a-binary-tree", "question__hide": false, - "total_acs": 14065, - "total_submitted": 19401, + "total_acs": 14099, + "total_submitted": 19452, "frontend_question_id": 1660, "is_new_question": false }, @@ -21681,8 +22256,8 @@ "question__title": "Hopper Company Queries III", "question__title_slug": "hopper-company-queries-iii", "question__hide": false, - "total_acs": 5365, - "total_submitted": 7902, + "total_acs": 5393, + "total_submitted": 7938, "frontend_question_id": 1651, "is_new_question": false }, @@ -21704,8 +22279,8 @@ "question__title": "Minimize Deviation in Array", "question__title_slug": "minimize-deviation-in-array", "question__hide": false, - "total_acs": 88057, - "total_submitted": 161539, + "total_acs": 88174, + "total_submitted": 161780, "frontend_question_id": 1675, "is_new_question": false }, @@ -21727,8 +22302,8 @@ "question__title": "Minimum Moves to Make Array Complementary", "question__title_slug": "minimum-moves-to-make-array-complementary", "question__hide": false, - "total_acs": 7472, - "total_submitted": 19340, + "total_acs": 7509, + "total_submitted": 19420, "frontend_question_id": 1674, "is_new_question": false }, @@ -21750,8 +22325,8 @@ "question__title": "Find the Most Competitive Subsequence", "question__title_slug": "find-the-most-competitive-subsequence", "question__hide": false, - "total_acs": 52063, - "total_submitted": 105635, + "total_acs": 52247, + "total_submitted": 106084, "frontend_question_id": 1673, "is_new_question": false }, @@ -21773,8 +22348,8 @@ "question__title": "Richest Customer Wealth", "question__title_slug": "richest-customer-wealth", "question__hide": false, - "total_acs": 591283, - "total_submitted": 673197, + "total_acs": 599904, + "total_submitted": 683489, "frontend_question_id": 1672, "is_new_question": false }, @@ -21796,8 +22371,8 @@ "question__title": "Lowest Common Ancestor of a Binary Tree III", "question__title_slug": "lowest-common-ancestor-of-a-binary-tree-iii", "question__hide": false, - "total_acs": 158535, - "total_submitted": 204716, + "total_acs": 158765, + "total_submitted": 205017, "frontend_question_id": 1650, "is_new_question": false }, @@ -21819,8 +22394,8 @@ "question__title": "Delivering Boxes from Storage to Ports", "question__title_slug": "delivering-boxes-from-storage-to-ports", "question__hide": false, - "total_acs": 5089, - "total_submitted": 13240, + "total_acs": 5108, + "total_submitted": 13296, "frontend_question_id": 1687, "is_new_question": false }, @@ -21842,8 +22417,8 @@ "question__title": "Stone Game VI", "question__title_slug": "stone-game-vi", "question__hide": false, - "total_acs": 14546, - "total_submitted": 26527, + "total_acs": 14623, + "total_submitted": 26648, "frontend_question_id": 1686, "is_new_question": false }, @@ -21865,8 +22440,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": 27512, - "total_submitted": 43538, + "total_acs": 27677, + "total_submitted": 43842, "frontend_question_id": 1685, "is_new_question": false }, @@ -21888,8 +22463,8 @@ "question__title": "Count the Number of Consistent Strings", "question__title_slug": "count-the-number-of-consistent-strings", "question__hide": false, - "total_acs": 129614, - "total_submitted": 157355, + "total_acs": 130569, + "total_submitted": 158540, "frontend_question_id": 1684, "is_new_question": false }, @@ -21911,8 +22486,8 @@ "question__title": "Hopper Company Queries II", "question__title_slug": "hopper-company-queries-ii", "question__hide": false, - "total_acs": 5206, - "total_submitted": 13482, + "total_acs": 5238, + "total_submitted": 13554, "frontend_question_id": 1645, "is_new_question": false }, @@ -21934,8 +22509,8 @@ "question__title": "Minimum Initial Energy to Finish Tasks", "question__title_slug": "minimum-initial-energy-to-finish-tasks", "question__hide": false, - "total_acs": 14341, - "total_submitted": 25420, + "total_acs": 14395, + "total_submitted": 25506, "frontend_question_id": 1665, "is_new_question": false }, @@ -21957,8 +22532,8 @@ "question__title": "Ways to Make a Fair Array", "question__title_slug": "ways-to-make-a-fair-array", "question__hide": false, - "total_acs": 30827, - "total_submitted": 48721, + "total_acs": 30940, + "total_submitted": 48891, "frontend_question_id": 1664, "is_new_question": false }, @@ -21980,8 +22555,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": 87742, - "total_submitted": 131427, + "total_acs": 87898, + "total_submitted": 131749, "frontend_question_id": 1663, "is_new_question": false }, @@ -22003,8 +22578,8 @@ "question__title": "Check If Two String Arrays are Equivalent", "question__title_slug": "check-if-two-string-arrays-are-equivalent", "question__hide": false, - "total_acs": 273347, - "total_submitted": 327220, + "total_acs": 275156, + "total_submitted": 329465, "frontend_question_id": 1662, "is_new_question": false }, @@ -22026,8 +22601,8 @@ "question__title": "Lowest Common Ancestor of a Binary Tree II", "question__title_slug": "lowest-common-ancestor-of-a-binary-tree-ii", "question__hide": false, - "total_acs": 57061, - "total_submitted": 94978, + "total_acs": 57200, + "total_submitted": 95192, "frontend_question_id": 1644, "is_new_question": false }, @@ -22049,8 +22624,8 @@ "question__title": "Hopper Company Queries I", "question__title_slug": "hopper-company-queries-i", "question__hide": false, - "total_acs": 6871, - "total_submitted": 13623, + "total_acs": 6903, + "total_submitted": 13702, "frontend_question_id": 1635, "is_new_question": false }, @@ -22072,8 +22647,8 @@ "question__title": "Maximize Grid Happiness", "question__title_slug": "maximize-grid-happiness", "question__hide": false, - "total_acs": 4480, - "total_submitted": 11514, + "total_acs": 4492, + "total_submitted": 11543, "frontend_question_id": 1659, "is_new_question": false }, @@ -22095,8 +22670,8 @@ "question__title": "Determine if Two Strings Are Close", "question__title_slug": "determine-if-two-strings-are-close", "question__hide": false, - "total_acs": 107212, - "total_submitted": 190425, + "total_acs": 108396, + "total_submitted": 192747, "frontend_question_id": 1657, "is_new_question": false }, @@ -22118,8 +22693,8 @@ "question__title": "Minimum Operations to Reduce X to Zero", "question__title_slug": "minimum-operations-to-reduce-x-to-zero", "question__hide": false, - "total_acs": 110071, - "total_submitted": 292717, + "total_acs": 110289, + "total_submitted": 293264, "frontend_question_id": 1658, "is_new_question": false }, @@ -22141,8 +22716,8 @@ "question__title": "Design an Ordered Stream", "question__title_slug": "design-an-ordered-stream", "question__hide": false, - "total_acs": 67835, - "total_submitted": 79803, + "total_acs": 68285, + "total_submitted": 80338, "frontend_question_id": 1656, "is_new_question": false }, @@ -22164,8 +22739,8 @@ "question__title": "Add Two Polynomials Represented as Linked Lists", "question__title_slug": "add-two-polynomials-represented-as-linked-lists", "question__hide": false, - "total_acs": 8996, - "total_submitted": 16442, + "total_acs": 9056, + "total_submitted": 16526, "frontend_question_id": 1634, "is_new_question": false }, @@ -22187,8 +22762,8 @@ "question__title": "Percentage of Users Attended a Contest", "question__title_slug": "percentage-of-users-attended-a-contest", "question__hide": false, - "total_acs": 25369, - "total_submitted": 38805, + "total_acs": 26734, + "total_submitted": 41308, "frontend_question_id": 1633, "is_new_question": false }, @@ -22210,8 +22785,8 @@ "question__title": "Create Sorted Array through Instructions", "question__title_slug": "create-sorted-array-through-instructions", "question__hide": false, - "total_acs": 22738, - "total_submitted": 60578, + "total_acs": 22785, + "total_submitted": 60696, "frontend_question_id": 1649, "is_new_question": false }, @@ -22233,8 +22808,8 @@ "question__title": "Sell Diminishing-Valued Colored Balls", "question__title_slug": "sell-diminishing-valued-colored-balls", "question__hide": false, - "total_acs": 35062, - "total_submitted": 115226, + "total_acs": 35158, + "total_submitted": 115549, "frontend_question_id": 1648, "is_new_question": false }, @@ -22256,8 +22831,8 @@ "question__title": "Minimum Deletions to Make Character Frequencies Unique", "question__title_slug": "minimum-deletions-to-make-character-frequencies-unique", "question__hide": false, - "total_acs": 171486, - "total_submitted": 290448, + "total_acs": 171914, + "total_submitted": 291199, "frontend_question_id": 1647, "is_new_question": false }, @@ -22279,8 +22854,8 @@ "question__title": "Get Maximum in Generated Array", "question__title_slug": "get-maximum-in-generated-array", "question__hide": false, - "total_acs": 87093, - "total_submitted": 173557, + "total_acs": 87706, + "total_submitted": 174796, "frontend_question_id": 1646, "is_new_question": false }, @@ -22302,8 +22877,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": 24379, - "total_submitted": 29422, + "total_acs": 24432, + "total_submitted": 29495, "frontend_question_id": 1628, "is_new_question": false }, @@ -22325,8 +22900,8 @@ "question__title": "Design Front Middle Back Queue", "question__title_slug": "design-front-middle-back-queue", "question__hide": false, - "total_acs": 21093, - "total_submitted": 37007, + "total_acs": 21211, + "total_submitted": 37358, "frontend_question_id": 1670, "is_new_question": false }, @@ -22348,8 +22923,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": 21356, - "total_submitted": 50400, + "total_acs": 21532, + "total_submitted": 50949, "frontend_question_id": 1671, "is_new_question": false }, @@ -22371,8 +22946,8 @@ "question__title": "Merge In Between Linked Lists", "question__title_slug": "merge-in-between-linked-lists", "question__hide": false, - "total_acs": 70935, - "total_submitted": 96320, + "total_acs": 71430, + "total_submitted": 96999, "frontend_question_id": 1669, "is_new_question": false }, @@ -22394,8 +22969,8 @@ "question__title": "Maximum Repeating Substring", "question__title_slug": "maximum-repeating-substring", "question__hide": false, - "total_acs": 35151, - "total_submitted": 89404, + "total_acs": 35379, + "total_submitted": 90085, "frontend_question_id": 1668, "is_new_question": false }, @@ -22417,8 +22992,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": 17111, - "total_submitted": 19791, + "total_acs": 17167, + "total_submitted": 19865, "frontend_question_id": 1623, "is_new_question": false }, @@ -22440,8 +23015,8 @@ "question__title": "Furthest Building You Can Reach", "question__title_slug": "furthest-building-you-can-reach", "question__hide": false, - "total_acs": 113955, - "total_submitted": 235851, + "total_acs": 114348, + "total_submitted": 236575, "frontend_question_id": 1642, "is_new_question": false }, @@ -22463,8 +23038,8 @@ "question__title": "Count Sorted Vowel Strings", "question__title_slug": "count-sorted-vowel-strings", "question__hide": false, - "total_acs": 157037, - "total_submitted": 202749, + "total_acs": 157592, + "total_submitted": 203405, "frontend_question_id": 1641, "is_new_question": false }, @@ -22486,8 +23061,8 @@ "question__title": "Check Array Formation Through Concatenation", "question__title_slug": "check-array-formation-through-concatenation", "question__hide": false, - "total_acs": 74916, - "total_submitted": 133180, + "total_acs": 75105, + "total_submitted": 133450, "frontend_question_id": 1640, "is_new_question": false }, @@ -22509,8 +23084,8 @@ "question__title": "Find the Missing IDs", "question__title_slug": "find-the-missing-ids", "question__hide": false, - "total_acs": 15630, - "total_submitted": 20948, + "total_acs": 15698, + "total_submitted": 21035, "frontend_question_id": 1613, "is_new_question": false }, @@ -22532,8 +23107,8 @@ "question__title": "Distribute Repeating Integers", "question__title_slug": "distribute-repeating-integers", "question__hide": false, - "total_acs": 10815, - "total_submitted": 27432, + "total_acs": 10892, + "total_submitted": 27584, "frontend_question_id": 1655, "is_new_question": false }, @@ -22555,8 +23130,8 @@ "question__title": "Minimum Jumps to Reach Home", "question__title_slug": "minimum-jumps-to-reach-home", "question__hide": false, - "total_acs": 35805, - "total_submitted": 122792, + "total_acs": 36038, + "total_submitted": 123439, "frontend_question_id": 1654, "is_new_question": false }, @@ -22578,8 +23153,8 @@ "question__title": "Minimum Deletions to Make String Balanced", "question__title_slug": "minimum-deletions-to-make-string-balanced", "question__hide": false, - "total_acs": 34504, - "total_submitted": 58549, + "total_acs": 34684, + "total_submitted": 58843, "frontend_question_id": 1653, "is_new_question": false }, @@ -22601,8 +23176,8 @@ "question__title": "Defuse the Bomb", "question__title_slug": "defuse-the-bomb", "question__hide": false, - "total_acs": 31282, - "total_submitted": 49969, + "total_acs": 31503, + "total_submitted": 50274, "frontend_question_id": 1652, "is_new_question": false }, @@ -22624,8 +23199,8 @@ "question__title": "Path With Minimum Effort", "question__title_slug": "path-with-minimum-effort", "question__hide": false, - "total_acs": 145372, - "total_submitted": 260575, + "total_acs": 146300, + "total_submitted": 262179, "frontend_question_id": 1631, "is_new_question": false }, @@ -22647,8 +23222,8 @@ "question__title": "Arithmetic Subarrays", "question__title_slug": "arithmetic-subarrays", "question__hide": false, - "total_acs": 51164, - "total_submitted": 63629, + "total_acs": 51502, + "total_submitted": 64050, "frontend_question_id": 1630, "is_new_question": false }, @@ -22670,8 +23245,8 @@ "question__title": "Slowest Key", "question__title_slug": "slowest-key", "question__hide": false, - "total_acs": 89042, - "total_submitted": 150522, + "total_acs": 89271, + "total_submitted": 150942, "frontend_question_id": 1629, "is_new_question": false }, @@ -22693,8 +23268,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": 6301, - "total_submitted": 8974, + "total_acs": 6322, + "total_submitted": 9002, "frontend_question_id": 1612, "is_new_question": false }, @@ -22716,8 +23291,8 @@ "question__title": "Sellers With No Sales", "question__title_slug": "sellers-with-no-sales", "question__hide": false, - "total_acs": 25612, - "total_submitted": 46826, + "total_acs": 25857, + "total_submitted": 47280, "frontend_question_id": 1607, "is_new_question": false }, @@ -22739,8 +23314,8 @@ "question__title": "Best Team With No Conflicts", "question__title_slug": "best-team-with-no-conflicts", "question__hide": false, - "total_acs": 71478, - "total_submitted": 139845, + "total_acs": 71791, + "total_submitted": 140500, "frontend_question_id": 1626, "is_new_question": false }, @@ -22762,8 +23337,8 @@ "question__title": "Lexicographically Smallest String After Applying Operations", "question__title_slug": "lexicographically-smallest-string-after-applying-operations", "question__hide": false, - "total_acs": 12530, - "total_submitted": 19078, + "total_acs": 12576, + "total_submitted": 19152, "frontend_question_id": 1625, "is_new_question": false }, @@ -22785,8 +23360,8 @@ "question__title": "Largest Substring Between Two Equal Characters", "question__title_slug": "largest-substring-between-two-equal-characters", "question__hide": false, - "total_acs": 42026, - "total_submitted": 71120, + "total_acs": 42248, + "total_submitted": 71512, "frontend_question_id": 1624, "is_new_question": false }, @@ -22808,8 +23383,8 @@ "question__title": "Find Nearest Right Node in Binary Tree", "question__title_slug": "find-nearest-right-node-in-binary-tree", "question__hide": false, - "total_acs": 21434, - "total_submitted": 28374, + "total_acs": 21477, + "total_submitted": 28427, "frontend_question_id": 1602, "is_new_question": false }, @@ -22831,8 +23406,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": 48203, - "total_submitted": 89311, + "total_acs": 48406, + "total_submitted": 89811, "frontend_question_id": 1639, "is_new_question": false }, @@ -22854,8 +23429,8 @@ "question__title": "Count Substrings That Differ by One Character", "question__title_slug": "count-substrings-that-differ-by-one-character", "question__hide": false, - "total_acs": 24566, - "total_submitted": 34511, + "total_acs": 24693, + "total_submitted": 34671, "frontend_question_id": 1638, "is_new_question": false }, @@ -22877,8 +23452,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": 39517, - "total_submitted": 46811, + "total_acs": 39773, + "total_submitted": 47125, "frontend_question_id": 1637, "is_new_question": false }, @@ -22900,8 +23475,8 @@ "question__title": "Sort Array by Increasing Frequency", "question__title_slug": "sort-array-by-increasing-frequency", "question__hide": false, - "total_acs": 94842, - "total_submitted": 136178, + "total_acs": 95557, + "total_submitted": 137068, "frontend_question_id": 1636, "is_new_question": false }, @@ -22923,8 +23498,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": 8160, - "total_submitted": 12384, + "total_acs": 8223, + "total_submitted": 12478, "frontend_question_id": 1617, "is_new_question": false }, @@ -22946,8 +23521,8 @@ "question__title": "Split Two Strings to Make Palindrome", "question__title_slug": "split-two-strings-to-make-palindrome", "question__hide": false, - "total_acs": 20314, - "total_submitted": 65133, + "total_acs": 20396, + "total_submitted": 65398, "frontend_question_id": 1616, "is_new_question": false }, @@ -22969,8 +23544,8 @@ "question__title": "Maximal Network Rank", "question__title_slug": "maximal-network-rank", "question__hide": false, - "total_acs": 62341, - "total_submitted": 106243, + "total_acs": 62778, + "total_submitted": 106923, "frontend_question_id": 1615, "is_new_question": false }, @@ -22992,8 +23567,8 @@ "question__title": "Maximum Nesting Depth of the Parentheses", "question__title_slug": "maximum-nesting-depth-of-the-parentheses", "question__hide": false, - "total_acs": 128750, - "total_submitted": 156758, + "total_acs": 129625, + "total_submitted": 157965, "frontend_question_id": 1614, "is_new_question": false }, @@ -23015,8 +23590,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": 11995, - "total_submitted": 19131, + "total_acs": 12020, + "total_submitted": 19183, "frontend_question_id": 1597, "is_new_question": false }, @@ -23038,8 +23613,8 @@ "question__title": "The Most Frequently Ordered Products for Each Customer", "question__title_slug": "the-most-frequently-ordered-products-for-each-customer", "question__hide": false, - "total_acs": 26769, - "total_submitted": 32334, + "total_acs": 26912, + "total_submitted": 32518, "frontend_question_id": 1596, "is_new_question": false }, @@ -23061,8 +23636,8 @@ "question__title": "Bank Account Summary II", "question__title_slug": "bank-account-summary-ii", "question__hide": false, - "total_acs": 71917, - "total_submitted": 84208, + "total_acs": 72971, + "total_submitted": 85616, "frontend_question_id": 1587, "is_new_question": false }, @@ -23084,8 +23659,8 @@ "question__title": "Maximum Number of Visible Points", "question__title_slug": "maximum-number-of-visible-points", "question__hide": false, - "total_acs": 36596, - "total_submitted": 98062, + "total_acs": 36683, + "total_submitted": 98453, "frontend_question_id": 1610, "is_new_question": false }, @@ -23107,8 +23682,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": 12793, - "total_submitted": 20186, + "total_acs": 12885, + "total_submitted": 20324, "frontend_question_id": 1611, "is_new_question": false }, @@ -23130,8 +23705,8 @@ "question__title": "Even Odd Tree", "question__title_slug": "even-odd-tree", "question__hide": false, - "total_acs": 44016, - "total_submitted": 80871, + "total_acs": 44396, + "total_submitted": 81414, "frontend_question_id": 1609, "is_new_question": false }, @@ -23153,8 +23728,8 @@ "question__title": "Special Array With X Elements Greater Than or Equal X", "question__title_slug": "special-array-with-x-elements-greater-than-or-equal-x", "question__hide": false, - "total_acs": 66474, - "total_submitted": 109875, + "total_acs": 66999, + "total_submitted": 110722, "frontend_question_id": 1608, "is_new_question": false }, @@ -23176,8 +23751,8 @@ "question__title": "Binary Search Tree Iterator II", "question__title_slug": "binary-search-tree-iterator-ii", "question__hide": false, - "total_acs": 12709, - "total_submitted": 17955, + "total_acs": 12734, + "total_submitted": 18040, "frontend_question_id": 1586, "is_new_question": false }, @@ -23199,8 +23774,8 @@ "question__title": "Fancy Sequence", "question__title_slug": "fancy-sequence", "question__hide": false, - "total_acs": 9769, - "total_submitted": 60281, + "total_acs": 9818, + "total_submitted": 60523, "frontend_question_id": 1622, "is_new_question": false }, @@ -23222,8 +23797,8 @@ "question__title": "Cat and Mouse II", "question__title_slug": "cat-and-mouse-ii", "question__hide": false, - "total_acs": 5858, - "total_submitted": 14899, + "total_acs": 5878, + "total_submitted": 14965, "frontend_question_id": 1728, "is_new_question": false }, @@ -23245,8 +23820,8 @@ "question__title": "Coordinate With Maximum Network Quality", "question__title_slug": "coordinate-with-maximum-network-quality", "question__hide": false, - "total_acs": 7551, - "total_submitted": 20044, + "total_acs": 7586, + "total_submitted": 20234, "frontend_question_id": 1620, "is_new_question": false }, @@ -23268,8 +23843,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": 8306, - "total_submitted": 19625, + "total_acs": 8328, + "total_submitted": 19695, "frontend_question_id": 1621, "is_new_question": false }, @@ -23291,8 +23866,8 @@ "question__title": "Customer Who Visited but Did Not Make Any Transactions", "question__title_slug": "customer-who-visited-but-did-not-make-any-transactions", "question__hide": false, - "total_acs": 94399, - "total_submitted": 112273, + "total_acs": 97928, + "total_submitted": 117494, "frontend_question_id": 1581, "is_new_question": false }, @@ -23308,14 +23883,14 @@ { "stat": { "question_id": 1723, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "maximum-number-of-achievable-transfer-requests", + "question__article__has_video_solution": false, "question__title": "Maximum Number of Achievable Transfer Requests", "question__title_slug": "maximum-number-of-achievable-transfer-requests", "question__hide": false, - "total_acs": 9440, - "total_submitted": 18487, + "total_acs": 9486, + "total_submitted": 18567, "frontend_question_id": 1601, "is_new_question": false }, @@ -23337,8 +23912,8 @@ "question__title": "Throne Inheritance", "question__title_slug": "throne-inheritance", "question__hide": false, - "total_acs": 14088, - "total_submitted": 22122, + "total_acs": 14145, + "total_submitted": 22193, "frontend_question_id": 1600, "is_new_question": false }, @@ -23360,8 +23935,8 @@ "question__title": "Maximum Profit of Operating a Centennial Wheel", "question__title_slug": "maximum-profit-of-operating-a-centennial-wheel", "question__hide": false, - "total_acs": 10990, - "total_submitted": 25150, + "total_acs": 11025, + "total_submitted": 25217, "frontend_question_id": 1599, "is_new_question": false }, @@ -23383,8 +23958,8 @@ "question__title": "Crawler Log Folder", "question__title_slug": "crawler-log-folder", "question__hide": false, - "total_acs": 59686, - "total_submitted": 92406, + "total_acs": 60036, + "total_submitted": 92971, "frontend_question_id": 1598, "is_new_question": false }, @@ -23406,8 +23981,8 @@ "question__title": "Put Boxes Into the Warehouse II", "question__title_slug": "put-boxes-into-the-warehouse-ii", "question__hide": false, - "total_acs": 3978, - "total_submitted": 6246, + "total_acs": 3996, + "total_submitted": 6277, "frontend_question_id": 1580, "is_new_question": false }, @@ -23429,8 +24004,8 @@ "question__title": "Warehouse Manager", "question__title_slug": "warehouse-manager", "question__hide": false, - "total_acs": 34922, - "total_submitted": 39420, + "total_acs": 35192, + "total_submitted": 39748, "frontend_question_id": 1571, "is_new_question": false }, @@ -23452,8 +24027,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": 7440, - "total_submitted": 15882, + "total_acs": 7474, + "total_submitted": 15959, "frontend_question_id": 1595, "is_new_question": false }, @@ -23475,8 +24050,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": 20658, - "total_submitted": 62324, + "total_acs": 20727, + "total_submitted": 62519, "frontend_question_id": 1594, "is_new_question": false }, @@ -23498,8 +24073,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": 25890, - "total_submitted": 46735, + "total_acs": 25995, + "total_submitted": 46897, "frontend_question_id": 1593, "is_new_question": false }, @@ -23521,8 +24096,8 @@ "question__title": "Rearrange Spaces Between Words", "question__title_slug": "rearrange-spaces-between-words", "question__hide": false, - "total_acs": 47788, - "total_submitted": 109894, + "total_acs": 48054, + "total_submitted": 110576, "frontend_question_id": 1592, "is_new_question": false }, @@ -23544,8 +24119,8 @@ "question__title": "Dot Product of Two Sparse Vectors", "question__title_slug": "dot-product-of-two-sparse-vectors", "question__hide": false, - "total_acs": 184517, - "total_submitted": 204289, + "total_acs": 184823, + "total_submitted": 204636, "frontend_question_id": 1570, "is_new_question": false }, @@ -23567,8 +24142,8 @@ "question__title": "Unique Orders and Customers Per Month", "question__title_slug": "unique-orders-and-customers-per-month", "question__hide": false, - "total_acs": 18827, - "total_submitted": 22752, + "total_acs": 18898, + "total_submitted": 22841, "frontend_question_id": 1565, "is_new_question": false }, @@ -23590,8 +24165,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": 33980, - "total_submitted": 43677, + "total_acs": 34132, + "total_submitted": 43870, "frontend_question_id": 1605, "is_new_question": false }, @@ -23613,8 +24188,8 @@ "question__title": "Find Servers That Handled Most Number of Requests", "question__title_slug": "find-servers-that-handled-most-number-of-requests", "question__hide": false, - "total_acs": 13232, - "total_submitted": 30718, + "total_acs": 13336, + "total_submitted": 30949, "frontend_question_id": 1606, "is_new_question": false }, @@ -23636,8 +24211,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": 29759, - "total_submitted": 63813, + "total_acs": 29897, + "total_submitted": 64145, "frontend_question_id": 1604, "is_new_question": false }, @@ -23659,8 +24234,8 @@ "question__title": "Design Parking System", "question__title_slug": "design-parking-system", "question__hide": false, - "total_acs": 176962, - "total_submitted": 201361, + "total_acs": 177978, + "total_submitted": 202592, "frontend_question_id": 1603, "is_new_question": false }, @@ -23682,8 +24257,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": 6968, - "total_submitted": 14658, + "total_acs": 7003, + "total_submitted": 14718, "frontend_question_id": 1585, "is_new_question": false }, @@ -23705,8 +24280,8 @@ "question__title": "Min Cost to Connect All Points", "question__title_slug": "min-cost-to-connect-all-points", "question__hide": false, - "total_acs": 158325, - "total_submitted": 247129, + "total_acs": 159617, + "total_submitted": 249176, "frontend_question_id": 1584, "is_new_question": false }, @@ -23728,8 +24303,8 @@ "question__title": "Count Unhappy Friends", "question__title_slug": "count-unhappy-friends", "question__hide": false, - "total_acs": 24272, - "total_submitted": 39759, + "total_acs": 24395, + "total_submitted": 39955, "frontend_question_id": 1583, "is_new_question": false }, @@ -23751,8 +24326,8 @@ "question__title": "Special Positions in a Binary Matrix", "question__title_slug": "special-positions-in-a-binary-matrix", "question__hide": false, - "total_acs": 40878, - "total_submitted": 62607, + "total_acs": 41091, + "total_submitted": 62988, "frontend_question_id": 1582, "is_new_question": false }, @@ -23774,8 +24349,8 @@ "question__title": "Put Boxes Into the Warehouse I", "question__title_slug": "put-boxes-into-the-warehouse-i", "question__hide": false, - "total_acs": 14383, - "total_submitted": 21462, + "total_acs": 14406, + "total_submitted": 21499, "frontend_question_id": 1564, "is_new_question": false }, @@ -23797,8 +24372,8 @@ "question__title": "Bank Account Summary", "question__title_slug": "bank-account-summary", "question__hide": false, - "total_acs": 14156, - "total_submitted": 27234, + "total_acs": 14213, + "total_submitted": 27401, "frontend_question_id": 1555, "is_new_question": false }, @@ -23820,8 +24395,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": 50855, - "total_submitted": 77453, + "total_acs": 51547, + "total_submitted": 78647, "frontend_question_id": 1579, "is_new_question": false }, @@ -23843,8 +24418,8 @@ "question__title": "Minimum Time to Make Rope Colorful", "question__title_slug": "minimum-time-to-make-rope-colorful", "question__hide": false, - "total_acs": 146930, - "total_submitted": 231867, + "total_acs": 147419, + "total_submitted": 232706, "frontend_question_id": 1578, "is_new_question": false }, @@ -23866,8 +24441,8 @@ "question__title": "Number of Ways Where Square of Number Is Equal to Product of Two Numbers", "question__title_slug": "number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers", "question__hide": false, - "total_acs": 18132, - "total_submitted": 45147, + "total_acs": 18231, + "total_submitted": 45326, "frontend_question_id": 1577, "is_new_question": false }, @@ -23889,8 +24464,8 @@ "question__title": "Replace All ?'s to Avoid Consecutive Repeating Characters", "question__title_slug": "replace-all-s-to-avoid-consecutive-repeating-characters", "question__hide": false, - "total_acs": 52544, - "total_submitted": 109342, + "total_acs": 52803, + "total_submitted": 110163, "frontend_question_id": 1576, "is_new_question": false }, @@ -23912,8 +24487,8 @@ "question__title": "Strings Differ by One Character", "question__title_slug": "strings-differ-by-one-character", "question__hide": false, - "total_acs": 22147, - "total_submitted": 52151, + "total_acs": 22213, + "total_submitted": 52369, "frontend_question_id": 1554, "is_new_question": false }, @@ -23935,8 +24510,8 @@ "question__title": "Strange Printer II", "question__title_slug": "strange-printer-ii", "question__hide": false, - "total_acs": 8710, - "total_submitted": 14849, + "total_acs": 8770, + "total_submitted": 14947, "frontend_question_id": 1591, "is_new_question": false }, @@ -23958,8 +24533,8 @@ "question__title": "Maximum Sum Obtained of Any Permutation", "question__title_slug": "maximum-sum-obtained-of-any-permutation", "question__hide": false, - "total_acs": 16046, - "total_submitted": 43014, + "total_acs": 16140, + "total_submitted": 43250, "frontend_question_id": 1589, "is_new_question": false }, @@ -23981,8 +24556,8 @@ "question__title": "Make Sum Divisible by P", "question__title_slug": "make-sum-divisible-by-p", "question__hide": false, - "total_acs": 21841, - "total_submitted": 78240, + "total_acs": 21939, + "total_submitted": 78596, "frontend_question_id": 1590, "is_new_question": false }, @@ -24004,8 +24579,8 @@ "question__title": "Sum of All Odd Length Subarrays", "question__title_slug": "sum-of-all-odd-length-subarrays", "question__hide": false, - "total_acs": 157858, - "total_submitted": 189307, + "total_acs": 159151, + "total_submitted": 190969, "frontend_question_id": 1588, "is_new_question": false }, @@ -24021,14 +24596,14 @@ { "stat": { "question_id": 1692, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "number-of-ways-to-reorder-array-to-get-same-bst", + "question__article__has_video_solution": false, "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": 11927, - "total_submitted": 25016, + "total_acs": 12001, + "total_submitted": 25132, "frontend_question_id": 1569, "is_new_question": false }, @@ -24050,8 +24625,8 @@ "question__title": "Minimum Number of Days to Disconnect Island", "question__title_slug": "minimum-number-of-days-to-disconnect-island", "question__hide": false, - "total_acs": 10891, - "total_submitted": 23505, + "total_acs": 10953, + "total_submitted": 23653, "frontend_question_id": 1568, "is_new_question": false }, @@ -24073,8 +24648,8 @@ "question__title": "Maximum Length of Subarray With Positive Product", "question__title_slug": "maximum-length-of-subarray-with-positive-product", "question__hide": false, - "total_acs": 83764, - "total_submitted": 190015, + "total_acs": 84082, + "total_submitted": 190674, "frontend_question_id": 1567, "is_new_question": false }, @@ -24096,8 +24671,8 @@ "question__title": "Detect Pattern of Length M Repeated K or More Times", "question__title_slug": "detect-pattern-of-length-m-repeated-k-or-more-times", "question__hide": false, - "total_acs": 29619, - "total_submitted": 68360, + "total_acs": 29750, + "total_submitted": 68676, "frontend_question_id": 1566, "is_new_question": false }, @@ -24119,8 +24694,8 @@ "question__title": "The Most Recent Orders for Each Product", "question__title_slug": "the-most-recent-orders-for-each-product", "question__hide": false, - "total_acs": 23080, - "total_submitted": 34421, + "total_acs": 23236, + "total_submitted": 34685, "frontend_question_id": 1549, "is_new_question": false }, @@ -24142,8 +24717,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": 16627, - "total_submitted": 28231, + "total_acs": 16653, + "total_submitted": 28274, "frontend_question_id": 1548, "is_new_question": false }, @@ -24165,8 +24740,8 @@ "question__title": "Fix Product Name Format", "question__title_slug": "fix-product-name-format", "question__hide": false, - "total_acs": 17565, - "total_submitted": 29010, + "total_acs": 17637, + "total_submitted": 29163, "frontend_question_id": 1543, "is_new_question": false }, @@ -24188,8 +24763,8 @@ "question__title": "Stone Game V", "question__title_slug": "stone-game-v", "question__hide": false, - "total_acs": 15810, - "total_submitted": 39195, + "total_acs": 15873, + "total_submitted": 39347, "frontend_question_id": 1563, "is_new_question": false }, @@ -24211,8 +24786,8 @@ "question__title": "Find Latest Group of Size M", "question__title_slug": "find-latest-group-of-size-m", "question__hide": false, - "total_acs": 16375, - "total_submitted": 38205, + "total_acs": 16471, + "total_submitted": 38413, "frontend_question_id": 1562, "is_new_question": false }, @@ -24234,8 +24809,8 @@ "question__title": "Maximum Number of Coins You Can Get", "question__title_slug": "maximum-number-of-coins-you-can-get", "question__hide": false, - "total_acs": 66108, - "total_submitted": 83475, + "total_acs": 66503, + "total_submitted": 83955, "frontend_question_id": 1561, "is_new_question": false }, @@ -24257,8 +24832,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": 26411, - "total_submitted": 45053, + "total_acs": 26530, + "total_submitted": 45234, "frontend_question_id": 1560, "is_new_question": false }, @@ -24280,8 +24855,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": 3206, - "total_submitted": 4519, + "total_acs": 3257, + "total_submitted": 4588, "frontend_question_id": 1538, "is_new_question": false }, @@ -24303,8 +24878,8 @@ "question__title": "Count All Possible Routes", "question__title_slug": "count-all-possible-routes", "question__hide": false, - "total_acs": 12964, - "total_submitted": 22841, + "total_acs": 13064, + "total_submitted": 23002, "frontend_question_id": 1575, "is_new_question": false }, @@ -24326,8 +24901,8 @@ "question__title": "Shortest Subarray to be Removed to Make Array Sorted", "question__title_slug": "shortest-subarray-to-be-removed-to-make-array-sorted", "question__hide": false, - "total_acs": 25660, - "total_submitted": 68803, + "total_acs": 25903, + "total_submitted": 69384, "frontend_question_id": 1574, "is_new_question": false }, @@ -24349,8 +24924,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": 24105, - "total_submitted": 74106, + "total_acs": 24793, + "total_submitted": 76512, "frontend_question_id": 1573, "is_new_question": false }, @@ -24372,8 +24947,8 @@ "question__title": "Matrix Diagonal Sum", "question__title_slug": "matrix-diagonal-sum", "question__hide": false, - "total_acs": 180316, - "total_submitted": 224289, + "total_acs": 262039, + "total_submitted": 316521, "frontend_question_id": 1572, "is_new_question": false }, @@ -24395,8 +24970,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": 29658, - "total_submitted": 85371, + "total_acs": 29826, + "total_submitted": 85823, "frontend_question_id": 1553, "is_new_question": false }, @@ -24418,8 +24993,8 @@ "question__title": "Magnetic Force Between Two Balls", "question__title_slug": "magnetic-force-between-two-balls", "question__hide": false, - "total_acs": 41018, - "total_submitted": 70259, + "total_acs": 41311, + "total_submitted": 70686, "frontend_question_id": 1552, "is_new_question": false }, @@ -24441,8 +25016,8 @@ "question__title": "Minimum Operations to Make Array Equal", "question__title_slug": "minimum-operations-to-make-array-equal", "question__hide": false, - "total_acs": 82595, - "total_submitted": 101189, + "total_acs": 82935, + "total_submitted": 101600, "frontend_question_id": 1551, "is_new_question": false }, @@ -24464,8 +25039,8 @@ "question__title": "Find the Index of the Large Integer", "question__title_slug": "find-the-index-of-the-large-integer", "question__hide": false, - "total_acs": 10301, - "total_submitted": 18370, + "total_acs": 10378, + "total_submitted": 18525, "frontend_question_id": 1533, "is_new_question": false }, @@ -24487,8 +25062,8 @@ "question__title": "The Most Recent Three Orders", "question__title_slug": "the-most-recent-three-orders", "question__hide": false, - "total_acs": 22680, - "total_submitted": 32639, + "total_acs": 22805, + "total_submitted": 32841, "frontend_question_id": 1532, "is_new_question": false }, @@ -24510,8 +25085,8 @@ "question__title": "Patients With a Condition", "question__title_slug": "patients-with-a-condition", "question__hide": false, - "total_acs": 110236, - "total_submitted": 273078, + "total_acs": 112334, + "total_submitted": 278636, "frontend_question_id": 1527, "is_new_question": false }, @@ -24533,8 +25108,8 @@ "question__title": "Minimum Cost to Cut a Stick", "question__title_slug": "minimum-cost-to-cut-a-stick", "question__hide": false, - "total_acs": 48060, - "total_submitted": 84451, + "total_acs": 48623, + "total_submitted": 85468, "frontend_question_id": 1547, "is_new_question": false }, @@ -24556,8 +25131,8 @@ "question__title": "Find Longest Awesome Substring", "question__title_slug": "find-longest-awesome-substring", "question__hide": false, - "total_acs": 11386, - "total_submitted": 27376, + "total_acs": 11437, + "total_submitted": 27475, "frontend_question_id": 1542, "is_new_question": false }, @@ -24579,8 +25154,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": 33498, - "total_submitted": 57148, + "total_acs": 33650, + "total_submitted": 57426, "frontend_question_id": 1545, "is_new_question": false }, @@ -24602,8 +25177,8 @@ "question__title": "Make The String Great", "question__title_slug": "make-the-string-great", "question__hide": false, - "total_acs": 138448, - "total_submitted": 218947, + "total_acs": 139200, + "total_submitted": 220162, "frontend_question_id": 1544, "is_new_question": false }, @@ -24625,8 +25200,8 @@ "question__title": "Diameter of N-Ary Tree", "question__title_slug": "diameter-of-n-ary-tree", "question__hide": false, - "total_acs": 38217, - "total_submitted": 51949, + "total_acs": 38327, + "total_submitted": 52085, "frontend_question_id": 1522, "is_new_question": false }, @@ -24648,8 +25223,8 @@ "question__title": "Find Users With Valid E-Mails", "question__title_slug": "find-users-with-valid-e-mails", "question__hide": false, - "total_acs": 24459, - "total_submitted": 46927, + "total_acs": 25196, + "total_submitted": 49065, "frontend_question_id": 1517, "is_new_question": false }, @@ -24671,8 +25246,8 @@ "question__title": "Detect Cycles in 2D Grid", "question__title_slug": "detect-cycles-in-2d-grid", "question__hide": false, - "total_acs": 32896, - "total_submitted": 68377, + "total_acs": 33088, + "total_submitted": 68751, "frontend_question_id": 1559, "is_new_question": false }, @@ -24694,8 +25269,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": 18395, - "total_submitted": 28777, + "total_acs": 18468, + "total_submitted": 28887, "frontend_question_id": 1558, "is_new_question": false }, @@ -24717,8 +25292,8 @@ "question__title": "Minimum Number of Vertices to Reach All Nodes", "question__title_slug": "minimum-number-of-vertices-to-reach-all-nodes", "question__hide": false, - "total_acs": 92439, - "total_submitted": 116569, + "total_acs": 93189, + "total_submitted": 117511, "frontend_question_id": 1557, "is_new_question": false }, @@ -24740,8 +25315,8 @@ "question__title": "Thousand Separator", "question__title_slug": "thousand-separator", "question__hide": false, - "total_acs": 42178, - "total_submitted": 77414, + "total_acs": 42440, + "total_submitted": 77973, "frontend_question_id": 1556, "is_new_question": false }, @@ -24763,8 +25338,8 @@ "question__title": "Get the Maximum Score", "question__title_slug": "get-the-maximum-score", "question__hide": false, - "total_acs": 21542, - "total_submitted": 54817, + "total_acs": 21643, + "total_submitted": 55056, "frontend_question_id": 1537, "is_new_question": false }, @@ -24786,8 +25361,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": 13031, - "total_submitted": 28091, + "total_acs": 13092, + "total_submitted": 28193, "frontend_question_id": 1536, "is_new_question": false }, @@ -24809,8 +25384,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": 28724, - "total_submitted": 59275, + "total_acs": 28849, + "total_submitted": 59503, "frontend_question_id": 1535, "is_new_question": false }, @@ -24832,8 +25407,8 @@ "question__title": "Count Good Triplets", "question__title_slug": "count-good-triplets", "question__hide": false, - "total_acs": 97341, - "total_submitted": 120332, + "total_acs": 97857, + "total_submitted": 120954, "frontend_question_id": 1534, "is_new_question": false }, @@ -24855,8 +25430,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": 2018, - "total_submitted": 3180, + "total_acs": 2025, + "total_submitted": 3193, "frontend_question_id": 1516, "is_new_question": false }, @@ -24878,8 +25453,8 @@ "question__title": "Customer Order Frequency", "question__title_slug": "customer-order-frequency", "question__hide": false, - "total_acs": 35346, - "total_submitted": 49644, + "total_acs": 35520, + "total_submitted": 49922, "frontend_question_id": 1511, "is_new_question": false }, @@ -24901,8 +25476,8 @@ "question__title": "Number of Good Leaf Nodes Pairs", "question__title_slug": "number-of-good-leaf-nodes-pairs", "question__hide": false, - "total_acs": 34643, - "total_submitted": 56657, + "total_acs": 34758, + "total_submitted": 56811, "frontend_question_id": 1530, "is_new_question": false }, @@ -24924,8 +25499,8 @@ "question__title": "Minimum Suffix Flips", "question__title_slug": "minimum-suffix-flips", "question__hide": false, - "total_acs": 39754, - "total_submitted": 54734, + "total_acs": 39894, + "total_submitted": 54934, "frontend_question_id": 1529, "is_new_question": false }, @@ -24947,8 +25522,8 @@ "question__title": "Shuffle String", "question__title_slug": "shuffle-string", "question__hide": false, - "total_acs": 293936, - "total_submitted": 345508, + "total_acs": 296032, + "total_submitted": 348140, "frontend_question_id": 1528, "is_new_question": false }, @@ -24970,8 +25545,8 @@ "question__title": "Find Root of N-Ary Tree", "question__title_slug": "find-root-of-n-ary-tree", "question__hide": false, - "total_acs": 29590, - "total_submitted": 37665, + "total_acs": 29736, + "total_submitted": 37850, "frontend_question_id": 1506, "is_new_question": false }, @@ -24993,8 +25568,8 @@ "question__title": "Maximum Number of Non-Overlapping Subarrays With Sum Equals Target", "question__title_slug": "maximum-number-of-non-overlapping-subarrays-with-sum-equals-target", "question__hide": false, - "total_acs": 24690, - "total_submitted": 52130, + "total_acs": 24780, + "total_submitted": 52333, "frontend_question_id": 1546, "is_new_question": false }, @@ -25016,8 +25591,8 @@ "question__title": "Minimum Insertions to Balance a Parentheses String", "question__title_slug": "minimum-insertions-to-balance-a-parentheses-string", "question__hide": false, - "total_acs": 38707, - "total_submitted": 77823, + "total_acs": 38837, + "total_submitted": 78088, "frontend_question_id": 1541, "is_new_question": false }, @@ -25039,8 +25614,8 @@ "question__title": "Can Convert String in K Moves", "question__title_slug": "can-convert-string-in-k-moves", "question__hide": false, - "total_acs": 16200, - "total_submitted": 48360, + "total_acs": 16264, + "total_submitted": 48686, "frontend_question_id": 1540, "is_new_question": false }, @@ -25062,8 +25637,8 @@ "question__title": "Kth Missing Positive Number", "question__title_slug": "kth-missing-positive-number", "question__hide": false, - "total_acs": 303618, - "total_submitted": 518084, + "total_acs": 304884, + "total_submitted": 520283, "frontend_question_id": 1539, "is_new_question": false }, @@ -25085,8 +25660,8 @@ "question__title": "Find a Value of a Mysterious Function Closest to Target", "question__title_slug": "find-a-value-of-a-mysterious-function-closest-to-target", "question__hide": false, - "total_acs": 8735, - "total_submitted": 20143, + "total_acs": 8775, + "total_submitted": 20209, "frontend_question_id": 1521, "is_new_question": false }, @@ -25108,8 +25683,8 @@ "question__title": "Maximum Number of Non-Overlapping Substrings", "question__title_slug": "maximum-number-of-non-overlapping-substrings", "question__hide": false, - "total_acs": 13184, - "total_submitted": 34454, + "total_acs": 13217, + "total_submitted": 34823, "frontend_question_id": 1520, "is_new_question": false }, @@ -25131,8 +25706,8 @@ "question__title": "Number of Nodes in the Sub-Tree With the Same Label", "question__title_slug": "number-of-nodes-in-the-sub-tree-with-the-same-label", "question__hide": false, - "total_acs": 78728, - "total_submitted": 142423, + "total_acs": 78959, + "total_submitted": 142794, "frontend_question_id": 1519, "is_new_question": false }, @@ -25154,8 +25729,8 @@ "question__title": "Water Bottles", "question__title_slug": "water-bottles", "question__hide": false, - "total_acs": 62488, - "total_submitted": 103303, + "total_acs": 62787, + "total_submitted": 103886, "frontend_question_id": 1518, "is_new_question": false }, @@ -25177,8 +25752,8 @@ "question__title": "Countries You Can Safely Invest In", "question__title_slug": "countries-you-can-safely-invest-in", "question__hide": false, - "total_acs": 32177, - "total_submitted": 62045, + "total_acs": 32353, + "total_submitted": 62856, "frontend_question_id": 1501, "is_new_question": false }, @@ -25200,8 +25775,8 @@ "question__title": "Design a File Sharing System", "question__title_slug": "design-a-file-sharing-system", "question__hide": false, - "total_acs": 3546, - "total_submitted": 7991, + "total_acs": 3562, + "total_submitted": 8028, "frontend_question_id": 1500, "is_new_question": false }, @@ -25223,8 +25798,8 @@ "question__title": "Friendly Movies Streamed Last Month", "question__title_slug": "friendly-movies-streamed-last-month", "question__hide": false, - "total_acs": 25067, - "total_submitted": 51007, + "total_acs": 25232, + "total_submitted": 51331, "frontend_question_id": 1495, "is_new_question": false }, @@ -25246,8 +25821,8 @@ "question__title": "Best Position for a Service Centre", "question__title_slug": "best-position-for-a-service-centre", "question__hide": false, - "total_acs": 12163, - "total_submitted": 32664, + "total_acs": 12204, + "total_submitted": 32775, "frontend_question_id": 1515, "is_new_question": false }, @@ -25269,8 +25844,8 @@ "question__title": "String Compression II", "question__title_slug": "string-compression-ii", "question__hide": false, - "total_acs": 43561, - "total_submitted": 88185, + "total_acs": 43614, + "total_submitted": 88343, "frontend_question_id": 1531, "is_new_question": false }, @@ -25292,8 +25867,8 @@ "question__title": "Number of Substrings With Only 1s", "question__title_slug": "number-of-substrings-with-only-1s", "question__hide": false, - "total_acs": 37073, - "total_submitted": 81607, + "total_acs": 37254, + "total_submitted": 82124, "frontend_question_id": 1513, "is_new_question": false }, @@ -25315,8 +25890,8 @@ "question__title": "Number of Good Pairs", "question__title_slug": "number-of-good-pairs", "question__hide": false, - "total_acs": 437756, - "total_submitted": 496023, + "total_acs": 441970, + "total_submitted": 500863, "frontend_question_id": 1512, "is_new_question": false }, @@ -25338,8 +25913,8 @@ "question__title": "Clone N-ary Tree", "question__title_slug": "clone-n-ary-tree", "question__hide": false, - "total_acs": 25109, - "total_submitted": 30078, + "total_acs": 25174, + "total_submitted": 30167, "frontend_question_id": 1490, "is_new_question": false }, @@ -25361,8 +25936,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": 31910, - "total_submitted": 46315, + "total_acs": 32068, + "total_submitted": 46552, "frontend_question_id": 1526, "is_new_question": false }, @@ -25384,8 +25959,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": 89277, - "total_submitted": 129718, + "total_acs": 89502, + "total_submitted": 130069, "frontend_question_id": 1525, "is_new_question": false }, @@ -25407,8 +25982,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": 32326, - "total_submitted": 74760, + "total_acs": 32480, + "total_submitted": 75102, "frontend_question_id": 1524, "is_new_question": false }, @@ -25430,8 +26005,8 @@ "question__title": "Count Odd Numbers in an Interval Range", "question__title_slug": "count-odd-numbers-in-an-interval-range", "question__hide": false, - "total_acs": 296524, - "total_submitted": 600378, + "total_acs": 299005, + "total_submitted": 605655, "frontend_question_id": 1523, "is_new_question": false }, @@ -25453,8 +26028,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": 8749, - "total_submitted": 22775, + "total_acs": 8794, + "total_submitted": 22910, "frontend_question_id": 1505, "is_new_question": false }, @@ -25476,8 +26051,8 @@ "question__title": "Count Submatrices With All Ones", "question__title_slug": "count-submatrices-with-all-ones", "question__hide": false, - "total_acs": 44276, - "total_submitted": 77077, + "total_acs": 44422, + "total_submitted": 77385, "frontend_question_id": 1504, "is_new_question": false }, @@ -25499,8 +26074,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": 18544, - "total_submitted": 33249, + "total_acs": 18657, + "total_submitted": 33395, "frontend_question_id": 1503, "is_new_question": false }, @@ -25522,8 +26097,8 @@ "question__title": "Can Make Arithmetic Progression From Sequence", "question__title_slug": "can-make-arithmetic-progression-from-sequence", "question__hide": false, - "total_acs": 130988, - "total_submitted": 193616, + "total_acs": 132305, + "total_submitted": 195669, "frontend_question_id": 1502, "is_new_question": false }, @@ -25545,8 +26120,8 @@ "question__title": "Group Sold Products By The Date", "question__title_slug": "group-sold-products-by-the-date", "question__hide": false, - "total_acs": 122452, - "total_submitted": 155531, + "total_acs": 124671, + "total_submitted": 158714, "frontend_question_id": 1484, "is_new_question": false }, @@ -25568,8 +26143,8 @@ "question__title": "Clone Binary Tree With Random Pointer", "question__title_slug": "clone-binary-tree-with-random-pointer", "question__hide": false, - "total_acs": 23670, - "total_submitted": 29356, + "total_acs": 23717, + "total_submitted": 29417, "frontend_question_id": 1485, "is_new_question": false }, @@ -25591,8 +26166,8 @@ "question__title": "Sales by Day of the Week", "question__title_slug": "sales-by-day-of-the-week", "question__hide": false, - "total_acs": 15362, - "total_submitted": 19014, + "total_acs": 15418, + "total_submitted": 19152, "frontend_question_id": 1479, "is_new_question": false }, @@ -25614,8 +26189,8 @@ "question__title": "Max Value of Equation", "question__title_slug": "max-value-of-equation", "question__hide": false, - "total_acs": 37291, - "total_submitted": 81897, + "total_acs": 37583, + "total_submitted": 82568, "frontend_question_id": 1499, "is_new_question": false }, @@ -25637,8 +26212,8 @@ "question__title": "Number of Subsequences That Satisfy the Given Sum Condition", "question__title_slug": "number-of-subsequences-that-satisfy-the-given-sum-condition", "question__hide": false, - "total_acs": 42288, - "total_submitted": 112653, + "total_acs": 94342, + "total_submitted": 209842, "frontend_question_id": 1498, "is_new_question": false }, @@ -25660,8 +26235,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": 40894, - "total_submitted": 104881, + "total_acs": 41082, + "total_submitted": 105473, "frontend_question_id": 1497, "is_new_question": false }, @@ -25683,8 +26258,8 @@ "question__title": "Path Crossing", "question__title_slug": "path-crossing", "question__hide": false, - "total_acs": 45851, - "total_submitted": 81814, + "total_acs": 46221, + "total_submitted": 82481, "frontend_question_id": 1496, "is_new_question": false }, @@ -25706,8 +26281,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": 25495, - "total_submitted": 34763, + "total_acs": 25659, + "total_submitted": 35026, "frontend_question_id": 1474, "is_new_question": false }, @@ -25729,8 +26304,8 @@ "question__title": "Stone Game IV", "question__title_slug": "stone-game-iv", "question__hide": false, - "total_acs": 65011, - "total_submitted": 108170, + "total_acs": 65141, + "total_submitted": 108357, "frontend_question_id": 1510, "is_new_question": false }, @@ -25752,8 +26327,8 @@ "question__title": "Minimum Difference Between Largest and Smallest Value in Three Moves", "question__title_slug": "minimum-difference-between-largest-and-smallest-value-in-three-moves", "question__hide": false, - "total_acs": 75167, - "total_submitted": 137591, + "total_acs": 75338, + "total_submitted": 137887, "frontend_question_id": 1509, "is_new_question": false }, @@ -25775,8 +26350,8 @@ "question__title": "Range Sum of Sorted Subarray Sums", "question__title_slug": "range-sum-of-sorted-subarray-sums", "question__hide": false, - "total_acs": 32968, - "total_submitted": 55892, + "total_acs": 33134, + "total_submitted": 56178, "frontend_question_id": 1508, "is_new_question": false }, @@ -25798,8 +26373,8 @@ "question__title": "Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree", "question__title_slug": "find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree", "question__hide": false, - "total_acs": 11104, - "total_submitted": 21177, + "total_acs": 11204, + "total_submitted": 21351, "frontend_question_id": 1489, "is_new_question": false }, @@ -25821,8 +26396,8 @@ "question__title": "Avoid Flood in The City", "question__title_slug": "avoid-flood-in-the-city", "question__hide": false, - "total_acs": 30893, - "total_submitted": 116644, + "total_acs": 31041, + "total_submitted": 117057, "frontend_question_id": 1488, "is_new_question": false }, @@ -25844,8 +26419,8 @@ "question__title": "Making File Names Unique", "question__title_slug": "making-file-names-unique", "question__hide": false, - "total_acs": 30062, - "total_submitted": 82986, + "total_acs": 30145, + "total_submitted": 83138, "frontend_question_id": 1487, "is_new_question": false }, @@ -25867,8 +26442,8 @@ "question__title": "XOR Operation in an Array", "question__title_slug": "xor-operation-in-an-array", "question__hide": false, - "total_acs": 155316, - "total_submitted": 183347, + "total_acs": 156150, + "total_submitted": 184282, "frontend_question_id": 1486, "is_new_question": false }, @@ -25890,8 +26465,8 @@ "question__title": "Find All The Lonely Nodes", "question__title_slug": "find-all-the-lonely-nodes", "question__hide": false, - "total_acs": 43977, - "total_submitted": 53461, + "total_acs": 44127, + "total_submitted": 53617, "frontend_question_id": 1469, "is_new_question": false }, @@ -25913,8 +26488,8 @@ "question__title": "Calculate Salaries", "question__title_slug": "calculate-salaries", "question__hide": false, - "total_acs": 20845, - "total_submitted": 25897, + "total_acs": 20915, + "total_submitted": 26002, "frontend_question_id": 1468, "is_new_question": false }, @@ -25936,8 +26511,8 @@ "question__title": "Rectangles Area", "question__title_slug": "rectangles-area", "question__hide": false, - "total_acs": 14991, - "total_submitted": 21690, + "total_acs": 15062, + "total_submitted": 21815, "frontend_question_id": 1459, "is_new_question": false }, @@ -25959,8 +26534,8 @@ "question__title": "Minimum Number of Days to Make m Bouquets", "question__title_slug": "minimum-number-of-days-to-make-m-bouquets", "question__hide": false, - "total_acs": 60991, - "total_submitted": 113195, + "total_acs": 61519, + "total_submitted": 114320, "frontend_question_id": 1482, "is_new_question": false }, @@ -25982,8 +26557,8 @@ "question__title": "Least Number of Unique Integers after K Removals", "question__title_slug": "least-number-of-unique-integers-after-k-removals", "question__hide": false, - "total_acs": 96266, - "total_submitted": 173319, + "total_acs": 96681, + "total_submitted": 173998, "frontend_question_id": 1481, "is_new_question": false }, @@ -26005,8 +26580,8 @@ "question__title": "Running Sum of 1d Array", "question__title_slug": "running-sum-of-1d-array", "question__hide": false, - "total_acs": 1462324, - "total_submitted": 1675102, + "total_acs": 1479282, + "total_submitted": 1696241, "frontend_question_id": 1480, "is_new_question": false }, @@ -26028,8 +26603,8 @@ "question__title": "Parallel Courses II", "question__title_slug": "parallel-courses-ii", "question__hide": false, - "total_acs": 14211, - "total_submitted": 46832, + "total_acs": 14301, + "total_submitted": 47178, "frontend_question_id": 1494, "is_new_question": false }, @@ -26051,8 +26626,8 @@ "question__title": "Longest Subarray of 1's After Deleting One Element", "question__title_slug": "longest-subarray-of-1s-after-deleting-one-element", "question__hide": false, - "total_acs": 62025, - "total_submitted": 102481, + "total_acs": 63498, + "total_submitted": 104725, "frontend_question_id": 1493, "is_new_question": false }, @@ -26074,8 +26649,8 @@ "question__title": "The kth Factor of n", "question__title_slug": "the-kth-factor-of-n", "question__hide": false, - "total_acs": 117603, - "total_submitted": 185870, + "total_acs": 118809, + "total_submitted": 187437, "frontend_question_id": 1492, "is_new_question": false }, @@ -26097,8 +26672,8 @@ "question__title": "Average Salary Excluding the Minimum and Maximum Salary", "question__title_slug": "average-salary-excluding-the-minimum-and-maximum-salary", "question__hide": false, - "total_acs": 286685, - "total_submitted": 448547, + "total_acs": 295651, + "total_submitted": 463564, "frontend_question_id": 1491, "is_new_question": false }, @@ -26120,8 +26695,8 @@ "question__title": "Paint House III", "question__title_slug": "paint-house-iii", "question__hide": false, - "total_acs": 55803, - "total_submitted": 90693, + "total_acs": 55957, + "total_submitted": 90958, "frontend_question_id": 1473, "is_new_question": false }, @@ -26143,8 +26718,8 @@ "question__title": "Design Browser History", "question__title_slug": "design-browser-history", "question__hide": false, - "total_acs": 176820, - "total_submitted": 226238, + "total_acs": 177881, + "total_submitted": 227656, "frontend_question_id": 1472, "is_new_question": false }, @@ -26166,8 +26741,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": 33705, - "total_submitted": 55743, + "total_acs": 33837, + "total_submitted": 55950, "frontend_question_id": 1471, "is_new_question": false }, @@ -26189,8 +26764,8 @@ "question__title": "Shuffle the Array", "question__title_slug": "shuffle-the-array", "question__hide": false, - "total_acs": 525287, - "total_submitted": 590781, + "total_acs": 529326, + "total_submitted": 595602, "frontend_question_id": 1470, "is_new_question": false }, @@ -26212,8 +26787,8 @@ "question__title": "Active Users", "question__title_slug": "active-users", "question__hide": false, - "total_acs": 32041, - "total_submitted": 85279, + "total_acs": 32160, + "total_submitted": 85674, "frontend_question_id": 1454, "is_new_question": false }, @@ -26235,8 +26810,8 @@ "question__title": "Apples & Oranges", "question__title_slug": "apples-oranges", "question__hide": false, - "total_acs": 43478, - "total_submitted": 48613, + "total_acs": 43764, + "total_submitted": 48960, "frontend_question_id": 1445, "is_new_question": false }, @@ -26258,8 +26833,8 @@ "question__title": "Probability of a Two Boxes Having The Same Number of Distinct Balls", "question__title_slug": "probability-of-a-two-boxes-having-the-same-number-of-distinct-balls", "question__hide": false, - "total_acs": 7165, - "total_submitted": 11851, + "total_acs": 7199, + "total_submitted": 11915, "frontend_question_id": 1467, "is_new_question": false }, @@ -26281,8 +26856,8 @@ "question__title": "Reorder Routes to Make All Paths Lead to the City Zero", "question__title_slug": "reorder-routes-to-make-all-paths-lead-to-the-city-zero", "question__hide": false, - "total_acs": 124196, - "total_submitted": 186377, + "total_acs": 125153, + "total_submitted": 187747, "frontend_question_id": 1466, "is_new_question": false }, @@ -26304,8 +26879,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": 160444, - "total_submitted": 392524, + "total_acs": 160572, + "total_submitted": 392842, "frontend_question_id": 1465, "is_new_question": false }, @@ -26327,8 +26902,8 @@ "question__title": "Maximum Product of Two Elements in an Array", "question__title_slug": "maximum-product-of-two-elements-in-an-array", "question__hide": false, - "total_acs": 188907, - "total_submitted": 235934, + "total_acs": 190533, + "total_submitted": 237886, "frontend_question_id": 1464, "is_new_question": false }, @@ -26350,8 +26925,8 @@ "question__title": "Find Two Non-overlapping Sub-arrays Each With Target Sum", "question__title_slug": "find-two-non-overlapping-sub-arrays-each-with-target-sum", "question__hide": false, - "total_acs": 43594, - "total_submitted": 118714, + "total_acs": 43694, + "total_submitted": 119004, "frontend_question_id": 1477, "is_new_question": false }, @@ -26373,8 +26948,8 @@ "question__title": "Subrectangle Queries", "question__title_slug": "subrectangle-queries", "question__hide": false, - "total_acs": 89399, - "total_submitted": 101212, + "total_acs": 89915, + "total_submitted": 101872, "frontend_question_id": 1476, "is_new_question": false }, @@ -26396,8 +26971,8 @@ "question__title": "Allocate Mailboxes", "question__title_slug": "allocate-mailboxes", "question__hide": false, - "total_acs": 20367, - "total_submitted": 36669, + "total_acs": 20452, + "total_submitted": 36812, "frontend_question_id": 1478, "is_new_question": false }, @@ -26419,8 +26994,8 @@ "question__title": "Final Prices With a Special Discount in a Shop", "question__title_slug": "final-prices-with-a-special-discount-in-a-shop", "question__hide": false, - "total_acs": 107719, - "total_submitted": 141446, + "total_acs": 108465, + "total_submitted": 142399, "frontend_question_id": 1475, "is_new_question": false }, @@ -26442,8 +27017,8 @@ "question__title": "Max Dot Product of Two Subsequences", "question__title_slug": "max-dot-product-of-two-subsequences", "question__hide": false, - "total_acs": 19786, - "total_submitted": 42350, + "total_acs": 19989, + "total_submitted": 42699, "frontend_question_id": 1458, "is_new_question": false }, @@ -26465,8 +27040,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": 113962, - "total_submitted": 168261, + "total_acs": 114592, + "total_submitted": 169301, "frontend_question_id": 1457, "is_new_question": false }, @@ -26488,8 +27063,8 @@ "question__title": "Maximum Number of Vowels in a Substring of Given Length", "question__title_slug": "maximum-number-of-vowels-in-a-substring-of-given-length", "question__hide": false, - "total_acs": 59838, - "total_submitted": 102759, + "total_acs": 135237, + "total_submitted": 228923, "frontend_question_id": 1456, "is_new_question": false }, @@ -26511,8 +27086,8 @@ "question__title": "Check If a Word Occurs As a Prefix of Any Word in a Sentence", "question__title_slug": "check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence", "question__hide": false, - "total_acs": 64365, - "total_submitted": 100211, + "total_acs": 64725, + "total_submitted": 100828, "frontend_question_id": 1455, "is_new_question": false }, @@ -26534,8 +27109,8 @@ "question__title": "Evaluate Boolean Expression", "question__title_slug": "evaluate-boolean-expression", "question__hide": false, - "total_acs": 22178, - "total_submitted": 29717, + "total_acs": 22374, + "total_submitted": 30009, "frontend_question_id": 1440, "is_new_question": false }, @@ -26557,8 +27132,8 @@ "question__title": "Create a Session Bar Chart", "question__title_slug": "create-a-session-bar-chart", "question__hide": false, - "total_acs": 20179, - "total_submitted": 26242, + "total_acs": 20238, + "total_submitted": 26324, "frontend_question_id": 1435, "is_new_question": false }, @@ -26580,8 +27155,8 @@ "question__title": "Maximum Number of Darts Inside of a Circular Dartboard", "question__title_slug": "maximum-number-of-darts-inside-of-a-circular-dartboard", "question__hide": false, - "total_acs": 5203, - "total_submitted": 14155, + "total_acs": 5220, + "total_submitted": 14187, "frontend_question_id": 1453, "is_new_question": false }, @@ -26603,8 +27178,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": 21348, - "total_submitted": 37524, + "total_acs": 21390, + "total_submitted": 37589, "frontend_question_id": 1452, "is_new_question": false }, @@ -26626,8 +27201,8 @@ "question__title": "Rearrange Words in a Sentence", "question__title_slug": "rearrange-words-in-a-sentence", "question__hide": false, - "total_acs": 44609, - "total_submitted": 70653, + "total_acs": 44766, + "total_submitted": 70829, "frontend_question_id": 1451, "is_new_question": false }, @@ -26649,8 +27224,8 @@ "question__title": "Number of Students Doing Homework at a Given Time", "question__title_slug": "number-of-students-doing-homework-at-a-given-time", "question__hide": false, - "total_acs": 102710, - "total_submitted": 135524, + "total_acs": 103230, + "total_submitted": 136188, "frontend_question_id": 1450, "is_new_question": false }, @@ -26672,8 +27247,8 @@ "question__title": "Cherry Pickup II", "question__title_slug": "cherry-pickup-ii", "question__hide": false, - "total_acs": 80427, - "total_submitted": 115744, + "total_acs": 80833, + "total_submitted": 116337, "frontend_question_id": 1463, "is_new_question": false }, @@ -26695,8 +27270,8 @@ "question__title": "Course Schedule IV", "question__title_slug": "course-schedule-iv", "question__hide": false, - "total_acs": 43135, - "total_submitted": 88024, + "total_acs": 43497, + "total_submitted": 88701, "frontend_question_id": 1462, "is_new_question": false }, @@ -26718,8 +27293,8 @@ "question__title": "Check If a String Contains All Binary Codes of Size K", "question__title_slug": "check-if-a-string-contains-all-binary-codes-of-size-k", "question__hide": false, - "total_acs": 109400, - "total_submitted": 193338, + "total_acs": 109619, + "total_submitted": 193953, "frontend_question_id": 1461, "is_new_question": false }, @@ -26741,8 +27316,8 @@ "question__title": "Make Two Arrays Equal by Reversing Subarrays", "question__title_slug": "make-two-arrays-equal-by-reversing-subarrays", "question__hide": false, - "total_acs": 106226, - "total_submitted": 147176, + "total_acs": 106701, + "total_submitted": 147834, "frontend_question_id": 1460, "is_new_question": false }, @@ -26764,8 +27339,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": 60996, - "total_submitted": 95510, + "total_acs": 61256, + "total_submitted": 96068, "frontend_question_id": 1444, "is_new_question": false }, @@ -26787,8 +27362,8 @@ "question__title": "Minimum Time to Collect All Apples in a Tree", "question__title_slug": "minimum-time-to-collect-all-apples-in-a-tree", "question__hide": false, - "total_acs": 99658, - "total_submitted": 158999, + "total_acs": 100002, + "total_submitted": 159689, "frontend_question_id": 1443, "is_new_question": false }, @@ -26810,8 +27385,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": 32126, - "total_submitted": 42204, + "total_acs": 32265, + "total_submitted": 42371, "frontend_question_id": 1442, "is_new_question": false }, @@ -26833,8 +27408,8 @@ "question__title": "Build an Array With Stack Operations", "question__title_slug": "build-an-array-with-stack-operations", "question__hide": false, - "total_acs": 73315, - "total_submitted": 101954, + "total_acs": 73550, + "total_submitted": 102221, "frontend_question_id": 1441, "is_new_question": false }, @@ -26856,8 +27431,8 @@ "question__title": "NPV Queries", "question__title_slug": "npv-queries", "question__hide": false, - "total_acs": 23118, - "total_submitted": 27782, + "total_acs": 23217, + "total_submitted": 27923, "frontend_question_id": 1421, "is_new_question": false }, @@ -26879,8 +27454,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": 28903, - "total_submitted": 47050, + "total_acs": 28995, + "total_submitted": 47182, "frontend_question_id": 1439, "is_new_question": false }, @@ -26902,8 +27477,8 @@ "question__title": "Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit", "question__title_slug": "longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit", "question__hide": false, - "total_acs": 109494, - "total_submitted": 226326, + "total_acs": 109883, + "total_submitted": 227072, "frontend_question_id": 1438, "is_new_question": false }, @@ -26925,8 +27500,8 @@ "question__title": "Check If All 1's Are at Least Length K Places Away", "question__title_slug": "check-if-all-1s-are-at-least-length-k-places-away", "question__hide": false, - "total_acs": 67075, - "total_submitted": 114257, + "total_acs": 67319, + "total_submitted": 114757, "frontend_question_id": 1437, "is_new_question": false }, @@ -26948,8 +27523,8 @@ "question__title": "Destination City", "question__title_slug": "destination-city", "question__hide": false, - "total_acs": 124955, - "total_submitted": 161429, + "total_acs": 125532, + "total_submitted": 162234, "frontend_question_id": 1436, "is_new_question": false }, @@ -26971,8 +27546,8 @@ "question__title": "Find the Quiet Students in All Exams", "question__title_slug": "find-the-quiet-students-in-all-exams", "question__hide": false, - "total_acs": 21122, - "total_submitted": 34164, + "total_acs": 21234, + "total_submitted": 34444, "frontend_question_id": 1412, "is_new_question": false }, @@ -26994,8 +27569,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": 14968, - "total_submitted": 31305, + "total_acs": 15022, + "total_submitted": 31509, "frontend_question_id": 1449, "is_new_question": false }, @@ -27017,8 +27592,8 @@ "question__title": "Count Good Nodes in Binary Tree", "question__title_slug": "count-good-nodes-in-binary-tree", "question__hide": false, - "total_acs": 315899, - "total_submitted": 425489, + "total_acs": 318310, + "total_submitted": 428880, "frontend_question_id": 1448, "is_new_question": false }, @@ -27040,8 +27615,8 @@ "question__title": "Simplified Fractions", "question__title_slug": "simplified-fractions", "question__hide": false, - "total_acs": 26777, - "total_submitted": 41053, + "total_acs": 26960, + "total_submitted": 41329, "frontend_question_id": 1447, "is_new_question": false }, @@ -27063,8 +27638,8 @@ "question__title": "Consecutive Characters", "question__title_slug": "consecutive-characters", "question__hide": false, - "total_acs": 139911, - "total_submitted": 229192, + "total_acs": 140501, + "total_submitted": 230281, "frontend_question_id": 1446, "is_new_question": false }, @@ -27086,8 +27661,8 @@ "question__title": "Top Travellers", "question__title_slug": "top-travellers", "question__hide": false, - "total_acs": 84412, - "total_submitted": 138750, + "total_acs": 85674, + "total_submitted": 141470, "frontend_question_id": 1407, "is_new_question": false }, @@ -27109,8 +27684,8 @@ "question__title": "Diagonal Traverse II", "question__title_slug": "diagonal-traverse-ii", "question__hide": false, - "total_acs": 47852, - "total_submitted": 94812, + "total_acs": 47971, + "total_submitted": 95042, "frontend_question_id": 1424, "is_new_question": false }, @@ -27132,8 +27707,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": 219886, - "total_submitted": 420915, + "total_acs": 220637, + "total_submitted": 422169, "frontend_question_id": 1423, "is_new_question": false }, @@ -27155,8 +27730,8 @@ "question__title": "Maximum Score After Splitting a String", "question__title_slug": "maximum-score-after-splitting-a-string", "question__hide": false, - "total_acs": 46367, - "total_submitted": 79923, + "total_acs": 46559, + "total_submitted": 80226, "frontend_question_id": 1422, "is_new_question": false }, @@ -27178,8 +27753,8 @@ "question__title": "Customers Who Bought Products A and B but Not C", "question__title_slug": "customers-who-bought-products-a-and-b-but-not-c", "question__hide": false, - "total_acs": 41159, - "total_submitted": 54548, + "total_acs": 41464, + "total_submitted": 55121, "frontend_question_id": 1398, "is_new_question": false }, @@ -27201,8 +27776,8 @@ "question__title": "Build Array Where You Can Find The Maximum Exactly K Comparisons", "question__title_slug": "build-array-where-you-can-find-the-maximum-exactly-k-comparisons", "question__hide": false, - "total_acs": 11449, - "total_submitted": 18182, + "total_acs": 11512, + "total_submitted": 18315, "frontend_question_id": 1420, "is_new_question": false }, @@ -27224,8 +27799,8 @@ "question__title": "Minimum Number of Frogs Croaking", "question__title_slug": "minimum-number-of-frogs-croaking", "question__hide": false, - "total_acs": 36922, - "total_submitted": 73620, + "total_acs": 37389, + "total_submitted": 74431, "frontend_question_id": 1419, "is_new_question": false }, @@ -27247,8 +27822,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": 23447, - "total_submitted": 31697, + "total_acs": 23547, + "total_submitted": 31820, "frontend_question_id": 1418, "is_new_question": false }, @@ -27270,8 +27845,8 @@ "question__title": "Reformat The String", "question__title_slug": "reformat-the-string", "question__hide": false, - "total_acs": 50405, - "total_submitted": 92398, + "total_acs": 50578, + "total_submitted": 92827, "frontend_question_id": 1417, "is_new_question": false }, @@ -27293,8 +27868,8 @@ "question__title": "Number of Ways to Wear Different Hats to Each Other", "question__title_slug": "number-of-ways-to-wear-different-hats-to-each-other", "question__hide": false, - "total_acs": 11894, - "total_submitted": 27456, + "total_acs": 11959, + "total_submitted": 27579, "frontend_question_id": 1434, "is_new_question": false }, @@ -27316,8 +27891,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": 36134, - "total_submitted": 52389, + "total_acs": 36260, + "total_submitted": 52571, "frontend_question_id": 1433, "is_new_question": false }, @@ -27339,8 +27914,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": 15252, - "total_submitted": 36785, + "total_acs": 15292, + "total_submitted": 36909, "frontend_question_id": 1432, "is_new_question": false }, @@ -27362,8 +27937,8 @@ "question__title": "Kids With the Greatest Number of Candies", "question__title_slug": "kids-with-the-greatest-number-of-candies", "question__hide": false, - "total_acs": 473380, - "total_submitted": 537894, + "total_acs": 479376, + "total_submitted": 544787, "frontend_question_id": 1431, "is_new_question": false }, @@ -27385,8 +27960,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": 29064, - "total_submitted": 46418, + "total_acs": 29154, + "total_submitted": 46537, "frontend_question_id": 1411, "is_new_question": false }, @@ -27408,8 +27983,8 @@ "question__title": "HTML Entity Parser", "question__title_slug": "html-entity-parser", "question__hide": false, - "total_acs": 21476, - "total_submitted": 41754, + "total_acs": 21531, + "total_submitted": 41869, "frontend_question_id": 1410, "is_new_question": false }, @@ -27431,8 +28006,8 @@ "question__title": "Queries on a Permutation With Key", "question__title_slug": "queries-on-a-permutation-with-key", "question__hide": false, - "total_acs": 43485, - "total_submitted": 52095, + "total_acs": 43659, + "total_submitted": 52284, "frontend_question_id": 1409, "is_new_question": false }, @@ -27454,8 +28029,8 @@ "question__title": "String Matching in an Array", "question__title_slug": "string-matching-in-an-array", "question__hide": false, - "total_acs": 70212, - "total_submitted": 110158, + "total_acs": 70601, + "total_submitted": 110808, "frontend_question_id": 1408, "is_new_question": false }, @@ -27477,8 +28052,8 @@ "question__title": "Capital Gain/Loss", "question__title_slug": "capital-gainloss", "question__hide": false, - "total_acs": 82924, - "total_submitted": 95326, + "total_acs": 83982, + "total_submitted": 96709, "frontend_question_id": 1393, "is_new_question": false }, @@ -27500,8 +28075,8 @@ "question__title": "Stone Game III", "question__title_slug": "stone-game-iii", "question__hide": false, - "total_acs": 43009, - "total_submitted": 72435, + "total_acs": 43153, + "total_submitted": 72662, "frontend_question_id": 1406, "is_new_question": false }, @@ -27523,8 +28098,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": 34270, - "total_submitted": 65194, + "total_acs": 34422, + "total_submitted": 65434, "frontend_question_id": 1404, "is_new_question": false }, @@ -27546,8 +28121,8 @@ "question__title": "Minimum Subsequence in Non-Increasing Order", "question__title_slug": "minimum-subsequence-in-non-increasing-order", "question__hide": false, - "total_acs": 61644, - "total_submitted": 85248, + "total_acs": 61926, + "total_submitted": 85631, "frontend_question_id": 1403, "is_new_question": false }, @@ -27569,8 +28144,8 @@ "question__title": "Total Sales Amount by Year", "question__title_slug": "total-sales-amount-by-year", "question__hide": false, - "total_acs": 14470, - "total_submitted": 22442, + "total_acs": 14519, + "total_submitted": 22565, "frontend_question_id": 1384, "is_new_question": false }, @@ -27592,8 +28167,8 @@ "question__title": "Restore The Array", "question__title_slug": "restore-the-array", "question__hide": false, - "total_acs": 53208, - "total_submitted": 108729, + "total_acs": 53461, + "total_submitted": 109364, "frontend_question_id": 1416, "is_new_question": false }, @@ -27615,8 +28190,8 @@ "question__title": "The k-th Lexicographical String of All Happy Strings of Length n", "question__title_slug": "the-k-th-lexicographical-string-of-all-happy-strings-of-length-n", "question__hide": false, - "total_acs": 31658, - "total_submitted": 43632, + "total_acs": 31812, + "total_submitted": 43817, "frontend_question_id": 1415, "is_new_question": false }, @@ -27638,8 +28213,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": 37070, - "total_submitted": 56625, + "total_acs": 37218, + "total_submitted": 56893, "frontend_question_id": 1414, "is_new_question": false }, @@ -27661,8 +28236,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": 99130, - "total_submitted": 147476, + "total_acs": 100121, + "total_submitted": 149000, "frontend_question_id": 1413, "is_new_question": false }, @@ -27684,8 +28259,8 @@ "question__title": "Find All Good Strings", "question__title_slug": "find-all-good-strings", "question__hide": false, - "total_acs": 5257, - "total_submitted": 12479, + "total_acs": 5281, + "total_submitted": 12527, "frontend_question_id": 1397, "is_new_question": false }, @@ -27707,8 +28282,8 @@ "question__title": "Design Underground System", "question__title_slug": "design-underground-system", "question__hide": false, - "total_acs": 164701, - "total_submitted": 223963, + "total_acs": 164986, + "total_submitted": 224320, "frontend_question_id": 1396, "is_new_question": false }, @@ -27730,8 +28305,8 @@ "question__title": "Count Number of Teams", "question__title_slug": "count-number-of-teams", "question__hide": false, - "total_acs": 100784, - "total_submitted": 150393, + "total_acs": 101024, + "total_submitted": 150835, "frontend_question_id": 1395, "is_new_question": false }, @@ -27753,8 +28328,8 @@ "question__title": "Find Lucky Integer in an Array", "question__title_slug": "find-lucky-integer-in-an-array", "question__hide": false, - "total_acs": 93773, - "total_submitted": 144916, + "total_acs": 94728, + "total_submitted": 146330, "frontend_question_id": 1394, "is_new_question": false }, @@ -27776,8 +28351,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": 41958, - "total_submitted": 46364, + "total_acs": 46017, + "total_submitted": 51293, "frontend_question_id": 1378, "is_new_question": false }, @@ -27799,8 +28374,8 @@ "question__title": "Longest Happy Prefix", "question__title_slug": "longest-happy-prefix", "question__hide": false, - "total_acs": 29710, - "total_submitted": 66422, + "total_acs": 29933, + "total_submitted": 66849, "frontend_question_id": 1392, "is_new_question": false }, @@ -27822,8 +28397,8 @@ "question__title": "Check if There is a Valid Path in a Grid", "question__title_slug": "check-if-there-is-a-valid-path-in-a-grid", "question__hide": false, - "total_acs": 24605, - "total_submitted": 51972, + "total_acs": 24720, + "total_submitted": 52195, "frontend_question_id": 1391, "is_new_question": false }, @@ -27845,8 +28420,8 @@ "question__title": "Create Target Array in the Given Order", "question__title_slug": "create-target-array-in-the-given-order", "question__hide": false, - "total_acs": 193383, - "total_submitted": 225257, + "total_acs": 194761, + "total_submitted": 226877, "frontend_question_id": 1389, "is_new_question": false }, @@ -27868,8 +28443,8 @@ "question__title": "Get the Second Most Recent Activity", "question__title_slug": "get-the-second-most-recent-activity", "question__hide": false, - "total_acs": 18681, - "total_submitted": 27104, + "total_acs": 18768, + "total_submitted": 27233, "frontend_question_id": 1369, "is_new_question": false }, @@ -27891,8 +28466,8 @@ "question__title": "Reducing Dishes", "question__title_slug": "reducing-dishes", "question__hide": false, - "total_acs": 111126, - "total_submitted": 144471, + "total_acs": 111820, + "total_submitted": 145583, "frontend_question_id": 1402, "is_new_question": false }, @@ -27914,8 +28489,8 @@ "question__title": "Construct K Palindrome Strings", "question__title_slug": "construct-k-palindrome-strings", "question__hide": false, - "total_acs": 45249, - "total_submitted": 72043, + "total_acs": 45408, + "total_submitted": 72351, "frontend_question_id": 1400, "is_new_question": false }, @@ -27937,8 +28512,8 @@ "question__title": "Circle and Rectangle Overlapping", "question__title_slug": "circle-and-rectangle-overlapping", "question__hide": false, - "total_acs": 11765, - "total_submitted": 26746, + "total_acs": 11814, + "total_submitted": 26831, "frontend_question_id": 1401, "is_new_question": false }, @@ -27960,8 +28535,8 @@ "question__title": "Count Largest Group", "question__title_slug": "count-largest-group", "question__hide": false, - "total_acs": 38054, - "total_submitted": 56866, + "total_acs": 38205, + "total_submitted": 57129, "frontend_question_id": 1399, "is_new_question": false }, @@ -27983,8 +28558,8 @@ "question__title": "Maximum Performance of a Team", "question__title_slug": "maximum-performance-of-a-team", "question__hide": false, - "total_acs": 86416, - "total_submitted": 178385, + "total_acs": 86549, + "total_submitted": 178669, "frontend_question_id": 1383, "is_new_question": false }, @@ -28006,8 +28581,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": 191559, - "total_submitted": 221323, + "total_acs": 192464, + "total_submitted": 222486, "frontend_question_id": 1379, "is_new_question": false }, @@ -28029,8 +28604,8 @@ "question__title": "Design a Stack With Increment Operation", "question__title_slug": "design-a-stack-with-increment-operation", "question__hide": false, - "total_acs": 92015, - "total_submitted": 119318, + "total_acs": 92516, + "total_submitted": 119999, "frontend_question_id": 1381, "is_new_question": false }, @@ -28052,8 +28627,8 @@ "question__title": "Lucky Numbers in a Matrix", "question__title_slug": "lucky-numbers-in-a-matrix", "question__hide": false, - "total_acs": 83646, - "total_submitted": 118461, + "total_acs": 84194, + "total_submitted": 119141, "frontend_question_id": 1380, "is_new_question": false }, @@ -28075,8 +28650,8 @@ "question__title": "Number of Trusted Contacts of a Customer", "question__title_slug": "number-of-trusted-contacts-of-a-customer", "question__hide": false, - "total_acs": 17020, - "total_submitted": 22010, + "total_acs": 17099, + "total_submitted": 22128, "frontend_question_id": 1364, "is_new_question": false }, @@ -28098,8 +28673,8 @@ "question__title": "Activity Participants", "question__title_slug": "activity-participants", "question__hide": false, - "total_acs": 25465, - "total_submitted": 34603, + "total_acs": 25532, + "total_submitted": 34707, "frontend_question_id": 1355, "is_new_question": false }, @@ -28121,8 +28696,8 @@ "question__title": "Frog Position After T Seconds", "question__title_slug": "frog-position-after-t-seconds", "question__hide": false, - "total_acs": 24750, - "total_submitted": 69409, + "total_acs": 24850, + "total_submitted": 69727, "frontend_question_id": 1377, "is_new_question": false }, @@ -28144,8 +28719,8 @@ "question__title": "Time Needed to Inform All Employees", "question__title_slug": "time-needed-to-inform-all-employees", "question__hide": false, - "total_acs": 130903, - "total_submitted": 224442, + "total_acs": 131522, + "total_submitted": 225435, "frontend_question_id": 1376, "is_new_question": false }, @@ -28167,8 +28742,8 @@ "question__title": "Number of Times Binary String Is Prefix-Aligned", "question__title_slug": "number-of-times-binary-string-is-prefix-aligned", "question__hide": false, - "total_acs": 46519, - "total_submitted": 70666, + "total_acs": 46632, + "total_submitted": 70846, "frontend_question_id": 1375, "is_new_question": false }, @@ -28190,8 +28765,8 @@ "question__title": "Generate a String With Characters That Have Odd Counts", "question__title_slug": "generate-a-string-with-characters-that-have-odd-counts", "question__hide": false, - "total_acs": 79499, - "total_submitted": 102468, + "total_acs": 79835, + "total_submitted": 102894, "frontend_question_id": 1374, "is_new_question": false }, @@ -28213,8 +28788,8 @@ "question__title": "Pizza With 3n Slices", "question__title_slug": "pizza-with-3n-slices", "question__hide": false, - "total_acs": 14762, - "total_submitted": 29346, + "total_acs": 14960, + "total_submitted": 29694, "frontend_question_id": 1388, "is_new_question": false }, @@ -28236,8 +28811,8 @@ "question__title": "Sort Integers by The Power Value", "question__title_slug": "sort-integers-by-the-power-value", "question__hide": false, - "total_acs": 77648, - "total_submitted": 110744, + "total_acs": 78029, + "total_submitted": 111290, "frontend_question_id": 1387, "is_new_question": false }, @@ -28259,8 +28834,8 @@ "question__title": "Cinema Seat Allocation", "question__title_slug": "cinema-seat-allocation", "question__hide": false, - "total_acs": 38447, - "total_submitted": 93882, + "total_acs": 38650, + "total_submitted": 94323, "frontend_question_id": 1386, "is_new_question": false }, @@ -28282,8 +28857,8 @@ "question__title": "Find the Distance Value Between Two Arrays", "question__title_slug": "find-the-distance-value-between-two-arrays", "question__hide": false, - "total_acs": 82437, - "total_submitted": 123550, + "total_acs": 83045, + "total_submitted": 124360, "frontend_question_id": 1385, "is_new_question": false }, @@ -28305,8 +28880,8 @@ "question__title": "Minimum Cost to Make at Least One Valid Path in a Grid", "question__title_slug": "minimum-cost-to-make-at-least-one-valid-path-in-a-grid", "question__hide": false, - "total_acs": 40044, - "total_submitted": 64984, + "total_acs": 40245, + "total_submitted": 65292, "frontend_question_id": 1368, "is_new_question": false }, @@ -28328,8 +28903,8 @@ "question__title": "Linked List in Binary Tree", "question__title_slug": "linked-list-in-binary-tree", "question__hide": false, - "total_acs": 65568, - "total_submitted": 149845, + "total_acs": 65894, + "total_submitted": 150633, "frontend_question_id": 1367, "is_new_question": false }, @@ -28351,8 +28926,8 @@ "question__title": "Rank Teams by Votes", "question__title_slug": "rank-teams-by-votes", "question__hide": false, - "total_acs": 53229, - "total_submitted": 92078, + "total_acs": 53772, + "total_submitted": 92976, "frontend_question_id": 1366, "is_new_question": false }, @@ -28374,8 +28949,8 @@ "question__title": "How Many Numbers Are Smaller Than the Current Number", "question__title_slug": "how-many-numbers-are-smaller-than-the-current-number", "question__hide": false, - "total_acs": 428245, - "total_submitted": 494390, + "total_acs": 431300, + "total_submitted": 497955, "frontend_question_id": 1365, "is_new_question": false }, @@ -28397,8 +28972,8 @@ "question__title": "Students With Invalid Departments", "question__title_slug": "students-with-invalid-departments", "question__hide": false, - "total_acs": 47942, - "total_submitted": 53138, + "total_acs": 48129, + "total_submitted": 53360, "frontend_question_id": 1350, "is_new_question": false }, @@ -28420,8 +28995,8 @@ "question__title": "Movie Rating", "question__title_slug": "movie-rating", "question__hide": false, - "total_acs": 27722, - "total_submitted": 49922, + "total_acs": 28358, + "total_submitted": 51482, "frontend_question_id": 1341, "is_new_question": false }, @@ -28443,8 +29018,8 @@ "question__title": "Construct Target Array With Multiple Sums", "question__title_slug": "construct-target-array-with-multiple-sums", "question__hide": false, - "total_acs": 64104, - "total_submitted": 176772, + "total_acs": 64139, + "total_submitted": 176865, "frontend_question_id": 1354, "is_new_question": false }, @@ -28466,8 +29041,8 @@ "question__title": "Maximum Number of Events That Can Be Attended", "question__title_slug": "maximum-number-of-events-that-can-be-attended", "question__hide": false, - "total_acs": 69139, - "total_submitted": 212825, + "total_acs": 69369, + "total_submitted": 213604, "frontend_question_id": 1353, "is_new_question": false }, @@ -28489,8 +29064,8 @@ "question__title": "Product of the Last K Numbers", "question__title_slug": "product-of-the-last-k-numbers", "question__hide": false, - "total_acs": 69591, - "total_submitted": 138979, + "total_acs": 69928, + "total_submitted": 139628, "frontend_question_id": 1352, "is_new_question": false }, @@ -28512,8 +29087,8 @@ "question__title": "Count Negative Numbers in a Sorted Matrix", "question__title_slug": "count-negative-numbers-in-a-sorted-matrix", "question__hide": false, - "total_acs": 243195, - "total_submitted": 322006, + "total_acs": 245078, + "total_submitted": 324386, "frontend_question_id": 1351, "is_new_question": false }, @@ -28535,8 +29110,8 @@ "question__title": "Maximum Sum BST in Binary Tree", "question__title_slug": "maximum-sum-bst-in-binary-tree", "question__hide": false, - "total_acs": 50673, - "total_submitted": 128194, + "total_acs": 51019, + "total_submitted": 128922, "frontend_question_id": 1373, "is_new_question": false }, @@ -28558,8 +29133,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": 100496, - "total_submitted": 149156, + "total_acs": 101185, + "total_submitted": 150191, "frontend_question_id": 1372, "is_new_question": false }, @@ -28581,8 +29156,8 @@ "question__title": "Find the Longest Substring Containing Vowels in Even Counts", "question__title_slug": "find-the-longest-substring-containing-vowels-in-even-counts", "question__hide": false, - "total_acs": 22588, - "total_submitted": 35790, + "total_acs": 22672, + "total_submitted": 35910, "frontend_question_id": 1371, "is_new_question": false }, @@ -28604,8 +29179,8 @@ "question__title": "Increasing Decreasing String", "question__title_slug": "increasing-decreasing-string", "question__hide": false, - "total_acs": 65474, - "total_submitted": 85189, + "total_acs": 65698, + "total_submitted": 85507, "frontend_question_id": 1370, "is_new_question": false }, @@ -28627,8 +29202,8 @@ "question__title": "Maximum Students Taking Exam", "question__title_slug": "maximum-students-taking-exam", "question__hide": false, - "total_acs": 13214, - "total_submitted": 26815, + "total_acs": 13345, + "total_submitted": 27035, "frontend_question_id": 1349, "is_new_question": false }, @@ -28650,8 +29225,8 @@ "question__title": "Tweet Counts Per Frequency", "question__title_slug": "tweet-counts-per-frequency", "question__hide": false, - "total_acs": 30128, - "total_submitted": 68716, + "total_acs": 30172, + "total_submitted": 68806, "frontend_question_id": 1348, "is_new_question": false }, @@ -28673,8 +29248,8 @@ "question__title": "Minimum Number of Steps to Make Two Strings Anagram", "question__title_slug": "minimum-number-of-steps-to-make-two-strings-anagram", "question__hide": false, - "total_acs": 128260, - "total_submitted": 164763, + "total_acs": 128865, + "total_submitted": 165532, "frontend_question_id": 1347, "is_new_question": false }, @@ -28696,8 +29271,8 @@ "question__title": "Check If N and Its Double Exist", "question__title_slug": "check-if-n-and-its-double-exist", "question__hide": false, - "total_acs": 281547, - "total_submitted": 769468, + "total_acs": 283394, + "total_submitted": 774084, "frontend_question_id": 1346, "is_new_question": false }, @@ -28719,8 +29294,8 @@ "question__title": "Number of Transactions per Visit", "question__title_slug": "number-of-transactions-per-visit", "question__hide": false, - "total_acs": 10894, - "total_submitted": 22040, + "total_acs": 10940, + "total_submitted": 22135, "frontend_question_id": 1336, "is_new_question": false }, @@ -28742,8 +29317,8 @@ "question__title": "Jump Game V", "question__title_slug": "jump-game-v", "question__hide": false, - "total_acs": 25471, - "total_submitted": 40884, + "total_acs": 25598, + "total_submitted": 41110, "frontend_question_id": 1340, "is_new_question": false }, @@ -28765,8 +29340,8 @@ "question__title": "Maximum Product of Splitted Binary Tree", "question__title_slug": "maximum-product-of-splitted-binary-tree", "question__hide": false, - "total_acs": 114599, - "total_submitted": 239853, + "total_acs": 114925, + "total_submitted": 240493, "frontend_question_id": 1339, "is_new_question": false }, @@ -28788,8 +29363,8 @@ "question__title": "Reduce Array Size to The Half", "question__title_slug": "reduce-array-size-to-the-half", "question__hide": false, - "total_acs": 171423, - "total_submitted": 247162, + "total_acs": 171876, + "total_submitted": 247846, "frontend_question_id": 1338, "is_new_question": false }, @@ -28811,8 +29386,8 @@ "question__title": "The K Weakest Rows in a Matrix", "question__title_slug": "the-k-weakest-rows-in-a-matrix", "question__hide": false, - "total_acs": 243399, - "total_submitted": 338165, + "total_acs": 245244, + "total_submitted": 341006, "frontend_question_id": 1337, "is_new_question": false }, @@ -28834,8 +29409,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": 37575, - "total_submitted": 50039, + "total_acs": 38630, + "total_submitted": 51678, "frontend_question_id": 1327, "is_new_question": false }, @@ -28857,8 +29432,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": 58489, - "total_submitted": 93780, + "total_acs": 58618, + "total_submitted": 94003, "frontend_question_id": 1359, "is_new_question": false }, @@ -28880,8 +29455,8 @@ "question__title": "Number of Substrings Containing All Three Characters", "question__title_slug": "number-of-substrings-containing-all-three-characters", "question__hide": false, - "total_acs": 56548, - "total_submitted": 89165, + "total_acs": 57073, + "total_submitted": 89988, "frontend_question_id": 1358, "is_new_question": false }, @@ -28903,8 +29478,8 @@ "question__title": "Apply Discount Every n Orders", "question__title_slug": "apply-discount-every-n-orders", "question__hide": false, - "total_acs": 17990, - "total_submitted": 25743, + "total_acs": 18094, + "total_submitted": 25869, "frontend_question_id": 1357, "is_new_question": false }, @@ -28926,8 +29501,8 @@ "question__title": "Sort Integers by The Number of 1 Bits", "question__title_slug": "sort-integers-by-the-number-of-1-bits", "question__hide": false, - "total_acs": 112065, - "total_submitted": 152907, + "total_acs": 112937, + "total_submitted": 153946, "frontend_question_id": 1356, "is_new_question": false }, @@ -28949,8 +29524,8 @@ "question__title": "Minimum Difficulty of a Job Schedule", "question__title_slug": "minimum-difficulty-of-a-job-schedule", "question__hide": false, - "total_acs": 120597, - "total_submitted": 206359, + "total_acs": 120905, + "total_submitted": 207004, "frontend_question_id": 1335, "is_new_question": false }, @@ -28972,8 +29547,8 @@ "question__title": "Find the City With the Smallest Number of Neighbors at a Threshold Distance", "question__title_slug": "find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance", "question__hide": false, - "total_acs": 62749, - "total_submitted": 114209, + "total_acs": 63347, + "total_submitted": 115088, "frontend_question_id": 1334, "is_new_question": false }, @@ -28995,8 +29570,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": 26438, - "total_submitted": 43952, + "total_acs": 26523, + "total_submitted": 44120, "frontend_question_id": 1333, "is_new_question": false }, @@ -29018,8 +29593,8 @@ "question__title": "Remove Palindromic Subsequences", "question__title_slug": "remove-palindromic-subsequences", "question__hide": false, - "total_acs": 120616, - "total_submitted": 158262, + "total_acs": 120866, + "total_submitted": 158583, "frontend_question_id": 1332, "is_new_question": false }, @@ -29041,8 +29616,8 @@ "question__title": "Ads Performance", "question__title_slug": "ads-performance", "question__hide": false, - "total_acs": 36542, - "total_submitted": 60697, + "total_acs": 36649, + "total_submitted": 60902, "frontend_question_id": 1322, "is_new_question": false }, @@ -29064,8 +29639,8 @@ "question__title": "Restaurant Growth", "question__title_slug": "restaurant-growth", "question__hide": false, - "total_acs": 31313, - "total_submitted": 45634, + "total_acs": 31896, + "total_submitted": 46840, "frontend_question_id": 1321, "is_new_question": false }, @@ -29087,8 +29662,8 @@ "question__title": "Minimum Number of Taps to Open to Water a Garden", "question__title_slug": "minimum-number-of-taps-to-open-to-water-a-garden", "question__hide": false, - "total_acs": 68476, - "total_submitted": 144393, + "total_acs": 68663, + "total_submitted": 144833, "frontend_question_id": 1326, "is_new_question": false }, @@ -29110,8 +29685,8 @@ "question__title": "Delete Leaves With a Given Value", "question__title_slug": "delete-leaves-with-a-given-value", "question__hide": false, - "total_acs": 87421, - "total_submitted": 117099, + "total_acs": 87747, + "total_submitted": 117540, "frontend_question_id": 1325, "is_new_question": false }, @@ -29133,8 +29708,8 @@ "question__title": "Print Words Vertically", "question__title_slug": "print-words-vertically", "question__hide": false, - "total_acs": 33696, - "total_submitted": 54616, + "total_acs": 33874, + "total_submitted": 54831, "frontend_question_id": 1324, "is_new_question": false }, @@ -29156,8 +29731,8 @@ "question__title": "Maximum 69 Number", "question__title_slug": "maximum-69-number", "question__hide": false, - "total_acs": 216374, - "total_submitted": 263468, + "total_acs": 217454, + "total_submitted": 264862, "frontend_question_id": 1323, "is_new_question": false }, @@ -29179,8 +29754,8 @@ "question__title": "Jump Game IV", "question__title_slug": "jump-game-iv", "question__hide": false, - "total_acs": 129818, - "total_submitted": 276596, + "total_acs": 130036, + "total_submitted": 277113, "frontend_question_id": 1345, "is_new_question": false }, @@ -29202,8 +29777,8 @@ "question__title": "Angle Between Hands of a Clock", "question__title_slug": "angle-between-hands-of-a-clock", "question__hide": false, - "total_acs": 106027, - "total_submitted": 167553, + "total_acs": 106278, + "total_submitted": 167934, "frontend_question_id": 1344, "is_new_question": false }, @@ -29225,8 +29800,8 @@ "question__title": "Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold", "question__title_slug": "number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold", "question__hide": false, - "total_acs": 56653, - "total_submitted": 83714, + "total_acs": 57508, + "total_submitted": 84976, "frontend_question_id": 1343, "is_new_question": false }, @@ -29248,8 +29823,8 @@ "question__title": "Number of Steps to Reduce a Number to Zero", "question__title_slug": "number-of-steps-to-reduce-a-number-to-zero", "question__hide": false, - "total_acs": 504308, - "total_submitted": 592729, + "total_acs": 509889, + "total_submitted": 599665, "frontend_question_id": 1342, "is_new_question": false }, @@ -29271,8 +29846,8 @@ "question__title": "Minimum Distance to Type a Word Using Two Fingers", "question__title_slug": "minimum-distance-to-type-a-word-using-two-fingers", "question__hide": false, - "total_acs": 27948, - "total_submitted": 47044, + "total_acs": 28020, + "total_submitted": 47158, "frontend_question_id": 1320, "is_new_question": false }, @@ -29294,8 +29869,8 @@ "question__title": "Number of Operations to Make Network Connected", "question__title_slug": "number-of-operations-to-make-network-connected", "question__hide": false, - "total_acs": 172109, - "total_submitted": 276877, + "total_acs": 172934, + "total_submitted": 278203, "frontend_question_id": 1319, "is_new_question": false }, @@ -29311,14 +29886,14 @@ { "stat": { "question_id": 1441, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "minimum-flips-to-make-a-or-b-equal-to-c", + "question__article__has_video_solution": false, "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": 30203, - "total_submitted": 45774, + "total_acs": 30553, + "total_submitted": 46289, "frontend_question_id": 1318, "is_new_question": false }, @@ -29340,8 +29915,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": 37925, - "total_submitted": 68477, + "total_acs": 38160, + "total_submitted": 68918, "frontend_question_id": 1317, "is_new_question": false }, @@ -29363,8 +29938,8 @@ "question__title": "Running Total for Different Genders", "question__title_slug": "running-total-for-different-genders", "question__hide": false, - "total_acs": 36071, - "total_submitted": 41497, + "total_acs": 36216, + "total_submitted": 41674, "frontend_question_id": 1308, "is_new_question": false }, @@ -29386,8 +29961,8 @@ "question__title": "Find the Team Size", "question__title_slug": "find-the-team-size", "question__hide": false, - "total_acs": 61222, - "total_submitted": 68024, + "total_acs": 61536, + "total_submitted": 68424, "frontend_question_id": 1303, "is_new_question": false }, @@ -29409,8 +29984,8 @@ "question__title": "Minimum Insertion Steps to Make a String Palindrome", "question__title_slug": "minimum-insertion-steps-to-make-a-string-palindrome", "question__hide": false, - "total_acs": 118830, - "total_submitted": 172223, + "total_acs": 119651, + "total_submitted": 173327, "frontend_question_id": 1312, "is_new_question": false }, @@ -29432,8 +30007,8 @@ "question__title": "Get Watched Videos by Your Friends", "question__title_slug": "get-watched-videos-by-your-friends", "question__hide": false, - "total_acs": 18447, - "total_submitted": 40109, + "total_acs": 18521, + "total_submitted": 40268, "frontend_question_id": 1311, "is_new_question": false }, @@ -29455,8 +30030,8 @@ "question__title": "XOR Queries of a Subarray", "question__title_slug": "xor-queries-of-a-subarray", "question__hide": false, - "total_acs": 47530, - "total_submitted": 65770, + "total_acs": 47761, + "total_submitted": 66096, "frontend_question_id": 1310, "is_new_question": false }, @@ -29478,8 +30053,8 @@ "question__title": "Decrypt String from Alphabet to Integer Mapping", "question__title_slug": "decrypt-string-from-alphabet-to-integer-mapping", "question__hide": false, - "total_acs": 108087, - "total_submitted": 135486, + "total_acs": 108743, + "total_submitted": 136286, "frontend_question_id": 1309, "is_new_question": false }, @@ -29501,8 +30076,8 @@ "question__title": "Encrypt and Decrypt Strings", "question__title_slug": "encrypt-and-decrypt-strings", "question__hide": false, - "total_acs": 10080, - "total_submitted": 25644, + "total_acs": 10133, + "total_submitted": 25773, "frontend_question_id": 2227, "is_new_question": false }, @@ -29524,8 +30099,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": 42668, - "total_submitted": 91907, + "total_acs": 42706, + "total_submitted": 91955, "frontend_question_id": 1430, "is_new_question": false }, @@ -29547,8 +30122,8 @@ "question__title": "All Ancestors of a Node in a Directed Acyclic Graph", "question__title_slug": "all-ancestors-of-a-node-in-a-directed-acyclic-graph", "question__hide": false, - "total_acs": 24044, - "total_submitted": 47437, + "total_acs": 24512, + "total_submitted": 48387, "frontend_question_id": 2192, "is_new_question": false }, @@ -29570,8 +30145,8 @@ "question__title": "Find the K-Beauty of a Number", "question__title_slug": "find-the-k-beauty-of-a-number", "question__hide": false, - "total_acs": 36592, - "total_submitted": 63379, + "total_acs": 37084, + "total_submitted": 64148, "frontend_question_id": 2269, "is_new_question": false }, @@ -29593,8 +30168,8 @@ "question__title": "Verbal Arithmetic Puzzle", "question__title_slug": "verbal-arithmetic-puzzle", "question__hide": false, - "total_acs": 10928, - "total_submitted": 32015, + "total_acs": 10968, + "total_submitted": 32119, "frontend_question_id": 1307, "is_new_question": false }, @@ -29616,8 +30191,8 @@ "question__title": "Jump Game III", "question__title_slug": "jump-game-iii", "question__hide": false, - "total_acs": 188450, - "total_submitted": 296217, + "total_acs": 189176, + "total_submitted": 297253, "frontend_question_id": 1306, "is_new_question": false }, @@ -29639,8 +30214,8 @@ "question__title": "All Elements in Two Binary Search Trees", "question__title_slug": "all-elements-in-two-binary-search-trees", "question__hide": false, - "total_acs": 189046, - "total_submitted": 236784, + "total_acs": 189546, + "total_submitted": 237395, "frontend_question_id": 1305, "is_new_question": false }, @@ -29662,8 +30237,8 @@ "question__title": "Find N Unique Integers Sum up to Zero", "question__title_slug": "find-n-unique-integers-sum-up-to-zero", "question__hide": false, - "total_acs": 184228, - "total_submitted": 239539, + "total_acs": 185035, + "total_submitted": 240611, "frontend_question_id": 1304, "is_new_question": false }, @@ -29685,8 +30260,8 @@ "question__title": "Weather Type in Each Country", "question__title_slug": "weather-type-in-each-country", "question__hide": false, - "total_acs": 35318, - "total_submitted": 52643, + "total_acs": 35489, + "total_submitted": 52970, "frontend_question_id": 1294, "is_new_question": false }, @@ -29708,8 +30283,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": 13142, - "total_submitted": 22001, + "total_acs": 13210, + "total_submitted": 22128, "frontend_question_id": 1298, "is_new_question": false }, @@ -29731,8 +30306,8 @@ "question__title": "Maximum Number of Occurrences of a Substring", "question__title_slug": "maximum-number-of-occurrences-of-a-substring", "question__hide": false, - "total_acs": 41170, - "total_submitted": 79432, + "total_acs": 41423, + "total_submitted": 79974, "frontend_question_id": 1297, "is_new_question": false }, @@ -29754,8 +30329,8 @@ "question__title": "Divide Array in Sets of K Consecutive Numbers", "question__title_slug": "divide-array-in-sets-of-k-consecutive-numbers", "question__hide": false, - "total_acs": 72079, - "total_submitted": 127763, + "total_acs": 72312, + "total_submitted": 128256, "frontend_question_id": 1296, "is_new_question": false }, @@ -29777,8 +30352,8 @@ "question__title": "Find Numbers with Even Number of Digits", "question__title_slug": "find-numbers-with-even-number-of-digits", "question__hide": false, - "total_acs": 552001, - "total_submitted": 716668, + "total_acs": 554907, + "total_submitted": 720503, "frontend_question_id": 1295, "is_new_question": false }, @@ -29800,8 +30375,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": 31716, - "total_submitted": 37286, + "total_acs": 31905, + "total_submitted": 37521, "frontend_question_id": 1285, "is_new_question": false }, @@ -29823,8 +30398,8 @@ "question__title": "Make Array Non-decreasing or Non-increasing", "question__title_slug": "make-array-non-decreasing-or-non-increasing", "question__hide": false, - "total_acs": 976, - "total_submitted": 1474, + "total_acs": 985, + "total_submitted": 1499, "frontend_question_id": 2263, "is_new_question": false }, @@ -29846,8 +30421,8 @@ "question__title": "Fair Distribution of Cookies", "question__title_slug": "fair-distribution-of-cookies", "question__hide": false, - "total_acs": 23439, - "total_submitted": 38000, + "total_acs": 23637, + "total_submitted": 38332, "frontend_question_id": 2305, "is_new_question": false }, @@ -29869,8 +30444,8 @@ "question__title": "Check if an Array Is Consecutive", "question__title_slug": "check-if-an-array-is-consecutive", "question__hide": false, - "total_acs": 4128, - "total_submitted": 6755, + "total_acs": 4178, + "total_submitted": 6831, "frontend_question_id": 2229, "is_new_question": false }, @@ -29892,8 +30467,8 @@ "question__title": "Students and Examinations", "question__title_slug": "students-and-examinations", "question__hide": false, - "total_acs": 37843, - "total_submitted": 54887, + "total_acs": 39649, + "total_submitted": 58193, "frontend_question_id": 1280, "is_new_question": false }, @@ -29915,8 +30490,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": 177743, - "total_submitted": 392704, + "total_acs": 178221, + "total_submitted": 393777, "frontend_question_id": 1293, "is_new_question": false }, @@ -29938,8 +30513,8 @@ "question__title": "Maximum Side Length of a Square with Sum Less than or Equal to Threshold", "question__title_slug": "maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold", "question__hide": false, - "total_acs": 30170, - "total_submitted": 56558, + "total_acs": 30268, + "total_submitted": 56742, "frontend_question_id": 1292, "is_new_question": false }, @@ -29961,8 +30536,8 @@ "question__title": "Convert Binary Number in a Linked List to Integer", "question__title_slug": "convert-binary-number-in-a-linked-list-to-integer", "question__hide": false, - "total_acs": 381542, - "total_submitted": 464991, + "total_acs": 383624, + "total_submitted": 467846, "frontend_question_id": 1290, "is_new_question": false }, @@ -29984,8 +30559,8 @@ "question__title": "Traffic Light Controlled Intersection", "question__title_slug": "traffic-light-controlled-intersection", "question__hide": false, - "total_acs": 11092, - "total_submitted": 14941, + "total_acs": 11174, + "total_submitted": 15062, "frontend_question_id": 1279, "is_new_question": false }, @@ -30007,8 +30582,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": 29296, - "total_submitted": 40752, + "total_acs": 29394, + "total_submitted": 40876, "frontend_question_id": 1284, "is_new_question": false }, @@ -30030,8 +30605,8 @@ "question__title": "Find the Smallest Divisor Given a Threshold", "question__title_slug": "find-the-smallest-divisor-given-a-threshold", "question__hide": false, - "total_acs": 109347, - "total_submitted": 194261, + "total_acs": 110057, + "total_submitted": 195284, "frontend_question_id": 1283, "is_new_question": false }, @@ -30053,8 +30628,8 @@ "question__title": "Group the People Given the Group Size They Belong To", "question__title_slug": "group-the-people-given-the-group-size-they-belong-to", "question__hide": false, - "total_acs": 101788, - "total_submitted": 118916, + "total_acs": 102245, + "total_submitted": 119482, "frontend_question_id": 1282, "is_new_question": false }, @@ -30076,8 +30651,8 @@ "question__title": "Subtract the Product and Sum of Digits of an Integer", "question__title_slug": "subtract-the-product-and-sum-of-digits-of-an-integer", "question__hide": false, - "total_acs": 383395, - "total_submitted": 442717, + "total_acs": 386780, + "total_submitted": 446762, "frontend_question_id": 1281, "is_new_question": false }, @@ -30099,8 +30674,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": 47387, - "total_submitted": 54640, + "total_acs": 47521, + "total_submitted": 54840, "frontend_question_id": 1270, "is_new_question": false }, @@ -30122,8 +30697,8 @@ "question__title": "Print Immutable Linked List in Reverse", "question__title_slug": "print-immutable-linked-list-in-reverse", "question__hide": false, - "total_acs": 49380, - "total_submitted": 52431, + "total_acs": 49591, + "total_submitted": 52652, "frontend_question_id": 1265, "is_new_question": false }, @@ -30145,8 +30720,8 @@ "question__title": "Palindrome Partitioning III", "question__title_slug": "palindrome-partitioning-iii", "question__hide": false, - "total_acs": 23270, - "total_submitted": 38260, + "total_acs": 23355, + "total_submitted": 38453, "frontend_question_id": 1278, "is_new_question": false }, @@ -30168,8 +30743,8 @@ "question__title": "Count Square Submatrices with All Ones", "question__title_slug": "count-square-submatrices-with-all-ones", "question__hide": false, - "total_acs": 193515, - "total_submitted": 259525, + "total_acs": 194049, + "total_submitted": 260198, "frontend_question_id": 1277, "is_new_question": false }, @@ -30191,8 +30766,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": 21755, - "total_submitted": 42871, + "total_acs": 21831, + "total_submitted": 43020, "frontend_question_id": 1276, "is_new_question": false }, @@ -30214,8 +30789,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": 101688, - "total_submitted": 187531, + "total_acs": 102315, + "total_submitted": 188617, "frontend_question_id": 1275, "is_new_question": false }, @@ -30237,8 +30812,8 @@ "question__title": "Page Recommendations", "question__title_slug": "page-recommendations", "question__hide": false, - "total_acs": 34300, - "total_submitted": 51674, + "total_acs": 34469, + "total_submitted": 52003, "frontend_question_id": 1264, "is_new_question": false }, @@ -30260,8 +30835,8 @@ "question__title": "Number of Ways to Stay in the Same Place After Some Steps", "question__title_slug": "number-of-ways-to-stay-in-the-same-place-after-some-steps", "question__hide": false, - "total_acs": 32113, - "total_submitted": 73772, + "total_acs": 32211, + "total_submitted": 73992, "frontend_question_id": 1269, "is_new_question": false }, @@ -30283,8 +30858,8 @@ "question__title": "Search Suggestions System", "question__title_slug": "search-suggestions-system", "question__hide": false, - "total_acs": 245739, - "total_submitted": 371288, + "total_acs": 246381, + "total_submitted": 372374, "frontend_question_id": 1268, "is_new_question": false }, @@ -30306,8 +30881,8 @@ "question__title": "Count Servers that Communicate", "question__title_slug": "count-servers-that-communicate", "question__hide": false, - "total_acs": 51853, - "total_submitted": 87007, + "total_acs": 52049, + "total_submitted": 87301, "frontend_question_id": 1267, "is_new_question": false }, @@ -30329,8 +30904,8 @@ "question__title": "Minimum Time Visiting All Points", "question__title_slug": "minimum-time-visiting-all-points", "question__hide": false, - "total_acs": 135006, - "total_submitted": 170702, + "total_acs": 135440, + "total_submitted": 171287, "frontend_question_id": 1266, "is_new_question": false }, @@ -30352,8 +30927,8 @@ "question__title": "Minimum Path Cost in a Grid", "question__title_slug": "minimum-path-cost-in-a-grid", "question__hide": false, - "total_acs": 21975, - "total_submitted": 33315, + "total_acs": 22153, + "total_submitted": 33732, "frontend_question_id": 2304, "is_new_question": false }, @@ -30375,8 +30950,8 @@ "question__title": "Maximum Value of K Coins From Piles", "question__title_slug": "maximum-value-of-k-coins-from-piles", "question__hide": false, - "total_acs": 56101, - "total_submitted": 90667, + "total_acs": 56382, + "total_submitted": 91414, "frontend_question_id": 2218, "is_new_question": false }, @@ -30398,8 +30973,8 @@ "question__title": "Find the Difference of Two Arrays", "question__title_slug": "find-the-difference-of-two-arrays", "question__hide": false, - "total_acs": 95225, - "total_submitted": 124601, + "total_acs": 134793, + "total_submitted": 172649, "frontend_question_id": 2215, "is_new_question": false }, @@ -30421,8 +30996,8 @@ "question__title": "Counting Elements", "question__title_slug": "counting-elements", "question__hide": false, - "total_acs": 100711, - "total_submitted": 168743, + "total_acs": 101215, + "total_submitted": 169527, "frontend_question_id": 1426, "is_new_question": false }, @@ -30444,8 +31019,8 @@ "question__title": "Average Selling Price", "question__title_slug": "average-selling-price", "question__hide": false, - "total_acs": 55852, - "total_submitted": 69559, + "total_acs": 57646, + "total_submitted": 72225, "frontend_question_id": 1251, "is_new_question": false }, @@ -30467,8 +31042,8 @@ "question__title": "Minimum Moves to Move a Box to Their Target Location", "question__title_slug": "minimum-moves-to-move-a-box-to-their-target-location", "question__hide": false, - "total_acs": 25308, - "total_submitted": 51685, + "total_acs": 25585, + "total_submitted": 52181, "frontend_question_id": 1263, "is_new_question": false }, @@ -30490,8 +31065,8 @@ "question__title": "Greatest Sum Divisible by Three", "question__title_slug": "greatest-sum-divisible-by-three", "question__hide": false, - "total_acs": 46104, - "total_submitted": 90895, + "total_acs": 46269, + "total_submitted": 91225, "frontend_question_id": 1262, "is_new_question": false }, @@ -30513,8 +31088,8 @@ "question__title": "Find Elements in a Contaminated Binary Tree", "question__title_slug": "find-elements-in-a-contaminated-binary-tree", "question__hide": false, - "total_acs": 55324, - "total_submitted": 72387, + "total_acs": 55552, + "total_submitted": 72676, "frontend_question_id": 1261, "is_new_question": false }, @@ -30536,8 +31111,8 @@ "question__title": "Shift 2D Grid", "question__title_slug": "shift-2d-grid", "question__hide": false, - "total_acs": 95472, - "total_submitted": 140897, + "total_acs": 95771, + "total_submitted": 141364, "frontend_question_id": 1260, "is_new_question": false }, @@ -30559,8 +31134,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": 1532, - "total_submitted": 2431, + "total_acs": 1540, + "total_submitted": 2441, "frontend_question_id": 2189, "is_new_question": false }, @@ -30582,8 +31157,8 @@ "question__title": "Maximum Font to Fit a Sentence in a Screen", "question__title_slug": "maximum-font-to-fit-a-sentence-in-a-screen", "question__hide": false, - "total_acs": 6246, - "total_submitted": 10420, + "total_acs": 6262, + "total_submitted": 10442, "frontend_question_id": 1618, "is_new_question": false }, @@ -30605,8 +31180,8 @@ "question__title": "Number of Single Divisor Triplets", "question__title_slug": "number-of-single-divisor-triplets", "question__hide": false, - "total_acs": 824, - "total_submitted": 1466, + "total_acs": 832, + "total_submitted": 1481, "frontend_question_id": 2198, "is_new_question": false }, @@ -30628,8 +31203,8 @@ "question__title": "Calculate Amount Paid in Taxes", "question__title_slug": "calculate-amount-paid-in-taxes", "question__hide": false, - "total_acs": 29617, - "total_submitted": 46232, + "total_acs": 29779, + "total_submitted": 46473, "frontend_question_id": 2303, "is_new_question": false }, @@ -30651,8 +31226,8 @@ "question__title": "Maximum Score Words Formed by Letters", "question__title_slug": "maximum-score-words-formed-by-letters", "question__hide": false, - "total_acs": 30235, - "total_submitted": 41821, + "total_acs": 30422, + "total_submitted": 42079, "frontend_question_id": 1255, "is_new_question": false }, @@ -30674,8 +31249,8 @@ "question__title": "Number of Closed Islands", "question__title_slug": "number-of-closed-islands", "question__hide": false, - "total_acs": 188023, - "total_submitted": 280732, + "total_acs": 189045, + "total_submitted": 282353, "frontend_question_id": 1254, "is_new_question": false }, @@ -30697,8 +31272,8 @@ "question__title": "Reconstruct a 2-Row Binary Matrix", "question__title_slug": "reconstruct-a-2-row-binary-matrix", "question__hide": false, - "total_acs": 22826, - "total_submitted": 51352, + "total_acs": 22899, + "total_submitted": 51485, "frontend_question_id": 1253, "is_new_question": false }, @@ -30720,8 +31295,8 @@ "question__title": "Cells with Odd Values in a Matrix", "question__title_slug": "cells-with-odd-values-in-a-matrix", "question__hide": false, - "total_acs": 94824, - "total_submitted": 120774, + "total_acs": 95197, + "total_submitted": 121231, "frontend_question_id": 1252, "is_new_question": false }, @@ -30743,8 +31318,8 @@ "question__title": "Number of Comments per Post", "question__title_slug": "number-of-comments-per-post", "question__hide": false, - "total_acs": 30863, - "total_submitted": 46609, + "total_acs": 30941, + "total_submitted": 46917, "frontend_question_id": 1241, "is_new_question": false }, @@ -30766,8 +31341,8 @@ "question__title": "Selling Pieces of Wood", "question__title_slug": "selling-pieces-of-wood", "question__hide": false, - "total_acs": 8184, - "total_submitted": 16788, + "total_acs": 8246, + "total_submitted": 16882, "frontend_question_id": 2312, "is_new_question": false }, @@ -30789,8 +31364,8 @@ "question__title": "Find Palindrome With Fixed Length", "question__title_slug": "find-palindrome-with-fixed-length", "question__hide": false, - "total_acs": 14585, - "total_submitted": 42969, + "total_acs": 14704, + "total_submitted": 43439, "frontend_question_id": 2217, "is_new_question": false }, @@ -30812,8 +31387,8 @@ "question__title": "Leftmost Column with at Least a One", "question__title_slug": "leftmost-column-with-at-least-a-one", "question__hide": false, - "total_acs": 165271, - "total_submitted": 309022, + "total_acs": 165428, + "total_submitted": 309290, "frontend_question_id": 1428, "is_new_question": false }, @@ -30835,8 +31410,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": 18050, - "total_submitted": 30636, + "total_acs": 18150, + "total_submitted": 30851, "frontend_question_id": 1250, "is_new_question": false }, @@ -30858,8 +31433,8 @@ "question__title": "Minimum Remove to Make Valid Parentheses", "question__title_slug": "minimum-remove-to-make-valid-parentheses", "question__hide": false, - "total_acs": 495636, - "total_submitted": 752475, + "total_acs": 496484, + "total_submitted": 753617, "frontend_question_id": 1249, "is_new_question": false }, @@ -30881,8 +31456,8 @@ "question__title": "Count Number of Nice Subarrays", "question__title_slug": "count-number-of-nice-subarrays", "question__hide": false, - "total_acs": 81413, - "total_submitted": 133140, + "total_acs": 82103, + "total_submitted": 134103, "frontend_question_id": 1248, "is_new_question": false }, @@ -30904,8 +31479,8 @@ "question__title": "Minimum Swaps to Make Strings Equal", "question__title_slug": "minimum-swaps-to-make-strings-equal", "question__hide": false, - "total_acs": 33630, - "total_submitted": 52472, + "total_acs": 33781, + "total_submitted": 52703, "frontend_question_id": 1247, "is_new_question": false }, @@ -30927,8 +31502,8 @@ "question__title": "Web Crawler Multithreaded", "question__title_slug": "web-crawler-multithreaded", "question__hide": false, - "total_acs": 41844, - "total_submitted": 85705, + "total_acs": 42163, + "total_submitted": 86325, "frontend_question_id": 1242, "is_new_question": false }, @@ -30950,8 +31525,8 @@ "question__title": "Maximum Height by Stacking Cuboids ", "question__title_slug": "maximum-height-by-stacking-cuboids", "question__hide": false, - "total_acs": 17963, - "total_submitted": 32871, + "total_acs": 18125, + "total_submitted": 33166, "frontend_question_id": 1691, "is_new_question": false }, @@ -30973,8 +31548,8 @@ "question__title": "First Unique Number", "question__title_slug": "first-unique-number", "question__hide": false, - "total_acs": 78292, - "total_submitted": 147715, + "total_acs": 78406, + "total_submitted": 147900, "frontend_question_id": 1429, "is_new_question": false }, @@ -30996,8 +31571,8 @@ "question__title": "Tuple with Same Product", "question__title_slug": "tuple-with-same-product", "question__hide": false, - "total_acs": 23555, - "total_submitted": 38812, + "total_acs": 23666, + "total_submitted": 39007, "frontend_question_id": 1726, "is_new_question": false }, @@ -31019,8 +31594,8 @@ "question__title": "Greatest English Letter in Upper and Lower Case", "question__title_slug": "greatest-english-letter-in-upper-and-lower-case", "question__hide": false, - "total_acs": 39512, - "total_submitted": 57413, + "total_acs": 39846, + "total_submitted": 57875, "frontend_question_id": 2309, "is_new_question": false }, @@ -31042,8 +31617,8 @@ "question__title": "Airplane Seat Assignment Probability", "question__title_slug": "airplane-seat-assignment-probability", "question__hide": false, - "total_acs": 33362, - "total_submitted": 50826, + "total_acs": 33541, + "total_submitted": 51101, "frontend_question_id": 1227, "is_new_question": false }, @@ -31065,8 +31640,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": 21445, - "total_submitted": 39733, + "total_acs": 21489, + "total_submitted": 39810, "frontend_question_id": 1240, "is_new_question": false }, @@ -31088,8 +31663,8 @@ "question__title": "Maximum Length of a Concatenated String with Unique Characters", "question__title_slug": "maximum-length-of-a-concatenated-string-with-unique-characters", "question__hide": false, - "total_acs": 172273, - "total_submitted": 330259, + "total_acs": 172864, + "total_submitted": 331243, "frontend_question_id": 1239, "is_new_question": false }, @@ -31111,8 +31686,8 @@ "question__title": "Circular Permutation in Binary Representation", "question__title_slug": "circular-permutation-in-binary-representation", "question__hide": false, - "total_acs": 14928, - "total_submitted": 21625, + "total_acs": 14997, + "total_submitted": 21746, "frontend_question_id": 1238, "is_new_question": false }, @@ -31134,8 +31709,8 @@ "question__title": "Find Positive Integer Solution for a Given Equation", "question__title_slug": "find-positive-integer-solution-for-a-given-equation", "question__hide": false, - "total_acs": 58185, - "total_submitted": 84007, + "total_acs": 58358, + "total_submitted": 84279, "frontend_question_id": 1237, "is_new_question": false }, @@ -31157,8 +31732,8 @@ "question__title": "Report Contiguous Dates", "question__title_slug": "report-contiguous-dates", "question__hide": false, - "total_acs": 18032, - "total_submitted": 29287, + "total_acs": 18140, + "total_submitted": 29550, "frontend_question_id": 1225, "is_new_question": false }, @@ -31180,8 +31755,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": 17753, - "total_submitted": 34684, + "total_acs": 17861, + "total_submitted": 34893, "frontend_question_id": 2193, "is_new_question": false }, @@ -31203,8 +31778,8 @@ "question__title": "Minimum Deletions to Make Array Beautiful", "question__title_slug": "minimum-deletions-to-make-array-beautiful", "question__hide": false, - "total_acs": 25669, - "total_submitted": 54674, + "total_acs": 26155, + "total_submitted": 55822, "frontend_question_id": 2216, "is_new_question": false }, @@ -31226,8 +31801,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": 92064, - "total_submitted": 127265, + "total_acs": 92737, + "total_submitted": 128229, "frontend_question_id": 2225, "is_new_question": false }, @@ -31249,8 +31824,8 @@ "question__title": "Find Resultant Array After Removing Anagrams", "question__title_slug": "find-resultant-array-after-removing-anagrams", "question__hide": false, - "total_acs": 40392, - "total_submitted": 69341, + "total_acs": 40732, + "total_submitted": 69968, "frontend_question_id": 2273, "is_new_question": false }, @@ -31272,8 +31847,8 @@ "question__title": "Maximum Profit in Job Scheduling", "question__title_slug": "maximum-profit-in-job-scheduling", "question__hide": false, - "total_acs": 182264, - "total_submitted": 341352, + "total_acs": 183046, + "total_submitted": 342814, "frontend_question_id": 1235, "is_new_question": false }, @@ -31295,8 +31870,8 @@ "question__title": "Replace the Substring for Balanced String", "question__title_slug": "replace-the-substring-for-balanced-string", "question__hide": false, - "total_acs": 28240, - "total_submitted": 75874, + "total_acs": 28328, + "total_submitted": 76088, "frontend_question_id": 1234, "is_new_question": false }, @@ -31318,8 +31893,8 @@ "question__title": "Remove Sub-Folders from the Filesystem", "question__title_slug": "remove-sub-folders-from-the-filesystem", "question__hide": false, - "total_acs": 48219, - "total_submitted": 73477, + "total_acs": 48310, + "total_submitted": 73622, "frontend_question_id": 1233, "is_new_question": false }, @@ -31341,8 +31916,8 @@ "question__title": "Check If It Is a Straight Line", "question__title_slug": "check-if-it-is-a-straight-line", "question__hide": false, - "total_acs": 149939, - "total_submitted": 372573, + "total_acs": 150733, + "total_submitted": 374917, "frontend_question_id": 1232, "is_new_question": false }, @@ -31364,8 +31939,8 @@ "question__title": "Maximum Score Of Spliced Array", "question__title_slug": "maximum-score-of-spliced-array", "question__hide": false, - "total_acs": 15752, - "total_submitted": 28217, + "total_acs": 15828, + "total_submitted": 28327, "frontend_question_id": 2321, "is_new_question": false }, @@ -31387,8 +31962,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": 2050, - "total_submitted": 2933, + "total_acs": 2059, + "total_submitted": 2942, "frontend_question_id": 2204, "is_new_question": false }, @@ -31410,8 +31985,8 @@ "question__title": "Maximize the Topmost Element After K Moves", "question__title_slug": "maximize-the-topmost-element-after-k-moves", "question__hide": false, - "total_acs": 22975, - "total_submitted": 100938, + "total_acs": 23095, + "total_submitted": 101529, "frontend_question_id": 2202, "is_new_question": false }, @@ -31433,8 +32008,8 @@ "question__title": "Perform String Shifts", "question__title_slug": "perform-string-shifts", "question__hide": false, - "total_acs": 73857, - "total_submitted": 135911, + "total_acs": 74154, + "total_submitted": 136438, "frontend_question_id": 1427, "is_new_question": false }, @@ -31456,8 +32031,8 @@ "question__title": "Maximum Equal Frequency", "question__title_slug": "maximum-equal-frequency", "question__hide": false, - "total_acs": 13054, - "total_submitted": 35344, + "total_acs": 13118, + "total_submitted": 35495, "frontend_question_id": 1224, "is_new_question": false }, @@ -31479,8 +32054,8 @@ "question__title": "Dice Roll Simulation", "question__title_slug": "dice-roll-simulation", "question__hide": false, - "total_acs": 25555, - "total_submitted": 52540, + "total_acs": 25625, + "total_submitted": 52673, "frontend_question_id": 1223, "is_new_question": false }, @@ -31502,8 +32077,8 @@ "question__title": "Queens That Can Attack the King", "question__title_slug": "queens-that-can-attack-the-king", "question__hide": false, - "total_acs": 37695, - "total_submitted": 52507, + "total_acs": 37823, + "total_submitted": 52686, "frontend_question_id": 1222, "is_new_question": false }, @@ -31525,8 +32100,8 @@ "question__title": "Split a String in Balanced Strings", "question__title_slug": "split-a-string-in-balanced-strings", "question__hide": false, - "total_acs": 246130, - "total_submitted": 288754, + "total_acs": 247535, + "total_submitted": 290351, "frontend_question_id": 1221, "is_new_question": false }, @@ -31548,8 +32123,8 @@ "question__title": "The Dining Philosophers", "question__title_slug": "the-dining-philosophers", "question__hide": false, - "total_acs": 25282, - "total_submitted": 45713, + "total_acs": 25446, + "total_submitted": 46098, "frontend_question_id": 1226, "is_new_question": false }, @@ -31571,8 +32146,8 @@ "question__title": "Team Scores in Football Tournament", "question__title_slug": "team-scores-in-football-tournament", "question__hide": false, - "total_acs": 30983, - "total_submitted": 54432, + "total_acs": 31159, + "total_submitted": 54805, "frontend_question_id": 1212, "is_new_question": false }, @@ -31594,8 +32169,8 @@ "question__title": "Queries Quality and Percentage", "question__title_slug": "queries-quality-and-percentage", "question__hide": false, - "total_acs": 39185, - "total_submitted": 55825, + "total_acs": 40606, + "total_submitted": 58281, "frontend_question_id": 1211, "is_new_question": false }, @@ -31617,8 +32192,8 @@ "question__title": "Design Skiplist", "question__title_slug": "design-skiplist", "question__hide": false, - "total_acs": 17001, - "total_submitted": 28103, + "total_acs": 17066, + "total_submitted": 28248, "frontend_question_id": 1206, "is_new_question": false }, @@ -31640,8 +32215,8 @@ "question__title": "Maximum Product of the Length of Two Palindromic Substrings", "question__title_slug": "maximum-product-of-the-length-of-two-palindromic-substrings", "question__hide": false, - "total_acs": 2714, - "total_submitted": 9140, + "total_acs": 2734, + "total_submitted": 9191, "frontend_question_id": 1960, "is_new_question": false }, @@ -31663,8 +32238,8 @@ "question__title": "Maximum Candies Allocated to K Children", "question__title_slug": "maximum-candies-allocated-to-k-children", "question__hide": false, - "total_acs": 27667, - "total_submitted": 75253, + "total_acs": 27892, + "total_submitted": 75865, "frontend_question_id": 2226, "is_new_question": false }, @@ -31686,8 +32261,8 @@ "question__title": "Sum of Numbers With Units Digit K", "question__title_slug": "sum-of-numbers-with-units-digit-k", "question__hide": false, - "total_acs": 21732, - "total_submitted": 84171, + "total_acs": 21819, + "total_submitted": 84434, "frontend_question_id": 2310, "is_new_question": false }, @@ -31709,8 +32284,8 @@ "question__title": "Sort the Jumbled Numbers", "question__title_slug": "sort-the-jumbled-numbers", "question__hide": false, - "total_acs": 16464, - "total_submitted": 36031, + "total_acs": 16542, + "total_submitted": 36199, "frontend_question_id": 2191, "is_new_question": false }, @@ -31732,8 +32307,8 @@ "question__title": "Count Vowels Permutation", "question__title_slug": "count-vowels-permutation", "question__hide": false, - "total_acs": 103673, - "total_submitted": 172359, + "total_acs": 103958, + "total_submitted": 172898, "frontend_question_id": 1220, "is_new_question": false }, @@ -31755,8 +32330,8 @@ "question__title": "Path with Maximum Gold", "question__title_slug": "path-with-maximum-gold", "question__hide": false, - "total_acs": 99983, - "total_submitted": 157031, + "total_acs": 100301, + "total_submitted": 157547, "frontend_question_id": 1219, "is_new_question": false }, @@ -31778,8 +32353,8 @@ "question__title": "Longest Arithmetic Subsequence of Given Difference", "question__title_slug": "longest-arithmetic-subsequence-of-given-difference", "question__hide": false, - "total_acs": 60856, - "total_submitted": 117205, + "total_acs": 61257, + "total_submitted": 117891, "frontend_question_id": 1218, "is_new_question": false }, @@ -31801,8 +32376,8 @@ "question__title": "Minimum Cost to Move Chips to The Same Position", "question__title_slug": "minimum-cost-to-move-chips-to-the-same-position", "question__hide": false, - "total_acs": 112594, - "total_submitted": 156701, + "total_acs": 112988, + "total_submitted": 157265, "frontend_question_id": 1217, "is_new_question": false }, @@ -31824,8 +32399,8 @@ "question__title": "Monthly Transactions II", "question__title_slug": "monthly-transactions-ii", "question__hide": false, - "total_acs": 19985, - "total_submitted": 46757, + "total_acs": 20055, + "total_submitted": 46986, "frontend_question_id": 1205, "is_new_question": false }, @@ -31847,8 +32422,8 @@ "question__title": "Last Person to Fit in the Bus", "question__title_slug": "last-person-to-fit-in-the-bus", "question__hide": false, - "total_acs": 37528, - "total_submitted": 52028, + "total_acs": 38363, + "total_submitted": 53554, "frontend_question_id": 1204, "is_new_question": false }, @@ -31870,8 +32445,8 @@ "question__title": "Sum of Floored Pairs", "question__title_slug": "sum-of-floored-pairs", "question__hide": false, - "total_acs": 7599, - "total_submitted": 26943, + "total_acs": 7623, + "total_submitted": 27036, "frontend_question_id": 1862, "is_new_question": false }, @@ -31893,8 +32468,8 @@ "question__title": "Path with Maximum Probability", "question__title_slug": "path-with-maximum-probability", "question__hide": false, - "total_acs": 64895, - "total_submitted": 132980, + "total_acs": 65492, + "total_submitted": 134055, "frontend_question_id": 1514, "is_new_question": false }, @@ -31916,8 +32491,8 @@ "question__title": "Where Will the Ball Fall", "question__title_slug": "where-will-the-ball-fall", "question__hide": false, - "total_acs": 130070, - "total_submitted": 181766, + "total_acs": 130948, + "total_submitted": 182895, "frontend_question_id": 1706, "is_new_question": false }, @@ -31939,8 +32514,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": 8396, - "total_submitted": 17039, + "total_acs": 8411, + "total_submitted": 17061, "frontend_question_id": 1210, "is_new_question": false }, @@ -31962,8 +32537,8 @@ "question__title": "Get Equal Substrings Within Budget", "question__title_slug": "get-equal-substrings-within-budget", "question__hide": false, - "total_acs": 38506, - "total_submitted": 78961, + "total_acs": 38827, + "total_submitted": 79491, "frontend_question_id": 1208, "is_new_question": false }, @@ -31985,8 +32560,8 @@ "question__title": "Remove All Adjacent Duplicates in String II", "question__title_slug": "remove-all-adjacent-duplicates-in-string-ii", "question__hide": false, - "total_acs": 264421, - "total_submitted": 470048, + "total_acs": 265124, + "total_submitted": 471169, "frontend_question_id": 1209, "is_new_question": false }, @@ -32008,8 +32583,8 @@ "question__title": "Unique Number of Occurrences", "question__title_slug": "unique-number-of-occurrences", "question__hide": false, - "total_acs": 268582, - "total_submitted": 365410, + "total_acs": 272145, + "total_submitted": 370164, "frontend_question_id": 1207, "is_new_question": false }, @@ -32031,8 +32606,8 @@ "question__title": "Tournament Winners", "question__title_slug": "tournament-winners", "question__hide": false, - "total_acs": 17344, - "total_submitted": 34480, + "total_acs": 17419, + "total_submitted": 34680, "frontend_question_id": 1194, "is_new_question": false }, @@ -32054,8 +32629,8 @@ "question__title": "Monthly Transactions I", "question__title_slug": "monthly-transactions-i", "question__hide": false, - "total_acs": 37929, - "total_submitted": 58179, + "total_acs": 39189, + "total_submitted": 60541, "frontend_question_id": 1193, "is_new_question": false }, @@ -32077,8 +32652,8 @@ "question__title": "Fizz Buzz Multithreaded", "question__title_slug": "fizz-buzz-multithreaded", "question__hide": false, - "total_acs": 37586, - "total_submitted": 51657, + "total_acs": 37825, + "total_submitted": 52019, "frontend_question_id": 1195, "is_new_question": false }, @@ -32100,8 +32675,8 @@ "question__title": "Count Ways to Build Rooms in an Ant Colony", "question__title_slug": "count-ways-to-build-rooms-in-an-ant-colony", "question__hide": false, - "total_acs": 5459, - "total_submitted": 11089, + "total_acs": 5484, + "total_submitted": 11131, "frontend_question_id": 1916, "is_new_question": false }, @@ -32123,8 +32698,8 @@ "question__title": "Count Artifacts That Can Be Extracted", "question__title_slug": "count-artifacts-that-can-be-extracted", "question__hide": false, - "total_acs": 17120, - "total_submitted": 30885, + "total_acs": 17172, + "total_submitted": 30956, "frontend_question_id": 2201, "is_new_question": false }, @@ -32146,8 +32721,8 @@ "question__title": "Largest Magic Square", "question__title_slug": "largest-magic-square", "question__hide": false, - "total_acs": 9240, - "total_submitted": 17891, + "total_acs": 9270, + "total_submitted": 17944, "frontend_question_id": 1895, "is_new_question": false }, @@ -32169,8 +32744,8 @@ "question__title": "Watering Plants", "question__title_slug": "watering-plants", "question__hide": false, - "total_acs": 34857, - "total_submitted": 43670, + "total_acs": 35212, + "total_submitted": 44100, "frontend_question_id": 2079, "is_new_question": false }, @@ -32192,8 +32767,8 @@ "question__title": "Sort Items by Groups Respecting Dependencies", "question__title_slug": "sort-items-by-groups-respecting-dependencies", "question__hide": false, - "total_acs": 15300, - "total_submitted": 29933, + "total_acs": 15377, + "total_submitted": 30091, "frontend_question_id": 1203, "is_new_question": false }, @@ -32215,8 +32790,8 @@ "question__title": "Smallest String With Swaps", "question__title_slug": "smallest-string-with-swaps", "question__hide": false, - "total_acs": 98984, - "total_submitted": 171365, + "total_acs": 99500, + "total_submitted": 172214, "frontend_question_id": 1202, "is_new_question": false }, @@ -32238,8 +32813,8 @@ "question__title": "Ugly Number III", "question__title_slug": "ugly-number-iii", "question__hide": false, - "total_acs": 26810, - "total_submitted": 92665, + "total_acs": 26968, + "total_submitted": 93079, "frontend_question_id": 1201, "is_new_question": false }, @@ -32261,8 +32836,8 @@ "question__title": "Minimum Absolute Difference", "question__title_slug": "minimum-absolute-difference", "question__hide": false, - "total_acs": 156510, - "total_submitted": 224820, + "total_acs": 157266, + "total_submitted": 225914, "frontend_question_id": 1200, "is_new_question": false }, @@ -32284,8 +32859,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": 33406, - "total_submitted": 48497, + "total_acs": 33649, + "total_submitted": 48904, "frontend_question_id": 1944, "is_new_question": false }, @@ -32307,8 +32882,8 @@ "question__title": "Longest Happy String", "question__title_slug": "longest-happy-string", "question__hide": false, - "total_acs": 65096, - "total_submitted": 113506, + "total_acs": 65415, + "total_submitted": 114072, "frontend_question_id": 1405, "is_new_question": false }, @@ -32330,8 +32905,8 @@ "question__title": "Minimum Moves to Reach Target Score", "question__title_slug": "minimum-moves-to-reach-target-score", "question__hide": false, - "total_acs": 32905, - "total_submitted": 67231, + "total_acs": 33100, + "total_submitted": 67604, "frontend_question_id": 2139, "is_new_question": false }, @@ -32353,8 +32928,8 @@ "question__title": "Delete Characters to Make Fancy String", "question__title_slug": "delete-characters-to-make-fancy-string", "question__hide": false, - "total_acs": 27650, - "total_submitted": 48401, + "total_acs": 27837, + "total_submitted": 48958, "frontend_question_id": 1957, "is_new_question": false }, @@ -32376,8 +32951,8 @@ "question__title": "Reformat Department Table", "question__title_slug": "reformat-department-table", "question__hide": false, - "total_acs": 93030, - "total_submitted": 115906, + "total_acs": 93691, + "total_submitted": 116958, "frontend_question_id": 1179, "is_new_question": false }, @@ -32399,8 +32974,8 @@ "question__title": "Critical Connections in a Network", "question__title_slug": "critical-connections-in-a-network", "question__hide": false, - "total_acs": 197090, - "total_submitted": 360412, + "total_acs": 197630, + "total_submitted": 361293, "frontend_question_id": 1192, "is_new_question": false }, @@ -32422,8 +32997,8 @@ "question__title": "K-Concatenation Maximum Sum", "question__title_slug": "k-concatenation-maximum-sum", "question__hide": false, - "total_acs": 30081, - "total_submitted": 126677, + "total_acs": 30181, + "total_submitted": 127207, "frontend_question_id": 1191, "is_new_question": false }, @@ -32445,8 +33020,8 @@ "question__title": "Reverse Substrings Between Each Pair of Parentheses", "question__title_slug": "reverse-substrings-between-each-pair-of-parentheses", "question__hide": false, - "total_acs": 61139, - "total_submitted": 92752, + "total_acs": 61416, + "total_submitted": 93163, "frontend_question_id": 1190, "is_new_question": false }, @@ -32468,8 +33043,8 @@ "question__title": "Maximum Number of Balloons", "question__title_slug": "maximum-number-of-balloons", "question__hide": false, - "total_acs": 147106, - "total_submitted": 241613, + "total_acs": 148448, + "total_submitted": 243929, "frontend_question_id": 1189, "is_new_question": false }, @@ -32491,8 +33066,8 @@ "question__title": "Kth Ancestor of a Tree Node", "question__title_slug": "kth-ancestor-of-a-tree-node", "question__hide": false, - "total_acs": 27056, - "total_submitted": 80181, + "total_acs": 27181, + "total_submitted": 80526, "frontend_question_id": 1483, "is_new_question": false }, @@ -32514,8 +33089,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": 13887, - "total_submitted": 25997, + "total_acs": 13942, + "total_submitted": 26102, "frontend_question_id": 1954, "is_new_question": false }, @@ -32537,8 +33112,8 @@ "question__title": "Range Frequency Queries", "question__title_slug": "range-frequency-queries", "question__hide": false, - "total_acs": 16284, - "total_submitted": 42180, + "total_acs": 16402, + "total_submitted": 42426, "frontend_question_id": 2080, "is_new_question": false }, @@ -32560,8 +33135,8 @@ "question__title": "Three Consecutive Odds", "question__title_slug": "three-consecutive-odds", "question__hide": false, - "total_acs": 66455, - "total_submitted": 104683, + "total_acs": 66875, + "total_submitted": 105375, "frontend_question_id": 1550, "is_new_question": false }, @@ -32583,8 +33158,8 @@ "question__title": "Immediate Food Delivery II", "question__title_slug": "immediate-food-delivery-ii", "question__hide": false, - "total_acs": 30273, - "total_submitted": 48879, + "total_acs": 31265, + "total_submitted": 51070, "frontend_question_id": 1174, "is_new_question": false }, @@ -32606,8 +33181,8 @@ "question__title": "Immediate Food Delivery I", "question__title_slug": "immediate-food-delivery-i", "question__hide": false, - "total_acs": 54475, - "total_submitted": 66119, + "total_acs": 54770, + "total_submitted": 66542, "frontend_question_id": 1173, "is_new_question": false }, @@ -32629,8 +33204,8 @@ "question__title": "Make Array Strictly Increasing", "question__title_slug": "make-array-strictly-increasing", "question__hide": false, - "total_acs": 14069, - "total_submitted": 30921, + "total_acs": 14180, + "total_submitted": 31141, "frontend_question_id": 1187, "is_new_question": false }, @@ -32652,8 +33227,8 @@ "question__title": "Day of the Week", "question__title_slug": "day-of-the-week", "question__hide": false, - "total_acs": 53548, - "total_submitted": 93364, + "total_acs": 53920, + "total_submitted": 93972, "frontend_question_id": 1185, "is_new_question": false }, @@ -32675,8 +33250,8 @@ "question__title": "Maximum Subarray Sum with One Deletion", "question__title_slug": "maximum-subarray-sum-with-one-deletion", "question__hide": false, - "total_acs": 39025, - "total_submitted": 94081, + "total_acs": 39164, + "total_submitted": 94349, "frontend_question_id": 1186, "is_new_question": false }, @@ -32698,8 +33273,8 @@ "question__title": "Distance Between Bus Stops", "question__title_slug": "distance-between-bus-stops", "question__hide": false, - "total_acs": 50602, - "total_submitted": 93709, + "total_acs": 50830, + "total_submitted": 94125, "frontend_question_id": 1184, "is_new_question": false }, @@ -32721,8 +33296,8 @@ "question__title": "Constrained Subsequence Sum", "question__title_slug": "constrained-subsequence-sum", "question__hide": false, - "total_acs": 24185, - "total_submitted": 50800, + "total_acs": 24285, + "total_submitted": 50998, "frontend_question_id": 1425, "is_new_question": false }, @@ -32744,8 +33319,8 @@ "question__title": "Balance a Binary Search Tree", "question__title_slug": "balance-a-binary-search-tree", "question__hide": false, - "total_acs": 117850, - "total_submitted": 145992, + "total_acs": 118477, + "total_submitted": 146761, "frontend_question_id": 1382, "is_new_question": false }, @@ -32767,8 +33342,8 @@ "question__title": "Four Divisors", "question__title_slug": "four-divisors", "question__hide": false, - "total_acs": 25863, - "total_submitted": 62835, + "total_acs": 25975, + "total_submitted": 63091, "frontend_question_id": 1390, "is_new_question": false }, @@ -32790,8 +33365,8 @@ "question__title": "Reformat Date", "question__title_slug": "reformat-date", "question__hide": false, - "total_acs": 54165, - "total_submitted": 85376, + "total_acs": 54418, + "total_submitted": 85800, "frontend_question_id": 1507, "is_new_question": false }, @@ -32813,8 +33388,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": 28632, - "total_submitted": 61882, + "total_acs": 28681, + "total_submitted": 61974, "frontend_question_id": 1178, "is_new_question": false }, @@ -32836,8 +33411,8 @@ "question__title": "Can Make Palindrome from Substring", "question__title_slug": "can-make-palindrome-from-substring", "question__hide": false, - "total_acs": 23829, - "total_submitted": 62485, + "total_acs": 23885, + "total_submitted": 62660, "frontend_question_id": 1177, "is_new_question": false }, @@ -32859,8 +33434,8 @@ "question__title": "Diet Plan Performance", "question__title_slug": "diet-plan-performance", "question__hide": false, - "total_acs": 29162, - "total_submitted": 55213, + "total_acs": 29226, + "total_submitted": 55317, "frontend_question_id": 1176, "is_new_question": false }, @@ -32882,8 +33457,8 @@ "question__title": "Prime Arrangements", "question__title_slug": "prime-arrangements", "question__hide": false, - "total_acs": 25388, - "total_submitted": 46289, + "total_acs": 25496, + "total_submitted": 46444, "frontend_question_id": 1175, "is_new_question": false }, @@ -32905,8 +33480,8 @@ "question__title": "Product Price at a Given Date", "question__title_slug": "product-price-at-a-given-date", "question__hide": false, - "total_acs": 43176, - "total_submitted": 65781, + "total_acs": 43931, + "total_submitted": 67555, "frontend_question_id": 1164, "is_new_question": false }, @@ -32928,8 +33503,8 @@ "question__title": "Largest Multiple of Three", "question__title_slug": "largest-multiple-of-three", "question__hide": false, - "total_acs": 17282, - "total_submitted": 52114, + "total_acs": 17373, + "total_submitted": 52384, "frontend_question_id": 1363, "is_new_question": false }, @@ -32951,8 +33526,8 @@ "question__title": "Closest Divisors", "question__title_slug": "closest-divisors", "question__hide": false, - "total_acs": 18922, - "total_submitted": 31544, + "total_acs": 18982, + "total_submitted": 31651, "frontend_question_id": 1362, "is_new_question": false }, @@ -32974,8 +33549,8 @@ "question__title": "Validate Binary Tree Nodes", "question__title_slug": "validate-binary-tree-nodes", "question__hide": false, - "total_acs": 43078, - "total_submitted": 108387, + "total_acs": 43202, + "total_submitted": 108784, "frontend_question_id": 1361, "is_new_question": false }, @@ -32997,8 +33572,8 @@ "question__title": "Number of Days Between Two Dates", "question__title_slug": "number-of-days-between-two-dates", "question__hide": false, - "total_acs": 40092, - "total_submitted": 83165, + "total_acs": 40401, + "total_submitted": 83743, "frontend_question_id": 1360, "is_new_question": false }, @@ -33020,8 +33595,8 @@ "question__title": "Compare Strings by Frequency of the Smallest Character", "question__title_slug": "compare-strings-by-frequency-of-the-smallest-character", "question__hide": false, - "total_acs": 73024, - "total_submitted": 118624, + "total_acs": 73166, + "total_submitted": 118838, "frontend_question_id": 1170, "is_new_question": false }, @@ -33043,8 +33618,8 @@ "question__title": "Invalid Transactions", "question__title_slug": "invalid-transactions", "question__hide": false, - "total_acs": 61593, - "total_submitted": 197564, + "total_acs": 61855, + "total_submitted": 198603, "frontend_question_id": 1169, "is_new_question": false }, @@ -33066,8 +33641,8 @@ "question__title": "Web Crawler", "question__title_slug": "web-crawler", "question__hide": false, - "total_acs": 33336, - "total_submitted": 49466, + "total_acs": 33462, + "total_submitted": 49634, "frontend_question_id": 1236, "is_new_question": false }, @@ -33089,8 +33664,8 @@ "question__title": "Dinner Plate Stacks", "question__title_slug": "dinner-plate-stacks", "question__hide": false, - "total_acs": 15858, - "total_submitted": 47977, + "total_acs": 15961, + "total_submitted": 48227, "frontend_question_id": 1172, "is_new_question": false }, @@ -33112,8 +33687,8 @@ "question__title": "Market Analysis II", "question__title_slug": "market-analysis-ii", "question__hide": false, - "total_acs": 16283, - "total_submitted": 28229, + "total_acs": 16338, + "total_submitted": 28349, "frontend_question_id": 1159, "is_new_question": false }, @@ -33135,8 +33710,8 @@ "question__title": "Market Analysis I", "question__title_slug": "market-analysis-i", "question__hide": false, - "total_acs": 75747, - "total_submitted": 127173, + "total_acs": 76718, + "total_submitted": 129233, "frontend_question_id": 1158, "is_new_question": false }, @@ -33158,8 +33733,8 @@ "question__title": "Remove Zero Sum Consecutive Nodes from Linked List", "question__title_slug": "remove-zero-sum-consecutive-nodes-from-linked-list", "question__hide": false, - "total_acs": 45761, - "total_submitted": 105937, + "total_acs": 45960, + "total_submitted": 106374, "frontend_question_id": 1171, "is_new_question": false }, @@ -33181,8 +33756,8 @@ "question__title": "Maximum Number of Words You Can Type", "question__title_slug": "maximum-number-of-words-you-can-type", "question__hide": false, - "total_acs": 43662, - "total_submitted": 60898, + "total_acs": 43978, + "total_submitted": 61304, "frontend_question_id": 1935, "is_new_question": false }, @@ -33204,8 +33779,8 @@ "question__title": "Number of Dice Rolls With Target Sum", "question__title_slug": "number-of-dice-rolls-with-target-sum", "question__hide": false, - "total_acs": 180266, - "total_submitted": 334136, + "total_acs": 180891, + "total_submitted": 335151, "frontend_question_id": 1155, "is_new_question": false }, @@ -33227,8 +33802,8 @@ "question__title": "Online Majority Element In Subarray", "question__title_slug": "online-majority-element-in-subarray", "question__hide": false, - "total_acs": 14914, - "total_submitted": 35641, + "total_acs": 14960, + "total_submitted": 35769, "frontend_question_id": 1157, "is_new_question": false }, @@ -33250,8 +33825,8 @@ "question__title": "Swap For Longest Repeated Character Substring", "question__title_slug": "swap-for-longest-repeated-character-substring", "question__hide": false, - "total_acs": 27082, - "total_submitted": 60194, + "total_acs": 27165, + "total_submitted": 60461, "frontend_question_id": 1156, "is_new_question": false }, @@ -33273,8 +33848,8 @@ "question__title": "Day of the Year", "question__title_slug": "day-of-the-year", "question__hide": false, - "total_acs": 43858, - "total_submitted": 88755, + "total_acs": 44200, + "total_submitted": 89491, "frontend_question_id": 1154, "is_new_question": false }, @@ -33296,8 +33871,8 @@ "question__title": "Article Views II", "question__title_slug": "article-views-ii", "question__hide": false, - "total_acs": 32354, - "total_submitted": 68685, + "total_acs": 32452, + "total_submitted": 68912, "frontend_question_id": 1149, "is_new_question": false }, @@ -33319,8 +33894,8 @@ "question__title": "Article Views I", "question__title_slug": "article-views-i", "question__hide": false, - "total_acs": 115543, - "total_submitted": 152077, + "total_acs": 120533, + "total_submitted": 158837, "frontend_question_id": 1148, "is_new_question": false }, @@ -33342,8 +33917,8 @@ "question__title": "Rank Transform of a Matrix", "question__title_slug": "rank-transform-of-a-matrix", "question__hide": false, - "total_acs": 20066, - "total_submitted": 49112, + "total_acs": 20148, + "total_submitted": 49252, "frontend_question_id": 1632, "is_new_question": false }, @@ -33365,8 +33940,8 @@ "question__title": "Rank Transform of an Array", "question__title_slug": "rank-transform-of-an-array", "question__hide": false, - "total_acs": 83407, - "total_submitted": 140591, + "total_acs": 83938, + "total_submitted": 141407, "frontend_question_id": 1331, "is_new_question": false }, @@ -33388,8 +33963,8 @@ "question__title": "Reverse Subarray To Maximize Array Value", "question__title_slug": "reverse-subarray-to-maximize-array-value", "question__hide": false, - "total_acs": 4739, - "total_submitted": 11743, + "total_acs": 4835, + "total_submitted": 11886, "frontend_question_id": 1330, "is_new_question": false }, @@ -33411,8 +33986,8 @@ "question__title": "Deepest Leaves Sum", "question__title_slug": "deepest-leaves-sum", "question__hide": false, - "total_acs": 274243, - "total_submitted": 316667, + "total_acs": 275584, + "total_submitted": 318300, "frontend_question_id": 1302, "is_new_question": false }, @@ -33434,8 +34009,8 @@ "question__title": "Sort the Matrix Diagonally", "question__title_slug": "sort-the-matrix-diagonally", "question__hide": false, - "total_acs": 146243, - "total_submitted": 175540, + "total_acs": 146618, + "total_submitted": 176021, "frontend_question_id": 1329, "is_new_question": false }, @@ -33457,8 +34032,8 @@ "question__title": "Break a Palindrome", "question__title_slug": "break-a-palindrome", "question__hide": false, - "total_acs": 146811, - "total_submitted": 279460, + "total_acs": 147254, + "total_submitted": 280330, "frontend_question_id": 1328, "is_new_question": false }, @@ -33480,8 +34055,8 @@ "question__title": "Longest Chunked Palindrome Decomposition", "question__title_slug": "longest-chunked-palindrome-decomposition", "question__hide": false, - "total_acs": 20257, - "total_submitted": 34239, + "total_acs": 20315, + "total_submitted": 34364, "frontend_question_id": 1147, "is_new_question": false }, @@ -33503,8 +34078,8 @@ "question__title": "Longest Common Subsequence", "question__title_slug": "longest-common-subsequence", "question__hide": false, - "total_acs": 688588, - "total_submitted": 1180843, + "total_acs": 694410, + "total_submitted": 1191427, "frontend_question_id": 1143, "is_new_question": false }, @@ -33520,14 +34095,14 @@ { "stat": { "question_id": 1249, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "snapshot-array", + "question__article__has_video_solution": false, "question__title": "Snapshot Array", "question__title_slug": "snapshot-array", "question__hide": false, - "total_acs": 142394, - "total_submitted": 383753, + "total_acs": 142883, + "total_submitted": 385502, "frontend_question_id": 1146, "is_new_question": false }, @@ -33549,8 +34124,8 @@ "question__title": "Binary Tree Coloring Game", "question__title_slug": "binary-tree-coloring-game", "question__hide": false, - "total_acs": 41118, - "total_submitted": 79434, + "total_acs": 41273, + "total_submitted": 79721, "frontend_question_id": 1145, "is_new_question": false }, @@ -33572,8 +34147,8 @@ "question__title": "Decrease Elements To Make Array Zigzag", "question__title_slug": "decrease-elements-to-make-array-zigzag", "question__hide": false, - "total_acs": 17308, - "total_submitted": 36620, + "total_acs": 17349, + "total_submitted": 36731, "frontend_question_id": 1144, "is_new_question": false }, @@ -33595,8 +34170,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": 37733, - "total_submitted": 105764, + "total_acs": 37847, + "total_submitted": 106106, "frontend_question_id": 1142, "is_new_question": false }, @@ -33618,8 +34193,8 @@ "question__title": "User Activity for the Past 30 Days I", "question__title_slug": "user-activity-for-the-past-30-days-i", "question__hide": false, - "total_acs": 96795, - "total_submitted": 199723, + "total_acs": 98571, + "total_submitted": 203664, "frontend_question_id": 1141, "is_new_question": false }, @@ -33641,8 +34216,8 @@ "question__title": "Distinct Echo Substrings", "question__title_slug": "distinct-echo-substrings", "question__hide": false, - "total_acs": 14099, - "total_submitted": 28411, + "total_acs": 14135, + "total_submitted": 28479, "frontend_question_id": 1316, "is_new_question": false }, @@ -33664,8 +34239,8 @@ "question__title": "Sum of Nodes with Even-Valued Grandparent", "question__title_slug": "sum-of-nodes-with-even-valued-grandparent", "question__hide": false, - "total_acs": 129027, - "total_submitted": 150936, + "total_acs": 129513, + "total_submitted": 151483, "frontend_question_id": 1315, "is_new_question": false }, @@ -33687,8 +34262,8 @@ "question__title": "Matrix Block Sum", "question__title_slug": "matrix-block-sum", "question__hide": false, - "total_acs": 77686, - "total_submitted": 102955, + "total_acs": 78002, + "total_submitted": 103354, "frontend_question_id": 1314, "is_new_question": false }, @@ -33710,8 +34285,8 @@ "question__title": "Decompress Run-Length Encoded List", "question__title_slug": "decompress-run-length-encoded-list", "question__hide": false, - "total_acs": 226172, - "total_submitted": 263704, + "total_acs": 227139, + "total_submitted": 264936, "frontend_question_id": 1313, "is_new_question": false }, @@ -33733,8 +34308,8 @@ "question__title": "Stone Game II", "question__title_slug": "stone-game-ii", "question__hide": false, - "total_acs": 46498, - "total_submitted": 71882, + "total_acs": 46624, + "total_submitted": 72173, "frontend_question_id": 1140, "is_new_question": false }, @@ -33756,8 +34331,8 @@ "question__title": "Largest 1-Bordered Square", "question__title_slug": "largest-1-bordered-square", "question__hide": false, - "total_acs": 22233, - "total_submitted": 44297, + "total_acs": 22282, + "total_submitted": 44433, "frontend_question_id": 1139, "is_new_question": false }, @@ -33779,8 +34354,8 @@ "question__title": "Alphabet Board Path", "question__title_slug": "alphabet-board-path", "question__hide": false, - "total_acs": 46904, - "total_submitted": 90268, + "total_acs": 47052, + "total_submitted": 90539, "frontend_question_id": 1138, "is_new_question": false }, @@ -33802,8 +34377,8 @@ "question__title": "Reported Posts II", "question__title_slug": "reported-posts-ii", "question__hide": false, - "total_acs": 33276, - "total_submitted": 100712, + "total_acs": 33364, + "total_submitted": 101142, "frontend_question_id": 1132, "is_new_question": false }, @@ -33825,8 +34400,8 @@ "question__title": "N-th Tribonacci Number", "question__title_slug": "n-th-tribonacci-number", "question__hide": false, - "total_acs": 482400, - "total_submitted": 757773, + "total_acs": 486386, + "total_submitted": 764057, "frontend_question_id": 1137, "is_new_question": false }, @@ -33848,8 +34423,8 @@ "question__title": "Number of Paths with Max Score", "question__title_slug": "number-of-paths-with-max-score", "question__hide": false, - "total_acs": 11175, - "total_submitted": 28886, + "total_acs": 11223, + "total_submitted": 28979, "frontend_question_id": 1301, "is_new_question": false }, @@ -33871,8 +34446,8 @@ "question__title": "Number of Ships in a Rectangle", "question__title_slug": "number-of-ships-in-a-rectangle", "question__hide": false, - "total_acs": 24769, - "total_submitted": 35822, + "total_acs": 24903, + "total_submitted": 36022, "frontend_question_id": 1274, "is_new_question": false }, @@ -33894,8 +34469,8 @@ "question__title": "Sum of Mutated Array Closest to Target", "question__title_slug": "sum-of-mutated-array-closest-to-target", "question__hide": false, - "total_acs": 32964, - "total_submitted": 75386, + "total_acs": 33147, + "total_submitted": 75773, "frontend_question_id": 1300, "is_new_question": false }, @@ -33917,8 +34492,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": 289621, - "total_submitted": 396123, + "total_acs": 292193, + "total_submitted": 400204, "frontend_question_id": 1299, "is_new_question": false }, @@ -33940,8 +34515,8 @@ "question__title": "Maximum of Absolute Value Expression", "question__title_slug": "maximum-of-absolute-value-expression", "question__hide": false, - "total_acs": 19735, - "total_submitted": 40212, + "total_acs": 19805, + "total_submitted": 40401, "frontend_question_id": 1131, "is_new_question": false }, @@ -33963,8 +34538,8 @@ "question__title": "Shortest Path with Alternating Colors", "question__title_slug": "shortest-path-with-alternating-colors", "question__hide": false, - "total_acs": 96219, - "total_submitted": 198517, + "total_acs": 96681, + "total_submitted": 199514, "frontend_question_id": 1129, "is_new_question": false }, @@ -33986,8 +34561,8 @@ "question__title": "Minimum Cost Tree From Leaf Values", "question__title_slug": "minimum-cost-tree-from-leaf-values", "question__hide": false, - "total_acs": 84765, - "total_submitted": 124205, + "total_acs": 85020, + "total_submitted": 124590, "frontend_question_id": 1130, "is_new_question": false }, @@ -34009,8 +34584,8 @@ "question__title": "Number of Equivalent Domino Pairs", "question__title_slug": "number-of-equivalent-domino-pairs", "question__hide": false, - "total_acs": 57727, - "total_submitted": 122335, + "total_acs": 58006, + "total_submitted": 122787, "frontend_question_id": 1128, "is_new_question": false }, @@ -34032,8 +34607,8 @@ "question__title": "User Purchase Platform", "question__title_slug": "user-purchase-platform", "question__hide": false, - "total_acs": 13349, - "total_submitted": 26875, + "total_acs": 13391, + "total_submitted": 27079, "frontend_question_id": 1127, "is_new_question": false }, @@ -34055,8 +34630,8 @@ "question__title": "Active Businesses", "question__title_slug": "active-businesses", "question__hide": false, - "total_acs": 39875, - "total_submitted": 59949, + "total_acs": 40022, + "total_submitted": 60201, "frontend_question_id": 1126, "is_new_question": false }, @@ -34078,8 +34653,8 @@ "question__title": "Minimum Falling Path Sum II", "question__title_slug": "minimum-falling-path-sum-ii", "question__hide": false, - "total_acs": 41067, - "total_submitted": 70265, + "total_acs": 41245, + "total_submitted": 70649, "frontend_question_id": 1289, "is_new_question": false }, @@ -34101,8 +34676,8 @@ "question__title": "Graph Connectivity With Threshold", "question__title_slug": "graph-connectivity-with-threshold", "question__hide": false, - "total_acs": 14135, - "total_submitted": 30517, + "total_acs": 14212, + "total_submitted": 30644, "frontend_question_id": 1627, "is_new_question": false }, @@ -34124,8 +34699,8 @@ "question__title": "Remove Covered Intervals", "question__title_slug": "remove-covered-intervals", "question__hide": false, - "total_acs": 107651, - "total_submitted": 188955, + "total_acs": 107895, + "total_submitted": 189453, "frontend_question_id": 1288, "is_new_question": false }, @@ -34147,8 +34722,8 @@ "question__title": "Element Appearing More Than 25% In Sorted Array", "question__title_slug": "element-appearing-more-than-25-in-sorted-array", "question__hide": false, - "total_acs": 77583, - "total_submitted": 130756, + "total_acs": 77968, + "total_submitted": 131429, "frontend_question_id": 1287, "is_new_question": false }, @@ -34164,14 +34739,14 @@ { "stat": { "question_id": 1220, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "smallest-sufficient-team", + "question__article__has_video_solution": false, "question__title": "Smallest Sufficient Team", "question__title_slug": "smallest-sufficient-team", "question__hide": false, - "total_acs": 19289, - "total_submitted": 41041, + "total_acs": 19425, + "total_submitted": 41297, "frontend_question_id": 1125, "is_new_question": false }, @@ -34193,8 +34768,8 @@ "question__title": "Longest Well-Performing Interval", "question__title_slug": "longest-well-performing-interval", "question__hide": false, - "total_acs": 26763, - "total_submitted": 77398, + "total_acs": 26858, + "total_submitted": 77650, "frontend_question_id": 1124, "is_new_question": false }, @@ -34216,8 +34791,8 @@ "question__title": "Lowest Common Ancestor of Deepest Leaves", "question__title_slug": "lowest-common-ancestor-of-deepest-leaves", "question__hide": false, - "total_acs": 90721, - "total_submitted": 127840, + "total_acs": 90938, + "total_submitted": 128119, "frontend_question_id": 1123, "is_new_question": false }, @@ -34239,8 +34814,8 @@ "question__title": "Relative Sort Array", "question__title_slug": "relative-sort-array", "question__hide": false, - "total_acs": 156059, - "total_submitted": 227270, + "total_acs": 156766, + "total_submitted": 228318, "frontend_question_id": 1122, "is_new_question": false }, @@ -34262,8 +34837,8 @@ "question__title": "Print Zero Even Odd", "question__title_slug": "print-zero-even-odd", "question__hide": false, - "total_acs": 39898, - "total_submitted": 66200, + "total_acs": 40142, + "total_submitted": 66537, "frontend_question_id": 1116, "is_new_question": false }, @@ -34285,8 +34860,8 @@ "question__title": "Reported Posts", "question__title_slug": "reported-posts", "question__hide": false, - "total_acs": 41532, - "total_submitted": 63652, + "total_acs": 41685, + "total_submitted": 63931, "frontend_question_id": 1113, "is_new_question": false }, @@ -34308,8 +34883,8 @@ "question__title": "Highest Grade For Each Student", "question__title_slug": "highest-grade-for-each-student", "question__hide": false, - "total_acs": 49791, - "total_submitted": 69139, + "total_acs": 50169, + "total_submitted": 69825, "frontend_question_id": 1112, "is_new_question": false }, @@ -34331,8 +34906,8 @@ "question__title": "Handshakes That Don't Cross", "question__title_slug": "handshakes-that-dont-cross", "question__hide": false, - "total_acs": 9322, - "total_submitted": 15424, + "total_acs": 9379, + "total_submitted": 15505, "frontend_question_id": 1259, "is_new_question": false }, @@ -34354,8 +34929,8 @@ "question__title": "Sequential Digits", "question__title_slug": "sequential-digits", "question__hide": false, - "total_acs": 89532, - "total_submitted": 146068, + "total_acs": 89656, + "total_submitted": 146389, "frontend_question_id": 1291, "is_new_question": false }, @@ -34377,8 +34952,8 @@ "question__title": "Iterator for Combination", "question__title_slug": "iterator-for-combination", "question__hide": false, - "total_acs": 67880, - "total_submitted": 92577, + "total_acs": 67981, + "total_submitted": 92761, "frontend_question_id": 1286, "is_new_question": false }, @@ -34400,8 +34975,8 @@ "question__title": "Mean of Array After Removing Some Elements", "question__title_slug": "mean-of-array-after-removing-some-elements", "question__hide": false, - "total_acs": 45240, - "total_submitted": 68574, + "total_acs": 45555, + "total_submitted": 69024, "frontend_question_id": 1619, "is_new_question": false }, @@ -34423,8 +34998,8 @@ "question__title": "Design Bounded Blocking Queue", "question__title_slug": "design-bounded-blocking-queue", "question__hide": false, - "total_acs": 43364, - "total_submitted": 59606, + "total_acs": 43527, + "total_submitted": 59851, "frontend_question_id": 1188, "is_new_question": false }, @@ -34446,8 +35021,8 @@ "question__title": "Maximum Nesting Depth of Two Valid Parentheses Strings", "question__title_slug": "maximum-nesting-depth-of-two-valid-parentheses-strings", "question__hide": false, - "total_acs": 23077, - "total_submitted": 31634, + "total_acs": 23126, + "total_submitted": 31724, "frontend_question_id": 1111, "is_new_question": false }, @@ -34469,8 +35044,8 @@ "question__title": "Delete Nodes And Return Forest", "question__title_slug": "delete-nodes-and-return-forest", "question__hide": false, - "total_acs": 181067, - "total_submitted": 261373, + "total_acs": 181759, + "total_submitted": 262369, "frontend_question_id": 1110, "is_new_question": false }, @@ -34492,8 +35067,8 @@ "question__title": "Corporate Flight Bookings", "question__title_slug": "corporate-flight-bookings", "question__hide": false, - "total_acs": 52094, - "total_submitted": 85851, + "total_acs": 52356, + "total_submitted": 86231, "frontend_question_id": 1109, "is_new_question": false }, @@ -34515,8 +35090,8 @@ "question__title": "Defanging an IP Address", "question__title_slug": "defanging-an-ip-address", "question__hide": false, - "total_acs": 516189, - "total_submitted": 579731, + "total_acs": 519173, + "total_submitted": 583080, "frontend_question_id": 1108, "is_new_question": false }, @@ -34538,8 +35113,8 @@ "question__title": "New Users Daily Count", "question__title_slug": "new-users-daily-count", "question__hide": false, - "total_acs": 31070, - "total_submitted": 68911, + "total_acs": 31163, + "total_submitted": 69168, "frontend_question_id": 1107, "is_new_question": false }, @@ -34561,8 +35136,8 @@ "question__title": "Print in Order", "question__title_slug": "print-in-order", "question__hide": false, - "total_acs": 129624, - "total_submitted": 189341, + "total_acs": 130279, + "total_submitted": 190251, "frontend_question_id": 1114, "is_new_question": false }, @@ -34584,8 +35159,8 @@ "question__title": "Palindrome Removal", "question__title_slug": "palindrome-removal", "question__hide": false, - "total_acs": 9968, - "total_submitted": 21528, + "total_acs": 9979, + "total_submitted": 21550, "frontend_question_id": 1246, "is_new_question": false }, @@ -34607,8 +35182,8 @@ "question__title": "Delete Tree Nodes", "question__title_slug": "delete-tree-nodes", "question__hide": false, - "total_acs": 9445, - "total_submitted": 15450, + "total_acs": 9464, + "total_submitted": 15475, "frontend_question_id": 1273, "is_new_question": false }, @@ -34630,8 +35205,8 @@ "question__title": "Remove Interval", "question__title_slug": "remove-interval", "question__hide": false, - "total_acs": 27231, - "total_submitted": 42771, + "total_acs": 27325, + "total_submitted": 42888, "frontend_question_id": 1272, "is_new_question": false }, @@ -34653,8 +35228,8 @@ "question__title": "Hexspeak", "question__title_slug": "hexspeak", "question__hide": false, - "total_acs": 9407, - "total_submitted": 16451, + "total_acs": 9436, + "total_submitted": 16502, "frontend_question_id": 1271, "is_new_question": false }, @@ -34676,8 +35251,8 @@ "question__title": "Unpopular Books", "question__title_slug": "unpopular-books", "question__hide": false, - "total_acs": 35084, - "total_submitted": 79740, + "total_acs": 35210, + "total_submitted": 80086, "frontend_question_id": 1098, "is_new_question": false }, @@ -34699,8 +35274,8 @@ "question__title": "Parsing A Boolean Expression", "question__title_slug": "parsing-a-boolean-expression", "question__hide": false, - "total_acs": 22812, - "total_submitted": 39041, + "total_acs": 22918, + "total_submitted": 39212, "frontend_question_id": 1106, "is_new_question": false }, @@ -34722,8 +35297,8 @@ "question__title": "Filling Bookcase Shelves", "question__title_slug": "filling-bookcase-shelves", "question__hide": false, - "total_acs": 46028, - "total_submitted": 77423, + "total_acs": 46208, + "total_submitted": 77678, "frontend_question_id": 1105, "is_new_question": false }, @@ -34745,8 +35320,8 @@ "question__title": "Distribute Candies to People", "question__title_slug": "distribute-candies-to-people", "question__hide": false, - "total_acs": 76239, - "total_submitted": 118494, + "total_acs": 76470, + "total_submitted": 118832, "frontend_question_id": 1103, "is_new_question": false }, @@ -34768,8 +35343,8 @@ "question__title": "Path In Zigzag Labelled Binary Tree", "question__title_slug": "path-in-zigzag-labelled-binary-tree", "question__hide": false, - "total_acs": 39506, - "total_submitted": 52605, + "total_acs": 39634, + "total_submitted": 52788, "frontend_question_id": 1104, "is_new_question": false }, @@ -34791,8 +35366,8 @@ "question__title": "Game Play Analysis V", "question__title_slug": "game-play-analysis-v", "question__hide": false, - "total_acs": 19984, - "total_submitted": 37573, + "total_acs": 20074, + "total_submitted": 37791, "frontend_question_id": 1097, "is_new_question": false }, @@ -34814,8 +35389,8 @@ "question__title": "Divide Chocolate", "question__title_slug": "divide-chocolate", "question__hide": false, - "total_acs": 45348, - "total_submitted": 78875, + "total_acs": 45557, + "total_submitted": 79154, "frontend_question_id": 1231, "is_new_question": false }, @@ -34837,8 +35412,8 @@ "question__title": "Synonymous Sentences", "question__title_slug": "synonymous-sentences", "question__hide": false, - "total_acs": 19404, - "total_submitted": 34248, + "total_acs": 19475, + "total_submitted": 34362, "frontend_question_id": 1258, "is_new_question": false }, @@ -34860,8 +35435,8 @@ "question__title": "Smallest Common Region", "question__title_slug": "smallest-common-region", "question__hide": false, - "total_acs": 19799, - "total_submitted": 30713, + "total_acs": 19870, + "total_submitted": 30802, "frontend_question_id": 1257, "is_new_question": false }, @@ -34883,8 +35458,8 @@ "question__title": "Encode Number", "question__title_slug": "encode-number", "question__hide": false, - "total_acs": 7104, - "total_submitted": 10172, + "total_acs": 7117, + "total_submitted": 10208, "frontend_question_id": 1256, "is_new_question": false }, @@ -34906,8 +35481,8 @@ "question__title": "Brace Expansion II", "question__title_slug": "brace-expansion-ii", "question__hide": false, - "total_acs": 22364, - "total_submitted": 35228, + "total_acs": 22453, + "total_submitted": 35356, "frontend_question_id": 1096, "is_new_question": false }, @@ -34929,8 +35504,8 @@ "question__title": "Print FooBar Alternately", "question__title_slug": "print-foobar-alternately", "question__hide": false, - "total_acs": 66040, - "total_submitted": 105233, + "total_acs": 66467, + "total_submitted": 105723, "frontend_question_id": 1115, "is_new_question": false }, @@ -34952,8 +35527,8 @@ "question__title": "Building H2O", "question__title_slug": "building-h2o", "question__hide": false, - "total_acs": 39591, - "total_submitted": 71026, + "total_acs": 39827, + "total_submitted": 71460, "frontend_question_id": 1117, "is_new_question": false }, @@ -34975,8 +35550,8 @@ "question__title": "Find in Mountain Array", "question__title_slug": "find-in-mountain-array", "question__hide": false, - "total_acs": 60172, - "total_submitted": 170226, + "total_acs": 60490, + "total_submitted": 171298, "frontend_question_id": 1095, "is_new_question": false }, @@ -34998,8 +35573,8 @@ "question__title": "Car Pooling", "question__title_slug": "car-pooling", "question__hide": false, - "total_acs": 191175, - "total_submitted": 336507, + "total_acs": 191831, + "total_submitted": 337838, "frontend_question_id": 1094, "is_new_question": false }, @@ -35021,8 +35596,8 @@ "question__title": "Statistics from a Large Sample", "question__title_slug": "statistics-from-a-large-sample", "question__hide": false, - "total_acs": 16117, - "total_submitted": 37224, + "total_acs": 16191, + "total_submitted": 37520, "frontend_question_id": 1093, "is_new_question": false }, @@ -35044,8 +35619,8 @@ "question__title": "Game Play Analysis IV", "question__title_slug": "game-play-analysis-iv", "question__hide": false, - "total_acs": 57540, - "total_submitted": 136737, + "total_acs": 58826, + "total_submitted": 141094, "frontend_question_id": 550, "is_new_question": false }, @@ -35067,8 +35642,8 @@ "question__title": "Game Play Analysis III", "question__title_slug": "game-play-analysis-iii", "question__hide": false, - "total_acs": 64621, - "total_submitted": 79314, + "total_acs": 64925, + "total_submitted": 79676, "frontend_question_id": 534, "is_new_question": false }, @@ -35090,8 +35665,8 @@ "question__title": "Game Play Analysis II", "question__title_slug": "game-play-analysis-ii", "question__hide": false, - "total_acs": 73928, - "total_submitted": 140689, + "total_acs": 74284, + "total_submitted": 141409, "frontend_question_id": 512, "is_new_question": false }, @@ -35113,8 +35688,8 @@ "question__title": "Game Play Analysis I", "question__title_slug": "game-play-analysis-i", "question__hide": false, - "total_acs": 177432, - "total_submitted": 234838, + "total_acs": 180298, + "total_submitted": 239054, "frontend_question_id": 511, "is_new_question": false }, @@ -35136,8 +35711,8 @@ "question__title": "Valid Palindrome III", "question__title_slug": "valid-palindrome-iii", "question__hide": false, - "total_acs": 43728, - "total_submitted": 86693, + "total_acs": 43816, + "total_submitted": 86889, "frontend_question_id": 1216, "is_new_question": false }, @@ -35159,8 +35734,8 @@ "question__title": "Tree Diameter", "question__title_slug": "tree-diameter", "question__hide": false, - "total_acs": 30395, - "total_submitted": 49457, + "total_acs": 30465, + "total_submitted": 49594, "frontend_question_id": 1245, "is_new_question": false }, @@ -35182,8 +35757,8 @@ "question__title": "Design A Leaderboard", "question__title_slug": "design-a-leaderboard", "question__hide": false, - "total_acs": 61390, - "total_submitted": 89535, + "total_acs": 61646, + "total_submitted": 89964, "frontend_question_id": 1244, "is_new_question": false }, @@ -35205,8 +35780,8 @@ "question__title": "Array Transformation", "question__title_slug": "array-transformation", "question__hide": false, - "total_acs": 11765, - "total_submitted": 23016, + "total_acs": 11820, + "total_submitted": 23090, "frontend_question_id": 1243, "is_new_question": false }, @@ -35228,8 +35803,8 @@ "question__title": "Sales Analysis III", "question__title_slug": "sales-analysis-iii", "question__hide": false, - "total_acs": 99914, - "total_submitted": 205573, + "total_acs": 101131, + "total_submitted": 208776, "frontend_question_id": 1084, "is_new_question": false }, @@ -35251,8 +35826,8 @@ "question__title": "Sales Analysis II", "question__title_slug": "sales-analysis-ii", "question__hide": false, - "total_acs": 52053, - "total_submitted": 104408, + "total_acs": 52227, + "total_submitted": 104853, "frontend_question_id": 1083, "is_new_question": false }, @@ -35274,8 +35849,8 @@ "question__title": "Sales Analysis I", "question__title_slug": "sales-analysis-i", "question__hide": false, - "total_acs": 52121, - "total_submitted": 69713, + "total_acs": 52303, + "total_submitted": 70031, "frontend_question_id": 1082, "is_new_question": false }, @@ -35297,8 +35872,8 @@ "question__title": "Shortest Path in Binary Matrix", "question__title_slug": "shortest-path-in-binary-matrix", "question__hide": false, - "total_acs": 302654, - "total_submitted": 675907, + "total_acs": 304101, + "total_submitted": 679023, "frontend_question_id": 1091, "is_new_question": false }, @@ -35320,8 +35895,8 @@ "question__title": "Shortest Common Supersequence ", "question__title_slug": "shortest-common-supersequence", "question__hide": false, - "total_acs": 74941, - "total_submitted": 129242, + "total_acs": 75605, + "total_submitted": 130328, "frontend_question_id": 1092, "is_new_question": false }, @@ -35343,8 +35918,8 @@ "question__title": "Largest Values From Labels", "question__title_slug": "largest-values-from-labels", "question__hide": false, - "total_acs": 33198, - "total_submitted": 54362, + "total_acs": 33326, + "total_submitted": 54555, "frontend_question_id": 1090, "is_new_question": false }, @@ -35366,8 +35941,8 @@ "question__title": "Duplicate Zeros", "question__title_slug": "duplicate-zeros", "question__hide": false, - "total_acs": 347965, - "total_submitted": 675107, + "total_acs": 349699, + "total_submitted": 678436, "frontend_question_id": 1089, "is_new_question": false }, @@ -35389,8 +35964,8 @@ "question__title": "Minimum Time to Build Blocks", "question__title_slug": "minimum-time-to-build-blocks", "question__hide": false, - "total_acs": 3789, - "total_submitted": 9246, + "total_acs": 3797, + "total_submitted": 9260, "frontend_question_id": 1199, "is_new_question": false }, @@ -35412,8 +35987,8 @@ "question__title": "Toss Strange Coins", "question__title_slug": "toss-strange-coins", "question__hide": false, - "total_acs": 12843, - "total_submitted": 23701, + "total_acs": 12888, + "total_submitted": 23786, "frontend_question_id": 1230, "is_new_question": false }, @@ -35435,8 +36010,8 @@ "question__title": "Meeting Scheduler", "question__title_slug": "meeting-scheduler", "question__hide": false, - "total_acs": 71999, - "total_submitted": 130296, + "total_acs": 72237, + "total_submitted": 130724, "frontend_question_id": 1229, "is_new_question": false }, @@ -35458,8 +36033,8 @@ "question__title": "Missing Number In Arithmetic Progression", "question__title_slug": "missing-number-in-arithmetic-progression", "question__hide": false, - "total_acs": 23643, - "total_submitted": 45964, + "total_acs": 23737, + "total_submitted": 46123, "frontend_question_id": 1228, "is_new_question": false }, @@ -35481,8 +36056,8 @@ "question__title": "Project Employees III", "question__title_slug": "project-employees-iii", "question__hide": false, - "total_acs": 47866, - "total_submitted": 62130, + "total_acs": 48109, + "total_submitted": 62455, "frontend_question_id": 1077, "is_new_question": false }, @@ -35504,8 +36079,8 @@ "question__title": "Project Employees II", "question__title_slug": "project-employees-ii", "question__hide": false, - "total_acs": 50779, - "total_submitted": 101318, + "total_acs": 50990, + "total_submitted": 101789, "frontend_question_id": 1076, "is_new_question": false }, @@ -35527,8 +36102,8 @@ "question__title": "Project Employees I", "question__title_slug": "project-employees-i", "question__hide": false, - "total_acs": 50914, - "total_submitted": 77671, + "total_acs": 52963, + "total_submitted": 81050, "frontend_question_id": 1075, "is_new_question": false }, @@ -35550,8 +36125,8 @@ "question__title": "Letter Tile Possibilities", "question__title_slug": "letter-tile-possibilities", "question__hide": false, - "total_acs": 84734, - "total_submitted": 111474, + "total_acs": 85059, + "total_submitted": 111929, "frontend_question_id": 1079, "is_new_question": false }, @@ -35573,8 +36148,8 @@ "question__title": "Smallest Subsequence of Distinct Characters", "question__title_slug": "smallest-subsequence-of-distinct-characters", "question__hide": false, - "total_acs": 50146, - "total_submitted": 86558, + "total_acs": 50370, + "total_submitted": 86903, "frontend_question_id": 1081, "is_new_question": false }, @@ -35596,8 +36171,8 @@ "question__title": "Insufficient Nodes in Root to Leaf Paths", "question__title_slug": "insufficient-nodes-in-root-to-leaf-paths", "question__hide": false, - "total_acs": 31488, - "total_submitted": 58766, + "total_acs": 31596, + "total_submitted": 58920, "frontend_question_id": 1080, "is_new_question": false }, @@ -35619,8 +36194,8 @@ "question__title": "Occurrences After Bigram", "question__title_slug": "occurrences-after-bigram", "question__hide": false, - "total_acs": 61951, - "total_submitted": 97447, + "total_acs": 62190, + "total_submitted": 97825, "frontend_question_id": 1078, "is_new_question": false }, @@ -35642,8 +36217,8 @@ "question__title": "Product Sales Analysis III", "question__title_slug": "product-sales-analysis-iii", "question__hide": false, - "total_acs": 39461, - "total_submitted": 81817, + "total_acs": 40493, + "total_submitted": 84425, "frontend_question_id": 1070, "is_new_question": false }, @@ -35665,8 +36240,8 @@ "question__title": "Product Sales Analysis II", "question__title_slug": "product-sales-analysis-ii", "question__hide": false, - "total_acs": 47939, - "total_submitted": 58533, + "total_acs": 48092, + "total_submitted": 58735, "frontend_question_id": 1069, "is_new_question": false }, @@ -35688,8 +36263,8 @@ "question__title": "Product Sales Analysis I", "question__title_slug": "product-sales-analysis-i", "question__hide": false, - "total_acs": 65751, - "total_submitted": 81278, + "total_acs": 69945, + "total_submitted": 86096, "frontend_question_id": 1068, "is_new_question": false }, @@ -35711,8 +36286,8 @@ "question__title": "Maximum Number of Ones", "question__title_slug": "maximum-number-of-ones", "question__hide": false, - "total_acs": 2522, - "total_submitted": 4109, + "total_acs": 2541, + "total_submitted": 4139, "frontend_question_id": 1183, "is_new_question": false }, @@ -35734,8 +36309,8 @@ "question__title": "Stepping Numbers", "question__title_slug": "stepping-numbers", "question__hide": false, - "total_acs": 8388, - "total_submitted": 18099, + "total_acs": 8411, + "total_submitted": 18138, "frontend_question_id": 1215, "is_new_question": false }, @@ -35757,8 +36332,8 @@ "question__title": "Two Sum BSTs", "question__title_slug": "two-sum-bsts", "question__hide": false, - "total_acs": 39334, - "total_submitted": 59517, + "total_acs": 39454, + "total_submitted": 59688, "frontend_question_id": 1214, "is_new_question": false }, @@ -35780,8 +36355,8 @@ "question__title": "Intersection of Three Sorted Arrays", "question__title_slug": "intersection-of-three-sorted-arrays", "question__hide": false, - "total_acs": 77742, - "total_submitted": 97274, + "total_acs": 77898, + "total_submitted": 97463, "frontend_question_id": 1213, "is_new_question": false }, @@ -35803,8 +36378,8 @@ "question__title": "Adding Two Negabinary Numbers", "question__title_slug": "adding-two-negabinary-numbers", "question__hide": false, - "total_acs": 15388, - "total_submitted": 42368, + "total_acs": 15459, + "total_submitted": 42509, "frontend_question_id": 1073, "is_new_question": false }, @@ -35826,8 +36401,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": 20018, - "total_submitted": 31544, + "total_acs": 20176, + "total_submitted": 31811, "frontend_question_id": 1072, "is_new_question": false }, @@ -35849,8 +36424,8 @@ "question__title": "Greatest Common Divisor of Strings", "question__title_slug": "greatest-common-divisor-of-strings", "question__hide": false, - "total_acs": 165100, - "total_submitted": 292160, + "total_acs": 168498, + "total_submitted": 299349, "frontend_question_id": 1071, "is_new_question": false }, @@ -35872,8 +36447,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": 86762, - "total_submitted": 124758, + "total_acs": 86900, + "total_submitted": 124968, "frontend_question_id": 1074, "is_new_question": false }, @@ -35895,8 +36470,8 @@ "question__title": "Optimize Water Distribution in a Village", "question__title_slug": "optimize-water-distribution-in-a-village", "question__hide": false, - "total_acs": 39706, - "total_submitted": 61515, + "total_acs": 39892, + "total_submitted": 61813, "frontend_question_id": 1168, "is_new_question": false }, @@ -35918,8 +36493,8 @@ "question__title": "Find Smallest Common Element in All Rows", "question__title_slug": "find-smallest-common-element-in-all-rows", "question__hide": false, - "total_acs": 38616, - "total_submitted": 50430, + "total_acs": 38802, + "total_submitted": 50694, "frontend_question_id": 1198, "is_new_question": false }, @@ -35941,8 +36516,8 @@ "question__title": "Minimum Knight Moves", "question__title_slug": "minimum-knight-moves", "question__hide": false, - "total_acs": 134719, - "total_submitted": 339549, + "total_acs": 135038, + "total_submitted": 340331, "frontend_question_id": 1197, "is_new_question": false }, @@ -35964,8 +36539,8 @@ "question__title": "How Many Apples Can You Put into the Basket", "question__title_slug": "how-many-apples-can-you-put-into-the-basket", "question__hide": false, - "total_acs": 25822, - "total_submitted": 38635, + "total_acs": 26013, + "total_submitted": 38900, "frontend_question_id": 1196, "is_new_question": false }, @@ -35987,8 +36562,8 @@ "question__title": "Distant Barcodes", "question__title_slug": "distant-barcodes", "question__hide": false, - "total_acs": 36884, - "total_submitted": 80396, + "total_acs": 37130, + "total_submitted": 80806, "frontend_question_id": 1054, "is_new_question": false }, @@ -36010,8 +36585,8 @@ "question__title": "Previous Permutation With One Swap", "question__title_slug": "previous-permutation-with-one-swap", "question__hide": false, - "total_acs": 35848, - "total_submitted": 71166, + "total_acs": 35948, + "total_submitted": 71419, "frontend_question_id": 1053, "is_new_question": false }, @@ -36033,8 +36608,8 @@ "question__title": "Grumpy Bookstore Owner", "question__title_slug": "grumpy-bookstore-owner", "question__hide": false, - "total_acs": 63184, - "total_submitted": 110665, + "total_acs": 63414, + "total_submitted": 111039, "frontend_question_id": 1052, "is_new_question": false }, @@ -36056,8 +36631,8 @@ "question__title": "Height Checker", "question__title_slug": "height-checker", "question__hide": false, - "total_acs": 270362, - "total_submitted": 357266, + "total_acs": 272036, + "total_submitted": 359400, "frontend_question_id": 1051, "is_new_question": false }, @@ -36079,8 +36654,8 @@ "question__title": "Actors and Directors Who Cooperated At Least Three Times", "question__title_slug": "actors-and-directors-who-cooperated-at-least-three-times", "question__hide": false, - "total_acs": 116101, - "total_submitted": 165138, + "total_acs": 117870, + "total_submitted": 167956, "frontend_question_id": 1050, "is_new_question": false }, @@ -36102,8 +36677,8 @@ "question__title": "Customers Who Bought All Products", "question__title_slug": "customers-who-bought-all-products", "question__hide": false, - "total_acs": 52562, - "total_submitted": 79882, + "total_acs": 53882, + "total_submitted": 82273, "frontend_question_id": 1045, "is_new_question": false }, @@ -36125,8 +36700,8 @@ "question__title": "Shortest Distance to Target Color", "question__title_slug": "shortest-distance-to-target-color", "question__hide": false, - "total_acs": 33855, - "total_submitted": 61086, + "total_acs": 33952, + "total_submitted": 61239, "frontend_question_id": 1182, "is_new_question": false }, @@ -36148,8 +36723,8 @@ "question__title": "Last Substring in Lexicographical Order", "question__title_slug": "last-substring-in-lexicographical-order", "question__hide": false, - "total_acs": 31873, - "total_submitted": 91627, + "total_acs": 31914, + "total_submitted": 91759, "frontend_question_id": 1163, "is_new_question": false }, @@ -36171,8 +36746,8 @@ "question__title": "Before and After Puzzle", "question__title_slug": "before-and-after-puzzle", "question__hide": false, - "total_acs": 9274, - "total_submitted": 20459, + "total_acs": 9278, + "total_submitted": 20465, "frontend_question_id": 1181, "is_new_question": false }, @@ -36194,8 +36769,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": 23837, - "total_submitted": 30174, + "total_acs": 23913, + "total_submitted": 30270, "frontend_question_id": 1180, "is_new_question": false }, @@ -36217,8 +36792,8 @@ "question__title": "Last Stone Weight II", "question__title_slug": "last-stone-weight-ii", "question__hide": false, - "total_acs": 69450, - "total_submitted": 130228, + "total_acs": 69782, + "total_submitted": 130753, "frontend_question_id": 1049, "is_new_question": false }, @@ -36240,8 +36815,8 @@ "question__title": "Longest String Chain", "question__title_slug": "longest-string-chain", "question__hide": false, - "total_acs": 305938, - "total_submitted": 516125, + "total_acs": 306713, + "total_submitted": 517433, "frontend_question_id": 1048, "is_new_question": false }, @@ -36263,8 +36838,8 @@ "question__title": "Remove All Adjacent Duplicates In String", "question__title_slug": "remove-all-adjacent-duplicates-in-string", "question__hide": false, - "total_acs": 443799, - "total_submitted": 638873, + "total_acs": 446076, + "total_submitted": 642558, "frontend_question_id": 1047, "is_new_question": false }, @@ -36286,8 +36861,8 @@ "question__title": "Last Stone Weight", "question__title_slug": "last-stone-weight", "question__hide": false, - "total_acs": 472878, - "total_submitted": 722238, + "total_acs": 476101, + "total_submitted": 727153, "frontend_question_id": 1046, "is_new_question": false }, @@ -36309,8 +36884,8 @@ "question__title": "Minimum Cost to Connect Sticks", "question__title_slug": "minimum-cost-to-connect-sticks", "question__hide": false, - "total_acs": 104213, - "total_submitted": 152104, + "total_acs": 104484, + "total_submitted": 152426, "frontend_question_id": 1167, "is_new_question": false }, @@ -36332,8 +36907,8 @@ "question__title": "Design File System", "question__title_slug": "design-file-system", "question__hide": false, - "total_acs": 42341, - "total_submitted": 68164, + "total_acs": 42535, + "total_submitted": 68520, "frontend_question_id": 1166, "is_new_question": false }, @@ -36355,8 +36930,8 @@ "question__title": "String Transforms Into Another String", "question__title_slug": "string-transforms-into-another-string", "question__hide": false, - "total_acs": 50576, - "total_submitted": 143368, + "total_acs": 50606, + "total_submitted": 143484, "frontend_question_id": 1153, "is_new_question": false }, @@ -36378,8 +36953,8 @@ "question__title": "Single-Row Keyboard", "question__title_slug": "single-row-keyboard", "question__hide": false, - "total_acs": 71815, - "total_submitted": 82976, + "total_acs": 72023, + "total_submitted": 83197, "frontend_question_id": 1165, "is_new_question": false }, @@ -36401,8 +36976,8 @@ "question__title": "Longest Duplicate Substring", "question__title_slug": "longest-duplicate-substring", "question__hide": false, - "total_acs": 62121, - "total_submitted": 203199, + "total_acs": 62224, + "total_submitted": 203609, "frontend_question_id": 1044, "is_new_question": false }, @@ -36424,8 +36999,8 @@ "question__title": "Partition Array for Maximum Sum", "question__title_slug": "partition-array-for-maximum-sum", "question__hide": false, - "total_acs": 71136, - "total_submitted": 99283, + "total_acs": 71603, + "total_submitted": 99891, "frontend_question_id": 1043, "is_new_question": false }, @@ -36447,8 +37022,8 @@ "question__title": "Flower Planting With No Adjacent", "question__title_slug": "flower-planting-with-no-adjacent", "question__hide": false, - "total_acs": 66664, - "total_submitted": 131621, + "total_acs": 66907, + "total_submitted": 132107, "frontend_question_id": 1042, "is_new_question": false }, @@ -36470,8 +37045,8 @@ "question__title": "Robot Bounded In Circle", "question__title_slug": "robot-bounded-in-circle", "question__hide": false, - "total_acs": 209251, - "total_submitted": 378209, + "total_acs": 209581, + "total_submitted": 378693, "frontend_question_id": 1041, "is_new_question": false }, @@ -36493,8 +37068,8 @@ "question__title": "Divide Array Into Increasing Sequences", "question__title_slug": "divide-array-into-increasing-sequences", "question__hide": false, - "total_acs": 4396, - "total_submitted": 7252, + "total_acs": 4415, + "total_submitted": 7277, "frontend_question_id": 1121, "is_new_question": false }, @@ -36516,8 +37091,8 @@ "question__title": "As Far from Land as Possible", "question__title_slug": "as-far-from-land-as-possible", "question__hide": false, - "total_acs": 137900, - "total_submitted": 265879, + "total_acs": 138454, + "total_submitted": 267078, "frontend_question_id": 1162, "is_new_question": false }, @@ -36539,8 +37114,8 @@ "question__title": "Maximum Level Sum of a Binary Tree", "question__title_slug": "maximum-level-sum-of-a-binary-tree", "question__hide": false, - "total_acs": 127835, - "total_submitted": 193680, + "total_acs": 128791, + "total_submitted": 195092, "frontend_question_id": 1161, "is_new_question": false }, @@ -36562,8 +37137,8 @@ "question__title": "Valid Boomerang", "question__title_slug": "valid-boomerang", "question__hide": false, - "total_acs": 41611, - "total_submitted": 112576, + "total_acs": 41910, + "total_submitted": 113523, "frontend_question_id": 1037, "is_new_question": false }, @@ -36585,8 +37160,8 @@ "question__title": "Binary Search Tree to Greater Sum Tree", "question__title_slug": "binary-search-tree-to-greater-sum-tree", "question__hide": false, - "total_acs": 150577, - "total_submitted": 176007, + "total_acs": 151183, + "total_submitted": 176742, "frontend_question_id": 1038, "is_new_question": false }, @@ -36608,8 +37183,8 @@ "question__title": "Moving Stones Until Consecutive II", "question__title_slug": "moving-stones-until-consecutive-ii", "question__hide": false, - "total_acs": 8809, - "total_submitted": 15699, + "total_acs": 8847, + "total_submitted": 15752, "frontend_question_id": 1040, "is_new_question": false }, @@ -36631,8 +37206,8 @@ "question__title": "Find Words That Can Be Formed by Characters", "question__title_slug": "find-words-that-can-be-formed-by-characters", "question__hide": false, - "total_acs": 144574, - "total_submitted": 214580, + "total_acs": 145119, + "total_submitted": 215399, "frontend_question_id": 1160, "is_new_question": false }, @@ -36654,8 +37229,8 @@ "question__title": "Minimum Score Triangulation of Polygon", "question__title_slug": "minimum-score-triangulation-of-polygon", "question__hide": false, - "total_acs": 34213, - "total_submitted": 61412, + "total_acs": 34483, + "total_submitted": 61832, "frontend_question_id": 1039, "is_new_question": false }, @@ -36677,8 +37252,8 @@ "question__title": "Analyze User Website Visit Pattern", "question__title_slug": "analyze-user-website-visit-pattern", "question__hide": false, - "total_acs": 87497, - "total_submitted": 203145, + "total_acs": 87606, + "total_submitted": 203434, "frontend_question_id": 1152, "is_new_question": false }, @@ -36700,8 +37275,8 @@ "question__title": "Minimum Swaps to Group All 1's Together", "question__title_slug": "minimum-swaps-to-group-all-1s-together", "question__hide": false, - "total_acs": 55596, - "total_submitted": 91273, + "total_acs": 55698, + "total_submitted": 91444, "frontend_question_id": 1151, "is_new_question": false }, @@ -36723,8 +37298,8 @@ "question__title": "Escape a Large Maze", "question__title_slug": "escape-a-large-maze", "question__hide": false, - "total_acs": 18138, - "total_submitted": 53102, + "total_acs": 18286, + "total_submitted": 53505, "frontend_question_id": 1036, "is_new_question": false }, @@ -36746,8 +37321,8 @@ "question__title": "Uncrossed Lines", "question__title_slug": "uncrossed-lines", "question__hide": false, - "total_acs": 78900, - "total_submitted": 133257, + "total_acs": 131144, + "total_submitted": 211644, "frontend_question_id": 1035, "is_new_question": false }, @@ -36769,8 +37344,8 @@ "question__title": "Coloring A Border", "question__title_slug": "coloring-a-border", "question__hide": false, - "total_acs": 29491, - "total_submitted": 59965, + "total_acs": 29675, + "total_submitted": 60299, "frontend_question_id": 1034, "is_new_question": false }, @@ -36792,8 +37367,8 @@ "question__title": "Moving Stones Until Consecutive", "question__title_slug": "moving-stones-until-consecutive", "question__hide": false, - "total_acs": 22211, - "total_submitted": 47956, + "total_acs": 22297, + "total_submitted": 48063, "frontend_question_id": 1033, "is_new_question": false }, @@ -36815,8 +37390,8 @@ "question__title": "Check If a Number Is Majority Element in a Sorted Array", "question__title_slug": "check-if-a-number-is-majority-element-in-a-sorted-array", "question__hide": false, - "total_acs": 38620, - "total_submitted": 67510, + "total_acs": 38752, + "total_submitted": 67711, "frontend_question_id": 1150, "is_new_question": false }, @@ -36838,8 +37413,8 @@ "question__title": "Parallel Courses", "question__title_slug": "parallel-courses", "question__hide": false, - "total_acs": 58128, - "total_submitted": 94568, + "total_acs": 58732, + "total_submitted": 95643, "frontend_question_id": 1136, "is_new_question": false }, @@ -36861,8 +37436,8 @@ "question__title": "Connecting Cities With Minimum Cost", "question__title_slug": "connecting-cities-with-minimum-cost", "question__hide": false, - "total_acs": 66215, - "total_submitted": 107878, + "total_acs": 66387, + "total_submitted": 108108, "frontend_question_id": 1135, "is_new_question": false }, @@ -36884,8 +37459,8 @@ "question__title": "Path With Maximum Minimum Value", "question__title_slug": "path-with-maximum-minimum-value", "question__hide": false, - "total_acs": 57051, - "total_submitted": 107057, + "total_acs": 57226, + "total_submitted": 107368, "frontend_question_id": 1102, "is_new_question": false }, @@ -36907,8 +37482,8 @@ "question__title": "Largest Unique Number", "question__title_slug": "largest-unique-number", "question__hide": false, - "total_acs": 39581, - "total_submitted": 58476, + "total_acs": 40045, + "total_submitted": 59115, "frontend_question_id": 1133, "is_new_question": false }, @@ -36930,8 +37505,8 @@ "question__title": "Stream of Characters", "question__title_slug": "stream-of-characters", "question__hide": false, - "total_acs": 82081, - "total_submitted": 158957, + "total_acs": 82258, + "total_submitted": 159286, "frontend_question_id": 1032, "is_new_question": false }, @@ -36953,8 +37528,8 @@ "question__title": "Maximum Sum of Two Non-Overlapping Subarrays", "question__title_slug": "maximum-sum-of-two-non-overlapping-subarrays", "question__hide": false, - "total_acs": 62451, - "total_submitted": 104745, + "total_acs": 62685, + "total_submitted": 105080, "frontend_question_id": 1031, "is_new_question": false }, @@ -36976,8 +37551,8 @@ "question__title": "Two City Scheduling", "question__title_slug": "two-city-scheduling", "question__hide": false, - "total_acs": 212287, - "total_submitted": 324852, + "total_acs": 213234, + "total_submitted": 326001, "frontend_question_id": 1029, "is_new_question": false }, @@ -36999,8 +37574,8 @@ "question__title": "Matrix Cells in Distance Order", "question__title_slug": "matrix-cells-in-distance-order", "question__hide": false, - "total_acs": 50120, - "total_submitted": 71863, + "total_acs": 50312, + "total_submitted": 72117, "frontend_question_id": 1030, "is_new_question": false }, @@ -37022,8 +37597,8 @@ "question__title": "Recover a Tree From Preorder Traversal", "question__title_slug": "recover-a-tree-from-preorder-traversal", "question__hide": false, - "total_acs": 42560, - "total_submitted": 58015, + "total_acs": 42764, + "total_submitted": 58367, "frontend_question_id": 1028, "is_new_question": false }, @@ -37045,8 +37620,8 @@ "question__title": "Maximum Difference Between Node and Ancestor", "question__title_slug": "maximum-difference-between-node-and-ancestor", "question__hide": false, - "total_acs": 203819, - "total_submitted": 269062, + "total_acs": 204469, + "total_submitted": 269964, "frontend_question_id": 1026, "is_new_question": false }, @@ -37068,8 +37643,8 @@ "question__title": "Maximum Average Subtree", "question__title_slug": "maximum-average-subtree", "question__hide": false, - "total_acs": 59251, - "total_submitted": 90361, + "total_acs": 59358, + "total_submitted": 90514, "frontend_question_id": 1120, "is_new_question": false }, @@ -37091,8 +37666,8 @@ "question__title": "Armstrong Number", "question__title_slug": "armstrong-number", "question__hide": false, - "total_acs": 32146, - "total_submitted": 41347, + "total_acs": 32272, + "total_submitted": 41509, "frontend_question_id": 1134, "is_new_question": false }, @@ -37114,8 +37689,8 @@ "question__title": "Remove Vowels from a String", "question__title_slug": "remove-vowels-from-a-string", "question__hide": false, - "total_acs": 94695, - "total_submitted": 104279, + "total_acs": 94955, + "total_submitted": 104555, "frontend_question_id": 1119, "is_new_question": false }, @@ -37137,8 +37712,8 @@ "question__title": "Number of Days in a Month", "question__title_slug": "number-of-days-in-a-month", "question__hide": false, - "total_acs": 7516, - "total_submitted": 13140, + "total_acs": 7545, + "total_submitted": 13191, "frontend_question_id": 1118, "is_new_question": false }, @@ -37160,8 +37735,8 @@ "question__title": "Longest Arithmetic Subsequence", "question__title_slug": "longest-arithmetic-subsequence", "question__hide": false, - "total_acs": 101240, - "total_submitted": 216759, + "total_acs": 101581, + "total_submitted": 217580, "frontend_question_id": 1027, "is_new_question": false }, @@ -37183,8 +37758,8 @@ "question__title": "Divisor Game", "question__title_slug": "divisor-game", "question__hide": false, - "total_acs": 201917, - "total_submitted": 298489, + "total_acs": 203107, + "total_submitted": 300204, "frontend_question_id": 1025, "is_new_question": false }, @@ -37206,8 +37781,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": 65296, - "total_submitted": 101041, + "total_acs": 65928, + "total_submitted": 101996, "frontend_question_id": 1101, "is_new_question": false }, @@ -37229,8 +37804,8 @@ "question__title": "Find K-Length Substrings With No Repeated Characters", "question__title_slug": "find-k-length-substrings-with-no-repeated-characters", "question__hide": false, - "total_acs": 34778, - "total_submitted": 46566, + "total_acs": 34977, + "total_submitted": 46838, "frontend_question_id": 1100, "is_new_question": false }, @@ -37252,8 +37827,8 @@ "question__title": "Two Sum Less Than K", "question__title_slug": "two-sum-less-than-k", "question__hide": false, - "total_acs": 116156, - "total_submitted": 190208, + "total_acs": 116479, + "total_submitted": 190679, "frontend_question_id": 1099, "is_new_question": false }, @@ -37275,8 +37850,8 @@ "question__title": "Sum of Digits in the Minimum Number", "question__title_slug": "sum-of-digits-in-the-minimum-number", "question__hide": false, - "total_acs": 22460, - "total_submitted": 29415, + "total_acs": 22507, + "total_submitted": 29471, "frontend_question_id": 1085, "is_new_question": false }, @@ -37298,8 +37873,8 @@ "question__title": "Video Stitching", "question__title_slug": "video-stitching", "question__hide": false, - "total_acs": 57123, - "total_submitted": 113266, + "total_acs": 57338, + "total_submitted": 113651, "frontend_question_id": 1024, "is_new_question": false }, @@ -37321,8 +37896,8 @@ "question__title": "Camelcase Matching", "question__title_slug": "camelcase-matching", "question__hide": false, - "total_acs": 39723, - "total_submitted": 65318, + "total_acs": 39878, + "total_submitted": 65550, "frontend_question_id": 1023, "is_new_question": false }, @@ -37344,8 +37919,8 @@ "question__title": "Sum of Root To Leaf Binary Numbers", "question__title_slug": "sum-of-root-to-leaf-binary-numbers", "question__hide": false, - "total_acs": 188644, - "total_submitted": 256599, + "total_acs": 189153, + "total_submitted": 257380, "frontend_question_id": 1022, "is_new_question": false }, @@ -37367,8 +37942,8 @@ "question__title": "Remove Outermost Parentheses", "question__title_slug": "remove-outermost-parentheses", "question__hide": false, - "total_acs": 217564, - "total_submitted": 269427, + "total_acs": 218893, + "total_submitted": 270985, "frontend_question_id": 1021, "is_new_question": false }, @@ -37390,8 +37965,8 @@ "question__title": "Confusing Number II", "question__title_slug": "confusing-number-ii", "question__hide": false, - "total_acs": 35741, - "total_submitted": 75677, + "total_acs": 35801, + "total_submitted": 75806, "frontend_question_id": 1088, "is_new_question": false }, @@ -37413,8 +37988,8 @@ "question__title": "Brace Expansion", "question__title_slug": "brace-expansion", "question__hide": false, - "total_acs": 47844, - "total_submitted": 72246, + "total_acs": 47937, + "total_submitted": 72372, "frontend_question_id": 1087, "is_new_question": false }, @@ -37436,8 +38011,8 @@ "question__title": "Index Pairs of a String", "question__title_slug": "index-pairs-of-a-string", "question__hide": false, - "total_acs": 23530, - "total_submitted": 35845, + "total_acs": 24903, + "total_submitted": 37513, "frontend_question_id": 1065, "is_new_question": false }, @@ -37459,8 +38034,8 @@ "question__title": "High Five", "question__title_slug": "high-five", "question__hide": false, - "total_acs": 93711, - "total_submitted": 124892, + "total_acs": 93853, + "total_submitted": 125097, "frontend_question_id": 1086, "is_new_question": false }, @@ -37482,8 +38057,8 @@ "question__title": "Number of Enclaves", "question__title_slug": "number-of-enclaves", "question__hide": false, - "total_acs": 158495, - "total_submitted": 230677, + "total_acs": 159670, + "total_submitted": 232334, "frontend_question_id": 1020, "is_new_question": false }, @@ -37505,8 +38080,8 @@ "question__title": "Next Greater Node In Linked List", "question__title_slug": "next-greater-node-in-linked-list", "question__hide": false, - "total_acs": 127373, - "total_submitted": 212449, + "total_acs": 127970, + "total_submitted": 213406, "frontend_question_id": 1019, "is_new_question": false }, @@ -37528,8 +38103,8 @@ "question__title": "Binary Prefix Divisible By 5", "question__title_slug": "binary-prefix-divisible-by-5", "question__hide": false, - "total_acs": 46763, - "total_submitted": 99838, + "total_acs": 46968, + "total_submitted": 100295, "frontend_question_id": 1018, "is_new_question": false }, @@ -37551,8 +38126,8 @@ "question__title": "Convert to Base -2", "question__title_slug": "convert-to-base-2", "question__hide": false, - "total_acs": 22930, - "total_submitted": 37833, + "total_acs": 23023, + "total_submitted": 37999, "frontend_question_id": 1017, "is_new_question": false }, @@ -37570,12 +38145,12 @@ "question_id": 1069, "question__article__live": true, "question__article__slug": "confusing-number", - "question__article__has_video_solution": false, + "question__article__has_video_solution": true, "question__title": "Confusing Number", "question__title_slug": "confusing-number", "question__hide": false, - "total_acs": 36224, - "total_submitted": 74982, + "total_acs": 36610, + "total_submitted": 75703, "frontend_question_id": 1056, "is_new_question": false }, @@ -37597,8 +38172,8 @@ "question__title": "Digit Count in Range", "question__title_slug": "digit-count-in-range", "question__hide": false, - "total_acs": 3492, - "total_submitted": 7709, + "total_acs": 3507, + "total_submitted": 7751, "frontend_question_id": 1067, "is_new_question": false }, @@ -37620,8 +38195,8 @@ "question__title": "Campus Bikes II", "question__title_slug": "campus-bikes-ii", "question__hide": false, - "total_acs": 44828, - "total_submitted": 81566, + "total_acs": 44875, + "total_submitted": 81701, "frontend_question_id": 1066, "is_new_question": false }, @@ -37643,8 +38218,8 @@ "question__title": "Fixed Point", "question__title_slug": "fixed-point", "question__hide": false, - "total_acs": 40852, - "total_submitted": 63710, + "total_acs": 40926, + "total_submitted": 63831, "frontend_question_id": 1064, "is_new_question": false }, @@ -37666,8 +38241,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": 33335, - "total_submitted": 58260, + "total_acs": 33525, + "total_submitted": 58522, "frontend_question_id": 1016, "is_new_question": false }, @@ -37689,8 +38264,8 @@ "question__title": "Smallest Integer Divisible by K", "question__title_slug": "smallest-integer-divisible-by-k", "question__hide": false, - "total_acs": 59088, - "total_submitted": 126182, + "total_acs": 59258, + "total_submitted": 126450, "frontend_question_id": 1015, "is_new_question": false }, @@ -37712,8 +38287,8 @@ "question__title": "Best Sightseeing Pair", "question__title_slug": "best-sightseeing-pair", "question__hide": false, - "total_acs": 84657, - "total_submitted": 142567, + "total_acs": 85033, + "total_submitted": 143211, "frontend_question_id": 1014, "is_new_question": false }, @@ -37735,8 +38310,8 @@ "question__title": "Partition Array Into Three Parts With Equal Sum", "question__title_slug": "partition-array-into-three-parts-with-equal-sum", "question__hide": false, - "total_acs": 79029, - "total_submitted": 185438, + "total_acs": 79359, + "total_submitted": 186345, "frontend_question_id": 1013, "is_new_question": false }, @@ -37758,8 +38333,8 @@ "question__title": "Number of Valid Subarrays", "question__title_slug": "number-of-valid-subarrays", "question__hide": false, - "total_acs": 7479, - "total_submitted": 10055, + "total_acs": 7494, + "total_submitted": 10071, "frontend_question_id": 1063, "is_new_question": false }, @@ -37781,8 +38356,8 @@ "question__title": "Longest Repeating Substring", "question__title_slug": "longest-repeating-substring", "question__hide": false, - "total_acs": 32977, - "total_submitted": 55646, + "total_acs": 33121, + "total_submitted": 55907, "frontend_question_id": 1062, "is_new_question": false }, @@ -37804,8 +38379,8 @@ "question__title": "Missing Element in Sorted Array", "question__title_slug": "missing-element-in-sorted-array", "question__hide": false, - "total_acs": 113366, - "total_submitted": 206901, + "total_acs": 113529, + "total_submitted": 207151, "frontend_question_id": 1060, "is_new_question": false }, @@ -37827,8 +38402,8 @@ "question__title": "Lexicographically Smallest Equivalent String", "question__title_slug": "lexicographically-smallest-equivalent-string", "question__hide": false, - "total_acs": 69231, - "total_submitted": 90450, + "total_acs": 69516, + "total_submitted": 90813, "frontend_question_id": 1061, "is_new_question": false }, @@ -37850,8 +38425,8 @@ "question__title": "Numbers With Repeated Digits", "question__title_slug": "numbers-with-repeated-digits", "question__hide": false, - "total_acs": 12204, - "total_submitted": 30697, + "total_acs": 12252, + "total_submitted": 30837, "frontend_question_id": 1012, "is_new_question": false }, @@ -37873,8 +38448,8 @@ "question__title": "Capacity To Ship Packages Within D Days", "question__title_slug": "capacity-to-ship-packages-within-d-days", "question__hide": false, - "total_acs": 267412, - "total_submitted": 394691, + "total_acs": 268702, + "total_submitted": 396527, "frontend_question_id": 1011, "is_new_question": false }, @@ -37896,8 +38471,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": 240423, - "total_submitted": 456065, + "total_acs": 241272, + "total_submitted": 457617, "frontend_question_id": 1010, "is_new_question": false }, @@ -37919,8 +38494,8 @@ "question__title": "Complement of Base 10 Integer", "question__title_slug": "complement-of-base-10-integer", "question__hide": false, - "total_acs": 178822, - "total_submitted": 291148, + "total_acs": 180132, + "total_submitted": 293397, "frontend_question_id": 1009, "is_new_question": false }, @@ -37942,8 +38517,8 @@ "question__title": "Minimize Rounding Error to Meet Target", "question__title_slug": "minimize-rounding-error-to-meet-target", "question__hide": false, - "total_acs": 8445, - "total_submitted": 18803, + "total_acs": 8453, + "total_submitted": 18813, "frontend_question_id": 1058, "is_new_question": false }, @@ -37965,8 +38540,8 @@ "question__title": "Campus Bikes", "question__title_slug": "campus-bikes", "question__hide": false, - "total_acs": 64345, - "total_submitted": 111622, + "total_acs": 64408, + "total_submitted": 111752, "frontend_question_id": 1057, "is_new_question": false }, @@ -37988,8 +38563,8 @@ "question__title": "Shortest Way to Form String", "question__title_slug": "shortest-way-to-form-string", "question__hide": false, - "total_acs": 79367, - "total_submitted": 132815, + "total_acs": 79662, + "total_submitted": 133236, "frontend_question_id": 1055, "is_new_question": false }, @@ -38011,8 +38586,8 @@ "question__title": "Construct Binary Search Tree from Preorder Traversal", "question__title_slug": "construct-binary-search-tree-from-preorder-traversal", "question__hide": false, - "total_acs": 291863, - "total_submitted": 359467, + "total_acs": 293023, + "total_submitted": 360851, "frontend_question_id": 1008, "is_new_question": false }, @@ -38034,8 +38609,8 @@ "question__title": "Minimum Domino Rotations For Equal Row", "question__title_slug": "minimum-domino-rotations-for-equal-row", "question__hide": false, - "total_acs": 191561, - "total_submitted": 366612, + "total_acs": 191751, + "total_submitted": 366946, "frontend_question_id": 1007, "is_new_question": false }, @@ -38057,8 +38632,8 @@ "question__title": "Clumsy Factorial", "question__title_slug": "clumsy-factorial", "question__hide": false, - "total_acs": 24925, - "total_submitted": 44854, + "total_acs": 25079, + "total_submitted": 45056, "frontend_question_id": 1006, "is_new_question": false }, @@ -38080,8 +38655,8 @@ "question__title": "Maximize Sum Of Array After K Negations", "question__title_slug": "maximize-sum-of-array-after-k-negations", "question__hide": false, - "total_acs": 71530, - "total_submitted": 140784, + "total_acs": 71947, + "total_submitted": 141628, "frontend_question_id": 1005, "is_new_question": false }, @@ -38103,8 +38678,8 @@ "question__title": "Max Consecutive Ones III", "question__title_slug": "max-consecutive-ones-iii", "question__hide": false, - "total_acs": 294165, - "total_submitted": 465299, + "total_acs": 297151, + "total_submitted": 470216, "frontend_question_id": 1004, "is_new_question": false }, @@ -38126,8 +38701,8 @@ "question__title": "Check If Word Is Valid After Substitutions", "question__title_slug": "check-if-word-is-valid-after-substitutions", "question__hide": false, - "total_acs": 49927, - "total_submitted": 85660, + "total_acs": 50192, + "total_submitted": 86077, "frontend_question_id": 1003, "is_new_question": false }, @@ -38149,8 +38724,8 @@ "question__title": "Find Common Characters", "question__title_slug": "find-common-characters", "question__hide": false, - "total_acs": 178532, - "total_submitted": 260504, + "total_acs": 179323, + "total_submitted": 261687, "frontend_question_id": 1002, "is_new_question": false }, @@ -38172,8 +38747,8 @@ "question__title": "Grid Illumination", "question__title_slug": "grid-illumination", "question__hide": false, - "total_acs": 17817, - "total_submitted": 49287, + "total_acs": 17854, + "total_submitted": 49365, "frontend_question_id": 1001, "is_new_question": false }, @@ -38195,8 +38770,8 @@ "question__title": "Minimum Cost to Merge Stones", "question__title_slug": "minimum-cost-to-merge-stones", "question__hide": false, - "total_acs": 33943, - "total_submitted": 80281, + "total_acs": 34053, + "total_submitted": 80518, "frontend_question_id": 1000, "is_new_question": false }, @@ -38218,8 +38793,8 @@ "question__title": "Available Captures for Rook", "question__title_slug": "available-captures-for-rook", "question__hide": false, - "total_acs": 58157, - "total_submitted": 85241, + "total_acs": 58349, + "total_submitted": 85500, "frontend_question_id": 999, "is_new_question": false }, @@ -38241,8 +38816,8 @@ "question__title": "Maximum Binary Tree II", "question__title_slug": "maximum-binary-tree-ii", "question__hide": false, - "total_acs": 31550, - "total_submitted": 46883, + "total_acs": 31676, + "total_submitted": 47043, "frontend_question_id": 998, "is_new_question": false }, @@ -38264,8 +38839,8 @@ "question__title": "Find the Town Judge", "question__title_slug": "find-the-town-judge", "question__hide": false, - "total_acs": 407910, - "total_submitted": 823826, + "total_acs": 409272, + "total_submitted": 826809, "frontend_question_id": 997, "is_new_question": false }, @@ -38287,8 +38862,8 @@ "question__title": "Number of Squareful Arrays", "question__title_slug": "number-of-squareful-arrays", "question__hide": false, - "total_acs": 31116, - "total_submitted": 63307, + "total_acs": 31259, + "total_submitted": 63572, "frontend_question_id": 996, "is_new_question": false }, @@ -38310,8 +38885,8 @@ "question__title": "Minimum Number of K Consecutive Bit Flips", "question__title_slug": "minimum-number-of-k-consecutive-bit-flips", "question__hide": false, - "total_acs": 30542, - "total_submitted": 59768, + "total_acs": 30674, + "total_submitted": 59982, "frontend_question_id": 995, "is_new_question": false }, @@ -38333,8 +38908,8 @@ "question__title": "Rotting Oranges", "question__title_slug": "rotting-oranges", "question__hide": false, - "total_acs": 595596, - "total_submitted": 1123347, + "total_acs": 600092, + "total_submitted": 1131224, "frontend_question_id": 994, "is_new_question": false }, @@ -38356,8 +38931,8 @@ "question__title": "Cousins in Binary Tree", "question__title_slug": "cousins-in-binary-tree", "question__hide": false, - "total_acs": 242182, - "total_submitted": 442754, + "total_acs": 242972, + "total_submitted": 443890, "frontend_question_id": 993, "is_new_question": false }, @@ -38379,8 +38954,8 @@ "question__title": "Subarrays with K Different Integers", "question__title_slug": "subarrays-with-k-different-integers", "question__hide": false, - "total_acs": 92449, - "total_submitted": 169153, + "total_acs": 92923, + "total_submitted": 169900, "frontend_question_id": 992, "is_new_question": false }, @@ -38402,8 +38977,8 @@ "question__title": "Broken Calculator", "question__title_slug": "broken-calculator", "question__hide": false, - "total_acs": 93585, - "total_submitted": 172876, + "total_acs": 93766, + "total_submitted": 173173, "frontend_question_id": 991, "is_new_question": false }, @@ -38425,8 +39000,8 @@ "question__title": "Satisfiability of Equality Equations", "question__title_slug": "satisfiability-of-equality-equations", "question__hide": false, - "total_acs": 110701, - "total_submitted": 219161, + "total_acs": 110994, + "total_submitted": 219737, "frontend_question_id": 990, "is_new_question": false }, @@ -38448,8 +39023,8 @@ "question__title": "Add to Array-Form of Integer", "question__title_slug": "add-to-array-form-of-integer", "question__hide": false, - "total_acs": 225340, - "total_submitted": 479416, + "total_acs": 226252, + "total_submitted": 481981, "frontend_question_id": 989, "is_new_question": false }, @@ -38471,8 +39046,8 @@ "question__title": "Smallest String Starting From Leaf", "question__title_slug": "smallest-string-starting-from-leaf", "question__hide": false, - "total_acs": 66772, - "total_submitted": 132763, + "total_acs": 66959, + "total_submitted": 133078, "frontend_question_id": 988, "is_new_question": false }, @@ -38494,8 +39069,8 @@ "question__title": "Vertical Order Traversal of a Binary Tree", "question__title_slug": "vertical-order-traversal-of-a-binary-tree", "question__hide": false, - "total_acs": 330245, - "total_submitted": 731144, + "total_acs": 331378, + "total_submitted": 733191, "frontend_question_id": 987, "is_new_question": false }, @@ -38517,8 +39092,8 @@ "question__title": "Interval List Intersections", "question__title_slug": "interval-list-intersections", "question__hide": false, - "total_acs": 354027, - "total_submitted": 496493, + "total_acs": 354893, + "total_submitted": 497739, "frontend_question_id": 986, "is_new_question": false }, @@ -38540,8 +39115,8 @@ "question__title": "Sum of Even Numbers After Queries", "question__title_slug": "sum-of-even-numbers-after-queries", "question__hide": false, - "total_acs": 131813, - "total_submitted": 193547, + "total_acs": 132034, + "total_submitted": 193895, "frontend_question_id": 985, "is_new_question": false }, @@ -38563,8 +39138,8 @@ "question__title": "String Without AAA or BBB", "question__title_slug": "string-without-aaa-or-bbb", "question__hide": false, - "total_acs": 41437, - "total_submitted": 95856, + "total_acs": 41570, + "total_submitted": 96117, "frontend_question_id": 984, "is_new_question": false }, @@ -38586,8 +39161,8 @@ "question__title": "Minimum Cost For Tickets", "question__title_slug": "minimum-cost-for-tickets", "question__hide": false, - "total_acs": 243461, - "total_submitted": 369960, + "total_acs": 244260, + "total_submitted": 371168, "frontend_question_id": 983, "is_new_question": false }, @@ -38609,8 +39184,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": 14983, - "total_submitted": 26052, + "total_acs": 15026, + "total_submitted": 26121, "frontend_question_id": 982, "is_new_question": false }, @@ -38632,8 +39207,8 @@ "question__title": "Time Based Key-Value Store", "question__title_slug": "time-based-key-value-store", "question__hide": false, - "total_acs": 314870, - "total_submitted": 604573, + "total_acs": 316858, + "total_submitted": 609303, "frontend_question_id": 981, "is_new_question": false }, @@ -38655,8 +39230,8 @@ "question__title": "Unique Paths III", "question__title_slug": "unique-paths-iii", "question__hide": false, - "total_acs": 174544, - "total_submitted": 213763, + "total_acs": 175007, + "total_submitted": 214307, "frontend_question_id": 980, "is_new_question": false }, @@ -38678,8 +39253,8 @@ "question__title": "Distribute Coins in Binary Tree", "question__title_slug": "distribute-coins-in-binary-tree", "question__hide": false, - "total_acs": 101688, - "total_submitted": 140754, + "total_acs": 101996, + "total_submitted": 141146, "frontend_question_id": 979, "is_new_question": false }, @@ -38701,8 +39276,8 @@ "question__title": "Longest Turbulent Subarray", "question__title_slug": "longest-turbulent-subarray", "question__hide": false, - "total_acs": 83821, - "total_submitted": 177594, + "total_acs": 84180, + "total_submitted": 178309, "frontend_question_id": 978, "is_new_question": false }, @@ -38724,8 +39299,8 @@ "question__title": "Squares of a Sorted Array", "question__title_slug": "squares-of-a-sorted-array", "question__hide": false, - "total_acs": 1402321, - "total_submitted": 1950511, + "total_acs": 1410901, + "total_submitted": 1962643, "frontend_question_id": 977, "is_new_question": false }, @@ -38747,8 +39322,8 @@ "question__title": "Largest Perimeter Triangle", "question__title_slug": "largest-perimeter-triangle", "question__hide": false, - "total_acs": 205626, - "total_submitted": 375856, + "total_acs": 206925, + "total_submitted": 378155, "frontend_question_id": 976, "is_new_question": false }, @@ -38770,8 +39345,8 @@ "question__title": "Odd Even Jump", "question__title_slug": "odd-even-jump", "question__hide": false, - "total_acs": 72725, - "total_submitted": 186903, + "total_acs": 72935, + "total_submitted": 187375, "frontend_question_id": 975, "is_new_question": false }, @@ -38793,8 +39368,8 @@ "question__title": "Subarray Sums Divisible by K", "question__title_slug": "subarray-sums-divisible-by-k", "question__hide": false, - "total_acs": 197631, - "total_submitted": 363913, + "total_acs": 198612, + "total_submitted": 365842, "frontend_question_id": 974, "is_new_question": false }, @@ -38816,8 +39391,8 @@ "question__title": "K Closest Points to Origin", "question__title_slug": "k-closest-points-to-origin", "question__hide": false, - "total_acs": 972201, - "total_submitted": 1478343, + "total_acs": 976125, + "total_submitted": 1484424, "frontend_question_id": 973, "is_new_question": false }, @@ -38839,8 +39414,8 @@ "question__title": "Fibonacci Number", "question__title_slug": "fibonacci-number", "question__hide": false, - "total_acs": 1322341, - "total_submitted": 1891629, + "total_acs": 1333334, + "total_submitted": 1906695, "frontend_question_id": 509, "is_new_question": false }, @@ -38862,8 +39437,8 @@ "question__title": "Equal Rational Numbers", "question__title_slug": "equal-rational-numbers", "question__hide": false, - "total_acs": 6252, - "total_submitted": 14490, + "total_acs": 6288, + "total_submitted": 14545, "frontend_question_id": 972, "is_new_question": false }, @@ -38885,8 +39460,8 @@ "question__title": "Flip Binary Tree To Match Preorder Traversal", "question__title_slug": "flip-binary-tree-to-match-preorder-traversal", "question__hide": false, - "total_acs": 38659, - "total_submitted": 77254, + "total_acs": 38729, + "total_submitted": 77408, "frontend_question_id": 971, "is_new_question": false }, @@ -38908,8 +39483,8 @@ "question__title": "Powerful Integers", "question__title_slug": "powerful-integers", "question__hide": false, - "total_acs": 50656, - "total_submitted": 115981, + "total_acs": 50768, + "total_submitted": 116217, "frontend_question_id": 970, "is_new_question": false }, @@ -38931,8 +39506,8 @@ "question__title": "Pancake Sorting", "question__title_slug": "pancake-sorting", "question__hide": false, - "total_acs": 83910, - "total_submitted": 119585, + "total_acs": 84162, + "total_submitted": 119911, "frontend_question_id": 969, "is_new_question": false }, @@ -38954,8 +39529,8 @@ "question__title": "Binary Tree Cameras", "question__title_slug": "binary-tree-cameras", "question__hide": false, - "total_acs": 120716, - "total_submitted": 259085, + "total_acs": 121063, + "total_submitted": 259719, "frontend_question_id": 968, "is_new_question": false }, @@ -38977,8 +39552,8 @@ "question__title": "Numbers With Same Consecutive Differences", "question__title_slug": "numbers-with-same-consecutive-differences", "question__hide": false, - "total_acs": 120483, - "total_submitted": 209786, + "total_acs": 120748, + "total_submitted": 210220, "frontend_question_id": 967, "is_new_question": false }, @@ -39000,8 +39575,8 @@ "question__title": "Vowel Spellchecker", "question__title_slug": "vowel-spellchecker", "question__hide": false, - "total_acs": 38436, - "total_submitted": 74790, + "total_acs": 38483, + "total_submitted": 74906, "frontend_question_id": 966, "is_new_question": false }, @@ -39023,8 +39598,8 @@ "question__title": "Univalued Binary Tree", "question__title_slug": "univalued-binary-tree", "question__hide": false, - "total_acs": 191095, - "total_submitted": 273768, + "total_acs": 191715, + "total_submitted": 274563, "frontend_question_id": 965, "is_new_question": false }, @@ -39046,8 +39621,8 @@ "question__title": "Least Operators to Express Number", "question__title_slug": "least-operators-to-express-number", "question__hide": false, - "total_acs": 8874, - "total_submitted": 18527, + "total_acs": 8893, + "total_submitted": 18560, "frontend_question_id": 964, "is_new_question": false }, @@ -39069,8 +39644,8 @@ "question__title": "Minimum Area Rectangle II", "question__title_slug": "minimum-area-rectangle-ii", "question__hide": false, - "total_acs": 25194, - "total_submitted": 46153, + "total_acs": 25265, + "total_submitted": 46264, "frontend_question_id": 963, "is_new_question": false }, @@ -39092,8 +39667,8 @@ "question__title": "Maximum Width Ramp", "question__title_slug": "maximum-width-ramp", "question__hide": false, - "total_acs": 39991, - "total_submitted": 81875, + "total_acs": 40159, + "total_submitted": 82184, "frontend_question_id": 962, "is_new_question": false }, @@ -39115,8 +39690,8 @@ "question__title": "N-Repeated Element in Size 2N Array", "question__title_slug": "n-repeated-element-in-size-2n-array", "question__hide": false, - "total_acs": 205817, - "total_submitted": 270444, + "total_acs": 206465, + "total_submitted": 271268, "frontend_question_id": 961, "is_new_question": false }, @@ -39138,8 +39713,8 @@ "question__title": "Delete Columns to Make Sorted III", "question__title_slug": "delete-columns-to-make-sorted-iii", "question__hide": false, - "total_acs": 12260, - "total_submitted": 21434, + "total_acs": 12318, + "total_submitted": 21657, "frontend_question_id": 960, "is_new_question": false }, @@ -39161,8 +39736,8 @@ "question__title": "Regions Cut By Slashes", "question__title_slug": "regions-cut-by-slashes", "question__hide": false, - "total_acs": 45599, - "total_submitted": 66016, + "total_acs": 45751, + "total_submitted": 66253, "frontend_question_id": 959, "is_new_question": false }, @@ -39184,8 +39759,8 @@ "question__title": "Check Completeness of a Binary Tree", "question__title_slug": "check-completeness-of-a-binary-tree", "question__hide": false, - "total_acs": 196533, - "total_submitted": 349727, + "total_acs": 197169, + "total_submitted": 350801, "frontend_question_id": 958, "is_new_question": false }, @@ -39207,8 +39782,8 @@ "question__title": "Prison Cells After N Days", "question__title_slug": "prison-cells-after-n-days", "question__hide": false, - "total_acs": 152140, - "total_submitted": 389796, + "total_acs": 152321, + "total_submitted": 390262, "frontend_question_id": 957, "is_new_question": false }, @@ -39230,8 +39805,8 @@ "question__title": "Tallest Billboard", "question__title_slug": "tallest-billboard", "question__hide": false, - "total_acs": 16073, - "total_submitted": 40404, + "total_acs": 16166, + "total_submitted": 40664, "frontend_question_id": 956, "is_new_question": false }, @@ -39253,8 +39828,8 @@ "question__title": "Delete Columns to Make Sorted II", "question__title_slug": "delete-columns-to-make-sorted-ii", "question__hide": false, - "total_acs": 17941, - "total_submitted": 51693, + "total_acs": 18013, + "total_submitted": 51882, "frontend_question_id": 955, "is_new_question": false }, @@ -39276,8 +39851,8 @@ "question__title": "Array of Doubled Pairs", "question__title_slug": "array-of-doubled-pairs", "question__hide": false, - "total_acs": 81138, - "total_submitted": 207694, + "total_acs": 81278, + "total_submitted": 208023, "frontend_question_id": 954, "is_new_question": false }, @@ -39299,8 +39874,8 @@ "question__title": "Verifying an Alien Dictionary", "question__title_slug": "verifying-an-alien-dictionary", "question__hide": false, - "total_acs": 458185, - "total_submitted": 840688, + "total_acs": 459143, + "total_submitted": 842274, "frontend_question_id": 953, "is_new_question": false }, @@ -39322,8 +39897,8 @@ "question__title": "Largest Component Size by Common Factor", "question__title_slug": "largest-component-size-by-common-factor", "question__hide": false, - "total_acs": 48895, - "total_submitted": 122231, + "total_acs": 48985, + "total_submitted": 122434, "frontend_question_id": 952, "is_new_question": false }, @@ -39345,8 +39920,8 @@ "question__title": "Flip Equivalent Binary Trees", "question__title_slug": "flip-equivalent-binary-trees", "question__hide": false, - "total_acs": 129489, - "total_submitted": 193839, + "total_acs": 129838, + "total_submitted": 194382, "frontend_question_id": 951, "is_new_question": false }, @@ -39368,8 +39943,8 @@ "question__title": "Reveal Cards In Increasing Order", "question__title_slug": "reveal-cards-in-increasing-order", "question__hide": false, - "total_acs": 67309, - "total_submitted": 86566, + "total_acs": 67490, + "total_submitted": 86769, "frontend_question_id": 950, "is_new_question": false }, @@ -39391,8 +39966,8 @@ "question__title": "Largest Time for Given Digits", "question__title_slug": "largest-time-for-given-digits", "question__hide": false, - "total_acs": 78818, - "total_submitted": 224275, + "total_acs": 78976, + "total_submitted": 224709, "frontend_question_id": 949, "is_new_question": false }, @@ -39414,8 +39989,8 @@ "question__title": "Bag of Tokens", "question__title_slug": "bag-of-tokens", "question__hide": false, - "total_acs": 101105, - "total_submitted": 194055, + "total_acs": 101248, + "total_submitted": 194324, "frontend_question_id": 948, "is_new_question": false }, @@ -39437,8 +40012,8 @@ "question__title": "Most Stones Removed with Same Row or Column", "question__title_slug": "most-stones-removed-with-same-row-or-column", "question__hide": false, - "total_acs": 176352, - "total_submitted": 299439, + "total_acs": 177105, + "total_submitted": 300799, "frontend_question_id": 947, "is_new_question": false }, @@ -39460,8 +40035,8 @@ "question__title": "Validate Stack Sequences", "question__title_slug": "validate-stack-sequences", "question__hide": false, - "total_acs": 268732, - "total_submitted": 387022, + "total_acs": 269415, + "total_submitted": 388033, "frontend_question_id": 946, "is_new_question": false }, @@ -39483,8 +40058,8 @@ "question__title": "Minimum Increment to Make Array Unique", "question__title_slug": "minimum-increment-to-make-array-unique", "question__hide": false, - "total_acs": 75647, - "total_submitted": 147549, + "total_acs": 76296, + "total_submitted": 148589, "frontend_question_id": 945, "is_new_question": false }, @@ -39506,8 +40081,8 @@ "question__title": "Delete Columns to Make Sorted", "question__title_slug": "delete-columns-to-make-sorted", "question__hide": false, - "total_acs": 171083, - "total_submitted": 228826, + "total_acs": 171622, + "total_submitted": 229598, "frontend_question_id": 944, "is_new_question": false }, @@ -39529,8 +40104,8 @@ "question__title": "Find the Shortest Superstring", "question__title_slug": "find-the-shortest-superstring", "question__hide": false, - "total_acs": 26043, - "total_submitted": 58708, + "total_acs": 26106, + "total_submitted": 58872, "frontend_question_id": 943, "is_new_question": false }, @@ -39552,8 +40127,8 @@ "question__title": "DI String Match", "question__title_slug": "di-string-match", "question__hide": false, - "total_acs": 131826, - "total_submitted": 170214, + "total_acs": 132376, + "total_submitted": 170886, "frontend_question_id": 942, "is_new_question": false }, @@ -39575,8 +40150,8 @@ "question__title": "Valid Mountain Array", "question__title_slug": "valid-mountain-array", "question__hide": false, - "total_acs": 360825, - "total_submitted": 1080734, + "total_acs": 362238, + "total_submitted": 1084998, "frontend_question_id": 941, "is_new_question": false }, @@ -39598,8 +40173,8 @@ "question__title": "Distinct Subsequences II", "question__title_slug": "distinct-subsequences-ii", "question__hide": false, - "total_acs": 33060, - "total_submitted": 75441, + "total_acs": 33169, + "total_submitted": 75741, "frontend_question_id": 940, "is_new_question": false }, @@ -39621,8 +40196,8 @@ "question__title": "Minimum Area Rectangle", "question__title_slug": "minimum-area-rectangle", "question__hide": false, - "total_acs": 122113, - "total_submitted": 230626, + "total_acs": 122345, + "total_submitted": 231023, "frontend_question_id": 939, "is_new_question": false }, @@ -39644,8 +40219,8 @@ "question__title": "Range Sum of BST", "question__title_slug": "range-sum-of-bst", "question__hide": false, - "total_acs": 781915, - "total_submitted": 910716, + "total_acs": 784039, + "total_submitted": 913332, "frontend_question_id": 938, "is_new_question": false }, @@ -39667,8 +40242,8 @@ "question__title": "Reorder Data in Log Files", "question__title_slug": "reorder-data-in-log-files", "question__hide": false, - "total_acs": 342072, - "total_submitted": 606633, + "total_acs": 342475, + "total_submitted": 607410, "frontend_question_id": 937, "is_new_question": false }, @@ -39690,8 +40265,8 @@ "question__title": "Stamping The Sequence", "question__title_slug": "stamping-the-sequence", "question__hide": false, - "total_acs": 56395, - "total_submitted": 89825, + "total_acs": 56452, + "total_submitted": 89940, "frontend_question_id": 936, "is_new_question": false }, @@ -39713,8 +40288,8 @@ "question__title": "Knight Dialer", "question__title_slug": "knight-dialer", "question__hide": false, - "total_acs": 99752, - "total_submitted": 197046, + "total_acs": 100037, + "total_submitted": 197584, "frontend_question_id": 935, "is_new_question": false }, @@ -39736,8 +40311,8 @@ "question__title": "Shortest Bridge", "question__title_slug": "shortest-bridge", "question__hide": false, - "total_acs": 127037, - "total_submitted": 233579, + "total_acs": 128014, + "total_submitted": 235373, "frontend_question_id": 934, "is_new_question": false }, @@ -39759,8 +40334,8 @@ "question__title": "Number of Recent Calls", "question__title_slug": "number-of-recent-calls", "question__hide": false, - "total_acs": 142707, - "total_submitted": 195111, + "total_acs": 143933, + "total_submitted": 196739, "frontend_question_id": 933, "is_new_question": false }, @@ -39782,8 +40357,8 @@ "question__title": "Beautiful Array", "question__title_slug": "beautiful-array", "question__hide": false, - "total_acs": 39964, - "total_submitted": 61289, + "total_acs": 40086, + "total_submitted": 61488, "frontend_question_id": 932, "is_new_question": false }, @@ -39805,8 +40380,8 @@ "question__title": "Minimum Falling Path Sum", "question__title_slug": "minimum-falling-path-sum", "question__hide": false, - "total_acs": 243016, - "total_submitted": 351648, + "total_acs": 244807, + "total_submitted": 354200, "frontend_question_id": 931, "is_new_question": false }, @@ -39828,8 +40403,8 @@ "question__title": "Binary Subarrays With Sum", "question__title_slug": "binary-subarrays-with-sum", "question__hide": false, - "total_acs": 67494, - "total_submitted": 128830, + "total_acs": 68120, + "total_submitted": 129815, "frontend_question_id": 930, "is_new_question": false }, @@ -39851,8 +40426,8 @@ "question__title": "Unique Email Addresses", "question__title_slug": "unique-email-addresses", "question__hide": false, - "total_acs": 421658, - "total_submitted": 628589, + "total_acs": 423328, + "total_submitted": 631182, "frontend_question_id": 929, "is_new_question": false }, @@ -39874,8 +40449,8 @@ "question__title": "Minimize Malware Spread II", "question__title_slug": "minimize-malware-spread-ii", "question__hide": false, - "total_acs": 18500, - "total_submitted": 43225, + "total_acs": 18586, + "total_submitted": 43400, "frontend_question_id": 928, "is_new_question": false }, @@ -39897,8 +40472,8 @@ "question__title": "Three Equal Parts", "question__title_slug": "three-equal-parts", "question__hide": false, - "total_acs": 27922, - "total_submitted": 70571, + "total_acs": 27982, + "total_submitted": 70820, "frontend_question_id": 927, "is_new_question": false }, @@ -39920,8 +40495,8 @@ "question__title": "Flip String to Monotone Increasing", "question__title_slug": "flip-string-to-monotone-increasing", "question__hide": false, - "total_acs": 175821, - "total_submitted": 286065, + "total_acs": 176295, + "total_submitted": 286822, "frontend_question_id": 926, "is_new_question": false }, @@ -39943,8 +40518,8 @@ "question__title": "Long Pressed Name", "question__title_slug": "long-pressed-name", "question__hide": false, - "total_acs": 117539, - "total_submitted": 355701, + "total_acs": 118191, + "total_submitted": 357861, "frontend_question_id": 925, "is_new_question": false }, @@ -39966,8 +40541,8 @@ "question__title": "Minimize Malware Spread", "question__title_slug": "minimize-malware-spread", "question__hide": false, - "total_acs": 43491, - "total_submitted": 103197, + "total_acs": 43651, + "total_submitted": 103576, "frontend_question_id": 924, "is_new_question": false }, @@ -39989,8 +40564,8 @@ "question__title": "3Sum With Multiplicity", "question__title_slug": "3sum-with-multiplicity", "question__hide": false, - "total_acs": 95940, - "total_submitted": 211834, + "total_acs": 96088, + "total_submitted": 212140, "frontend_question_id": 923, "is_new_question": false }, @@ -40012,8 +40587,8 @@ "question__title": "Sort Array By Parity II", "question__title_slug": "sort-array-by-parity-ii", "question__hide": false, - "total_acs": 218022, - "total_submitted": 308685, + "total_acs": 218807, + "total_submitted": 309811, "frontend_question_id": 922, "is_new_question": false }, @@ -40035,8 +40610,8 @@ "question__title": "Minimum Add to Make Parentheses Valid", "question__title_slug": "minimum-add-to-make-parentheses-valid", "question__hide": false, - "total_acs": 255120, - "total_submitted": 337265, + "total_acs": 255905, + "total_submitted": 338408, "frontend_question_id": 921, "is_new_question": false }, @@ -40058,8 +40633,8 @@ "question__title": "Number of Music Playlists", "question__title_slug": "number-of-music-playlists", "question__hide": false, - "total_acs": 22630, - "total_submitted": 44629, + "total_acs": 22683, + "total_submitted": 44736, "frontend_question_id": 920, "is_new_question": false }, @@ -40081,8 +40656,8 @@ "question__title": "Complete Binary Tree Inserter", "question__title_slug": "complete-binary-tree-inserter", "question__hide": false, - "total_acs": 45558, - "total_submitted": 70089, + "total_acs": 45637, + "total_submitted": 70379, "frontend_question_id": 919, "is_new_question": false }, @@ -40104,8 +40679,8 @@ "question__title": "Maximum Sum Circular Subarray", "question__title_slug": "maximum-sum-circular-subarray", "question__hide": false, - "total_acs": 208033, - "total_submitted": 483508, + "total_acs": 208931, + "total_submitted": 485097, "frontend_question_id": 918, "is_new_question": false }, @@ -40127,8 +40702,8 @@ "question__title": "Reverse Only Letters", "question__title_slug": "reverse-only-letters", "question__hide": false, - "total_acs": 164450, - "total_submitted": 264223, + "total_acs": 165420, + "total_submitted": 265630, "frontend_question_id": 917, "is_new_question": false }, @@ -40150,8 +40725,8 @@ "question__title": "Word Subsets", "question__title_slug": "word-subsets", "question__hide": false, - "total_acs": 108388, - "total_submitted": 201923, + "total_acs": 108536, + "total_submitted": 202326, "frontend_question_id": 916, "is_new_question": false }, @@ -40173,8 +40748,8 @@ "question__title": "Partition Array into Disjoint Intervals", "question__title_slug": "partition-array-into-disjoint-intervals", "question__hide": false, - "total_acs": 74699, - "total_submitted": 154000, + "total_acs": 74984, + "total_submitted": 154611, "frontend_question_id": 915, "is_new_question": false }, @@ -40196,8 +40771,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": 104882, - "total_submitted": 337691, + "total_acs": 105287, + "total_submitted": 339490, "frontend_question_id": 914, "is_new_question": false }, @@ -40219,8 +40794,8 @@ "question__title": "Cat and Mouse", "question__title_slug": "cat-and-mouse", "question__hide": false, - "total_acs": 17272, - "total_submitted": 49602, + "total_acs": 17312, + "total_submitted": 49763, "frontend_question_id": 913, "is_new_question": false }, @@ -40242,8 +40817,8 @@ "question__title": "Sort an Array", "question__title_slug": "sort-an-array", "question__hide": false, - "total_acs": 454890, - "total_submitted": 766783, + "total_acs": 458265, + "total_submitted": 773800, "frontend_question_id": 912, "is_new_question": false }, @@ -40265,8 +40840,8 @@ "question__title": "Online Election", "question__title_slug": "online-election", "question__hide": false, - "total_acs": 49368, - "total_submitted": 94653, + "total_acs": 49655, + "total_submitted": 95135, "frontend_question_id": 911, "is_new_question": false }, @@ -40288,8 +40863,8 @@ "question__title": "Smallest Range II", "question__title_slug": "smallest-range-ii", "question__hide": false, - "total_acs": 46922, - "total_submitted": 133066, + "total_acs": 47099, + "total_submitted": 133479, "frontend_question_id": 910, "is_new_question": false }, @@ -40311,8 +40886,8 @@ "question__title": "Snakes and Ladders", "question__title_slug": "snakes-and-ladders", "question__hide": false, - "total_acs": 137292, - "total_submitted": 304509, + "total_acs": 137830, + "total_submitted": 305676, "frontend_question_id": 909, "is_new_question": false }, @@ -40334,8 +40909,8 @@ "question__title": "Smallest Range I", "question__title_slug": "smallest-range-i", "question__hide": false, - "total_acs": 72424, - "total_submitted": 105966, + "total_acs": 72739, + "total_submitted": 106413, "frontend_question_id": 908, "is_new_question": false }, @@ -40357,8 +40932,8 @@ "question__title": "Sum of Subarray Minimums", "question__title_slug": "sum-of-subarray-minimums", "question__hide": false, - "total_acs": 145008, - "total_submitted": 405949, + "total_acs": 145521, + "total_submitted": 407622, "frontend_question_id": 907, "is_new_question": false }, @@ -40380,8 +40955,8 @@ "question__title": "Super Palindromes", "question__title_slug": "super-palindromes", "question__hide": false, - "total_acs": 22649, - "total_submitted": 58245, + "total_acs": 22679, + "total_submitted": 58324, "frontend_question_id": 906, "is_new_question": false }, @@ -40403,8 +40978,8 @@ "question__title": "Sort Array By Parity", "question__title_slug": "sort-array-by-parity", "question__hide": false, - "total_acs": 599066, - "total_submitted": 792710, + "total_acs": 601081, + "total_submitted": 795439, "frontend_question_id": 905, "is_new_question": false }, @@ -40426,8 +41001,8 @@ "question__title": "Fruit Into Baskets", "question__title_slug": "fruit-into-baskets", "question__hide": false, - "total_acs": 332295, - "total_submitted": 760254, + "total_acs": 333541, + "total_submitted": 763155, "frontend_question_id": 904, "is_new_question": false }, @@ -40449,8 +41024,8 @@ "question__title": "Valid Permutations for DI Sequence", "question__title_slug": "valid-permutations-for-di-sequence", "question__hide": false, - "total_acs": 13768, - "total_submitted": 23890, + "total_acs": 13833, + "total_submitted": 23986, "frontend_question_id": 903, "is_new_question": false }, @@ -40472,8 +41047,8 @@ "question__title": "Numbers At Most N Given Digit Set", "question__title_slug": "numbers-at-most-n-given-digit-set", "question__hide": false, - "total_acs": 40040, - "total_submitted": 96528, + "total_acs": 40109, + "total_submitted": 96683, "frontend_question_id": 902, "is_new_question": false }, @@ -40495,8 +41070,8 @@ "question__title": "Online Stock Span", "question__title_slug": "online-stock-span", "question__hide": false, - "total_acs": 221863, - "total_submitted": 339927, + "total_acs": 223218, + "total_submitted": 342074, "frontend_question_id": 901, "is_new_question": false }, @@ -40518,8 +41093,8 @@ "question__title": "RLE Iterator", "question__title_slug": "rle-iterator", "question__hide": false, - "total_acs": 63699, - "total_submitted": 107203, + "total_acs": 63882, + "total_submitted": 107503, "frontend_question_id": 900, "is_new_question": false }, @@ -40541,8 +41116,8 @@ "question__title": "Orderly Queue", "question__title_slug": "orderly-queue", "question__hide": false, - "total_acs": 64990, - "total_submitted": 98236, + "total_acs": 65114, + "total_submitted": 98537, "frontend_question_id": 899, "is_new_question": false }, @@ -40564,8 +41139,8 @@ "question__title": "Bitwise ORs of Subarrays", "question__title_slug": "bitwise-ors-of-subarrays", "question__hide": false, - "total_acs": 30891, - "total_submitted": 82782, + "total_acs": 30984, + "total_submitted": 83057, "frontend_question_id": 898, "is_new_question": false }, @@ -40587,8 +41162,8 @@ "question__title": "Increasing Order Search Tree", "question__title_slug": "increasing-order-search-tree", "question__hide": false, - "total_acs": 248415, - "total_submitted": 316986, + "total_acs": 249186, + "total_submitted": 318003, "frontend_question_id": 897, "is_new_question": false }, @@ -40610,8 +41185,8 @@ "question__title": "Monotonic Array", "question__title_slug": "monotonic-array", "question__hide": false, - "total_acs": 259674, - "total_submitted": 444647, + "total_acs": 261252, + "total_submitted": 447155, "frontend_question_id": 896, "is_new_question": false }, @@ -40633,8 +41208,8 @@ "question__title": "Maximum Frequency Stack", "question__title_slug": "maximum-frequency-stack", "question__hide": false, - "total_acs": 152011, - "total_submitted": 228306, + "total_acs": 152547, + "total_submitted": 229140, "frontend_question_id": 895, "is_new_question": false }, @@ -40656,8 +41231,8 @@ "question__title": "All Possible Full Binary Trees", "question__title_slug": "all-possible-full-binary-trees", "question__hide": false, - "total_acs": 107753, - "total_submitted": 134767, + "total_acs": 108328, + "total_submitted": 135477, "frontend_question_id": 894, "is_new_question": false }, @@ -40679,8 +41254,8 @@ "question__title": "Groups of Special-Equivalent Strings", "question__title_slug": "groups-of-special-equivalent-strings", "question__hide": false, - "total_acs": 45010, - "total_submitted": 63324, + "total_acs": 45083, + "total_submitted": 63426, "frontend_question_id": 893, "is_new_question": false }, @@ -40702,8 +41277,8 @@ "question__title": "Surface Area of 3D Shapes", "question__title_slug": "surface-area-of-3d-shapes", "question__hide": false, - "total_acs": 34244, - "total_submitted": 53366, + "total_acs": 34431, + "total_submitted": 53597, "frontend_question_id": 892, "is_new_question": false }, @@ -40725,8 +41300,8 @@ "question__title": "Sum of Subsequence Widths", "question__title_slug": "sum-of-subsequence-widths", "question__hide": false, - "total_acs": 18613, - "total_submitted": 50699, + "total_acs": 18683, + "total_submitted": 50815, "frontend_question_id": 891, "is_new_question": false }, @@ -40748,8 +41323,8 @@ "question__title": "Find and Replace Pattern", "question__title_slug": "find-and-replace-pattern", "question__hide": false, - "total_acs": 169582, - "total_submitted": 218844, + "total_acs": 169916, + "total_submitted": 219398, "frontend_question_id": 890, "is_new_question": false }, @@ -40771,8 +41346,8 @@ "question__title": "Construct Binary Tree from Preorder and Postorder Traversal", "question__title_slug": "construct-binary-tree-from-preorder-and-postorder-traversal", "question__hide": false, - "total_acs": 88611, - "total_submitted": 124714, + "total_acs": 89005, + "total_submitted": 125269, "frontend_question_id": 889, "is_new_question": false }, @@ -40794,8 +41369,8 @@ "question__title": "Fair Candy Swap", "question__title_slug": "fair-candy-swap", "question__hide": false, - "total_acs": 101465, - "total_submitted": 166971, + "total_acs": 101873, + "total_submitted": 167589, "frontend_question_id": 888, "is_new_question": false }, @@ -40817,8 +41392,8 @@ "question__title": "Super Egg Drop", "question__title_slug": "super-egg-drop", "question__hide": false, - "total_acs": 59748, - "total_submitted": 220245, + "total_acs": 59952, + "total_submitted": 220954, "frontend_question_id": 887, "is_new_question": false }, @@ -40840,8 +41415,8 @@ "question__title": "Possible Bipartition", "question__title_slug": "possible-bipartition", "question__hide": false, - "total_acs": 182691, - "total_submitted": 364995, + "total_acs": 183430, + "total_submitted": 366333, "frontend_question_id": 886, "is_new_question": false }, @@ -40863,8 +41438,8 @@ "question__title": "Spiral Matrix III", "question__title_slug": "spiral-matrix-iii", "question__hide": false, - "total_acs": 41789, - "total_submitted": 56835, + "total_acs": 42469, + "total_submitted": 57665, "frontend_question_id": 885, "is_new_question": false }, @@ -40886,8 +41461,8 @@ "question__title": "Uncommon Words from Two Sentences", "question__title_slug": "uncommon-words-from-two-sentences", "question__hide": false, - "total_acs": 118098, - "total_submitted": 177789, + "total_acs": 118618, + "total_submitted": 178607, "frontend_question_id": 884, "is_new_question": false }, @@ -40909,8 +41484,8 @@ "question__title": "Projection Area of 3D Shapes", "question__title_slug": "projection-area-of-3d-shapes", "question__hide": false, - "total_acs": 47822, - "total_submitted": 67000, + "total_acs": 48033, + "total_submitted": 67261, "frontend_question_id": 883, "is_new_question": false }, @@ -40932,8 +41507,8 @@ "question__title": "Reachable Nodes In Subdivided Graph", "question__title_slug": "reachable-nodes-in-subdivided-graph", "question__hide": false, - "total_acs": 23814, - "total_submitted": 47592, + "total_acs": 23884, + "total_submitted": 47740, "frontend_question_id": 882, "is_new_question": false }, @@ -40955,8 +41530,8 @@ "question__title": "Boats to Save People", "question__title_slug": "boats-to-save-people", "question__hide": false, - "total_acs": 249599, - "total_submitted": 447459, + "total_acs": 250432, + "total_submitted": 448906, "frontend_question_id": 881, "is_new_question": false }, @@ -40978,8 +41553,8 @@ "question__title": "Decoded String at Index", "question__title_slug": "decoded-string-at-index", "question__hide": false, - "total_acs": 36614, - "total_submitted": 129255, + "total_acs": 36715, + "total_submitted": 129498, "frontend_question_id": 880, "is_new_question": false }, @@ -41001,8 +41576,8 @@ "question__title": "Generate Random Point in a Circle", "question__title_slug": "generate-random-point-in-a-circle", "question__hide": false, - "total_acs": 37138, - "total_submitted": 93882, + "total_acs": 37229, + "total_submitted": 94151, "frontend_question_id": 478, "is_new_question": false }, @@ -41024,8 +41599,8 @@ "question__title": "Random Point in Non-overlapping Rectangles", "question__title_slug": "random-point-in-non-overlapping-rectangles", "question__hide": false, - "total_acs": 36988, - "total_submitted": 93956, + "total_acs": 37084, + "total_submitted": 94172, "frontend_question_id": 497, "is_new_question": false }, @@ -41047,8 +41622,8 @@ "question__title": "Random Flip Matrix", "question__title_slug": "random-flip-matrix", "question__hide": false, - "total_acs": 16390, - "total_submitted": 40872, + "total_acs": 16467, + "total_submitted": 41017, "frontend_question_id": 519, "is_new_question": false }, @@ -41070,8 +41645,8 @@ "question__title": "Random Pick with Weight", "question__title_slug": "random-pick-with-weight", "question__hide": false, - "total_acs": 361591, - "total_submitted": 784634, + "total_acs": 362597, + "total_submitted": 786725, "frontend_question_id": 528, "is_new_question": false }, @@ -41093,8 +41668,8 @@ "question__title": "Profitable Schemes", "question__title_slug": "profitable-schemes", "question__hide": false, - "total_acs": 56172, - "total_submitted": 113458, + "total_acs": 56437, + "total_submitted": 114025, "frontend_question_id": 879, "is_new_question": false }, @@ -41116,8 +41691,8 @@ "question__title": "Nth Magical Number", "question__title_slug": "nth-magical-number", "question__hide": false, - "total_acs": 33292, - "total_submitted": 94251, + "total_acs": 33371, + "total_submitted": 94468, "frontend_question_id": 878, "is_new_question": false }, @@ -41139,8 +41714,8 @@ "question__title": "Stone Game", "question__title_slug": "stone-game", "question__hide": false, - "total_acs": 185948, - "total_submitted": 266519, + "total_acs": 186616, + "total_submitted": 267489, "frontend_question_id": 877, "is_new_question": false }, @@ -41162,8 +41737,8 @@ "question__title": "Middle of the Linked List", "question__title_slug": "middle-of-the-linked-list", "question__hide": false, - "total_acs": 1313635, - "total_submitted": 1732848, + "total_acs": 1326884, + "total_submitted": 1749092, "frontend_question_id": 876, "is_new_question": false }, @@ -41185,8 +41760,8 @@ "question__title": "Koko Eating Bananas", "question__title_slug": "koko-eating-bananas", "question__hide": false, - "total_acs": 355472, - "total_submitted": 682847, + "total_acs": 358856, + "total_submitted": 690338, "frontend_question_id": 875, "is_new_question": false }, @@ -41208,8 +41783,8 @@ "question__title": "Walking Robot Simulation", "question__title_slug": "walking-robot-simulation", "question__hide": false, - "total_acs": 36658, - "total_submitted": 93812, + "total_acs": 36779, + "total_submitted": 94056, "frontend_question_id": 874, "is_new_question": false }, @@ -41231,8 +41806,8 @@ "question__title": "Length of Longest Fibonacci Subsequence", "question__title_slug": "length-of-longest-fibonacci-subsequence", "question__hide": false, - "total_acs": 56156, - "total_submitted": 116282, + "total_acs": 56282, + "total_submitted": 116547, "frontend_question_id": 873, "is_new_question": false }, @@ -41254,8 +41829,8 @@ "question__title": "Leaf-Similar Trees", "question__title_slug": "leaf-similar-trees", "question__hide": false, - "total_acs": 254114, - "total_submitted": 375743, + "total_acs": 255317, + "total_submitted": 377417, "frontend_question_id": 872, "is_new_question": false }, @@ -41277,8 +41852,8 @@ "question__title": "Implement Rand10() Using Rand7()", "question__title_slug": "implement-rand10-using-rand7", "question__hide": false, - "total_acs": 71614, - "total_submitted": 154630, + "total_acs": 71851, + "total_submitted": 155315, "frontend_question_id": 470, "is_new_question": false }, @@ -41300,8 +41875,8 @@ "question__title": "Minimum Number of Refueling Stops", "question__title_slug": "minimum-number-of-refueling-stops", "question__hide": false, - "total_acs": 122718, - "total_submitted": 308429, + "total_acs": 122905, + "total_submitted": 309016, "frontend_question_id": 871, "is_new_question": false }, @@ -41323,8 +41898,8 @@ "question__title": "Advantage Shuffle", "question__title_slug": "advantage-shuffle", "question__hide": false, - "total_acs": 60551, - "total_submitted": 116720, + "total_acs": 60716, + "total_submitted": 116990, "frontend_question_id": 870, "is_new_question": false }, @@ -41346,8 +41921,8 @@ "question__title": "Reordered Power of 2", "question__title_slug": "reordered-power-of-2", "question__hide": false, - "total_acs": 107233, - "total_submitted": 169033, + "total_acs": 107380, + "total_submitted": 169350, "frontend_question_id": 869, "is_new_question": false }, @@ -41369,8 +41944,8 @@ "question__title": "Binary Gap", "question__title_slug": "binary-gap", "question__hide": false, - "total_acs": 69300, - "total_submitted": 111296, + "total_acs": 69566, + "total_submitted": 111674, "frontend_question_id": 868, "is_new_question": false }, @@ -41392,8 +41967,8 @@ "question__title": "Transpose Matrix", "question__title_slug": "transpose-matrix", "question__hide": false, - "total_acs": 243236, - "total_submitted": 377338, + "total_acs": 244660, + "total_submitted": 379024, "frontend_question_id": 867, "is_new_question": false }, @@ -41415,8 +41990,8 @@ "question__title": "Prime Palindrome", "question__title_slug": "prime-palindrome", "question__hide": false, - "total_acs": 28407, - "total_submitted": 110308, + "total_acs": 28502, + "total_submitted": 110706, "frontend_question_id": 866, "is_new_question": false }, @@ -41438,8 +42013,8 @@ "question__title": "Smallest Subtree with all the Deepest Nodes", "question__title_slug": "smallest-subtree-with-all-the-deepest-nodes", "question__hide": false, - "total_acs": 116521, - "total_submitted": 168886, + "total_acs": 116765, + "total_submitted": 169236, "frontend_question_id": 865, "is_new_question": false }, @@ -41461,8 +42036,8 @@ "question__title": "Shortest Path to Get All Keys", "question__title_slug": "shortest-path-to-get-all-keys", "question__hide": false, - "total_acs": 31012, - "total_submitted": 68097, + "total_acs": 31185, + "total_submitted": 68460, "frontend_question_id": 864, "is_new_question": false }, @@ -41484,8 +42059,8 @@ "question__title": "Random Pick with Blacklist", "question__title_slug": "random-pick-with-blacklist", "question__hide": false, - "total_acs": 36426, - "total_submitted": 108718, + "total_acs": 36546, + "total_submitted": 109104, "frontend_question_id": 710, "is_new_question": false }, @@ -41507,8 +42082,8 @@ "question__title": "All Nodes Distance K in Binary Tree", "question__title_slug": "all-nodes-distance-k-in-binary-tree", "question__hide": false, - "total_acs": 302660, - "total_submitted": 485830, + "total_acs": 303894, + "total_submitted": 487578, "frontend_question_id": 863, "is_new_question": false }, @@ -41530,8 +42105,8 @@ "question__title": "Shortest Subarray with Sum at Least K", "question__title_slug": "shortest-subarray-with-sum-at-least-k", "question__hide": false, - "total_acs": 85463, - "total_submitted": 328680, + "total_acs": 85824, + "total_submitted": 330097, "frontend_question_id": 862, "is_new_question": false }, @@ -41553,8 +42128,8 @@ "question__title": "Score After Flipping Matrix", "question__title_slug": "score-after-flipping-matrix", "question__hide": false, - "total_acs": 41521, - "total_submitted": 55446, + "total_acs": 41697, + "total_submitted": 55693, "frontend_question_id": 861, "is_new_question": false }, @@ -41576,8 +42151,8 @@ "question__title": "Lemonade Change", "question__title_slug": "lemonade-change", "question__hide": false, - "total_acs": 128538, - "total_submitted": 243037, + "total_acs": 129450, + "total_submitted": 244674, "frontend_question_id": 860, "is_new_question": false }, @@ -41599,8 +42174,8 @@ "question__title": "Buddy Strings", "question__title_slug": "buddy-strings", "question__hide": false, - "total_acs": 146339, - "total_submitted": 501096, + "total_acs": 146770, + "total_submitted": 502723, "frontend_question_id": 859, "is_new_question": false }, @@ -41622,8 +42197,8 @@ "question__title": "Mirror Reflection", "question__title_slug": "mirror-reflection", "question__hide": false, - "total_acs": 75928, - "total_submitted": 120469, + "total_acs": 76000, + "total_submitted": 120593, "frontend_question_id": 858, "is_new_question": false }, @@ -41645,8 +42220,8 @@ "question__title": "Minimum Cost to Hire K Workers", "question__title_slug": "minimum-cost-to-hire-k-workers", "question__hide": false, - "total_acs": 58823, - "total_submitted": 112657, + "total_acs": 59054, + "total_submitted": 112963, "frontend_question_id": 857, "is_new_question": false }, @@ -41668,8 +42243,8 @@ "question__title": "Score of Parentheses", "question__title_slug": "score-of-parentheses", "question__hide": false, - "total_acs": 157433, - "total_submitted": 243402, + "total_acs": 157766, + "total_submitted": 244025, "frontend_question_id": 856, "is_new_question": false }, @@ -41691,8 +42266,8 @@ "question__title": "Exam Room", "question__title_slug": "exam-room", "question__hide": false, - "total_acs": 54808, - "total_submitted": 126290, + "total_acs": 54931, + "total_submitted": 126576, "frontend_question_id": 855, "is_new_question": false }, @@ -41714,8 +42289,8 @@ "question__title": "K-Similar Strings", "question__title_slug": "k-similar-strings", "question__hide": false, - "total_acs": 41069, - "total_submitted": 102660, + "total_acs": 41195, + "total_submitted": 102937, "frontend_question_id": 854, "is_new_question": false }, @@ -41737,8 +42312,8 @@ "question__title": "Car Fleet", "question__title_slug": "car-fleet", "question__hide": false, - "total_acs": 135136, - "total_submitted": 268521, + "total_acs": 136841, + "total_submitted": 271908, "frontend_question_id": 853, "is_new_question": false }, @@ -41760,8 +42335,8 @@ "question__title": "Peak Index in a Mountain Array", "question__title_slug": "peak-index-in-a-mountain-array", "question__hide": false, - "total_acs": 549211, - "total_submitted": 796338, + "total_acs": 552976, + "total_submitted": 802158, "frontend_question_id": 852, "is_new_question": false }, @@ -41783,8 +42358,8 @@ "question__title": "Loud and Rich", "question__title_slug": "loud-and-rich", "question__hide": false, - "total_acs": 33500, - "total_submitted": 57250, + "total_acs": 33820, + "total_submitted": 57776, "frontend_question_id": 851, "is_new_question": false }, @@ -41806,8 +42381,8 @@ "question__title": "Rectangle Area II", "question__title_slug": "rectangle-area-ii", "question__hide": false, - "total_acs": 32615, - "total_submitted": 60504, + "total_acs": 32668, + "total_submitted": 60579, "frontend_question_id": 850, "is_new_question": false }, @@ -41829,8 +42404,8 @@ "question__title": "Maximize Distance to Closest Person", "question__title_slug": "maximize-distance-to-closest-person", "question__hide": false, - "total_acs": 199759, - "total_submitted": 419302, + "total_acs": 200353, + "total_submitted": 420633, "frontend_question_id": 849, "is_new_question": false }, @@ -41852,8 +42427,8 @@ "question__title": "Shifting Letters", "question__title_slug": "shifting-letters", "question__hide": false, - "total_acs": 85665, - "total_submitted": 189829, + "total_acs": 85906, + "total_submitted": 190356, "frontend_question_id": 848, "is_new_question": false }, @@ -41875,8 +42450,8 @@ "question__title": "Shortest Path Visiting All Nodes", "question__title_slug": "shortest-path-visiting-all-nodes", "question__hide": false, - "total_acs": 69970, - "total_submitted": 115021, + "total_acs": 70202, + "total_submitted": 115410, "frontend_question_id": 847, "is_new_question": false }, @@ -41898,8 +42473,8 @@ "question__title": "Hand of Straights", "question__title_slug": "hand-of-straights", "question__hide": false, - "total_acs": 116994, - "total_submitted": 208400, + "total_acs": 117725, + "total_submitted": 209691, "frontend_question_id": 846, "is_new_question": false }, @@ -41921,8 +42496,8 @@ "question__title": "Longest Mountain in Array", "question__title_slug": "longest-mountain-in-array", "question__hide": false, - "total_acs": 110481, - "total_submitted": 274959, + "total_acs": 110870, + "total_submitted": 275894, "frontend_question_id": 845, "is_new_question": false }, @@ -41944,8 +42519,8 @@ "question__title": "Backspace String Compare", "question__title_slug": "backspace-string-compare", "question__hide": false, - "total_acs": 631109, - "total_submitted": 1312412, + "total_acs": 634055, + "total_submitted": 1318559, "frontend_question_id": 844, "is_new_question": false }, @@ -41967,8 +42542,8 @@ "question__title": "Guess the Word", "question__title_slug": "guess-the-word", "question__hide": false, - "total_acs": 130922, - "total_submitted": 317170, + "total_acs": 131178, + "total_submitted": 318133, "frontend_question_id": 843, "is_new_question": false }, @@ -41990,8 +42565,8 @@ "question__title": "Split Array into Fibonacci Sequence", "question__title_slug": "split-array-into-fibonacci-sequence", "question__hide": false, - "total_acs": 35325, - "total_submitted": 91885, + "total_acs": 35419, + "total_submitted": 92167, "frontend_question_id": 842, "is_new_question": false }, @@ -42013,8 +42588,8 @@ "question__title": "Keys and Rooms", "question__title_slug": "keys-and-rooms", "question__hide": false, - "total_acs": 318538, - "total_submitted": 444745, + "total_acs": 320267, + "total_submitted": 447014, "frontend_question_id": 841, "is_new_question": false }, @@ -42036,8 +42611,8 @@ "question__title": "Magic Squares In Grid", "question__title_slug": "magic-squares-in-grid", "question__hide": false, - "total_acs": 35513, - "total_submitted": 91885, + "total_acs": 35577, + "total_submitted": 92064, "frontend_question_id": 840, "is_new_question": false }, @@ -42059,8 +42634,8 @@ "question__title": "Similar String Groups", "question__title_slug": "similar-string-groups", "question__hide": false, - "total_acs": 106950, - "total_submitted": 196777, + "total_acs": 107505, + "total_submitted": 197730, "frontend_question_id": 839, "is_new_question": false }, @@ -42082,8 +42657,8 @@ "question__title": "Push Dominoes", "question__title_slug": "push-dominoes", "question__hide": false, - "total_acs": 112897, - "total_submitted": 198138, + "total_acs": 113136, + "total_submitted": 198513, "frontend_question_id": 838, "is_new_question": false }, @@ -42105,8 +42680,8 @@ "question__title": "New 21 Game", "question__title_slug": "new-21-game", "question__hide": false, - "total_acs": 34846, - "total_submitted": 96342, + "total_acs": 34933, + "total_submitted": 96561, "frontend_question_id": 837, "is_new_question": false }, @@ -42128,8 +42703,8 @@ "question__title": "Rectangle Overlap", "question__title_slug": "rectangle-overlap", "question__hide": false, - "total_acs": 123794, - "total_submitted": 281918, + "total_acs": 124285, + "total_submitted": 282981, "frontend_question_id": 836, "is_new_question": false }, @@ -42151,8 +42726,8 @@ "question__title": "Robot Room Cleaner", "question__title_slug": "robot-room-cleaner", "question__hide": false, - "total_acs": 143763, - "total_submitted": 187770, + "total_acs": 144064, + "total_submitted": 188175, "frontend_question_id": 489, "is_new_question": false }, @@ -42174,8 +42749,8 @@ "question__title": "Image Overlap", "question__title_slug": "image-overlap", "question__hide": false, - "total_acs": 89152, - "total_submitted": 139660, + "total_acs": 89252, + "total_submitted": 139882, "frontend_question_id": 835, "is_new_question": false }, @@ -42197,8 +42772,8 @@ "question__title": "Sum of Distances in Tree", "question__title_slug": "sum-of-distances-in-tree", "question__hide": false, - "total_acs": 81578, - "total_submitted": 137966, + "total_acs": 81830, + "total_submitted": 138502, "frontend_question_id": 834, "is_new_question": false }, @@ -42220,8 +42795,8 @@ "question__title": "Find And Replace in String", "question__title_slug": "find-and-replace-in-string", "question__hide": false, - "total_acs": 134477, - "total_submitted": 249247, + "total_acs": 134765, + "total_submitted": 249871, "frontend_question_id": 833, "is_new_question": false }, @@ -42243,8 +42818,8 @@ "question__title": "Flipping an Image", "question__title_slug": "flipping-an-image", "question__hide": false, - "total_acs": 359390, - "total_submitted": 444563, + "total_acs": 360979, + "total_submitted": 446476, "frontend_question_id": 832, "is_new_question": false }, @@ -42266,8 +42841,8 @@ "question__title": "Design Circular Queue", "question__title_slug": "design-circular-queue", "question__hide": false, - "total_acs": 263988, - "total_submitted": 512581, + "total_acs": 265081, + "total_submitted": 514833, "frontend_question_id": 622, "is_new_question": false }, @@ -42289,8 +42864,8 @@ "question__title": "Design Circular Deque", "question__title_slug": "design-circular-deque", "question__hide": false, - "total_acs": 55859, - "total_submitted": 97635, + "total_acs": 56110, + "total_submitted": 98053, "frontend_question_id": 641, "is_new_question": false }, @@ -42312,8 +42887,8 @@ "question__title": "Masking Personal Information", "question__title_slug": "masking-personal-information", "question__hide": false, - "total_acs": 16834, - "total_submitted": 35440, + "total_acs": 16894, + "total_submitted": 35542, "frontend_question_id": 831, "is_new_question": false }, @@ -42335,8 +42910,8 @@ "question__title": "Positions of Large Groups", "question__title_slug": "positions-of-large-groups", "question__hide": false, - "total_acs": 82959, - "total_submitted": 160011, + "total_acs": 83292, + "total_submitted": 160624, "frontend_question_id": 830, "is_new_question": false }, @@ -42358,8 +42933,8 @@ "question__title": "Consecutive Numbers Sum", "question__title_slug": "consecutive-numbers-sum", "question__hide": false, - "total_acs": 78344, - "total_submitted": 188411, + "total_acs": 78493, + "total_submitted": 188728, "frontend_question_id": 829, "is_new_question": false }, @@ -42381,8 +42956,8 @@ "question__title": "Count Unique Characters of All Substrings of a Given String", "question__title_slug": "count-unique-characters-of-all-substrings-of-a-given-string", "question__hide": false, - "total_acs": 63949, - "total_submitted": 123917, + "total_acs": 64080, + "total_submitted": 124156, "frontend_question_id": 828, "is_new_question": false }, @@ -42404,8 +42979,8 @@ "question__title": "Making A Large Island", "question__title_slug": "making-a-large-island", "question__hide": false, - "total_acs": 129487, - "total_submitted": 288141, + "total_acs": 129860, + "total_submitted": 288861, "frontend_question_id": 827, "is_new_question": false }, @@ -42427,8 +43002,8 @@ "question__title": "Most Profit Assigning Work", "question__title_slug": "most-profit-assigning-work", "question__hide": false, - "total_acs": 54800, - "total_submitted": 121953, + "total_acs": 55074, + "total_submitted": 122477, "frontend_question_id": 826, "is_new_question": false }, @@ -42450,8 +43025,8 @@ "question__title": "Friends Of Appropriate Ages", "question__title_slug": "friends-of-appropriate-ages", "question__hide": false, - "total_acs": 71195, - "total_submitted": 153801, + "total_acs": 71327, + "total_submitted": 154029, "frontend_question_id": 825, "is_new_question": false }, @@ -42473,8 +43048,8 @@ "question__title": "Goat Latin", "question__title_slug": "goat-latin", "question__hide": false, - "total_acs": 157301, - "total_submitted": 231576, + "total_acs": 157693, + "total_submitted": 232153, "frontend_question_id": 824, "is_new_question": false }, @@ -42496,8 +43071,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": 130122, - "total_submitted": 376580, + "total_acs": 130352, + "total_submitted": 377098, "frontend_question_id": 708, "is_new_question": false }, @@ -42519,8 +43094,8 @@ "question__title": "Binary Trees With Factors", "question__title_slug": "binary-trees-with-factors", "question__hide": false, - "total_acs": 89932, - "total_submitted": 181033, + "total_acs": 90029, + "total_submitted": 181242, "frontend_question_id": 823, "is_new_question": false }, @@ -42542,8 +43117,8 @@ "question__title": "Card Flipping Game", "question__title_slug": "card-flipping-game", "question__hide": false, - "total_acs": 15454, - "total_submitted": 33505, + "total_acs": 15521, + "total_submitted": 33779, "frontend_question_id": 822, "is_new_question": false }, @@ -42565,8 +43140,8 @@ "question__title": "Shortest Distance to a Character", "question__title_slug": "shortest-distance-to-a-character", "question__hide": false, - "total_acs": 158018, - "total_submitted": 221575, + "total_acs": 158558, + "total_submitted": 222353, "frontend_question_id": 821, "is_new_question": false }, @@ -42588,8 +43163,8 @@ "question__title": "Short Encoding of Words", "question__title_slug": "short-encoding-of-words", "question__hide": false, - "total_acs": 91829, - "total_submitted": 151607, + "total_acs": 91933, + "total_submitted": 151779, "frontend_question_id": 820, "is_new_question": false }, @@ -42611,8 +43186,8 @@ "question__title": "Design Linked List", "question__title_slug": "design-linked-list", "question__hide": false, - "total_acs": 256872, - "total_submitted": 928177, + "total_acs": 258257, + "total_submitted": 932841, "frontend_question_id": 707, "is_new_question": false }, @@ -42634,8 +43209,8 @@ "question__title": "Most Common Word", "question__title_slug": "most-common-word", "question__hide": false, - "total_acs": 324875, - "total_submitted": 726585, + "total_acs": 325515, + "total_submitted": 728220, "frontend_question_id": 819, "is_new_question": false }, @@ -42657,8 +43232,8 @@ "question__title": "Race Car", "question__title_slug": "race-car", "question__hide": false, - "total_acs": 76061, - "total_submitted": 175526, + "total_acs": 76424, + "total_submitted": 176249, "frontend_question_id": 818, "is_new_question": false }, @@ -42680,8 +43255,8 @@ "question__title": "Linked List Components", "question__title_slug": "linked-list-components", "question__hide": false, - "total_acs": 80437, - "total_submitted": 139674, + "total_acs": 80679, + "total_submitted": 140160, "frontend_question_id": 817, "is_new_question": false }, @@ -42703,8 +43278,8 @@ "question__title": "Ambiguous Coordinates", "question__title_slug": "ambiguous-coordinates", "question__hide": false, - "total_acs": 27702, - "total_submitted": 49177, + "total_acs": 27756, + "total_submitted": 49262, "frontend_question_id": 816, "is_new_question": false }, @@ -42726,8 +43301,8 @@ "question__title": "Bus Routes", "question__title_slug": "bus-routes", "question__hide": false, - "total_acs": 124633, - "total_submitted": 273205, + "total_acs": 125434, + "total_submitted": 274948, "frontend_question_id": 815, "is_new_question": false }, @@ -42749,8 +43324,8 @@ "question__title": "Binary Tree Pruning", "question__title_slug": "binary-tree-pruning", "question__hide": false, - "total_acs": 225034, - "total_submitted": 310776, + "total_acs": 225397, + "total_submitted": 311320, "frontend_question_id": 814, "is_new_question": false }, @@ -42772,8 +43347,8 @@ "question__title": "Largest Sum of Averages", "question__title_slug": "largest-sum-of-averages", "question__hide": false, - "total_acs": 46511, - "total_submitted": 87849, + "total_acs": 46688, + "total_submitted": 88173, "frontend_question_id": 813, "is_new_question": false }, @@ -42795,8 +43370,8 @@ "question__title": "Largest Triangle Area", "question__title_slug": "largest-triangle-area", "question__hide": false, - "total_acs": 41391, - "total_submitted": 69089, + "total_acs": 41609, + "total_submitted": 69420, "frontend_question_id": 812, "is_new_question": false }, @@ -42818,8 +43393,8 @@ "question__title": "Subdomain Visit Count", "question__title_slug": "subdomain-visit-count", "question__hide": false, - "total_acs": 208839, - "total_submitted": 276470, + "total_acs": 209241, + "total_submitted": 276951, "frontend_question_id": 811, "is_new_question": false }, @@ -42841,8 +43416,8 @@ "question__title": "Chalkboard XOR Game", "question__title_slug": "chalkboard-xor-game", "question__hide": false, - "total_acs": 8295, - "total_submitted": 14801, + "total_acs": 8342, + "total_submitted": 14867, "frontend_question_id": 810, "is_new_question": false }, @@ -42864,8 +43439,8 @@ "question__title": "Expressive Words", "question__title_slug": "expressive-words", "question__hide": false, - "total_acs": 107612, - "total_submitted": 232884, + "total_acs": 107841, + "total_submitted": 233373, "frontend_question_id": 809, "is_new_question": false }, @@ -42887,8 +43462,8 @@ "question__title": "Soup Servings", "question__title_slug": "soup-servings", "question__hide": false, - "total_acs": 17785, - "total_submitted": 40849, + "total_acs": 17872, + "total_submitted": 41014, "frontend_question_id": 808, "is_new_question": false }, @@ -42910,8 +43485,8 @@ "question__title": "Max Increase to Keep City Skyline", "question__title_slug": "max-increase-to-keep-city-skyline", "question__hide": false, - "total_acs": 145848, - "total_submitted": 169656, + "total_acs": 146266, + "total_submitted": 170145, "frontend_question_id": 807, "is_new_question": false }, @@ -42933,8 +43508,8 @@ "question__title": "Number of Lines To Write String", "question__title_slug": "number-of-lines-to-write-string", "question__hide": false, - "total_acs": 64995, - "total_submitted": 97351, + "total_acs": 65333, + "total_submitted": 97776, "frontend_question_id": 806, "is_new_question": false }, @@ -42956,8 +43531,8 @@ "question__title": "Split Array With Same Average", "question__title_slug": "split-array-with-same-average", "question__hide": false, - "total_acs": 30459, - "total_submitted": 118696, + "total_acs": 30544, + "total_submitted": 119083, "frontend_question_id": 805, "is_new_question": false }, @@ -42979,8 +43554,8 @@ "question__title": "Unique Morse Code Words", "question__title_slug": "unique-morse-code-words", "question__hide": false, - "total_acs": 315076, - "total_submitted": 381240, + "total_acs": 315941, + "total_submitted": 382278, "frontend_question_id": 804, "is_new_question": false }, @@ -43002,8 +43577,8 @@ "question__title": "Bricks Falling When Hit", "question__title_slug": "bricks-falling-when-hit", "question__hide": false, - "total_acs": 27861, - "total_submitted": 81024, + "total_acs": 27907, + "total_submitted": 81155, "frontend_question_id": 803, "is_new_question": false }, @@ -43025,8 +43600,8 @@ "question__title": "Find Eventual Safe States", "question__title_slug": "find-eventual-safe-states", "question__hide": false, - "total_acs": 124857, - "total_submitted": 219414, + "total_acs": 126416, + "total_submitted": 221558, "frontend_question_id": 802, "is_new_question": false }, @@ -43048,8 +43623,8 @@ "question__title": "Minimum Swaps To Make Sequences Increasing", "question__title_slug": "minimum-swaps-to-make-sequences-increasing", "question__hide": false, - "total_acs": 63237, - "total_submitted": 160722, + "total_acs": 63495, + "total_submitted": 161271, "frontend_question_id": 801, "is_new_question": false }, @@ -43071,8 +43646,8 @@ "question__title": "Similar RGB Color", "question__title_slug": "similar-rgb-color", "question__hide": false, - "total_acs": 16345, - "total_submitted": 24378, + "total_acs": 16370, + "total_submitted": 24413, "frontend_question_id": 800, "is_new_question": false }, @@ -43094,8 +43669,8 @@ "question__title": "Design HashMap", "question__title_slug": "design-hashmap", "question__hide": false, - "total_acs": 410412, - "total_submitted": 634792, + "total_acs": 412286, + "total_submitted": 638000, "frontend_question_id": 706, "is_new_question": false }, @@ -43117,8 +43692,8 @@ "question__title": "Design HashSet", "question__title_slug": "design-hashset", "question__hide": false, - "total_acs": 284135, - "total_submitted": 433170, + "total_acs": 285180, + "total_submitted": 434791, "frontend_question_id": 705, "is_new_question": false }, @@ -43140,8 +43715,8 @@ "question__title": "Champagne Tower", "question__title_slug": "champagne-tower", "question__hide": false, - "total_acs": 84003, - "total_submitted": 163544, + "total_acs": 84109, + "total_submitted": 164023, "frontend_question_id": 799, "is_new_question": false }, @@ -43163,8 +43738,8 @@ "question__title": "Smallest Rotation with Highest Score", "question__title_slug": "smallest-rotation-with-highest-score", "question__hide": false, - "total_acs": 11941, - "total_submitted": 23703, + "total_acs": 11989, + "total_submitted": 23780, "frontend_question_id": 798, "is_new_question": false }, @@ -43186,8 +43761,8 @@ "question__title": "All Paths From Source to Target", "question__title_slug": "all-paths-from-source-to-target", "question__hide": false, - "total_acs": 435198, - "total_submitted": 528800, + "total_acs": 437208, + "total_submitted": 531187, "frontend_question_id": 797, "is_new_question": false }, @@ -43209,8 +43784,8 @@ "question__title": "Rotate String", "question__title_slug": "rotate-string", "question__hide": false, - "total_acs": 207778, - "total_submitted": 375030, + "total_acs": 209454, + "total_submitted": 377769, "frontend_question_id": 796, "is_new_question": false }, @@ -43232,8 +43807,8 @@ "question__title": "Number of Subarrays with Bounded Maximum", "question__title_slug": "number-of-subarrays-with-bounded-maximum", "question__hide": false, - "total_acs": 60974, - "total_submitted": 115544, + "total_acs": 61123, + "total_submitted": 115851, "frontend_question_id": 795, "is_new_question": false }, @@ -43255,8 +43830,8 @@ "question__title": "Valid Tic-Tac-Toe State", "question__title_slug": "valid-tic-tac-toe-state", "question__hide": false, - "total_acs": 54125, - "total_submitted": 154472, + "total_acs": 54249, + "total_submitted": 154905, "frontend_question_id": 794, "is_new_question": false }, @@ -43278,8 +43853,8 @@ "question__title": "Preimage Size of Factorial Zeroes Function", "question__title_slug": "preimage-size-of-factorial-zeroes-function", "question__hide": false, - "total_acs": 15497, - "total_submitted": 35807, + "total_acs": 15598, + "total_submitted": 36025, "frontend_question_id": 793, "is_new_question": false }, @@ -43301,8 +43876,8 @@ "question__title": "Number of Matching Subsequences", "question__title_slug": "number-of-matching-subsequences", "question__hide": false, - "total_acs": 209609, - "total_submitted": 406197, + "total_acs": 210031, + "total_submitted": 407115, "frontend_question_id": 792, "is_new_question": false }, @@ -43324,8 +43899,8 @@ "question__title": "Custom Sort String", "question__title_slug": "custom-sort-string", "question__hide": false, - "total_acs": 213672, - "total_submitted": 309463, + "total_acs": 214245, + "total_submitted": 310330, "frontend_question_id": 791, "is_new_question": false }, @@ -43347,8 +43922,8 @@ "question__title": "Domino and Tromino Tiling", "question__title_slug": "domino-and-tromino-tiling", "question__hide": false, - "total_acs": 94566, - "total_submitted": 179372, + "total_acs": 95037, + "total_submitted": 180371, "frontend_question_id": 790, "is_new_question": false }, @@ -43370,8 +43945,8 @@ "question__title": "Escape The Ghosts", "question__title_slug": "escape-the-ghosts", "question__hide": false, - "total_acs": 25164, - "total_submitted": 41301, + "total_acs": 25250, + "total_submitted": 41441, "frontend_question_id": 789, "is_new_question": false }, @@ -43393,8 +43968,8 @@ "question__title": "Rotated Digits", "question__title_slug": "rotated-digits", "question__hide": false, - "total_acs": 96265, - "total_submitted": 169952, + "total_acs": 96480, + "total_submitted": 170324, "frontend_question_id": 788, "is_new_question": false }, @@ -43416,8 +43991,8 @@ "question__title": "Cheapest Flights Within K Stops", "question__title_slug": "cheapest-flights-within-k-stops", "question__hide": false, - "total_acs": 367863, - "total_submitted": 992771, + "total_acs": 369801, + "total_submitted": 997792, "frontend_question_id": 787, "is_new_question": false }, @@ -43439,8 +44014,8 @@ "question__title": "K-th Smallest Prime Fraction", "question__title_slug": "k-th-smallest-prime-fraction", "question__hide": false, - "total_acs": 34917, - "total_submitted": 67342, + "total_acs": 35086, + "total_submitted": 67643, "frontend_question_id": 786, "is_new_question": false }, @@ -43462,8 +44037,8 @@ "question__title": "Is Graph Bipartite?", "question__title_slug": "is-graph-bipartite", "question__hide": false, - "total_acs": 400156, - "total_submitted": 752016, + "total_acs": 401985, + "total_submitted": 754906, "frontend_question_id": 785, "is_new_question": false }, @@ -43485,8 +44060,8 @@ "question__title": "Letter Case Permutation", "question__title_slug": "letter-case-permutation", "question__hide": false, - "total_acs": 271689, - "total_submitted": 368016, + "total_acs": 272657, + "total_submitted": 369308, "frontend_question_id": 784, "is_new_question": false }, @@ -43508,8 +44083,8 @@ "question__title": "Minimum Distance Between BST Nodes", "question__title_slug": "minimum-distance-between-bst-nodes", "question__hide": false, - "total_acs": 212740, - "total_submitted": 358872, + "total_acs": 213479, + "total_submitted": 360113, "frontend_question_id": 783, "is_new_question": false }, @@ -43531,8 +44106,8 @@ "question__title": "Transform to Chessboard", "question__title_slug": "transform-to-chessboard", "question__hide": false, - "total_acs": 15973, - "total_submitted": 31047, + "total_acs": 15993, + "total_submitted": 31090, "frontend_question_id": 782, "is_new_question": false }, @@ -43554,8 +44129,8 @@ "question__title": "Rabbits in Forest", "question__title_slug": "rabbits-in-forest", "question__hide": false, - "total_acs": 46127, - "total_submitted": 84423, + "total_acs": 46347, + "total_submitted": 84839, "frontend_question_id": 781, "is_new_question": false }, @@ -43577,8 +44152,8 @@ "question__title": "Reaching Points", "question__title_slug": "reaching-points", "question__hide": false, - "total_acs": 53786, - "total_submitted": 164615, + "total_acs": 53925, + "total_submitted": 165283, "frontend_question_id": 780, "is_new_question": false }, @@ -43600,8 +44175,8 @@ "question__title": "K-th Symbol in Grammar", "question__title_slug": "k-th-symbol-in-grammar", "question__hide": false, - "total_acs": 113531, - "total_submitted": 274416, + "total_acs": 114093, + "total_submitted": 275617, "frontend_question_id": 779, "is_new_question": false }, @@ -43623,8 +44198,8 @@ "question__title": "Swim in Rising Water", "question__title_slug": "swim-in-rising-water", "question__hide": false, - "total_acs": 116907, - "total_submitted": 195438, + "total_acs": 117508, + "total_submitted": 196444, "frontend_question_id": 778, "is_new_question": false }, @@ -43646,8 +44221,8 @@ "question__title": "Swap Adjacent in LR String", "question__title_slug": "swap-adjacent-in-lr-string", "question__hide": false, - "total_acs": 69975, - "total_submitted": 190248, + "total_acs": 70137, + "total_submitted": 190685, "frontend_question_id": 777, "is_new_question": false }, @@ -43669,8 +44244,8 @@ "question__title": "Binary Search", "question__title_slug": "binary-search", "question__hide": false, - "total_acs": 1766275, - "total_submitted": 3142175, + "total_acs": 1783470, + "total_submitted": 3171241, "frontend_question_id": 704, "is_new_question": false }, @@ -43692,8 +44267,8 @@ "question__title": "Split BST", "question__title_slug": "split-bst", "question__hide": false, - "total_acs": 85342, - "total_submitted": 105841, + "total_acs": 92257, + "total_submitted": 112800, "frontend_question_id": 776, "is_new_question": false }, @@ -43715,8 +44290,8 @@ "question__title": "Global and Local Inversions", "question__title_slug": "global-and-local-inversions", "question__hide": false, - "total_acs": 64368, - "total_submitted": 148874, + "total_acs": 64561, + "total_submitted": 149324, "frontend_question_id": 775, "is_new_question": false }, @@ -43738,8 +44313,8 @@ "question__title": "Kth Largest Element in a Stream", "question__title_slug": "kth-largest-element-in-a-stream", "question__hide": false, - "total_acs": 350291, - "total_submitted": 631515, + "total_acs": 352899, + "total_submitted": 636371, "frontend_question_id": 703, "is_new_question": false }, @@ -43761,8 +44336,8 @@ "question__title": "Minimize Max Distance to Gas Station", "question__title_slug": "minimize-max-distance-to-gas-station", "question__hide": false, - "total_acs": 28284, - "total_submitted": 54577, + "total_acs": 28332, + "total_submitted": 54654, "frontend_question_id": 774, "is_new_question": false }, @@ -43784,8 +44359,8 @@ "question__title": "Sliding Puzzle", "question__title_slug": "sliding-puzzle", "question__hide": false, - "total_acs": 84648, - "total_submitted": 132155, + "total_acs": 84957, + "total_submitted": 132588, "frontend_question_id": 773, "is_new_question": false }, @@ -43807,8 +44382,8 @@ "question__title": "Search in a Sorted Array of Unknown Size", "question__title_slug": "search-in-a-sorted-array-of-unknown-size", "question__hide": false, - "total_acs": 86960, - "total_submitted": 121570, + "total_acs": 87191, + "total_submitted": 121872, "frontend_question_id": 702, "is_new_question": false }, @@ -43830,8 +44405,8 @@ "question__title": "Basic Calculator III", "question__title_slug": "basic-calculator-iii", "question__hide": false, - "total_acs": 104109, - "total_submitted": 212748, + "total_acs": 104398, + "total_submitted": 213190, "frontend_question_id": 772, "is_new_question": false }, @@ -43853,8 +44428,8 @@ "question__title": "Insert into a Binary Search Tree", "question__title_slug": "insert-into-a-binary-search-tree", "question__hide": false, - "total_acs": 408788, - "total_submitted": 550620, + "total_acs": 411071, + "total_submitted": 553822, "frontend_question_id": 701, "is_new_question": false }, @@ -43876,8 +44451,8 @@ "question__title": "Search in a Binary Search Tree", "question__title_slug": "search-in-a-binary-search-tree", "question__hide": false, - "total_acs": 636530, - "total_submitted": 818258, + "total_acs": 640343, + "total_submitted": 822820, "frontend_question_id": 700, "is_new_question": false }, @@ -43899,8 +44474,8 @@ "question__title": "Jewels and Stones", "question__title_slug": "jewels-and-stones", "question__hide": false, - "total_acs": 872023, - "total_submitted": 988395, + "total_acs": 875778, + "total_submitted": 992740, "frontend_question_id": 771, "is_new_question": false }, @@ -43922,8 +44497,8 @@ "question__title": "Basic Calculator IV", "question__title_slug": "basic-calculator-iv", "question__hide": false, - "total_acs": 9363, - "total_submitted": 16941, + "total_acs": 9384, + "total_submitted": 16988, "frontend_question_id": 770, "is_new_question": false }, @@ -43945,8 +44520,8 @@ "question__title": "Max Chunks To Make Sorted", "question__title_slug": "max-chunks-to-make-sorted", "question__hide": false, - "total_acs": 89740, - "total_submitted": 154085, + "total_acs": 90036, + "total_submitted": 154566, "frontend_question_id": 769, "is_new_question": false }, @@ -43968,8 +44543,8 @@ "question__title": "Max Chunks To Make Sorted II", "question__title_slug": "max-chunks-to-make-sorted-ii", "question__hide": false, - "total_acs": 53162, - "total_submitted": 100611, + "total_acs": 53387, + "total_submitted": 101066, "frontend_question_id": 768, "is_new_question": false }, @@ -43991,8 +44566,8 @@ "question__title": "Reorganize String", "question__title_slug": "reorganize-string", "question__hide": false, - "total_acs": 262670, - "total_submitted": 496609, + "total_acs": 263596, + "total_submitted": 498303, "frontend_question_id": 767, "is_new_question": false }, @@ -44014,8 +44589,8 @@ "question__title": "Toeplitz Matrix", "question__title_slug": "toeplitz-matrix", "question__hide": false, - "total_acs": 275764, - "total_submitted": 401963, + "total_acs": 276464, + "total_submitted": 403207, "frontend_question_id": 766, "is_new_question": false }, @@ -44037,8 +44612,8 @@ "question__title": "N-ary Tree Postorder Traversal", "question__title_slug": "n-ary-tree-postorder-traversal", "question__hide": false, - "total_acs": 224576, - "total_submitted": 289829, + "total_acs": 225352, + "total_submitted": 290851, "frontend_question_id": 590, "is_new_question": false }, @@ -44060,8 +44635,8 @@ "question__title": "N-ary Tree Preorder Traversal", "question__title_slug": "n-ary-tree-preorder-traversal", "question__hide": false, - "total_acs": 390840, - "total_submitted": 515332, + "total_acs": 393533, + "total_submitted": 518932, "frontend_question_id": 589, "is_new_question": false }, @@ -44083,8 +44658,8 @@ "question__title": "Maximum Depth of N-ary Tree", "question__title_slug": "maximum-depth-of-n-ary-tree", "question__hide": false, - "total_acs": 248859, - "total_submitted": 347099, + "total_acs": 249542, + "total_submitted": 348058, "frontend_question_id": 559, "is_new_question": false }, @@ -44106,8 +44681,8 @@ "question__title": "Logical OR of Two Binary Grids Represented as Quad-Trees", "question__title_slug": "logical-or-of-two-binary-grids-represented-as-quad-trees", "question__hide": false, - "total_acs": 13025, - "total_submitted": 26763, + "total_acs": 13075, + "total_submitted": 26849, "frontend_question_id": 558, "is_new_question": false }, @@ -44129,8 +44704,8 @@ "question__title": "Construct Quad Tree", "question__title_slug": "construct-quad-tree", "question__hide": false, - "total_acs": 93748, - "total_submitted": 125710, + "total_acs": 94071, + "total_submitted": 126115, "frontend_question_id": 427, "is_new_question": false }, @@ -44152,8 +44727,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": 19560, - "total_submitted": 24782, + "total_acs": 19592, + "total_submitted": 24836, "frontend_question_id": 431, "is_new_question": false }, @@ -44175,8 +44750,8 @@ "question__title": "Couples Holding Hands", "question__title_slug": "couples-holding-hands", "question__hide": false, - "total_acs": 52629, - "total_submitted": 92960, + "total_acs": 52783, + "total_submitted": 93271, "frontend_question_id": 765, "is_new_question": false }, @@ -44198,8 +44773,8 @@ "question__title": "Largest Plus Sign", "question__title_slug": "largest-plus-sign", "question__hide": false, - "total_acs": 52985, - "total_submitted": 109721, + "total_acs": 53075, + "total_submitted": 109920, "frontend_question_id": 764, "is_new_question": false }, @@ -44221,8 +44796,8 @@ "question__title": "Partition Labels", "question__title_slug": "partition-labels", "question__hide": false, - "total_acs": 464546, - "total_submitted": 582619, + "total_acs": 466024, + "total_submitted": 584478, "frontend_question_id": 763, "is_new_question": false }, @@ -44244,8 +44819,8 @@ "question__title": "Prime Number of Set Bits in Binary Representation", "question__title_slug": "prime-number-of-set-bits-in-binary-representation", "question__hide": false, - "total_acs": 82328, - "total_submitted": 120845, + "total_acs": 82666, + "total_submitted": 121307, "frontend_question_id": 762, "is_new_question": false }, @@ -44267,8 +44842,8 @@ "question__title": "Flatten a Multilevel Doubly Linked List", "question__title_slug": "flatten-a-multilevel-doubly-linked-list", "question__hide": false, - "total_acs": 286911, - "total_submitted": 480911, + "total_acs": 287722, + "total_submitted": 482173, "frontend_question_id": 430, "is_new_question": false }, @@ -44290,8 +44865,8 @@ "question__title": "Serialize and Deserialize N-ary Tree", "question__title_slug": "serialize-and-deserialize-n-ary-tree", "question__hide": false, - "total_acs": 78570, - "total_submitted": 118984, + "total_acs": 78783, + "total_submitted": 119253, "frontend_question_id": 428, "is_new_question": false }, @@ -44313,8 +44888,8 @@ "question__title": "N-ary Tree Level Order Traversal", "question__title_slug": "n-ary-tree-level-order-traversal", "question__hide": false, - "total_acs": 277630, - "total_submitted": 392779, + "total_acs": 278372, + "total_submitted": 393821, "frontend_question_id": 429, "is_new_question": false }, @@ -44336,8 +44911,8 @@ "question__title": "Special Binary String", "question__title_slug": "special-binary-string", "question__hide": false, - "total_acs": 15089, - "total_submitted": 25010, + "total_acs": 15150, + "total_submitted": 25095, "frontend_question_id": 761, "is_new_question": false }, @@ -44355,12 +44930,12 @@ "question_id": 762, "question__article__live": true, "question__article__slug": "find-anagram-mappings", - "question__article__has_video_solution": false, + "question__article__has_video_solution": true, "question__title": "Find Anagram Mappings", "question__title_slug": "find-anagram-mappings", "question__hide": false, - "total_acs": 92611, - "total_submitted": 111221, + "total_acs": 92907, + "total_submitted": 111533, "frontend_question_id": 760, "is_new_question": false }, @@ -44382,8 +44957,8 @@ "question__title": "Employee Free Time", "question__title_slug": "employee-free-time", "question__hide": false, - "total_acs": 132054, - "total_submitted": 183882, + "total_acs": 132383, + "total_submitted": 184308, "frontend_question_id": 759, "is_new_question": false }, @@ -44405,8 +44980,8 @@ "question__title": "Bold Words in String", "question__title_slug": "bold-words-in-string", "question__hide": false, - "total_acs": 17848, - "total_submitted": 35099, + "total_acs": 17867, + "total_submitted": 35125, "frontend_question_id": 758, "is_new_question": false }, @@ -44428,8 +45003,8 @@ "question__title": "Set Intersection Size At Least Two", "question__title_slug": "set-intersection-size-at-least-two", "question__hide": false, - "total_acs": 19375, - "total_submitted": 44219, + "total_acs": 19510, + "total_submitted": 44529, "frontend_question_id": 757, "is_new_question": false }, @@ -44451,8 +45026,8 @@ "question__title": "Convert Binary Search Tree to Sorted Doubly Linked List", "question__title_slug": "convert-binary-search-tree-to-sorted-doubly-linked-list", "question__hide": false, - "total_acs": 234742, - "total_submitted": 363104, + "total_acs": 235038, + "total_submitted": 363508, "frontend_question_id": 426, "is_new_question": false }, @@ -44474,8 +45049,8 @@ "question__title": "Pyramid Transition Matrix", "question__title_slug": "pyramid-transition-matrix", "question__hide": false, - "total_acs": 30299, - "total_submitted": 57506, + "total_acs": 30378, + "total_submitted": 57655, "frontend_question_id": 756, "is_new_question": false }, @@ -44497,8 +45072,8 @@ "question__title": "Pour Water", "question__title_slug": "pour-water", "question__hide": false, - "total_acs": 35128, - "total_submitted": 75615, + "total_acs": 35194, + "total_submitted": 75728, "frontend_question_id": 755, "is_new_question": false }, @@ -44520,8 +45095,8 @@ "question__title": "Reach a Number", "question__title_slug": "reach-a-number", "question__hide": false, - "total_acs": 45915, - "total_submitted": 107454, + "total_acs": 46051, + "total_submitted": 107778, "frontend_question_id": 754, "is_new_question": false }, @@ -44543,8 +45118,8 @@ "question__title": "Cracking the Safe", "question__title_slug": "cracking-the-safe", "question__hide": false, - "total_acs": 52795, - "total_submitted": 94506, + "total_acs": 52912, + "total_submitted": 94670, "frontend_question_id": 753, "is_new_question": false }, @@ -44566,8 +45141,8 @@ "question__title": "Open the Lock", "question__title_slug": "open-the-lock", "question__hide": false, - "total_acs": 201304, - "total_submitted": 361552, + "total_acs": 202090, + "total_submitted": 362829, "frontend_question_id": 752, "is_new_question": false }, @@ -44589,8 +45164,8 @@ "question__title": "IP to CIDR", "question__title_slug": "ip-to-cidr", "question__hide": false, - "total_acs": 18085, - "total_submitted": 33195, + "total_acs": 18205, + "total_submitted": 33439, "frontend_question_id": 751, "is_new_question": false }, @@ -44612,8 +45187,8 @@ "question__title": "Number Of Corner Rectangles", "question__title_slug": "number-of-corner-rectangles", "question__hide": false, - "total_acs": 37291, - "total_submitted": 55186, + "total_acs": 37313, + "total_submitted": 55217, "frontend_question_id": 750, "is_new_question": false }, @@ -44635,8 +45210,8 @@ "question__title": "Contain Virus", "question__title_slug": "contain-virus", "question__hide": false, - "total_acs": 10385, - "total_submitted": 20393, + "total_acs": 10418, + "total_submitted": 20449, "frontend_question_id": 749, "is_new_question": false }, @@ -44658,8 +45233,8 @@ "question__title": "Shortest Completing Word", "question__title_slug": "shortest-completing-word", "question__hide": false, - "total_acs": 61255, - "total_submitted": 103372, + "total_acs": 61566, + "total_submitted": 103910, "frontend_question_id": 748, "is_new_question": false }, @@ -44681,8 +45256,8 @@ "question__title": "Largest Number At Least Twice of Others", "question__title_slug": "largest-number-at-least-twice-of-others", "question__hide": false, - "total_acs": 202741, - "total_submitted": 429151, + "total_acs": 203802, + "total_submitted": 430926, "frontend_question_id": 747, "is_new_question": false }, @@ -44704,8 +45279,8 @@ "question__title": "Min Cost Climbing Stairs", "question__title_slug": "min-cost-climbing-stairs", "question__hide": false, - "total_acs": 803306, - "total_submitted": 1267984, + "total_acs": 810222, + "total_submitted": 1277731, "frontend_question_id": 746, "is_new_question": false }, @@ -44727,8 +45302,8 @@ "question__title": "Prefix and Suffix Search", "question__title_slug": "prefix-and-suffix-search", "question__hide": false, - "total_acs": 89918, - "total_submitted": 218163, + "total_acs": 90036, + "total_submitted": 218515, "frontend_question_id": 745, "is_new_question": false }, @@ -44750,8 +45325,8 @@ "question__title": "Find Smallest Letter Greater Than Target", "question__title_slug": "find-smallest-letter-greater-than-target", "question__hide": false, - "total_acs": 292905, - "total_submitted": 636668, + "total_acs": 295301, + "total_submitted": 640767, "frontend_question_id": 744, "is_new_question": false }, @@ -44773,8 +45348,8 @@ "question__title": "Network Delay Time", "question__title_slug": "network-delay-time", "question__hide": false, - "total_acs": 373590, - "total_submitted": 719181, + "total_acs": 375781, + "total_submitted": 723013, "frontend_question_id": 743, "is_new_question": false }, @@ -44796,8 +45371,8 @@ "question__title": "Closest Leaf in a Binary Tree", "question__title_slug": "closest-leaf-in-a-binary-tree", "question__hide": false, - "total_acs": 42286, - "total_submitted": 92057, + "total_acs": 42377, + "total_submitted": 92245, "frontend_question_id": 742, "is_new_question": false }, @@ -44819,8 +45394,8 @@ "question__title": "To Lower Case", "question__title_slug": "to-lower-case", "question__hide": false, - "total_acs": 419824, - "total_submitted": 509328, + "total_acs": 422194, + "total_submitted": 512002, "frontend_question_id": 709, "is_new_question": false }, @@ -44842,8 +45417,8 @@ "question__title": "Cherry Pickup", "question__title_slug": "cherry-pickup", "question__hide": false, - "total_acs": 65173, - "total_submitted": 179857, + "total_acs": 65378, + "total_submitted": 180411, "frontend_question_id": 741, "is_new_question": false }, @@ -44865,8 +45440,8 @@ "question__title": "Delete and Earn", "question__title_slug": "delete-and-earn", "question__hide": false, - "total_acs": 266630, - "total_submitted": 467859, + "total_acs": 268597, + "total_submitted": 471489, "frontend_question_id": 740, "is_new_question": false }, @@ -44888,8 +45463,8 @@ "question__title": "Daily Temperatures", "question__title_slug": "daily-temperatures", "question__hide": false, - "total_acs": 603533, - "total_submitted": 910969, + "total_acs": 608335, + "total_submitted": 918243, "frontend_question_id": 739, "is_new_question": false }, @@ -44911,8 +45486,8 @@ "question__title": "Monotone Increasing Digits", "question__title_slug": "monotone-increasing-digits", "question__hide": false, - "total_acs": 45106, - "total_submitted": 95335, + "total_acs": 45260, + "total_submitted": 95642, "frontend_question_id": 738, "is_new_question": false }, @@ -44934,8 +45509,8 @@ "question__title": "Sentence Similarity II", "question__title_slug": "sentence-similarity-ii", "question__hide": false, - "total_acs": 65575, - "total_submitted": 133560, + "total_acs": 65681, + "total_submitted": 133715, "frontend_question_id": 737, "is_new_question": false }, @@ -44957,8 +45532,8 @@ "question__title": "Parse Lisp Expression", "question__title_slug": "parse-lisp-expression", "question__hide": false, - "total_acs": 20350, - "total_submitted": 39433, + "total_acs": 20386, + "total_submitted": 39517, "frontend_question_id": 736, "is_new_question": false }, @@ -44980,8 +45555,8 @@ "question__title": "Asteroid Collision", "question__title_slug": "asteroid-collision", "question__hide": false, - "total_acs": 269361, - "total_submitted": 605732, + "total_acs": 271454, + "total_submitted": 610347, "frontend_question_id": 735, "is_new_question": false }, @@ -45003,8 +45578,8 @@ "question__title": "Sentence Similarity", "question__title_slug": "sentence-similarity", "question__hide": false, - "total_acs": 60441, - "total_submitted": 137431, + "total_acs": 60636, + "total_submitted": 137826, "frontend_question_id": 734, "is_new_question": false }, @@ -45026,8 +45601,8 @@ "question__title": "Flood Fill", "question__title_slug": "flood-fill", "question__hide": false, - "total_acs": 713201, - "total_submitted": 1146413, + "total_acs": 718834, + "total_submitted": 1154089, "frontend_question_id": 733, "is_new_question": false }, @@ -45049,8 +45624,8 @@ "question__title": "My Calendar III", "question__title_slug": "my-calendar-iii", "question__hide": false, - "total_acs": 83590, - "total_submitted": 116804, + "total_acs": 83763, + "total_submitted": 117048, "frontend_question_id": 732, "is_new_question": false }, @@ -45072,8 +45647,8 @@ "question__title": "My Calendar II", "question__title_slug": "my-calendar-ii", "question__hide": false, - "total_acs": 89973, - "total_submitted": 163550, + "total_acs": 90223, + "total_submitted": 163975, "frontend_question_id": 731, "is_new_question": false }, @@ -45095,8 +45670,8 @@ "question__title": "Count Different Palindromic Subsequences", "question__title_slug": "count-different-palindromic-subsequences", "question__hide": false, - "total_acs": 32780, - "total_submitted": 73746, + "total_acs": 32854, + "total_submitted": 73896, "frontend_question_id": 730, "is_new_question": false }, @@ -45118,8 +45693,8 @@ "question__title": "My Calendar I", "question__title_slug": "my-calendar-i", "question__hide": false, - "total_acs": 256055, - "total_submitted": 450699, + "total_acs": 256813, + "total_submitted": 452062, "frontend_question_id": 729, "is_new_question": false }, @@ -45141,8 +45716,8 @@ "question__title": "Self Dividing Numbers", "question__title_slug": "self-dividing-numbers", "question__hide": false, - "total_acs": 205320, - "total_submitted": 263442, + "total_acs": 206168, + "total_submitted": 264459, "frontend_question_id": 728, "is_new_question": false }, @@ -45164,8 +45739,8 @@ "question__title": "Minimum Window Subsequence", "question__title_slug": "minimum-window-subsequence", "question__hide": false, - "total_acs": 85517, - "total_submitted": 198230, + "total_acs": 85644, + "total_submitted": 198541, "frontend_question_id": 727, "is_new_question": false }, @@ -45187,8 +45762,8 @@ "question__title": "Number of Atoms", "question__title_slug": "number-of-atoms", "question__hide": false, - "total_acs": 53107, - "total_submitted": 101789, + "total_acs": 53346, + "total_submitted": 102124, "frontend_question_id": 726, "is_new_question": false }, @@ -45210,8 +45785,8 @@ "question__title": "Split Linked List in Parts", "question__title_slug": "split-linked-list-in-parts", "question__hide": false, - "total_acs": 113240, - "total_submitted": 197827, + "total_acs": 113597, + "total_submitted": 198324, "frontend_question_id": 725, "is_new_question": false }, @@ -45233,8 +45808,8 @@ "question__title": "Find Pivot Index", "question__title_slug": "find-pivot-index", "question__hide": false, - "total_acs": 828233, - "total_submitted": 1506940, + "total_acs": 838042, + "total_submitted": 1522750, "frontend_question_id": 724, "is_new_question": false }, @@ -45256,8 +45831,8 @@ "question__title": "Candy Crush", "question__title_slug": "candy-crush", "question__hide": false, - "total_acs": 63787, - "total_submitted": 83249, + "total_acs": 63924, + "total_submitted": 83418, "frontend_question_id": 723, "is_new_question": false }, @@ -45279,8 +45854,8 @@ "question__title": "Remove Comments", "question__title_slug": "remove-comments", "question__hide": false, - "total_acs": 64697, - "total_submitted": 169076, + "total_acs": 64950, + "total_submitted": 169642, "frontend_question_id": 722, "is_new_question": false }, @@ -45302,8 +45877,8 @@ "question__title": "Accounts Merge", "question__title_slug": "accounts-merge", "question__hide": false, - "total_acs": 308214, - "total_submitted": 547187, + "total_acs": 309486, + "total_submitted": 549526, "frontend_question_id": 721, "is_new_question": false }, @@ -45325,8 +45900,8 @@ "question__title": "Longest Word in Dictionary", "question__title_slug": "longest-word-in-dictionary", "question__hide": false, - "total_acs": 135920, - "total_submitted": 261408, + "total_acs": 136249, + "total_submitted": 262012, "frontend_question_id": 720, "is_new_question": false }, @@ -45348,8 +45923,8 @@ "question__title": "Find K-th Smallest Pair Distance", "question__title_slug": "find-k-th-smallest-pair-distance", "question__hide": false, - "total_acs": 75204, - "total_submitted": 204813, + "total_acs": 75496, + "total_submitted": 205522, "frontend_question_id": 719, "is_new_question": false }, @@ -45371,8 +45946,8 @@ "question__title": "Maximum Length of Repeated Subarray", "question__title_slug": "maximum-length-of-repeated-subarray", "question__hide": false, - "total_acs": 262323, - "total_submitted": 511931, + "total_acs": 263012, + "total_submitted": 513281, "frontend_question_id": 718, "is_new_question": false }, @@ -45394,8 +45969,8 @@ "question__title": "1-bit and 2-bit Characters", "question__title_slug": "1-bit-and-2-bit-characters", "question__hide": false, - "total_acs": 117788, - "total_submitted": 257552, + "total_acs": 118138, + "total_submitted": 258431, "frontend_question_id": 717, "is_new_question": false }, @@ -45417,8 +45992,8 @@ "question__title": "Max Stack", "question__title_slug": "max-stack", "question__hide": false, - "total_acs": 141301, - "total_submitted": 312884, + "total_acs": 141438, + "total_submitted": 313243, "frontend_question_id": 716, "is_new_question": false }, @@ -45440,8 +46015,8 @@ "question__title": "Range Module", "question__title_slug": "range-module", "question__hide": false, - "total_acs": 58476, - "total_submitted": 131080, + "total_acs": 58882, + "total_submitted": 131901, "frontend_question_id": 715, "is_new_question": false }, @@ -45463,8 +46038,8 @@ "question__title": "Best Time to Buy and Sell Stock with Transaction Fee", "question__title_slug": "best-time-to-buy-and-sell-stock-with-transaction-fee", "question__hide": false, - "total_acs": 226604, - "total_submitted": 346861, + "total_acs": 228049, + "total_submitted": 348814, "frontend_question_id": 714, "is_new_question": false }, @@ -45486,8 +46061,8 @@ "question__title": "Subarray Product Less Than K", "question__title_slug": "subarray-product-less-than-k", "question__hide": false, - "total_acs": 226843, - "total_submitted": 494572, + "total_acs": 228023, + "total_submitted": 496746, "frontend_question_id": 713, "is_new_question": false }, @@ -45509,8 +46084,8 @@ "question__title": "Minimum ASCII Delete Sum for Two Strings", "question__title_slug": "minimum-ascii-delete-sum-for-two-strings", "question__hide": false, - "total_acs": 76260, - "total_submitted": 121874, + "total_acs": 76692, + "total_submitted": 122487, "frontend_question_id": 712, "is_new_question": false }, @@ -45532,8 +46107,8 @@ "question__title": "Number of Distinct Islands II", "question__title_slug": "number-of-distinct-islands-ii", "question__hide": false, - "total_acs": 9375, - "total_submitted": 18006, + "total_acs": 9403, + "total_submitted": 18053, "frontend_question_id": 711, "is_new_question": false }, @@ -45555,8 +46130,8 @@ "question__title": "Falling Squares", "question__title_slug": "falling-squares", "question__hide": false, - "total_acs": 23227, - "total_submitted": 52047, + "total_acs": 23367, + "total_submitted": 52266, "frontend_question_id": 699, "is_new_question": false }, @@ -45578,8 +46153,8 @@ "question__title": "Partition to K Equal Sum Subsets", "question__title_slug": "partition-to-k-equal-sum-subsets", "question__hide": false, - "total_acs": 234894, - "total_submitted": 589775, + "total_acs": 235547, + "total_submitted": 592419, "frontend_question_id": 698, "is_new_question": false }, @@ -45601,8 +46176,8 @@ "question__title": "Degree of an Array", "question__title_slug": "degree-of-an-array", "question__hide": false, - "total_acs": 180683, - "total_submitted": 322725, + "total_acs": 181410, + "total_submitted": 324038, "frontend_question_id": 697, "is_new_question": false }, @@ -45624,8 +46199,8 @@ "question__title": "Count Binary Substrings", "question__title_slug": "count-binary-substrings", "question__hide": false, - "total_acs": 184476, - "total_submitted": 281906, + "total_acs": 185006, + "total_submitted": 282714, "frontend_question_id": 696, "is_new_question": false }, @@ -45647,8 +46222,8 @@ "question__title": "Max Area of Island", "question__title_slug": "max-area-of-island", "question__hide": false, - "total_acs": 706747, - "total_submitted": 983743, + "total_acs": 710058, + "total_submitted": 988376, "frontend_question_id": 695, "is_new_question": false }, @@ -45670,8 +46245,8 @@ "question__title": "Number of Distinct Islands", "question__title_slug": "number-of-distinct-islands", "question__hide": false, - "total_acs": 148501, - "total_submitted": 244320, + "total_acs": 148850, + "total_submitted": 244844, "frontend_question_id": 694, "is_new_question": false }, @@ -45693,8 +46268,8 @@ "question__title": "Binary Number with Alternating Bits", "question__title_slug": "binary-number-with-alternating-bits", "question__hide": false, - "total_acs": 113656, - "total_submitted": 184554, + "total_acs": 114194, + "total_submitted": 185365, "frontend_question_id": 693, "is_new_question": false }, @@ -45716,8 +46291,8 @@ "question__title": "Top K Frequent Words", "question__title_slug": "top-k-frequent-words", "question__hide": false, - "total_acs": 543146, - "total_submitted": 948897, + "total_acs": 545347, + "total_submitted": 952280, "frontend_question_id": 692, "is_new_question": false }, @@ -45739,8 +46314,8 @@ "question__title": "Stickers to Spell Word", "question__title_slug": "stickers-to-spell-word", "question__hide": false, - "total_acs": 37958, - "total_submitted": 81854, + "total_acs": 38130, + "total_submitted": 82177, "frontend_question_id": 691, "is_new_question": false }, @@ -45762,8 +46337,8 @@ "question__title": "Employee Importance", "question__title_slug": "employee-importance", "question__hide": false, - "total_acs": 193566, - "total_submitted": 294767, + "total_acs": 193870, + "total_submitted": 295116, "frontend_question_id": 690, "is_new_question": false }, @@ -45785,8 +46360,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": 67200, - "total_submitted": 137438, + "total_acs": 67297, + "total_submitted": 137631, "frontend_question_id": 689, "is_new_question": false }, @@ -45808,8 +46383,8 @@ "question__title": "Knight Probability in Chessboard", "question__title_slug": "knight-probability-in-chessboard", "question__hide": false, - "total_acs": 94679, - "total_submitted": 181859, + "total_acs": 94920, + "total_submitted": 182312, "frontend_question_id": 688, "is_new_question": false }, @@ -45831,8 +46406,8 @@ "question__title": "Longest Univalue Path", "question__title_slug": "longest-univalue-path", "question__hide": false, - "total_acs": 162765, - "total_submitted": 402042, + "total_acs": 163117, + "total_submitted": 402775, "frontend_question_id": 687, "is_new_question": false }, @@ -45854,8 +46429,8 @@ "question__title": "Repeated String Match", "question__title_slug": "repeated-string-match", "question__hide": false, - "total_acs": 138769, - "total_submitted": 405795, + "total_acs": 139055, + "total_submitted": 406611, "frontend_question_id": 686, "is_new_question": false }, @@ -45877,8 +46452,8 @@ "question__title": "Redundant Connection II", "question__title_slug": "redundant-connection-ii", "question__hide": false, - "total_acs": 60992, - "total_submitted": 178982, + "total_acs": 61172, + "total_submitted": 179423, "frontend_question_id": 685, "is_new_question": false }, @@ -45900,8 +46475,8 @@ "question__title": "Redundant Connection", "question__title_slug": "redundant-connection", "question__hide": false, - "total_acs": 271704, - "total_submitted": 436140, + "total_acs": 273115, + "total_submitted": 438359, "frontend_question_id": 684, "is_new_question": false }, @@ -45923,8 +46498,8 @@ "question__title": "K Empty Slots", "question__title_slug": "k-empty-slots", "question__hide": false, - "total_acs": 59093, - "total_submitted": 159808, + "total_acs": 59136, + "total_submitted": 159917, "frontend_question_id": 683, "is_new_question": false }, @@ -45946,8 +46521,8 @@ "question__title": "Baseball Game", "question__title_slug": "baseball-game", "question__hide": false, - "total_acs": 248861, - "total_submitted": 334425, + "total_acs": 250899, + "total_submitted": 336976, "frontend_question_id": 682, "is_new_question": false }, @@ -45969,8 +46544,8 @@ "question__title": "Next Closest Time", "question__title_slug": "next-closest-time", "question__hide": false, - "total_acs": 101942, - "total_submitted": 219695, + "total_acs": 102046, + "total_submitted": 219921, "frontend_question_id": 681, "is_new_question": false }, @@ -45992,8 +46567,8 @@ "question__title": "Valid Palindrome II", "question__title_slug": "valid-palindrome-ii", "question__hide": false, - "total_acs": 591510, - "total_submitted": 1502504, + "total_acs": 593604, + "total_submitted": 1507464, "frontend_question_id": 680, "is_new_question": false }, @@ -46015,8 +46590,8 @@ "question__title": "24 Game", "question__title_slug": "24-game", "question__hide": false, - "total_acs": 71174, - "total_submitted": 144708, + "total_acs": 71331, + "total_submitted": 144998, "frontend_question_id": 679, "is_new_question": false }, @@ -46038,8 +46613,8 @@ "question__title": "Valid Parenthesis String", "question__title_slug": "valid-parenthesis-string", "question__hide": false, - "total_acs": 205883, - "total_submitted": 603043, + "total_acs": 206797, + "total_submitted": 605457, "frontend_question_id": 678, "is_new_question": false }, @@ -46061,8 +46636,8 @@ "question__title": "Map Sum Pairs", "question__title_slug": "map-sum-pairs", "question__hide": false, - "total_acs": 103102, - "total_submitted": 181582, + "total_acs": 103372, + "total_submitted": 182064, "frontend_question_id": 677, "is_new_question": false }, @@ -46084,8 +46659,8 @@ "question__title": "Implement Magic Dictionary", "question__title_slug": "implement-magic-dictionary", "question__hide": false, - "total_acs": 71909, - "total_submitted": 126216, + "total_acs": 72018, + "total_submitted": 126411, "frontend_question_id": 676, "is_new_question": false }, @@ -46107,8 +46682,8 @@ "question__title": "Cut Off Trees for Golf Event", "question__title_slug": "cut-off-trees-for-golf-event", "question__hide": false, - "total_acs": 62183, - "total_submitted": 182449, + "total_acs": 62279, + "total_submitted": 182803, "frontend_question_id": 675, "is_new_question": false }, @@ -46130,8 +46705,8 @@ "question__title": "Longest Continuous Increasing Subsequence", "question__title_slug": "longest-continuous-increasing-subsequence", "question__hide": false, - "total_acs": 225576, - "total_submitted": 457339, + "total_acs": 226461, + "total_submitted": 458949, "frontend_question_id": 674, "is_new_question": false }, @@ -46153,8 +46728,8 @@ "question__title": "Number of Longest Increasing Subsequence", "question__title_slug": "number-of-longest-increasing-subsequence", "question__hide": false, - "total_acs": 143798, - "total_submitted": 334517, + "total_acs": 144564, + "total_submitted": 336266, "frontend_question_id": 673, "is_new_question": false }, @@ -46176,8 +46751,8 @@ "question__title": "Bulb Switcher II", "question__title_slug": "bulb-switcher-ii", "question__hide": false, - "total_acs": 19824, - "total_submitted": 39253, + "total_acs": 19889, + "total_submitted": 39439, "frontend_question_id": 672, "is_new_question": false }, @@ -46199,8 +46774,8 @@ "question__title": "Second Minimum Node In a Binary Tree", "question__title_slug": "second-minimum-node-in-a-binary-tree", "question__hide": false, - "total_acs": 168363, - "total_submitted": 381565, + "total_acs": 168836, + "total_submitted": 382550, "frontend_question_id": 671, "is_new_question": false }, @@ -46222,8 +46797,8 @@ "question__title": "Maximum Swap", "question__title_slug": "maximum-swap", "question__hide": false, - "total_acs": 193989, - "total_submitted": 405425, + "total_acs": 194321, + "total_submitted": 406140, "frontend_question_id": 670, "is_new_question": false }, @@ -46245,8 +46820,8 @@ "question__title": "Trim a Binary Search Tree", "question__title_slug": "trim-a-binary-search-tree", "question__hide": false, - "total_acs": 265046, - "total_submitted": 399364, + "total_acs": 265624, + "total_submitted": 400250, "frontend_question_id": 669, "is_new_question": false }, @@ -46268,8 +46843,8 @@ "question__title": "Kth Smallest Number in Multiplication Table", "question__title_slug": "kth-smallest-number-in-multiplication-table", "question__hide": false, - "total_acs": 56074, - "total_submitted": 109074, + "total_acs": 56225, + "total_submitted": 109404, "frontend_question_id": 668, "is_new_question": false }, @@ -46291,8 +46866,8 @@ "question__title": "Beautiful Arrangement II", "question__title_slug": "beautiful-arrangement-ii", "question__hide": false, - "total_acs": 50576, - "total_submitted": 84573, + "total_acs": 50634, + "total_submitted": 84652, "frontend_question_id": 667, "is_new_question": false }, @@ -46314,8 +46889,8 @@ "question__title": "Path Sum IV", "question__title_slug": "path-sum-iv", "question__hide": false, - "total_acs": 21528, - "total_submitted": 36178, + "total_acs": 21545, + "total_submitted": 36206, "frontend_question_id": 666, "is_new_question": false }, @@ -46337,8 +46912,8 @@ "question__title": "Non-decreasing Array", "question__title_slug": "non-decreasing-array", "question__hide": false, - "total_acs": 240223, - "total_submitted": 988800, + "total_acs": 240837, + "total_submitted": 990978, "frontend_question_id": 665, "is_new_question": false }, @@ -46360,8 +46935,8 @@ "question__title": "Strange Printer", "question__title_slug": "strange-printer", "question__hide": false, - "total_acs": 32000, - "total_submitted": 68218, + "total_acs": 32118, + "total_submitted": 68443, "frontend_question_id": 664, "is_new_question": false }, @@ -46383,8 +46958,8 @@ "question__title": "Equal Tree Partition", "question__title_slug": "equal-tree-partition", "question__hide": false, - "total_acs": 29476, - "total_submitted": 71154, + "total_acs": 29515, + "total_submitted": 71217, "frontend_question_id": 663, "is_new_question": false }, @@ -46406,8 +46981,8 @@ "question__title": "Maximum Width of Binary Tree", "question__title_slug": "maximum-width-of-binary-tree", "question__hide": false, - "total_acs": 296480, - "total_submitted": 694080, + "total_acs": 297912, + "total_submitted": 697297, "frontend_question_id": 662, "is_new_question": false }, @@ -46429,8 +47004,8 @@ "question__title": "Image Smoother", "question__title_slug": "image-smoother", "question__hide": false, - "total_acs": 72447, - "total_submitted": 130700, + "total_acs": 72675, + "total_submitted": 130996, "frontend_question_id": 661, "is_new_question": false }, @@ -46452,8 +47027,8 @@ "question__title": "Remove 9", "question__title_slug": "remove-9", "question__hide": false, - "total_acs": 10265, - "total_submitted": 17919, + "total_acs": 10271, + "total_submitted": 17928, "frontend_question_id": 660, "is_new_question": false }, @@ -46475,8 +47050,8 @@ "question__title": "Split Array into Consecutive Subsequences", "question__title_slug": "split-array-into-consecutive-subsequences", "question__hide": false, - "total_acs": 122927, - "total_submitted": 241985, + "total_acs": 123165, + "total_submitted": 242451, "frontend_question_id": 659, "is_new_question": false }, @@ -46498,8 +47073,8 @@ "question__title": "Find K Closest Elements", "question__title_slug": "find-k-closest-elements", "question__hide": false, - "total_acs": 430770, - "total_submitted": 919688, + "total_acs": 432754, + "total_submitted": 923927, "frontend_question_id": 658, "is_new_question": false }, @@ -46521,8 +47096,8 @@ "question__title": "Robot Return to Origin", "question__title_slug": "robot-return-to-origin", "question__hide": false, - "total_acs": 369052, - "total_submitted": 489850, + "total_acs": 370193, + "total_submitted": 491353, "frontend_question_id": 657, "is_new_question": false }, @@ -46544,8 +47119,8 @@ "question__title": "Coin Path", "question__title_slug": "coin-path", "question__hide": false, - "total_acs": 13417, - "total_submitted": 42159, + "total_acs": 13426, + "total_submitted": 42182, "frontend_question_id": 656, "is_new_question": false }, @@ -46567,8 +47142,8 @@ "question__title": "Print Binary Tree", "question__title_slug": "print-binary-tree", "question__hide": false, - "total_acs": 59643, - "total_submitted": 96133, + "total_acs": 59853, + "total_submitted": 96401, "frontend_question_id": 655, "is_new_question": false }, @@ -46590,8 +47165,8 @@ "question__title": "Maximum Binary Tree", "question__title_slug": "maximum-binary-tree", "question__hide": false, - "total_acs": 254049, - "total_submitted": 299620, + "total_acs": 255029, + "total_submitted": 300700, "frontend_question_id": 654, "is_new_question": false }, @@ -46613,8 +47188,8 @@ "question__title": "Two Sum IV - Input is a BST", "question__title_slug": "two-sum-iv-input-is-a-bst", "question__hide": false, - "total_acs": 454128, - "total_submitted": 743833, + "total_acs": 455844, + "total_submitted": 746625, "frontend_question_id": 653, "is_new_question": false }, @@ -46636,8 +47211,8 @@ "question__title": "Find Duplicate Subtrees", "question__title_slug": "find-duplicate-subtrees", "question__hide": false, - "total_acs": 230634, - "total_submitted": 390963, + "total_acs": 231137, + "total_submitted": 391829, "frontend_question_id": 652, "is_new_question": false }, @@ -46659,8 +47234,8 @@ "question__title": "4 Keys Keyboard", "question__title_slug": "4-keys-keyboard", "question__hide": false, - "total_acs": 26274, - "total_submitted": 47126, + "total_acs": 26332, + "total_submitted": 47225, "frontend_question_id": 651, "is_new_question": false }, @@ -46682,8 +47257,8 @@ "question__title": "2 Keys Keyboard", "question__title_slug": "2-keys-keyboard", "question__hide": false, - "total_acs": 116306, - "total_submitted": 217384, + "total_acs": 117203, + "total_submitted": 219009, "frontend_question_id": 650, "is_new_question": false }, @@ -46705,8 +47280,8 @@ "question__title": "Dota2 Senate", "question__title_slug": "dota2-senate", "question__hide": false, - "total_acs": 23770, - "total_submitted": 58609, + "total_acs": 77273, + "total_submitted": 160607, "frontend_question_id": 649, "is_new_question": false }, @@ -46728,8 +47303,8 @@ "question__title": "Replace Words", "question__title_slug": "replace-words", "question__hide": false, - "total_acs": 118884, - "total_submitted": 189644, + "total_acs": 119321, + "total_submitted": 190356, "frontend_question_id": 648, "is_new_question": false }, @@ -46751,8 +47326,8 @@ "question__title": "Palindromic Substrings", "question__title_slug": "palindromic-substrings", "question__hide": false, - "total_acs": 567296, - "total_submitted": 847133, + "total_acs": 569572, + "total_submitted": 850148, "frontend_question_id": 647, "is_new_question": false }, @@ -46774,8 +47349,8 @@ "question__title": "Maximum Length of Pair Chain", "question__title_slug": "maximum-length-of-pair-chain", "question__hide": false, - "total_acs": 134371, - "total_submitted": 237755, + "total_acs": 134939, + "total_submitted": 238659, "frontend_question_id": 646, "is_new_question": false }, @@ -46797,8 +47372,8 @@ "question__title": "Set Mismatch", "question__title_slug": "set-mismatch", "question__hide": false, - "total_acs": 267872, - "total_submitted": 628213, + "total_acs": 268830, + "total_submitted": 630701, "frontend_question_id": 645, "is_new_question": false }, @@ -46820,8 +47395,8 @@ "question__title": "Maximum Average Subarray II", "question__title_slug": "maximum-average-subarray-ii", "question__hide": false, - "total_acs": 18794, - "total_submitted": 52168, + "total_acs": 18834, + "total_submitted": 52241, "frontend_question_id": 644, "is_new_question": false }, @@ -46843,8 +47418,8 @@ "question__title": "Maximum Average Subarray I", "question__title_slug": "maximum-average-subarray-i", "question__hide": false, - "total_acs": 205665, - "total_submitted": 470496, + "total_acs": 209029, + "total_submitted": 478239, "frontend_question_id": 643, "is_new_question": false }, @@ -46866,8 +47441,8 @@ "question__title": "Design Search Autocomplete System", "question__title_slug": "design-search-autocomplete-system", "question__hide": false, - "total_acs": 129531, - "total_submitted": 266415, + "total_acs": 129763, + "total_submitted": 266809, "frontend_question_id": 642, "is_new_question": false }, @@ -46889,8 +47464,8 @@ "question__title": "Solve the Equation", "question__title_slug": "solve-the-equation", "question__hide": false, - "total_acs": 35900, - "total_submitted": 82634, + "total_acs": 35991, + "total_submitted": 82800, "frontend_question_id": 640, "is_new_question": false }, @@ -46912,8 +47487,8 @@ "question__title": "Decode Ways II", "question__title_slug": "decode-ways-ii", "question__hide": false, - "total_acs": 67094, - "total_submitted": 220781, + "total_acs": 67205, + "total_submitted": 221098, "frontend_question_id": 639, "is_new_question": false }, @@ -46935,8 +47510,8 @@ "question__title": "Shopping Offers", "question__title_slug": "shopping-offers", "question__hide": false, - "total_acs": 52659, - "total_submitted": 99067, + "total_acs": 52809, + "total_submitted": 99435, "frontend_question_id": 638, "is_new_question": false }, @@ -46958,8 +47533,8 @@ "question__title": "Average of Levels in Binary Tree", "question__title_slug": "average-of-levels-in-binary-tree", "question__hide": false, - "total_acs": 389399, - "total_submitted": 542623, + "total_acs": 390868, + "total_submitted": 544635, "frontend_question_id": 637, "is_new_question": false }, @@ -46981,8 +47556,8 @@ "question__title": "Exclusive Time of Functions", "question__title_slug": "exclusive-time-of-functions", "question__hide": false, - "total_acs": 188796, - "total_submitted": 308484, + "total_acs": 189065, + "total_submitted": 308888, "frontend_question_id": 636, "is_new_question": false }, @@ -47004,8 +47579,8 @@ "question__title": "Design Log Storage System", "question__title_slug": "design-log-storage-system", "question__hide": false, - "total_acs": 33345, - "total_submitted": 53278, + "total_acs": 33394, + "total_submitted": 53419, "frontend_question_id": 635, "is_new_question": false }, @@ -47027,8 +47602,8 @@ "question__title": "Find the Derangement of An Array", "question__title_slug": "find-the-derangement-of-an-array", "question__hide": false, - "total_acs": 10447, - "total_submitted": 24846, + "total_acs": 10459, + "total_submitted": 24870, "frontend_question_id": 634, "is_new_question": false }, @@ -47050,8 +47625,8 @@ "question__title": "Sum of Square Numbers", "question__title_slug": "sum-of-square-numbers", "question__hide": false, - "total_acs": 170527, - "total_submitted": 496567, + "total_acs": 171285, + "total_submitted": 498956, "frontend_question_id": 633, "is_new_question": false }, @@ -47073,8 +47648,8 @@ "question__title": "Smallest Range Covering Elements from K Lists", "question__title_slug": "smallest-range-covering-elements-from-k-lists", "question__hide": false, - "total_acs": 84780, - "total_submitted": 138893, + "total_acs": 85259, + "total_submitted": 139548, "frontend_question_id": 632, "is_new_question": false }, @@ -47096,8 +47671,8 @@ "question__title": "Design Excel Sum Formula", "question__title_slug": "design-excel-sum-formula", "question__hide": false, - "total_acs": 13836, - "total_submitted": 31764, + "total_acs": 13933, + "total_submitted": 31941, "frontend_question_id": 631, "is_new_question": false }, @@ -47119,8 +47694,8 @@ "question__title": "Course Schedule III", "question__title_slug": "course-schedule-iii", "question__hide": false, - "total_acs": 101961, - "total_submitted": 253954, + "total_acs": 102245, + "total_submitted": 254514, "frontend_question_id": 630, "is_new_question": false }, @@ -47142,8 +47717,8 @@ "question__title": "K Inverse Pairs Array", "question__title_slug": "k-inverse-pairs-array", "question__hide": false, - "total_acs": 58292, - "total_submitted": 136792, + "total_acs": 58363, + "total_submitted": 136976, "frontend_question_id": 629, "is_new_question": false }, @@ -47165,8 +47740,8 @@ "question__title": "Maximum Product of Three Numbers", "question__title_slug": "maximum-product-of-three-numbers", "question__hide": false, - "total_acs": 262566, - "total_submitted": 573151, + "total_acs": 263701, + "total_submitted": 576208, "frontend_question_id": 628, "is_new_question": false }, @@ -47188,8 +47763,8 @@ "question__title": "Swap Salary", "question__title_slug": "swap-salary", "question__hide": false, - "total_acs": 348722, - "total_submitted": 419772, + "total_acs": 352231, + "total_submitted": 424113, "frontend_question_id": 627, "is_new_question": false }, @@ -47211,8 +47786,8 @@ "question__title": "Exchange Seats", "question__title_slug": "exchange-seats", "question__hide": false, - "total_acs": 134140, - "total_submitted": 192274, + "total_acs": 135079, + "total_submitted": 193814, "frontend_question_id": 626, "is_new_question": false }, @@ -47234,8 +47809,8 @@ "question__title": "Minimum Factorization", "question__title_slug": "minimum-factorization", "question__hide": false, - "total_acs": 10723, - "total_submitted": 32005, + "total_acs": 10733, + "total_submitted": 32030, "frontend_question_id": 625, "is_new_question": false }, @@ -47257,8 +47832,8 @@ "question__title": "Maximum Distance in Arrays", "question__title_slug": "maximum-distance-in-arrays", "question__hide": false, - "total_acs": 37195, - "total_submitted": 88901, + "total_acs": 37657, + "total_submitted": 90201, "frontend_question_id": 624, "is_new_question": false }, @@ -47280,8 +47855,8 @@ "question__title": "Add One Row to Tree", "question__title_slug": "add-one-row-to-tree", "question__hide": false, - "total_acs": 150296, - "total_submitted": 252753, + "total_acs": 150614, + "total_submitted": 253276, "frontend_question_id": 623, "is_new_question": false }, @@ -47303,8 +47878,8 @@ "question__title": "Task Scheduler", "question__title_slug": "task-scheduler", "question__hide": false, - "total_acs": 427679, - "total_submitted": 757598, + "total_acs": 429545, + "total_submitted": 760565, "frontend_question_id": 621, "is_new_question": false }, @@ -47326,8 +47901,8 @@ "question__title": "Not Boring Movies", "question__title_slug": "not-boring-movies", "question__hide": false, - "total_acs": 232337, - "total_submitted": 321266, + "total_acs": 234847, + "total_submitted": 324712, "frontend_question_id": 620, "is_new_question": false }, @@ -47349,8 +47924,8 @@ "question__title": "Biggest Single Number", "question__title_slug": "biggest-single-number", "question__hide": false, - "total_acs": 65482, - "total_submitted": 128966, + "total_acs": 67329, + "total_submitted": 131766, "frontend_question_id": 619, "is_new_question": false }, @@ -47372,8 +47947,8 @@ "question__title": "Students Report By Geography", "question__title_slug": "students-report-by-geography", "question__hide": false, - "total_acs": 20822, - "total_submitted": 32550, + "total_acs": 20907, + "total_submitted": 32671, "frontend_question_id": 618, "is_new_question": false }, @@ -47395,8 +47970,8 @@ "question__title": "Merge Two Binary Trees", "question__title_slug": "merge-two-binary-trees", "question__hide": false, - "total_acs": 682019, - "total_submitted": 867103, + "total_acs": 684466, + "total_submitted": 870132, "frontend_question_id": 617, "is_new_question": false }, @@ -47418,8 +47993,8 @@ "question__title": "Add Bold Tag in String", "question__title_slug": "add-bold-tag-in-string", "question__hide": false, - "total_acs": 82595, - "total_submitted": 169077, + "total_acs": 82718, + "total_submitted": 169285, "frontend_question_id": 616, "is_new_question": false }, @@ -47441,8 +48016,8 @@ "question__title": "Average Salary: Departments VS Company", "question__title_slug": "average-salary-departments-vs-company", "question__hide": false, - "total_acs": 32132, - "total_submitted": 57015, + "total_acs": 32208, + "total_submitted": 57318, "frontend_question_id": 615, "is_new_question": false }, @@ -47464,8 +48039,8 @@ "question__title": "Second Degree Follower", "question__title_slug": "second-degree-follower", "question__hide": false, - "total_acs": 47723, - "total_submitted": 127061, + "total_acs": 47833, + "total_submitted": 127305, "frontend_question_id": 614, "is_new_question": false }, @@ -47487,8 +48062,8 @@ "question__title": "Shortest Distance in a Line", "question__title_slug": "shortest-distance-in-a-line", "question__hide": false, - "total_acs": 62959, - "total_submitted": 77822, + "total_acs": 63198, + "total_submitted": 78169, "frontend_question_id": 613, "is_new_question": false }, @@ -47510,8 +48085,8 @@ "question__title": "Shortest Distance in a Plane", "question__title_slug": "shortest-distance-in-a-plane", "question__hide": false, - "total_acs": 36594, - "total_submitted": 58532, + "total_acs": 36691, + "total_submitted": 58723, "frontend_question_id": 612, "is_new_question": false }, @@ -47533,8 +48108,8 @@ "question__title": "Valid Triangle Number", "question__title_slug": "valid-triangle-number", "question__hide": false, - "total_acs": 168807, - "total_submitted": 333799, + "total_acs": 169347, + "total_submitted": 334787, "frontend_question_id": 611, "is_new_question": false }, @@ -47556,8 +48131,8 @@ "question__title": "Triangle Judgement", "question__title_slug": "triangle-judgement", "question__hide": false, - "total_acs": 65275, - "total_submitted": 92305, + "total_acs": 66898, + "total_submitted": 94691, "frontend_question_id": 610, "is_new_question": false }, @@ -47579,8 +48154,8 @@ "question__title": "Find Duplicate File in System", "question__title_slug": "find-duplicate-file-in-system", "question__hide": false, - "total_acs": 144384, - "total_submitted": 213288, + "total_acs": 144589, + "total_submitted": 213582, "frontend_question_id": 609, "is_new_question": false }, @@ -47602,8 +48177,8 @@ "question__title": "Tree Node", "question__title_slug": "tree-node", "question__hide": false, - "total_acs": 124265, - "total_submitted": 173698, + "total_acs": 125896, + "total_submitted": 176007, "frontend_question_id": 608, "is_new_question": false }, @@ -47625,8 +48200,8 @@ "question__title": "Sales Person", "question__title_slug": "sales-person", "question__hide": false, - "total_acs": 145320, - "total_submitted": 211325, + "total_acs": 147510, + "total_submitted": 215221, "frontend_question_id": 607, "is_new_question": false }, @@ -47648,8 +48223,8 @@ "question__title": "Construct String from Binary Tree", "question__title_slug": "construct-string-from-binary-tree", "question__hide": false, - "total_acs": 217235, - "total_submitted": 338843, + "total_acs": 217753, + "total_submitted": 339485, "frontend_question_id": 606, "is_new_question": false }, @@ -47671,8 +48246,8 @@ "question__title": "Can Place Flowers", "question__title_slug": "can-place-flowers", "question__hide": false, - "total_acs": 428470, - "total_submitted": 1308055, + "total_acs": 433125, + "total_submitted": 1325918, "frontend_question_id": 605, "is_new_question": false }, @@ -47694,8 +48269,8 @@ "question__title": "Design Compressed String Iterator", "question__title_slug": "design-compressed-string-iterator", "question__hide": false, - "total_acs": 29707, - "total_submitted": 75070, + "total_acs": 29797, + "total_submitted": 75297, "frontend_question_id": 604, "is_new_question": false }, @@ -47717,8 +48292,8 @@ "question__title": "Consecutive Available Seats", "question__title_slug": "consecutive-available-seats", "question__hide": false, - "total_acs": 74726, - "total_submitted": 111134, + "total_acs": 75039, + "total_submitted": 111626, "frontend_question_id": 603, "is_new_question": false }, @@ -47740,8 +48315,8 @@ "question__title": "Friend Requests II: Who Has the Most Friends", "question__title_slug": "friend-requests-ii-who-has-the-most-friends", "question__hide": false, - "total_acs": 59208, - "total_submitted": 97981, + "total_acs": 60056, + "total_submitted": 99731, "frontend_question_id": 602, "is_new_question": false }, @@ -47763,8 +48338,8 @@ "question__title": "Human Traffic of Stadium", "question__title_slug": "human-traffic-of-stadium", "question__hide": false, - "total_acs": 79794, - "total_submitted": 161243, + "total_acs": 80253, + "total_submitted": 162393, "frontend_question_id": 601, "is_new_question": false }, @@ -47786,8 +48361,8 @@ "question__title": "Non-negative Integers without Consecutive Ones", "question__title_slug": "non-negative-integers-without-consecutive-ones", "question__hide": false, - "total_acs": 34337, - "total_submitted": 87683, + "total_acs": 34434, + "total_submitted": 87902, "frontend_question_id": 600, "is_new_question": false }, @@ -47809,8 +48384,8 @@ "question__title": "Minimum Index Sum of Two Lists", "question__title_slug": "minimum-index-sum-of-two-lists", "question__hide": false, - "total_acs": 189266, - "total_submitted": 353439, + "total_acs": 190117, + "total_submitted": 354810, "frontend_question_id": 599, "is_new_question": false }, @@ -47832,8 +48407,8 @@ "question__title": "Range Addition II", "question__title_slug": "range-addition-ii", "question__hide": false, - "total_acs": 89226, - "total_submitted": 161119, + "total_acs": 89494, + "total_submitted": 161563, "frontend_question_id": 598, "is_new_question": false }, @@ -47855,8 +48430,8 @@ "question__title": "Friend Requests I: Overall Acceptance Rate", "question__title_slug": "friend-requests-i-overall-acceptance-rate", "question__hide": false, - "total_acs": 68316, - "total_submitted": 161303, + "total_acs": 68455, + "total_submitted": 161745, "frontend_question_id": 597, "is_new_question": false }, @@ -47878,8 +48453,8 @@ "question__title": "Classes More Than 5 Students", "question__title_slug": "classes-more-than-5-students", "question__hide": false, - "total_acs": 244157, - "total_submitted": 505678, + "total_acs": 246347, + "total_submitted": 509135, "frontend_question_id": 596, "is_new_question": false }, @@ -47901,8 +48476,8 @@ "question__title": "Big Countries", "question__title_slug": "big-countries", "question__hide": false, - "total_acs": 622997, - "total_submitted": 892720, + "total_acs": 632240, + "total_submitted": 907859, "frontend_question_id": 595, "is_new_question": false }, @@ -47924,8 +48499,8 @@ "question__title": "Longest Harmonious Subsequence", "question__title_slug": "longest-harmonious-subsequence", "question__hide": false, - "total_acs": 134563, - "total_submitted": 251176, + "total_acs": 134987, + "total_submitted": 251845, "frontend_question_id": 594, "is_new_question": false }, @@ -47947,8 +48522,8 @@ "question__title": "Valid Square", "question__title_slug": "valid-square", "question__hide": false, - "total_acs": 97409, - "total_submitted": 221759, + "total_acs": 97707, + "total_submitted": 222358, "frontend_question_id": 593, "is_new_question": false }, @@ -47970,8 +48545,8 @@ "question__title": "Fraction Addition and Subtraction", "question__title_slug": "fraction-addition-and-subtraction", "question__hide": false, - "total_acs": 32460, - "total_submitted": 61875, + "total_acs": 32551, + "total_submitted": 62002, "frontend_question_id": 592, "is_new_question": false }, @@ -47993,8 +48568,8 @@ "question__title": "Tag Validator", "question__title_slug": "tag-validator", "question__hide": false, - "total_acs": 13036, - "total_submitted": 35023, + "total_acs": 13059, + "total_submitted": 35071, "frontend_question_id": 591, "is_new_question": false }, @@ -48016,8 +48591,8 @@ "question__title": "Design In-Memory File System", "question__title_slug": "design-in-memory-file-system", "question__hide": false, - "total_acs": 84870, - "total_submitted": 174868, + "total_acs": 85162, + "total_submitted": 175501, "frontend_question_id": 588, "is_new_question": false }, @@ -48039,8 +48614,8 @@ "question__title": "Erect the Fence", "question__title_slug": "erect-the-fence", "question__hide": false, - "total_acs": 53993, - "total_submitted": 103488, + "total_acs": 54117, + "total_submitted": 103780, "frontend_question_id": 587, "is_new_question": false }, @@ -48062,8 +48637,8 @@ "question__title": "Customer Placing the Largest Number of Orders", "question__title_slug": "customer-placing-the-largest-number-of-orders", "question__hide": false, - "total_acs": 171299, - "total_submitted": 251011, + "total_acs": 173788, + "total_submitted": 255438, "frontend_question_id": 586, "is_new_question": false }, @@ -48085,8 +48660,8 @@ "question__title": "Investments in 2016", "question__title_slug": "investments-in-2016", "question__hide": false, - "total_acs": 41648, - "total_submitted": 81568, + "total_acs": 42476, + "total_submitted": 83912, "frontend_question_id": 585, "is_new_question": false }, @@ -48108,8 +48683,8 @@ "question__title": "Find Customer Referee", "question__title_slug": "find-customer-referee", "question__hide": false, - "total_acs": 318189, - "total_submitted": 459177, + "total_acs": 326810, + "total_submitted": 471822, "frontend_question_id": 584, "is_new_question": false }, @@ -48131,8 +48706,8 @@ "question__title": "Delete Operation for Two Strings", "question__title_slug": "delete-operation-for-two-strings", "question__hide": false, - "total_acs": 203939, - "total_submitted": 340472, + "total_acs": 204747, + "total_submitted": 341659, "frontend_question_id": 583, "is_new_question": false }, @@ -48154,8 +48729,8 @@ "question__title": "Kill Process", "question__title_slug": "kill-process", "question__hide": false, - "total_acs": 78993, - "total_submitted": 114851, + "total_acs": 79121, + "total_submitted": 115032, "frontend_question_id": 582, "is_new_question": false }, @@ -48177,8 +48752,8 @@ "question__title": "Shortest Unsorted Continuous Subarray", "question__title_slug": "shortest-unsorted-continuous-subarray", "question__hide": false, - "total_acs": 301288, - "total_submitted": 826971, + "total_acs": 301918, + "total_submitted": 828425, "frontend_question_id": 581, "is_new_question": false }, @@ -48200,8 +48775,8 @@ "question__title": "Count Student Number in Departments", "question__title_slug": "count-student-number-in-departments", "question__hide": false, - "total_acs": 60279, - "total_submitted": 102910, + "total_acs": 60506, + "total_submitted": 103315, "frontend_question_id": 580, "is_new_question": false }, @@ -48223,8 +48798,8 @@ "question__title": "Find Cumulative Salary of an Employee", "question__title_slug": "find-cumulative-salary-of-an-employee", "question__hide": false, - "total_acs": 30738, - "total_submitted": 67430, + "total_acs": 30828, + "total_submitted": 67661, "frontend_question_id": 579, "is_new_question": false }, @@ -48246,8 +48821,8 @@ "question__title": "Get Highest Answer Rate Question", "question__title_slug": "get-highest-answer-rate-question", "question__hide": false, - "total_acs": 48734, - "total_submitted": 119309, + "total_acs": 48874, + "total_submitted": 119778, "frontend_question_id": 578, "is_new_question": false }, @@ -48269,8 +48844,8 @@ "question__title": "Employee Bonus", "question__title_slug": "employee-bonus", "question__hide": false, - "total_acs": 80218, - "total_submitted": 107702, + "total_acs": 83943, + "total_submitted": 112913, "frontend_question_id": 577, "is_new_question": false }, @@ -48292,8 +48867,8 @@ "question__title": "Out of Boundary Paths", "question__title_slug": "out-of-boundary-paths", "question__hide": false, - "total_acs": 116132, - "total_submitted": 262386, + "total_acs": 116285, + "total_submitted": 262728, "frontend_question_id": 576, "is_new_question": false }, @@ -48315,8 +48890,8 @@ "question__title": "Distribute Candies", "question__title_slug": "distribute-candies", "question__hide": false, - "total_acs": 241519, - "total_submitted": 363237, + "total_acs": 242442, + "total_submitted": 364462, "frontend_question_id": 575, "is_new_question": false }, @@ -48338,8 +48913,8 @@ "question__title": "Winning Candidate", "question__title_slug": "winning-candidate", "question__hide": false, - "total_acs": 56738, - "total_submitted": 94832, + "total_acs": 56908, + "total_submitted": 95107, "frontend_question_id": 574, "is_new_question": false }, @@ -48361,8 +48936,8 @@ "question__title": "Squirrel Simulation", "question__title_slug": "squirrel-simulation", "question__hide": false, - "total_acs": 18077, - "total_submitted": 32786, + "total_acs": 18102, + "total_submitted": 32822, "frontend_question_id": 573, "is_new_question": false }, @@ -48384,8 +48959,8 @@ "question__title": "Subtree of Another Tree", "question__title_slug": "subtree-of-another-tree", "question__hide": false, - "total_acs": 648991, - "total_submitted": 1396829, + "total_acs": 652623, + "total_submitted": 1403885, "frontend_question_id": 572, "is_new_question": false }, @@ -48407,8 +48982,8 @@ "question__title": "Find Median Given Frequency of Numbers", "question__title_slug": "find-median-given-frequency-of-numbers", "question__hide": false, - "total_acs": 24876, - "total_submitted": 57517, + "total_acs": 24988, + "total_submitted": 57830, "frontend_question_id": 571, "is_new_question": false }, @@ -48430,8 +49005,8 @@ "question__title": "Managers with at Least 5 Direct Reports", "question__title_slug": "managers-with-at-least-5-direct-reports", "question__hide": false, - "total_acs": 82598, - "total_submitted": 125118, + "total_acs": 85126, + "total_submitted": 129895, "frontend_question_id": 570, "is_new_question": false }, @@ -48453,8 +49028,8 @@ "question__title": "Median Employee Salary", "question__title_slug": "median-employee-salary", "question__hide": false, - "total_acs": 34783, - "total_submitted": 51863, + "total_acs": 34906, + "total_submitted": 52094, "frontend_question_id": 569, "is_new_question": false }, @@ -48476,8 +49051,8 @@ "question__title": "Maximum Vacation Days", "question__title_slug": "maximum-vacation-days", "question__hide": false, - "total_acs": 35995, - "total_submitted": 79814, + "total_acs": 36035, + "total_submitted": 79862, "frontend_question_id": 568, "is_new_question": false }, @@ -48499,8 +49074,8 @@ "question__title": "Permutation in String", "question__title_slug": "permutation-in-string", "question__hide": false, - "total_acs": 644859, - "total_submitted": 1455422, + "total_acs": 649291, + "total_submitted": 1465548, "frontend_question_id": 567, "is_new_question": false }, @@ -48522,8 +49097,8 @@ "question__title": "Reshape the Matrix", "question__title_slug": "reshape-the-matrix", "question__hide": false, - "total_acs": 345067, - "total_submitted": 548289, + "total_acs": 347011, + "total_submitted": 551194, "frontend_question_id": 566, "is_new_question": false }, @@ -48545,8 +49120,8 @@ "question__title": "Array Nesting", "question__title_slug": "array-nesting", "question__hide": false, - "total_acs": 122375, - "total_submitted": 217039, + "total_acs": 122544, + "total_submitted": 217404, "frontend_question_id": 565, "is_new_question": false }, @@ -48568,8 +49143,8 @@ "question__title": "Find the Closest Palindrome", "question__title_slug": "find-the-closest-palindrome", "question__hide": false, - "total_acs": 38060, - "total_submitted": 173877, + "total_acs": 38132, + "total_submitted": 174226, "frontend_question_id": 564, "is_new_question": false }, @@ -48591,8 +49166,8 @@ "question__title": "Binary Tree Tilt", "question__title_slug": "binary-tree-tilt", "question__hide": false, - "total_acs": 189256, - "total_submitted": 314605, + "total_acs": 189749, + "total_submitted": 315264, "frontend_question_id": 563, "is_new_question": false }, @@ -48614,8 +49189,8 @@ "question__title": "Longest Line of Consecutive One in Matrix", "question__title_slug": "longest-line-of-consecutive-one-in-matrix", "question__hide": false, - "total_acs": 72343, - "total_submitted": 143984, + "total_acs": 72510, + "total_submitted": 144281, "frontend_question_id": 562, "is_new_question": false }, @@ -48637,8 +49212,8 @@ "question__title": "Array Partition", "question__title_slug": "array-partition", "question__hide": false, - "total_acs": 397693, - "total_submitted": 514449, + "total_acs": 399488, + "total_submitted": 516512, "frontend_question_id": 561, "is_new_question": false }, @@ -48660,8 +49235,8 @@ "question__title": "Subarray Sum Equals K", "question__title_slug": "subarray-sum-equals-k", "question__hide": false, - "total_acs": 963834, - "total_submitted": 2209598, + "total_acs": 968247, + "total_submitted": 2219953, "frontend_question_id": 560, "is_new_question": false }, @@ -48683,8 +49258,8 @@ "question__title": "Reverse Words in a String III", "question__title_slug": "reverse-words-in-a-string-iii", "question__hide": false, - "total_acs": 687887, - "total_submitted": 839667, + "total_acs": 691151, + "total_submitted": 843591, "frontend_question_id": 557, "is_new_question": false }, @@ -48706,8 +49281,8 @@ "question__title": "Next Greater Element III", "question__title_slug": "next-greater-element-iii", "question__hide": false, - "total_acs": 126496, - "total_submitted": 372126, + "total_acs": 126934, + "total_submitted": 373433, "frontend_question_id": 556, "is_new_question": false }, @@ -48729,8 +49304,8 @@ "question__title": "Split Concatenated Strings", "question__title_slug": "split-concatenated-strings", "question__hide": false, - "total_acs": 6379, - "total_submitted": 14624, + "total_acs": 6402, + "total_submitted": 14685, "frontend_question_id": 555, "is_new_question": false }, @@ -48752,8 +49327,8 @@ "question__title": "Brick Wall", "question__title_slug": "brick-wall", "question__hide": false, - "total_acs": 116386, - "total_submitted": 217008, + "total_acs": 116880, + "total_submitted": 217792, "frontend_question_id": 554, "is_new_question": false }, @@ -48775,8 +49350,8 @@ "question__title": "Optimal Division", "question__title_slug": "optimal-division", "question__hide": false, - "total_acs": 35474, - "total_submitted": 59186, + "total_acs": 35583, + "total_submitted": 59359, "frontend_question_id": 553, "is_new_question": false }, @@ -48798,8 +49373,8 @@ "question__title": "Student Attendance Record II", "question__title_slug": "student-attendance-record-ii", "question__hide": false, - "total_acs": 59246, - "total_submitted": 143007, + "total_acs": 59419, + "total_submitted": 143311, "frontend_question_id": 552, "is_new_question": false }, @@ -48821,8 +49396,8 @@ "question__title": "Student Attendance Record I", "question__title_slug": "student-attendance-record-i", "question__hide": false, - "total_acs": 177240, - "total_submitted": 367640, + "total_acs": 178066, + "total_submitted": 369275, "frontend_question_id": 551, "is_new_question": false }, @@ -48844,8 +49419,8 @@ "question__title": "Shortest Path to Get Food", "question__title_slug": "shortest-path-to-get-food", "question__hide": false, - "total_acs": 53449, - "total_submitted": 98716, + "total_acs": 53648, + "total_submitted": 99060, "frontend_question_id": 1730, "is_new_question": false }, @@ -48867,8 +49442,8 @@ "question__title": "Binary Tree Longest Consecutive Sequence II", "question__title_slug": "binary-tree-longest-consecutive-sequence-ii", "question__hide": false, - "total_acs": 50140, - "total_submitted": 101300, + "total_acs": 50221, + "total_submitted": 101485, "frontend_question_id": 549, "is_new_question": false }, @@ -48890,8 +49465,8 @@ "question__title": "Split Array with Equal Sum", "question__title_slug": "split-array-with-equal-sum", "question__hide": false, - "total_acs": 23305, - "total_submitted": 46483, + "total_acs": 23321, + "total_submitted": 46518, "frontend_question_id": 548, "is_new_question": false }, @@ -48913,8 +49488,8 @@ "question__title": "Number of Provinces", "question__title_slug": "number-of-provinces", "question__hide": false, - "total_acs": 618861, - "total_submitted": 969095, + "total_acs": 622708, + "total_submitted": 974333, "frontend_question_id": 547, "is_new_question": false }, @@ -48936,8 +49511,8 @@ "question__title": "Remove Boxes", "question__title_slug": "remove-boxes", "question__hide": false, - "total_acs": 39641, - "total_submitted": 83339, + "total_acs": 39718, + "total_submitted": 83511, "frontend_question_id": 546, "is_new_question": false }, @@ -48959,8 +49534,8 @@ "question__title": "Boundary of Binary Tree", "question__title_slug": "boundary-of-binary-tree", "question__hide": false, - "total_acs": 119349, - "total_submitted": 267991, + "total_acs": 119517, + "total_submitted": 268295, "frontend_question_id": 545, "is_new_question": false }, @@ -48982,8 +49557,8 @@ "question__title": "Output Contest Matches", "question__title_slug": "output-contest-matches", "question__hide": false, - "total_acs": 26030, - "total_submitted": 33822, + "total_acs": 26043, + "total_submitted": 33837, "frontend_question_id": 544, "is_new_question": false }, @@ -49005,8 +49580,8 @@ "question__title": "Diameter of Binary Tree", "question__title_slug": "diameter-of-binary-tree", "question__hide": false, - "total_acs": 1027709, - "total_submitted": 1804772, + "total_acs": 1034326, + "total_submitted": 1814569, "frontend_question_id": 543, "is_new_question": false }, @@ -49028,8 +49603,8 @@ "question__title": "01 Matrix", "question__title_slug": "01-matrix", "question__hide": false, - "total_acs": 378661, - "total_submitted": 843329, + "total_acs": 381497, + "total_submitted": 849020, "frontend_question_id": 542, "is_new_question": false }, @@ -49051,8 +49626,8 @@ "question__title": "Reverse String II", "question__title_slug": "reverse-string-ii", "question__hide": false, - "total_acs": 195686, - "total_submitted": 387967, + "total_acs": 196644, + "total_submitted": 389881, "frontend_question_id": 541, "is_new_question": false }, @@ -49074,8 +49649,8 @@ "question__title": "Single Element in a Sorted Array", "question__title_slug": "single-element-in-a-sorted-array", "question__hide": false, - "total_acs": 468782, - "total_submitted": 793054, + "total_acs": 471138, + "total_submitted": 797136, "frontend_question_id": 540, "is_new_question": false }, @@ -49097,8 +49672,8 @@ "question__title": "Minimum Time Difference", "question__title_slug": "minimum-time-difference", "question__hide": false, - "total_acs": 124337, - "total_submitted": 220154, + "total_acs": 125048, + "total_submitted": 221364, "frontend_question_id": 539, "is_new_question": false }, @@ -49120,8 +49695,8 @@ "question__title": "Convert BST to Greater Tree", "question__title_slug": "convert-bst-to-greater-tree", "question__hide": false, - "total_acs": 267259, - "total_submitted": 393808, + "total_acs": 267888, + "total_submitted": 394596, "frontend_question_id": 538, "is_new_question": false }, @@ -49143,8 +49718,8 @@ "question__title": "Complex Number Multiplication", "question__title_slug": "complex-number-multiplication", "question__hide": false, - "total_acs": 88080, - "total_submitted": 123326, + "total_acs": 88290, + "total_submitted": 123599, "frontend_question_id": 537, "is_new_question": false }, @@ -49166,8 +49741,8 @@ "question__title": "Construct Binary Tree from String", "question__title_slug": "construct-binary-tree-from-string", "question__hide": false, - "total_acs": 83204, - "total_submitted": 147891, + "total_acs": 83265, + "total_submitted": 147983, "frontend_question_id": 536, "is_new_question": false }, @@ -49189,8 +49764,8 @@ "question__title": "Encode and Decode TinyURL", "question__title_slug": "encode-and-decode-tinyurl", "question__hide": false, - "total_acs": 228763, - "total_submitted": 266099, + "total_acs": 229443, + "total_submitted": 266855, "frontend_question_id": 535, "is_new_question": false }, @@ -49212,8 +49787,8 @@ "question__title": "Lonely Pixel II", "question__title_slug": "lonely-pixel-ii", "question__hide": false, - "total_acs": 12766, - "total_submitted": 26336, + "total_acs": 12784, + "total_submitted": 26368, "frontend_question_id": 533, "is_new_question": false }, @@ -49235,8 +49810,8 @@ "question__title": "K-diff Pairs in an Array", "question__title_slug": "k-diff-pairs-in-an-array", "question__hide": false, - "total_acs": 291838, - "total_submitted": 707337, + "total_acs": 292642, + "total_submitted": 708824, "frontend_question_id": 532, "is_new_question": false }, @@ -49258,8 +49833,8 @@ "question__title": "Lonely Pixel I", "question__title_slug": "lonely-pixel-i", "question__hide": false, - "total_acs": 39084, - "total_submitted": 62804, + "total_acs": 39204, + "total_submitted": 63008, "frontend_question_id": 531, "is_new_question": false }, @@ -49281,8 +49856,8 @@ "question__title": "Minimum Absolute Difference in BST", "question__title_slug": "minimum-absolute-difference-in-bst", "question__hide": false, - "total_acs": 204341, - "total_submitted": 356355, + "total_acs": 205938, + "total_submitted": 359673, "frontend_question_id": 530, "is_new_question": false }, @@ -49304,8 +49879,8 @@ "question__title": "Minesweeper", "question__title_slug": "minesweeper", "question__hide": false, - "total_acs": 136247, - "total_submitted": 207350, + "total_acs": 136825, + "total_submitted": 208102, "frontend_question_id": 529, "is_new_question": false }, @@ -49327,8 +49902,8 @@ "question__title": "Swapping Nodes in a Linked List", "question__title_slug": "swapping-nodes-in-a-linked-list", "question__hide": false, - "total_acs": 210216, - "total_submitted": 313590, + "total_acs": 236914, + "total_submitted": 347725, "frontend_question_id": 1721, "is_new_question": false }, @@ -49350,8 +49925,8 @@ "question__title": "Word Abbreviation", "question__title_slug": "word-abbreviation", "question__hide": false, - "total_acs": 26047, - "total_submitted": 42933, + "total_acs": 26081, + "total_submitted": 42987, "frontend_question_id": 527, "is_new_question": false }, @@ -49373,8 +49948,8 @@ "question__title": "Beautiful Arrangement", "question__title_slug": "beautiful-arrangement", "question__hide": false, - "total_acs": 151483, - "total_submitted": 235161, + "total_acs": 151884, + "total_submitted": 235784, "frontend_question_id": 526, "is_new_question": false }, @@ -49396,8 +49971,8 @@ "question__title": "Contiguous Array", "question__title_slug": "contiguous-array", "question__hide": false, - "total_acs": 295398, - "total_submitted": 630750, + "total_acs": 296083, + "total_submitted": 632225, "frontend_question_id": 525, "is_new_question": false }, @@ -49419,8 +49994,8 @@ "question__title": "Longest Word in Dictionary through Deleting", "question__title_slug": "longest-word-in-dictionary-through-deleting", "question__hide": false, - "total_acs": 141345, - "total_submitted": 277080, + "total_acs": 141698, + "total_submitted": 277823, "frontend_question_id": 524, "is_new_question": false }, @@ -49442,8 +50017,8 @@ "question__title": "Continuous Subarray Sum", "question__title_slug": "continuous-subarray-sum", "question__hide": false, - "total_acs": 391606, - "total_submitted": 1373881, + "total_acs": 392690, + "total_submitted": 1377506, "frontend_question_id": 523, "is_new_question": false }, @@ -49465,8 +50040,8 @@ "question__title": "Longest Uncommon Subsequence II", "question__title_slug": "longest-uncommon-subsequence-ii", "question__hide": false, - "total_acs": 47331, - "total_submitted": 116691, + "total_acs": 47432, + "total_submitted": 116898, "frontend_question_id": 522, "is_new_question": false }, @@ -49488,8 +50063,8 @@ "question__title": "Longest Uncommon Subsequence I", "question__title_slug": "longest-uncommon-subsequence-i", "question__hide": false, - "total_acs": 96658, - "total_submitted": 160199, + "total_acs": 96930, + "total_submitted": 160758, "frontend_question_id": 521, "is_new_question": false }, @@ -49511,8 +50086,8 @@ "question__title": "Detect Capital", "question__title_slug": "detect-capital", "question__hide": false, - "total_acs": 389124, - "total_submitted": 683072, + "total_acs": 390046, + "total_submitted": 684750, "frontend_question_id": 520, "is_new_question": false }, @@ -49534,8 +50109,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": 1919, - "total_submitted": 3534, + "total_acs": 1933, + "total_submitted": 3572, "frontend_question_id": 1983, "is_new_question": false }, @@ -49557,8 +50132,8 @@ "question__title": "Coin Change II", "question__title_slug": "coin-change-ii", "question__hide": false, - "total_acs": 409068, - "total_submitted": 673978, + "total_acs": 411668, + "total_submitted": 677584, "frontend_question_id": 518, "is_new_question": false }, @@ -49580,8 +50155,8 @@ "question__title": "Super Washing Machines", "question__title_slug": "super-washing-machines", "question__hide": false, - "total_acs": 25718, - "total_submitted": 63750, + "total_acs": 25808, + "total_submitted": 63919, "frontend_question_id": 517, "is_new_question": false }, @@ -49603,8 +50178,8 @@ "question__title": "Longest Palindromic Subsequence", "question__title_slug": "longest-palindromic-subsequence", "question__hide": false, - "total_acs": 385214, - "total_submitted": 624096, + "total_acs": 386961, + "total_submitted": 626708, "frontend_question_id": 516, "is_new_question": false }, @@ -49626,8 +50201,8 @@ "question__title": "Find Largest Value in Each Tree Row", "question__title_slug": "find-largest-value-in-each-tree-row", "question__hide": false, - "total_acs": 227056, - "total_submitted": 351778, + "total_acs": 227866, + "total_submitted": 353009, "frontend_question_id": 515, "is_new_question": false }, @@ -49649,8 +50224,8 @@ "question__title": "Freedom Trail", "question__title_slug": "freedom-trail", "question__hide": false, - "total_acs": 32088, - "total_submitted": 68126, + "total_acs": 32200, + "total_submitted": 68651, "frontend_question_id": 514, "is_new_question": false }, @@ -49672,8 +50247,8 @@ "question__title": "Find Bottom Left Tree Value", "question__title_slug": "find-bottom-left-tree-value", "question__hide": false, - "total_acs": 211960, - "total_submitted": 316547, + "total_acs": 212808, + "total_submitted": 317653, "frontend_question_id": 513, "is_new_question": false }, @@ -49695,8 +50270,8 @@ "question__title": "Maximum Alternating Subarray Sum", "question__title_slug": "maximum-alternating-subarray-sum", "question__hide": false, - "total_acs": 2199, - "total_submitted": 5363, + "total_acs": 2214, + "total_submitted": 5406, "frontend_question_id": 2036, "is_new_question": false }, @@ -49718,8 +50293,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": 51487, - "total_submitted": 131624, + "total_acs": 51644, + "total_submitted": 132197, "frontend_question_id": 1059, "is_new_question": false }, @@ -49741,8 +50316,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": 2947, - "total_submitted": 5697, + "total_acs": 2974, + "total_submitted": 5750, "frontend_question_id": 2031, "is_new_question": false }, @@ -49764,8 +50339,8 @@ "question__title": "Inorder Successor in BST II", "question__title_slug": "inorder-successor-in-bst-ii", "question__hide": false, - "total_acs": 60834, - "total_submitted": 99703, + "total_acs": 60956, + "total_submitted": 99876, "frontend_question_id": 510, "is_new_question": false }, @@ -49787,8 +50362,8 @@ "question__title": "Most Frequent Subtree Sum", "question__title_slug": "most-frequent-subtree-sum", "question__hide": false, - "total_acs": 126446, - "total_submitted": 194472, + "total_acs": 126775, + "total_submitted": 194875, "frontend_question_id": 508, "is_new_question": false }, @@ -49810,8 +50385,8 @@ "question__title": "Perfect Number", "question__title_slug": "perfect-number", "question__hide": false, - "total_acs": 134699, - "total_submitted": 357684, + "total_acs": 135758, + "total_submitted": 360707, "frontend_question_id": 507, "is_new_question": false }, @@ -49833,8 +50408,8 @@ "question__title": "Relative Ranks", "question__title_slug": "relative-ranks", "question__hide": false, - "total_acs": 123546, - "total_submitted": 203222, + "total_acs": 124456, + "total_submitted": 204437, "frontend_question_id": 506, "is_new_question": false }, @@ -49856,8 +50431,8 @@ "question__title": "The Maze II", "question__title_slug": "the-maze-ii", "question__hide": false, - "total_acs": 95266, - "total_submitted": 181336, + "total_acs": 95464, + "total_submitted": 181649, "frontend_question_id": 505, "is_new_question": false }, @@ -49879,8 +50454,8 @@ "question__title": "Base 7", "question__title_slug": "base-7", "question__hide": false, - "total_acs": 106563, - "total_submitted": 219436, + "total_acs": 107163, + "total_submitted": 220462, "frontend_question_id": 504, "is_new_question": false }, @@ -49902,8 +50477,8 @@ "question__title": "Next Greater Element II", "question__title_slug": "next-greater-element-ii", "question__hide": false, - "total_acs": 302822, - "total_submitted": 479123, + "total_acs": 304667, + "total_submitted": 481991, "frontend_question_id": 503, "is_new_question": false }, @@ -49925,8 +50500,8 @@ "question__title": "IPO", "question__title_slug": "ipo", "question__hide": false, - "total_acs": 92007, - "total_submitted": 184882, + "total_acs": 92472, + "total_submitted": 185912, "frontend_question_id": 502, "is_new_question": false }, @@ -49948,8 +50523,8 @@ "question__title": "Find Mode in Binary Search Tree", "question__title_slug": "find-mode-in-binary-search-tree", "question__hide": false, - "total_acs": 189720, - "total_submitted": 383824, + "total_acs": 190502, + "total_submitted": 385068, "frontend_question_id": 501, "is_new_question": false }, @@ -49971,8 +50546,8 @@ "question__title": "Keyboard Row", "question__title_slug": "keyboard-row", "question__hide": false, - "total_acs": 185251, - "total_submitted": 266016, + "total_acs": 186195, + "total_submitted": 267360, "frontend_question_id": 500, "is_new_question": false }, @@ -49994,8 +50569,8 @@ "question__title": "The Maze III", "question__title_slug": "the-maze-iii", "question__hide": false, - "total_acs": 27349, - "total_submitted": 57625, + "total_acs": 27464, + "total_submitted": 57804, "frontend_question_id": 499, "is_new_question": false }, @@ -50017,8 +50592,8 @@ "question__title": "Diagonal Traverse", "question__title_slug": "diagonal-traverse", "question__hide": false, - "total_acs": 242654, - "total_submitted": 416273, + "total_acs": 243569, + "total_submitted": 417648, "frontend_question_id": 498, "is_new_question": false }, @@ -50040,8 +50615,8 @@ "question__title": "Next Greater Element I", "question__title_slug": "next-greater-element-i", "question__hide": false, - "total_acs": 520528, - "total_submitted": 729024, + "total_acs": 524391, + "total_submitted": 734686, "frontend_question_id": 496, "is_new_question": false }, @@ -50063,8 +50638,8 @@ "question__title": "Teemo Attacking", "question__title_slug": "teemo-attacking", "question__hide": false, - "total_acs": 123566, - "total_submitted": 217333, + "total_acs": 124958, + "total_submitted": 219653, "frontend_question_id": 495, "is_new_question": false }, @@ -50086,8 +50661,8 @@ "question__title": "Target Sum", "question__title_slug": "target-sum", "question__hide": false, - "total_acs": 455598, - "total_submitted": 997169, + "total_acs": 457963, + "total_submitted": 1002026, "frontend_question_id": 494, "is_new_question": false }, @@ -50109,8 +50684,8 @@ "question__title": "Reverse Pairs", "question__title_slug": "reverse-pairs", "question__hide": false, - "total_acs": 121783, - "total_submitted": 394849, + "total_acs": 122693, + "total_submitted": 397707, "frontend_question_id": 493, "is_new_question": false }, @@ -50132,8 +50707,8 @@ "question__title": "Construct the Rectangle", "question__title_slug": "construct-the-rectangle", "question__hide": false, - "total_acs": 96452, - "total_submitted": 175483, + "total_acs": 96881, + "total_submitted": 176079, "frontend_question_id": 492, "is_new_question": false }, @@ -50155,8 +50730,8 @@ "question__title": "Non-decreasing Subsequences", "question__title_slug": "non-decreasing-subsequences", "question__hide": false, - "total_acs": 148983, - "total_submitted": 247519, + "total_acs": 149528, + "total_submitted": 248444, "frontend_question_id": 491, "is_new_question": false }, @@ -50178,8 +50753,8 @@ "question__title": "The Maze", "question__title_slug": "the-maze", "question__hide": false, - "total_acs": 142512, - "total_submitted": 255024, + "total_acs": 143190, + "total_submitted": 256112, "frontend_question_id": 490, "is_new_question": false }, @@ -50201,8 +50776,8 @@ "question__title": "Kth Smallest Instructions", "question__title_slug": "kth-smallest-instructions", "question__hide": false, - "total_acs": 10120, - "total_submitted": 21512, + "total_acs": 10204, + "total_submitted": 21647, "frontend_question_id": 1643, "is_new_question": false }, @@ -50224,8 +50799,8 @@ "question__title": "Zuma Game", "question__title_slug": "zuma-game", "question__hide": false, - "total_acs": 21506, - "total_submitted": 63657, + "total_acs": 21625, + "total_submitted": 63904, "frontend_question_id": 488, "is_new_question": false }, @@ -50247,8 +50822,8 @@ "question__title": "Max Consecutive Ones II", "question__title_slug": "max-consecutive-ones-ii", "question__hide": false, - "total_acs": 121310, - "total_submitted": 244195, + "total_acs": 121855, + "total_submitted": 245098, "frontend_question_id": 487, "is_new_question": false }, @@ -50270,8 +50845,8 @@ "question__title": "Predict the Winner", "question__title_slug": "predict-the-winner", "question__hide": false, - "total_acs": 138891, - "total_submitted": 270910, + "total_acs": 139484, + "total_submitted": 271970, "frontend_question_id": 486, "is_new_question": false }, @@ -50293,8 +50868,8 @@ "question__title": "Max Consecutive Ones", "question__title_slug": "max-consecutive-ones", "question__hide": false, - "total_acs": 857958, - "total_submitted": 1513852, + "total_acs": 864111, + "total_submitted": 1523503, "frontend_question_id": 485, "is_new_question": false }, @@ -50316,8 +50891,8 @@ "question__title": "Find Permutation", "question__title_slug": "find-permutation", "question__hide": false, - "total_acs": 36013, - "total_submitted": 53824, + "total_acs": 36070, + "total_submitted": 53910, "frontend_question_id": 484, "is_new_question": false }, @@ -50339,8 +50914,8 @@ "question__title": "Smallest Good Base", "question__title_slug": "smallest-good-base", "question__hide": false, - "total_acs": 19045, - "total_submitted": 49034, + "total_acs": 19102, + "total_submitted": 49164, "frontend_question_id": 483, "is_new_question": false }, @@ -50362,8 +50937,8 @@ "question__title": "License Key Formatting", "question__title_slug": "license-key-formatting", "question__hide": false, - "total_acs": 248849, - "total_submitted": 574398, + "total_acs": 249623, + "total_submitted": 576203, "frontend_question_id": 482, "is_new_question": false }, @@ -50385,8 +50960,8 @@ "question__title": "Magical String", "question__title_slug": "magical-string", "question__hide": false, - "total_acs": 31962, - "total_submitted": 62940, + "total_acs": 32057, + "total_submitted": 63112, "frontend_question_id": 481, "is_new_question": false }, @@ -50408,8 +50983,8 @@ "question__title": "Sliding Window Median", "question__title_slug": "sliding-window-median", "question__hide": false, - "total_acs": 126697, - "total_submitted": 309486, + "total_acs": 127036, + "total_submitted": 310905, "frontend_question_id": 480, "is_new_question": false }, @@ -50431,8 +51006,8 @@ "question__title": "Largest Palindrome Product", "question__title_slug": "largest-palindrome-product", "question__hide": false, - "total_acs": 22116, - "total_submitted": 68994, + "total_acs": 22167, + "total_submitted": 69084, "frontend_question_id": 479, "is_new_question": false }, @@ -50454,8 +51029,8 @@ "question__title": "Total Hamming Distance", "question__title_slug": "total-hamming-distance", "question__hide": false, - "total_acs": 97929, - "total_submitted": 187684, + "total_acs": 98210, + "total_submitted": 188201, "frontend_question_id": 477, "is_new_question": false }, @@ -50477,8 +51052,8 @@ "question__title": "Number Complement", "question__title_slug": "number-complement", "question__hide": false, - "total_acs": 296047, - "total_submitted": 439409, + "total_acs": 296884, + "total_submitted": 440582, "frontend_question_id": 476, "is_new_question": false }, @@ -50500,8 +51075,8 @@ "question__title": "Heaters", "question__title_slug": "heaters", "question__hide": false, - "total_acs": 101484, - "total_submitted": 277587, + "total_acs": 101754, + "total_submitted": 278121, "frontend_question_id": 475, "is_new_question": false }, @@ -50523,8 +51098,8 @@ "question__title": "Ones and Zeroes", "question__title_slug": "ones-and-zeroes", "question__hide": false, - "total_acs": 169548, - "total_submitted": 362172, + "total_acs": 170129, + "total_submitted": 363324, "frontend_question_id": 474, "is_new_question": false }, @@ -50546,8 +51121,8 @@ "question__title": "Matchsticks to Square", "question__title_slug": "matchsticks-to-square", "question__hide": false, - "total_acs": 140921, - "total_submitted": 350840, + "total_acs": 141344, + "total_submitted": 351969, "frontend_question_id": 473, "is_new_question": false }, @@ -50569,8 +51144,8 @@ "question__title": "Concatenated Words", "question__title_slug": "concatenated-words", "question__hide": false, - "total_acs": 207357, - "total_submitted": 415282, + "total_acs": 207665, + "total_submitted": 416009, "frontend_question_id": 472, "is_new_question": false }, @@ -50592,8 +51167,8 @@ "question__title": "Encode String with Shortest Length", "question__title_slug": "encode-string-with-shortest-length", "question__hide": false, - "total_acs": 29888, - "total_submitted": 59103, + "total_acs": 29916, + "total_submitted": 59162, "frontend_question_id": 471, "is_new_question": false }, @@ -50615,8 +51190,8 @@ "question__title": "Convex Polygon", "question__title_slug": "convex-polygon", "question__hide": false, - "total_acs": 10244, - "total_submitted": 26195, + "total_acs": 10269, + "total_submitted": 26233, "frontend_question_id": 469, "is_new_question": false }, @@ -50638,8 +51213,8 @@ "question__title": "Validate IP Address", "question__title_slug": "validate-ip-address", "question__hide": false, - "total_acs": 142633, - "total_submitted": 536114, + "total_acs": 142975, + "total_submitted": 537205, "frontend_question_id": 468, "is_new_question": false }, @@ -50661,8 +51236,8 @@ "question__title": "Unique Substrings in Wraparound String", "question__title_slug": "unique-substrings-in-wraparound-string", "question__hide": false, - "total_acs": 39753, - "total_submitted": 102831, + "total_acs": 39853, + "total_submitted": 103063, "frontend_question_id": 467, "is_new_question": false }, @@ -50684,8 +51259,8 @@ "question__title": "Count The Repetitions", "question__title_slug": "count-the-repetitions", "question__hide": false, - "total_acs": 15895, - "total_submitted": 53961, + "total_acs": 15967, + "total_submitted": 54168, "frontend_question_id": 466, "is_new_question": false }, @@ -50707,8 +51282,8 @@ "question__title": "Optimal Account Balancing", "question__title_slug": "optimal-account-balancing", "question__hide": false, - "total_acs": 78586, - "total_submitted": 159765, + "total_acs": 78696, + "total_submitted": 160011, "frontend_question_id": 465, "is_new_question": false }, @@ -50730,8 +51305,8 @@ "question__title": "Can I Win", "question__title_slug": "can-i-win", "question__hide": false, - "total_acs": 84459, - "total_submitted": 284795, + "total_acs": 84634, + "total_submitted": 285468, "frontend_question_id": 464, "is_new_question": false }, @@ -50753,8 +51328,8 @@ "question__title": "Island Perimeter", "question__title_slug": "island-perimeter", "question__hide": false, - "total_acs": 432668, - "total_submitted": 620783, + "total_acs": 434149, + "total_submitted": 622740, "frontend_question_id": 463, "is_new_question": false }, @@ -50776,8 +51351,8 @@ "question__title": "Minimum Moves to Equal Array Elements II", "question__title_slug": "minimum-moves-to-equal-array-elements-ii", "question__hide": false, - "total_acs": 161275, - "total_submitted": 268711, + "total_acs": 161688, + "total_submitted": 269429, "frontend_question_id": 462, "is_new_question": false }, @@ -50799,8 +51374,8 @@ "question__title": "Hamming Distance", "question__title_slug": "hamming-distance", "question__hide": false, - "total_acs": 523437, - "total_submitted": 697741, + "total_acs": 524688, + "total_submitted": 699350, "frontend_question_id": 461, "is_new_question": false }, @@ -50822,8 +51397,8 @@ "question__title": "LFU Cache", "question__title_slug": "lfu-cache", "question__hide": false, - "total_acs": 216305, - "total_submitted": 502062, + "total_acs": 217023, + "total_submitted": 503339, "frontend_question_id": 460, "is_new_question": false }, @@ -50845,8 +51420,8 @@ "question__title": "Repeated Substring Pattern", "question__title_slug": "repeated-substring-pattern", "question__hide": false, - "total_acs": 294644, - "total_submitted": 673870, + "total_acs": 296077, + "total_submitted": 677255, "frontend_question_id": 459, "is_new_question": false }, @@ -50868,8 +51443,8 @@ "question__title": "Poor Pigs", "question__title_slug": "poor-pigs", "question__hide": false, - "total_acs": 73986, - "total_submitted": 118184, + "total_acs": 74091, + "total_submitted": 118491, "frontend_question_id": 458, "is_new_question": false }, @@ -50891,8 +51466,8 @@ "question__title": "Circular Array Loop", "question__title_slug": "circular-array-loop", "question__hide": false, - "total_acs": 69637, - "total_submitted": 212860, + "total_acs": 69863, + "total_submitted": 213472, "frontend_question_id": 457, "is_new_question": false }, @@ -50914,8 +51489,8 @@ "question__title": "132 Pattern", "question__title_slug": "132-pattern", "question__hide": false, - "total_acs": 168772, - "total_submitted": 521142, + "total_acs": 169250, + "total_submitted": 522749, "frontend_question_id": 456, "is_new_question": false }, @@ -50937,8 +51512,8 @@ "question__title": "Assign Cookies", "question__title_slug": "assign-cookies", "question__hide": false, - "total_acs": 221392, - "total_submitted": 444010, + "total_acs": 223243, + "total_submitted": 447442, "frontend_question_id": 455, "is_new_question": false }, @@ -50960,8 +51535,8 @@ "question__title": "4Sum II", "question__title_slug": "4sum-ii", "question__hide": false, - "total_acs": 292669, - "total_submitted": 511755, + "total_acs": 293500, + "total_submitted": 513301, "frontend_question_id": 454, "is_new_question": false }, @@ -50983,8 +51558,8 @@ "question__title": "Minimum Moves to Equal Array Elements", "question__title_slug": "minimum-moves-to-equal-array-elements", "question__hide": false, - "total_acs": 151954, - "total_submitted": 271320, + "total_acs": 152369, + "total_submitted": 271969, "frontend_question_id": 453, "is_new_question": false }, @@ -51006,8 +51581,8 @@ "question__title": "Minimum Number of Arrows to Burst Balloons", "question__title_slug": "minimum-number-of-arrows-to-burst-balloons", "question__hide": false, - "total_acs": 300460, - "total_submitted": 543677, + "total_acs": 301435, + "total_submitted": 545376, "frontend_question_id": 452, "is_new_question": false }, @@ -51029,8 +51604,8 @@ "question__title": "Sort Characters By Frequency", "question__title_slug": "sort-characters-by-frequency", "question__hide": false, - "total_acs": 503383, - "total_submitted": 717942, + "total_acs": 505437, + "total_submitted": 720841, "frontend_question_id": 451, "is_new_question": false }, @@ -51052,8 +51627,8 @@ "question__title": "Delete Node in a BST", "question__title_slug": "delete-node-in-a-bst", "question__hide": false, - "total_acs": 356299, - "total_submitted": 707105, + "total_acs": 358347, + "total_submitted": 710982, "frontend_question_id": 450, "is_new_question": false }, @@ -51075,8 +51650,8 @@ "question__title": "Serialize and Deserialize BST", "question__title_slug": "serialize-and-deserialize-bst", "question__hide": false, - "total_acs": 217729, - "total_submitted": 381682, + "total_acs": 218124, + "total_submitted": 382256, "frontend_question_id": 449, "is_new_question": false }, @@ -51098,8 +51673,8 @@ "question__title": "Find All Numbers Disappeared in an Array", "question__title_slug": "find-all-numbers-disappeared-in-an-array", "question__hide": false, - "total_acs": 723519, - "total_submitted": 1205951, + "total_acs": 727578, + "total_submitted": 1212379, "frontend_question_id": 448, "is_new_question": false }, @@ -51121,8 +51696,8 @@ "question__title": "Number of Boomerangs", "question__title_slug": "number-of-boomerangs", "question__hide": false, - "total_acs": 93303, - "total_submitted": 169821, + "total_acs": 93424, + "total_submitted": 170026, "frontend_question_id": 447, "is_new_question": false }, @@ -51144,8 +51719,8 @@ "question__title": "Arithmetic Slices II - Subsequence", "question__title_slug": "arithmetic-slices-ii-subsequence", "question__hide": false, - "total_acs": 74062, - "total_submitted": 158936, + "total_acs": 74184, + "total_submitted": 159294, "frontend_question_id": 446, "is_new_question": false }, @@ -51167,8 +51742,8 @@ "question__title": "Add Two Numbers II", "question__title_slug": "add-two-numbers-ii", "question__hide": false, - "total_acs": 366146, - "total_submitted": 613684, + "total_acs": 367206, + "total_submitted": 615464, "frontend_question_id": 445, "is_new_question": false }, @@ -51190,8 +51765,8 @@ "question__title": "Sequence Reconstruction", "question__title_slug": "sequence-reconstruction", "question__hide": false, - "total_acs": 50090, - "total_submitted": 187060, + "total_acs": 50162, + "total_submitted": 187185, "frontend_question_id": 444, "is_new_question": false }, @@ -51213,8 +51788,8 @@ "question__title": "String Compression", "question__title_slug": "string-compression", "question__hide": false, - "total_acs": 376639, - "total_submitted": 719711, + "total_acs": 379233, + "total_submitted": 724131, "frontend_question_id": 443, "is_new_question": false }, @@ -51236,8 +51811,8 @@ "question__title": "Find All Duplicates in an Array", "question__title_slug": "find-all-duplicates-in-an-array", "question__hide": false, - "total_acs": 513737, - "total_submitted": 699104, + "total_acs": 516193, + "total_submitted": 702361, "frontend_question_id": 442, "is_new_question": false }, @@ -51259,8 +51834,8 @@ "question__title": "Arranging Coins", "question__title_slug": "arranging-coins", "question__hide": false, - "total_acs": 355936, - "total_submitted": 769148, + "total_acs": 357638, + "total_submitted": 772853, "frontend_question_id": 441, "is_new_question": false }, @@ -51282,8 +51857,8 @@ "question__title": "K-th Smallest in Lexicographical Order", "question__title_slug": "k-th-smallest-in-lexicographical-order", "question__hide": false, - "total_acs": 19970, - "total_submitted": 64076, + "total_acs": 20085, + "total_submitted": 64382, "frontend_question_id": 440, "is_new_question": false }, @@ -51305,8 +51880,8 @@ "question__title": "Ternary Expression Parser", "question__title_slug": "ternary-expression-parser", "question__hide": false, - "total_acs": 26524, - "total_submitted": 45386, + "total_acs": 26600, + "total_submitted": 45497, "frontend_question_id": 439, "is_new_question": false }, @@ -51328,8 +51903,8 @@ "question__title": "Find All Anagrams in a String", "question__title_slug": "find-all-anagrams-in-a-string", "question__hide": false, - "total_acs": 758886, - "total_submitted": 1511485, + "total_acs": 762053, + "total_submitted": 1517384, "frontend_question_id": 438, "is_new_question": false }, @@ -51351,8 +51926,8 @@ "question__title": "Path Sum III", "question__title_slug": "path-sum-iii", "question__hide": false, - "total_acs": 451326, - "total_submitted": 942686, + "total_acs": 452985, + "total_submitted": 946942, "frontend_question_id": 437, "is_new_question": false }, @@ -51374,8 +51949,8 @@ "question__title": "Find Right Interval", "question__title_slug": "find-right-interval", "question__hide": false, - "total_acs": 93598, - "total_submitted": 183769, + "total_acs": 93997, + "total_submitted": 184376, "frontend_question_id": 436, "is_new_question": false }, @@ -51397,8 +51972,8 @@ "question__title": "Non-overlapping Intervals", "question__title_slug": "non-overlapping-intervals", "question__hide": false, - "total_acs": 359335, - "total_submitted": 713641, + "total_acs": 361536, + "total_submitted": 717766, "frontend_question_id": 435, "is_new_question": false }, @@ -51420,8 +51995,8 @@ "question__title": "Number of Segments in a String", "question__title_slug": "number-of-segments-in-a-string", "question__hide": false, - "total_acs": 144463, - "total_submitted": 389748, + "total_acs": 145374, + "total_submitted": 393413, "frontend_question_id": 434, "is_new_question": false }, @@ -51443,8 +52018,8 @@ "question__title": "Minimum Genetic Mutation", "question__title_slug": "minimum-genetic-mutation", "question__hide": false, - "total_acs": 116902, - "total_submitted": 222998, + "total_acs": 117455, + "total_submitted": 223965, "frontend_question_id": 433, "is_new_question": false }, @@ -51466,8 +52041,8 @@ "question__title": "All O`one Data Structure", "question__title_slug": "all-oone-data-structure", "question__hide": false, - "total_acs": 68729, - "total_submitted": 187916, + "total_acs": 68947, + "total_submitted": 188536, "frontend_question_id": 432, "is_new_question": false }, @@ -51489,8 +52064,8 @@ "question__title": "Word Squares", "question__title_slug": "word-squares", "question__hide": false, - "total_acs": 69705, - "total_submitted": 131956, + "total_acs": 69833, + "total_submitted": 132126, "frontend_question_id": 425, "is_new_question": false }, @@ -51512,8 +52087,8 @@ "question__title": "Longest Repeating Character Replacement", "question__title_slug": "longest-repeating-character-replacement", "question__hide": false, - "total_acs": 444595, - "total_submitted": 854003, + "total_acs": 449952, + "total_submitted": 863974, "frontend_question_id": 424, "is_new_question": false }, @@ -51535,8 +52110,8 @@ "question__title": "Reconstruct Original Digits from English", "question__title_slug": "reconstruct-original-digits-from-english", "question__hide": false, - "total_acs": 72217, - "total_submitted": 140903, + "total_acs": 72358, + "total_submitted": 141196, "frontend_question_id": 423, "is_new_question": false }, @@ -51558,8 +52133,8 @@ "question__title": "Valid Word Square", "question__title_slug": "valid-word-square", "question__hide": false, - "total_acs": 49833, - "total_submitted": 124463, + "total_acs": 49976, + "total_submitted": 124783, "frontend_question_id": 422, "is_new_question": false }, @@ -51581,8 +52156,8 @@ "question__title": "Maximum XOR of Two Numbers in an Array", "question__title_slug": "maximum-xor-of-two-numbers-in-an-array", "question__hide": false, - "total_acs": 140238, - "total_submitted": 260140, + "total_acs": 140521, + "total_submitted": 260823, "frontend_question_id": 421, "is_new_question": false }, @@ -51604,8 +52179,8 @@ "question__title": "Strong Password Checker", "question__title_slug": "strong-password-checker", "question__hide": false, - "total_acs": 32539, - "total_submitted": 236493, + "total_acs": 32773, + "total_submitted": 238940, "frontend_question_id": 420, "is_new_question": false }, @@ -51627,8 +52202,8 @@ "question__title": "Battleships in a Board", "question__title_slug": "battleships-in-a-board", "question__hide": false, - "total_acs": 181252, - "total_submitted": 242081, + "total_acs": 181834, + "total_submitted": 242829, "frontend_question_id": 419, "is_new_question": false }, @@ -51650,8 +52225,8 @@ "question__title": "Sentence Screen Fitting", "question__title_slug": "sentence-screen-fitting", "question__hide": false, - "total_acs": 92969, - "total_submitted": 260909, + "total_acs": 93085, + "total_submitted": 261283, "frontend_question_id": 418, "is_new_question": false }, @@ -51673,8 +52248,8 @@ "question__title": "Pacific Atlantic Water Flow", "question__title_slug": "pacific-atlantic-water-flow", "question__hide": false, - "total_acs": 356636, - "total_submitted": 654469, + "total_acs": 358956, + "total_submitted": 658468, "frontend_question_id": 417, "is_new_question": false }, @@ -51696,8 +52271,8 @@ "question__title": "Partition Equal Subset Sum", "question__title_slug": "partition-equal-subset-sum", "question__hide": false, - "total_acs": 619485, - "total_submitted": 1339410, + "total_acs": 623086, + "total_submitted": 1347326, "frontend_question_id": 416, "is_new_question": false }, @@ -51719,8 +52294,8 @@ "question__title": "Add Strings", "question__title_slug": "add-strings", "question__hide": false, - "total_acs": 566730, - "total_submitted": 1079676, + "total_acs": 568672, + "total_submitted": 1084434, "frontend_question_id": 415, "is_new_question": false }, @@ -51742,8 +52317,8 @@ "question__title": "Third Maximum Number", "question__title_slug": "third-maximum-number", "question__hide": false, - "total_acs": 427588, - "total_submitted": 1284691, + "total_acs": 430101, + "total_submitted": 1290748, "frontend_question_id": 414, "is_new_question": false }, @@ -51765,8 +52340,8 @@ "question__title": "Arithmetic Slices", "question__title_slug": "arithmetic-slices", "question__hide": false, - "total_acs": 274765, - "total_submitted": 422142, + "total_acs": 275552, + "total_submitted": 423453, "frontend_question_id": 413, "is_new_question": false }, @@ -51788,8 +52363,8 @@ "question__title": "Fizz Buzz", "question__title_slug": "fizz-buzz", "question__hide": false, - "total_acs": 953948, - "total_submitted": 1360471, + "total_acs": 963722, + "total_submitted": 1373365, "frontend_question_id": 412, "is_new_question": false }, @@ -51811,8 +52386,8 @@ "question__title": "Minimum Unique Word Abbreviation", "question__title_slug": "minimum-unique-word-abbreviation", "question__hide": false, - "total_acs": 14268, - "total_submitted": 36153, + "total_acs": 14278, + "total_submitted": 36170, "frontend_question_id": 411, "is_new_question": false }, @@ -51834,8 +52409,8 @@ "question__title": "Split Array Largest Sum", "question__title_slug": "split-array-largest-sum", "question__hide": false, - "total_acs": 262125, - "total_submitted": 489518, + "total_acs": 263279, + "total_submitted": 491515, "frontend_question_id": 410, "is_new_question": false }, @@ -51857,8 +52432,8 @@ "question__title": "Longest Palindrome", "question__title_slug": "longest-palindrome", "question__hide": false, - "total_acs": 512031, - "total_submitted": 945594, + "total_acs": 516695, + "total_submitted": 954333, "frontend_question_id": 409, "is_new_question": false }, @@ -51880,8 +52455,8 @@ "question__title": "Valid Word Abbreviation", "question__title_slug": "valid-word-abbreviation", "question__hide": false, - "total_acs": 118314, - "total_submitted": 339733, + "total_acs": 118421, + "total_submitted": 340061, "frontend_question_id": 408, "is_new_question": false }, @@ -51903,8 +52478,8 @@ "question__title": "Trapping Rain Water II", "question__title_slug": "trapping-rain-water-ii", "question__hide": false, - "total_acs": 78943, - "total_submitted": 165841, + "total_acs": 79118, + "total_submitted": 166311, "frontend_question_id": 407, "is_new_question": false }, @@ -51926,8 +52501,8 @@ "question__title": "Queue Reconstruction by Height", "question__title_slug": "queue-reconstruction-by-height", "question__hide": false, - "total_acs": 281926, - "total_submitted": 386345, + "total_acs": 282335, + "total_submitted": 386885, "frontend_question_id": 406, "is_new_question": false }, @@ -51949,8 +52524,8 @@ "question__title": "Convert a Number to Hexadecimal", "question__title_slug": "convert-a-number-to-hexadecimal", "question__hide": false, - "total_acs": 120180, - "total_submitted": 256639, + "total_acs": 120699, + "total_submitted": 257609, "frontend_question_id": 405, "is_new_question": false }, @@ -51972,8 +52547,8 @@ "question__title": "Sum of Left Leaves", "question__title_slug": "sum-of-left-leaves", "question__hide": false, - "total_acs": 434611, - "total_submitted": 765035, + "total_acs": 436510, + "total_submitted": 768004, "frontend_question_id": 404, "is_new_question": false }, @@ -51995,8 +52570,8 @@ "question__title": "Frog Jump", "question__title_slug": "frog-jump", "question__hide": false, - "total_acs": 179626, - "total_submitted": 416758, + "total_acs": 180439, + "total_submitted": 418503, "frontend_question_id": 403, "is_new_question": false }, @@ -52018,8 +52593,8 @@ "question__title": "Remove K Digits", "question__title_slug": "remove-k-digits", "question__hide": false, - "total_acs": 308285, - "total_submitted": 1007929, + "total_acs": 309322, + "total_submitted": 1011143, "frontend_question_id": 402, "is_new_question": false }, @@ -52041,8 +52616,8 @@ "question__title": "Binary Watch", "question__title_slug": "binary-watch", "question__hide": false, - "total_acs": 124874, - "total_submitted": 238278, + "total_acs": 125823, + "total_submitted": 239495, "frontend_question_id": 401, "is_new_question": false }, @@ -52064,8 +52639,8 @@ "question__title": "Nth Digit", "question__title_slug": "nth-digit", "question__hide": false, - "total_acs": 85017, - "total_submitted": 248864, + "total_acs": 85235, + "total_submitted": 249422, "frontend_question_id": 400, "is_new_question": false }, @@ -52087,8 +52662,8 @@ "question__title": "Evaluate Division", "question__title_slug": "evaluate-division", "question__hide": false, - "total_acs": 333243, - "total_submitted": 558318, + "total_acs": 334297, + "total_submitted": 559915, "frontend_question_id": 399, "is_new_question": false }, @@ -52110,8 +52685,8 @@ "question__title": "Random Pick Index", "question__title_slug": "random-pick-index", "question__hide": false, - "total_acs": 189050, - "total_submitted": 302407, + "total_acs": 189377, + "total_submitted": 302957, "frontend_question_id": 398, "is_new_question": false }, @@ -52133,8 +52708,8 @@ "question__title": "Integer Replacement", "question__title_slug": "integer-replacement", "question__hide": false, - "total_acs": 98831, - "total_submitted": 280619, + "total_acs": 99202, + "total_submitted": 281660, "frontend_question_id": 397, "is_new_question": false }, @@ -52156,8 +52731,8 @@ "question__title": "Rotate Function", "question__title_slug": "rotate-function", "question__hide": false, - "total_acs": 73815, - "total_submitted": 179034, + "total_acs": 74098, + "total_submitted": 179614, "frontend_question_id": 396, "is_new_question": false }, @@ -52179,8 +52754,8 @@ "question__title": "Longest Substring with At Least K Repeating Characters", "question__title_slug": "longest-substring-with-at-least-k-repeating-characters", "question__hide": false, - "total_acs": 188857, - "total_submitted": 421978, + "total_acs": 189655, + "total_submitted": 423857, "frontend_question_id": 395, "is_new_question": false }, @@ -52202,8 +52777,8 @@ "question__title": "Decode String", "question__title_slug": "decode-string", "question__hide": false, - "total_acs": 637797, - "total_submitted": 1100235, + "total_acs": 640933, + "total_submitted": 1105151, "frontend_question_id": 394, "is_new_question": false }, @@ -52225,8 +52800,8 @@ "question__title": "UTF-8 Validation", "question__title_slug": "utf-8-validation", "question__hide": false, - "total_acs": 116829, - "total_submitted": 259194, + "total_acs": 116944, + "total_submitted": 259454, "frontend_question_id": 393, "is_new_question": false }, @@ -52248,8 +52823,8 @@ "question__title": "Is Subsequence", "question__title_slug": "is-subsequence", "question__hide": false, - "total_acs": 835463, - "total_submitted": 1760626, + "total_acs": 845834, + "total_submitted": 1783247, "frontend_question_id": 392, "is_new_question": false }, @@ -52271,8 +52846,8 @@ "question__title": "Perfect Rectangle", "question__title_slug": "perfect-rectangle", "question__hide": false, - "total_acs": 39274, - "total_submitted": 119460, + "total_acs": 39391, + "total_submitted": 119747, "frontend_question_id": 391, "is_new_question": false }, @@ -52294,8 +52869,8 @@ "question__title": "Elimination Game", "question__title_slug": "elimination-game", "question__hide": false, - "total_acs": 57968, - "total_submitted": 125936, + "total_acs": 58189, + "total_submitted": 126599, "frontend_question_id": 390, "is_new_question": false }, @@ -52317,8 +52892,8 @@ "question__title": "Find the Difference", "question__title_slug": "find-the-difference", "question__hide": false, - "total_acs": 496251, - "total_submitted": 829114, + "total_acs": 499436, + "total_submitted": 835461, "frontend_question_id": 389, "is_new_question": false }, @@ -52340,8 +52915,8 @@ "question__title": "Longest Absolute File Path", "question__title_slug": "longest-absolute-file-path", "question__hide": false, - "total_acs": 142043, - "total_submitted": 304378, + "total_acs": 142278, + "total_submitted": 304805, "frontend_question_id": 388, "is_new_question": false }, @@ -52363,8 +52938,8 @@ "question__title": "First Unique Character in a String", "question__title_slug": "first-unique-character-in-a-string", "question__hide": false, - "total_acs": 1390337, - "total_submitted": 2328842, + "total_acs": 1395969, + "total_submitted": 2336771, "frontend_question_id": 387, "is_new_question": false }, @@ -52386,8 +52961,8 @@ "question__title": "Lexicographical Numbers", "question__title_slug": "lexicographical-numbers", "question__hide": false, - "total_acs": 101576, - "total_submitted": 164560, + "total_acs": 101973, + "total_submitted": 165102, "frontend_question_id": 386, "is_new_question": false }, @@ -52409,8 +52984,8 @@ "question__title": "Mini Parser", "question__title_slug": "mini-parser", "question__hide": false, - "total_acs": 52320, - "total_submitted": 141450, + "total_acs": 52427, + "total_submitted": 141626, "frontend_question_id": 385, "is_new_question": false }, @@ -52432,8 +53007,8 @@ "question__title": "Shuffle an Array", "question__title_slug": "shuffle-an-array", "question__hide": false, - "total_acs": 304837, - "total_submitted": 526810, + "total_acs": 305864, + "total_submitted": 528453, "frontend_question_id": 384, "is_new_question": false }, @@ -52455,8 +53030,8 @@ "question__title": "Ransom Note", "question__title_slug": "ransom-note", "question__hide": false, - "total_acs": 749903, - "total_submitted": 1284255, + "total_acs": 757811, + "total_submitted": 1296777, "frontend_question_id": 383, "is_new_question": false }, @@ -52478,8 +53053,8 @@ "question__title": "Linked List Random Node", "question__title_slug": "linked-list-random-node", "question__hide": false, - "total_acs": 224316, - "total_submitted": 357268, + "total_acs": 224712, + "total_submitted": 357853, "frontend_question_id": 382, "is_new_question": false }, @@ -52501,8 +53076,8 @@ "question__title": "Insert Delete GetRandom O(1) - Duplicates allowed", "question__title_slug": "insert-delete-getrandom-o1-duplicates-allowed", "question__hide": false, - "total_acs": 126408, - "total_submitted": 355919, + "total_acs": 126649, + "total_submitted": 356697, "frontend_question_id": 381, "is_new_question": false }, @@ -52524,8 +53099,8 @@ "question__title": "Insert Delete GetRandom O(1)", "question__title_slug": "insert-delete-getrandom-o1", "question__hide": false, - "total_acs": 620207, - "total_submitted": 1174640, + "total_acs": 622706, + "total_submitted": 1179359, "frontend_question_id": 380, "is_new_question": false }, @@ -52547,8 +53122,8 @@ "question__title": "Design Phone Directory", "question__title_slug": "design-phone-directory", "question__hide": false, - "total_acs": 61672, - "total_submitted": 120429, + "total_acs": 61788, + "total_submitted": 120637, "frontend_question_id": 379, "is_new_question": false }, @@ -52570,8 +53145,8 @@ "question__title": "Kth Smallest Element in a Sorted Matrix", "question__title_slug": "kth-smallest-element-in-a-sorted-matrix", "question__hide": false, - "total_acs": 534288, - "total_submitted": 864876, + "total_acs": 536075, + "total_submitted": 867608, "frontend_question_id": 378, "is_new_question": false }, @@ -52593,8 +53168,8 @@ "question__title": "Combination Sum IV", "question__title_slug": "combination-sum-iv", "question__hide": false, - "total_acs": 356915, - "total_submitted": 683738, + "total_acs": 358131, + "total_submitted": 686014, "frontend_question_id": 377, "is_new_question": false }, @@ -52616,8 +53191,8 @@ "question__title": "Wiggle Subsequence", "question__title_slug": "wiggle-subsequence", "question__hide": false, - "total_acs": 220049, - "total_submitted": 455008, + "total_acs": 220651, + "total_submitted": 456154, "frontend_question_id": 376, "is_new_question": false }, @@ -52639,8 +53214,8 @@ "question__title": "Guess Number Higher or Lower II", "question__title_slug": "guess-number-higher-or-lower-ii", "question__hide": false, - "total_acs": 105464, - "total_submitted": 224552, + "total_acs": 105751, + "total_submitted": 224983, "frontend_question_id": 375, "is_new_question": false }, @@ -52662,8 +53237,8 @@ "question__title": "Guess Number Higher or Lower", "question__title_slug": "guess-number-higher-or-lower", "question__hide": false, - "total_acs": 490718, - "total_submitted": 944855, + "total_acs": 493592, + "total_submitted": 949728, "frontend_question_id": 374, "is_new_question": false }, @@ -52685,8 +53260,8 @@ "question__title": "Find K Pairs with Smallest Sums", "question__title_slug": "find-k-pairs-with-smallest-sums", "question__hide": false, - "total_acs": 197622, - "total_submitted": 516627, + "total_acs": 198400, + "total_submitted": 518490, "frontend_question_id": 373, "is_new_question": false }, @@ -52708,8 +53283,8 @@ "question__title": "Super Pow", "question__title_slug": "super-pow", "question__hide": false, - "total_acs": 59126, - "total_submitted": 163417, + "total_acs": 59390, + "total_submitted": 164360, "frontend_question_id": 372, "is_new_question": false }, @@ -52731,8 +53306,8 @@ "question__title": "Sum of Two Integers", "question__title_slug": "sum-of-two-integers", "question__hide": false, - "total_acs": 381851, - "total_submitted": 752600, + "total_acs": 383786, + "total_submitted": 756391, "frontend_question_id": 371, "is_new_question": false }, @@ -52754,8 +53329,8 @@ "question__title": "Range Addition", "question__title_slug": "range-addition", "question__hide": false, - "total_acs": 86896, - "total_submitted": 122145, + "total_acs": 87104, + "total_submitted": 122394, "frontend_question_id": 370, "is_new_question": false }, @@ -52777,8 +53352,8 @@ "question__title": "Plus One Linked List", "question__title_slug": "plus-one-linked-list", "question__hide": false, - "total_acs": 74645, - "total_submitted": 122377, + "total_acs": 74787, + "total_submitted": 122602, "frontend_question_id": 369, "is_new_question": false }, @@ -52800,8 +53375,8 @@ "question__title": "Largest Divisible Subset", "question__title_slug": "largest-divisible-subset", "question__hide": false, - "total_acs": 178647, - "total_submitted": 429570, + "total_acs": 179197, + "total_submitted": 430776, "frontend_question_id": 368, "is_new_question": false }, @@ -52823,8 +53398,8 @@ "question__title": "Valid Perfect Square", "question__title_slug": "valid-perfect-square", "question__hide": false, - "total_acs": 482691, - "total_submitted": 1113245, + "total_acs": 485464, + "total_submitted": 1119661, "frontend_question_id": 367, "is_new_question": false }, @@ -52846,8 +53421,8 @@ "question__title": "Find Leaves of Binary Tree", "question__title_slug": "find-leaves-of-binary-tree", "question__hide": false, - "total_acs": 236777, - "total_submitted": 294807, + "total_acs": 237226, + "total_submitted": 295325, "frontend_question_id": 366, "is_new_question": false }, @@ -52869,8 +53444,8 @@ "question__title": "Water and Jug Problem", "question__title_slug": "water-and-jug-problem", "question__hide": false, - "total_acs": 80973, - "total_submitted": 213841, + "total_acs": 81435, + "total_submitted": 214619, "frontend_question_id": 365, "is_new_question": false }, @@ -52892,8 +53467,8 @@ "question__title": "Nested List Weight Sum II", "question__title_slug": "nested-list-weight-sum-ii", "question__hide": false, - "total_acs": 129315, - "total_submitted": 194340, + "total_acs": 129421, + "total_submitted": 194590, "frontend_question_id": 364, "is_new_question": false }, @@ -52915,8 +53490,8 @@ "question__title": "Max Sum of Rectangle No Larger Than K", "question__title_slug": "max-sum-of-rectangle-no-larger-than-k", "question__hide": false, - "total_acs": 118703, - "total_submitted": 269927, + "total_acs": 118822, + "total_submitted": 270225, "frontend_question_id": 363, "is_new_question": false }, @@ -52938,8 +53513,8 @@ "question__title": "Design Hit Counter", "question__title_slug": "design-hit-counter", "question__hide": false, - "total_acs": 205980, - "total_submitted": 301306, + "total_acs": 206917, + "total_submitted": 302640, "frontend_question_id": 362, "is_new_question": false }, @@ -52961,8 +53536,8 @@ "question__title": "Bomb Enemy", "question__title_slug": "bomb-enemy", "question__hide": false, - "total_acs": 74358, - "total_submitted": 144756, + "total_acs": 74489, + "total_submitted": 144962, "frontend_question_id": 361, "is_new_question": false }, @@ -52984,8 +53559,8 @@ "question__title": "Sort Transformed Array", "question__title_slug": "sort-transformed-array", "question__hide": false, - "total_acs": 62042, - "total_submitted": 112614, + "total_acs": 62114, + "total_submitted": 112701, "frontend_question_id": 360, "is_new_question": false }, @@ -53003,12 +53578,12 @@ "question_id": 359, "question__article__live": true, "question__article__slug": "logger-rate-limiter", - "question__article__has_video_solution": false, + "question__article__has_video_solution": true, "question__title": "Logger Rate Limiter", "question__title_slug": "logger-rate-limiter", "question__hide": false, - "total_acs": 276208, - "total_submitted": 365312, + "total_acs": 277068, + "total_submitted": 366433, "frontend_question_id": 359, "is_new_question": false }, @@ -53030,8 +53605,8 @@ "question__title": "Rearrange String k Distance Apart", "question__title_slug": "rearrange-string-k-distance-apart", "question__hide": false, - "total_acs": 57690, - "total_submitted": 152652, + "total_acs": 57768, + "total_submitted": 152804, "frontend_question_id": 358, "is_new_question": false }, @@ -53053,8 +53628,8 @@ "question__title": "Count Numbers with Unique Digits", "question__title_slug": "count-numbers-with-unique-digits", "question__hide": false, - "total_acs": 117786, - "total_submitted": 226856, + "total_acs": 118098, + "total_submitted": 227400, "frontend_question_id": 357, "is_new_question": false }, @@ -53076,8 +53651,8 @@ "question__title": "Line Reflection", "question__title_slug": "line-reflection", "question__hide": false, - "total_acs": 34999, - "total_submitted": 100454, + "total_acs": 35121, + "total_submitted": 100790, "frontend_question_id": 356, "is_new_question": false }, @@ -53099,8 +53674,8 @@ "question__title": "Design Twitter", "question__title_slug": "design-twitter", "question__hide": false, - "total_acs": 121293, - "total_submitted": 324814, + "total_acs": 122535, + "total_submitted": 327430, "frontend_question_id": 355, "is_new_question": false }, @@ -53122,8 +53697,8 @@ "question__title": "Russian Doll Envelopes", "question__title_slug": "russian-doll-envelopes", "question__hide": false, - "total_acs": 187723, - "total_submitted": 495561, + "total_acs": 188349, + "total_submitted": 497269, "frontend_question_id": 354, "is_new_question": false }, @@ -53145,8 +53720,8 @@ "question__title": "Design Snake Game", "question__title_slug": "design-snake-game", "question__hide": false, - "total_acs": 73498, - "total_submitted": 187658, + "total_acs": 73828, + "total_submitted": 188562, "frontend_question_id": 353, "is_new_question": false }, @@ -53168,8 +53743,8 @@ "question__title": "Data Stream as Disjoint Intervals", "question__title_slug": "data-stream-as-disjoint-intervals", "question__hide": false, - "total_acs": 98564, - "total_submitted": 165044, + "total_acs": 98723, + "total_submitted": 165286, "frontend_question_id": 352, "is_new_question": false }, @@ -53191,8 +53766,8 @@ "question__title": "Android Unlock Patterns", "question__title_slug": "android-unlock-patterns", "question__hide": false, - "total_acs": 69200, - "total_submitted": 134209, + "total_acs": 69315, + "total_submitted": 134411, "frontend_question_id": 351, "is_new_question": false }, @@ -53214,8 +53789,8 @@ "question__title": "Intersection of Two Arrays II", "question__title_slug": "intersection-of-two-arrays-ii", "question__hide": false, - "total_acs": 1054674, - "total_submitted": 1881900, + "total_acs": 1060394, + "total_submitted": 1891511, "frontend_question_id": 350, "is_new_question": false }, @@ -53237,8 +53812,8 @@ "question__title": "Intersection of Two Arrays", "question__title_slug": "intersection-of-two-arrays", "question__hide": false, - "total_acs": 846079, - "total_submitted": 1190957, + "total_acs": 851080, + "total_submitted": 1197252, "frontend_question_id": 349, "is_new_question": false }, @@ -53260,8 +53835,8 @@ "question__title": "Design Tic-Tac-Toe", "question__title_slug": "design-tic-tac-toe", "question__hide": false, - "total_acs": 210257, - "total_submitted": 365335, + "total_acs": 210656, + "total_submitted": 366016, "frontend_question_id": 348, "is_new_question": false }, @@ -53283,8 +53858,8 @@ "question__title": "Top K Frequent Elements", "question__title_slug": "top-k-frequent-elements", "question__hide": false, - "total_acs": 1386882, - "total_submitted": 2163654, + "total_acs": 1402087, + "total_submitted": 2190949, "frontend_question_id": 347, "is_new_question": false }, @@ -53306,8 +53881,8 @@ "question__title": "Moving Average from Data Stream", "question__title_slug": "moving-average-from-data-stream", "question__hide": false, - "total_acs": 308557, - "total_submitted": 400061, + "total_acs": 309380, + "total_submitted": 401088, "frontend_question_id": 346, "is_new_question": false }, @@ -53329,8 +53904,8 @@ "question__title": "Reverse Vowels of a String", "question__title_slug": "reverse-vowels-of-a-string", "question__hide": false, - "total_acs": 497930, - "total_submitted": 991806, + "total_acs": 502978, + "total_submitted": 1000844, "frontend_question_id": 345, "is_new_question": false }, @@ -53352,8 +53927,8 @@ "question__title": "Reverse String", "question__title_slug": "reverse-string", "question__hide": false, - "total_acs": 2076885, - "total_submitted": 2703396, + "total_acs": 2088251, + "total_submitted": 2717278, "frontend_question_id": 344, "is_new_question": false }, @@ -53375,8 +53950,8 @@ "question__title": "Integer Break", "question__title_slug": "integer-break", "question__hide": false, - "total_acs": 230865, - "total_submitted": 410874, + "total_acs": 231749, + "total_submitted": 412298, "frontend_question_id": 343, "is_new_question": false }, @@ -53398,8 +53973,8 @@ "question__title": "Power of Four", "question__title_slug": "power-of-four", "question__hide": false, - "total_acs": 457326, - "total_submitted": 989289, + "total_acs": 459777, + "total_submitted": 994344, "frontend_question_id": 342, "is_new_question": false }, @@ -53421,8 +53996,8 @@ "question__title": "Flatten Nested List Iterator", "question__title_slug": "flatten-nested-list-iterator", "question__hide": false, - "total_acs": 362775, - "total_submitted": 586245, + "total_acs": 363621, + "total_submitted": 587460, "frontend_question_id": 341, "is_new_question": false }, @@ -53444,8 +54019,8 @@ "question__title": "Longest Substring with At Most K Distinct Characters", "question__title_slug": "longest-substring-with-at-most-k-distinct-characters", "question__hide": false, - "total_acs": 310460, - "total_submitted": 646527, + "total_acs": 311159, + "total_submitted": 647821, "frontend_question_id": 340, "is_new_question": false }, @@ -53467,8 +54042,8 @@ "question__title": "Nested List Weight Sum", "question__title_slug": "nested-list-weight-sum", "question__hide": false, - "total_acs": 223811, - "total_submitted": 271963, + "total_acs": 224001, + "total_submitted": 272208, "frontend_question_id": 339, "is_new_question": false }, @@ -53490,8 +54065,8 @@ "question__title": "Counting Bits", "question__title_slug": "counting-bits", "question__hide": false, - "total_acs": 763724, - "total_submitted": 1007148, + "total_acs": 768313, + "total_submitted": 1012996, "frontend_question_id": 338, "is_new_question": false }, @@ -53513,8 +54088,8 @@ "question__title": "House Robber III", "question__title_slug": "house-robber-iii", "question__hide": false, - "total_acs": 334313, - "total_submitted": 619935, + "total_acs": 335266, + "total_submitted": 621595, "frontend_question_id": 337, "is_new_question": false }, @@ -53536,8 +54111,8 @@ "question__title": "Palindrome Pairs", "question__title_slug": "palindrome-pairs", "question__hide": false, - "total_acs": 192440, - "total_submitted": 550037, + "total_acs": 192723, + "total_submitted": 550906, "frontend_question_id": 336, "is_new_question": false }, @@ -53559,8 +54134,8 @@ "question__title": "Self Crossing", "question__title_slug": "self-crossing", "question__hide": false, - "total_acs": 30379, - "total_submitted": 102975, + "total_acs": 30427, + "total_submitted": 103129, "frontend_question_id": 335, "is_new_question": false }, @@ -53582,8 +54157,8 @@ "question__title": "Increasing Triplet Subsequence", "question__title_slug": "increasing-triplet-subsequence", "question__hide": false, - "total_acs": 384984, - "total_submitted": 902014, + "total_acs": 387673, + "total_submitted": 909107, "frontend_question_id": 334, "is_new_question": false }, @@ -53605,8 +54180,8 @@ "question__title": "Largest BST Subtree", "question__title_slug": "largest-bst-subtree", "question__hide": false, - "total_acs": 96354, - "total_submitted": 224856, + "total_acs": 96548, + "total_submitted": 225222, "frontend_question_id": 333, "is_new_question": false }, @@ -53628,8 +54203,8 @@ "question__title": "Reconstruct Itinerary", "question__title_slug": "reconstruct-itinerary", "question__hide": false, - "total_acs": 327975, - "total_submitted": 794615, + "total_acs": 328872, + "total_submitted": 796527, "frontend_question_id": 332, "is_new_question": false }, @@ -53651,8 +54226,8 @@ "question__title": "Verify Preorder Serialization of a Binary Tree", "question__title_slug": "verify-preorder-serialization-of-a-binary-tree", "question__hide": false, - "total_acs": 128875, - "total_submitted": 288949, + "total_acs": 129138, + "total_submitted": 289423, "frontend_question_id": 331, "is_new_question": false }, @@ -53674,8 +54249,8 @@ "question__title": "Patching Array", "question__title_slug": "patching-array", "question__hide": false, - "total_acs": 61803, - "total_submitted": 153043, + "total_acs": 61934, + "total_submitted": 153280, "frontend_question_id": 330, "is_new_question": false }, @@ -53697,8 +54272,8 @@ "question__title": "Longest Increasing Path in a Matrix", "question__title_slug": "longest-increasing-path-in-a-matrix", "question__hide": false, - "total_acs": 442691, - "total_submitted": 843281, + "total_acs": 444178, + "total_submitted": 845963, "frontend_question_id": 329, "is_new_question": false }, @@ -53720,8 +54295,8 @@ "question__title": "Odd Even Linked List", "question__title_slug": "odd-even-linked-list", "question__hide": false, - "total_acs": 719093, - "total_submitted": 1173633, + "total_acs": 722642, + "total_submitted": 1179163, "frontend_question_id": 328, "is_new_question": false }, @@ -53743,8 +54318,8 @@ "question__title": "Count of Range Sum", "question__title_slug": "count-of-range-sum", "question__hide": false, - "total_acs": 68587, - "total_submitted": 191718, + "total_acs": 68750, + "total_submitted": 192194, "frontend_question_id": 327, "is_new_question": false }, @@ -53766,8 +54341,8 @@ "question__title": "Power of Three", "question__title_slug": "power-of-three", "question__hide": false, - "total_acs": 680615, - "total_submitted": 1493700, + "total_acs": 684133, + "total_submitted": 1501012, "frontend_question_id": 326, "is_new_question": false }, @@ -53789,8 +54364,8 @@ "question__title": "Maximum Size Subarray Sum Equals k", "question__title_slug": "maximum-size-subarray-sum-equals-k", "question__hide": false, - "total_acs": 172297, - "total_submitted": 349893, + "total_acs": 172519, + "total_submitted": 350345, "frontend_question_id": 325, "is_new_question": false }, @@ -53812,8 +54387,8 @@ "question__title": "Wiggle Sort II", "question__title_slug": "wiggle-sort-ii", "question__hide": false, - "total_acs": 141728, - "total_submitted": 424600, + "total_acs": 142327, + "total_submitted": 425830, "frontend_question_id": 324, "is_new_question": false }, @@ -53835,8 +54410,8 @@ "question__title": "Number of Connected Components in an Undirected Graph", "question__title_slug": "number-of-connected-components-in-an-undirected-graph", "question__hide": false, - "total_acs": 333502, - "total_submitted": 535205, + "total_acs": 334876, + "total_submitted": 537342, "frontend_question_id": 323, "is_new_question": false }, @@ -53858,8 +54433,8 @@ "question__title": "Coin Change", "question__title_slug": "coin-change", "question__hide": false, - "total_acs": 1375136, - "total_submitted": 3261649, + "total_acs": 1382331, + "total_submitted": 3275704, "frontend_question_id": 322, "is_new_question": false }, @@ -53881,8 +54456,8 @@ "question__title": "Create Maximum Number", "question__title_slug": "create-maximum-number", "question__hide": false, - "total_acs": 54653, - "total_submitted": 187632, + "total_acs": 54793, + "total_submitted": 187921, "frontend_question_id": 321, "is_new_question": false }, @@ -53904,8 +54479,8 @@ "question__title": "Generalized Abbreviation", "question__title_slug": "generalized-abbreviation", "question__hide": false, - "total_acs": 65499, - "total_submitted": 113408, + "total_acs": 65570, + "total_submitted": 113503, "frontend_question_id": 320, "is_new_question": false }, @@ -53927,8 +54502,8 @@ "question__title": "Bulb Switcher", "question__title_slug": "bulb-switcher", "question__hide": false, - "total_acs": 188867, - "total_submitted": 360157, + "total_acs": 189669, + "total_submitted": 361538, "frontend_question_id": 319, "is_new_question": false }, @@ -53950,8 +54525,8 @@ "question__title": "Maximum Product of Word Lengths", "question__title_slug": "maximum-product-of-word-lengths", "question__hide": false, - "total_acs": 202015, - "total_submitted": 337443, + "total_acs": 202336, + "total_submitted": 338002, "frontend_question_id": 318, "is_new_question": false }, @@ -53973,8 +54548,8 @@ "question__title": "Shortest Distance from All Buildings", "question__title_slug": "shortest-distance-from-all-buildings", "question__hide": false, - "total_acs": 153892, - "total_submitted": 361452, + "total_acs": 154155, + "total_submitted": 362259, "frontend_question_id": 317, "is_new_question": false }, @@ -53996,8 +54571,8 @@ "question__title": "Remove Duplicate Letters", "question__title_slug": "remove-duplicate-letters", "question__hide": false, - "total_acs": 228923, - "total_submitted": 506956, + "total_acs": 229951, + "total_submitted": 508554, "frontend_question_id": 316, "is_new_question": false }, @@ -54019,8 +54594,8 @@ "question__title": "Count of Smaller Numbers After Self", "question__title_slug": "count-of-smaller-numbers-after-self", "question__hide": false, - "total_acs": 291646, - "total_submitted": 685640, + "total_acs": 292174, + "total_submitted": 686986, "frontend_question_id": 315, "is_new_question": false }, @@ -54042,8 +54617,8 @@ "question__title": "Binary Tree Vertical Order Traversal", "question__title_slug": "binary-tree-vertical-order-traversal", "question__hide": false, - "total_acs": 319845, - "total_submitted": 611270, + "total_acs": 320155, + "total_submitted": 611799, "frontend_question_id": 314, "is_new_question": false }, @@ -54065,8 +54640,8 @@ "question__title": "Super Ugly Number", "question__title_slug": "super-ugly-number", "question__hide": false, - "total_acs": 117029, - "total_submitted": 257388, + "total_acs": 117260, + "total_submitted": 258066, "frontend_question_id": 313, "is_new_question": false }, @@ -54088,8 +54663,8 @@ "question__title": "Burst Balloons", "question__title_slug": "burst-balloons", "question__hide": false, - "total_acs": 226985, - "total_submitted": 397695, + "total_acs": 227947, + "total_submitted": 399223, "frontend_question_id": 312, "is_new_question": false }, @@ -54111,8 +54686,8 @@ "question__title": "Sparse Matrix Multiplication", "question__title_slug": "sparse-matrix-multiplication", "question__hide": false, - "total_acs": 171734, - "total_submitted": 254911, + "total_acs": 174948, + "total_submitted": 258916, "frontend_question_id": 311, "is_new_question": false }, @@ -54134,8 +54709,8 @@ "question__title": "Minimum Height Trees", "question__title_slug": "minimum-height-trees", "question__hide": false, - "total_acs": 246930, - "total_submitted": 640560, + "total_acs": 247964, + "total_submitted": 642939, "frontend_question_id": 310, "is_new_question": false }, @@ -54157,8 +54732,8 @@ "question__title": "Best Time to Buy and Sell Stock with Cooldown", "question__title_slug": "best-time-to-buy-and-sell-stock-with-cooldown", "question__hide": false, - "total_acs": 402852, - "total_submitted": 715132, + "total_acs": 404719, + "total_submitted": 718153, "frontend_question_id": 309, "is_new_question": false }, @@ -54180,8 +54755,8 @@ "question__title": "Range Sum Query 2D - Mutable", "question__title_slug": "range-sum-query-2d-mutable", "question__hide": false, - "total_acs": 72179, - "total_submitted": 168197, + "total_acs": 72331, + "total_submitted": 168418, "frontend_question_id": 308, "is_new_question": false }, @@ -54203,8 +54778,8 @@ "question__title": "Range Sum Query - Mutable", "question__title_slug": "range-sum-query-mutable", "question__hide": false, - "total_acs": 245822, - "total_submitted": 603892, + "total_acs": 246328, + "total_submitted": 605068, "frontend_question_id": 307, "is_new_question": false }, @@ -54226,8 +54801,8 @@ "question__title": "Additive Number", "question__title_slug": "additive-number", "question__hide": false, - "total_acs": 79188, - "total_submitted": 254709, + "total_acs": 79392, + "total_submitted": 255398, "frontend_question_id": 306, "is_new_question": false }, @@ -54249,8 +54824,8 @@ "question__title": "Number of Islands II", "question__title_slug": "number-of-islands-ii", "question__hide": false, - "total_acs": 130731, - "total_submitted": 329952, + "total_acs": 130961, + "total_submitted": 330561, "frontend_question_id": 305, "is_new_question": false }, @@ -54272,8 +54847,8 @@ "question__title": "Range Sum Query 2D - Immutable", "question__title_slug": "range-sum-query-2d-immutable", "question__hide": false, - "total_acs": 321748, - "total_submitted": 607496, + "total_acs": 322561, + "total_submitted": 608635, "frontend_question_id": 304, "is_new_question": false }, @@ -54295,8 +54870,8 @@ "question__title": "Range Sum Query - Immutable", "question__title_slug": "range-sum-query-immutable", "question__hide": false, - "total_acs": 435117, - "total_submitted": 728083, + "total_acs": 437421, + "total_submitted": 730714, "frontend_question_id": 303, "is_new_question": false }, @@ -54318,8 +54893,8 @@ "question__title": "Smallest Rectangle Enclosing Black Pixels", "question__title_slug": "smallest-rectangle-enclosing-black-pixels", "question__hide": false, - "total_acs": 47521, - "total_submitted": 81208, + "total_acs": 47589, + "total_submitted": 81302, "frontend_question_id": 302, "is_new_question": false }, @@ -54341,8 +54916,8 @@ "question__title": "Remove Invalid Parentheses", "question__title_slug": "remove-invalid-parentheses", "question__hide": false, - "total_acs": 381287, - "total_submitted": 808095, + "total_acs": 381795, + "total_submitted": 809021, "frontend_question_id": 301, "is_new_question": false }, @@ -54364,8 +54939,8 @@ "question__title": "Longest Increasing Subsequence", "question__title_slug": "longest-increasing-subsequence", "question__hide": false, - "total_acs": 1197311, - "total_submitted": 2290765, + "total_acs": 1206177, + "total_submitted": 2304381, "frontend_question_id": 300, "is_new_question": false }, @@ -54387,8 +54962,8 @@ "question__title": "Bulls and Cows", "question__title_slug": "bulls-and-cows", "question__hide": false, - "total_acs": 344134, - "total_submitted": 694739, + "total_acs": 345366, + "total_submitted": 696885, "frontend_question_id": 299, "is_new_question": false }, @@ -54410,8 +54985,8 @@ "question__title": "Binary Tree Longest Consecutive Sequence", "question__title_slug": "binary-tree-longest-consecutive-sequence", "question__hide": false, - "total_acs": 137987, - "total_submitted": 261330, + "total_acs": 138339, + "total_submitted": 261765, "frontend_question_id": 298, "is_new_question": false }, @@ -54433,8 +55008,8 @@ "question__title": "Serialize and Deserialize Binary Tree", "question__title_slug": "serialize-and-deserialize-binary-tree", "question__hide": false, - "total_acs": 739004, - "total_submitted": 1332216, + "total_acs": 741370, + "total_submitted": 1335874, "frontend_question_id": 297, "is_new_question": false }, @@ -54456,8 +55031,8 @@ "question__title": "Best Meeting Point", "question__title_slug": "best-meeting-point", "question__hide": false, - "total_acs": 67558, - "total_submitted": 112404, + "total_acs": 67689, + "total_submitted": 112663, "frontend_question_id": 296, "is_new_question": false }, @@ -54479,8 +55054,8 @@ "question__title": "Find Median from Data Stream", "question__title_slug": "find-median-from-data-stream", "question__hide": false, - "total_acs": 627242, - "total_submitted": 1219295, + "total_acs": 629906, + "total_submitted": 1224334, "frontend_question_id": 295, "is_new_question": false }, @@ -54502,8 +55077,8 @@ "question__title": "Flip Game II", "question__title_slug": "flip-game-ii", "question__hide": false, - "total_acs": 67718, - "total_submitted": 130453, + "total_acs": 67786, + "total_submitted": 130575, "frontend_question_id": 294, "is_new_question": false }, @@ -54525,8 +55100,8 @@ "question__title": "Flip Game", "question__title_slug": "flip-game", "question__hide": false, - "total_acs": 63933, - "total_submitted": 101094, + "total_acs": 64012, + "total_submitted": 101193, "frontend_question_id": 293, "is_new_question": false }, @@ -54548,8 +55123,8 @@ "question__title": "Nim Game", "question__title_slug": "nim-game", "question__hide": false, - "total_acs": 322141, - "total_submitted": 573749, + "total_acs": 323404, + "total_submitted": 575984, "frontend_question_id": 292, "is_new_question": false }, @@ -54571,8 +55146,8 @@ "question__title": "Word Pattern II", "question__title_slug": "word-pattern-ii", "question__hide": false, - "total_acs": 67483, - "total_submitted": 143220, + "total_acs": 67602, + "total_submitted": 143460, "frontend_question_id": 291, "is_new_question": false }, @@ -54594,8 +55169,8 @@ "question__title": "Word Pattern", "question__title_slug": "word-pattern", "question__hide": false, - "total_acs": 520398, - "total_submitted": 1249022, + "total_acs": 523254, + "total_submitted": 1255949, "frontend_question_id": 290, "is_new_question": false }, @@ -54617,8 +55192,8 @@ "question__title": "Game of Life", "question__title_slug": "game-of-life", "question__hide": false, - "total_acs": 390727, - "total_submitted": 580979, + "total_acs": 391970, + "total_submitted": 582542, "frontend_question_id": 289, "is_new_question": false }, @@ -54640,8 +55215,8 @@ "question__title": "Unique Word Abbreviation", "question__title_slug": "unique-word-abbreviation", "question__hide": false, - "total_acs": 69500, - "total_submitted": 271139, + "total_acs": 69592, + "total_submitted": 271290, "frontend_question_id": 288, "is_new_question": false }, @@ -54663,8 +55238,8 @@ "question__title": "Find the Duplicate Number", "question__title_slug": "find-the-duplicate-number", "question__hide": false, - "total_acs": 1161864, - "total_submitted": 1966412, + "total_acs": 1168631, + "total_submitted": 1978026, "frontend_question_id": 287, "is_new_question": false }, @@ -54686,8 +55261,8 @@ "question__title": "Walls and Gates", "question__title_slug": "walls-and-gates", "question__hide": false, - "total_acs": 269036, - "total_submitted": 444905, + "total_acs": 269702, + "total_submitted": 445840, "frontend_question_id": 286, "is_new_question": false }, @@ -54709,8 +55284,8 @@ "question__title": "Inorder Successor in BST", "question__title_slug": "inorder-successor-in-bst", "question__hide": false, - "total_acs": 302530, - "total_submitted": 620024, + "total_acs": 303086, + "total_submitted": 620920, "frontend_question_id": 285, "is_new_question": false }, @@ -54732,8 +55307,8 @@ "question__title": "Peeking Iterator", "question__title_slug": "peeking-iterator", "question__hide": false, - "total_acs": 206759, - "total_submitted": 352240, + "total_acs": 207057, + "total_submitted": 352636, "frontend_question_id": 284, "is_new_question": false }, @@ -54755,8 +55330,8 @@ "question__title": "Move Zeroes", "question__title_slug": "move-zeroes", "question__hide": false, - "total_acs": 2207967, - "total_submitted": 3595700, + "total_acs": 2222649, + "total_submitted": 3619265, "frontend_question_id": 283, "is_new_question": false }, @@ -54778,8 +55353,8 @@ "question__title": "Expression Add Operators", "question__title_slug": "expression-add-operators", "question__hide": false, - "total_acs": 198875, - "total_submitted": 507435, + "total_acs": 199135, + "total_submitted": 508037, "frontend_question_id": 282, "is_new_question": false }, @@ -54801,8 +55376,8 @@ "question__title": "Zigzag Iterator", "question__title_slug": "zigzag-iterator", "question__hide": false, - "total_acs": 87146, - "total_submitted": 138652, + "total_acs": 87297, + "total_submitted": 138834, "frontend_question_id": 281, "is_new_question": false }, @@ -54824,8 +55399,8 @@ "question__title": "Wiggle Sort", "question__title_slug": "wiggle-sort", "question__hide": false, - "total_acs": 129272, - "total_submitted": 192787, + "total_acs": 129701, + "total_submitted": 193381, "frontend_question_id": 280, "is_new_question": false }, @@ -54847,8 +55422,8 @@ "question__title": "Perfect Squares", "question__title_slug": "perfect-squares", "question__hide": false, - "total_acs": 659896, - "total_submitted": 1252485, + "total_acs": 662143, + "total_submitted": 1256418, "frontend_question_id": 279, "is_new_question": false }, @@ -54870,8 +55445,8 @@ "question__title": "First Bad Version", "question__title_slug": "first-bad-version", "question__hide": false, - "total_acs": 1473381, - "total_submitted": 3394214, + "total_acs": 1481130, + "total_submitted": 3409410, "frontend_question_id": 278, "is_new_question": false }, @@ -54893,8 +55468,8 @@ "question__title": "Find the Celebrity", "question__title_slug": "find-the-celebrity", "question__hide": false, - "total_acs": 247422, - "total_submitted": 530171, + "total_acs": 247894, + "total_submitted": 530994, "frontend_question_id": 277, "is_new_question": false }, @@ -54916,8 +55491,8 @@ "question__title": "Paint Fence", "question__title_slug": "paint-fence", "question__hide": false, - "total_acs": 97889, - "total_submitted": 219414, + "total_acs": 98164, + "total_submitted": 219860, "frontend_question_id": 276, "is_new_question": false }, @@ -54939,8 +55514,8 @@ "question__title": "H-Index II", "question__title_slug": "h-index-ii", "question__hide": false, - "total_acs": 176409, - "total_submitted": 468872, + "total_acs": 176953, + "total_submitted": 470297, "frontend_question_id": 275, "is_new_question": false }, @@ -54962,8 +55537,8 @@ "question__title": "H-Index", "question__title_slug": "h-index", "question__hide": false, - "total_acs": 261197, - "total_submitted": 680575, + "total_acs": 263126, + "total_submitted": 685480, "frontend_question_id": 274, "is_new_question": false }, @@ -54985,8 +55560,8 @@ "question__title": "Integer to English Words", "question__title_slug": "integer-to-english-words", "question__hide": false, - "total_acs": 342250, - "total_submitted": 1139448, + "total_acs": 342882, + "total_submitted": 1141443, "frontend_question_id": 273, "is_new_question": false }, @@ -55008,8 +55583,8 @@ "question__title": "Closest Binary Search Tree Value II", "question__title_slug": "closest-binary-search-tree-value-ii", "question__hide": false, - "total_acs": 110452, - "total_submitted": 189024, + "total_acs": 110608, + "total_submitted": 189234, "frontend_question_id": 272, "is_new_question": false }, @@ -55031,8 +55606,8 @@ "question__title": "Encode and Decode Strings", "question__title_slug": "encode-and-decode-strings", "question__hide": false, - "total_acs": 142045, - "total_submitted": 330207, + "total_acs": 143280, + "total_submitted": 332252, "frontend_question_id": 271, "is_new_question": false }, @@ -55054,8 +55629,8 @@ "question__title": "Closest Binary Search Tree Value", "question__title_slug": "closest-binary-search-tree-value", "question__hide": false, - "total_acs": 284661, - "total_submitted": 521362, + "total_acs": 285321, + "total_submitted": 523374, "frontend_question_id": 270, "is_new_question": false }, @@ -55077,8 +55652,8 @@ "question__title": "Alien Dictionary", "question__title_slug": "alien-dictionary", "question__hide": false, - "total_acs": 335834, - "total_submitted": 950766, + "total_acs": 336597, + "total_submitted": 952734, "frontend_question_id": 269, "is_new_question": false }, @@ -55100,8 +55675,8 @@ "question__title": "Missing Number", "question__title_slug": "missing-number", "question__hide": false, - "total_acs": 1481956, - "total_submitted": 2362037, + "total_acs": 1493052, + "total_submitted": 2377354, "frontend_question_id": 268, "is_new_question": false }, @@ -55123,8 +55698,8 @@ "question__title": "Palindrome Permutation II", "question__title_slug": "palindrome-permutation-ii", "question__hide": false, - "total_acs": 61437, - "total_submitted": 150833, + "total_acs": 61572, + "total_submitted": 151123, "frontend_question_id": 267, "is_new_question": false }, @@ -55146,8 +55721,8 @@ "question__title": "Palindrome Permutation", "question__title_slug": "palindrome-permutation", "question__hide": false, - "total_acs": 181168, - "total_submitted": 274187, + "total_acs": 181565, + "total_submitted": 274680, "frontend_question_id": 266, "is_new_question": false }, @@ -55169,8 +55744,8 @@ "question__title": "Paint House II", "question__title_slug": "paint-house-ii", "question__hide": false, - "total_acs": 109546, - "total_submitted": 206678, + "total_acs": 110446, + "total_submitted": 207831, "frontend_question_id": 265, "is_new_question": false }, @@ -55192,8 +55767,8 @@ "question__title": "Ugly Number II", "question__title_slug": "ugly-number-ii", "question__hide": false, - "total_acs": 305570, - "total_submitted": 661795, + "total_acs": 306328, + "total_submitted": 663721, "frontend_question_id": 264, "is_new_question": false }, @@ -55215,8 +55790,8 @@ "question__title": "Ugly Number", "question__title_slug": "ugly-number", "question__hide": false, - "total_acs": 424035, - "total_submitted": 1003991, + "total_acs": 425887, + "total_submitted": 1008417, "frontend_question_id": 263, "is_new_question": false }, @@ -55238,8 +55813,8 @@ "question__title": "Trips and Users", "question__title_slug": "trips-and-users", "question__hide": false, - "total_acs": 146824, - "total_submitted": 395507, + "total_acs": 147635, + "total_submitted": 398389, "frontend_question_id": 262, "is_new_question": false }, @@ -55261,8 +55836,8 @@ "question__title": "Graph Valid Tree", "question__title_slug": "graph-valid-tree", "question__hide": false, - "total_acs": 338520, - "total_submitted": 717706, + "total_acs": 339708, + "total_submitted": 719970, "frontend_question_id": 261, "is_new_question": false }, @@ -55284,8 +55859,8 @@ "question__title": "Single Number III", "question__title_slug": "single-number-iii", "question__hide": false, - "total_acs": 297126, - "total_submitted": 438735, + "total_acs": 298265, + "total_submitted": 440339, "frontend_question_id": 260, "is_new_question": false }, @@ -55307,8 +55882,8 @@ "question__title": "3Sum Smaller", "question__title_slug": "3sum-smaller", "question__hide": false, - "total_acs": 134625, - "total_submitted": 265854, + "total_acs": 134923, + "total_submitted": 266455, "frontend_question_id": 259, "is_new_question": false }, @@ -55330,8 +55905,8 @@ "question__title": "Add Digits", "question__title_slug": "add-digits", "question__hide": false, - "total_acs": 640088, - "total_submitted": 975290, + "total_acs": 642893, + "total_submitted": 979394, "frontend_question_id": 258, "is_new_question": false }, @@ -55353,8 +55928,8 @@ "question__title": "Binary Tree Paths", "question__title_slug": "binary-tree-paths", "question__hide": false, - "total_acs": 614403, - "total_submitted": 998208, + "total_acs": 616468, + "total_submitted": 1000888, "frontend_question_id": 257, "is_new_question": false }, @@ -55376,8 +55951,8 @@ "question__title": "Paint House", "question__title_slug": "paint-house", "question__hide": false, - "total_acs": 185968, - "total_submitted": 304150, + "total_acs": 186405, + "total_submitted": 304700, "frontend_question_id": 256, "is_new_question": false }, @@ -55399,8 +55974,8 @@ "question__title": "Verify Preorder Sequence in Binary Search Tree", "question__title_slug": "verify-preorder-sequence-in-binary-search-tree", "question__hide": false, - "total_acs": 70673, - "total_submitted": 146280, + "total_acs": 70773, + "total_submitted": 146463, "frontend_question_id": 255, "is_new_question": false }, @@ -55422,8 +55997,8 @@ "question__title": "Factor Combinations", "question__title_slug": "factor-combinations", "question__hide": false, - "total_acs": 120316, - "total_submitted": 244936, + "total_acs": 120531, + "total_submitted": 245303, "frontend_question_id": 254, "is_new_question": false }, @@ -55445,8 +56020,8 @@ "question__title": "Meeting Rooms II", "question__title_slug": "meeting-rooms-ii", "question__hide": false, - "total_acs": 775797, - "total_submitted": 1533614, + "total_acs": 777727, + "total_submitted": 1537173, "frontend_question_id": 253, "is_new_question": false }, @@ -55468,8 +56043,8 @@ "question__title": "Meeting Rooms", "question__title_slug": "meeting-rooms", "question__hide": false, - "total_acs": 339611, - "total_submitted": 592768, + "total_acs": 340857, + "total_submitted": 594691, "frontend_question_id": 252, "is_new_question": false }, @@ -55491,8 +56066,8 @@ "question__title": "Flatten 2D Vector", "question__title_slug": "flatten-2d-vector", "question__hide": false, - "total_acs": 119528, - "total_submitted": 243126, + "total_acs": 119763, + "total_submitted": 243519, "frontend_question_id": 251, "is_new_question": false }, @@ -55514,8 +56089,8 @@ "question__title": "Count Univalue Subtrees", "question__title_slug": "count-univalue-subtrees", "question__hide": false, - "total_acs": 138324, - "total_submitted": 249247, + "total_acs": 138637, + "total_submitted": 249682, "frontend_question_id": 250, "is_new_question": false }, @@ -55537,8 +56112,8 @@ "question__title": "Group Shifted Strings", "question__title_slug": "group-shifted-strings", "question__hide": false, - "total_acs": 190492, - "total_submitted": 296102, + "total_acs": 190775, + "total_submitted": 296542, "frontend_question_id": 249, "is_new_question": false }, @@ -55560,8 +56135,8 @@ "question__title": "Strobogrammatic Number III", "question__title_slug": "strobogrammatic-number-iii", "question__hide": false, - "total_acs": 35451, - "total_submitted": 84526, + "total_acs": 35473, + "total_submitted": 84560, "frontend_question_id": 248, "is_new_question": false }, @@ -55583,8 +56158,8 @@ "question__title": "Strobogrammatic Number II", "question__title_slug": "strobogrammatic-number-ii", "question__hide": false, - "total_acs": 128881, - "total_submitted": 249934, + "total_acs": 129037, + "total_submitted": 250198, "frontend_question_id": 247, "is_new_question": false }, @@ -55606,8 +56181,8 @@ "question__title": "Strobogrammatic Number", "question__title_slug": "strobogrammatic-number", "question__hide": false, - "total_acs": 159429, - "total_submitted": 334139, + "total_acs": 159709, + "total_submitted": 334700, "frontend_question_id": 246, "is_new_question": false }, @@ -55629,8 +56204,8 @@ "question__title": "Shortest Word Distance III", "question__title_slug": "shortest-word-distance-iii", "question__hide": false, - "total_acs": 78796, - "total_submitted": 135572, + "total_acs": 78907, + "total_submitted": 135736, "frontend_question_id": 245, "is_new_question": false }, @@ -55652,8 +56227,8 @@ "question__title": "Shortest Word Distance II", "question__title_slug": "shortest-word-distance-ii", "question__hide": false, - "total_acs": 147056, - "total_submitted": 241556, + "total_acs": 147221, + "total_submitted": 241806, "frontend_question_id": 244, "is_new_question": false }, @@ -55675,8 +56250,8 @@ "question__title": "Shortest Word Distance", "question__title_slug": "shortest-word-distance", "question__hide": false, - "total_acs": 200981, - "total_submitted": 309002, + "total_acs": 201314, + "total_submitted": 309486, "frontend_question_id": 243, "is_new_question": false }, @@ -55698,8 +56273,8 @@ "question__title": "Valid Anagram", "question__title_slug": "valid-anagram", "question__hide": false, - "total_acs": 2119825, - "total_submitted": 3359262, + "total_acs": 2152240, + "total_submitted": 3411012, "frontend_question_id": 242, "is_new_question": false }, @@ -55721,8 +56296,8 @@ "question__title": "Different Ways to Add Parentheses", "question__title_slug": "different-ways-to-add-parentheses", "question__hide": false, - "total_acs": 193545, - "total_submitted": 302337, + "total_acs": 194144, + "total_submitted": 303205, "frontend_question_id": 241, "is_new_question": false }, @@ -55744,8 +56319,8 @@ "question__title": "Search a 2D Matrix II", "question__title_slug": "search-a-2d-matrix-ii", "question__hide": false, - "total_acs": 784513, - "total_submitted": 1535546, + "total_acs": 788102, + "total_submitted": 1541778, "frontend_question_id": 240, "is_new_question": false }, @@ -55767,8 +56342,8 @@ "question__title": "Sliding Window Maximum", "question__title_slug": "sliding-window-maximum", "question__hide": false, - "total_acs": 750654, - "total_submitted": 1622444, + "total_acs": 754780, + "total_submitted": 1631862, "frontend_question_id": 239, "is_new_question": false }, @@ -55790,8 +56365,8 @@ "question__title": "Product of Array Except Self", "question__title_slug": "product-of-array-except-self", "question__hide": false, - "total_acs": 1603047, - "total_submitted": 2462158, + "total_acs": 1619100, + "total_submitted": 2486311, "frontend_question_id": 238, "is_new_question": false }, @@ -55813,8 +56388,8 @@ "question__title": "Delete Node in a Linked List", "question__title_slug": "delete-node-in-a-linked-list", "question__hide": false, - "total_acs": 1059723, - "total_submitted": 1391305, + "total_acs": 1063916, + "total_submitted": 1395891, "frontend_question_id": 237, "is_new_question": false }, @@ -55836,8 +56411,8 @@ "question__title": "Lowest Common Ancestor of a Binary Tree", "question__title_slug": "lowest-common-ancestor-of-a-binary-tree", "question__hide": false, - "total_acs": 1285897, - "total_submitted": 2181611, + "total_acs": 1290753, + "total_submitted": 2187642, "frontend_question_id": 236, "is_new_question": false }, @@ -55859,8 +56434,8 @@ "question__title": "Lowest Common Ancestor of a Binary Search Tree", "question__title_slug": "lowest-common-ancestor-of-a-binary-search-tree", "question__hide": false, - "total_acs": 1166919, - "total_submitted": 1889961, + "total_acs": 1173757, + "total_submitted": 1898758, "frontend_question_id": 235, "is_new_question": false }, @@ -55882,8 +56457,8 @@ "question__title": "Palindrome Linked List", "question__title_slug": "palindrome-linked-list", "question__hide": false, - "total_acs": 1434266, - "total_submitted": 2849748, + "total_acs": 1443741, + "total_submitted": 2867373, "frontend_question_id": 234, "is_new_question": false }, @@ -55905,8 +56480,8 @@ "question__title": "Number of Digit One", "question__title_slug": "number-of-digit-one", "question__hide": false, - "total_acs": 76540, - "total_submitted": 225392, + "total_acs": 76893, + "total_submitted": 226511, "frontend_question_id": 233, "is_new_question": false }, @@ -55928,8 +56503,8 @@ "question__title": "Implement Queue using Stacks", "question__title_slug": "implement-queue-using-stacks", "question__hide": false, - "total_acs": 653753, - "total_submitted": 1031837, + "total_acs": 658210, + "total_submitted": 1038115, "frontend_question_id": 232, "is_new_question": false }, @@ -55951,8 +56526,8 @@ "question__title": "Power of Two", "question__title_slug": "power-of-two", "question__hide": false, - "total_acs": 884142, - "total_submitted": 1920047, + "total_acs": 890400, + "total_submitted": 1932948, "frontend_question_id": 231, "is_new_question": false }, @@ -55974,8 +56549,8 @@ "question__title": "Kth Smallest Element in a BST", "question__title_slug": "kth-smallest-element-in-a-bst", "question__hide": false, - "total_acs": 1076561, - "total_submitted": 1532110, + "total_acs": 1082548, + "total_submitted": 1539600, "frontend_question_id": 230, "is_new_question": false }, @@ -55997,8 +56572,8 @@ "question__title": "Majority Element II", "question__title_slug": "majority-element-ii", "question__hide": false, - "total_acs": 398132, - "total_submitted": 879166, + "total_acs": 400967, + "total_submitted": 883904, "frontend_question_id": 229, "is_new_question": false }, @@ -56020,8 +56595,8 @@ "question__title": "Summary Ranges", "question__title_slug": "summary-ranges", "question__hide": false, - "total_acs": 346171, - "total_submitted": 732152, + "total_acs": 348157, + "total_submitted": 735637, "frontend_question_id": 228, "is_new_question": false }, @@ -56043,8 +56618,8 @@ "question__title": "Basic Calculator II", "question__title_slug": "basic-calculator-ii", "question__hide": false, - "total_acs": 514651, - "total_submitted": 1212207, + "total_acs": 516243, + "total_submitted": 1215457, "frontend_question_id": 227, "is_new_question": false }, @@ -56066,8 +56641,8 @@ "question__title": "Invert Binary Tree", "question__title_slug": "invert-binary-tree", "question__hide": false, - "total_acs": 1538464, - "total_submitted": 2055666, + "total_acs": 1548942, + "total_submitted": 2068394, "frontend_question_id": 226, "is_new_question": false }, @@ -56089,8 +56664,8 @@ "question__title": "Implement Stack using Queues", "question__title_slug": "implement-stack-using-queues", "question__hide": false, - "total_acs": 446745, - "total_submitted": 759522, + "total_acs": 449583, + "total_submitted": 763466, "frontend_question_id": 225, "is_new_question": false }, @@ -56112,8 +56687,8 @@ "question__title": "Basic Calculator", "question__title_slug": "basic-calculator", "question__hide": false, - "total_acs": 378525, - "total_submitted": 891598, + "total_acs": 379717, + "total_submitted": 894168, "frontend_question_id": 224, "is_new_question": false }, @@ -56135,8 +56710,8 @@ "question__title": "Rectangle Area", "question__title_slug": "rectangle-area", "question__hide": false, - "total_acs": 200397, - "total_submitted": 443471, + "total_acs": 200915, + "total_submitted": 444375, "frontend_question_id": 223, "is_new_question": false }, @@ -56158,8 +56733,8 @@ "question__title": "Count Complete Tree Nodes", "question__title_slug": "count-complete-tree-nodes", "question__hide": false, - "total_acs": 543359, - "total_submitted": 895086, + "total_acs": 545451, + "total_submitted": 897531, "frontend_question_id": 222, "is_new_question": false }, @@ -56181,8 +56756,8 @@ "question__title": "Maximal Square", "question__title_slug": "maximal-square", "question__hide": false, - "total_acs": 578818, - "total_submitted": 1285084, + "total_acs": 580917, + "total_submitted": 1288819, "frontend_question_id": 221, "is_new_question": false }, @@ -56204,8 +56779,8 @@ "question__title": "Contains Duplicate III", "question__title_slug": "contains-duplicate-iii", "question__hide": false, - "total_acs": 228819, - "total_submitted": 1032000, + "total_acs": 229373, + "total_submitted": 1033669, "frontend_question_id": 220, "is_new_question": false }, @@ -56227,8 +56802,8 @@ "question__title": "Contains Duplicate II", "question__title_slug": "contains-duplicate-ii", "question__hide": false, - "total_acs": 665335, - "total_submitted": 1561457, + "total_acs": 669554, + "total_submitted": 1569989, "frontend_question_id": 219, "is_new_question": false }, @@ -56250,8 +56825,8 @@ "question__title": "The Skyline Problem", "question__title_slug": "the-skyline-problem", "question__hide": false, - "total_acs": 264448, - "total_submitted": 630864, + "total_acs": 265129, + "total_submitted": 632057, "frontend_question_id": 218, "is_new_question": false }, @@ -56273,8 +56848,8 @@ "question__title": "Contains Duplicate", "question__title_slug": "contains-duplicate", "question__hide": false, - "total_acs": 2686311, - "total_submitted": 4372914, + "total_acs": 2724329, + "total_submitted": 4436299, "frontend_question_id": 217, "is_new_question": false }, @@ -56296,8 +56871,8 @@ "question__title": "Combination Sum III", "question__title_slug": "combination-sum-iii", "question__hide": false, - "total_acs": 398034, - "total_submitted": 588089, + "total_acs": 399784, + "total_submitted": 590301, "frontend_question_id": 216, "is_new_question": false }, @@ -56319,8 +56894,8 @@ "question__title": "Kth Largest Element in an Array", "question__title_slug": "kth-largest-element-in-an-array", "question__hide": false, - "total_acs": 1726718, - "total_submitted": 2606489, + "total_acs": 1734577, + "total_submitted": 2616727, "frontend_question_id": 215, "is_new_question": false }, @@ -56342,8 +56917,8 @@ "question__title": "Shortest Palindrome", "question__title_slug": "shortest-palindrome", "question__hide": false, - "total_acs": 155626, - "total_submitted": 480909, + "total_acs": 156125, + "total_submitted": 482235, "frontend_question_id": 214, "is_new_question": false }, @@ -56365,8 +56940,8 @@ "question__title": "House Robber II", "question__title_slug": "house-robber-ii", "question__hide": false, - "total_acs": 573409, - "total_submitted": 1395098, + "total_acs": 577174, + "total_submitted": 1403568, "frontend_question_id": 213, "is_new_question": false }, @@ -56388,8 +56963,8 @@ "question__title": "Word Search II", "question__title_slug": "word-search-ii", "question__hide": false, - "total_acs": 554975, - "total_submitted": 1526360, + "total_acs": 556575, + "total_submitted": 1531792, "frontend_question_id": 212, "is_new_question": false }, @@ -56411,8 +56986,8 @@ "question__title": "Design Add and Search Words Data Structure", "question__title_slug": "design-add-and-search-words-data-structure", "question__hide": false, - "total_acs": 523432, - "total_submitted": 1189340, + "total_acs": 525054, + "total_submitted": 1192559, "frontend_question_id": 211, "is_new_question": false }, @@ -56434,8 +57009,8 @@ "question__title": "Course Schedule II", "question__title_slug": "course-schedule-ii", "question__hide": false, - "total_acs": 810878, - "total_submitted": 1669554, + "total_acs": 814831, + "total_submitted": 1676356, "frontend_question_id": 210, "is_new_question": false }, @@ -56457,8 +57032,8 @@ "question__title": "Minimum Size Subarray Sum", "question__title_slug": "minimum-size-subarray-sum", "question__hide": false, - "total_acs": 689891, - "total_submitted": 1531047, + "total_acs": 694139, + "total_submitted": 1539175, "frontend_question_id": 209, "is_new_question": false }, @@ -56480,8 +57055,8 @@ "question__title": "Implement Trie (Prefix Tree)", "question__title_slug": "implement-trie-prefix-tree", "question__hide": false, - "total_acs": 811320, - "total_submitted": 1290211, + "total_acs": 814980, + "total_submitted": 1295123, "frontend_question_id": 208, "is_new_question": false }, @@ -56503,8 +57078,8 @@ "question__title": "Course Schedule", "question__title_slug": "course-schedule", "question__hide": false, - "total_acs": 1159311, - "total_submitted": 2552689, + "total_acs": 1165392, + "total_submitted": 2565524, "frontend_question_id": 207, "is_new_question": false }, @@ -56526,8 +57101,8 @@ "question__title": "Reverse Linked List", "question__title_slug": "reverse-linked-list", "question__hide": false, - "total_acs": 3050658, - "total_submitted": 4137778, + "total_acs": 3071702, + "total_submitted": 4162673, "frontend_question_id": 206, "is_new_question": false }, @@ -56549,8 +57124,8 @@ "question__title": "Isomorphic Strings", "question__title_slug": "isomorphic-strings", "question__hide": false, - "total_acs": 882392, - "total_submitted": 2051696, + "total_acs": 890777, + "total_submitted": 2069726, "frontend_question_id": 205, "is_new_question": false }, @@ -56572,8 +57147,8 @@ "question__title": "Count Primes", "question__title_slug": "count-primes", "question__hide": false, - "total_acs": 729235, - "total_submitted": 2200647, + "total_acs": 732180, + "total_submitted": 2209313, "frontend_question_id": 204, "is_new_question": false }, @@ -56595,8 +57170,8 @@ "question__title": "Remove Linked List Elements", "question__title_slug": "remove-linked-list-elements", "question__hide": false, - "total_acs": 923474, - "total_submitted": 1999978, + "total_acs": 928541, + "total_submitted": 2007824, "frontend_question_id": 203, "is_new_question": false }, @@ -56618,8 +57193,8 @@ "question__title": "Happy Number", "question__title_slug": "happy-number", "question__hide": false, - "total_acs": 1138722, - "total_submitted": 2074838, + "total_acs": 1145831, + "total_submitted": 2086993, "frontend_question_id": 202, "is_new_question": false }, @@ -56641,8 +57216,8 @@ "question__title": "Bitwise AND of Numbers Range", "question__title_slug": "bitwise-and-of-numbers-range", "question__hide": false, - "total_acs": 240857, - "total_submitted": 566776, + "total_acs": 241555, + "total_submitted": 568345, "frontend_question_id": 201, "is_new_question": false }, @@ -56664,8 +57239,8 @@ "question__title": "Number of Islands", "question__title_slug": "number-of-islands", "question__hide": false, - "total_acs": 2138181, - "total_submitted": 3742739, + "total_acs": 2147973, + "total_submitted": 3757099, "frontend_question_id": 200, "is_new_question": false }, @@ -56687,8 +57262,8 @@ "question__title": "Binary Tree Right Side View", "question__title_slug": "binary-tree-right-side-view", "question__hide": false, - "total_acs": 939812, - "total_submitted": 1522707, + "total_acs": 944734, + "total_submitted": 1529862, "frontend_question_id": 199, "is_new_question": false }, @@ -56710,8 +57285,8 @@ "question__title": "House Robber", "question__title_slug": "house-robber", "question__hide": false, - "total_acs": 1597622, - "total_submitted": 3228589, + "total_acs": 1607651, + "total_submitted": 3246679, "frontend_question_id": 198, "is_new_question": false }, @@ -56733,8 +57308,8 @@ "question__title": "Rising Temperature", "question__title_slug": "rising-temperature", "question__hide": false, - "total_acs": 327804, - "total_submitted": 733695, + "total_acs": 332317, + "total_submitted": 743442, "frontend_question_id": 197, "is_new_question": false }, @@ -56756,8 +57331,8 @@ "question__title": "Delete Duplicate Emails", "question__title_slug": "delete-duplicate-emails", "question__hide": false, - "total_acs": 382510, - "total_submitted": 626623, + "total_acs": 386779, + "total_submitted": 632736, "frontend_question_id": 196, "is_new_question": false }, @@ -56779,8 +57354,8 @@ "question__title": "Tenth Line", "question__title_slug": "tenth-line", "question__hide": false, - "total_acs": 87455, - "total_submitted": 266139, + "total_acs": 87975, + "total_submitted": 267853, "frontend_question_id": 195, "is_new_question": false }, @@ -56802,8 +57377,8 @@ "question__title": "Transpose File", "question__title_slug": "transpose-file", "question__hide": false, - "total_acs": 21452, - "total_submitted": 84362, + "total_acs": 21570, + "total_submitted": 84761, "frontend_question_id": 194, "is_new_question": false }, @@ -56825,8 +57400,8 @@ "question__title": "Valid Phone Numbers", "question__title_slug": "valid-phone-numbers", "question__hide": false, - "total_acs": 67745, - "total_submitted": 260712, + "total_acs": 68198, + "total_submitted": 262445, "frontend_question_id": 193, "is_new_question": false }, @@ -56848,8 +57423,8 @@ "question__title": "Word Frequency", "question__title_slug": "word-frequency", "question__hide": false, - "total_acs": 42975, - "total_submitted": 168321, + "total_acs": 43214, + "total_submitted": 169401, "frontend_question_id": 192, "is_new_question": false }, @@ -56871,8 +57446,8 @@ "question__title": "Number of 1 Bits", "question__title_slug": "number-of-1-bits", "question__hide": false, - "total_acs": 1099070, - "total_submitted": 1643667, + "total_acs": 1106516, + "total_submitted": 1652543, "frontend_question_id": 191, "is_new_question": false }, @@ -56894,8 +57469,8 @@ "question__title": "Reverse Bits", "question__title_slug": "reverse-bits", "question__hide": false, - "total_acs": 623992, - "total_submitted": 1149733, + "total_acs": 627725, + "total_submitted": 1154283, "frontend_question_id": 190, "is_new_question": false }, @@ -56917,8 +57492,8 @@ "question__title": "Rotate Array", "question__title_slug": "rotate-array", "question__hide": false, - "total_acs": 1480231, - "total_submitted": 3751581, + "total_acs": 1491310, + "total_submitted": 3777678, "frontend_question_id": 189, "is_new_question": false }, @@ -56940,8 +57515,8 @@ "question__title": "Best Time to Buy and Sell Stock IV", "question__title_slug": "best-time-to-buy-and-sell-stock-iv", "question__hide": false, - "total_acs": 356248, - "total_submitted": 910753, + "total_acs": 357862, + "total_submitted": 913230, "frontend_question_id": 188, "is_new_question": false }, @@ -56963,8 +57538,8 @@ "question__title": "Repeated DNA Sequences", "question__title_slug": "repeated-dna-sequences", "question__hide": false, - "total_acs": 323545, - "total_submitted": 687156, + "total_acs": 324962, + "total_submitted": 689377, "frontend_question_id": 187, "is_new_question": false }, @@ -56986,8 +57561,8 @@ "question__title": "Reverse Words in a String II", "question__title_slug": "reverse-words-in-a-string-ii", "question__hide": false, - "total_acs": 147474, - "total_submitted": 278412, + "total_acs": 147841, + "total_submitted": 278862, "frontend_question_id": 186, "is_new_question": false }, @@ -57009,8 +57584,8 @@ "question__title": "Department Top Three Salaries", "question__title_slug": "department-top-three-salaries", "question__hide": false, - "total_acs": 217908, - "total_submitted": 431938, + "total_acs": 219686, + "total_submitted": 435006, "frontend_question_id": 185, "is_new_question": false }, @@ -57032,8 +57607,8 @@ "question__title": "Department Highest Salary", "question__title_slug": "department-highest-salary", "question__hide": false, - "total_acs": 298731, - "total_submitted": 596938, + "total_acs": 300679, + "total_submitted": 600529, "frontend_question_id": 184, "is_new_question": false }, @@ -57055,8 +57630,8 @@ "question__title": "Customers Who Never Order", "question__title_slug": "customers-who-never-order", "question__hide": false, - "total_acs": 630907, - "total_submitted": 920186, + "total_acs": 637450, + "total_submitted": 929816, "frontend_question_id": 183, "is_new_question": false }, @@ -57078,8 +57653,8 @@ "question__title": "Duplicate Emails", "question__title_slug": "duplicate-emails", "question__hide": false, - "total_acs": 503176, - "total_submitted": 710494, + "total_acs": 507720, + "total_submitted": 716776, "frontend_question_id": 182, "is_new_question": false }, @@ -57101,8 +57676,8 @@ "question__title": "Employees Earning More Than Their Managers", "question__title_slug": "employees-earning-more-than-their-managers", "question__hide": false, - "total_acs": 488433, - "total_submitted": 707965, + "total_acs": 492472, + "total_submitted": 713925, "frontend_question_id": 181, "is_new_question": false }, @@ -57124,8 +57699,8 @@ "question__title": "Consecutive Numbers", "question__title_slug": "consecutive-numbers", "question__hide": false, - "total_acs": 250233, - "total_submitted": 537790, + "total_acs": 252192, + "total_submitted": 542450, "frontend_question_id": 180, "is_new_question": false }, @@ -57147,8 +57722,8 @@ "question__title": "Largest Number", "question__title_slug": "largest-number", "question__hide": false, - "total_acs": 392331, - "total_submitted": 1131928, + "total_acs": 394112, + "total_submitted": 1135967, "frontend_question_id": 179, "is_new_question": false }, @@ -57170,8 +57745,8 @@ "question__title": "Rank Scores", "question__title_slug": "rank-scores", "question__hide": false, - "total_acs": 298588, - "total_submitted": 493542, + "total_acs": 300830, + "total_submitted": 497023, "frontend_question_id": 178, "is_new_question": false }, @@ -57193,8 +57768,8 @@ "question__title": "Nth Highest Salary", "question__title_slug": "nth-highest-salary", "question__hide": false, - "total_acs": 305789, - "total_submitted": 810782, + "total_acs": 307831, + "total_submitted": 815927, "frontend_question_id": 177, "is_new_question": false }, @@ -57216,8 +57791,8 @@ "question__title": "Second Highest Salary", "question__title_slug": "second-highest-salary", "question__hide": false, - "total_acs": 647363, - "total_submitted": 1712242, + "total_acs": 652312, + "total_submitted": 1722152, "frontend_question_id": 176, "is_new_question": false }, @@ -57239,8 +57814,8 @@ "question__title": "Combine Two Tables", "question__title_slug": "combine-two-tables", "question__hide": false, - "total_acs": 766541, - "total_submitted": 1031392, + "total_acs": 774005, + "total_submitted": 1040687, "frontend_question_id": 175, "is_new_question": false }, @@ -57262,8 +57837,8 @@ "question__title": "Dungeon Game", "question__title_slug": "dungeon-game", "question__hide": false, - "total_acs": 198114, - "total_submitted": 528034, + "total_acs": 198606, + "total_submitted": 529205, "frontend_question_id": 174, "is_new_question": false }, @@ -57285,8 +57860,8 @@ "question__title": "Binary Search Tree Iterator", "question__title_slug": "binary-search-tree-iterator", "question__hide": false, - "total_acs": 668532, - "total_submitted": 957095, + "total_acs": 670356, + "total_submitted": 959157, "frontend_question_id": 173, "is_new_question": false }, @@ -57308,8 +57883,8 @@ "question__title": "Factorial Trailing Zeroes", "question__title_slug": "factorial-trailing-zeroes", "question__hide": false, - "total_acs": 366703, - "total_submitted": 867493, + "total_acs": 368059, + "total_submitted": 870308, "frontend_question_id": 172, "is_new_question": false }, @@ -57331,8 +57906,8 @@ "question__title": "Excel Sheet Column Number", "question__title_slug": "excel-sheet-column-number", "question__hide": false, - "total_acs": 595342, - "total_submitted": 957685, + "total_acs": 597789, + "total_submitted": 960845, "frontend_question_id": 171, "is_new_question": false }, @@ -57354,8 +57929,8 @@ "question__title": "Two Sum III - Data structure design", "question__title_slug": "two-sum-iii-data-structure-design", "question__hide": false, - "total_acs": 141228, - "total_submitted": 377631, + "total_acs": 141503, + "total_submitted": 378309, "frontend_question_id": 170, "is_new_question": false }, @@ -57377,8 +57952,8 @@ "question__title": "Majority Element", "question__title_slug": "majority-element", "question__hide": false, - "total_acs": 1702315, - "total_submitted": 2663392, + "total_acs": 1718084, + "total_submitted": 2687879, "frontend_question_id": 169, "is_new_question": false }, @@ -57400,8 +57975,8 @@ "question__title": "Excel Sheet Column Title", "question__title_slug": "excel-sheet-column-title", "question__hide": false, - "total_acs": 375479, - "total_submitted": 1052729, + "total_acs": 377067, + "total_submitted": 1055627, "frontend_question_id": 168, "is_new_question": false }, @@ -57423,8 +57998,8 @@ "question__title": "Two Sum II - Input Array Is Sorted", "question__title_slug": "two-sum-ii-input-array-is-sorted", "question__hide": false, - "total_acs": 1439866, - "total_submitted": 2397102, + "total_acs": 1450518, + "total_submitted": 2414458, "frontend_question_id": 167, "is_new_question": false }, @@ -57446,8 +58021,8 @@ "question__title": "Fraction to Recurring Decimal", "question__title_slug": "fraction-to-recurring-decimal", "question__hide": false, - "total_acs": 206402, - "total_submitted": 847593, + "total_acs": 206863, + "total_submitted": 849090, "frontend_question_id": 166, "is_new_question": false }, @@ -57469,8 +58044,8 @@ "question__title": "Compare Version Numbers", "question__title_slug": "compare-version-numbers", "question__hide": false, - "total_acs": 348334, - "total_submitted": 973798, + "total_acs": 349283, + "total_submitted": 975528, "frontend_question_id": 165, "is_new_question": false }, @@ -57492,8 +58067,8 @@ "question__title": "Maximum Gap", "question__title_slug": "maximum-gap", "question__hide": false, - "total_acs": 167383, - "total_submitted": 385106, + "total_acs": 168081, + "total_submitted": 386342, "frontend_question_id": 164, "is_new_question": false }, @@ -57515,8 +58090,8 @@ "question__title": "Missing Ranges", "question__title_slug": "missing-ranges", "question__hide": false, - "total_acs": 200173, - "total_submitted": 620615, + "total_acs": 200791, + "total_submitted": 622289, "frontend_question_id": 163, "is_new_question": false }, @@ -57538,8 +58113,8 @@ "question__title": "Find Peak Element", "question__title_slug": "find-peak-element", "question__hide": false, - "total_acs": 1007479, - "total_submitted": 2191221, + "total_acs": 1012353, + "total_submitted": 2202369, "frontend_question_id": 162, "is_new_question": false }, @@ -57561,8 +58136,8 @@ "question__title": "One Edit Distance", "question__title_slug": "one-edit-distance", "question__hide": false, - "total_acs": 188296, - "total_submitted": 551497, + "total_acs": 188730, + "total_submitted": 552649, "frontend_question_id": 161, "is_new_question": false }, @@ -57584,8 +58159,8 @@ "question__title": "Intersection of Two Linked Lists", "question__title_slug": "intersection-of-two-linked-lists", "question__hide": false, - "total_acs": 1260894, - "total_submitted": 2312803, + "total_acs": 1267236, + "total_submitted": 2321474, "frontend_question_id": 160, "is_new_question": false }, @@ -57607,8 +58182,8 @@ "question__title": "Longest Substring with At Most Two Distinct Characters", "question__title_slug": "longest-substring-with-at-most-two-distinct-characters", "question__hide": false, - "total_acs": 226540, - "total_submitted": 420688, + "total_acs": 227077, + "total_submitted": 421521, "frontend_question_id": 159, "is_new_question": false }, @@ -57630,8 +58205,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": 175751, - "total_submitted": 421756, + "total_acs": 175901, + "total_submitted": 421982, "frontend_question_id": 158, "is_new_question": false }, @@ -57653,8 +58228,8 @@ "question__title": "Read N Characters Given Read4", "question__title_slug": "read-n-characters-given-read4", "question__hide": false, - "total_acs": 180631, - "total_submitted": 440699, + "total_acs": 180842, + "total_submitted": 441055, "frontend_question_id": 157, "is_new_question": false }, @@ -57676,8 +58251,8 @@ "question__title": "Binary Tree Upside Down", "question__title_slug": "binary-tree-upside-down", "question__hide": false, - "total_acs": 96828, - "total_submitted": 156156, + "total_acs": 96940, + "total_submitted": 156277, "frontend_question_id": 156, "is_new_question": false }, @@ -57699,8 +58274,8 @@ "question__title": "Min Stack", "question__title_slug": "min-stack", "question__hide": false, - "total_acs": 1249587, - "total_submitted": 2383880, + "total_acs": 1257108, + "total_submitted": 2396424, "frontend_question_id": 155, "is_new_question": false }, @@ -57722,8 +58297,8 @@ "question__title": "Find Minimum in Rotated Sorted Array II", "question__title_slug": "find-minimum-in-rotated-sorted-array-ii", "question__hide": false, - "total_acs": 383893, - "total_submitted": 882217, + "total_acs": 385233, + "total_submitted": 885195, "frontend_question_id": 154, "is_new_question": false }, @@ -57745,8 +58320,8 @@ "question__title": "Find Minimum in Rotated Sorted Array", "question__title_slug": "find-minimum-in-rotated-sorted-array", "question__hide": false, - "total_acs": 1279252, - "total_submitted": 2614697, + "total_acs": 1287885, + "total_submitted": 2631428, "frontend_question_id": 153, "is_new_question": false }, @@ -57768,8 +58343,8 @@ "question__title": "Maximum Product Subarray", "question__title_slug": "maximum-product-subarray", "question__hide": false, - "total_acs": 990667, - "total_submitted": 2842024, + "total_acs": 996405, + "total_submitted": 2857981, "frontend_question_id": 152, "is_new_question": false }, @@ -57791,8 +58366,8 @@ "question__title": "Reverse Words in a String", "question__title_slug": "reverse-words-in-a-string", "question__hide": false, - "total_acs": 915519, - "total_submitted": 2774015, + "total_acs": 922814, + "total_submitted": 2783590, "frontend_question_id": 151, "is_new_question": false }, @@ -57814,8 +58389,8 @@ "question__title": "Evaluate Reverse Polish Notation", "question__title_slug": "evaluate-reverse-polish-notation", "question__hide": false, - "total_acs": 651151, - "total_submitted": 1415058, + "total_acs": 656399, + "total_submitted": 1423874, "frontend_question_id": 150, "is_new_question": false }, @@ -57837,8 +58412,8 @@ "question__title": "Max Points on a Line", "question__title_slug": "max-points-on-a-line", "question__hide": false, - "total_acs": 337398, - "total_submitted": 1338280, + "total_acs": 338401, + "total_submitted": 1340644, "frontend_question_id": 149, "is_new_question": false }, @@ -57860,8 +58435,8 @@ "question__title": "Sort List", "question__title_slug": "sort-list", "question__hide": false, - "total_acs": 627044, - "total_submitted": 1133884, + "total_acs": 630206, + "total_submitted": 1138390, "frontend_question_id": 148, "is_new_question": false }, @@ -57883,8 +58458,8 @@ "question__title": "Insertion Sort List", "question__title_slug": "insertion-sort-list", "question__hide": false, - "total_acs": 322356, - "total_submitted": 629825, + "total_acs": 323350, + "total_submitted": 631104, "frontend_question_id": 147, "is_new_question": false }, @@ -57906,8 +58481,8 @@ "question__title": "LRU Cache", "question__title_slug": "lru-cache", "question__hide": false, - "total_acs": 1296950, - "total_submitted": 3184773, + "total_acs": 1301754, + "total_submitted": 3195299, "frontend_question_id": 146, "is_new_question": false }, @@ -57929,8 +58504,8 @@ "question__title": "Binary Tree Postorder Traversal", "question__title_slug": "binary-tree-postorder-traversal", "question__hide": false, - "total_acs": 950310, - "total_submitted": 1394349, + "total_acs": 955365, + "total_submitted": 1400356, "frontend_question_id": 145, "is_new_question": false }, @@ -57952,8 +58527,8 @@ "question__title": "Binary Tree Preorder Traversal", "question__title_slug": "binary-tree-preorder-traversal", "question__hide": false, - "total_acs": 1310159, - "total_submitted": 1954856, + "total_acs": 1316384, + "total_submitted": 1962425, "frontend_question_id": 144, "is_new_question": false }, @@ -57975,8 +58550,8 @@ "question__title": "Reorder List", "question__title_slug": "reorder-list", "question__hide": false, - "total_acs": 662818, - "total_submitted": 1256186, + "total_acs": 667021, + "total_submitted": 1261801, "frontend_question_id": 143, "is_new_question": false }, @@ -57998,8 +58573,8 @@ "question__title": "Linked List Cycle II", "question__title_slug": "linked-list-cycle-ii", "question__hide": false, - "total_acs": 1053717, - "total_submitted": 2152568, + "total_acs": 1059875, + "total_submitted": 2162039, "frontend_question_id": 142, "is_new_question": false }, @@ -58021,8 +58596,8 @@ "question__title": "Linked List Cycle", "question__title_slug": "linked-list-cycle", "question__hide": false, - "total_acs": 2026405, - "total_submitted": 4259807, + "total_acs": 2040238, + "total_submitted": 4285351, "frontend_question_id": 141, "is_new_question": false }, @@ -58044,8 +58619,8 @@ "question__title": "Word Break II", "question__title_slug": "word-break-ii", "question__hide": false, - "total_acs": 512546, - "total_submitted": 1129071, + "total_acs": 513791, + "total_submitted": 1130549, "frontend_question_id": 140, "is_new_question": false }, @@ -58067,8 +58642,8 @@ "question__title": "Word Break", "question__title_slug": "word-break", "question__hide": false, - "total_acs": 1323609, - "total_submitted": 2902230, + "total_acs": 1328609, + "total_submitted": 2912111, "frontend_question_id": 139, "is_new_question": false }, @@ -58090,8 +58665,8 @@ "question__title": "Copy List with Random Pointer", "question__title_slug": "copy-list-with-random-pointer", "question__hide": false, - "total_acs": 942915, - "total_submitted": 1831058, + "total_acs": 946360, + "total_submitted": 1835514, "frontend_question_id": 138, "is_new_question": false }, @@ -58113,8 +58688,8 @@ "question__title": "Single Number II", "question__title_slug": "single-number-ii", "question__hide": false, - "total_acs": 410472, - "total_submitted": 700445, + "total_acs": 412352, + "total_submitted": 703117, "frontend_question_id": 137, "is_new_question": false }, @@ -58136,8 +58711,8 @@ "question__title": "Single Number", "question__title_slug": "single-number", "question__hide": false, - "total_acs": 2151414, - "total_submitted": 3038687, + "total_acs": 2164788, + "total_submitted": 3055850, "frontend_question_id": 136, "is_new_question": false }, @@ -58159,8 +58734,8 @@ "question__title": "Candy", "question__title_slug": "candy", "question__hide": false, - "total_acs": 305186, - "total_submitted": 743042, + "total_acs": 306909, + "total_submitted": 746683, "frontend_question_id": 135, "is_new_question": false }, @@ -58182,8 +58757,8 @@ "question__title": "Gas Station", "question__title_slug": "gas-station", "question__hide": false, - "total_acs": 584031, - "total_submitted": 1266810, + "total_acs": 586958, + "total_submitted": 1273153, "frontend_question_id": 134, "is_new_question": false }, @@ -58205,8 +58780,8 @@ "question__title": "Clone Graph", "question__title_slug": "clone-graph", "question__hide": false, - "total_acs": 976965, - "total_submitted": 1836008, + "total_acs": 981010, + "total_submitted": 1840875, "frontend_question_id": 133, "is_new_question": false }, @@ -58228,8 +58803,8 @@ "question__title": "Palindrome Partitioning II", "question__title_slug": "palindrome-partitioning-ii", "question__hide": false, - "total_acs": 240720, - "total_submitted": 712076, + "total_acs": 241396, + "total_submitted": 713917, "frontend_question_id": 132, "is_new_question": false }, @@ -58251,8 +58826,8 @@ "question__title": "Palindrome Partitioning", "question__title_slug": "palindrome-partitioning", "question__hide": false, - "total_acs": 638106, - "total_submitted": 981903, + "total_acs": 641172, + "total_submitted": 985778, "frontend_question_id": 131, "is_new_question": false }, @@ -58274,8 +58849,8 @@ "question__title": "Surrounded Regions", "question__title_slug": "surrounded-regions", "question__hide": false, - "total_acs": 530345, - "total_submitted": 1437310, + "total_acs": 533097, + "total_submitted": 1442826, "frontend_question_id": 130, "is_new_question": false }, @@ -58297,8 +58872,8 @@ "question__title": "Sum Root to Leaf Numbers", "question__title_slug": "sum-root-to-leaf-numbers", "question__hide": false, - "total_acs": 607865, - "total_submitted": 994522, + "total_acs": 609569, + "total_submitted": 996723, "frontend_question_id": 129, "is_new_question": false }, @@ -58320,8 +58895,8 @@ "question__title": "Longest Consecutive Sequence", "question__title_slug": "longest-consecutive-sequence", "question__hide": false, - "total_acs": 1097751, - "total_submitted": 2266705, + "total_acs": 1109408, + "total_submitted": 2292812, "frontend_question_id": 128, "is_new_question": false }, @@ -58343,8 +58918,8 @@ "question__title": "Word Ladder", "question__title_slug": "word-ladder", "question__hide": false, - "total_acs": 905534, - "total_submitted": 2431667, + "total_acs": 908279, + "total_submitted": 2436672, "frontend_question_id": 127, "is_new_question": false }, @@ -58366,8 +58941,8 @@ "question__title": "Word Ladder II", "question__title_slug": "word-ladder-ii", "question__hide": false, - "total_acs": 341192, - "total_submitted": 1241463, + "total_acs": 341859, + "total_submitted": 1243687, "frontend_question_id": 126, "is_new_question": false }, @@ -58389,8 +58964,8 @@ "question__title": "Valid Palindrome", "question__title_slug": "valid-palindrome", "question__hide": false, - "total_acs": 1906630, - "total_submitted": 4285116, + "total_acs": 1926414, + "total_submitted": 4323694, "frontend_question_id": 125, "is_new_question": false }, @@ -58412,8 +58987,8 @@ "question__title": "Binary Tree Maximum Path Sum", "question__title_slug": "binary-tree-maximum-path-sum", "question__hide": false, - "total_acs": 967379, - "total_submitted": 2465013, + "total_acs": 971293, + "total_submitted": 2474298, "frontend_question_id": 124, "is_new_question": false }, @@ -58435,8 +59010,8 @@ "question__title": "Best Time to Buy and Sell Stock III", "question__title_slug": "best-time-to-buy-and-sell-stock-iii", "question__hide": false, - "total_acs": 476021, - "total_submitted": 1043490, + "total_acs": 478064, + "total_submitted": 1047008, "frontend_question_id": 123, "is_new_question": false }, @@ -58458,8 +59033,8 @@ "question__title": "Best Time to Buy and Sell Stock II", "question__title_slug": "best-time-to-buy-and-sell-stock-ii", "question__hide": false, - "total_acs": 1424238, - "total_submitted": 2225761, + "total_acs": 1431597, + "total_submitted": 2235815, "frontend_question_id": 122, "is_new_question": false }, @@ -58481,8 +59056,8 @@ "question__title": "Best Time to Buy and Sell Stock", "question__title_slug": "best-time-to-buy-and-sell-stock", "question__hide": false, - "total_acs": 3282105, - "total_submitted": 6046739, + "total_acs": 3309399, + "total_submitted": 6098441, "frontend_question_id": 121, "is_new_question": false }, @@ -58504,8 +59079,8 @@ "question__title": "Triangle", "question__title_slug": "triangle", "question__hide": false, - "total_acs": 586423, - "total_submitted": 1074368, + "total_acs": 589264, + "total_submitted": 1078855, "frontend_question_id": 120, "is_new_question": false }, @@ -58527,8 +59102,8 @@ "question__title": "Pascal's Triangle II", "question__title_slug": "pascals-triangle-ii", "question__hide": false, - "total_acs": 673537, - "total_submitted": 1105684, + "total_acs": 677042, + "total_submitted": 1110358, "frontend_question_id": 119, "is_new_question": false }, @@ -58550,8 +59125,8 @@ "question__title": "Pascal's Triangle", "question__title_slug": "pascals-triangle", "question__hide": false, - "total_acs": 1211863, - "total_submitted": 1707465, + "total_acs": 1221368, + "total_submitted": 1718750, "frontend_question_id": 118, "is_new_question": false }, @@ -58573,8 +59148,8 @@ "question__title": "Populating Next Right Pointers in Each Node II", "question__title_slug": "populating-next-right-pointers-in-each-node-ii", "question__hide": false, - "total_acs": 544969, - "total_submitted": 1082312, + "total_acs": 546241, + "total_submitted": 1084031, "frontend_question_id": 117, "is_new_question": false }, @@ -58596,8 +59171,8 @@ "question__title": "Populating Next Right Pointers in Each Node", "question__title_slug": "populating-next-right-pointers-in-each-node", "question__hide": false, - "total_acs": 918755, - "total_submitted": 1516959, + "total_acs": 921716, + "total_submitted": 1520365, "frontend_question_id": 116, "is_new_question": false }, @@ -58619,8 +59194,8 @@ "question__title": "Distinct Subsequences", "question__title_slug": "distinct-subsequences", "question__hide": false, - "total_acs": 291142, - "total_submitted": 652525, + "total_acs": 293047, + "total_submitted": 655733, "frontend_question_id": 115, "is_new_question": false }, @@ -58642,8 +59217,8 @@ "question__title": "Flatten Binary Tree to Linked List", "question__title_slug": "flatten-binary-tree-to-linked-list", "question__hide": false, - "total_acs": 769080, - "total_submitted": 1241574, + "total_acs": 771491, + "total_submitted": 1244450, "frontend_question_id": 114, "is_new_question": false }, @@ -58665,8 +59240,8 @@ "question__title": "Path Sum II", "question__title_slug": "path-sum-ii", "question__hide": false, - "total_acs": 741089, - "total_submitted": 1296352, + "total_acs": 743507, + "total_submitted": 1299917, "frontend_question_id": 113, "is_new_question": false }, @@ -58688,8 +59263,8 @@ "question__title": "Path Sum", "question__title_slug": "path-sum", "question__hide": false, - "total_acs": 1164731, - "total_submitted": 2407509, + "total_acs": 1170128, + "total_submitted": 2417052, "frontend_question_id": 112, "is_new_question": false }, @@ -58711,8 +59286,8 @@ "question__title": "Minimum Depth of Binary Tree", "question__title_slug": "minimum-depth-of-binary-tree", "question__hide": false, - "total_acs": 931942, - "total_submitted": 2090331, + "total_acs": 935893, + "total_submitted": 2096851, "frontend_question_id": 111, "is_new_question": false }, @@ -58734,8 +59309,8 @@ "question__title": "Balanced Binary Tree", "question__title_slug": "balanced-binary-tree", "question__hide": false, - "total_acs": 1095545, - "total_submitted": 2226204, + "total_acs": 1103492, + "total_submitted": 2239432, "frontend_question_id": 110, "is_new_question": false }, @@ -58757,8 +59332,8 @@ "question__title": "Convert Sorted List to Binary Search Tree", "question__title_slug": "convert-sorted-list-to-binary-search-tree", "question__hide": false, - "total_acs": 474231, - "total_submitted": 786425, + "total_acs": 475305, + "total_submitted": 787657, "frontend_question_id": 109, "is_new_question": false }, @@ -58780,8 +59355,8 @@ "question__title": "Convert Sorted Array to Binary Search Tree", "question__title_slug": "convert-sorted-array-to-binary-search-tree", "question__hide": false, - "total_acs": 986169, - "total_submitted": 1409661, + "total_acs": 990852, + "total_submitted": 1415522, "frontend_question_id": 108, "is_new_question": false }, @@ -58803,8 +59378,8 @@ "question__title": "Binary Tree Level Order Traversal II", "question__title_slug": "binary-tree-level-order-traversal-ii", "question__hide": false, - "total_acs": 575438, - "total_submitted": 938719, + "total_acs": 576788, + "total_submitted": 940255, "frontend_question_id": 107, "is_new_question": false }, @@ -58826,8 +59401,8 @@ "question__title": "Construct Binary Tree from Inorder and Postorder Traversal", "question__title_slug": "construct-binary-tree-from-inorder-and-postorder-traversal", "question__hide": false, - "total_acs": 523457, - "total_submitted": 870967, + "total_acs": 525224, + "total_submitted": 873182, "frontend_question_id": 106, "is_new_question": false }, @@ -58849,8 +59424,8 @@ "question__title": "Construct Binary Tree from Preorder and Inorder Traversal", "question__title_slug": "construct-binary-tree-from-preorder-and-inorder-traversal", "question__hide": false, - "total_acs": 958747, - "total_submitted": 1554805, + "total_acs": 963735, + "total_submitted": 1561788, "frontend_question_id": 105, "is_new_question": false }, @@ -58872,8 +59447,8 @@ "question__title": "Maximum Depth of Binary Tree", "question__title_slug": "maximum-depth-of-binary-tree", "question__hide": false, - "total_acs": 2311215, - "total_submitted": 3124787, + "total_acs": 2325513, + "total_submitted": 3143180, "frontend_question_id": 104, "is_new_question": false }, @@ -58895,8 +59470,8 @@ "question__title": "Binary Tree Zigzag Level Order Traversal", "question__title_slug": "binary-tree-zigzag-level-order-traversal", "question__hide": false, - "total_acs": 951297, - "total_submitted": 1669110, + "total_acs": 955165, + "total_submitted": 1674721, "frontend_question_id": 103, "is_new_question": false }, @@ -58918,8 +59493,8 @@ "question__title": "Binary Tree Level Order Traversal", "question__title_slug": "binary-tree-level-order-traversal", "question__hide": false, - "total_acs": 1764526, - "total_submitted": 2734904, + "total_acs": 1774501, + "total_submitted": 2747688, "frontend_question_id": 102, "is_new_question": false }, @@ -58941,8 +59516,8 @@ "question__title": "Symmetric Tree", "question__title_slug": "symmetric-tree", "question__hide": false, - "total_acs": 1628172, - "total_submitted": 2990905, + "total_acs": 1635829, + "total_submitted": 3002734, "frontend_question_id": 101, "is_new_question": false }, @@ -58964,8 +59539,8 @@ "question__title": "Same Tree", "question__title_slug": "same-tree", "question__hide": false, - "total_acs": 1512490, - "total_submitted": 2593495, + "total_acs": 1522547, + "total_submitted": 2608306, "frontend_question_id": 100, "is_new_question": false }, @@ -58987,8 +59562,8 @@ "question__title": "Recover Binary Search Tree", "question__title_slug": "recover-binary-search-tree", "question__hide": false, - "total_acs": 391734, - "total_submitted": 766158, + "total_acs": 392946, + "total_submitted": 767864, "frontend_question_id": 99, "is_new_question": false }, @@ -59010,8 +59585,8 @@ "question__title": "Validate Binary Search Tree", "question__title_slug": "validate-binary-search-tree", "question__hide": false, - "total_acs": 1907621, - "total_submitted": 5953692, + "total_acs": 1916558, + "total_submitted": 5977971, "frontend_question_id": 98, "is_new_question": false }, @@ -59033,8 +59608,8 @@ "question__title": "Interleaving String", "question__title_slug": "interleaving-string", "question__hide": false, - "total_acs": 374810, - "total_submitted": 1002807, + "total_acs": 376228, + "total_submitted": 1006060, "frontend_question_id": 97, "is_new_question": false }, @@ -59056,8 +59631,8 @@ "question__title": "Unique Binary Search Trees", "question__title_slug": "unique-binary-search-trees", "question__hide": false, - "total_acs": 569012, - "total_submitted": 952362, + "total_acs": 570875, + "total_submitted": 954969, "frontend_question_id": 96, "is_new_question": false }, @@ -59079,8 +59654,8 @@ "question__title": "Unique Binary Search Trees II", "question__title_slug": "unique-binary-search-trees-ii", "question__hide": false, - "total_acs": 352193, - "total_submitted": 670461, + "total_acs": 353090, + "total_submitted": 671497, "frontend_question_id": 95, "is_new_question": false }, @@ -59102,8 +59677,8 @@ "question__title": "Binary Tree Inorder Traversal", "question__title_slug": "binary-tree-inorder-traversal", "question__hide": false, - "total_acs": 1986665, - "total_submitted": 2687511, + "total_acs": 1997037, + "total_submitted": 2699961, "frontend_question_id": 94, "is_new_question": false }, @@ -59125,8 +59700,8 @@ "question__title": "Restore IP Addresses", "question__title_slug": "restore-ip-addresses", "question__hide": false, - "total_acs": 400593, - "total_submitted": 842084, + "total_acs": 401816, + "total_submitted": 843647, "frontend_question_id": 93, "is_new_question": false }, @@ -59148,8 +59723,8 @@ "question__title": "Reverse Linked List II", "question__title_slug": "reverse-linked-list-ii", "question__hide": false, - "total_acs": 629251, - "total_submitted": 1384480, + "total_acs": 631918, + "total_submitted": 1390331, "frontend_question_id": 92, "is_new_question": false }, @@ -59171,8 +59746,8 @@ "question__title": "Decode Ways", "question__title_slug": "decode-ways", "question__hide": false, - "total_acs": 1006334, - "total_submitted": 3067651, + "total_acs": 1010061, + "total_submitted": 3076273, "frontend_question_id": 91, "is_new_question": false }, @@ -59194,8 +59769,8 @@ "question__title": "Subsets II", "question__title_slug": "subsets-ii", "question__hide": false, - "total_acs": 694133, - "total_submitted": 1240399, + "total_acs": 698256, + "total_submitted": 1246952, "frontend_question_id": 90, "is_new_question": false }, @@ -59217,8 +59792,8 @@ "question__title": "Gray Code", "question__title_slug": "gray-code", "question__hide": false, - "total_acs": 261798, - "total_submitted": 456909, + "total_acs": 262488, + "total_submitted": 457824, "frontend_question_id": 89, "is_new_question": false }, @@ -59240,8 +59815,8 @@ "question__title": "Merge Sorted Array", "question__title_slug": "merge-sorted-array", "question__hide": false, - "total_acs": 1986441, - "total_submitted": 4247184, + "total_acs": 2005411, + "total_submitted": 4281953, "frontend_question_id": 88, "is_new_question": false }, @@ -59263,8 +59838,8 @@ "question__title": "Scramble String", "question__title_slug": "scramble-string", "question__hide": false, - "total_acs": 203225, - "total_submitted": 520570, + "total_acs": 203735, + "total_submitted": 521651, "frontend_question_id": 87, "is_new_question": false }, @@ -59286,8 +59861,8 @@ "question__title": "Partition List", "question__title_slug": "partition-list", "question__hide": false, - "total_acs": 447737, - "total_submitted": 859632, + "total_acs": 449264, + "total_submitted": 861842, "frontend_question_id": 86, "is_new_question": false }, @@ -59309,8 +59884,8 @@ "question__title": "Maximal Rectangle", "question__title_slug": "maximal-rectangle", "question__hide": false, - "total_acs": 343153, - "total_submitted": 764808, + "total_acs": 344282, + "total_submitted": 766492, "frontend_question_id": 85, "is_new_question": false }, @@ -59332,8 +59907,8 @@ "question__title": "Largest Rectangle in Histogram", "question__title_slug": "largest-rectangle-in-histogram", "question__hide": false, - "total_acs": 663184, - "total_submitted": 1553762, + "total_acs": 666871, + "total_submitted": 1561342, "frontend_question_id": 84, "is_new_question": false }, @@ -59355,8 +59930,8 @@ "question__title": "Remove Duplicates from Sorted List", "question__title_slug": "remove-duplicates-from-sorted-list", "question__hide": false, - "total_acs": 1169025, - "total_submitted": 2304468, + "total_acs": 1176648, + "total_submitted": 2317962, "frontend_question_id": 83, "is_new_question": false }, @@ -59378,8 +59953,8 @@ "question__title": "Remove Duplicates from Sorted List II", "question__title_slug": "remove-duplicates-from-sorted-list-ii", "question__hide": false, - "total_acs": 597988, - "total_submitted": 1300380, + "total_acs": 600458, + "total_submitted": 1304874, "frontend_question_id": 82, "is_new_question": false }, @@ -59401,8 +59976,8 @@ "question__title": "Search in Rotated Sorted Array II", "question__title_slug": "search-in-rotated-sorted-array-ii", "question__hide": false, - "total_acs": 508715, - "total_submitted": 1424349, + "total_acs": 510925, + "total_submitted": 1430524, "frontend_question_id": 81, "is_new_question": false }, @@ -59424,8 +59999,8 @@ "question__title": "Remove Duplicates from Sorted Array II", "question__title_slug": "remove-duplicates-from-sorted-array-ii", "question__hide": false, - "total_acs": 503003, - "total_submitted": 958494, + "total_acs": 508527, + "total_submitted": 966803, "frontend_question_id": 80, "is_new_question": false }, @@ -59447,8 +60022,8 @@ "question__title": "Word Search", "question__title_slug": "word-search", "question__hide": false, - "total_acs": 1266865, - "total_submitted": 3144603, + "total_acs": 1272214, + "total_submitted": 3156602, "frontend_question_id": 79, "is_new_question": false }, @@ -59470,8 +60045,8 @@ "question__title": "Subsets", "question__title_slug": "subsets", "question__hide": false, - "total_acs": 1431842, - "total_submitted": 1907718, + "total_acs": 1440217, + "total_submitted": 1917308, "frontend_question_id": 78, "is_new_question": false }, @@ -59493,8 +60068,8 @@ "question__title": "Combinations", "question__title_slug": "combinations", "question__hide": false, - "total_acs": 662208, - "total_submitted": 986836, + "total_acs": 665315, + "total_submitted": 990584, "frontend_question_id": 77, "is_new_question": false }, @@ -59516,8 +60091,8 @@ "question__title": "Minimum Window Substring", "question__title_slug": "minimum-window-substring", "question__hide": false, - "total_acs": 998864, - "total_submitted": 2440171, + "total_acs": 1003393, + "total_submitted": 2450398, "frontend_question_id": 76, "is_new_question": false }, @@ -59539,8 +60114,8 @@ "question__title": "Sort Colors", "question__title_slug": "sort-colors", "question__hide": false, - "total_acs": 1411266, - "total_submitted": 2400787, + "total_acs": 1421100, + "total_submitted": 2414229, "frontend_question_id": 75, "is_new_question": false }, @@ -59562,8 +60137,8 @@ "question__title": "Search a 2D Matrix", "question__title_slug": "search-a-2d-matrix", "question__hide": false, - "total_acs": 1206345, - "total_submitted": 2521233, + "total_acs": 1216358, + "total_submitted": 2539871, "frontend_question_id": 74, "is_new_question": false }, @@ -59585,8 +60160,8 @@ "question__title": "Set Matrix Zeroes", "question__title_slug": "set-matrix-zeroes", "question__hide": false, - "total_acs": 976218, - "total_submitted": 1896687, + "total_acs": 984018, + "total_submitted": 1908091, "frontend_question_id": 73, "is_new_question": false }, @@ -59608,8 +60183,8 @@ "question__title": "Edit Distance", "question__title_slug": "edit-distance", "question__hide": false, - "total_acs": 642696, - "total_submitted": 1178742, + "total_acs": 645864, + "total_submitted": 1183469, "frontend_question_id": 72, "is_new_question": false }, @@ -59631,8 +60206,8 @@ "question__title": "Simplify Path", "question__title_slug": "simplify-path", "question__hide": false, - "total_acs": 559209, - "total_submitted": 1377287, + "total_acs": 561412, + "total_submitted": 1382516, "frontend_question_id": 71, "is_new_question": false }, @@ -59654,8 +60229,8 @@ "question__title": "Climbing Stairs", "question__title_slug": "climbing-stairs", "question__hide": false, - "total_acs": 2333047, - "total_submitted": 4468819, + "total_acs": 2352228, + "total_submitted": 4504118, "frontend_question_id": 70, "is_new_question": false }, @@ -59677,8 +60252,8 @@ "question__title": "Sqrt(x)", "question__title_slug": "sqrtx", "question__hide": false, - "total_acs": 1451367, - "total_submitted": 3871375, + "total_acs": 1462380, + "total_submitted": 3898700, "frontend_question_id": 69, "is_new_question": false }, @@ -59700,8 +60275,8 @@ "question__title": "Text Justification", "question__title_slug": "text-justification", "question__hide": false, - "total_acs": 291402, - "total_submitted": 776621, + "total_acs": 292417, + "total_submitted": 778149, "frontend_question_id": 68, "is_new_question": false }, @@ -59723,8 +60298,8 @@ "question__title": "Add Binary", "question__title_slug": "add-binary", "question__hide": false, - "total_acs": 1138473, - "total_submitted": 2171783, + "total_acs": 1145005, + "total_submitted": 2183671, "frontend_question_id": 67, "is_new_question": false }, @@ -59746,8 +60321,8 @@ "question__title": "Plus One", "question__title_slug": "plus-one", "question__hide": false, - "total_acs": 1660147, - "total_submitted": 3795405, + "total_acs": 1673902, + "total_submitted": 3825953, "frontend_question_id": 66, "is_new_question": false }, @@ -59769,8 +60344,8 @@ "question__title": "Valid Number", "question__title_slug": "valid-number", "question__hide": false, - "total_acs": 304110, - "total_submitted": 1623011, + "total_acs": 304877, + "total_submitted": 1625782, "frontend_question_id": 65, "is_new_question": false }, @@ -59792,8 +60367,8 @@ "question__title": "Minimum Path Sum", "question__title_slug": "minimum-path-sum", "question__hide": false, - "total_acs": 932321, - "total_submitted": 1502456, + "total_acs": 936551, + "total_submitted": 1508392, "frontend_question_id": 64, "is_new_question": false }, @@ -59815,8 +60390,8 @@ "question__title": "Unique Paths II", "question__title_slug": "unique-paths-ii", "question__hide": false, - "total_acs": 675307, - "total_submitted": 1711093, + "total_acs": 678734, + "total_submitted": 1718840, "frontend_question_id": 63, "is_new_question": false }, @@ -59838,8 +60413,8 @@ "question__title": "Unique Paths", "question__title_slug": "unique-paths", "question__hide": false, - "total_acs": 1363386, - "total_submitted": 2173440, + "total_acs": 1371780, + "total_submitted": 2186043, "frontend_question_id": 62, "is_new_question": false }, @@ -59861,8 +60436,8 @@ "question__title": "Rotate List", "question__title_slug": "rotate-list", "question__hide": false, - "total_acs": 713852, - "total_submitted": 1975006, + "total_acs": 717726, + "total_submitted": 1984456, "frontend_question_id": 61, "is_new_question": false }, @@ -59884,8 +60459,8 @@ "question__title": "Permutation Sequence", "question__title_slug": "permutation-sequence", "question__hide": false, - "total_acs": 324580, - "total_submitted": 729797, + "total_acs": 326130, + "total_submitted": 732306, "frontend_question_id": 60, "is_new_question": false }, @@ -59907,8 +60482,8 @@ "question__title": "Spiral Matrix II", "question__title_slug": "spiral-matrix-ii", "question__hide": false, - "total_acs": 435792, - "total_submitted": 645361, + "total_acs": 492977, + "total_submitted": 708425, "frontend_question_id": 59, "is_new_question": false }, @@ -59930,8 +60505,8 @@ "question__title": "Length of Last Word", "question__title_slug": "length-of-last-word", "question__hide": false, - "total_acs": 1111060, - "total_submitted": 2567317, + "total_acs": 1124366, + "total_submitted": 2588217, "frontend_question_id": 58, "is_new_question": false }, @@ -59953,8 +60528,8 @@ "question__title": "Insert Interval", "question__title_slug": "insert-interval", "question__hide": false, - "total_acs": 756078, - "total_submitted": 1934369, + "total_acs": 760428, + "total_submitted": 1944527, "frontend_question_id": 57, "is_new_question": false }, @@ -59976,8 +60551,8 @@ "question__title": "Merge Intervals", "question__title_slug": "merge-intervals", "question__hide": false, - "total_acs": 1862836, - "total_submitted": 4030220, + "total_acs": 1872340, + "total_submitted": 4049052, "frontend_question_id": 56, "is_new_question": false }, @@ -59999,8 +60574,8 @@ "question__title": "Jump Game", "question__title_slug": "jump-game", "question__hide": false, - "total_acs": 1372818, - "total_submitted": 3525990, + "total_acs": 1381015, + "total_submitted": 3547279, "frontend_question_id": 55, "is_new_question": false }, @@ -60022,8 +60597,8 @@ "question__title": "Spiral Matrix", "question__title_slug": "spiral-matrix", "question__hide": false, - "total_acs": 1015011, - "total_submitted": 2246555, + "total_acs": 1080047, + "total_submitted": 2335398, "frontend_question_id": 54, "is_new_question": false }, @@ -60045,8 +60620,8 @@ "question__title": "Maximum Subarray", "question__title_slug": "maximum-subarray", "question__hide": false, - "total_acs": 3131148, - "total_submitted": 6239378, + "total_acs": 3147246, + "total_submitted": 6270106, "frontend_question_id": 53, "is_new_question": false }, @@ -60068,8 +60643,8 @@ "question__title": "N-Queens II", "question__title_slug": "n-queens-ii", "question__hide": false, - "total_acs": 308069, - "total_submitted": 429630, + "total_acs": 309444, + "total_submitted": 431197, "frontend_question_id": 52, "is_new_question": false }, @@ -60091,8 +60666,8 @@ "question__title": "N-Queens", "question__title_slug": "n-queens", "question__hide": false, - "total_acs": 537941, - "total_submitted": 835222, + "total_acs": 541238, + "total_submitted": 839143, "frontend_question_id": 51, "is_new_question": false }, @@ -60108,14 +60683,14 @@ { "stat": { "question_id": 50, - "question__article__live": true, - "question__article__slug": "powx-n", - "question__article__has_video_solution": false, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, "question__title": "Pow(x, n)", "question__title_slug": "powx-n", "question__hide": false, - "total_acs": 1189951, - "total_submitted": 3595285, + "total_acs": 1197067, + "total_submitted": 3614874, "frontend_question_id": 50, "is_new_question": false }, @@ -60137,8 +60712,8 @@ "question__title": "Group Anagrams", "question__title_slug": "group-anagrams", "question__hide": false, - "total_acs": 1936021, - "total_submitted": 2897724, + "total_acs": 1955026, + "total_submitted": 2926571, "frontend_question_id": 49, "is_new_question": false }, @@ -60160,8 +60735,8 @@ "question__title": "Rotate Image", "question__title_slug": "rotate-image", "question__hide": false, - "total_acs": 1268046, - "total_submitted": 1781605, + "total_acs": 1276764, + "total_submitted": 1792321, "frontend_question_id": 48, "is_new_question": false }, @@ -60183,8 +60758,8 @@ "question__title": "Permutations II", "question__title_slug": "permutations-ii", "question__hide": false, - "total_acs": 781242, - "total_submitted": 1359812, + "total_acs": 784285, + "total_submitted": 1364228, "frontend_question_id": 47, "is_new_question": false }, @@ -60206,8 +60781,8 @@ "question__title": "Permutations", "question__title_slug": "permutations", "question__hide": false, - "total_acs": 1564351, - "total_submitted": 2063692, + "total_acs": 1573491, + "total_submitted": 2074707, "frontend_question_id": 46, "is_new_question": false }, @@ -60229,8 +60804,8 @@ "question__title": "Jump Game II", "question__title_slug": "jump-game-ii", "question__hide": false, - "total_acs": 881420, - "total_submitted": 2209699, + "total_acs": 886581, + "total_submitted": 2221997, "frontend_question_id": 45, "is_new_question": false }, @@ -60252,8 +60827,8 @@ "question__title": "Wildcard Matching", "question__title_slug": "wildcard-matching", "question__hide": false, - "total_acs": 469928, - "total_submitted": 1742019, + "total_acs": 472024, + "total_submitted": 1749039, "frontend_question_id": 44, "is_new_question": false }, @@ -60275,8 +60850,8 @@ "question__title": "Multiply Strings", "question__title_slug": "multiply-strings", "question__hide": false, - "total_acs": 658193, - "total_submitted": 1677102, + "total_acs": 661523, + "total_submitted": 1685510, "frontend_question_id": 43, "is_new_question": false }, @@ -60298,8 +60873,8 @@ "question__title": "Trapping Rain Water", "question__title_slug": "trapping-rain-water", "question__hide": false, - "total_acs": 1509294, - "total_submitted": 2544523, + "total_acs": 1518054, + "total_submitted": 2558358, "frontend_question_id": 42, "is_new_question": false }, @@ -60321,8 +60896,8 @@ "question__title": "First Missing Positive", "question__title_slug": "first-missing-positive", "question__hide": false, - "total_acs": 872806, - "total_submitted": 2372917, + "total_acs": 877643, + "total_submitted": 2384634, "frontend_question_id": 41, "is_new_question": false }, @@ -60344,8 +60919,8 @@ "question__title": "Combination Sum II", "question__title_slug": "combination-sum-ii", "question__hide": false, - "total_acs": 737402, - "total_submitted": 1380083, + "total_acs": 741556, + "total_submitted": 1387447, "frontend_question_id": 40, "is_new_question": false }, @@ -60367,8 +60942,8 @@ "question__title": "Combination Sum", "question__title_slug": "combination-sum", "question__hide": false, - "total_acs": 1453771, - "total_submitted": 2114489, + "total_acs": 1462149, + "total_submitted": 2124918, "frontend_question_id": 39, "is_new_question": false }, @@ -60390,8 +60965,8 @@ "question__title": "Count and Say", "question__title_slug": "count-and-say", "question__hide": false, - "total_acs": 783205, - "total_submitted": 1498547, + "total_acs": 786062, + "total_submitted": 1502282, "frontend_question_id": 38, "is_new_question": false }, @@ -60413,8 +60988,8 @@ "question__title": "Sudoku Solver", "question__title_slug": "sudoku-solver", "question__hide": false, - "total_acs": 456009, - "total_submitted": 787754, + "total_acs": 458458, + "total_submitted": 791155, "frontend_question_id": 37, "is_new_question": false }, @@ -60436,8 +61011,8 @@ "question__title": "Valid Sudoku", "question__title_slug": "valid-sudoku", "question__hide": false, - "total_acs": 1081249, - "total_submitted": 1858691, + "total_acs": 1091075, + "total_submitted": 1874280, "frontend_question_id": 36, "is_new_question": false }, @@ -60459,8 +61034,8 @@ "question__title": "Search Insert Position", "question__title_slug": "search-insert-position", "question__hide": false, - "total_acs": 2168678, - "total_submitted": 4981187, + "total_acs": 2185349, + "total_submitted": 5013774, "frontend_question_id": 35, "is_new_question": false }, @@ -60482,8 +61057,8 @@ "question__title": "Find First and Last Position of Element in Sorted Array", "question__title_slug": "find-first-and-last-position-of-element-in-sorted-array", "question__hide": false, - "total_acs": 1519927, - "total_submitted": 3623241, + "total_acs": 1528652, + "total_submitted": 3641528, "frontend_question_id": 34, "is_new_question": false }, @@ -60505,8 +61080,8 @@ "question__title": "Search in Rotated Sorted Array", "question__title_slug": "search-in-rotated-sorted-array", "question__hide": false, - "total_acs": 2013160, - "total_submitted": 5155344, + "total_acs": 2025298, + "total_submitted": 5184290, "frontend_question_id": 33, "is_new_question": false }, @@ -60528,8 +61103,8 @@ "question__title": "Longest Valid Parentheses", "question__title_slug": "longest-valid-parentheses", "question__hide": false, - "total_acs": 614477, - "total_submitted": 1869759, + "total_acs": 617038, + "total_submitted": 1876431, "frontend_question_id": 32, "is_new_question": false }, @@ -60551,8 +61126,8 @@ "question__title": "Next Permutation", "question__title_slug": "next-permutation", "question__hide": false, - "total_acs": 1029335, - "total_submitted": 2733189, + "total_acs": 1034694, + "total_submitted": 2744601, "frontend_question_id": 31, "is_new_question": false }, @@ -60574,8 +61149,8 @@ "question__title": "Substring with Concatenation of All Words", "question__title_slug": "substring-with-concatenation-of-all-words", "question__hide": false, - "total_acs": 344410, - "total_submitted": 1100890, + "total_acs": 346027, + "total_submitted": 1104536, "frontend_question_id": 30, "is_new_question": false }, @@ -60597,8 +61172,8 @@ "question__title": "Divide Two Integers", "question__title_slug": "divide-two-integers", "question__hide": false, - "total_acs": 602727, - "total_submitted": 3518895, + "total_acs": 605872, + "total_submitted": 3538354, "frontend_question_id": 29, "is_new_question": false }, @@ -60620,8 +61195,8 @@ "question__title": "Find the Index of the First Occurrence in a String", "question__title_slug": "find-the-index-of-the-first-occurrence-in-a-string", "question__hide": false, - "total_acs": 1708810, - "total_submitted": 4351709, + "total_acs": 1725836, + "total_submitted": 4385238, "frontend_question_id": 28, "is_new_question": false }, @@ -60643,8 +61218,8 @@ "question__title": "Remove Element", "question__title_slug": "remove-element", "question__hide": false, - "total_acs": 1770216, - "total_submitted": 3328414, + "total_acs": 1790092, + "total_submitted": 3360378, "frontend_question_id": 27, "is_new_question": false }, @@ -60666,8 +61241,8 @@ "question__title": "Remove Duplicates from Sorted Array", "question__title_slug": "remove-duplicates-from-sorted-array", "question__hide": false, - "total_acs": 2940946, - "total_submitted": 5687648, + "total_acs": 2966747, + "total_submitted": 5728536, "frontend_question_id": 26, "is_new_question": false }, @@ -60689,8 +61264,8 @@ "question__title": "Reverse Nodes in k-Group", "question__title_slug": "reverse-nodes-in-k-group", "question__hide": false, - "total_acs": 686712, - "total_submitted": 1251726, + "total_acs": 691158, + "total_submitted": 1257889, "frontend_question_id": 25, "is_new_question": false }, @@ -60712,8 +61287,8 @@ "question__title": "Swap Nodes in Pairs", "question__title_slug": "swap-nodes-in-pairs", "question__hide": false, - "total_acs": 1085969, - "total_submitted": 1766678, + "total_acs": 1091272, + "total_submitted": 1773766, "frontend_question_id": 24, "is_new_question": false }, @@ -60735,8 +61310,8 @@ "question__title": "Merge k Sorted Lists", "question__title_slug": "merge-k-sorted-lists", "question__hide": false, - "total_acs": 1624436, - "total_submitted": 3252653, + "total_acs": 1631646, + "total_submitted": 3263541, "frontend_question_id": 23, "is_new_question": false }, @@ -60758,8 +61333,8 @@ "question__title": "Generate Parentheses", "question__title_slug": "generate-parentheses", "question__hide": false, - "total_acs": 1388815, - "total_submitted": 1912473, + "total_acs": 1397675, + "total_submitted": 1923572, "frontend_question_id": 22, "is_new_question": false }, @@ -60781,8 +61356,8 @@ "question__title": "Merge Two Sorted Lists", "question__title_slug": "merge-two-sorted-lists", "question__hide": false, - "total_acs": 3181276, - "total_submitted": 5079577, + "total_acs": 3205835, + "total_submitted": 5116218, "frontend_question_id": 21, "is_new_question": false }, @@ -60804,8 +61379,8 @@ "question__title": "Valid Parentheses", "question__title_slug": "valid-parentheses", "question__hide": false, - "total_acs": 3288787, - "total_submitted": 8127675, + "total_acs": 3317305, + "total_submitted": 8205753, "frontend_question_id": 20, "is_new_question": false }, @@ -60827,8 +61402,8 @@ "question__title": "Remove Nth Node From End of List", "question__title_slug": "remove-nth-node-from-end-of-list", "question__hide": false, - "total_acs": 1997462, - "total_submitted": 4841503, + "total_acs": 2010716, + "total_submitted": 4864745, "frontend_question_id": 19, "is_new_question": false }, @@ -60850,8 +61425,8 @@ "question__title": "4Sum", "question__title_slug": "4sum", "question__hide": false, - "total_acs": 733473, - "total_submitted": 2045127, + "total_acs": 737695, + "total_submitted": 2057365, "frontend_question_id": 18, "is_new_question": false }, @@ -60873,8 +61448,8 @@ "question__title": "Letter Combinations of a Phone Number", "question__title_slug": "letter-combinations-of-a-phone-number", "question__hide": false, - "total_acs": 1539621, - "total_submitted": 2715010, + "total_acs": 1547731, + "total_submitted": 2726340, "frontend_question_id": 17, "is_new_question": false }, @@ -60896,8 +61471,8 @@ "question__title": "3Sum Closest", "question__title_slug": "3sum-closest", "question__hide": false, - "total_acs": 1023901, - "total_submitted": 2241048, + "total_acs": 1028518, + "total_submitted": 2252494, "frontend_question_id": 16, "is_new_question": false }, @@ -60919,8 +61494,8 @@ "question__title": "3Sum", "question__title_slug": "3sum", "question__hide": false, - "total_acs": 2623210, - "total_submitted": 8034465, + "total_acs": 2640633, + "total_submitted": 8083155, "frontend_question_id": 15, "is_new_question": false }, @@ -60942,8 +61517,8 @@ "question__title": "Longest Common Prefix", "question__title_slug": "longest-common-prefix", "question__hide": false, - "total_acs": 2343086, - "total_submitted": 5725540, + "total_acs": 2368811, + "total_submitted": 5787027, "frontend_question_id": 14, "is_new_question": false }, @@ -60965,8 +61540,8 @@ "question__title": "Roman to Integer", "question__title_slug": "roman-to-integer", "question__hide": false, - "total_acs": 2603548, - "total_submitted": 4440919, + "total_acs": 2639629, + "total_submitted": 4502183, "frontend_question_id": 13, "is_new_question": false }, @@ -60988,8 +61563,8 @@ "question__title": "Integer to Roman", "question__title_slug": "integer-to-roman", "question__hide": false, - "total_acs": 979542, - "total_submitted": 1576567, + "total_acs": 985504, + "total_submitted": 1584981, "frontend_question_id": 12, "is_new_question": false }, @@ -61011,8 +61586,8 @@ "question__title": "Container With Most Water", "question__title_slug": "container-with-most-water", "question__hide": false, - "total_acs": 2070637, - "total_submitted": 3835757, + "total_acs": 2087163, + "total_submitted": 3866980, "frontend_question_id": 11, "is_new_question": false }, @@ -61034,8 +61609,8 @@ "question__title": "Regular Expression Matching", "question__title_slug": "regular-expression-matching", "question__hide": false, - "total_acs": 809266, - "total_submitted": 2888960, + "total_acs": 812894, + "total_submitted": 2902057, "frontend_question_id": 10, "is_new_question": false }, @@ -61057,8 +61632,8 @@ "question__title": "Palindrome Number", "question__title_slug": "palindrome-number", "question__hide": false, - "total_acs": 3136960, - "total_submitted": 5847264, + "total_acs": 3173450, + "total_submitted": 5910189, "frontend_question_id": 9, "is_new_question": false }, @@ -61080,8 +61655,8 @@ "question__title": "String to Integer (atoi)", "question__title_slug": "string-to-integer-atoi", "question__hide": false, - "total_acs": 1240491, - "total_submitted": 7460201, + "total_acs": 1246782, + "total_submitted": 7496153, "frontend_question_id": 8, "is_new_question": false }, @@ -61103,8 +61678,8 @@ "question__title": "Reverse Integer", "question__title_slug": "reverse-integer", "question__hide": false, - "total_acs": 2566214, - "total_submitted": 9334100, + "total_acs": 2581468, + "total_submitted": 9381826, "frontend_question_id": 7, "is_new_question": false }, @@ -61126,8 +61701,8 @@ "question__title": "Zigzag Conversion", "question__title_slug": "zigzag-conversion", "question__hide": false, - "total_acs": 1018483, - "total_submitted": 2263165, + "total_acs": 1024430, + "total_submitted": 2273750, "frontend_question_id": 6, "is_new_question": false }, @@ -61149,8 +61724,8 @@ "question__title": "Longest Palindromic Substring", "question__title_slug": "longest-palindromic-substring", "question__hide": false, - "total_acs": 2387069, - "total_submitted": 7360968, + "total_acs": 2400263, + "total_submitted": 7401029, "frontend_question_id": 5, "is_new_question": false }, @@ -61172,8 +61747,8 @@ "question__title": "Median of Two Sorted Arrays", "question__title_slug": "median-of-two-sorted-arrays", "question__hide": false, - "total_acs": 1886341, - "total_submitted": 5188055, + "total_acs": 1900933, + "total_submitted": 5218570, "frontend_question_id": 4, "is_new_question": false }, @@ -61195,8 +61770,8 @@ "question__title": "Longest Substring Without Repeating Characters", "question__title_slug": "longest-substring-without-repeating-characters", "question__hide": false, - "total_acs": 4449305, - "total_submitted": 13145946, + "total_acs": 4477355, + "total_submitted": 13228333, "frontend_question_id": 3, "is_new_question": false }, @@ -61218,8 +61793,8 @@ "question__title": "Add Two Numbers", "question__title_slug": "add-two-numbers", "question__hide": false, - "total_acs": 3579562, - "total_submitted": 8846816, + "total_acs": 3602994, + "total_submitted": 8895938, "frontend_question_id": 2, "is_new_question": false }, @@ -61241,8 +61816,8 @@ "question__title": "Two Sum", "question__title_slug": "two-sum", "question__hide": false, - "total_acs": 9519254, - "total_submitted": 19110531, + "total_acs": 9613575, + "total_submitted": 19279415, "frontend_question_id": 1, "is_new_question": false }, diff --git a/leetcode/originData/[no content]bikes-last-time-used.json b/leetcode/originData/[no content]bikes-last-time-used.json new file mode 100644 index 00000000..a2386402 --- /dev/null +++ b/leetcode/originData/[no content]bikes-last-time-used.json @@ -0,0 +1,52 @@ +{ + "data": { + "question": { + "questionId": "2841", + "questionFrontendId": "2687", + "boundTopicId": null, + "title": "Bikes Last Time Used ", + "titleSlug": "bikes-last-time-used", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Easy", + "likes": 3, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": null, + "categoryTitle": "Database", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"73\", \"totalSubmission\": \"96\", \"totalAcceptedRaw\": 73, \"totalSubmissionRaw\": 96, \"acRate\": \"76.0%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\":{\"Bikes\":[\"ride_id\",\"bike_number\",\"start_time\",\"end_time\"]},\"rows\":{\"Bikes\":[[1,\"W00576\",\"2012-03-25 11:30:00\",\"2012-03-25 12:40:00\"],[2,\"W00300\",\"2012-03-25 10:30:00\",\"2012-03-25 10:50:00\"],[3,\"W00455\",\"2012-03-26 14:30:00\",\"2012-03-26 17:40:00\"],[4,\"W00455\",\"2012-03-25 12:30:00\",\"2012-03-25 13:40:00\"],[5,\"W00576\",\"2012-03-25 08:10:00\",\"2012-03-25 09:10:00\"],[6,\"W00576\",\"2012-03-28 02:30:00\",\"2012-03-28 02:50:00\"]]}}", + "metaData": "{\n \"mysql\": [\n \"Create table If Not Exists Bikes (ride_id int,bike_number varchar(100), start_time datetime,end_time datetime)\"\n ],\n \"mssql\": [\n \"Create table Bikes (ride_id int,bike_number varchar(100), start_time datetime,end_time datetime)\"\n ],\n \"oraclesql\": [\n \"Create table Bikes (ride_id int,bike_number varchar(100), start_time date,end_time date)\",\n \"ALTER SESSION SET nls_date_format='YYYY-MM-DD HH24:MI:SS'\"\n ],\n \"database\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "Create table If Not Exists Bikes (ride_id int,bike_number varchar(100), start_time datetime,end_time datetime)", + "Truncate table Bikes", + "insert into Bikes (ride_id, bike_number, start_time, end_time) values ('1', 'W00576', '2012-03-25 11:30:00', '2012-03-25 12:40:00')", + "insert into Bikes (ride_id, bike_number, start_time, end_time) values ('2', 'W00300', '2012-03-25 10:30:00', '2012-03-25 10:50:00')", + "insert into Bikes (ride_id, bike_number, start_time, end_time) values ('3', 'W00455', '2012-03-26 14:30:00', '2012-03-26 17:40:00')", + "insert into Bikes (ride_id, bike_number, start_time, end_time) values ('4', 'W00455', '2012-03-25 12:30:00', '2012-03-25 13:40:00')", + "insert into Bikes (ride_id, bike_number, start_time, end_time) values ('5', 'W00576', '2012-03-25 08:10:00', '2012-03-25 09:10:00')", + "insert into Bikes (ride_id, bike_number, start_time, end_time) values ('6', 'W00576', '2012-03-28 02:30:00', '2012-03-28 02:50:00')" + ], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": false, + "envInfo": "{\"mysql\": [\"MySQL\", \"

MySQL 8.0.

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

mssql server 2019.

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

Oracle Sql 11.2.

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]count-artist-occurrences-on-spotify-ranking-list.json b/leetcode/originData/[no content]count-artist-occurrences-on-spotify-ranking-list.json new file mode 100644 index 00000000..3384ff0b --- /dev/null +++ b/leetcode/originData/[no content]count-artist-occurrences-on-spotify-ranking-list.json @@ -0,0 +1,58 @@ +{ + "data": { + "question": { + "questionId": "2830", + "questionFrontendId": "2669", + "boundTopicId": null, + "title": "Count Artist Occurrences On Spotify Ranking List", + "titleSlug": "count-artist-occurrences-on-spotify-ranking-list", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Easy", + "likes": 5, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": null, + "categoryTitle": "Database", + "contributors": [], + "topicTags": [ + { + "name": "Database", + "slug": "database", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"183\", \"totalSubmission\": \"333\", \"totalAcceptedRaw\": 183, \"totalSubmissionRaw\": 333, \"acRate\": \"55.0%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\":{\"Spotify\":[\"id\",\"track_name\",\"artist\"]},\"rows\":{\"Spotify\":[[303651,\"Heart Won't Forget\",\"Ed Sheeran\"],[1046089,\"Shape of you\",\"Sia\"],[33445,\"I'm the one\",\"DJ Khalid\"],[811266,\"Young Dumb & Broke\",\"DJ Khalid\"],[505727,\"Happier\",\"Ed Sheeran\"]]}}", + "metaData": "{\n \"mysql\": [\n \"Create table If Not Exists Spotify (id int,track_name varchar(100),artist varchar(100))\"\n ],\n \"mssql\": [\n \"Create table Spotify (id int,track_name varchar(100),artist varchar(100))\"\n ],\n \"oraclesql\": [\n \"Create table Spotify (id int,track_name varchar(100),artist varchar(100))\"\n ],\n \"database\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "Create table If Not Exists Spotify (id int,track_name varchar(100),artist varchar(100))", + "Truncate table Spotify", + "insert into Spotify (id, track_name, artist) values ('303651', 'Heart Won't Forget', 'Ed Sheeran')", + "insert into Spotify (id, track_name, artist) values ('1046089', 'Shape of you', 'Sia')", + "insert into Spotify (id, track_name, artist) values ('33445', 'I'm the one', 'DJ Khalid')", + "insert into Spotify (id, track_name, artist) values ('811266', 'Young Dumb & Broke', 'DJ Khalid')", + "insert into Spotify (id, track_name, artist) values ('505727', 'Happier', 'Ed Sheeran')" + ], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": false, + "envInfo": "{\"mysql\": [\"MySQL\", \"

MySQL 8.0.

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

mssql server 2019.

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

Oracle Sql 11.2.

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]find-active-users.json b/leetcode/originData/[no content]find-active-users.json new file mode 100644 index 00000000..3d1ce381 --- /dev/null +++ b/leetcode/originData/[no content]find-active-users.json @@ -0,0 +1,52 @@ +{ + "data": { + "question": { + "questionId": "2842", + "questionFrontendId": "2688", + "boundTopicId": null, + "title": "Find Active Users", + "titleSlug": "find-active-users", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 2, + "dislikes": 1, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": null, + "categoryTitle": "Database", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"55\", \"totalSubmission\": \"181\", \"totalAcceptedRaw\": 55, \"totalSubmissionRaw\": 181, \"acRate\": \"30.4%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\":{\"Users\":[\"user_id\",\"item\",\"created_at\",\"amount\"]},\"rows\":{\"Users\":[[5,\"Smart Crock Pot\",\"2021-09-18\",698882],[6,\"Smart Lock\",\"2021-09-14\",11487],[6,\"Smart Thermostat\",\"2021-09-10\",674762],[8,\"Smart Light Strip\",\"2021-09-29\",630773],[4,\"Smart Cat Feeder\",\"2021-09-02\",693545],[4,\"Smart Bed\",\"2021-09-13\",170249]]}}", + "metaData": "{\n \"mysql\": [\n \"Create table If Not Exists Users (user_id int, item varchar(100),created_at date,amount int)\"\n ],\n \"mssql\": [\n \"Create table Users (user_id int, item varchar(100),created_at date,amount int)\"\n ],\n \"oraclesql\": [\n \"Create table Users (user_id int, item varchar(100),created_at date,amount int)\",\n \"ALTER SESSION SET nls_date_format='YYYY-MM-DD'\"\n ],\n \"database\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "Create table If Not Exists Users (user_id int, item varchar(100),created_at date,amount int)", + "Truncate table Users", + "insert into Users (user_id, item, created_at, amount) values ('5', 'Smart Crock Pot', '2021-09-18', '698882')", + "insert into Users (user_id, item, created_at, amount) values ('6', 'Smart Lock', '2021-09-14', '11487')", + "insert into Users (user_id, item, created_at, amount) values ('6', 'Smart Thermostat', '2021-09-10', '674762')", + "insert into Users (user_id, item, created_at, amount) values ('8', 'Smart Light Strip', '2021-09-29', '630773')", + "insert into Users (user_id, item, created_at, amount) values ('4', 'Smart Cat Feeder', '2021-09-02', '693545')", + "insert into Users (user_id, item, created_at, amount) values ('4', 'Smart Bed', '2021-09-13', '170249')" + ], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": false, + "envInfo": "{\"mysql\": [\"MySQL\", \"

MySQL 8.0.

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

mssql server 2019.

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

Oracle Sql 11.2.

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]find-latest-salaries.json b/leetcode/originData/[no content]find-latest-salaries.json new file mode 100644 index 00000000..796bb9a7 --- /dev/null +++ b/leetcode/originData/[no content]find-latest-salaries.json @@ -0,0 +1,63 @@ +{ + "data": { + "question": { + "questionId": "2829", + "questionFrontendId": "2668", + "boundTopicId": null, + "title": "Find Latest Salaries", + "titleSlug": "find-latest-salaries", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Easy", + "likes": 6, + "dislikes": 4, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": null, + "categoryTitle": "Database", + "contributors": [], + "topicTags": [ + { + "name": "Database", + "slug": "database", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"202\", \"totalSubmission\": \"416\", \"totalAcceptedRaw\": 202, \"totalSubmissionRaw\": 416, \"acRate\": \"48.6%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\":{\"Salary\":[\"emp_id\",\"firstname\",\"lastname\",\"salary\",\"department_id\"]},\"rows\":{\"Salary\":[[1,\"Todd\",\"Wilson\",110000,\"D1006\"],[1,\"Todd\",\"Wilson\",106119,\"D1006\"],[2,\"Justin\",\"Simon\",128922,\"D1005\"],[2,\"Justin\",\"Simon\",130000,\"D1005\"],[3,\"Kelly\",\"Rosario\",42689,\"D1002\"],[4,\"Patricia\",\"Powell\",162825,\"D1004\"],[4,\"Patricia\",\"Powell\",170000,\"D1004\"],[5,\"Sherry\",\"Golden\",44101,\"D1002\"],[6,\"Natasha\",\"Swanson\",79632,\"D1005\"],[6,\"Natasha\",\"Swanson\",90000,\"D1005\"]]}}", + "metaData": "{\n \"mysql\": [\n \"Create table If Not Exists Salary (emp_id int,firstname varchar(100),lastname varchar(100),salary int, department_id varchar(100))\"\n ],\n \"mssql\": [\n \"Create table Salary (emp_id int,firstname varchar(100),lastname varchar(100),salary int, department_id varchar(100))\"\n ],\n \"oraclesql\": [\n \"Create table Salary (emp_id int,firstname varchar(100),lastname varchar(100),salary int, department_id varchar(100))\"\n ],\n \"database\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "Create table If Not Exists Salary (emp_id int,firstname varchar(100),lastname varchar(100),salary int, department_id varchar(100))", + "Truncate table Salary", + "insert into Salary (emp_id, firstname, lastname, salary, department_id) values ('1', 'Todd', 'Wilson', '110000', 'D1006')", + "insert into Salary (emp_id, firstname, lastname, salary, department_id) values ('1', 'Todd', 'Wilson', '106119', 'D1006')", + "insert into Salary (emp_id, firstname, lastname, salary, department_id) values ('2', 'Justin', 'Simon', '128922', 'D1005')", + "insert into Salary (emp_id, firstname, lastname, salary, department_id) values ('2', 'Justin', 'Simon', '130000', 'D1005')", + "insert into Salary (emp_id, firstname, lastname, salary, department_id) values ('3', 'Kelly', 'Rosario', '42689', 'D1002')", + "insert into Salary (emp_id, firstname, lastname, salary, department_id) values ('4', 'Patricia', 'Powell', '162825', 'D1004')", + "insert into Salary (emp_id, firstname, lastname, salary, department_id) values ('4', 'Patricia', 'Powell', '170000', 'D1004')", + "insert into Salary (emp_id, firstname, lastname, salary, department_id) values ('5', 'Sherry', 'Golden', '44101', 'D1002')", + "insert into Salary (emp_id, firstname, lastname, salary, department_id) values ('6', 'Natasha', 'Swanson', '79632', 'D1005')", + "insert into Salary (emp_id, firstname, lastname, salary, department_id) values ('6', 'Natasha', 'Swanson', '90000', 'D1005')" + ], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": false, + "envInfo": "{\"mysql\": [\"MySQL\", \"

MySQL 8.0.

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

mssql server 2019.

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

Oracle Sql 11.2.

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]immediate-food-delivery-iii.json b/leetcode/originData/[no content]immediate-food-delivery-iii.json new file mode 100644 index 00000000..64b7243f --- /dev/null +++ b/leetcode/originData/[no content]immediate-food-delivery-iii.json @@ -0,0 +1,56 @@ +{ + "data": { + "question": { + "questionId": "2840", + "questionFrontendId": "2686", + "boundTopicId": null, + "title": "Immediate Food Delivery III", + "titleSlug": "immediate-food-delivery-iii", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 3, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": null, + "categoryTitle": "Database", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"40\", \"totalSubmission\": \"104\", \"totalAcceptedRaw\": 40, \"totalSubmissionRaw\": 104, \"acRate\": \"38.5%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\":{\"Delivery\":[\"delivery_id\",\"customer_id\",\"order_date\",\"customer_pref_delivery_date\"]},\"rows\":{\"Delivery\":[[1,1,\"2019-08-01\",\"2019-08-02\"],[2,2,\"2019-08-01\",\"2019-08-01\"],[3,1,\"2019-08-01\",\"2019-08-01\"],[4,3,\"2019-08-02\",\"2019-08-13\"],[5,3,\"2019-08-02\",\"2019-08-02\"],[6,2,\"2019-08-02\",\"2019-08-02\"],[7,4,\"2019-08-03\",\"2019-08-03\"],[8,1,\"2019-08-03\",\"2019-08-03\"],[9,5,\"2019-08-04\",\"2019-08-18\"],[10,2,\"2019-08-04\",\"2019-08-18\"]]}}", + "metaData": "{\n \"mysql\": [\n \"Create table If Not Exists Delivery (delivery_id int, customer_id int, order_date date, customer_pref_delivery_date date)\"\n ],\n \"mssql\": [\n \"Create table Delivery (delivery_id int, customer_id int, order_date date, customer_pref_delivery_date date)\"\n ],\n \"oraclesql\": [\n \"Create table Delivery (delivery_id int, customer_id int, order_date date, customer_pref_delivery_date date)\",\n \"ALTER SESSION SET nls_date_format='YYYY-MM-DD'\"\n ],\n \"database\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "Create table If Not Exists Delivery (delivery_id int, customer_id int, order_date date, customer_pref_delivery_date date)", + "Truncate table Delivery", + "insert into Delivery (delivery_id, customer_id, order_date, customer_pref_delivery_date) values ('1', '1', '2019-08-01', '2019-08-02')", + "insert into Delivery (delivery_id, customer_id, order_date, customer_pref_delivery_date) values ('2', '2', '2019-08-01', '2019-08-01')", + "insert into Delivery (delivery_id, customer_id, order_date, customer_pref_delivery_date) values ('3', '1', '2019-08-01', '2019-08-01')", + "insert into Delivery (delivery_id, customer_id, order_date, customer_pref_delivery_date) values ('4', '3', '2019-08-02', '2019-08-13')", + "insert into Delivery (delivery_id, customer_id, order_date, customer_pref_delivery_date) values ('5', '3', '2019-08-02', '2019-08-02')", + "insert into Delivery (delivery_id, customer_id, order_date, customer_pref_delivery_date) values ('6', '2', '2019-08-02', '2019-08-02')", + "insert into Delivery (delivery_id, customer_id, order_date, customer_pref_delivery_date) values ('7', '4', '2019-08-03', '2019-08-03')", + "insert into Delivery (delivery_id, customer_id, order_date, customer_pref_delivery_date) values ('8', '1', '2019-08-03', '2019-08-03')", + "insert into Delivery (delivery_id, customer_id, order_date, customer_pref_delivery_date) values ('9', '5', '2019-08-04', '2019-08-18')", + "insert into Delivery (delivery_id, customer_id, order_date, customer_pref_delivery_date) values ('10', '2', '2019-08-04', '2019-08-18')" + ], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": false, + "envInfo": "{\"mysql\": [\"MySQL\", \"

MySQL 8.0.

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

mssql server 2019.

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

Oracle Sql 11.2.

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]split-a-circular-linked-list.json b/leetcode/originData/[no content]split-a-circular-linked-list.json new file mode 100644 index 00000000..91be92b8 --- /dev/null +++ b/leetcode/originData/[no content]split-a-circular-linked-list.json @@ -0,0 +1,48 @@ +{ + "data": { + "question": { + "questionId": "2835", + "questionFrontendId": "2674", + "boundTopicId": null, + "title": "Split a Circular Linked List", + "titleSlug": "split-a-circular-linked-list", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 15, + "dislikes": 1, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Split Linked List in Parts\", \"titleSlug\": \"split-linked-list-in-parts\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "[1,5,7]\n[2,6,1,5]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"275\", \"totalSubmission\": \"352\", \"totalAcceptedRaw\": 275, \"totalSubmissionRaw\": 352, \"acRate\": \"78.1%\"}", + "hints": [ + "Do a while loop to calculate the size of the linked list.", + "Determine the size of the first half and create a new linked list in its size.", + "Do not forget that this half itself should be circular!", + "Use the previous hints for the second half." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,5,7]", + "metaData": "{\n \"name\": \"splitCircularLinkedList\",\n \"params\": [\n {\n \"name\": \"list\",\n \"type\": \"ListNode\"\n }\n ],\n \"return\": {\n \"type\": \"ListNode[]\"\n },\n \"manual\": true,\n \"languages\": [\n \"cpp\",\n \"java\",\n \"python\",\n \"c\",\n \"csharp\",\n \"javascript\",\n \"ruby\",\n \"swift\",\n \"golang\",\n \"python3\",\n \"scala\",\n \"kotlin\",\n \"php\",\n \"typescript\",\n \"dart\"\n ]\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

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

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

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

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

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

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

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

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

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

\\r\\n

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

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

Python 2.7.12.

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

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

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

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

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

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

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

Compiled with gcc 8.2 using the gnu11 standard.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

C# 10 with .NET 6 runtime

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

Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

For Priority Queue / Queue data structures, you may use 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

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

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

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

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

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

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

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

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

TypeScript 4.5.4, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]the-knights-tour.json b/leetcode/originData/[no content]the-knights-tour.json new file mode 100644 index 00000000..b4d1a017 --- /dev/null +++ b/leetcode/originData/[no content]the-knights-tour.json @@ -0,0 +1,62 @@ +{ + "data": { + "question": { + "questionId": "2823", + "questionFrontendId": "2664", + "boundTopicId": null, + "title": "The Knight’s Tour", + "titleSlug": "the-knights-tour", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 15, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "1\n1\n0\n0\n3\n4\n0\n0", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Recursion", + "slug": "recursion", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Matrix", + "slug": "matrix", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"428\", \"totalSubmission\": \"564\", \"totalAcceptedRaw\": 428, \"totalSubmissionRaw\": 564, \"acRate\": \"75.9%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "1\n1\n0\n0", + "metaData": "{\n \"name\": \"tourOfKnight\",\n \"params\": [\n {\n \"name\": \"m\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"n\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"r\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"c\"\n }\n ],\n \"return\": {\n \"type\": \"integer[][]\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

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

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

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

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

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

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

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

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

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

\\r\\n

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

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

Python 2.7.12.

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

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

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

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

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

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

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

Compiled with gcc 8.2 using the gnu11 standard.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

C# 10 with .NET 6 runtime

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

Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

For Priority Queue / Queue data structures, you may use 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

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

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

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

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

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

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

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

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

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

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

TypeScript 4.5.4, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/allow-one-function-call.json b/leetcode/originData/allow-one-function-call.json new file mode 100644 index 00000000..13d52bd0 --- /dev/null +++ b/leetcode/originData/allow-one-function-call.json @@ -0,0 +1,63 @@ +{ + "data": { + "question": { + "questionId": "2796", + "questionFrontendId": "2666", + "boundTopicId": null, + "title": "Allow One Function Call", + "titleSlug": "allow-one-function-call", + "content": "

Given a function fn, return a new function that is identical to the original function except that it ensures fn is called at most once.

\n\n
    \n\t
  • The first time the returned function is called, it should return the same result as fn.
  • \n\t
  • Every subsequent time it is called, it should return undefined.
  • \n
\n\n

 

\n

Example 1:

\n\n
\nInput: fn = (a,b,c) => (a + b + c), calls = [[1,2,3],[2,3,6]]\nOutput: [{"calls":1,"value":6}]\nExplanation:\nconst onceFn = once(fn);\nonceFn(1, 2, 3); // 6\nonceFn(2, 3, 6); // undefined, fn was not called\n
\n\n

Example 2:

\n\n
\nInput: fn = (a,b,c) => (a * b * c), calls = [[5,7,4],[2,3,6],[4,6,8]]\nOutput: [{"calls":1,"value":140}]\nExplanation:\nconst onceFn = once(fn);\nonceFn(5, 7, 4); // 140\nonceFn(2, 3, 6); // undefined, fn was not called\nonceFn(4, 6, 8); // undefined, fn was not called\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= calls.length <= 10
  • \n\t
  • 1 <= calls[i].length <= 100
  • \n\t
  • 2 <= JSON.stringify(calls).length <= 1000
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 175, + "dislikes": 11, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "(a,b,c) => (a + b + c)\n[[1,2,3],[2,3,6]]\n(a,b,c) => (a * b * c)\n[[5,7,4],[2,3,6],[4,6,8]]", + "categoryTitle": "JavaScript", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {Function} fn\n * @return {Function}\n */\nvar once = function(fn) {\n return function(...args){\n \n }\n};\n\n/**\n * let fn = (a,b,c) => (a + b + c)\n * let onceFn = once(fn)\n *\n * onceFn(1,2,3); // 6\n * onceFn(2,3,6); // returns undefined without calling fn\n */\n", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function once any>(fn: T): \n ((...args: Parameters) => ReturnType | undefined) {\n return function (...args) {\n\n };\n}\n\n/**\n * let fn = (a,b,c) => (a + b + c)\n * let onceFn = once(fn)\n *\n * onceFn(1,2,3); // 6\n * onceFn(2,3,6); // returns undefined without calling fn\n */", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"11.8K\", \"totalSubmission\": \"12.9K\", \"totalAcceptedRaw\": 11792, \"totalSubmissionRaw\": 12852, \"acRate\": \"91.8%\"}", + "hints": [], + "solution": { + "id": "1893", + "canSeeDetail": true, + "paidOnly": false, + "hasVideoSolution": false, + "paidOnlyVideo": true, + "__typename": "ArticleNode" + }, + "status": null, + "sampleTestCase": "(a,b,c) => (a + b + c)\n[[1,2,3],[2,3,6]]", + "metaData": "{\n \"name\": \"once\",\n \"params\": [\n {\n \"name\": \"fn\",\n \"type\": \"string\"\n },\n {\n \"type\": \"string\",\n \"name\": \"calls\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n },\n \"languages\": [\n \"javascript\",\n \"typescript\"\n ],\n \"manual\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": false, + "envInfo": "{\"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

For Priority Queue / Queue data structures, you may use 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of datastructures-js/queue.

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

TypeScript 4.5.4, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/array-of-objects-to-matrix.json b/leetcode/originData/array-of-objects-to-matrix.json new file mode 100644 index 00000000..3277af14 --- /dev/null +++ b/leetcode/originData/array-of-objects-to-matrix.json @@ -0,0 +1,60 @@ +{ + "data": { + "question": { + "questionId": "2769", + "questionFrontendId": "2675", + "boundTopicId": null, + "title": "Array of Objects to Matrix", + "titleSlug": "array-of-objects-to-matrix", + "content": "

Write a function that converts an array of objects arr into a matrix m.

\n\n

arr is an array of objects or arrays. Each item in the array can be deeply nested with child arrays and child objects. It can also contain numbers, strings, booleans, and null values.

\n\n

The first row m should be the column names. If there is no nesting, the column names are the unique keys within the objects. If there is nesting, the column names are the respective paths in the object separated by ".".

\n\n

Each of the remaining rows corresponds to an object in arr. Each value in the matrix corresponds to a value in an object. If a given object doesn't contain a value for a given column, the cell should contain an empty string "".

\n\n

The colums in the matrix should be in lexographically ascending order.

\n\n

 

\n

Example 1:

\n\n
\nInput: \narr = [\n  {"b": 1, "a": 2},\n  {"b": 3, "a": 4}\n]\nOutput: \n[\n  ["a", "b"],\n  [2, 1],\n  [4, 3]\n]\n\nExplanation:\nThere are two unique column names in the two objects: "a" and "b".\n"a" corresponds with [2, 4].\n"b" coresponds with [1, 3].\n
\n\n

Example 2:

\n\n
\nInput: \narr = [\n  {"a": 1, "b": 2},\n  {"c": 3, "d": 4},\n  {}\n]\nOutput: \n[\n  ["a", "b", "c", "d"],\n  [1, 2, "", ""],\n  ["", "", 3, 4],\n  ["", "", "", ""]\n]\n\nExplanation:\nThere are 4 unique column names: "a", "b", "c", "d".\nThe first object has values associated with "a" and "b".\nThe second object has values associated with "c" and "d".\nThe third object has no keys, so it is just a row of empty strings.\n
\n\n

Example 3:

\n\n
\nInput: \narr = [\n  {"a": {"b": 1, "c": 2}},\n  {"a": {"b": 3, "d": 4}}\n]\nOutput: \n[\n  ["a.b", "a.c", "a.d"],\n  [1, 2, ""],\n  [3, "", 4]\n]\n\nExplanation:\nIn this example, the objects are nested. The keys represent the full path to each value separated by periods.\nThere are three paths: "a.b", "a.c", "a.d".\n
\n\n

Example 4:

\n\n
\nInput: \narr = [\n  [{"a": null}],\n  [{"b": true}],\n  [{"c": "x"}]\n]\nOutput: \n[\n  ["0.a", "0.b", "0.c"],\n  [null, "", ""],\n  ["", true, ""],\n  ["", "", "x"]\n]\n\nExplanation:\nArrays are also considered objects with their keys being their indices.\nEach array has one element so the keys are "0.a", "0.b", and "0.c".\n
\n\n

Example 5:

\n\n
\nInput: \narr = [\n  {},\n  {},\n  {},\n]\nOutput: \n[\n  [],\n  [],\n  [],\n  []\n]\n\nExplanation:\nThere are no keys so every row is an empty array.
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= arr.length <= 1000
  • \n\t
  • unique keys <= 1000
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 14, + "dislikes": 2, + "isLiked": null, + "similarQuestions": "[{\"title\": \"JSON Deep Equal\", \"titleSlug\": \"json-deep-equal\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Convert Object to JSON String\", \"titleSlug\": \"convert-object-to-json-string\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "[{\"b\":1,\"a\":2},{\"b\":3,\"a\":4}]\n[{\"a\":1,\"b\":2},{\"c\":3,\"d\":4},{}]\n[{\"a\":{\"b\":1,\"c\":2}},{\"a\":{\"b\":3,\"d\":4}}]\n[[{\"a\":null}],[{\"b\":true}],[{\"c\":\"x\"}]]\n[{},{},{}]", + "categoryTitle": "JavaScript", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {Array} arr\n * @return {Matrix}\n */\nvar jsonToMatrix = function(arr) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function jsonToMatrix(arr: any[]): (string | number | boolean | null)[] {\n\n};", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"207\", \"totalSubmission\": \"321\", \"totalAcceptedRaw\": 207, \"totalSubmissionRaw\": 321, \"acRate\": \"64.5%\"}", + "hints": [ + "How could you split the problem up into sub-problems?", + "1.) Write a function that converts a single object into a dictionary that maps the path name to values. You can solve this recursively by keeping track of current path list.", + "2.) Write a function that converts a list of dictionaries into a matrix. Start by creating a list of all possible paths in any of the dictionaries. This will represent the columns." + ], + "solution": null, + "status": null, + "sampleTestCase": "[{\"b\":1,\"a\":2},{\"b\":3,\"a\":4}]", + "metaData": "{\n \"name\": \"jsonToMatrix\",\n \"params\": [\n {\n \"name\": \"arr\",\n \"type\": \"string\"\n }\n ],\n \"return\": {\n \"type\": \"string\"\n },\n \"languages\": [\n \"typescript\",\n \"javascript\"\n ],\n \"manual\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": false, + "envInfo": "{\"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

For Priority Queue / Queue data structures, you may use 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of datastructures-js/queue.

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

TypeScript 4.5.4, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/chunk-array.json b/leetcode/originData/chunk-array.json new file mode 100644 index 00000000..4f3bebd8 --- /dev/null +++ b/leetcode/originData/chunk-array.json @@ -0,0 +1,56 @@ +{ + "data": { + "question": { + "questionId": "2798", + "questionFrontendId": "2677", + "boundTopicId": null, + "title": "Chunk Array", + "titleSlug": "chunk-array", + "content": "

Given an array arr and a chunk size size, return a chunked array. A chunked array contains the original elements in arr, but consists of subarrays each of length size. The length of the last subarray may be less than size if arr.length is not evenly divisible by size.

\n\n

You may assume the array is the output of JSON.parse. In other words, it is valid JSON.

\n\n

Please solve it without using lodash's _.chunk function.

\n\n

 

\n

Example 1:

\n\n
\nInput: arr = [1,2,3,4,5], size = 1\nOutput: [[1],[2],[3],[4],[5]]\nExplanation: The arr has been split into subarrays each with 1 element.\n
\n\n

Example 2:

\n\n
\nInput: arr = [1,9,6,3,2], size = 3\nOutput: [[1,9,6],[3,2]]\nExplanation: The arr has been split into subarrays with 3 elements. However, only two elements are left for the 2nd subarray.\n
\n\n

Example 3:

\n\n
\nInput: arr = [8,5,3,2,6], size = 6\nOutput: [[8,5,3,2,6]]\nExplanation: Size is greater than arr.length thus all elements are in the first subarray.\n
\n\n

Example 4:

\n\n
\nInput: arr = [], size = 1\nOutput: []\nExplanation: There are no elements to be chunked so an empty array is returned.
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • arr is a valid JSON array
  • \n\t
  • 2 <= JSON.stringify(arr).length <= 105
  • \n\t
  • 1 <= size <= arr.length + 1
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 35, + "dislikes": 1, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "[1,2,3,4,5]\n1\n[1,9,6,3,2]\n3\n[8,5,3,2,6]\n6\n[]\n1", + "categoryTitle": "JavaScript", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {Array} arr\n * @param {number} size\n * @return {Array[]}\n */\nvar chunk = function(arr, size) {\n \n};\n", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function chunk(arr: any[], size: number): any[][] {\n\n};\n", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"1.1K\", \"totalSubmission\": \"1.3K\", \"totalAcceptedRaw\": 1096, \"totalSubmissionRaw\": 1329, \"acRate\": \"82.5%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "[1,2,3,4,5]\n1", + "metaData": "{\n \"name\": \"chunkify\",\n \"params\": [\n {\n \"name\": \"arr\",\n \"type\": \"string\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"size\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n },\n \"languages\": [\n \"javascript\",\n \"typescript\"\n ],\n \"manual\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": false, + "envInfo": "{\"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

For Priority Queue / Queue data structures, you may use 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of datastructures-js/queue.

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

TypeScript 4.5.4, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/count-the-number-of-complete-components.json b/leetcode/originData/count-the-number-of-complete-components.json new file mode 100644 index 00000000..89347bd0 --- /dev/null +++ b/leetcode/originData/count-the-number-of-complete-components.json @@ -0,0 +1,162 @@ +{ + "data": { + "question": { + "questionId": "2793", + "questionFrontendId": "2685", + "boundTopicId": null, + "title": "Count the Number of Complete Components", + "titleSlug": "count-the-number-of-complete-components", + "content": "

You are given an integer n. There is an undirected graph with n vertices, numbered from 0 to n - 1. You are given a 2D integer array edges where edges[i] = [ai, bi] denotes that there exists an undirected edge connecting vertices ai and bi.

\n\n

Return the number of complete connected components of the graph.

\n\n

A connected component is a subgraph of a graph in which there exists a path between any two vertices, and no vertex of the subgraph shares an edge with a vertex outside of the subgraph.

\n\n

A connected component is said to be complete if there exists an edge between every pair of its vertices.

\n\n

 

\n

Example 1:

\n\n

\"\"

\n\n
\nInput: n = 6, edges = [[0,1],[0,2],[1,2],[3,4]]\nOutput: 3\nExplanation: From the picture above, one can see that all of the components of this graph are complete.\n
\n\n

Example 2:

\n\n

\"\"

\n\n
\nInput: n = 6, edges = [[0,1],[0,2],[1,2],[3,4],[3,5]]\nOutput: 1\nExplanation: The component containing vertices 0, 1, and 2 is complete since there is an edge between every pair of two vertices. On the other hand, the component containing vertices 3, 4, and 5 is not complete since there is no edge between vertices 4 and 5. Thus, the number of complete components in this graph is 1.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= n <= 50
  • \n\t
  • 0 <= edges.length <= n * (n - 1) / 2
  • \n\t
  • edges[i].length == 2
  • \n\t
  • 0 <= ai, bi <= n - 1
  • \n\t
  • ai != bi
  • \n\t
  • There are no repeated edges.
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 142, + "dislikes": 1, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Number of Connected Components in an Undirected Graph\", \"titleSlug\": \"number-of-connected-components-in-an-undirected-graph\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "6\n[[0,1],[0,2],[1,2],[3,4]]\n6\n[[0,1],[0,2],[1,2],[3,4],[3,5]]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int countCompleteComponents(int n, vector>& edges) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int countCompleteComponents(int n, int[][] edges) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def countCompleteComponents(self, n, edges):\n \"\"\"\n :type n: int\n :type edges: List[List[int]]\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def countCompleteComponents(self, n: int, edges: List[List[int]]) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int countCompleteComponents(int n, int** edges, int edgesSize, int* edgesColSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int CountCompleteComponents(int n, int[][] edges) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @param {number[][]} edges\n * @return {number}\n */\nvar countCompleteComponents = function(n, edges) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @param {Integer[][]} edges\n# @return {Integer}\ndef count_complete_components(n, edges)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func countCompleteComponents(_ n: Int, _ edges: [[Int]]) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func countCompleteComponents(n int, edges [][]int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def countCompleteComponents(n: Int, edges: Array[Array[Int]]): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun countCompleteComponents(n: Int, edges: Array): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn count_complete_components(n: i32, edges: Vec>) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer[][] $edges\n * @return Integer\n */\n function countCompleteComponents($n, $edges) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function countCompleteComponents(n: number, edges: number[][]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (count-complete-components n edges)\n (-> exact-integer? (listof (listof exact-integer?)) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec count_complete_components(N :: integer(), Edges :: [[integer()]]) -> integer().\ncount_complete_components(N, Edges) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec count_complete_components(n :: integer, edges :: [[integer]]) :: integer\n def count_complete_components(n, edges) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int countCompleteComponents(int n, List> edges) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"7.3K\", \"totalSubmission\": \"11K\", \"totalAcceptedRaw\": 7287, \"totalSubmissionRaw\": 10968, \"acRate\": \"66.4%\"}", + "hints": [ + "Find the connected components of an undirected graph using depth-first search (DFS) or breadth-first search (BFS).", + "For each connected component, count the number of nodes and edges in the component.", + "A connected component is complete if and only if the number of edges in the component is equal to m*(m-1)/2, where m is the number of nodes in the component." + ], + "solution": null, + "status": null, + "sampleTestCase": "6\n[[0,1],[0,2],[1,2],[3,4]]", + "metaData": "{\n \"name\": \"countCompleteComponents\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer[][]\",\n \"name\": \"edges\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

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

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

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

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

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

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

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

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

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

\\r\\n

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

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

Python 2.7.12.

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

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

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

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

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

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

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

Compiled with gcc 8.2 using the gnu11 standard.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n
\\r\\n

\"], \"csharp\": [\"C#\", \"

C# 10 with .NET 6 runtime

\"], \"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

\\r\\n\\r\\n

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

\\r\\n\\r\\n

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"], \"racket\": [\"Racket\", \"

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

\\r\\n\\r\\n

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/counter-ii.json b/leetcode/originData/counter-ii.json new file mode 100644 index 00000000..8f0d10a7 --- /dev/null +++ b/leetcode/originData/counter-ii.json @@ -0,0 +1,66 @@ +{ + "data": { + "question": { + "questionId": "2789", + "questionFrontendId": "2665", + "boundTopicId": null, + "title": "Counter II", + "titleSlug": "counter-ii", + "content": "

Write a function createCounter. It should accept an initial integer init. It should return an object with three functions.

\n\n

The three functions are:

\n\n
    \n\t
  • increment() increases the current value by 1 and then returns it.
  • \n\t
  • decrement() reduces the current value by 1 and then returns it.
  • \n\t
  • reset() sets the current value to init and then returns it.
  • \n
\n\n

 

\n

Example 1:

\n\n
\nInput: init = 5, calls = ["increment","reset","decrement"]\nOutput: [6,5,4]\nExplanation:\nconst counter = createCounter(5);\ncounter.increment(); // 6\ncounter.reset(); // 5\ncounter.decrement(); // 4\n
\n\n

Example 2:

\n\n
\nInput: init = 0, calls = ["increment","increment","decrement","reset","reset"]\nOutput: [1,2,1,0,0]\nExplanation:\nconst counter = createCounter(0);\ncounter.increment(); // 1\ncounter.increment(); // 2\ncounter.decrement(); // 1\ncounter.reset(); // 0\ncounter.reset(); // 0\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • -1000 <= init <= 1000
  • \n\t
  • total calls not to exceed 1000
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 270, + "dislikes": 4, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Counter\", \"titleSlug\": \"counter\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]", + "exampleTestcases": "5\n[\"increment\",\"reset\",\"decrement\"]\n0\n[\"increment\",\"increment\",\"decrement\",\"reset\",\"reset\"]", + "categoryTitle": "JavaScript", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {integer} init\n * @return { increment: Function, decrement: Function, reset: Function }\n */\nvar createCounter = function(init) {\n \n};\n\n/**\n * const counter = createCounter(5)\n * counter.increment(); // 6\n * counter.reset(); // 5\n * counter.decrement(); // 4\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "type ReturnObj = {\n increment: () => number,\n decrement: () => number,\n reset: () => number,\n}\n\nfunction createCounter(init: number): ReturnObj {\n\n};\n\n/**\n * const counter = createCounter(5)\n * counter.increment(); // 6\n * counter.reset(); // 5\n * counter.decrement(); // 4\n */", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"18K\", \"totalSubmission\": \"20K\", \"totalAcceptedRaw\": 17957, \"totalSubmissionRaw\": 20004, \"acRate\": \"89.8%\"}", + "hints": [ + "You can return an object with methods.", + "Initialize a variable for currentCount. Inside these methods, add the appropriate logic which mutates currentCount." + ], + "solution": { + "id": "1881", + "canSeeDetail": true, + "paidOnly": false, + "hasVideoSolution": false, + "paidOnlyVideo": true, + "__typename": "ArticleNode" + }, + "status": null, + "sampleTestCase": "5\n[\"increment\",\"reset\",\"decrement\"]", + "metaData": "{\n \"name\": \"createCounter\",\n \"params\": [\n {\n \"name\": \"init\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"string[]\",\n \"name\": \"calls\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n },\n \"languages\": [\n \"javascript\",\n \"typescript\"\n ],\n \"manual\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": false, + "envInfo": "{\"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of datastructures-js/queue.

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/create-hello-world-function.json b/leetcode/originData/create-hello-world-function.json new file mode 100644 index 00000000..b73a625b --- /dev/null +++ b/leetcode/originData/create-hello-world-function.json @@ -0,0 +1,63 @@ +{ + "data": { + "question": { + "questionId": "2809", + "questionFrontendId": "2667", + "boundTopicId": null, + "title": "Create Hello World Function", + "titleSlug": "create-hello-world-function", + "content": "Write a function createHelloWorld. It should return a new function that always returns "Hello World".\n

 

\n

Example 1:

\n\n
\nInput: args = []\nOutput: "Hello World"\nExplanation:\nconst f = createHelloWorld();\nf(); // "Hello World"\n\nThe function returned by createHelloWorld should always return "Hello World".\n
\n\n

Example 2:

\n\n
\nInput: args = [{},null,42]\nOutput: "Hello World"\nExplanation:\nconst f = createHelloWorld();\nf({}, null, 42); // "Hello World"\n\nAny arguments could be passed to the function but it should still always return "Hello World".\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 0 <= args.length <= 10
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 380, + "dislikes": 39, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "[]\n[{},null,42]", + "categoryTitle": "JavaScript", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @return {Function}\n */\nvar createHelloWorld = function() {\n return function(...args) {\n \n }\n};\n\n/**\n * const f = createHelloWorld();\n * f(); // \"Hello World\"\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function createHelloWorld() {\n\treturn function(...args): string {\n \n };\n};\n\n/**\n * const f = createHelloWorld();\n * f(); // \"Hello World\"\n */", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"26K\", \"totalSubmission\": \"28K\", \"totalAcceptedRaw\": 25993, \"totalSubmissionRaw\": 28010, \"acRate\": \"92.8%\"}", + "hints": [], + "solution": { + "id": "1873", + "canSeeDetail": true, + "paidOnly": false, + "hasVideoSolution": false, + "paidOnlyVideo": true, + "__typename": "ArticleNode" + }, + "status": null, + "sampleTestCase": "[]", + "metaData": "{\n \"name\": \"createHelloWorld\",\n \"params\": [\n {\n \"name\": \"args\",\n \"type\": \"string\"\n }\n ],\n \"return\": {\n \"type\": \"string\"\n },\n \"languages\": [\n \"javascript\",\n \"typescript\"\n ],\n \"manual\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": false, + "envInfo": "{\"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of datastructures-js/queue.

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/find-the-distinct-difference-array.json b/leetcode/originData/find-the-distinct-difference-array.json new file mode 100644 index 00000000..d6435410 --- /dev/null +++ b/leetcode/originData/find-the-distinct-difference-array.json @@ -0,0 +1,174 @@ +{ + "data": { + "question": { + "questionId": "2777", + "questionFrontendId": "2670", + "boundTopicId": null, + "title": "Find the Distinct Difference Array", + "titleSlug": "find-the-distinct-difference-array", + "content": "

You are given a 0-indexed array nums of length n.

\n\n

The distinct difference array of nums is an array diff of length n such that diff[i] is equal to the number of distinct elements in the suffix nums[i + 1, ..., n - 1] subtracted from the number of distinct elements in the prefix nums[0, ..., i].

\n\n

Return the distinct difference array of nums.

\n\n

Note that nums[i, ..., j] denotes the subarray of nums starting at index i and ending at index j inclusive. Particularly, if i > j then nums[i, ..., j] denotes an empty subarray.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [1,2,3,4,5]\nOutput: [-3,-1,1,3,5]\nExplanation: For index i = 0, there is 1 element in the prefix and 4 distinct elements in the suffix. Thus, diff[0] = 1 - 4 = -3.\nFor index i = 1, there are 2 distinct elements in the prefix and 3 distinct elements in the suffix. Thus, diff[1] = 2 - 3 = -1.\nFor index i = 2, there are 3 distinct elements in the prefix and 2 distinct elements in the suffix. Thus, diff[2] = 3 - 2 = 1.\nFor index i = 3, there are 4 distinct elements in the prefix and 1 distinct element in the suffix. Thus, diff[3] = 4 - 1 = 3.\nFor index i = 4, there are 5 distinct elements in the prefix and no elements in the suffix. Thus, diff[4] = 5 - 0 = 5.\n
\n\n

Example 2:

\n\n
\nInput: nums = [3,2,3,4,2]\nOutput: [-2,-1,0,2,3]\nExplanation: For index i = 0, there is 1 element in the prefix and 3 distinct elements in the suffix. Thus, diff[0] = 1 - 3 = -2.\nFor index i = 1, there are 2 distinct elements in the prefix and 3 distinct elements in the suffix. Thus, diff[1] = 2 - 3 = -1.\nFor index i = 2, there are 2 distinct elements in the prefix and 2 distinct elements in the suffix. Thus, diff[2] = 2 - 2 = 0.\nFor index i = 3, there are 3 distinct elements in the prefix and 1 distinct element in the suffix. Thus, diff[3] = 3 - 1 = 2.\nFor index i = 4, there are 3 distinct elements in the prefix and no elements in the suffix. Thus, diff[4] = 3 - 0 = 3.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= n == nums.length <= 50
  • \n\t
  • 1 <= nums[i] <= 50
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 137, + "dislikes": 9, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Left and Right Sum Differences\", \"titleSlug\": \"left-and-right-sum-differences\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]", + "exampleTestcases": "[1,2,3,4,5]\n[3,2,3,4,2]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Hash Table", + "slug": "hash-table", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n vector distinctDifferenceArray(vector& nums) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int[] distinctDifferenceArray(int[] nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def distinctDifferenceArray(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: List[int]\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def distinctDifferenceArray(self, nums: List[int]) -> List[int]:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "/**\n * Note: The returned array must be malloced, assume caller calls free().\n */\nint* distinctDifferenceArray(int* nums, int numsSize, int* returnSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int[] DistinctDifferenceArray(int[] nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @return {number[]}\n */\nvar distinctDifferenceArray = function(nums) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @return {Integer[]}\ndef distinct_difference_array(nums)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func distinctDifferenceArray(_ nums: [Int]) -> [Int] {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func distinctDifferenceArray(nums []int) []int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def distinctDifferenceArray(nums: Array[Int]): Array[Int] = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun distinctDifferenceArray(nums: IntArray): IntArray {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn distinct_difference_array(nums: Vec) -> Vec {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums\n * @return Integer[]\n */\n function distinctDifferenceArray($nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function distinctDifferenceArray(nums: number[]): number[] {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (distinct-difference-array nums)\n (-> (listof exact-integer?) (listof exact-integer?))\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec distinct_difference_array(Nums :: [integer()]) -> [integer()].\ndistinct_difference_array(Nums) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec distinct_difference_array(nums :: [integer]) :: [integer]\n def distinct_difference_array(nums) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n List distinctDifferenceArray(List nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"18.6K\", \"totalSubmission\": \"24.4K\", \"totalAcceptedRaw\": 18650, \"totalSubmissionRaw\": 24385, \"acRate\": \"76.5%\"}", + "hints": [ + "Which data structure will help you maintain distinct elements?", + "Iterate over all possible prefix sizes. Then, use a nested loop to add the elements of the prefix to a set, and another nested loop to add the elements of the suffix to another set." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,2,3,4,5]", + "metaData": "{\n \"name\": \"distinctDifferenceArray\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n }\n ],\n \"return\": {\n \"type\": \"integer[]\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 17 standard.

\\r\\n\\r\\n

Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\"], \"java\": [\"Java\", \"

OpenJDK 17. Java 8 features such as lambda expressions and stream API can be used.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n

Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

\"], \"python\": [\"Python\", \"

Python 2.7.12.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\\r\\n\\r\\n

Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.

\"], \"c\": [\"C\", \"

Compiled with gcc 8.2 using the gnu11 standard.

\\r\\n\\r\\n

Your code is compiled with level one optimization (-O1). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n\\r\\n

For hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:

\\r\\n\\r\\n

1. Adding an item to a hash.\\r\\n

\\r\\nstruct hash_entry {\\r\\n    int id;            /* we'll use this field as the key */\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n
\\r\\n

\\r\\n\\r\\n

2. Looking up an item in a hash:\\r\\n

\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n
\\r\\n

\\r\\n\\r\\n

3. Deleting an item in a hash:\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n
\\r\\n

\"], \"csharp\": [\"C#\", \"

C# 10 with .NET 6 runtime

\"], \"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

\\r\\n\\r\\n

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

\\r\\n\\r\\n

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"], \"racket\": [\"Racket\", \"

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

\\r\\n\\r\\n

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/find-the-losers-of-the-circular-game.json b/leetcode/originData/find-the-losers-of-the-circular-game.json new file mode 100644 index 00000000..c7e2a758 --- /dev/null +++ b/leetcode/originData/find-the-losers-of-the-circular-game.json @@ -0,0 +1,160 @@ +{ + "data": { + "question": { + "questionId": "2791", + "questionFrontendId": "2682", + "boundTopicId": null, + "title": "Find the Losers of the Circular Game", + "titleSlug": "find-the-losers-of-the-circular-game", + "content": "

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.

\n\n

The rules of the game are as follows:

\n\n

1st friend receives the ball.

\n\n
    \n\t
  • After that, 1st friend passes it to the friend who is k steps away from them in the clockwise direction.
  • \n\t
  • After that, the friend who receives the ball should pass it to the friend who is 2 * k steps away from them in the clockwise direction.
  • \n\t
  • After that, the friend who receives the ball should pass it to the friend who is 3 * k steps away from them in the clockwise direction, and so on and so forth.
  • \n
\n\n

In other words, on the ith turn, the friend holding the ball should pass it to the friend who is i * k steps away from them in the clockwise direction.

\n\n

The game is finished when some friend receives the ball for the second time.

\n\n

The losers of the game are friends who did not receive the ball in the entire game.

\n\n

Given the number of friends, n, and an integer k, return the array answer, which contains the losers of the game in the ascending order.

\n\n

 

\n

Example 1:

\n\n
\nInput: n = 5, k = 2\nOutput: [4,5]\nExplanation: The game goes as follows:\n1) Start at 1st friend and pass the ball to the friend who is 2 steps away from them - 3rd friend.\n2) 3rd friend passes the ball to the friend who is 4 steps away from them - 2nd friend.\n3) 2nd friend passes the ball to the friend who is 6 steps away from them  - 3rd friend.\n4) The game ends as 3rd friend receives the ball for the second time.\n
\n\n

Example 2:

\n\n
\nInput: n = 4, k = 4\nOutput: [2,3,4]\nExplanation: The game goes as follows:\n1) Start at the 1st friend and pass the ball to the friend who is 4 steps away from them - 1st friend.\n2) The game ends as 1st friend receives the ball for the second time.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= k <= n <= 50
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 101, + "dislikes": 15, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "5\n2\n4\n4", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n vector circularGameLosers(int n, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int[] circularGameLosers(int n, int k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def circularGameLosers(self, n, k):\n \"\"\"\n :type n: int\n :type k: int\n :rtype: List[int]\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def circularGameLosers(self, n: int, k: int) -> List[int]:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "/**\n * Note: The returned array must be malloced, assume caller calls free().\n */\nint* circularGameLosers(int n, int k, int* returnSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int[] CircularGameLosers(int n, int k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @param {number} k\n * @return {number[]}\n */\nvar circularGameLosers = function(n, k) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @param {Integer} k\n# @return {Integer[]}\ndef circular_game_losers(n, k)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func circularGameLosers(_ n: Int, _ k: Int) -> [Int] {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func circularGameLosers(n int, k int) []int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def circularGameLosers(n: Int, k: Int): Array[Int] = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun circularGameLosers(n: Int, k: Int): IntArray {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn circular_game_losers(n: i32, k: i32) -> Vec {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer $k\n * @return Integer[]\n */\n function circularGameLosers($n, $k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function circularGameLosers(n: number, k: number): number[] {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (circular-game-losers n k)\n (-> exact-integer? exact-integer? (listof exact-integer?))\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec circular_game_losers(N :: integer(), K :: integer()) -> [integer()].\ncircular_game_losers(N, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec circular_game_losers(n :: integer, k :: integer) :: [integer]\n def circular_game_losers(n, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n List circularGameLosers(int n, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"13.2K\", \"totalSubmission\": \"28.8K\", \"totalAcceptedRaw\": 13235, \"totalSubmissionRaw\": 28773, \"acRate\": \"46.0%\"}", + "hints": [ + "Simulate the whole game until a player receives the ball for the second time." + ], + "solution": null, + "status": null, + "sampleTestCase": "5\n2", + "metaData": "{\n \"name\": \"circularGameLosers\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n }\n ],\n \"return\": {\n \"type\": \"integer[]\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 17 standard.

\\r\\n\\r\\n

Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\"], \"java\": [\"Java\", \"

OpenJDK 17. Java 8 features such as lambda expressions and stream API can be used.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n

Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

\"], \"python\": [\"Python\", \"

Python 2.7.12.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\\r\\n\\r\\n

Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.

\"], \"c\": [\"C\", \"

Compiled with gcc 8.2 using the gnu11 standard.

\\r\\n\\r\\n

Your code is compiled with level one optimization (-O1). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n\\r\\n

For hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:

\\r\\n\\r\\n

1. Adding an item to a hash.\\r\\n

\\r\\nstruct hash_entry {\\r\\n    int id;            /* we'll use this field as the key */\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n
\\r\\n

\\r\\n\\r\\n

2. Looking up an item in a hash:\\r\\n

\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n
\\r\\n

\\r\\n\\r\\n

3. Deleting an item in a hash:\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n
\\r\\n

\"], \"csharp\": [\"C#\", \"

C# 10 with .NET 6 runtime

\"], \"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

\\r\\n\\r\\n

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

\\r\\n\\r\\n

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"], \"racket\": [\"Racket\", \"

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

\\r\\n\\r\\n

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/frequency-tracker.json b/leetcode/originData/frequency-tracker.json new file mode 100644 index 00000000..d57abe1f --- /dev/null +++ b/leetcode/originData/frequency-tracker.json @@ -0,0 +1,175 @@ +{ + "data": { + "question": { + "questionId": "2778", + "questionFrontendId": "2671", + "boundTopicId": null, + "title": "Frequency Tracker", + "titleSlug": "frequency-tracker", + "content": "

Design a data structure that keeps track of the values in it and answers some queries regarding their frequencies.

\n\n

Implement the FrequencyTracker class.

\n\n
    \n\t
  • FrequencyTracker(): Initializes the FrequencyTracker object with an empty array initially.
  • \n\t
  • void add(int number): Adds number to the data structure.
  • \n\t
  • void deleteOne(int number): Deletes one occurence of number from the data structure. The data structure may not contain number, and in this case nothing is deleted.
  • \n\t
  • bool hasFrequency(int frequency): Returns true if there is a number in the data structure that occurs frequency number of times, otherwise, it returns false.
  • \n
\n\n

 

\n

Example 1:

\n\n
\nInput\n["FrequencyTracker", "add", "add", "hasFrequency"]\n[[], [3], [3], [2]]\nOutput\n[null, null, null, true]\n\nExplanation\nFrequencyTracker frequencyTracker = new FrequencyTracker();\nfrequencyTracker.add(3); // The data structure now contains [3]\nfrequencyTracker.add(3); // The data structure now contains [3, 3]\nfrequencyTracker.hasFrequency(2); // Returns true, because 3 occurs twice\n\n
\n\n

Example 2:

\n\n
\nInput\n["FrequencyTracker", "add", "deleteOne", "hasFrequency"]\n[[], [1], [1], [1]]\nOutput\n[null, null, null, false]\n\nExplanation\nFrequencyTracker frequencyTracker = new FrequencyTracker();\nfrequencyTracker.add(1); // The data structure now contains [1]\nfrequencyTracker.deleteOne(1); // The data structure becomes empty []\nfrequencyTracker.hasFrequency(1); // Returns false, because the data structure is empty\n\n
\n\n

Example 3:

\n\n
\nInput\n["FrequencyTracker", "hasFrequency", "add", "hasFrequency"]\n[[], [2], [3], [1]]\nOutput\n[null, false, null, true]\n\nExplanation\nFrequencyTracker frequencyTracker = new FrequencyTracker();\nfrequencyTracker.hasFrequency(2); // Returns false, because the data structure is empty\nfrequencyTracker.add(3); // The data structure now contains [3]\nfrequencyTracker.hasFrequency(1); // Returns true, because 3 occurs once\n\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= number <= 105
  • \n\t
  • 1 <= frequency <= 105
  • \n\t
  • At most, 2 * 105 calls will be made to add, deleteOne, and hasFrequency in total.
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 206, + "dislikes": 14, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "[\"FrequencyTracker\",\"add\",\"add\",\"hasFrequency\"]\n[[],[3],[3],[2]]\n[\"FrequencyTracker\",\"add\",\"deleteOne\",\"hasFrequency\"]\n[[],[1],[1],[1]]\n[\"FrequencyTracker\",\"hasFrequency\",\"add\",\"hasFrequency\"]\n[[],[2],[3],[1]]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Hash Table", + "slug": "hash-table", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Design", + "slug": "design", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class FrequencyTracker {\npublic:\n FrequencyTracker() {\n \n }\n \n void add(int number) {\n \n }\n \n void deleteOne(int number) {\n \n }\n \n bool hasFrequency(int frequency) {\n \n }\n};\n\n/**\n * Your FrequencyTracker object will be instantiated and called as such:\n * FrequencyTracker* obj = new FrequencyTracker();\n * obj->add(number);\n * obj->deleteOne(number);\n * bool param_3 = obj->hasFrequency(frequency);\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class FrequencyTracker {\n\n public FrequencyTracker() {\n \n }\n \n public void add(int number) {\n \n }\n \n public void deleteOne(int number) {\n \n }\n \n public boolean hasFrequency(int frequency) {\n \n }\n}\n\n/**\n * Your FrequencyTracker object will be instantiated and called as such:\n * FrequencyTracker obj = new FrequencyTracker();\n * obj.add(number);\n * obj.deleteOne(number);\n * boolean param_3 = obj.hasFrequency(frequency);\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class FrequencyTracker(object):\n\n def __init__(self):\n \n\n def add(self, number):\n \"\"\"\n :type number: int\n :rtype: None\n \"\"\"\n \n\n def deleteOne(self, number):\n \"\"\"\n :type number: int\n :rtype: None\n \"\"\"\n \n\n def hasFrequency(self, frequency):\n \"\"\"\n :type frequency: int\n :rtype: bool\n \"\"\"\n \n\n\n# Your FrequencyTracker object will be instantiated and called as such:\n# obj = FrequencyTracker()\n# obj.add(number)\n# obj.deleteOne(number)\n# param_3 = obj.hasFrequency(frequency)", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class FrequencyTracker:\n\n def __init__(self):\n \n\n def add(self, number: int) -> None:\n \n\n def deleteOne(self, number: int) -> None:\n \n\n def hasFrequency(self, frequency: int) -> bool:\n \n\n\n# Your FrequencyTracker object will be instantiated and called as such:\n# obj = FrequencyTracker()\n# obj.add(number)\n# obj.deleteOne(number)\n# param_3 = obj.hasFrequency(frequency)", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\n\ntypedef struct {\n \n} FrequencyTracker;\n\n\nFrequencyTracker* frequencyTrackerCreate() {\n \n}\n\nvoid frequencyTrackerAdd(FrequencyTracker* obj, int number) {\n \n}\n\nvoid frequencyTrackerDeleteOne(FrequencyTracker* obj, int number) {\n \n}\n\nbool frequencyTrackerHasFrequency(FrequencyTracker* obj, int frequency) {\n \n}\n\nvoid frequencyTrackerFree(FrequencyTracker* obj) {\n \n}\n\n/**\n * Your FrequencyTracker struct will be instantiated and called as such:\n * FrequencyTracker* obj = frequencyTrackerCreate();\n * frequencyTrackerAdd(obj, number);\n \n * frequencyTrackerDeleteOne(obj, number);\n \n * bool param_3 = frequencyTrackerHasFrequency(obj, frequency);\n \n * frequencyTrackerFree(obj);\n*/", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class FrequencyTracker {\n\n public FrequencyTracker() {\n \n }\n \n public void Add(int number) {\n \n }\n \n public void DeleteOne(int number) {\n \n }\n \n public bool HasFrequency(int frequency) {\n \n }\n}\n\n/**\n * Your FrequencyTracker object will be instantiated and called as such:\n * FrequencyTracker obj = new FrequencyTracker();\n * obj.Add(number);\n * obj.DeleteOne(number);\n * bool param_3 = obj.HasFrequency(frequency);\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "\nvar FrequencyTracker = function() {\n \n};\n\n/** \n * @param {number} number\n * @return {void}\n */\nFrequencyTracker.prototype.add = function(number) {\n \n};\n\n/** \n * @param {number} number\n * @return {void}\n */\nFrequencyTracker.prototype.deleteOne = function(number) {\n \n};\n\n/** \n * @param {number} frequency\n * @return {boolean}\n */\nFrequencyTracker.prototype.hasFrequency = function(frequency) {\n \n};\n\n/** \n * Your FrequencyTracker object will be instantiated and called as such:\n * var obj = new FrequencyTracker()\n * obj.add(number)\n * obj.deleteOne(number)\n * var param_3 = obj.hasFrequency(frequency)\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "class FrequencyTracker\n def initialize()\n \n end\n\n\n=begin\n :type number: Integer\n :rtype: Void\n=end\n def add(number)\n \n end\n\n\n=begin\n :type number: Integer\n :rtype: Void\n=end\n def delete_one(number)\n \n end\n\n\n=begin\n :type frequency: Integer\n :rtype: Boolean\n=end\n def has_frequency(frequency)\n \n end\n\n\nend\n\n# Your FrequencyTracker object will be instantiated and called as such:\n# obj = FrequencyTracker.new()\n# obj.add(number)\n# obj.delete_one(number)\n# param_3 = obj.has_frequency(frequency)", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "\nclass FrequencyTracker {\n\n init() {\n \n }\n \n func add(_ number: Int) {\n \n }\n \n func deleteOne(_ number: Int) {\n \n }\n \n func hasFrequency(_ frequency: Int) -> Bool {\n \n }\n}\n\n/**\n * Your FrequencyTracker object will be instantiated and called as such:\n * let obj = FrequencyTracker()\n * obj.add(number)\n * obj.deleteOne(number)\n * let ret_3: Bool = obj.hasFrequency(frequency)\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "type FrequencyTracker struct {\n \n}\n\n\nfunc Constructor() FrequencyTracker {\n \n}\n\n\nfunc (this *FrequencyTracker) Add(number int) {\n \n}\n\n\nfunc (this *FrequencyTracker) DeleteOne(number int) {\n \n}\n\n\nfunc (this *FrequencyTracker) HasFrequency(frequency int) bool {\n \n}\n\n\n/**\n * Your FrequencyTracker object will be instantiated and called as such:\n * obj := Constructor();\n * obj.Add(number);\n * obj.DeleteOne(number);\n * param_3 := obj.HasFrequency(frequency);\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "class FrequencyTracker() {\n\n def add(number: Int) {\n \n }\n\n def deleteOne(number: Int) {\n \n }\n\n def hasFrequency(frequency: Int): Boolean = {\n \n }\n\n}\n\n/**\n * Your FrequencyTracker object will be instantiated and called as such:\n * var obj = new FrequencyTracker()\n * obj.add(number)\n * obj.deleteOne(number)\n * var param_3 = obj.hasFrequency(frequency)\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class FrequencyTracker() {\n\n fun add(number: Int) {\n \n }\n\n fun deleteOne(number: Int) {\n \n }\n\n fun hasFrequency(frequency: Int): Boolean {\n \n }\n\n}\n\n/**\n * Your FrequencyTracker object will be instantiated and called as such:\n * var obj = FrequencyTracker()\n * obj.add(number)\n * obj.deleteOne(number)\n * var param_3 = obj.hasFrequency(frequency)\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "struct FrequencyTracker {\n\n}\n\n\n/** \n * `&self` means the method takes an immutable reference.\n * If you need a mutable reference, change it to `&mut self` instead.\n */\nimpl FrequencyTracker {\n\n fn new() -> Self {\n \n }\n \n fn add(&self, number: i32) {\n \n }\n \n fn delete_one(&self, number: i32) {\n \n }\n \n fn has_frequency(&self, frequency: i32) -> bool {\n \n }\n}\n\n/**\n * Your FrequencyTracker object will be instantiated and called as such:\n * let obj = FrequencyTracker::new();\n * obj.add(number);\n * obj.delete_one(number);\n * let ret_3: bool = obj.has_frequency(frequency);\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class FrequencyTracker {\n /**\n */\n function __construct() {\n \n }\n \n /**\n * @param Integer $number\n * @return NULL\n */\n function add($number) {\n \n }\n \n /**\n * @param Integer $number\n * @return NULL\n */\n function deleteOne($number) {\n \n }\n \n /**\n * @param Integer $frequency\n * @return Boolean\n */\n function hasFrequency($frequency) {\n \n }\n}\n\n/**\n * Your FrequencyTracker object will be instantiated and called as such:\n * $obj = FrequencyTracker();\n * $obj->add($number);\n * $obj->deleteOne($number);\n * $ret_3 = $obj->hasFrequency($frequency);\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "class FrequencyTracker {\n constructor() {\n\n }\n\n add(number: number): void {\n\n }\n\n deleteOne(number: number): void {\n\n }\n\n hasFrequency(frequency: number): boolean {\n\n }\n}\n\n/**\n * Your FrequencyTracker object will be instantiated and called as such:\n * var obj = new FrequencyTracker()\n * obj.add(number)\n * obj.deleteOne(number)\n * var param_3 = obj.hasFrequency(frequency)\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define frequency-tracker%\n (class object%\n (super-new)\n \n (init-field)\n \n ; add : exact-integer? -> void?\n (define/public (add number)\n\n )\n ; delete-one : exact-integer? -> void?\n (define/public (delete-one number)\n\n )\n ; has-frequency : exact-integer? -> boolean?\n (define/public (has-frequency frequency)\n\n )))\n\n;; Your frequency-tracker% object will be instantiated and called as such:\n;; (define obj (new frequency-tracker%))\n;; (send obj add number)\n;; (send obj delete-one number)\n;; (define param_3 (send obj has-frequency frequency))", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec frequency_tracker_init_() -> any().\nfrequency_tracker_init_() ->\n .\n\n-spec frequency_tracker_add(Number :: integer()) -> any().\nfrequency_tracker_add(Number) ->\n .\n\n-spec frequency_tracker_delete_one(Number :: integer()) -> any().\nfrequency_tracker_delete_one(Number) ->\n .\n\n-spec frequency_tracker_has_frequency(Frequency :: integer()) -> boolean().\nfrequency_tracker_has_frequency(Frequency) ->\n .\n\n\n%% Your functions will be called as such:\n%% frequency_tracker_init_(),\n%% frequency_tracker_add(Number),\n%% frequency_tracker_delete_one(Number),\n%% Param_3 = frequency_tracker_has_frequency(Frequency),\n\n%% frequency_tracker_init_ will be called before every test case, in which you can do some necessary initializations.", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule FrequencyTracker do\n @spec init_() :: any\n def init_() do\n\n end\n\n @spec add(number :: integer) :: any\n def add(number) do\n\n end\n\n @spec delete_one(number :: integer) :: any\n def delete_one(number) do\n\n end\n\n @spec has_frequency(frequency :: integer) :: boolean\n def has_frequency(frequency) do\n\n end\nend\n\n# Your functions will be called as such:\n# FrequencyTracker.init_()\n# FrequencyTracker.add(number)\n# FrequencyTracker.delete_one(number)\n# param_3 = FrequencyTracker.has_frequency(frequency)\n\n# FrequencyTracker.init_ will be called before every test case, in which you can do some necessary initializations.", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class FrequencyTracker {\n\n FrequencyTracker() {\n\n }\n \n void add(int number) {\n\n }\n \n void deleteOne(int number) {\n\n }\n \n bool hasFrequency(int frequency) {\n\n }\n}\n\n/**\n * Your FrequencyTracker object will be instantiated and called as such:\n * FrequencyTracker obj = FrequencyTracker();\n * obj.add(number);\n * obj.deleteOne(number);\n * bool param3 = obj.hasFrequency(frequency);\n */", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"13.8K\", \"totalSubmission\": \"50.3K\", \"totalAcceptedRaw\": 13807, \"totalSubmissionRaw\": 50337, \"acRate\": \"27.4%\"}", + "hints": [ + "Put all the numbers in a hash map (or just an integer array given the number range is small) to maintain each number’s frequency dynamically.", + "Put each frequency in another hash map (or just an integer array given the range is small, note there are only 200000 calls in total) to maintain each kind of frequency dynamically.", + "Keep the 2 hash maps in sync." + ], + "solution": null, + "status": null, + "sampleTestCase": "[\"FrequencyTracker\",\"add\",\"add\",\"hasFrequency\"]\n[[],[3],[3],[2]]", + "metaData": "{\n \"classname\": \"FrequencyTracker\",\n \"constructor\": {\n \"params\": []\n },\n \"methods\": [\n {\n \"params\": [\n {\n \"type\": \"integer\",\n \"name\": \"number\"\n }\n ],\n \"name\": \"add\",\n \"return\": {\n \"type\": \"void\"\n }\n },\n {\n \"params\": [\n {\n \"type\": \"integer\",\n \"name\": \"number\"\n }\n ],\n \"name\": \"deleteOne\",\n \"return\": {\n \"type\": \"void\"\n }\n },\n {\n \"params\": [\n {\n \"type\": \"integer\",\n \"name\": \"frequency\"\n }\n ],\n \"name\": \"hasFrequency\",\n \"return\": {\n \"type\": \"boolean\"\n }\n }\n ],\n \"return\": {\n \"type\": \"boolean\"\n },\n \"systemdesign\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 17 standard.

\\r\\n\\r\\n

Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\"], \"java\": [\"Java\", \"

OpenJDK 17. Java 8 features such as lambda expressions and stream API can be used.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n

Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

\"], \"python\": [\"Python\", \"

Python 2.7.12.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\\r\\n\\r\\n

Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.

\"], \"c\": [\"C\", \"

Compiled with gcc 8.2 using the gnu11 standard.

\\r\\n\\r\\n

Your code is compiled with level one optimization (-O1). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n\\r\\n

For hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:

\\r\\n\\r\\n

1. Adding an item to a hash.\\r\\n

\\r\\nstruct hash_entry {\\r\\n    int id;            /* we'll use this field as the key */\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n
\\r\\n

\\r\\n\\r\\n

2. Looking up an item in a hash:\\r\\n

\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n
\\r\\n

\\r\\n\\r\\n

3. Deleting an item in a hash:\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n
\\r\\n

\"], \"csharp\": [\"C#\", \"

C# 10 with .NET 6 runtime

\"], \"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

\\r\\n\\r\\n

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

\\r\\n\\r\\n

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"], \"racket\": [\"Racket\", \"

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

\\r\\n\\r\\n

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/make-costs-of-paths-equal-in-a-binary-tree.json b/leetcode/originData/make-costs-of-paths-equal-in-a-binary-tree.json new file mode 100644 index 00000000..37090ff8 --- /dev/null +++ b/leetcode/originData/make-costs-of-paths-equal-in-a-binary-tree.json @@ -0,0 +1,192 @@ +{ + "data": { + "question": { + "questionId": "2780", + "questionFrontendId": "2673", + "boundTopicId": null, + "title": "Make Costs of Paths Equal in a Binary Tree", + "titleSlug": "make-costs-of-paths-equal-in-a-binary-tree", + "content": "

You are given an integer n representing the number of nodes in a perfect binary tree consisting of nodes numbered from 1 to n. The root of the tree is node 1 and each node i in the tree has two children where the left child is the node 2 * i and the right child is 2 * i + 1.

\n\n

Each node in the tree also has a cost represented by a given 0-indexed integer array cost of size n where cost[i] is the cost of node i + 1. You are allowed to increment the cost of any node by 1 any number of times.

\n\n

Return the minimum number of increments you need to make the cost of paths from the root to each leaf node equal.

\n\n

Note:

\n\n
    \n\t
  • A perfect binary tree is a tree where each node, except the leaf nodes, has exactly 2 children.
  • \n\t
  • The cost of a path is the sum of costs of nodes in the path.
  • \n
\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: n = 7, cost = [1,5,2,2,3,3,1]\nOutput: 6\nExplanation: We can do the following increments:\n- Increase the cost of node 4 one time.\n- Increase the cost of node 3 three times.\n- Increase the cost of node 7 two times.\nEach path from the root to a leaf will have a total cost of 9.\nThe total increments we did is 1 + 3 + 2 = 6.\nIt can be shown that this is the minimum answer we can achieve.\n
\n\n

Example 2:

\n\"\"\n
\nInput: n = 3, cost = [5,3,3]\nOutput: 0\nExplanation: The two paths already have equal total costs, so no increments are needed.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 3 <= n <= 105
  • \n\t
  • n + 1 is a power of 2
  • \n\t
  • cost.length == n
  • \n\t
  • 1 <= cost[i] <= 104
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 308, + "dislikes": 3, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "7\n[1,5,2,2,3,3,1]\n3\n[5,3,3]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Dynamic Programming", + "slug": "dynamic-programming", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Greedy", + "slug": "greedy", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Tree", + "slug": "tree", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Binary Tree", + "slug": "binary-tree", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int minIncrements(int n, vector& cost) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int minIncrements(int n, int[] cost) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def minIncrements(self, n, cost):\n \"\"\"\n :type n: int\n :type cost: List[int]\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def minIncrements(self, n: int, cost: List[int]) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int minIncrements(int n, int* cost, int costSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MinIncrements(int n, int[] cost) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @param {number[]} cost\n * @return {number}\n */\nvar minIncrements = function(n, cost) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @param {Integer[]} cost\n# @return {Integer}\ndef min_increments(n, cost)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func minIncrements(_ n: Int, _ cost: [Int]) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func minIncrements(n int, cost []int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def minIncrements(n: Int, cost: Array[Int]): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun minIncrements(n: Int, cost: IntArray): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn min_increments(n: i32, cost: Vec) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer[] $cost\n * @return Integer\n */\n function minIncrements($n, $cost) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function minIncrements(n: number, cost: number[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (min-increments n cost)\n (-> exact-integer? (listof exact-integer?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec min_increments(N :: integer(), Cost :: [integer()]) -> integer().\nmin_increments(N, Cost) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec min_increments(n :: integer, cost :: [integer]) :: integer\n def min_increments(n, cost) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int minIncrements(int n, List cost) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"8.1K\", \"totalSubmission\": \"13.8K\", \"totalAcceptedRaw\": 8082, \"totalSubmissionRaw\": 13810, \"acRate\": \"58.5%\"}", + "hints": [ + "The path from the root to a leaf that has the maximum cost should not be modified.", + "The optimal way is to increase all other paths to make their costs equal to the path with maximum cost." + ], + "solution": null, + "status": null, + "sampleTestCase": "7\n[1,5,2,2,3,3,1]", + "metaData": "{\n \"name\": \"minIncrements\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"cost\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 17 standard.

\\r\\n\\r\\n

Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\"], \"java\": [\"Java\", \"

OpenJDK 17. Java 8 features such as lambda expressions and stream API can be used.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n

Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

\"], \"python\": [\"Python\", \"

Python 2.7.12.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\\r\\n\\r\\n

Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.

\"], \"c\": [\"C\", \"

Compiled with gcc 8.2 using the gnu11 standard.

\\r\\n\\r\\n

Your code is compiled with level one optimization (-O1). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n\\r\\n

For hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:

\\r\\n\\r\\n

1. Adding an item to a hash.\\r\\n

\\r\\nstruct hash_entry {\\r\\n    int id;            /* we'll use this field as the key */\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n
\\r\\n

\\r\\n\\r\\n

2. Looking up an item in a hash:\\r\\n

\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n
\\r\\n

\\r\\n\\r\\n

3. Deleting an item in a hash:\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n
\\r\\n

\"], \"csharp\": [\"C#\", \"

C# 10 with .NET 6 runtime

\"], \"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

\\r\\n\\r\\n

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

\\r\\n\\r\\n

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"], \"racket\": [\"Racket\", \"

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

\\r\\n\\r\\n

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/maximum-number-of-moves-in-a-grid.json b/leetcode/originData/maximum-number-of-moves-in-a-grid.json new file mode 100644 index 00000000..5abc503e --- /dev/null +++ b/leetcode/originData/maximum-number-of-moves-in-a-grid.json @@ -0,0 +1,161 @@ +{ + "data": { + "question": { + "questionId": "2794", + "questionFrontendId": "2684", + "boundTopicId": null, + "title": "Maximum Number of Moves in a Grid", + "titleSlug": "maximum-number-of-moves-in-a-grid", + "content": "

You are given a 0-indexed m x n matrix grid consisting of positive integers.

\n\n

You can start at any cell in the first column of the matrix, and traverse the grid in the following way:

\n\n
    \n\t
  • From a cell (row, col), you can move to any of the cells: (row - 1, col + 1), (row, col + 1) and (row + 1, col + 1) such that the value of the cell you move to, should be strictly bigger than the value of the current cell.
  • \n
\n\n

Return the maximum number of moves that you can perform.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: grid = [[2,4,3,5],[5,4,9,3],[3,4,2,11],[10,9,13,15]]\nOutput: 3\nExplanation: We can start at the cell (0, 0) and make the following moves:\n- (0, 0) -> (0, 1).\n- (0, 1) -> (1, 2).\n- (1, 2) -> (2, 3).\nIt can be shown that it is the maximum number of moves that can be made.
\n\n

Example 2:

\n\n
\n\"\"\nInput: grid = [[3,2,4],[2,1,9],[1,1,7]]\nOutput: 0\nExplanation: Starting from any cell in the first column we cannot perform any moves.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • m == grid.length
  • \n\t
  • n == grid[i].length
  • \n\t
  • 2 <= m, n <= 1000
  • \n\t
  • 4 <= m * n <= 105
  • \n\t
  • 1 <= grid[i][j] <= 106
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 157, + "dislikes": 3, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "[[2,4,3,5],[5,4,9,3],[3,4,2,11],[10,9,13,15]]\n[[3,2,4],[2,1,9],[1,1,7]]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int maxMoves(vector>& grid) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int maxMoves(int[][] grid) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def maxMoves(self, grid):\n \"\"\"\n :type grid: List[List[int]]\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def maxMoves(self, grid: List[List[int]]) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int maxMoves(int** grid, int gridSize, int* gridColSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MaxMoves(int[][] grid) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[][]} grid\n * @return {number}\n */\nvar maxMoves = function(grid) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[][]} grid\n# @return {Integer}\ndef max_moves(grid)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func maxMoves(_ grid: [[Int]]) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func maxMoves(grid [][]int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def maxMoves(grid: Array[Array[Int]]): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun maxMoves(grid: Array): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn max_moves(grid: Vec>) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[][] $grid\n * @return Integer\n */\n function maxMoves($grid) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function maxMoves(grid: number[][]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (max-moves grid)\n (-> (listof (listof exact-integer?)) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec max_moves(Grid :: [[integer()]]) -> integer().\nmax_moves(Grid) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec max_moves(grid :: [[integer]]) :: integer\n def max_moves(grid) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int maxMoves(List> grid) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"9.8K\", \"totalSubmission\": \"22.6K\", \"totalAcceptedRaw\": 9802, \"totalSubmissionRaw\": 22553, \"acRate\": \"43.5%\"}", + "hints": [ + "Consider using dynamic programming to find the maximum number of moves that can be made from each cell.", + "The final answer will be the maximum value in cells of the first column." + ], + "solution": null, + "status": null, + "sampleTestCase": "[[2,4,3,5],[5,4,9,3],[3,4,2,11],[10,9,13,15]]", + "metaData": "{\n \"name\": \"maxMoves\",\n \"params\": [\n {\n \"name\": \"grid\",\n \"type\": \"integer[][]\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 17 standard.

\\r\\n\\r\\n

Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\"], \"java\": [\"Java\", \"

OpenJDK 17. Java 8 features such as lambda expressions and stream API can be used.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n

Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

\"], \"python\": [\"Python\", \"

Python 2.7.12.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\\r\\n\\r\\n

Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.

\"], \"c\": [\"C\", \"

Compiled with gcc 8.2 using the gnu11 standard.

\\r\\n\\r\\n

Your code is compiled with level one optimization (-O1). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n\\r\\n

For hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:

\\r\\n\\r\\n

1. Adding an item to a hash.\\r\\n

\\r\\nstruct hash_entry {\\r\\n    int id;            /* we'll use this field as the key */\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n
\\r\\n

\\r\\n\\r\\n

2. Looking up an item in a hash:\\r\\n

\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n
\\r\\n

\\r\\n\\r\\n

3. Deleting an item in a hash:\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n
\\r\\n

\"], \"csharp\": [\"C#\", \"

C# 10 with .NET 6 runtime

\"], \"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

\\r\\n\\r\\n

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

\\r\\n\\r\\n

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"], \"racket\": [\"Racket\", \"

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

\\r\\n\\r\\n

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/maximum-or.json b/leetcode/originData/maximum-or.json new file mode 100644 index 00000000..ac05888a --- /dev/null +++ b/leetcode/originData/maximum-or.json @@ -0,0 +1,161 @@ +{ + "data": { + "question": { + "questionId": "2730", + "questionFrontendId": "2680", + "boundTopicId": null, + "title": "Maximum OR", + "titleSlug": "maximum-or", + "content": "

You are given a 0-indexed integer array nums of length n and an integer k. In an operation, you can choose an element and multiply it by 2.

\n\n

Return the maximum possible value of nums[0] | nums[1] | ... | nums[n - 1] that can be obtained after applying the operation on nums at most k times.

\n\n

Note that a | b denotes the bitwise or between two integers a and b.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [12,9], k = 1\nOutput: 30\nExplanation: If we apply the operation to index 1, our new array nums will be equal to [12,18]. Thus, we return the bitwise or of 12 and 18, which is 30.\n
\n\n

Example 2:

\n\n
\nInput: nums = [8,1,2], k = 2\nOutput: 35\nExplanation: If we apply the operation twice on index 0, we yield a new array of [32,1,2]. Thus, we return 32|1|2 = 35.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 105
  • \n\t
  • 1 <= nums[i] <= 109
  • \n\t
  • 1 <= k <= 15
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 172, + "dislikes": 28, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "[12,9]\n1\n[8,1,2]\n2", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n long long maximumOr(vector& nums, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public long maximumOr(int[] nums, int k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def maximumOr(self, nums, k):\n \"\"\"\n :type nums: List[int]\n :type k: int\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def maximumOr(self, nums: List[int], k: int) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "long long maximumOr(int* nums, int numsSize, int k){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public long MaximumOr(int[] nums, int k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @param {number} k\n * @return {number}\n */\nvar maximumOr = function(nums, k) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @param {Integer} k\n# @return {Integer}\ndef maximum_or(nums, k)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func maximumOr(_ nums: [Int], _ k: Int) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func maximumOr(nums []int, k int) int64 {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def maximumOr(nums: Array[Int], k: Int): Long = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun maximumOr(nums: IntArray, k: Int): Long {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn maximum_or(nums: Vec, k: i32) -> i64 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums\n * @param Integer $k\n * @return Integer\n */\n function maximumOr($nums, $k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function maximumOr(nums: number[], k: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (maximum-or nums k)\n (-> (listof exact-integer?) exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec maximum_or(Nums :: [integer()], K :: integer()) -> integer().\nmaximum_or(Nums, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec maximum_or(nums :: [integer], k :: integer) :: integer\n def maximum_or(nums, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int maximumOr(List nums, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"6.5K\", \"totalSubmission\": \"17.4K\", \"totalAcceptedRaw\": 6455, \"totalSubmissionRaw\": 17425, \"acRate\": \"37.0%\"}", + "hints": [ + "The optimal solution should apply all the k operations on a single number.", + "Calculate the prefix or and the suffix or and perform k operations over each element, and maximize the answer." + ], + "solution": null, + "status": null, + "sampleTestCase": "[12,9]\n1", + "metaData": "{\n \"name\": \"maximumOr\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n }\n ],\n \"return\": {\n \"type\": \"long\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 17 standard.

\\r\\n\\r\\n

Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\"], \"java\": [\"Java\", \"

OpenJDK 17. Java 8 features such as lambda expressions and stream API can be used.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n

Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

\"], \"python\": [\"Python\", \"

Python 2.7.12.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\\r\\n\\r\\n

Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.

\"], \"c\": [\"C\", \"

Compiled with gcc 8.2 using the gnu11 standard.

\\r\\n\\r\\n

Your code is compiled with level one optimization (-O1). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n\\r\\n

For hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:

\\r\\n\\r\\n

1. Adding an item to a hash.\\r\\n

\\r\\nstruct hash_entry {\\r\\n    int id;            /* we'll use this field as the key */\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n
\\r\\n

\\r\\n\\r\\n

2. Looking up an item in a hash:\\r\\n

\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n
\\r\\n

\\r\\n\\r\\n

3. Deleting an item in a hash:\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n
\\r\\n

\"], \"csharp\": [\"C#\", \"

C# 10 with .NET 6 runtime

\"], \"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

\\r\\n\\r\\n

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

\\r\\n\\r\\n

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"], \"racket\": [\"Racket\", \"

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

\\r\\n\\r\\n

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/neighboring-bitwise-xor.json b/leetcode/originData/neighboring-bitwise-xor.json new file mode 100644 index 00000000..e288ea11 --- /dev/null +++ b/leetcode/originData/neighboring-bitwise-xor.json @@ -0,0 +1,161 @@ +{ + "data": { + "question": { + "questionId": "2792", + "questionFrontendId": "2683", + "boundTopicId": null, + "title": "Neighboring Bitwise XOR", + "titleSlug": "neighboring-bitwise-xor", + "content": "

A 0-indexed array derived with length n is derived by computing the bitwise XOR (⊕) of adjacent values in a binary array original of length n.

\n\n

Specifically, for each index i in the range [0, n - 1]:

\n\n
    \n\t
  • If i = n - 1, then derived[i] = original[i] ⊕ original[0].
  • \n\t
  • Otherwise, derived[i] = original[i] ⊕ original[i + 1].
  • \n
\n\n

Given an array derived, your task is to determine whether there exists a valid binary array original that could have formed derived.

\n\n

Return true if such an array exists or false otherwise.

\n\n
    \n\t
  • A binary array is an array containing only 0's and 1's
  • \n
\n\n

 

\n

Example 1:

\n\n
\nInput: derived = [1,1,0]\nOutput: true\nExplanation: A valid original array that gives derived is [0,1,0].\nderived[0] = original[0] ⊕ original[1] = 0 ⊕ 1 = 1 \nderived[1] = original[1] ⊕ original[2] = 1 ⊕ 0 = 1\nderived[2] = original[2] ⊕ original[0] = 0 ⊕ 0 = 0\n
\n\n

Example 2:

\n\n
\nInput: derived = [1,1]\nOutput: true\nExplanation: A valid original array that gives derived is [0,1].\nderived[0] = original[0] ⊕ original[1] = 1\nderived[1] = original[1] ⊕ original[0] = 1\n
\n\n

Example 3:

\n\n
\nInput: derived = [1,0]\nOutput: false\nExplanation: There is no valid original array that gives derived.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • n == derived.length
  • \n\t
  • 1 <= n <= 105
  • \n\t
  • The values in derived are either 0's or 1's
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 116, + "dislikes": 5, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "[1,1,0]\n[1,1]\n[1,0]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n bool doesValidArrayExist(vector& derived) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public boolean doesValidArrayExist(int[] derived) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def doesValidArrayExist(self, derived):\n \"\"\"\n :type derived: List[int]\n :rtype: bool\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def doesValidArrayExist(self, derived: List[int]) -> bool:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "bool doesValidArrayExist(int* derived, int derivedSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public bool DoesValidArrayExist(int[] derived) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} derived\n * @return {boolean}\n */\nvar doesValidArrayExist = function(derived) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} derived\n# @return {Boolean}\ndef does_valid_array_exist(derived)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func doesValidArrayExist(_ derived: [Int]) -> Bool {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func doesValidArrayExist(derived []int) bool {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def doesValidArrayExist(derived: Array[Int]): Boolean = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun doesValidArrayExist(derived: IntArray): Boolean {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn does_valid_array_exist(derived: Vec) -> bool {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $derived\n * @return Boolean\n */\n function doesValidArrayExist($derived) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function doesValidArrayExist(derived: number[]): boolean {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (does-valid-array-exist derived)\n (-> (listof exact-integer?) boolean?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec does_valid_array_exist(Derived :: [integer()]) -> boolean().\ndoes_valid_array_exist(Derived) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec does_valid_array_exist(derived :: [integer]) :: boolean\n def does_valid_array_exist(derived) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n bool doesValidArrayExist(List derived) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"11.3K\", \"totalSubmission\": \"19.1K\", \"totalAcceptedRaw\": 11259, \"totalSubmissionRaw\": 19142, \"acRate\": \"58.8%\"}", + "hints": [ + "Understand that from the original element, we are using each element twice to construct the derived array", + "The xor-sum of the derived array should be 0 since there is always a duplicate occurrence of each element." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,1,0]", + "metaData": "{\n \"name\": \"doesValidArrayExist\",\n \"params\": [\n {\n \"name\": \"derived\",\n \"type\": \"integer[]\"\n }\n ],\n \"return\": {\n \"type\": \"boolean\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 17 standard.

\\r\\n\\r\\n

Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\"], \"java\": [\"Java\", \"

OpenJDK 17. Java 8 features such as lambda expressions and stream API can be used.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n

Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

\"], \"python\": [\"Python\", \"

Python 2.7.12.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\\r\\n\\r\\n

Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.

\"], \"c\": [\"C\", \"

Compiled with gcc 8.2 using the gnu11 standard.

\\r\\n\\r\\n

Your code is compiled with level one optimization (-O1). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n\\r\\n

For hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:

\\r\\n\\r\\n

1. Adding an item to a hash.\\r\\n

\\r\\nstruct hash_entry {\\r\\n    int id;            /* we'll use this field as the key */\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n
\\r\\n

\\r\\n\\r\\n

2. Looking up an item in a hash:\\r\\n

\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n
\\r\\n

\\r\\n\\r\\n

3. Deleting an item in a hash:\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n
\\r\\n

\"], \"csharp\": [\"C#\", \"

C# 10 with .NET 6 runtime

\"], \"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

\\r\\n\\r\\n

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

\\r\\n\\r\\n

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"], \"racket\": [\"Racket\", \"

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

\\r\\n\\r\\n

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/number-of-adjacent-elements-with-the-same-color.json b/leetcode/originData/number-of-adjacent-elements-with-the-same-color.json new file mode 100644 index 00000000..3c75964c --- /dev/null +++ b/leetcode/originData/number-of-adjacent-elements-with-the-same-color.json @@ -0,0 +1,169 @@ +{ + "data": { + "question": { + "questionId": "2779", + "questionFrontendId": "2672", + "boundTopicId": null, + "title": "Number of Adjacent Elements With the Same Color", + "titleSlug": "number-of-adjacent-elements-with-the-same-color", + "content": "

There is a 0-indexed array nums of length n. Initially, all elements are uncolored (has a value of 0).

\n\n

You are given a 2D integer array queries where queries[i] = [indexi, colori].

\n\n

For each query, you color the index indexi with the color colori in the array nums.

\n\n

Return an array answer of the same length as queries where answer[i] is the number of adjacent elements with the same color after the ith query.

\n\n

More formally, answer[i] is the number of indices j, such that 0 <= j < n - 1 and nums[j] == nums[j + 1] and nums[j] != 0 after the ith query.

\n\n

 

\n

Example 1:

\n\n
\nInput: n = 4, queries = [[0,2],[1,2],[3,1],[1,1],[2,1]]\nOutput: [0,1,1,0,2]\nExplanation: Initially array nums = [0,0,0,0], where 0 denotes uncolored elements of the array.\n- After the 1st query nums = [2,0,0,0]. The count of adjacent elements with the same color is 0.\n- After the 2nd query nums = [2,2,0,0]. The count of adjacent elements with the same color is 1.\n- After the 3rd query nums = [2,2,0,1]. The count of adjacent elements with the same color is 1.\n- After the 4th query nums = [2,1,0,1]. The count of adjacent elements with the same color is 0.\n- After the 5th query nums = [2,1,1,1]. The count of adjacent elements with the same color is 2.\n
\n\n

Example 2:

\n\n
\nInput: n = 1, queries = [[0,100000]]\nOutput: [0]\nExplanation: Initially array nums = [0], where 0 denotes uncolored elements of the array.\n- After the 1st query nums = [100000]. The count of adjacent elements with the same color is 0.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= n <= 105
  • \n\t
  • 1 <= queries.length <= 105
  • \n\t
  • queries[i].length == 2
  • \n\t
  • 0 <= indexi <= n - 1
  • \n\t
  • 1 <=  colori <= 105
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 222, + "dislikes": 64, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "4\n[[0,2],[1,2],[3,1],[1,1],[2,1]]\n1\n[[0,100000]]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n vector colorTheArray(int n, vector>& queries) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int[] colorTheArray(int n, int[][] queries) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def colorTheArray(self, n, queries):\n \"\"\"\n :type n: int\n :type queries: List[List[int]]\n :rtype: List[int]\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def colorTheArray(self, n: int, queries: List[List[int]]) -> List[int]:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "/**\n * Note: The returned array must be malloced, assume caller calls free().\n */\nint* colorTheArray(int n, int** queries, int queriesSize, int* queriesColSize, int* returnSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int[] ColorTheArray(int n, int[][] queries) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @param {number[][]} queries\n * @return {number[]}\n */\nvar colorTheArray = function(n, queries) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @param {Integer[][]} queries\n# @return {Integer[]}\ndef color_the_array(n, queries)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func colorTheArray(_ n: Int, _ queries: [[Int]]) -> [Int] {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func colorTheArray(n int, queries [][]int) []int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def colorTheArray(n: Int, queries: Array[Array[Int]]): Array[Int] = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun colorTheArray(n: Int, queries: Array): IntArray {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn color_the_array(n: i32, queries: Vec>) -> Vec {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer[][] $queries\n * @return Integer[]\n */\n function colorTheArray($n, $queries) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function colorTheArray(n: number, queries: number[][]): number[] {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (color-the-array n queries)\n (-> exact-integer? (listof (listof exact-integer?)) (listof exact-integer?))\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec color_the_array(N :: integer(), Queries :: [[integer()]]) -> [integer()].\ncolor_the_array(N, Queries) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec color_the_array(n :: integer, queries :: [[integer]]) :: [integer]\n def color_the_array(n, queries) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n List colorTheArray(int n, List> queries) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"10.2K\", \"totalSubmission\": \"18.7K\", \"totalAcceptedRaw\": 10236, \"totalSubmissionRaw\": 18742, \"acRate\": \"54.6%\"}", + "hints": [ + "Since at each query, only one element is being recolored, we just need to focus on its neighbors.", + "If an element that is changed on the i-th query had the same color as its right element answer decreases by 1. Similarly contributes its left element too.", + "After changing the color, if the element has the same color as its right element answer increases by 1. Similarly contributes its left element too." + ], + "solution": null, + "status": null, + "sampleTestCase": "4\n[[0,2],[1,2],[3,1],[1,1],[2,1]]", + "metaData": "{\n \"name\": \"colorTheArray\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer[][]\",\n \"name\": \"queries\"\n }\n ],\n \"return\": {\n \"type\": \"integer[]\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 17 standard.

\\r\\n\\r\\n

Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\"], \"java\": [\"Java\", \"

OpenJDK 17. Java 8 features such as lambda expressions and stream API can be used.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n

Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

\"], \"python\": [\"Python\", \"

Python 2.7.12.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\\r\\n\\r\\n

Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.

\"], \"c\": [\"C\", \"

Compiled with gcc 8.2 using the gnu11 standard.

\\r\\n\\r\\n

Your code is compiled with level one optimization (-O1). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n\\r\\n

For hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:

\\r\\n\\r\\n

1. Adding an item to a hash.\\r\\n

\\r\\nstruct hash_entry {\\r\\n    int id;            /* we'll use this field as the key */\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n
\\r\\n

\\r\\n\\r\\n

2. Looking up an item in a hash:\\r\\n

\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n
\\r\\n

\\r\\n\\r\\n

3. Deleting an item in a hash:\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n
\\r\\n

\"], \"csharp\": [\"C#\", \"

C# 10 with .NET 6 runtime

\"], \"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

\\r\\n\\r\\n

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

\\r\\n\\r\\n

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"], \"racket\": [\"Racket\", \"

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

\\r\\n\\r\\n

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/number-of-senior-citizens.json b/leetcode/originData/number-of-senior-citizens.json new file mode 100644 index 00000000..d583ca9c --- /dev/null +++ b/leetcode/originData/number-of-senior-citizens.json @@ -0,0 +1,161 @@ +{ + "data": { + "question": { + "questionId": "2727", + "questionFrontendId": "2678", + "boundTopicId": null, + "title": "Number of Senior Citizens", + "titleSlug": "number-of-senior-citizens", + "content": "

You are given a 0-indexed array of strings details. Each element of details provides information about a given passenger compressed into a string of length 15. The system is such that:

\n\n
    \n\t
  • The first ten characters consist of the phone number of passengers.
  • \n\t
  • The next character denotes the gender of the person.
  • \n\t
  • The following two characters are used to indicate the age of the person.
  • \n\t
  • The last two characters determine the seat allotted to that person.
  • \n
\n\n

Return the number of passengers who are strictly more than 60 years old.

\n\n

 

\n

Example 1:

\n\n
\nInput: details = ["7868190130M7522","5303914400F9211","9273338290F4010"]\nOutput: 2\nExplanation: The passengers at indices 0, 1, and 2 have ages 75, 92, and 40. Thus, there are 2 people who are over 60 years old.\n
\n\n

Example 2:

\n\n
\nInput: details = ["1313579440F2036","2921522980M5644"]\nOutput: 0\nExplanation: None of the passengers are older than 60.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= details.length <= 100
  • \n\t
  • details[i].length == 15
  • \n\t
  • details[i] consists of digits from '0' to '9'.
  • \n\t
  • details[i][10] is either 'M' or 'F' or 'O'.
  • \n\t
  • The phone numbers and seat numbers of the passengers are distinct.
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 50, + "dislikes": 4, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "[\"7868190130M7522\",\"5303914400F9211\",\"9273338290F4010\"]\n[\"1313579440F2036\",\"2921522980M5644\"]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int countSeniors(vector& details) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int countSeniors(String[] details) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def countSeniors(self, details):\n \"\"\"\n :type details: List[str]\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def countSeniors(self, details: List[str]) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int countSeniors(char ** details, int detailsSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int CountSeniors(string[] details) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {string[]} details\n * @return {number}\n */\nvar countSeniors = function(details) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {String[]} details\n# @return {Integer}\ndef count_seniors(details)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func countSeniors(_ details: [String]) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func countSeniors(details []string) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def countSeniors(details: Array[String]): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun countSeniors(details: Array): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn count_seniors(details: Vec) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param String[] $details\n * @return Integer\n */\n function countSeniors($details) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function countSeniors(details: string[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (count-seniors details)\n (-> (listof string?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec count_seniors(Details :: [unicode:unicode_binary()]) -> integer().\ncount_seniors(Details) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec count_seniors(details :: [String.t]) :: integer\n def count_seniors(details) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int countSeniors(List details) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"16.6K\", \"totalSubmission\": \"21.1K\", \"totalAcceptedRaw\": 16607, \"totalSubmissionRaw\": 21114, \"acRate\": \"78.7%\"}", + "hints": [ + "Convert the value at index 11 and 12 to a numerical value.", + "The age of the person at index i is equal to details[i][11]*10+details[i][12]." + ], + "solution": null, + "status": null, + "sampleTestCase": "[\"7868190130M7522\",\"5303914400F9211\",\"9273338290F4010\"]", + "metaData": "{\n \"name\": \"countSeniors\",\n \"params\": [\n {\n \"name\": \"details\",\n \"type\": \"string[]\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 17 standard.

\\r\\n\\r\\n

Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\"], \"java\": [\"Java\", \"

OpenJDK 17. Java 8 features such as lambda expressions and stream API can be used.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n

Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

\"], \"python\": [\"Python\", \"

Python 2.7.12.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\\r\\n\\r\\n

Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.

\"], \"c\": [\"C\", \"

Compiled with gcc 8.2 using the gnu11 standard.

\\r\\n\\r\\n

Your code is compiled with level one optimization (-O1). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n\\r\\n

For hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:

\\r\\n\\r\\n

1. Adding an item to a hash.\\r\\n

\\r\\nstruct hash_entry {\\r\\n    int id;            /* we'll use this field as the key */\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n
\\r\\n

\\r\\n\\r\\n

2. Looking up an item in a hash:\\r\\n

\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n
\\r\\n

\\r\\n\\r\\n

3. Deleting an item in a hash:\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n
\\r\\n

\"], \"csharp\": [\"C#\", \"

C# 10 with .NET 6 runtime

\"], \"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

\\r\\n\\r\\n

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

\\r\\n\\r\\n

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"], \"racket\": [\"Racket\", \"

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

\\r\\n\\r\\n

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/power-of-heroes.json b/leetcode/originData/power-of-heroes.json new file mode 100644 index 00000000..5c30d517 --- /dev/null +++ b/leetcode/originData/power-of-heroes.json @@ -0,0 +1,163 @@ +{ + "data": { + "question": { + "questionId": "2784", + "questionFrontendId": "2681", + "boundTopicId": null, + "title": "Power of Heroes", + "titleSlug": "power-of-heroes", + "content": "

You are given a 0-indexed integer array nums representing the strength of some heroes. The power of a group of heroes is defined as follows:

\n\n
    \n\t
  • Let i0, i1, ... ,ik be the indices of the heroes in a group. Then, the power of this group is max(nums[i0], nums[i1], ... ,nums[ik])2 * min(nums[i0], nums[i1], ... ,nums[ik]).
  • \n
\n\n

Return the sum of the power of all non-empty groups of heroes possible. Since the sum could be very large, return it modulo 109 + 7.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [2,1,4]\nOutput: 141\nExplanation: \n1st group: [2] has power = 22 * 2 = 8.\n2nd group: [1] has power = 12 * 1 = 1. \n3rd group: [4] has power = 42 * 4 = 64. \n4th group: [2,1] has power = 22 * 1 = 4. \n5th group: [2,4] has power = 42 * 2 = 32. \n6th group: [1,4] has power = 42 * 1 = 16. \n​​​​​​​7th group: [2,1,4] has power = 42​​​​​​​ * 1 = 16. \nThe sum of powers of all groups is 8 + 1 + 64 + 4 + 32 + 16 + 16 = 141.\n\n
\n\n

Example 2:

\n\n
\nInput: nums = [1,1,1]\nOutput: 7\nExplanation: A total of 7 groups are possible, and the power of each group will be 1. Therefore, the sum of the powers of all groups is 7.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 105
  • \n\t
  • 1 <= nums[i] <= 109
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 135, + "dislikes": 10, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "[2,1,4]\n[1,1,1]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int sumOfPower(vector& nums) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int sumOfPower(int[] nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def sumOfPower(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def sumOfPower(self, nums: List[int]) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int sumOfPower(int* nums, int numsSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int SumOfPower(int[] nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @return {number}\n */\nvar sumOfPower = function(nums) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @return {Integer}\ndef sum_of_power(nums)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func sumOfPower(_ nums: [Int]) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func sumOfPower(nums []int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def sumOfPower(nums: Array[Int]): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun sumOfPower(nums: IntArray): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn sum_of_power(nums: Vec) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums\n * @return Integer\n */\n function sumOfPower($nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function sumOfPower(nums: number[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (sum-of-power nums)\n (-> (listof exact-integer?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec sum_of_power(Nums :: [integer()]) -> integer().\nsum_of_power(Nums) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec sum_of_power(nums :: [integer]) :: integer\n def sum_of_power(nums) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int sumOfPower(List nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"3.9K\", \"totalSubmission\": \"14.7K\", \"totalAcceptedRaw\": 3898, \"totalSubmissionRaw\": 14666, \"acRate\": \"26.6%\"}", + "hints": [ + "Try something with sorting the array.", + "For a pair of array elements nums[i] and nums[j] (i < j), the power would be nums[i]*nums[j]^2 regardless of how many elements in between are included.", + "The number of subsets with the above as power will correspond to 2^(j-i-1).", + "Try collecting the terms for nums[0], nums[1], …, nums[j-1] when computing the power of heroes ending at index j to get the power in a single pass." + ], + "solution": null, + "status": null, + "sampleTestCase": "[2,1,4]", + "metaData": "{\n \"name\": \"sumOfPower\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 17 standard.

\\r\\n\\r\\n

Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\"], \"java\": [\"Java\", \"

OpenJDK 17. Java 8 features such as lambda expressions and stream API can be used.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n

Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

\"], \"python\": [\"Python\", \"

Python 2.7.12.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\\r\\n\\r\\n

Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.

\"], \"c\": [\"C\", \"

Compiled with gcc 8.2 using the gnu11 standard.

\\r\\n\\r\\n

Your code is compiled with level one optimization (-O1). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n\\r\\n

For hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:

\\r\\n\\r\\n

1. Adding an item to a hash.\\r\\n

\\r\\nstruct hash_entry {\\r\\n    int id;            /* we'll use this field as the key */\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n
\\r\\n

\\r\\n\\r\\n

2. Looking up an item in a hash:\\r\\n

\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n
\\r\\n

\\r\\n\\r\\n

3. Deleting an item in a hash:\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n
\\r\\n

\"], \"csharp\": [\"C#\", \"

C# 10 with .NET 6 runtime

\"], \"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

\\r\\n\\r\\n

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

\\r\\n\\r\\n

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"], \"racket\": [\"Racket\", \"

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

\\r\\n\\r\\n

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/sum-in-a-matrix.json b/leetcode/originData/sum-in-a-matrix.json new file mode 100644 index 00000000..a3bd927d --- /dev/null +++ b/leetcode/originData/sum-in-a-matrix.json @@ -0,0 +1,161 @@ +{ + "data": { + "question": { + "questionId": "2728", + "questionFrontendId": "2679", + "boundTopicId": null, + "title": "Sum in a Matrix", + "titleSlug": "sum-in-a-matrix", + "content": "

You are given a 0-indexed 2D integer array nums. Initially, your score is 0. Perform the following operations until the matrix becomes empty:

\n\n
    \n\t
  1. From each row in the matrix, select the largest number and remove it. In the case of a tie, it does not matter which number is chosen.
  2. \n\t
  3. Identify the highest number amongst all those removed in step 1. Add that number to your score.
  4. \n
\n\n

Return the final score.

\n

 

\n

Example 1:

\n\n
\nInput: nums = [[7,2,1],[6,4,2],[6,5,3],[3,2,1]]\nOutput: 15\nExplanation: In the first operation, we remove 7, 6, 6, and 3. We then add 7 to our score. Next, we remove 2, 4, 5, and 2. We add 5 to our score. Lastly, we remove 1, 2, 3, and 1. We add 3 to our score. Thus, our final score is 7 + 5 + 3 = 15.\n
\n\n

Example 2:

\n\n
\nInput: nums = [[1]]\nOutput: 1\nExplanation: We remove 1 and add it to the answer. We return 1.
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 300
  • \n\t
  • 1 <= nums[i].length <= 500
  • \n\t
  • 0 <= nums[i][j] <= 103
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 91, + "dislikes": 19, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "[[7,2,1],[6,4,2],[6,5,3],[3,2,1]]\n[[1]]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int matrixSum(vector>& nums) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int matrixSum(int[][] nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def matrixSum(self, nums):\n \"\"\"\n :type nums: List[List[int]]\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def matrixSum(self, nums: List[List[int]]) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int matrixSum(int** nums, int numsSize, int* numsColSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MatrixSum(int[][] nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[][]} nums\n * @return {number}\n */\nvar matrixSum = function(nums) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[][]} nums\n# @return {Integer}\ndef matrix_sum(nums)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func matrixSum(_ nums: [[Int]]) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func matrixSum(nums [][]int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def matrixSum(nums: Array[Array[Int]]): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun matrixSum(nums: Array): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn matrix_sum(nums: Vec>) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[][] $nums\n * @return Integer\n */\n function matrixSum($nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function matrixSum(nums: number[][]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (matrix-sum nums)\n (-> (listof (listof exact-integer?)) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec matrix_sum(Nums :: [[integer()]]) -> integer().\nmatrix_sum(Nums) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec matrix_sum(nums :: [[integer]]) :: integer\n def matrix_sum(nums) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int matrixSum(List> nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"14.2K\", \"totalSubmission\": \"24.6K\", \"totalAcceptedRaw\": 14244, \"totalSubmissionRaw\": 24551, \"acRate\": \"58.0%\"}", + "hints": [ + "Sort the numbers in each row in decreasing order.", + "The answer is the summation of the max number in every column after sorting the rows." + ], + "solution": null, + "status": null, + "sampleTestCase": "[[7,2,1],[6,4,2],[6,5,3],[3,2,1]]", + "metaData": "{\n \"name\": \"matrixSum\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[][]\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 17 standard.

\\r\\n\\r\\n

Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\"], \"java\": [\"Java\", \"

OpenJDK 17. Java 8 features such as lambda expressions and stream API can be used.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n

Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

\"], \"python\": [\"Python\", \"

Python 2.7.12.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\\r\\n\\r\\n

Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.

\"], \"c\": [\"C\", \"

Compiled with gcc 8.2 using the gnu11 standard.

\\r\\n\\r\\n

Your code is compiled with level one optimization (-O1). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n\\r\\n

For hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:

\\r\\n\\r\\n

1. Adding an item to a hash.\\r\\n

\\r\\nstruct hash_entry {\\r\\n    int id;            /* we'll use this field as the key */\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n
\\r\\n

\\r\\n\\r\\n

2. Looking up an item in a hash:\\r\\n

\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n
\\r\\n

\\r\\n\\r\\n

3. Deleting an item in a hash:\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n
\\r\\n

\"], \"csharp\": [\"C#\", \"

C# 10 with .NET 6 runtime

\"], \"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

\\r\\n\\r\\n

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

\\r\\n\\r\\n

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"], \"racket\": [\"Racket\", \"

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

\\r\\n\\r\\n

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/throttle.json b/leetcode/originData/throttle.json new file mode 100644 index 00000000..dcfd91ec --- /dev/null +++ b/leetcode/originData/throttle.json @@ -0,0 +1,60 @@ +{ + "data": { + "question": { + "questionId": "2771", + "questionFrontendId": "2676", + "boundTopicId": null, + "title": "Throttle", + "titleSlug": "throttle", + "content": "

Given a function fn and a time in milliseconds t, return a throttled version of that function.

\n\n

A throttled function is first called without delay and then, for a time interval of t milliseconds, can't be executed but should store the latest function arguments provided to call fn with them after the end of the delay.

\n\n

For instance, t = 50ms, and the function was called at 30ms, 40ms, and 60ms. The first function call would block calling functions for the following t milliseconds. The second function call would save arguments, and the third call arguments should overwrite currently stored arguments from the second call because the second and third calls are called before 80ms. Once the delay has passed, the throttled function should be called with the latest arguments provided during the delay period, and it should also create another delay period of 80ms + t.

\n\n

\"ThrottleThe above diagram shows how throttle will transform events. Each rectangle represents 100ms and the throttle time is 400ms. Each color represents a different set of inputs.

\n\n

 

\n

Example 1:

\n\n
\nInput: t = 100, calls = [{"t":20,"inputs":[1]}]\nOutput: [{"t":20,"inputs":[1]}]\nExplanation: The 1st call is always called without delay\n
\n\n

Example 2:

\n\n
\nInput: t = 50, calls = [{"t":50,"inputs":[1]},{"t":75,"inputs":[2]}]\nOutput: [{"t":50,"inputs":[1]},{"t":100,"inputs":[2]}]\nExplanation: \nThe 1st is called a function with arguments (1) without delay.\nThe 2nd is called at 75ms, within the delay period because 50ms + 50ms = 100ms, so the next call can be reached at 100ms. Therefore, we save arguments from the 2nd call to use them at the callback of the 1st call.\n
\n\n

Example 3:

\n\n
\nInput: t = 70, calls = [{"t":50,"inputs":[1]},{"t":75,"inputs":[2]},{"t":90,"inputs":[8]},{"t": 140, "inputs":[5,7]},{"t": 300, "inputs": [9,4]}]\nOutput: [{"t":50,"inputs":[1]},{"t":120,"inputs":[8]},{"t":190,"inputs":[5,7]},{"t":300,"inputs":[9,4]}]\nExplanation: \nThe 1st is called a function with arguments (1) without delay.\nThe 2nd is called at 75ms within the delay period because 50ms + 70ms = 120ms, so it should only save arguments. \nThe 3rd is also called within the delay period, and because we need just the latest function arguments, we overwrite previous ones. After the delay period, we do a callback at 120ms with saved arguments. That callback makes another delay period of 120ms + 70ms = 190ms so that the next function can be called at 190ms.\nThe 4th is called at 140ms in the delay period, so it should be called as a callback at 190ms. That will create another delay period of 190ms + 70ms = 260ms.\nThe 5th is called at 300ms, but it is after 260ms, so it should be called immediately and should create another delay period of 300ms + 70ms = 370ms.
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 0 <= t <= 1000
  • \n\t
  • 1 <= calls.length <= 10
  • \n\t
  • 0 <= calls[i].t <= 1000
  • \n\t
  • 0 <= calls[i].inputs[i], calls[i].inputs.length <= 10
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 11, + "dislikes": 3, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Debounce\", \"titleSlug\": \"debounce\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Promise Time Limit\", \"titleSlug\": \"promise-time-limit\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Promise Pool\", \"titleSlug\": \"promise-pool\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "100\n[{\"t\":20,\"inputs\":[1]}]\n50\n[{\"t\":50,\"inputs\":[1]},{\"t\":75,\"inputs\":[2]}]\n70\n[{\"t\":50,\"inputs\":[1]},{\"t\":75,\"inputs\":[2]},{\"t\":90,\"inputs\":[8]},{\"t\": 140, \"inputs\":[5,7]},{\"t\": 300, \"inputs\": [9,4]}]", + "categoryTitle": "JavaScript", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {Function} fn\n * @param {number} t\n * @return {Function}\n */\nvar throttle = function(fn, t) {\n return function(...args) {\n\n }\n};\n\n/**\n * const throttled = throttle(console.log, 100);\n * throttled(\"log\"); // logged immediately.\n * throttled(\"log\"); // logged at t=100ms.\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "type F = (...args: any[]) => void\n\nfunction throttle(fn: F, t: number): F {\n return function (...args) {\n\n }\n};\n\n/**\n * const throttled = throttle(console.log, 100);\n * throttled(\"log\"); // logged immediately.\n * throttled(\"log\"); // logged at t=100ms.\n */", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"250\", \"totalSubmission\": \"320\", \"totalAcceptedRaw\": 250, \"totalSubmissionRaw\": 320, \"acRate\": \"78.1%\"}", + "hints": [ + "Store a variable for currArguments.", + "If no timeout is in progress, immediately execute the function and create a timeout. If a timeout is in progress, set the currArguments to the new arguments.", + "When the timeout is done: if currArguments is null, do nothing. Otherwise, execute the function with currArguments and create another timeout." + ], + "solution": null, + "status": null, + "sampleTestCase": "100\n[{\"t\":20,\"inputs\":[1]}]", + "metaData": "{\n \"name\": \"throttle\",\n \"params\": [\n {\n \"name\": \"fn\",\n \"type\": \"string\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"t\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n },\n \"languages\": [\n \"javascript\",\n \"typescript\"\n ],\n \"manual\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": false, + "envInfo": "{\"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of datastructures-js/queue.

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/problem/allow-one-function-call.html b/leetcode/problem/allow-one-function-call.html new file mode 100644 index 00000000..3381571a --- /dev/null +++ b/leetcode/problem/allow-one-function-call.html @@ -0,0 +1,39 @@ +

Given a function fn, return a new function that is identical to the original function except that it ensures fn is called at most once.

+ +
    +
  • The first time the returned function is called, it should return the same result as fn.
  • +
  • Every subsequent time it is called, it should return undefined.
  • +
+ +

 

+

Example 1:

+ +
+Input: fn = (a,b,c) => (a + b + c), calls = [[1,2,3],[2,3,6]]
+Output: [{"calls":1,"value":6}]
+Explanation:
+const onceFn = once(fn);
+onceFn(1, 2, 3); // 6
+onceFn(2, 3, 6); // undefined, fn was not called
+
+ +

Example 2:

+ +
+Input: fn = (a,b,c) => (a * b * c), calls = [[5,7,4],[2,3,6],[4,6,8]]
+Output: [{"calls":1,"value":140}]
+Explanation:
+const onceFn = once(fn);
+onceFn(5, 7, 4); // 140
+onceFn(2, 3, 6); // undefined, fn was not called
+onceFn(4, 6, 8); // undefined, fn was not called
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= calls.length <= 10
  • +
  • 1 <= calls[i].length <= 100
  • +
  • 2 <= JSON.stringify(calls).length <= 1000
  • +
diff --git a/leetcode/problem/array-of-objects-to-matrix.html b/leetcode/problem/array-of-objects-to-matrix.html new file mode 100644 index 00000000..6aae27b9 --- /dev/null +++ b/leetcode/problem/array-of-objects-to-matrix.html @@ -0,0 +1,125 @@ +

Write a function that converts an array of objects arr into a matrix m.

+ +

arr is an array of objects or arrays. Each item in the array can be deeply nested with child arrays and child objects. It can also contain numbers, strings, booleans, and null values.

+ +

The first row m should be the column names. If there is no nesting, the column names are the unique keys within the objects. If there is nesting, the column names are the respective paths in the object separated by ".".

+ +

Each of the remaining rows corresponds to an object in arr. Each value in the matrix corresponds to a value in an object. If a given object doesn't contain a value for a given column, the cell should contain an empty string "".

+ +

The colums in the matrix should be in lexographically ascending order.

+ +

 

+

Example 1:

+ +
+Input: 
+arr = [
+  {"b": 1, "a": 2},
+  {"b": 3, "a": 4}
+]
+Output: 
+[
+  ["a", "b"],
+  [2, 1],
+  [4, 3]
+]
+
+Explanation:
+There are two unique column names in the two objects: "a" and "b".
+"a" corresponds with [2, 4].
+"b" coresponds with [1, 3].
+
+ +

Example 2:

+ +
+Input: 
+arr = [
+  {"a": 1, "b": 2},
+  {"c": 3, "d": 4},
+  {}
+]
+Output: 
+[
+  ["a", "b", "c", "d"],
+  [1, 2, "", ""],
+  ["", "", 3, 4],
+  ["", "", "", ""]
+]
+
+Explanation:
+There are 4 unique column names: "a", "b", "c", "d".
+The first object has values associated with "a" and "b".
+The second object has values associated with "c" and "d".
+The third object has no keys, so it is just a row of empty strings.
+
+ +

Example 3:

+ +
+Input: 
+arr = [
+  {"a": {"b": 1, "c": 2}},
+  {"a": {"b": 3, "d": 4}}
+]
+Output: 
+[
+  ["a.b", "a.c", "a.d"],
+  [1, 2, ""],
+  [3, "", 4]
+]
+
+Explanation:
+In this example, the objects are nested. The keys represent the full path to each value separated by periods.
+There are three paths: "a.b", "a.c", "a.d".
+
+ +

Example 4:

+ +
+Input: 
+arr = [
+  [{"a": null}],
+  [{"b": true}],
+  [{"c": "x"}]
+]
+Output: 
+[
+  ["0.a", "0.b", "0.c"],
+  [null, "", ""],
+  ["", true, ""],
+  ["", "", "x"]
+]
+
+Explanation:
+Arrays are also considered objects with their keys being their indices.
+Each array has one element so the keys are "0.a", "0.b", and "0.c".
+
+ +

Example 5:

+ +
+Input: 
+arr = [
+  {},
+  {},
+  {},
+]
+Output: 
+[
+  [],
+  [],
+  [],
+  []
+]
+
+Explanation:
+There are no keys so every row is an empty array.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= arr.length <= 1000
  • +
  • unique keys <= 1000
  • +
diff --git a/leetcode/problem/chunk-array.html b/leetcode/problem/chunk-array.html new file mode 100644 index 00000000..799bc437 --- /dev/null +++ b/leetcode/problem/chunk-array.html @@ -0,0 +1,46 @@ +

Given an array arr and a chunk size size, return a chunked array. A chunked array contains the original elements in arr, but consists of subarrays each of length size. The length of the last subarray may be less than size if arr.length is not evenly divisible by size.

+ +

You may assume the array is the output of JSON.parse. In other words, it is valid JSON.

+ +

Please solve it without using lodash's _.chunk function.

+ +

 

+

Example 1:

+ +
+Input: arr = [1,2,3,4,5], size = 1
+Output: [[1],[2],[3],[4],[5]]
+Explanation: The arr has been split into subarrays each with 1 element.
+
+ +

Example 2:

+ +
+Input: arr = [1,9,6,3,2], size = 3
+Output: [[1,9,6],[3,2]]
+Explanation: The arr has been split into subarrays with 3 elements. However, only two elements are left for the 2nd subarray.
+
+ +

Example 3:

+ +
+Input: arr = [8,5,3,2,6], size = 6
+Output: [[8,5,3,2,6]]
+Explanation: Size is greater than arr.length thus all elements are in the first subarray.
+
+ +

Example 4:

+ +
+Input: arr = [], size = 1
+Output: []
+Explanation: There are no elements to be chunked so an empty array is returned.
+ +

 

+

Constraints:

+ +
    +
  • arr is a valid JSON array
  • +
  • 2 <= JSON.stringify(arr).length <= 105
  • +
  • 1 <= size <= arr.length + 1
  • +
diff --git a/leetcode/problem/count-the-number-of-complete-components.html b/leetcode/problem/count-the-number-of-complete-components.html new file mode 100644 index 00000000..8a79984b --- /dev/null +++ b/leetcode/problem/count-the-number-of-complete-components.html @@ -0,0 +1,40 @@ +

You are given an integer n. There is an undirected graph with n vertices, numbered from 0 to n - 1. You are given a 2D integer array edges where edges[i] = [ai, bi] denotes that there exists an undirected edge connecting vertices ai and bi.

+ +

Return the number of complete connected components of the graph.

+ +

A connected component is a subgraph of a graph in which there exists a path between any two vertices, and no vertex of the subgraph shares an edge with a vertex outside of the subgraph.

+ +

A connected component is said to be complete if there exists an edge between every pair of its vertices.

+ +

 

+

Example 1:

+ +

+ +
+Input: n = 6, edges = [[0,1],[0,2],[1,2],[3,4]]
+Output: 3
+Explanation: From the picture above, one can see that all of the components of this graph are complete.
+
+ +

Example 2:

+ +

+ +
+Input: n = 6, edges = [[0,1],[0,2],[1,2],[3,4],[3,5]]
+Output: 1
+Explanation: The component containing vertices 0, 1, and 2 is complete since there is an edge between every pair of two vertices. On the other hand, the component containing vertices 3, 4, and 5 is not complete since there is no edge between vertices 4 and 5. Thus, the number of complete components in this graph is 1.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 50
  • +
  • 0 <= edges.length <= n * (n - 1) / 2
  • +
  • edges[i].length == 2
  • +
  • 0 <= ai, bi <= n - 1
  • +
  • ai != bi
  • +
  • There are no repeated edges.
  • +
diff --git a/leetcode/problem/counter-ii.html b/leetcode/problem/counter-ii.html new file mode 100644 index 00000000..28454266 --- /dev/null +++ b/leetcode/problem/counter-ii.html @@ -0,0 +1,44 @@ +

Write a function createCounter. It should accept an initial integer init. It should return an object with three functions.

+ +

The three functions are:

+ +
    +
  • increment() increases the current value by 1 and then returns it.
  • +
  • decrement() reduces the current value by 1 and then returns it.
  • +
  • reset() sets the current value to init and then returns it.
  • +
+ +

 

+

Example 1:

+ +
+Input: init = 5, calls = ["increment","reset","decrement"]
+Output: [6,5,4]
+Explanation:
+const counter = createCounter(5);
+counter.increment(); // 6
+counter.reset(); // 5
+counter.decrement(); // 4
+
+ +

Example 2:

+ +
+Input: init = 0, calls = ["increment","increment","decrement","reset","reset"]
+Output: [1,2,1,0,0]
+Explanation:
+const counter = createCounter(0);
+counter.increment(); // 1
+counter.increment(); // 2
+counter.decrement(); // 1
+counter.reset(); // 0
+counter.reset(); // 0
+
+ +

 

+

Constraints:

+ +
    +
  • -1000 <= init <= 1000
  • +
  • total calls not to exceed 1000
  • +
diff --git a/leetcode/problem/create-hello-world-function.html b/leetcode/problem/create-hello-world-function.html new file mode 100644 index 00000000..e0b31568 --- /dev/null +++ b/leetcode/problem/create-hello-world-function.html @@ -0,0 +1,32 @@ +Write a function createHelloWorld. It should return a new function that always returns "Hello World". +

 

+

Example 1:

+ +
+Input: args = []
+Output: "Hello World"
+Explanation:
+const f = createHelloWorld();
+f(); // "Hello World"
+
+The function returned by createHelloWorld should always return "Hello World".
+
+ +

Example 2:

+ +
+Input: args = [{},null,42]
+Output: "Hello World"
+Explanation:
+const f = createHelloWorld();
+f({}, null, 42); // "Hello World"
+
+Any arguments could be passed to the function but it should still always return "Hello World".
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= args.length <= 10
  • +
diff --git a/leetcode/problem/find-the-distinct-difference-array.html b/leetcode/problem/find-the-distinct-difference-array.html new file mode 100644 index 00000000..ce81c325 --- /dev/null +++ b/leetcode/problem/find-the-distinct-difference-array.html @@ -0,0 +1,40 @@ +

You are given a 0-indexed array nums of length n.

+ +

The distinct difference array of nums is an array diff of length n such that diff[i] is equal to the number of distinct elements in the suffix nums[i + 1, ..., n - 1] subtracted from the number of distinct elements in the prefix nums[0, ..., i].

+ +

Return the distinct difference array of nums.

+ +

Note that nums[i, ..., j] denotes the subarray of nums starting at index i and ending at index j inclusive. Particularly, if i > j then nums[i, ..., j] denotes an empty subarray.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,3,4,5]
+Output: [-3,-1,1,3,5]
+Explanation: For index i = 0, there is 1 element in the prefix and 4 distinct elements in the suffix. Thus, diff[0] = 1 - 4 = -3.
+For index i = 1, there are 2 distinct elements in the prefix and 3 distinct elements in the suffix. Thus, diff[1] = 2 - 3 = -1.
+For index i = 2, there are 3 distinct elements in the prefix and 2 distinct elements in the suffix. Thus, diff[2] = 3 - 2 = 1.
+For index i = 3, there are 4 distinct elements in the prefix and 1 distinct element in the suffix. Thus, diff[3] = 4 - 1 = 3.
+For index i = 4, there are 5 distinct elements in the prefix and no elements in the suffix. Thus, diff[4] = 5 - 0 = 5.
+
+ +

Example 2:

+ +
+Input: nums = [3,2,3,4,2]
+Output: [-2,-1,0,2,3]
+Explanation: For index i = 0, there is 1 element in the prefix and 3 distinct elements in the suffix. Thus, diff[0] = 1 - 3 = -2.
+For index i = 1, there are 2 distinct elements in the prefix and 3 distinct elements in the suffix. Thus, diff[1] = 2 - 3 = -1.
+For index i = 2, there are 2 distinct elements in the prefix and 2 distinct elements in the suffix. Thus, diff[2] = 2 - 2 = 0.
+For index i = 3, there are 3 distinct elements in the prefix and 1 distinct element in the suffix. Thus, diff[3] = 3 - 1 = 2.
+For index i = 4, there are 3 distinct elements in the prefix and no elements in the suffix. Thus, diff[4] = 3 - 0 = 3.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n == nums.length <= 50
  • +
  • 1 <= nums[i] <= 50
  • +
diff --git a/leetcode/problem/find-the-losers-of-the-circular-game.html b/leetcode/problem/find-the-losers-of-the-circular-game.html new file mode 100644 index 00000000..86f6d28e --- /dev/null +++ b/leetcode/problem/find-the-losers-of-the-circular-game.html @@ -0,0 +1,49 @@ +

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 receives the ball.

+ +
    +
  • After that, 1st friend passes it to the friend who is k steps away from them in the clockwise direction.
  • +
  • After that, the friend who receives the ball should pass it to the friend who is 2 * k steps away from them in the clockwise direction.
  • +
  • After that, the friend who receives the ball should pass it to the friend who is 3 * k steps away from them in the clockwise direction, and so on and so forth.
  • +
+ +

In other words, on the ith turn, the friend holding the ball should pass it to the friend who is i * k steps away from them in the clockwise direction.

+ +

The game is finished when some friend receives the ball for the second time.

+ +

The losers of the game are friends who did not receive the ball in the entire game.

+ +

Given the number of friends, n, and an integer k, return the array answer, which contains the losers of the game in the ascending order.

+ +

 

+

Example 1:

+ +
+Input: n = 5, k = 2
+Output: [4,5]
+Explanation: The game goes as follows:
+1) Start at 1st friend and pass the ball to the friend who is 2 steps away from them - 3rd friend.
+2) 3rd friend passes the ball to the friend who is 4 steps away from them - 2nd friend.
+3) 2nd friend passes the ball to the friend who is 6 steps away from them  - 3rd friend.
+4) The game ends as 3rd friend receives the ball for the second time.
+
+ +

Example 2:

+ +
+Input: n = 4, k = 4
+Output: [2,3,4]
+Explanation: The game goes as follows:
+1) Start at the 1st friend and pass the ball to the friend who is 4 steps away from them - 1st friend.
+2) The game ends as 1st friend receives the ball for the second time.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= k <= n <= 50
  • +
diff --git a/leetcode/problem/frequency-tracker.html b/leetcode/problem/frequency-tracker.html new file mode 100644 index 00000000..8fd2bb62 --- /dev/null +++ b/leetcode/problem/frequency-tracker.html @@ -0,0 +1,71 @@ +

Design a data structure that keeps track of the values in it and answers some queries regarding their frequencies.

+ +

Implement the FrequencyTracker class.

+ +
    +
  • FrequencyTracker(): Initializes the FrequencyTracker object with an empty array initially.
  • +
  • void add(int number): Adds number to the data structure.
  • +
  • void deleteOne(int number): Deletes one occurence of number from the data structure. The data structure may not contain number, and in this case nothing is deleted.
  • +
  • bool hasFrequency(int frequency): Returns true if there is a number in the data structure that occurs frequency number of times, otherwise, it returns false.
  • +
+ +

 

+

Example 1:

+ +
+Input
+["FrequencyTracker", "add", "add", "hasFrequency"]
+[[], [3], [3], [2]]
+Output
+[null, null, null, true]
+
+Explanation
+FrequencyTracker frequencyTracker = new FrequencyTracker();
+frequencyTracker.add(3); // The data structure now contains [3]
+frequencyTracker.add(3); // The data structure now contains [3, 3]
+frequencyTracker.hasFrequency(2); // Returns true, because 3 occurs twice
+
+
+ +

Example 2:

+ +
+Input
+["FrequencyTracker", "add", "deleteOne", "hasFrequency"]
+[[], [1], [1], [1]]
+Output
+[null, null, null, false]
+
+Explanation
+FrequencyTracker frequencyTracker = new FrequencyTracker();
+frequencyTracker.add(1); // The data structure now contains [1]
+frequencyTracker.deleteOne(1); // The data structure becomes empty []
+frequencyTracker.hasFrequency(1); // Returns false, because the data structure is empty
+
+
+ +

Example 3:

+ +
+Input
+["FrequencyTracker", "hasFrequency", "add", "hasFrequency"]
+[[], [2], [3], [1]]
+Output
+[null, false, null, true]
+
+Explanation
+FrequencyTracker frequencyTracker = new FrequencyTracker();
+frequencyTracker.hasFrequency(2); // Returns false, because the data structure is empty
+frequencyTracker.add(3); // The data structure now contains [3]
+frequencyTracker.hasFrequency(1); // Returns true, because 3 occurs once
+
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= number <= 105
  • +
  • 1 <= frequency <= 105
  • +
  • At most, 2 * 105 calls will be made to add, deleteOne, and hasFrequency in total.
  • +
diff --git a/leetcode/problem/make-costs-of-paths-equal-in-a-binary-tree.html b/leetcode/problem/make-costs-of-paths-equal-in-a-binary-tree.html new file mode 100644 index 00000000..91fec0eb --- /dev/null +++ b/leetcode/problem/make-costs-of-paths-equal-in-a-binary-tree.html @@ -0,0 +1,45 @@ +

You are given an integer n representing the number of nodes in a perfect binary tree consisting of nodes numbered from 1 to n. The root of the tree is node 1 and each node i in the tree has two children where the left child is the node 2 * i and the right child is 2 * i + 1.

+ +

Each node in the tree also has a cost represented by a given 0-indexed integer array cost of size n where cost[i] is the cost of node i + 1. You are allowed to increment the cost of any node by 1 any number of times.

+ +

Return the minimum number of increments you need to make the cost of paths from the root to each leaf node equal.

+ +

Note:

+ +
    +
  • A perfect binary tree is a tree where each node, except the leaf nodes, has exactly 2 children.
  • +
  • The cost of a path is the sum of costs of nodes in the path.
  • +
+ +

 

+

Example 1:

+ +
+Input: n = 7, cost = [1,5,2,2,3,3,1]
+Output: 6
+Explanation: We can do the following increments:
+- Increase the cost of node 4 one time.
+- Increase the cost of node 3 three times.
+- Increase the cost of node 7 two times.
+Each path from the root to a leaf will have a total cost of 9.
+The total increments we did is 1 + 3 + 2 = 6.
+It can be shown that this is the minimum answer we can achieve.
+
+ +

Example 2:

+ +
+Input: n = 3, cost = [5,3,3]
+Output: 0
+Explanation: The two paths already have equal total costs, so no increments are needed.
+
+ +

 

+

Constraints:

+ +
    +
  • 3 <= n <= 105
  • +
  • n + 1 is a power of 2
  • +
  • cost.length == n
  • +
  • 1 <= cost[i] <= 104
  • +
diff --git a/leetcode/problem/maximum-number-of-moves-in-a-grid.html b/leetcode/problem/maximum-number-of-moves-in-a-grid.html new file mode 100644 index 00000000..ebc65fee --- /dev/null +++ b/leetcode/problem/maximum-number-of-moves-in-a-grid.html @@ -0,0 +1,41 @@ +

You are given a 0-indexed m x n matrix grid consisting of positive integers.

+ +

You can start at any cell in the first column of the matrix, and traverse the grid in the following way:

+ +
    +
  • From a cell (row, col), you can move to any of the cells: (row - 1, col + 1), (row, col + 1) and (row + 1, col + 1) such that the value of the cell you move to, should be strictly bigger than the value of the current cell.
  • +
+ +

Return the maximum number of moves that you can perform.

+ +

 

+

Example 1:

+ +
+Input: grid = [[2,4,3,5],[5,4,9,3],[3,4,2,11],[10,9,13,15]]
+Output: 3
+Explanation: We can start at the cell (0, 0) and make the following moves:
+- (0, 0) -> (0, 1).
+- (0, 1) -> (1, 2).
+- (1, 2) -> (2, 3).
+It can be shown that it is the maximum number of moves that can be made.
+ +

Example 2:

+ +
+
+Input: grid = [[3,2,4],[2,1,9],[1,1,7]]
+Output: 0
+Explanation: Starting from any cell in the first column we cannot perform any moves.
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
  • +
  • n == grid[i].length
  • +
  • 2 <= m, n <= 1000
  • +
  • 4 <= m * n <= 105
  • +
  • 1 <= grid[i][j] <= 106
  • +
diff --git a/leetcode/problem/maximum-or.html b/leetcode/problem/maximum-or.html new file mode 100644 index 00000000..0dc99823 --- /dev/null +++ b/leetcode/problem/maximum-or.html @@ -0,0 +1,31 @@ +

You are given a 0-indexed integer array nums of length n and an integer k. In an operation, you can choose an element and multiply it by 2.

+ +

Return the maximum possible value of nums[0] | nums[1] | ... | nums[n - 1] that can be obtained after applying the operation on nums at most k times.

+ +

Note that a | b denotes the bitwise or between two integers a and b.

+ +

 

+

Example 1:

+ +
+Input: nums = [12,9], k = 1
+Output: 30
+Explanation: If we apply the operation to index 1, our new array nums will be equal to [12,18]. Thus, we return the bitwise or of 12 and 18, which is 30.
+
+ +

Example 2:

+ +
+Input: nums = [8,1,2], k = 2
+Output: 35
+Explanation: If we apply the operation twice on index 0, we yield a new array of [32,1,2]. Thus, we return 32|1|2 = 35.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
  • +
  • 1 <= nums[i] <= 109
  • +
  • 1 <= k <= 15
  • +
diff --git a/leetcode/problem/neighboring-bitwise-xor.html b/leetcode/problem/neighboring-bitwise-xor.html new file mode 100644 index 00000000..9bbece66 --- /dev/null +++ b/leetcode/problem/neighboring-bitwise-xor.html @@ -0,0 +1,55 @@ +

A 0-indexed array derived with length n is derived by computing the bitwise XOR (⊕) of adjacent values in a binary array original of length n.

+ +

Specifically, for each index i in the range [0, n - 1]:

+ +
    +
  • If i = n - 1, then derived[i] = original[i] ⊕ original[0].
  • +
  • Otherwise, derived[i] = original[i] ⊕ original[i + 1].
  • +
+ +

Given an array derived, your task is to determine whether there exists a valid binary array original that could have formed derived.

+ +

Return true if such an array exists or false otherwise.

+ +
    +
  • A binary array is an array containing only 0's and 1's
  • +
+ +

 

+

Example 1:

+ +
+Input: derived = [1,1,0]
+Output: true
+Explanation: A valid original array that gives derived is [0,1,0].
+derived[0] = original[0] ⊕ original[1] = 0 ⊕ 1 = 1 
+derived[1] = original[1] ⊕ original[2] = 1 ⊕ 0 = 1
+derived[2] = original[2] ⊕ original[0] = 0 ⊕ 0 = 0
+
+ +

Example 2:

+ +
+Input: derived = [1,1]
+Output: true
+Explanation: A valid original array that gives derived is [0,1].
+derived[0] = original[0] ⊕ original[1] = 1
+derived[1] = original[1] ⊕ original[0] = 1
+
+ +

Example 3:

+ +
+Input: derived = [1,0]
+Output: false
+Explanation: There is no valid original array that gives derived.
+
+ +

 

+

Constraints:

+ +
    +
  • n == derived.length
  • +
  • 1 <= n <= 105
  • +
  • The values in derived are either 0's or 1's
  • +
diff --git a/leetcode/problem/number-of-adjacent-elements-with-the-same-color.html b/leetcode/problem/number-of-adjacent-elements-with-the-same-color.html new file mode 100644 index 00000000..d038d0dc --- /dev/null +++ b/leetcode/problem/number-of-adjacent-elements-with-the-same-color.html @@ -0,0 +1,43 @@ +

There is a 0-indexed array nums of length n. Initially, all elements are uncolored (has a value of 0).

+ +

You are given a 2D integer array queries where queries[i] = [indexi, colori].

+ +

For each query, you color the index indexi with the color colori in the array nums.

+ +

Return an array answer of the same length as queries where answer[i] is the number of adjacent elements with the same color after the ith query.

+ +

More formally, answer[i] is the number of indices j, such that 0 <= j < n - 1 and nums[j] == nums[j + 1] and nums[j] != 0 after the ith query.

+ +

 

+

Example 1:

+ +
+Input: n = 4, queries = [[0,2],[1,2],[3,1],[1,1],[2,1]]
+Output: [0,1,1,0,2]
+Explanation: Initially array nums = [0,0,0,0], where 0 denotes uncolored elements of the array.
+- After the 1st query nums = [2,0,0,0]. The count of adjacent elements with the same color is 0.
+- After the 2nd query nums = [2,2,0,0]. The count of adjacent elements with the same color is 1.
+- After the 3rd query nums = [2,2,0,1]. The count of adjacent elements with the same color is 1.
+- After the 4th query nums = [2,1,0,1]. The count of adjacent elements with the same color is 0.
+- After the 5th query nums = [2,1,1,1]. The count of adjacent elements with the same color is 2.
+
+ +

Example 2:

+ +
+Input: n = 1, queries = [[0,100000]]
+Output: [0]
+Explanation: Initially array nums = [0], where 0 denotes uncolored elements of the array.
+- After the 1st query nums = [100000]. The count of adjacent elements with the same color is 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 105
  • +
  • 1 <= queries.length <= 105
  • +
  • queries[i].length == 2
  • +
  • 0 <= indexi <= n - 1
  • +
  • 1 <=  colori <= 105
  • +
diff --git a/leetcode/problem/number-of-senior-citizens.html b/leetcode/problem/number-of-senior-citizens.html new file mode 100644 index 00000000..3a229307 --- /dev/null +++ b/leetcode/problem/number-of-senior-citizens.html @@ -0,0 +1,38 @@ +

You are given a 0-indexed array of strings details. Each element of details provides information about a given passenger compressed into a string of length 15. The system is such that:

+ +
    +
  • The first ten characters consist of the phone number of passengers.
  • +
  • The next character denotes the gender of the person.
  • +
  • The following two characters are used to indicate the age of the person.
  • +
  • The last two characters determine the seat allotted to that person.
  • +
+ +

Return the number of passengers who are strictly more than 60 years old.

+ +

 

+

Example 1:

+ +
+Input: details = ["7868190130M7522","5303914400F9211","9273338290F4010"]
+Output: 2
+Explanation: The passengers at indices 0, 1, and 2 have ages 75, 92, and 40. Thus, there are 2 people who are over 60 years old.
+
+ +

Example 2:

+ +
+Input: details = ["1313579440F2036","2921522980M5644"]
+Output: 0
+Explanation: None of the passengers are older than 60.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= details.length <= 100
  • +
  • details[i].length == 15
  • +
  • details[i] consists of digits from '0' to '9'.
  • +
  • details[i][10] is either 'M' or 'F' or 'O'.
  • +
  • The phone numbers and seat numbers of the passengers are distinct.
  • +
diff --git a/leetcode/problem/power-of-heroes.html b/leetcode/problem/power-of-heroes.html new file mode 100644 index 00000000..2f7449e5 --- /dev/null +++ b/leetcode/problem/power-of-heroes.html @@ -0,0 +1,41 @@ +

You are given a 0-indexed integer array nums representing the strength of some heroes. The power of a group of heroes is defined as follows:

+ +
    +
  • Let i0, i1, ... ,ik be the indices of the heroes in a group. Then, the power of this group is max(nums[i0], nums[i1], ... ,nums[ik])2 * min(nums[i0], nums[i1], ... ,nums[ik]).
  • +
+ +

Return the sum of the power of all non-empty groups of heroes possible. Since the sum could be very large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: nums = [2,1,4]
+Output: 141
+Explanation: 
+1st group: [2] has power = 22 * 2 = 8.
+2nd group: [1] has power = 12 * 1 = 1. 
+3rd group: [4] has power = 42 * 4 = 64. 
+4th group: [2,1] has power = 22 * 1 = 4. 
+5th group: [2,4] has power = 42 * 2 = 32. 
+6th group: [1,4] has power = 42 * 1 = 16. 
+​​​​​​​7th group: [2,1,4] has power = 42​​​​​​​ * 1 = 16. 
+The sum of powers of all groups is 8 + 1 + 64 + 4 + 32 + 16 + 16 = 141.
+
+
+ +

Example 2:

+ +
+Input: nums = [1,1,1]
+Output: 7
+Explanation: A total of 7 groups are possible, and the power of each group will be 1. Therefore, the sum of the powers of all groups is 7.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
  • +
  • 1 <= nums[i] <= 109
  • +
diff --git a/leetcode/problem/sum-in-a-matrix.html b/leetcode/problem/sum-in-a-matrix.html new file mode 100644 index 00000000..d5b08397 --- /dev/null +++ b/leetcode/problem/sum-in-a-matrix.html @@ -0,0 +1,32 @@ +

You are given a 0-indexed 2D integer array nums. Initially, your score is 0. Perform the following operations until the matrix becomes empty:

+ +
    +
  1. From each row in the matrix, select the largest number and remove it. In the case of a tie, it does not matter which number is chosen.
  2. +
  3. Identify the highest number amongst all those removed in step 1. Add that number to your score.
  4. +
+ +

Return the final score.

+

 

+

Example 1:

+ +
+Input: nums = [[7,2,1],[6,4,2],[6,5,3],[3,2,1]]
+Output: 15
+Explanation: In the first operation, we remove 7, 6, 6, and 3. We then add 7 to our score. Next, we remove 2, 4, 5, and 2. We add 5 to our score. Lastly, we remove 1, 2, 3, and 1. We add 3 to our score. Thus, our final score is 7 + 5 + 3 = 15.
+
+ +

Example 2:

+ +
+Input: nums = [[1]]
+Output: 1
+Explanation: We remove 1 and add it to the answer. We return 1.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 300
  • +
  • 1 <= nums[i].length <= 500
  • +
  • 0 <= nums[i][j] <= 103
  • +
diff --git a/leetcode/problem/throttle.html b/leetcode/problem/throttle.html new file mode 100644 index 00000000..11d47426 --- /dev/null +++ b/leetcode/problem/throttle.html @@ -0,0 +1,48 @@ +

Given a function fn and a time in milliseconds t, return a throttled version of that function.

+ +

A throttled function is first called without delay and then, for a time interval of t milliseconds, can't be executed but should store the latest function arguments provided to call fn with them after the end of the delay.

+ +

For instance, t = 50ms, and the function was called at 30ms, 40ms, and 60ms. The first function call would block calling functions for the following t milliseconds. The second function call would save arguments, and the third call arguments should overwrite currently stored arguments from the second call because the second and third calls are called before 80ms. Once the delay has passed, the throttled function should be called with the latest arguments provided during the delay period, and it should also create another delay period of 80ms + t.

+ +

Throttle DiagramThe above diagram shows how throttle will transform events. Each rectangle represents 100ms and the throttle time is 400ms. Each color represents a different set of inputs.

+ +

 

+

Example 1:

+ +
+Input: t = 100, calls = [{"t":20,"inputs":[1]}]
+Output: [{"t":20,"inputs":[1]}]
+Explanation: The 1st call is always called without delay
+
+ +

Example 2:

+ +
+Input: t = 50, calls = [{"t":50,"inputs":[1]},{"t":75,"inputs":[2]}]
+Output: [{"t":50,"inputs":[1]},{"t":100,"inputs":[2]}]
+Explanation: 
+The 1st is called a function with arguments (1) without delay.
+The 2nd is called at 75ms, within the delay period because 50ms + 50ms = 100ms, so the next call can be reached at 100ms. Therefore, we save arguments from the 2nd call to use them at the callback of the 1st call.
+
+ +

Example 3:

+ +
+Input: t = 70, calls = [{"t":50,"inputs":[1]},{"t":75,"inputs":[2]},{"t":90,"inputs":[8]},{"t": 140, "inputs":[5,7]},{"t": 300, "inputs": [9,4]}]
+Output: [{"t":50,"inputs":[1]},{"t":120,"inputs":[8]},{"t":190,"inputs":[5,7]},{"t":300,"inputs":[9,4]}]
+Explanation: 
+The 1st is called a function with arguments (1) without delay.
+The 2nd is called at 75ms within the delay period because 50ms + 70ms = 120ms, so it should only save arguments. 
+The 3rd is also called within the delay period, and because we need just the latest function arguments, we overwrite previous ones. After the delay period, we do a callback at 120ms with saved arguments. That callback makes another delay period of 120ms + 70ms = 190ms so that the next function can be called at 190ms.
+The 4th is called at 140ms in the delay period, so it should be called as a callback at 190ms. That will create another delay period of 190ms + 70ms = 260ms.
+The 5th is called at 300ms, but it is after 260ms, so it should be called immediately and should create another delay period of 300ms + 70ms = 370ms.
+ +

 

+

Constraints:

+ +
    +
  • 0 <= t <= 1000
  • +
  • 1 <= calls.length <= 10
  • +
  • 0 <= calls[i].t <= 1000
  • +
  • 0 <= calls[i].inputs[i], calls[i].inputs.length <= 10
  • +